1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-1994, 1997-2000, 2003-2005, 2007-2012 Free
4 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 #include "mi/mi-common.h"
65 #include "arch-utils.h"
66 #include "exceptions.h"
67 #include "cli/cli-utils.h"
69 /* Define whether or not the C operator '/' truncates towards zero for
70 differently signed operands (truncation direction is undefined in C).
71 Copied from valarith.c. */
73 #ifndef TRUNCATION_TOWARDS_ZERO
74 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
77 static struct type
*desc_base_type (struct type
*);
79 static struct type
*desc_bounds_type (struct type
*);
81 static struct value
*desc_bounds (struct value
*);
83 static int fat_pntr_bounds_bitpos (struct type
*);
85 static int fat_pntr_bounds_bitsize (struct type
*);
87 static struct type
*desc_data_target_type (struct type
*);
89 static struct value
*desc_data (struct value
*);
91 static int fat_pntr_data_bitpos (struct type
*);
93 static int fat_pntr_data_bitsize (struct type
*);
95 static struct value
*desc_one_bound (struct value
*, int, int);
97 static int desc_bound_bitpos (struct type
*, int, int);
99 static int desc_bound_bitsize (struct type
*, int, int);
101 static struct type
*desc_index_type (struct type
*, int);
103 static int desc_arity (struct type
*);
105 static int ada_type_match (struct type
*, struct type
*, int);
107 static int ada_args_match (struct symbol
*, struct value
**, int);
109 static int full_match (const char *, const char *);
111 static struct value
*make_array_descriptor (struct type
*, struct value
*);
113 static void ada_add_block_symbols (struct obstack
*,
114 struct block
*, const char *,
115 domain_enum
, struct objfile
*, int);
117 static int is_nonfunction (struct ada_symbol_info
*, int);
119 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
122 static int num_defns_collected (struct obstack
*);
124 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
126 static struct value
*resolve_subexp (struct expression
**, int *, int,
129 static void replace_operator_with_call (struct expression
**, int, int, int,
130 struct symbol
*, struct block
*);
132 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
134 static char *ada_op_name (enum exp_opcode
);
136 static const char *ada_decoded_op_name (enum exp_opcode
);
138 static int numeric_type_p (struct type
*);
140 static int integer_type_p (struct type
*);
142 static int scalar_type_p (struct type
*);
144 static int discrete_type_p (struct type
*);
146 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
151 static struct symbol
*find_old_style_renaming_symbol (const char *,
154 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
157 static struct value
*evaluate_subexp_type (struct expression
*, int *);
159 static struct type
*ada_find_parallel_type_with_name (struct type
*,
162 static int is_dynamic_field (struct type
*, int);
164 static struct type
*to_fixed_variant_branch_type (struct type
*,
166 CORE_ADDR
, struct value
*);
168 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
170 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
172 static struct type
*to_static_fixed_type (struct type
*);
173 static struct type
*static_unwrap_type (struct type
*type
);
175 static struct value
*unwrap_value (struct value
*);
177 static struct type
*constrained_packed_array_type (struct type
*, long *);
179 static struct type
*decode_constrained_packed_array_type (struct type
*);
181 static long decode_packed_array_bitsize (struct type
*);
183 static struct value
*decode_constrained_packed_array (struct value
*);
185 static int ada_is_packed_array_type (struct type
*);
187 static int ada_is_unconstrained_packed_array_type (struct type
*);
189 static struct value
*value_subscript_packed (struct value
*, int,
192 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
194 static struct value
*coerce_unspec_val_to_type (struct value
*,
197 static struct value
*get_var_value (char *, char *);
199 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
201 static int equiv_types (struct type
*, struct type
*);
203 static int is_name_suffix (const char *);
205 static int advance_wild_match (const char **, const char *, int);
207 static int wild_match (const char *, const char *);
209 static struct value
*ada_coerce_ref (struct value
*);
211 static LONGEST
pos_atr (struct value
*);
213 static struct value
*value_pos_atr (struct type
*, struct value
*);
215 static struct value
*value_val_atr (struct type
*, struct value
*);
217 static struct symbol
*standard_lookup (const char *, const struct block
*,
220 static struct value
*ada_search_struct_field (char *, struct value
*, int,
223 static struct value
*ada_value_primitive_field (struct value
*, int, int,
226 static int find_struct_field (const char *, struct type
*, int,
227 struct type
**, int *, int *, int *, int *);
229 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
232 static int ada_resolve_function (struct ada_symbol_info
*, int,
233 struct value
**, int, const char *,
236 static int ada_is_direct_array_type (struct type
*);
238 static void ada_language_arch_info (struct gdbarch
*,
239 struct language_arch_info
*);
241 static void check_size (const struct type
*);
243 static struct value
*ada_index_struct_field (int, struct value
*, int,
246 static struct value
*assign_aggregate (struct value
*, struct value
*,
250 static void aggregate_assign_from_choices (struct value
*, struct value
*,
252 int *, LONGEST
*, int *,
253 int, LONGEST
, LONGEST
);
255 static void aggregate_assign_positional (struct value
*, struct value
*,
257 int *, LONGEST
*, int *, int,
261 static void aggregate_assign_others (struct value
*, struct value
*,
263 int *, LONGEST
*, int, LONGEST
, LONGEST
);
266 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
269 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
272 static void ada_forward_operator_length (struct expression
*, int, int *,
275 static struct type
*ada_find_any_type (const char *name
);
279 /* Maximum-sized dynamic type. */
280 static unsigned int varsize_limit
;
282 /* FIXME: brobecker/2003-09-17: No longer a const because it is
283 returned by a function that does not return a const char *. */
284 static char *ada_completer_word_break_characters
=
286 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
288 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
291 /* The name of the symbol to use to get the name of the main subprogram. */
292 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
293 = "__gnat_ada_main_program_name";
295 /* Limit on the number of warnings to raise per expression evaluation. */
296 static int warning_limit
= 2;
298 /* Number of warning messages issued; reset to 0 by cleanups after
299 expression evaluation. */
300 static int warnings_issued
= 0;
302 static const char *known_runtime_file_name_patterns
[] = {
303 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
306 static const char *known_auxiliary_function_name_patterns
[] = {
307 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
310 /* Space for allocating results of ada_lookup_symbol_list. */
311 static struct obstack symbol_list_obstack
;
313 /* Inferior-specific data. */
315 /* Per-inferior data for this module. */
317 struct ada_inferior_data
319 /* The ada__tags__type_specific_data type, which is used when decoding
320 tagged types. With older versions of GNAT, this type was directly
321 accessible through a component ("tsd") in the object tag. But this
322 is no longer the case, so we cache it for each inferior. */
323 struct type
*tsd_type
;
325 /* The exception_support_info data. This data is used to determine
326 how to implement support for Ada exception catchpoints in a given
328 const struct exception_support_info
*exception_info
;
331 /* Our key to this module's inferior data. */
332 static const struct inferior_data
*ada_inferior_data
;
334 /* A cleanup routine for our inferior data. */
336 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
338 struct ada_inferior_data
*data
;
340 data
= inferior_data (inf
, ada_inferior_data
);
345 /* Return our inferior data for the given inferior (INF).
347 This function always returns a valid pointer to an allocated
348 ada_inferior_data structure. If INF's inferior data has not
349 been previously set, this functions creates a new one with all
350 fields set to zero, sets INF's inferior to it, and then returns
351 a pointer to that newly allocated ada_inferior_data. */
353 static struct ada_inferior_data
*
354 get_ada_inferior_data (struct inferior
*inf
)
356 struct ada_inferior_data
*data
;
358 data
= inferior_data (inf
, ada_inferior_data
);
361 data
= XZALLOC (struct ada_inferior_data
);
362 set_inferior_data (inf
, ada_inferior_data
, data
);
368 /* Perform all necessary cleanups regarding our module's inferior data
369 that is required after the inferior INF just exited. */
372 ada_inferior_exit (struct inferior
*inf
)
374 ada_inferior_data_cleanup (inf
, NULL
);
375 set_inferior_data (inf
, ada_inferior_data
, NULL
);
380 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
381 all typedef layers have been peeled. Otherwise, return TYPE.
383 Normally, we really expect a typedef type to only have 1 typedef layer.
384 In other words, we really expect the target type of a typedef type to be
385 a non-typedef type. This is particularly true for Ada units, because
386 the language does not have a typedef vs not-typedef distinction.
387 In that respect, the Ada compiler has been trying to eliminate as many
388 typedef definitions in the debugging information, since they generally
389 do not bring any extra information (we still use typedef under certain
390 circumstances related mostly to the GNAT encoding).
392 Unfortunately, we have seen situations where the debugging information
393 generated by the compiler leads to such multiple typedef layers. For
394 instance, consider the following example with stabs:
396 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
397 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
399 This is an error in the debugging information which causes type
400 pck__float_array___XUP to be defined twice, and the second time,
401 it is defined as a typedef of a typedef.
403 This is on the fringe of legality as far as debugging information is
404 concerned, and certainly unexpected. But it is easy to handle these
405 situations correctly, so we can afford to be lenient in this case. */
408 ada_typedef_target_type (struct type
*type
)
410 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
411 type
= TYPE_TARGET_TYPE (type
);
415 /* Given DECODED_NAME a string holding a symbol name in its
416 decoded form (ie using the Ada dotted notation), returns
417 its unqualified name. */
420 ada_unqualified_name (const char *decoded_name
)
422 const char *result
= strrchr (decoded_name
, '.');
425 result
++; /* Skip the dot... */
427 result
= decoded_name
;
432 /* Return a string starting with '<', followed by STR, and '>'.
433 The result is good until the next call. */
436 add_angle_brackets (const char *str
)
438 static char *result
= NULL
;
441 result
= xstrprintf ("<%s>", str
);
446 ada_get_gdb_completer_word_break_characters (void)
448 return ada_completer_word_break_characters
;
451 /* Print an array element index using the Ada syntax. */
454 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
455 const struct value_print_options
*options
)
457 LA_VALUE_PRINT (index_value
, stream
, options
);
458 fprintf_filtered (stream
, " => ");
461 /* Assuming VECT points to an array of *SIZE objects of size
462 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
463 updating *SIZE as necessary and returning the (new) array. */
466 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
468 if (*size
< min_size
)
471 if (*size
< min_size
)
473 vect
= xrealloc (vect
, *size
* element_size
);
478 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
479 suffix of FIELD_NAME beginning "___". */
482 field_name_match (const char *field_name
, const char *target
)
484 int len
= strlen (target
);
487 (strncmp (field_name
, target
, len
) == 0
488 && (field_name
[len
] == '\0'
489 || (strncmp (field_name
+ len
, "___", 3) == 0
490 && strcmp (field_name
+ strlen (field_name
) - 6,
495 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
496 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
497 and return its index. This function also handles fields whose name
498 have ___ suffixes because the compiler sometimes alters their name
499 by adding such a suffix to represent fields with certain constraints.
500 If the field could not be found, return a negative number if
501 MAYBE_MISSING is set. Otherwise raise an error. */
504 ada_get_field_index (const struct type
*type
, const char *field_name
,
508 struct type
*struct_type
= check_typedef ((struct type
*) type
);
510 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
511 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
515 error (_("Unable to find field %s in struct %s. Aborting"),
516 field_name
, TYPE_NAME (struct_type
));
521 /* The length of the prefix of NAME prior to any "___" suffix. */
524 ada_name_prefix_len (const char *name
)
530 const char *p
= strstr (name
, "___");
533 return strlen (name
);
539 /* Return non-zero if SUFFIX is a suffix of STR.
540 Return zero if STR is null. */
543 is_suffix (const char *str
, const char *suffix
)
550 len2
= strlen (suffix
);
551 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
554 /* The contents of value VAL, treated as a value of type TYPE. The
555 result is an lval in memory if VAL is. */
557 static struct value
*
558 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
560 type
= ada_check_typedef (type
);
561 if (value_type (val
) == type
)
565 struct value
*result
;
567 /* Make sure that the object size is not unreasonable before
568 trying to allocate some memory for it. */
572 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
573 result
= allocate_value_lazy (type
);
576 result
= allocate_value (type
);
577 memcpy (value_contents_raw (result
), value_contents (val
),
580 set_value_component_location (result
, val
);
581 set_value_bitsize (result
, value_bitsize (val
));
582 set_value_bitpos (result
, value_bitpos (val
));
583 set_value_address (result
, value_address (val
));
588 static const gdb_byte
*
589 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
594 return valaddr
+ offset
;
598 cond_offset_target (CORE_ADDR address
, long offset
)
603 return address
+ offset
;
606 /* Issue a warning (as for the definition of warning in utils.c, but
607 with exactly one argument rather than ...), unless the limit on the
608 number of warnings has passed during the evaluation of the current
611 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
612 provided by "complaint". */
613 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
616 lim_warning (const char *format
, ...)
620 va_start (args
, format
);
621 warnings_issued
+= 1;
622 if (warnings_issued
<= warning_limit
)
623 vwarning (format
, args
);
628 /* Issue an error if the size of an object of type T is unreasonable,
629 i.e. if it would be a bad idea to allocate a value of this type in
633 check_size (const struct type
*type
)
635 if (TYPE_LENGTH (type
) > varsize_limit
)
636 error (_("object size is larger than varsize-limit"));
639 /* Maximum value of a SIZE-byte signed integer type. */
641 max_of_size (int size
)
643 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
645 return top_bit
| (top_bit
- 1);
648 /* Minimum value of a SIZE-byte signed integer type. */
650 min_of_size (int size
)
652 return -max_of_size (size
) - 1;
655 /* Maximum value of a SIZE-byte unsigned integer type. */
657 umax_of_size (int size
)
659 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
661 return top_bit
| (top_bit
- 1);
664 /* Maximum value of integral type T, as a signed quantity. */
666 max_of_type (struct type
*t
)
668 if (TYPE_UNSIGNED (t
))
669 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
671 return max_of_size (TYPE_LENGTH (t
));
674 /* Minimum value of integral type T, as a signed quantity. */
676 min_of_type (struct type
*t
)
678 if (TYPE_UNSIGNED (t
))
681 return min_of_size (TYPE_LENGTH (t
));
684 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
686 ada_discrete_type_high_bound (struct type
*type
)
688 switch (TYPE_CODE (type
))
690 case TYPE_CODE_RANGE
:
691 return TYPE_HIGH_BOUND (type
);
693 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
698 return max_of_type (type
);
700 error (_("Unexpected type in ada_discrete_type_high_bound."));
704 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
706 ada_discrete_type_low_bound (struct type
*type
)
708 switch (TYPE_CODE (type
))
710 case TYPE_CODE_RANGE
:
711 return TYPE_LOW_BOUND (type
);
713 return TYPE_FIELD_BITPOS (type
, 0);
718 return min_of_type (type
);
720 error (_("Unexpected type in ada_discrete_type_low_bound."));
724 /* The identity on non-range types. For range types, the underlying
725 non-range scalar type. */
728 get_base_type (struct type
*type
)
730 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
732 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
734 type
= TYPE_TARGET_TYPE (type
);
739 /* Return a decoded version of the given VALUE. This means returning
740 a value whose type is obtained by applying all the GNAT-specific
741 encondings, making the resulting type a static but standard description
742 of the initial type. */
745 ada_get_decoded_value (struct value
*value
)
747 struct type
*type
= ada_check_typedef (value_type (value
));
749 if (ada_is_array_descriptor_type (type
)
750 || (ada_is_constrained_packed_array_type (type
)
751 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
753 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
754 value
= ada_coerce_to_simple_array_ptr (value
);
756 value
= ada_coerce_to_simple_array (value
);
759 value
= ada_to_fixed_value (value
);
764 /* Same as ada_get_decoded_value, but with the given TYPE.
765 Because there is no associated actual value for this type,
766 the resulting type might be a best-effort approximation in
767 the case of dynamic types. */
770 ada_get_decoded_type (struct type
*type
)
772 type
= to_static_fixed_type (type
);
773 if (ada_is_constrained_packed_array_type (type
))
774 type
= ada_coerce_to_simple_array_type (type
);
780 /* Language Selection */
782 /* If the main program is in Ada, return language_ada, otherwise return LANG
783 (the main program is in Ada iif the adainit symbol is found). */
786 ada_update_initial_language (enum language lang
)
788 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
789 (struct objfile
*) NULL
) != NULL
)
795 /* If the main procedure is written in Ada, then return its name.
796 The result is good until the next call. Return NULL if the main
797 procedure doesn't appear to be in Ada. */
802 struct minimal_symbol
*msym
;
803 static char *main_program_name
= NULL
;
805 /* For Ada, the name of the main procedure is stored in a specific
806 string constant, generated by the binder. Look for that symbol,
807 extract its address, and then read that string. If we didn't find
808 that string, then most probably the main procedure is not written
810 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
814 CORE_ADDR main_program_name_addr
;
817 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
818 if (main_program_name_addr
== 0)
819 error (_("Invalid address for Ada main program name."));
821 xfree (main_program_name
);
822 target_read_string (main_program_name_addr
, &main_program_name
,
827 return main_program_name
;
830 /* The main procedure doesn't seem to be in Ada. */
836 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
839 const struct ada_opname_map ada_opname_table
[] = {
840 {"Oadd", "\"+\"", BINOP_ADD
},
841 {"Osubtract", "\"-\"", BINOP_SUB
},
842 {"Omultiply", "\"*\"", BINOP_MUL
},
843 {"Odivide", "\"/\"", BINOP_DIV
},
844 {"Omod", "\"mod\"", BINOP_MOD
},
845 {"Orem", "\"rem\"", BINOP_REM
},
846 {"Oexpon", "\"**\"", BINOP_EXP
},
847 {"Olt", "\"<\"", BINOP_LESS
},
848 {"Ole", "\"<=\"", BINOP_LEQ
},
849 {"Ogt", "\">\"", BINOP_GTR
},
850 {"Oge", "\">=\"", BINOP_GEQ
},
851 {"Oeq", "\"=\"", BINOP_EQUAL
},
852 {"One", "\"/=\"", BINOP_NOTEQUAL
},
853 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
854 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
855 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
856 {"Oconcat", "\"&\"", BINOP_CONCAT
},
857 {"Oabs", "\"abs\"", UNOP_ABS
},
858 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
859 {"Oadd", "\"+\"", UNOP_PLUS
},
860 {"Osubtract", "\"-\"", UNOP_NEG
},
864 /* The "encoded" form of DECODED, according to GNAT conventions.
865 The result is valid until the next call to ada_encode. */
868 ada_encode (const char *decoded
)
870 static char *encoding_buffer
= NULL
;
871 static size_t encoding_buffer_size
= 0;
878 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
879 2 * strlen (decoded
) + 10);
882 for (p
= decoded
; *p
!= '\0'; p
+= 1)
886 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
891 const struct ada_opname_map
*mapping
;
893 for (mapping
= ada_opname_table
;
894 mapping
->encoded
!= NULL
895 && strncmp (mapping
->decoded
, p
,
896 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
898 if (mapping
->encoded
== NULL
)
899 error (_("invalid Ada operator name: %s"), p
);
900 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
901 k
+= strlen (mapping
->encoded
);
906 encoding_buffer
[k
] = *p
;
911 encoding_buffer
[k
] = '\0';
912 return encoding_buffer
;
915 /* Return NAME folded to lower case, or, if surrounded by single
916 quotes, unfolded, but with the quotes stripped away. Result good
920 ada_fold_name (const char *name
)
922 static char *fold_buffer
= NULL
;
923 static size_t fold_buffer_size
= 0;
925 int len
= strlen (name
);
926 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
930 strncpy (fold_buffer
, name
+ 1, len
- 2);
931 fold_buffer
[len
- 2] = '\000';
937 for (i
= 0; i
<= len
; i
+= 1)
938 fold_buffer
[i
] = tolower (name
[i
]);
944 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
947 is_lower_alphanum (const char c
)
949 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
952 /* ENCODED is the linkage name of a symbol and LEN contains its length.
953 This function saves in LEN the length of that same symbol name but
954 without either of these suffixes:
960 These are suffixes introduced by the compiler for entities such as
961 nested subprogram for instance, in order to avoid name clashes.
962 They do not serve any purpose for the debugger. */
965 ada_remove_trailing_digits (const char *encoded
, int *len
)
967 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
971 while (i
> 0 && isdigit (encoded
[i
]))
973 if (i
>= 0 && encoded
[i
] == '.')
975 else if (i
>= 0 && encoded
[i
] == '$')
977 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
979 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
984 /* Remove the suffix introduced by the compiler for protected object
988 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
990 /* Remove trailing N. */
992 /* Protected entry subprograms are broken into two
993 separate subprograms: The first one is unprotected, and has
994 a 'N' suffix; the second is the protected version, and has
995 the 'P' suffix. The second calls the first one after handling
996 the protection. Since the P subprograms are internally generated,
997 we leave these names undecoded, giving the user a clue that this
998 entity is internal. */
1001 && encoded
[*len
- 1] == 'N'
1002 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1006 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1009 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1013 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1016 if (encoded
[i
] != 'X')
1022 if (isalnum (encoded
[i
-1]))
1026 /* If ENCODED follows the GNAT entity encoding conventions, then return
1027 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1028 replaced by ENCODED.
1030 The resulting string is valid until the next call of ada_decode.
1031 If the string is unchanged by decoding, the original string pointer
1035 ada_decode (const char *encoded
)
1042 static char *decoding_buffer
= NULL
;
1043 static size_t decoding_buffer_size
= 0;
1045 /* The name of the Ada main procedure starts with "_ada_".
1046 This prefix is not part of the decoded name, so skip this part
1047 if we see this prefix. */
1048 if (strncmp (encoded
, "_ada_", 5) == 0)
1051 /* If the name starts with '_', then it is not a properly encoded
1052 name, so do not attempt to decode it. Similarly, if the name
1053 starts with '<', the name should not be decoded. */
1054 if (encoded
[0] == '_' || encoded
[0] == '<')
1057 len0
= strlen (encoded
);
1059 ada_remove_trailing_digits (encoded
, &len0
);
1060 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1062 /* Remove the ___X.* suffix if present. Do not forget to verify that
1063 the suffix is located before the current "end" of ENCODED. We want
1064 to avoid re-matching parts of ENCODED that have previously been
1065 marked as discarded (by decrementing LEN0). */
1066 p
= strstr (encoded
, "___");
1067 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1075 /* Remove any trailing TKB suffix. It tells us that this symbol
1076 is for the body of a task, but that information does not actually
1077 appear in the decoded name. */
1079 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1082 /* Remove any trailing TB suffix. The TB suffix is slightly different
1083 from the TKB suffix because it is used for non-anonymous task
1086 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1089 /* Remove trailing "B" suffixes. */
1090 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1092 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1095 /* Make decoded big enough for possible expansion by operator name. */
1097 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1098 decoded
= decoding_buffer
;
1100 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1102 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1105 while ((i
>= 0 && isdigit (encoded
[i
]))
1106 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1108 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1110 else if (encoded
[i
] == '$')
1114 /* The first few characters that are not alphabetic are not part
1115 of any encoding we use, so we can copy them over verbatim. */
1117 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1118 decoded
[j
] = encoded
[i
];
1123 /* Is this a symbol function? */
1124 if (at_start_name
&& encoded
[i
] == 'O')
1128 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1130 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1131 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1133 && !isalnum (encoded
[i
+ op_len
]))
1135 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1138 j
+= strlen (ada_opname_table
[k
].decoded
);
1142 if (ada_opname_table
[k
].encoded
!= NULL
)
1147 /* Replace "TK__" with "__", which will eventually be translated
1148 into "." (just below). */
1150 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1153 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1154 be translated into "." (just below). These are internal names
1155 generated for anonymous blocks inside which our symbol is nested. */
1157 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1158 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1159 && isdigit (encoded
[i
+4]))
1163 while (k
< len0
&& isdigit (encoded
[k
]))
1164 k
++; /* Skip any extra digit. */
1166 /* Double-check that the "__B_{DIGITS}+" sequence we found
1167 is indeed followed by "__". */
1168 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1172 /* Remove _E{DIGITS}+[sb] */
1174 /* Just as for protected object subprograms, there are 2 categories
1175 of subprograms created by the compiler for each entry. The first
1176 one implements the actual entry code, and has a suffix following
1177 the convention above; the second one implements the barrier and
1178 uses the same convention as above, except that the 'E' is replaced
1181 Just as above, we do not decode the name of barrier functions
1182 to give the user a clue that the code he is debugging has been
1183 internally generated. */
1185 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1186 && isdigit (encoded
[i
+2]))
1190 while (k
< len0
&& isdigit (encoded
[k
]))
1194 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1197 /* Just as an extra precaution, make sure that if this
1198 suffix is followed by anything else, it is a '_'.
1199 Otherwise, we matched this sequence by accident. */
1201 || (k
< len0
&& encoded
[k
] == '_'))
1206 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1207 the GNAT front-end in protected object subprograms. */
1210 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1212 /* Backtrack a bit up until we reach either the begining of
1213 the encoded name, or "__". Make sure that we only find
1214 digits or lowercase characters. */
1215 const char *ptr
= encoded
+ i
- 1;
1217 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1220 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1224 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1226 /* This is a X[bn]* sequence not separated from the previous
1227 part of the name with a non-alpha-numeric character (in other
1228 words, immediately following an alpha-numeric character), then
1229 verify that it is placed at the end of the encoded name. If
1230 not, then the encoding is not valid and we should abort the
1231 decoding. Otherwise, just skip it, it is used in body-nested
1235 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1239 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1241 /* Replace '__' by '.'. */
1249 /* It's a character part of the decoded name, so just copy it
1251 decoded
[j
] = encoded
[i
];
1256 decoded
[j
] = '\000';
1258 /* Decoded names should never contain any uppercase character.
1259 Double-check this, and abort the decoding if we find one. */
1261 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1262 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1265 if (strcmp (decoded
, encoded
) == 0)
1271 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1272 decoded
= decoding_buffer
;
1273 if (encoded
[0] == '<')
1274 strcpy (decoded
, encoded
);
1276 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1281 /* Table for keeping permanent unique copies of decoded names. Once
1282 allocated, names in this table are never released. While this is a
1283 storage leak, it should not be significant unless there are massive
1284 changes in the set of decoded names in successive versions of a
1285 symbol table loaded during a single session. */
1286 static struct htab
*decoded_names_store
;
1288 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1289 in the language-specific part of GSYMBOL, if it has not been
1290 previously computed. Tries to save the decoded name in the same
1291 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1292 in any case, the decoded symbol has a lifetime at least that of
1294 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1295 const, but nevertheless modified to a semantically equivalent form
1296 when a decoded name is cached in it. */
1299 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1302 (char **) &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1304 if (*resultp
== NULL
)
1306 const char *decoded
= ada_decode (gsymbol
->name
);
1308 if (gsymbol
->obj_section
!= NULL
)
1310 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1312 *resultp
= obsavestring (decoded
, strlen (decoded
),
1313 &objf
->objfile_obstack
);
1315 /* Sometimes, we can't find a corresponding objfile, in which
1316 case, we put the result on the heap. Since we only decode
1317 when needed, we hope this usually does not cause a
1318 significant memory leak (FIXME). */
1319 if (*resultp
== NULL
)
1321 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1325 *slot
= xstrdup (decoded
);
1334 ada_la_decode (const char *encoded
, int options
)
1336 return xstrdup (ada_decode (encoded
));
1339 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1340 suffixes that encode debugging information or leading _ada_ on
1341 SYM_NAME (see is_name_suffix commentary for the debugging
1342 information that is ignored). If WILD, then NAME need only match a
1343 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1344 either argument is NULL. */
1347 match_name (const char *sym_name
, const char *name
, int wild
)
1349 if (sym_name
== NULL
|| name
== NULL
)
1352 return wild_match (sym_name
, name
) == 0;
1355 int len_name
= strlen (name
);
1357 return (strncmp (sym_name
, name
, len_name
) == 0
1358 && is_name_suffix (sym_name
+ len_name
))
1359 || (strncmp (sym_name
, "_ada_", 5) == 0
1360 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1361 && is_name_suffix (sym_name
+ len_name
+ 5));
1368 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1369 generated by the GNAT compiler to describe the index type used
1370 for each dimension of an array, check whether it follows the latest
1371 known encoding. If not, fix it up to conform to the latest encoding.
1372 Otherwise, do nothing. This function also does nothing if
1373 INDEX_DESC_TYPE is NULL.
1375 The GNAT encoding used to describle the array index type evolved a bit.
1376 Initially, the information would be provided through the name of each
1377 field of the structure type only, while the type of these fields was
1378 described as unspecified and irrelevant. The debugger was then expected
1379 to perform a global type lookup using the name of that field in order
1380 to get access to the full index type description. Because these global
1381 lookups can be very expensive, the encoding was later enhanced to make
1382 the global lookup unnecessary by defining the field type as being
1383 the full index type description.
1385 The purpose of this routine is to allow us to support older versions
1386 of the compiler by detecting the use of the older encoding, and by
1387 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1388 we essentially replace each field's meaningless type by the associated
1392 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1396 if (index_desc_type
== NULL
)
1398 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1400 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1401 to check one field only, no need to check them all). If not, return
1404 If our INDEX_DESC_TYPE was generated using the older encoding,
1405 the field type should be a meaningless integer type whose name
1406 is not equal to the field name. */
1407 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1408 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1409 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1412 /* Fixup each field of INDEX_DESC_TYPE. */
1413 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1415 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1416 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1419 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1423 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1425 static char *bound_name
[] = {
1426 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1427 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1430 /* Maximum number of array dimensions we are prepared to handle. */
1432 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1435 /* The desc_* routines return primitive portions of array descriptors
1438 /* The descriptor or array type, if any, indicated by TYPE; removes
1439 level of indirection, if needed. */
1441 static struct type
*
1442 desc_base_type (struct type
*type
)
1446 type
= ada_check_typedef (type
);
1447 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1448 type
= ada_typedef_target_type (type
);
1451 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1452 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1453 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1458 /* True iff TYPE indicates a "thin" array pointer type. */
1461 is_thin_pntr (struct type
*type
)
1464 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1465 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1468 /* The descriptor type for thin pointer type TYPE. */
1470 static struct type
*
1471 thin_descriptor_type (struct type
*type
)
1473 struct type
*base_type
= desc_base_type (type
);
1475 if (base_type
== NULL
)
1477 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1481 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1483 if (alt_type
== NULL
)
1490 /* A pointer to the array data for thin-pointer value VAL. */
1492 static struct value
*
1493 thin_data_pntr (struct value
*val
)
1495 struct type
*type
= ada_check_typedef (value_type (val
));
1496 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1498 data_type
= lookup_pointer_type (data_type
);
1500 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1501 return value_cast (data_type
, value_copy (val
));
1503 return value_from_longest (data_type
, value_address (val
));
1506 /* True iff TYPE indicates a "thick" array pointer type. */
1509 is_thick_pntr (struct type
*type
)
1511 type
= desc_base_type (type
);
1512 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1513 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1516 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1517 pointer to one, the type of its bounds data; otherwise, NULL. */
1519 static struct type
*
1520 desc_bounds_type (struct type
*type
)
1524 type
= desc_base_type (type
);
1528 else if (is_thin_pntr (type
))
1530 type
= thin_descriptor_type (type
);
1533 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1535 return ada_check_typedef (r
);
1537 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1539 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1541 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1546 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1547 one, a pointer to its bounds data. Otherwise NULL. */
1549 static struct value
*
1550 desc_bounds (struct value
*arr
)
1552 struct type
*type
= ada_check_typedef (value_type (arr
));
1554 if (is_thin_pntr (type
))
1556 struct type
*bounds_type
=
1557 desc_bounds_type (thin_descriptor_type (type
));
1560 if (bounds_type
== NULL
)
1561 error (_("Bad GNAT array descriptor"));
1563 /* NOTE: The following calculation is not really kosher, but
1564 since desc_type is an XVE-encoded type (and shouldn't be),
1565 the correct calculation is a real pain. FIXME (and fix GCC). */
1566 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1567 addr
= value_as_long (arr
);
1569 addr
= value_address (arr
);
1572 value_from_longest (lookup_pointer_type (bounds_type
),
1573 addr
- TYPE_LENGTH (bounds_type
));
1576 else if (is_thick_pntr (type
))
1578 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1579 _("Bad GNAT array descriptor"));
1580 struct type
*p_bounds_type
= value_type (p_bounds
);
1583 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1585 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1587 if (TYPE_STUB (target_type
))
1588 p_bounds
= value_cast (lookup_pointer_type
1589 (ada_check_typedef (target_type
)),
1593 error (_("Bad GNAT array descriptor"));
1601 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1602 position of the field containing the address of the bounds data. */
1605 fat_pntr_bounds_bitpos (struct type
*type
)
1607 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1610 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1611 size of the field containing the address of the bounds data. */
1614 fat_pntr_bounds_bitsize (struct type
*type
)
1616 type
= desc_base_type (type
);
1618 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1619 return TYPE_FIELD_BITSIZE (type
, 1);
1621 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1624 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1625 pointer to one, the type of its array data (a array-with-no-bounds type);
1626 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1629 static struct type
*
1630 desc_data_target_type (struct type
*type
)
1632 type
= desc_base_type (type
);
1634 /* NOTE: The following is bogus; see comment in desc_bounds. */
1635 if (is_thin_pntr (type
))
1636 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1637 else if (is_thick_pntr (type
))
1639 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1642 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1643 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1649 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1652 static struct value
*
1653 desc_data (struct value
*arr
)
1655 struct type
*type
= value_type (arr
);
1657 if (is_thin_pntr (type
))
1658 return thin_data_pntr (arr
);
1659 else if (is_thick_pntr (type
))
1660 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1661 _("Bad GNAT array descriptor"));
1667 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1668 position of the field containing the address of the data. */
1671 fat_pntr_data_bitpos (struct type
*type
)
1673 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1676 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1677 size of the field containing the address of the data. */
1680 fat_pntr_data_bitsize (struct type
*type
)
1682 type
= desc_base_type (type
);
1684 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1685 return TYPE_FIELD_BITSIZE (type
, 0);
1687 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1690 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1691 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1692 bound, if WHICH is 1. The first bound is I=1. */
1694 static struct value
*
1695 desc_one_bound (struct value
*bounds
, int i
, int which
)
1697 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1698 _("Bad GNAT array descriptor bounds"));
1701 /* If BOUNDS is an array-bounds structure type, return the bit position
1702 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1703 bound, if WHICH is 1. The first bound is I=1. */
1706 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1708 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1711 /* If BOUNDS is an array-bounds structure type, return the bit field size
1712 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1713 bound, if WHICH is 1. The first bound is I=1. */
1716 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1718 type
= desc_base_type (type
);
1720 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1721 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1723 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1726 /* If TYPE is the type of an array-bounds structure, the type of its
1727 Ith bound (numbering from 1). Otherwise, NULL. */
1729 static struct type
*
1730 desc_index_type (struct type
*type
, int i
)
1732 type
= desc_base_type (type
);
1734 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1735 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1740 /* The number of index positions in the array-bounds type TYPE.
1741 Return 0 if TYPE is NULL. */
1744 desc_arity (struct type
*type
)
1746 type
= desc_base_type (type
);
1749 return TYPE_NFIELDS (type
) / 2;
1753 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1754 an array descriptor type (representing an unconstrained array
1758 ada_is_direct_array_type (struct type
*type
)
1762 type
= ada_check_typedef (type
);
1763 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1764 || ada_is_array_descriptor_type (type
));
1767 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1771 ada_is_array_type (struct type
*type
)
1774 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1775 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1776 type
= TYPE_TARGET_TYPE (type
);
1777 return ada_is_direct_array_type (type
);
1780 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1783 ada_is_simple_array_type (struct type
*type
)
1787 type
= ada_check_typedef (type
);
1788 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1789 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1790 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1791 == TYPE_CODE_ARRAY
));
1794 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1797 ada_is_array_descriptor_type (struct type
*type
)
1799 struct type
*data_type
= desc_data_target_type (type
);
1803 type
= ada_check_typedef (type
);
1804 return (data_type
!= NULL
1805 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1806 && desc_arity (desc_bounds_type (type
)) > 0);
1809 /* Non-zero iff type is a partially mal-formed GNAT array
1810 descriptor. FIXME: This is to compensate for some problems with
1811 debugging output from GNAT. Re-examine periodically to see if it
1815 ada_is_bogus_array_descriptor (struct type
*type
)
1819 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1820 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1821 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1822 && !ada_is_array_descriptor_type (type
);
1826 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1827 (fat pointer) returns the type of the array data described---specifically,
1828 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1829 in from the descriptor; otherwise, they are left unspecified. If
1830 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1831 returns NULL. The result is simply the type of ARR if ARR is not
1834 ada_type_of_array (struct value
*arr
, int bounds
)
1836 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1837 return decode_constrained_packed_array_type (value_type (arr
));
1839 if (!ada_is_array_descriptor_type (value_type (arr
)))
1840 return value_type (arr
);
1844 struct type
*array_type
=
1845 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1847 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1848 TYPE_FIELD_BITSIZE (array_type
, 0) =
1849 decode_packed_array_bitsize (value_type (arr
));
1855 struct type
*elt_type
;
1857 struct value
*descriptor
;
1859 elt_type
= ada_array_element_type (value_type (arr
), -1);
1860 arity
= ada_array_arity (value_type (arr
));
1862 if (elt_type
== NULL
|| arity
== 0)
1863 return ada_check_typedef (value_type (arr
));
1865 descriptor
= desc_bounds (arr
);
1866 if (value_as_long (descriptor
) == 0)
1870 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1871 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1872 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1873 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1876 create_range_type (range_type
, value_type (low
),
1877 longest_to_int (value_as_long (low
)),
1878 longest_to_int (value_as_long (high
)));
1879 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1881 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1883 /* We need to store the element packed bitsize, as well as
1884 recompute the array size, because it was previously
1885 computed based on the unpacked element size. */
1886 LONGEST lo
= value_as_long (low
);
1887 LONGEST hi
= value_as_long (high
);
1889 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1890 decode_packed_array_bitsize (value_type (arr
));
1891 /* If the array has no element, then the size is already
1892 zero, and does not need to be recomputed. */
1896 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1898 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1903 return lookup_pointer_type (elt_type
);
1907 /* If ARR does not represent an array, returns ARR unchanged.
1908 Otherwise, returns either a standard GDB array with bounds set
1909 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1910 GDB array. Returns NULL if ARR is a null fat pointer. */
1913 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1915 if (ada_is_array_descriptor_type (value_type (arr
)))
1917 struct type
*arrType
= ada_type_of_array (arr
, 1);
1919 if (arrType
== NULL
)
1921 return value_cast (arrType
, value_copy (desc_data (arr
)));
1923 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1924 return decode_constrained_packed_array (arr
);
1929 /* If ARR does not represent an array, returns ARR unchanged.
1930 Otherwise, returns a standard GDB array describing ARR (which may
1931 be ARR itself if it already is in the proper form). */
1934 ada_coerce_to_simple_array (struct value
*arr
)
1936 if (ada_is_array_descriptor_type (value_type (arr
)))
1938 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1941 error (_("Bounds unavailable for null array pointer."));
1942 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1943 return value_ind (arrVal
);
1945 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1946 return decode_constrained_packed_array (arr
);
1951 /* If TYPE represents a GNAT array type, return it translated to an
1952 ordinary GDB array type (possibly with BITSIZE fields indicating
1953 packing). For other types, is the identity. */
1956 ada_coerce_to_simple_array_type (struct type
*type
)
1958 if (ada_is_constrained_packed_array_type (type
))
1959 return decode_constrained_packed_array_type (type
);
1961 if (ada_is_array_descriptor_type (type
))
1962 return ada_check_typedef (desc_data_target_type (type
));
1967 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1970 ada_is_packed_array_type (struct type
*type
)
1974 type
= desc_base_type (type
);
1975 type
= ada_check_typedef (type
);
1977 ada_type_name (type
) != NULL
1978 && strstr (ada_type_name (type
), "___XP") != NULL
;
1981 /* Non-zero iff TYPE represents a standard GNAT constrained
1982 packed-array type. */
1985 ada_is_constrained_packed_array_type (struct type
*type
)
1987 return ada_is_packed_array_type (type
)
1988 && !ada_is_array_descriptor_type (type
);
1991 /* Non-zero iff TYPE represents an array descriptor for a
1992 unconstrained packed-array type. */
1995 ada_is_unconstrained_packed_array_type (struct type
*type
)
1997 return ada_is_packed_array_type (type
)
1998 && ada_is_array_descriptor_type (type
);
2001 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2002 return the size of its elements in bits. */
2005 decode_packed_array_bitsize (struct type
*type
)
2007 const char *raw_name
;
2011 /* Access to arrays implemented as fat pointers are encoded as a typedef
2012 of the fat pointer type. We need the name of the fat pointer type
2013 to do the decoding, so strip the typedef layer. */
2014 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2015 type
= ada_typedef_target_type (type
);
2017 raw_name
= ada_type_name (ada_check_typedef (type
));
2019 raw_name
= ada_type_name (desc_base_type (type
));
2024 tail
= strstr (raw_name
, "___XP");
2025 gdb_assert (tail
!= NULL
);
2027 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2030 (_("could not understand bit size information on packed array"));
2037 /* Given that TYPE is a standard GDB array type with all bounds filled
2038 in, and that the element size of its ultimate scalar constituents
2039 (that is, either its elements, or, if it is an array of arrays, its
2040 elements' elements, etc.) is *ELT_BITS, return an identical type,
2041 but with the bit sizes of its elements (and those of any
2042 constituent arrays) recorded in the BITSIZE components of its
2043 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2046 static struct type
*
2047 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2049 struct type
*new_elt_type
;
2050 struct type
*new_type
;
2051 struct type
*index_type_desc
;
2052 struct type
*index_type
;
2053 LONGEST low_bound
, high_bound
;
2055 type
= ada_check_typedef (type
);
2056 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2059 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2060 if (index_type_desc
)
2061 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2064 index_type
= TYPE_INDEX_TYPE (type
);
2066 new_type
= alloc_type_copy (type
);
2068 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2070 create_array_type (new_type
, new_elt_type
, index_type
);
2071 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2072 TYPE_NAME (new_type
) = ada_type_name (type
);
2074 if (get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2075 low_bound
= high_bound
= 0;
2076 if (high_bound
< low_bound
)
2077 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2080 *elt_bits
*= (high_bound
- low_bound
+ 1);
2081 TYPE_LENGTH (new_type
) =
2082 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2085 TYPE_FIXED_INSTANCE (new_type
) = 1;
2089 /* The array type encoded by TYPE, where
2090 ada_is_constrained_packed_array_type (TYPE). */
2092 static struct type
*
2093 decode_constrained_packed_array_type (struct type
*type
)
2095 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2098 struct type
*shadow_type
;
2102 raw_name
= ada_type_name (desc_base_type (type
));
2107 name
= (char *) alloca (strlen (raw_name
) + 1);
2108 tail
= strstr (raw_name
, "___XP");
2109 type
= desc_base_type (type
);
2111 memcpy (name
, raw_name
, tail
- raw_name
);
2112 name
[tail
- raw_name
] = '\000';
2114 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2116 if (shadow_type
== NULL
)
2118 lim_warning (_("could not find bounds information on packed array"));
2121 CHECK_TYPEDEF (shadow_type
);
2123 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2125 lim_warning (_("could not understand bounds "
2126 "information on packed array"));
2130 bits
= decode_packed_array_bitsize (type
);
2131 return constrained_packed_array_type (shadow_type
, &bits
);
2134 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2135 array, returns a simple array that denotes that array. Its type is a
2136 standard GDB array type except that the BITSIZEs of the array
2137 target types are set to the number of bits in each element, and the
2138 type length is set appropriately. */
2140 static struct value
*
2141 decode_constrained_packed_array (struct value
*arr
)
2145 arr
= ada_coerce_ref (arr
);
2147 /* If our value is a pointer, then dererence it. Make sure that
2148 this operation does not cause the target type to be fixed, as
2149 this would indirectly cause this array to be decoded. The rest
2150 of the routine assumes that the array hasn't been decoded yet,
2151 so we use the basic "value_ind" routine to perform the dereferencing,
2152 as opposed to using "ada_value_ind". */
2153 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2154 arr
= value_ind (arr
);
2156 type
= decode_constrained_packed_array_type (value_type (arr
));
2159 error (_("can't unpack array"));
2163 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2164 && ada_is_modular_type (value_type (arr
)))
2166 /* This is a (right-justified) modular type representing a packed
2167 array with no wrapper. In order to interpret the value through
2168 the (left-justified) packed array type we just built, we must
2169 first left-justify it. */
2170 int bit_size
, bit_pos
;
2173 mod
= ada_modulus (value_type (arr
)) - 1;
2180 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2181 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2182 bit_pos
/ HOST_CHAR_BIT
,
2183 bit_pos
% HOST_CHAR_BIT
,
2188 return coerce_unspec_val_to_type (arr
, type
);
2192 /* The value of the element of packed array ARR at the ARITY indices
2193 given in IND. ARR must be a simple array. */
2195 static struct value
*
2196 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2199 int bits
, elt_off
, bit_off
;
2200 long elt_total_bit_offset
;
2201 struct type
*elt_type
;
2205 elt_total_bit_offset
= 0;
2206 elt_type
= ada_check_typedef (value_type (arr
));
2207 for (i
= 0; i
< arity
; i
+= 1)
2209 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2210 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2212 (_("attempt to do packed indexing of "
2213 "something other than a packed array"));
2216 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2217 LONGEST lowerbound
, upperbound
;
2220 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2222 lim_warning (_("don't know bounds of array"));
2223 lowerbound
= upperbound
= 0;
2226 idx
= pos_atr (ind
[i
]);
2227 if (idx
< lowerbound
|| idx
> upperbound
)
2228 lim_warning (_("packed array index %ld out of bounds"),
2230 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2231 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2232 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2235 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2236 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2238 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2243 /* Non-zero iff TYPE includes negative integer values. */
2246 has_negatives (struct type
*type
)
2248 switch (TYPE_CODE (type
))
2253 return !TYPE_UNSIGNED (type
);
2254 case TYPE_CODE_RANGE
:
2255 return TYPE_LOW_BOUND (type
) < 0;
2260 /* Create a new value of type TYPE from the contents of OBJ starting
2261 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2262 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2263 assigning through the result will set the field fetched from.
2264 VALADDR is ignored unless OBJ is NULL, in which case,
2265 VALADDR+OFFSET must address the start of storage containing the
2266 packed value. The value returned in this case is never an lval.
2267 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2270 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2271 long offset
, int bit_offset
, int bit_size
,
2275 int src
, /* Index into the source area */
2276 targ
, /* Index into the target area */
2277 srcBitsLeft
, /* Number of source bits left to move */
2278 nsrc
, ntarg
, /* Number of source and target bytes */
2279 unusedLS
, /* Number of bits in next significant
2280 byte of source that are unused */
2281 accumSize
; /* Number of meaningful bits in accum */
2282 unsigned char *bytes
; /* First byte containing data to unpack */
2283 unsigned char *unpacked
;
2284 unsigned long accum
; /* Staging area for bits being transferred */
2286 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2287 /* Transmit bytes from least to most significant; delta is the direction
2288 the indices move. */
2289 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2291 type
= ada_check_typedef (type
);
2295 v
= allocate_value (type
);
2296 bytes
= (unsigned char *) (valaddr
+ offset
);
2298 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2301 value_address (obj
) + offset
);
2302 bytes
= (unsigned char *) alloca (len
);
2303 read_memory (value_address (v
), bytes
, len
);
2307 v
= allocate_value (type
);
2308 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2315 set_value_component_location (v
, obj
);
2316 new_addr
= value_address (obj
) + offset
;
2317 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2318 set_value_bitsize (v
, bit_size
);
2319 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2322 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2324 set_value_address (v
, new_addr
);
2327 set_value_bitsize (v
, bit_size
);
2328 unpacked
= (unsigned char *) value_contents (v
);
2330 srcBitsLeft
= bit_size
;
2332 ntarg
= TYPE_LENGTH (type
);
2336 memset (unpacked
, 0, TYPE_LENGTH (type
));
2339 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2342 if (has_negatives (type
)
2343 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2347 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2350 switch (TYPE_CODE (type
))
2352 case TYPE_CODE_ARRAY
:
2353 case TYPE_CODE_UNION
:
2354 case TYPE_CODE_STRUCT
:
2355 /* Non-scalar values must be aligned at a byte boundary... */
2357 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2358 /* ... And are placed at the beginning (most-significant) bytes
2360 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2365 targ
= TYPE_LENGTH (type
) - 1;
2371 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2374 unusedLS
= bit_offset
;
2377 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2384 /* Mask for removing bits of the next source byte that are not
2385 part of the value. */
2386 unsigned int unusedMSMask
=
2387 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2389 /* Sign-extend bits for this byte. */
2390 unsigned int signMask
= sign
& ~unusedMSMask
;
2393 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2394 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2395 if (accumSize
>= HOST_CHAR_BIT
)
2397 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2398 accumSize
-= HOST_CHAR_BIT
;
2399 accum
>>= HOST_CHAR_BIT
;
2403 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2410 accum
|= sign
<< accumSize
;
2411 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2412 accumSize
-= HOST_CHAR_BIT
;
2413 accum
>>= HOST_CHAR_BIT
;
2421 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2422 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2425 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2426 int src_offset
, int n
, int bits_big_endian_p
)
2428 unsigned int accum
, mask
;
2429 int accum_bits
, chunk_size
;
2431 target
+= targ_offset
/ HOST_CHAR_BIT
;
2432 targ_offset
%= HOST_CHAR_BIT
;
2433 source
+= src_offset
/ HOST_CHAR_BIT
;
2434 src_offset
%= HOST_CHAR_BIT
;
2435 if (bits_big_endian_p
)
2437 accum
= (unsigned char) *source
;
2439 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2445 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2446 accum_bits
+= HOST_CHAR_BIT
;
2448 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2451 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2452 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2455 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2457 accum_bits
-= chunk_size
;
2464 accum
= (unsigned char) *source
>> src_offset
;
2466 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2470 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2471 accum_bits
+= HOST_CHAR_BIT
;
2473 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2476 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2477 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2479 accum_bits
-= chunk_size
;
2480 accum
>>= chunk_size
;
2487 /* Store the contents of FROMVAL into the location of TOVAL.
2488 Return a new value with the location of TOVAL and contents of
2489 FROMVAL. Handles assignment into packed fields that have
2490 floating-point or non-scalar types. */
2492 static struct value
*
2493 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2495 struct type
*type
= value_type (toval
);
2496 int bits
= value_bitsize (toval
);
2498 toval
= ada_coerce_ref (toval
);
2499 fromval
= ada_coerce_ref (fromval
);
2501 if (ada_is_direct_array_type (value_type (toval
)))
2502 toval
= ada_coerce_to_simple_array (toval
);
2503 if (ada_is_direct_array_type (value_type (fromval
)))
2504 fromval
= ada_coerce_to_simple_array (fromval
);
2506 if (!deprecated_value_modifiable (toval
))
2507 error (_("Left operand of assignment is not a modifiable lvalue."));
2509 if (VALUE_LVAL (toval
) == lval_memory
2511 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2512 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2514 int len
= (value_bitpos (toval
)
2515 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2517 char *buffer
= (char *) alloca (len
);
2519 CORE_ADDR to_addr
= value_address (toval
);
2521 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2522 fromval
= value_cast (type
, fromval
);
2524 read_memory (to_addr
, buffer
, len
);
2525 from_size
= value_bitsize (fromval
);
2527 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2528 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2529 move_bits (buffer
, value_bitpos (toval
),
2530 value_contents (fromval
), from_size
- bits
, bits
, 1);
2532 move_bits (buffer
, value_bitpos (toval
),
2533 value_contents (fromval
), 0, bits
, 0);
2534 write_memory (to_addr
, buffer
, len
);
2535 observer_notify_memory_changed (to_addr
, len
, buffer
);
2537 val
= value_copy (toval
);
2538 memcpy (value_contents_raw (val
), value_contents (fromval
),
2539 TYPE_LENGTH (type
));
2540 deprecated_set_value_type (val
, type
);
2545 return value_assign (toval
, fromval
);
2549 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2550 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2551 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2552 * COMPONENT, and not the inferior's memory. The current contents
2553 * of COMPONENT are ignored. */
2555 value_assign_to_component (struct value
*container
, struct value
*component
,
2558 LONGEST offset_in_container
=
2559 (LONGEST
) (value_address (component
) - value_address (container
));
2560 int bit_offset_in_container
=
2561 value_bitpos (component
) - value_bitpos (container
);
2564 val
= value_cast (value_type (component
), val
);
2566 if (value_bitsize (component
) == 0)
2567 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2569 bits
= value_bitsize (component
);
2571 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2572 move_bits (value_contents_writeable (container
) + offset_in_container
,
2573 value_bitpos (container
) + bit_offset_in_container
,
2574 value_contents (val
),
2575 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2578 move_bits (value_contents_writeable (container
) + offset_in_container
,
2579 value_bitpos (container
) + bit_offset_in_container
,
2580 value_contents (val
), 0, bits
, 0);
2583 /* The value of the element of array ARR at the ARITY indices given in IND.
2584 ARR may be either a simple array, GNAT array descriptor, or pointer
2588 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2592 struct type
*elt_type
;
2594 elt
= ada_coerce_to_simple_array (arr
);
2596 elt_type
= ada_check_typedef (value_type (elt
));
2597 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2598 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2599 return value_subscript_packed (elt
, arity
, ind
);
2601 for (k
= 0; k
< arity
; k
+= 1)
2603 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2604 error (_("too many subscripts (%d expected)"), k
);
2605 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2610 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2611 value of the element of *ARR at the ARITY indices given in
2612 IND. Does not read the entire array into memory. */
2614 static struct value
*
2615 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2620 for (k
= 0; k
< arity
; k
+= 1)
2624 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2625 error (_("too many subscripts (%d expected)"), k
);
2626 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2628 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2629 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2630 type
= TYPE_TARGET_TYPE (type
);
2633 return value_ind (arr
);
2636 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2637 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2638 elements starting at index LOW. The lower bound of this array is LOW, as
2640 static struct value
*
2641 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2644 struct type
*type0
= ada_check_typedef (type
);
2645 CORE_ADDR base
= value_as_address (array_ptr
)
2646 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2647 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2648 struct type
*index_type
=
2649 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2651 struct type
*slice_type
=
2652 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2654 return value_at_lazy (slice_type
, base
);
2658 static struct value
*
2659 ada_value_slice (struct value
*array
, int low
, int high
)
2661 struct type
*type
= ada_check_typedef (value_type (array
));
2662 struct type
*index_type
=
2663 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2664 struct type
*slice_type
=
2665 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2667 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2670 /* If type is a record type in the form of a standard GNAT array
2671 descriptor, returns the number of dimensions for type. If arr is a
2672 simple array, returns the number of "array of"s that prefix its
2673 type designation. Otherwise, returns 0. */
2676 ada_array_arity (struct type
*type
)
2683 type
= desc_base_type (type
);
2686 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2687 return desc_arity (desc_bounds_type (type
));
2689 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2692 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2698 /* If TYPE is a record type in the form of a standard GNAT array
2699 descriptor or a simple array type, returns the element type for
2700 TYPE after indexing by NINDICES indices, or by all indices if
2701 NINDICES is -1. Otherwise, returns NULL. */
2704 ada_array_element_type (struct type
*type
, int nindices
)
2706 type
= desc_base_type (type
);
2708 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2711 struct type
*p_array_type
;
2713 p_array_type
= desc_data_target_type (type
);
2715 k
= ada_array_arity (type
);
2719 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2720 if (nindices
>= 0 && k
> nindices
)
2722 while (k
> 0 && p_array_type
!= NULL
)
2724 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2727 return p_array_type
;
2729 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2731 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2733 type
= TYPE_TARGET_TYPE (type
);
2742 /* The type of nth index in arrays of given type (n numbering from 1).
2743 Does not examine memory. Throws an error if N is invalid or TYPE
2744 is not an array type. NAME is the name of the Ada attribute being
2745 evaluated ('range, 'first, 'last, or 'length); it is used in building
2746 the error message. */
2748 static struct type
*
2749 ada_index_type (struct type
*type
, int n
, const char *name
)
2751 struct type
*result_type
;
2753 type
= desc_base_type (type
);
2755 if (n
< 0 || n
> ada_array_arity (type
))
2756 error (_("invalid dimension number to '%s"), name
);
2758 if (ada_is_simple_array_type (type
))
2762 for (i
= 1; i
< n
; i
+= 1)
2763 type
= TYPE_TARGET_TYPE (type
);
2764 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2765 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2766 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2767 perhaps stabsread.c would make more sense. */
2768 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2773 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2774 if (result_type
== NULL
)
2775 error (_("attempt to take bound of something that is not an array"));
2781 /* Given that arr is an array type, returns the lower bound of the
2782 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2783 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2784 array-descriptor type. It works for other arrays with bounds supplied
2785 by run-time quantities other than discriminants. */
2788 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2790 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2793 gdb_assert (which
== 0 || which
== 1);
2795 if (ada_is_constrained_packed_array_type (arr_type
))
2796 arr_type
= decode_constrained_packed_array_type (arr_type
);
2798 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2799 return (LONGEST
) - which
;
2801 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2802 type
= TYPE_TARGET_TYPE (arr_type
);
2807 for (i
= n
; i
> 1; i
--)
2808 elt_type
= TYPE_TARGET_TYPE (type
);
2810 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2811 ada_fixup_array_indexes_type (index_type_desc
);
2812 if (index_type_desc
!= NULL
)
2813 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2816 index_type
= TYPE_INDEX_TYPE (elt_type
);
2819 (LONGEST
) (which
== 0
2820 ? ada_discrete_type_low_bound (index_type
)
2821 : ada_discrete_type_high_bound (index_type
));
2824 /* Given that arr is an array value, returns the lower bound of the
2825 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2826 WHICH is 1. This routine will also work for arrays with bounds
2827 supplied by run-time quantities other than discriminants. */
2830 ada_array_bound (struct value
*arr
, int n
, int which
)
2832 struct type
*arr_type
= value_type (arr
);
2834 if (ada_is_constrained_packed_array_type (arr_type
))
2835 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2836 else if (ada_is_simple_array_type (arr_type
))
2837 return ada_array_bound_from_type (arr_type
, n
, which
);
2839 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2842 /* Given that arr is an array value, returns the length of the
2843 nth index. This routine will also work for arrays with bounds
2844 supplied by run-time quantities other than discriminants.
2845 Does not work for arrays indexed by enumeration types with representation
2846 clauses at the moment. */
2849 ada_array_length (struct value
*arr
, int n
)
2851 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2853 if (ada_is_constrained_packed_array_type (arr_type
))
2854 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2856 if (ada_is_simple_array_type (arr_type
))
2857 return (ada_array_bound_from_type (arr_type
, n
, 1)
2858 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2860 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2861 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2864 /* An empty array whose type is that of ARR_TYPE (an array type),
2865 with bounds LOW to LOW-1. */
2867 static struct value
*
2868 empty_array (struct type
*arr_type
, int low
)
2870 struct type
*arr_type0
= ada_check_typedef (arr_type
);
2871 struct type
*index_type
=
2872 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)),
2874 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
2876 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2880 /* Name resolution */
2882 /* The "decoded" name for the user-definable Ada operator corresponding
2886 ada_decoded_op_name (enum exp_opcode op
)
2890 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2892 if (ada_opname_table
[i
].op
== op
)
2893 return ada_opname_table
[i
].decoded
;
2895 error (_("Could not find operator name for opcode"));
2899 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2900 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2901 undefined namespace) and converts operators that are
2902 user-defined into appropriate function calls. If CONTEXT_TYPE is
2903 non-null, it provides a preferred result type [at the moment, only
2904 type void has any effect---causing procedures to be preferred over
2905 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2906 return type is preferred. May change (expand) *EXP. */
2909 resolve (struct expression
**expp
, int void_context_p
)
2911 struct type
*context_type
= NULL
;
2915 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2917 resolve_subexp (expp
, &pc
, 1, context_type
);
2920 /* Resolve the operator of the subexpression beginning at
2921 position *POS of *EXPP. "Resolving" consists of replacing
2922 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2923 with their resolutions, replacing built-in operators with
2924 function calls to user-defined operators, where appropriate, and,
2925 when DEPROCEDURE_P is non-zero, converting function-valued variables
2926 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2927 are as in ada_resolve, above. */
2929 static struct value
*
2930 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2931 struct type
*context_type
)
2935 struct expression
*exp
; /* Convenience: == *expp. */
2936 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2937 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2938 int nargs
; /* Number of operands. */
2945 /* Pass one: resolve operands, saving their types and updating *pos,
2950 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2951 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2956 resolve_subexp (expp
, pos
, 0, NULL
);
2958 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2963 resolve_subexp (expp
, pos
, 0, NULL
);
2968 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2971 case OP_ATR_MODULUS
:
2981 case TERNOP_IN_RANGE
:
2982 case BINOP_IN_BOUNDS
:
2988 case OP_DISCRETE_RANGE
:
2990 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2999 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3001 resolve_subexp (expp
, pos
, 1, NULL
);
3003 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3020 case BINOP_LOGICAL_AND
:
3021 case BINOP_LOGICAL_OR
:
3022 case BINOP_BITWISE_AND
:
3023 case BINOP_BITWISE_IOR
:
3024 case BINOP_BITWISE_XOR
:
3027 case BINOP_NOTEQUAL
:
3034 case BINOP_SUBSCRIPT
:
3042 case UNOP_LOGICAL_NOT
:
3058 case OP_INTERNALVAR
:
3068 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3071 case STRUCTOP_STRUCT
:
3072 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3085 error (_("Unexpected operator during name resolution"));
3088 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3089 for (i
= 0; i
< nargs
; i
+= 1)
3090 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3094 /* Pass two: perform any resolution on principal operator. */
3101 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3103 struct ada_symbol_info
*candidates
;
3107 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3108 (exp
->elts
[pc
+ 2].symbol
),
3109 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3112 if (n_candidates
> 1)
3114 /* Types tend to get re-introduced locally, so if there
3115 are any local symbols that are not types, first filter
3118 for (j
= 0; j
< n_candidates
; j
+= 1)
3119 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3124 case LOC_REGPARM_ADDR
:
3132 if (j
< n_candidates
)
3135 while (j
< n_candidates
)
3137 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3139 candidates
[j
] = candidates
[n_candidates
- 1];
3148 if (n_candidates
== 0)
3149 error (_("No definition found for %s"),
3150 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3151 else if (n_candidates
== 1)
3153 else if (deprocedure_p
3154 && !is_nonfunction (candidates
, n_candidates
))
3156 i
= ada_resolve_function
3157 (candidates
, n_candidates
, NULL
, 0,
3158 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3161 error (_("Could not find a match for %s"),
3162 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3166 printf_filtered (_("Multiple matches for %s\n"),
3167 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3168 user_select_syms (candidates
, n_candidates
, 1);
3172 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3173 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3174 if (innermost_block
== NULL
3175 || contained_in (candidates
[i
].block
, innermost_block
))
3176 innermost_block
= candidates
[i
].block
;
3180 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3183 replace_operator_with_call (expp
, pc
, 0, 0,
3184 exp
->elts
[pc
+ 2].symbol
,
3185 exp
->elts
[pc
+ 1].block
);
3192 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3193 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3195 struct ada_symbol_info
*candidates
;
3199 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3200 (exp
->elts
[pc
+ 5].symbol
),
3201 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3203 if (n_candidates
== 1)
3207 i
= ada_resolve_function
3208 (candidates
, n_candidates
,
3210 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3213 error (_("Could not find a match for %s"),
3214 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3217 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3218 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3219 if (innermost_block
== NULL
3220 || contained_in (candidates
[i
].block
, innermost_block
))
3221 innermost_block
= candidates
[i
].block
;
3232 case BINOP_BITWISE_AND
:
3233 case BINOP_BITWISE_IOR
:
3234 case BINOP_BITWISE_XOR
:
3236 case BINOP_NOTEQUAL
:
3244 case UNOP_LOGICAL_NOT
:
3246 if (possible_user_operator_p (op
, argvec
))
3248 struct ada_symbol_info
*candidates
;
3252 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3253 (struct block
*) NULL
, VAR_DOMAIN
,
3255 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3256 ada_decoded_op_name (op
), NULL
);
3260 replace_operator_with_call (expp
, pc
, nargs
, 1,
3261 candidates
[i
].sym
, candidates
[i
].block
);
3272 return evaluate_subexp_type (exp
, pos
);
3275 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3276 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3278 /* The term "match" here is rather loose. The match is heuristic and
3282 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3284 ftype
= ada_check_typedef (ftype
);
3285 atype
= ada_check_typedef (atype
);
3287 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3288 ftype
= TYPE_TARGET_TYPE (ftype
);
3289 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3290 atype
= TYPE_TARGET_TYPE (atype
);
3292 switch (TYPE_CODE (ftype
))
3295 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3297 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3298 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3299 TYPE_TARGET_TYPE (atype
), 0);
3302 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3304 case TYPE_CODE_ENUM
:
3305 case TYPE_CODE_RANGE
:
3306 switch (TYPE_CODE (atype
))
3309 case TYPE_CODE_ENUM
:
3310 case TYPE_CODE_RANGE
:
3316 case TYPE_CODE_ARRAY
:
3317 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3318 || ada_is_array_descriptor_type (atype
));
3320 case TYPE_CODE_STRUCT
:
3321 if (ada_is_array_descriptor_type (ftype
))
3322 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3323 || ada_is_array_descriptor_type (atype
));
3325 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3326 && !ada_is_array_descriptor_type (atype
));
3328 case TYPE_CODE_UNION
:
3330 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3334 /* Return non-zero if the formals of FUNC "sufficiently match" the
3335 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3336 may also be an enumeral, in which case it is treated as a 0-
3337 argument function. */
3340 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3343 struct type
*func_type
= SYMBOL_TYPE (func
);
3345 if (SYMBOL_CLASS (func
) == LOC_CONST
3346 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3347 return (n_actuals
== 0);
3348 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3351 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3354 for (i
= 0; i
< n_actuals
; i
+= 1)
3356 if (actuals
[i
] == NULL
)
3360 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3362 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3364 if (!ada_type_match (ftype
, atype
, 1))
3371 /* False iff function type FUNC_TYPE definitely does not produce a value
3372 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3373 FUNC_TYPE is not a valid function type with a non-null return type
3374 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3377 return_match (struct type
*func_type
, struct type
*context_type
)
3379 struct type
*return_type
;
3381 if (func_type
== NULL
)
3384 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3385 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3387 return_type
= get_base_type (func_type
);
3388 if (return_type
== NULL
)
3391 context_type
= get_base_type (context_type
);
3393 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3394 return context_type
== NULL
|| return_type
== context_type
;
3395 else if (context_type
== NULL
)
3396 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3398 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3402 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3403 function (if any) that matches the types of the NARGS arguments in
3404 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3405 that returns that type, then eliminate matches that don't. If
3406 CONTEXT_TYPE is void and there is at least one match that does not
3407 return void, eliminate all matches that do.
3409 Asks the user if there is more than one match remaining. Returns -1
3410 if there is no such symbol or none is selected. NAME is used
3411 solely for messages. May re-arrange and modify SYMS in
3412 the process; the index returned is for the modified vector. */
3415 ada_resolve_function (struct ada_symbol_info syms
[],
3416 int nsyms
, struct value
**args
, int nargs
,
3417 const char *name
, struct type
*context_type
)
3421 int m
; /* Number of hits */
3424 /* In the first pass of the loop, we only accept functions matching
3425 context_type. If none are found, we add a second pass of the loop
3426 where every function is accepted. */
3427 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3429 for (k
= 0; k
< nsyms
; k
+= 1)
3431 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3433 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3434 && (fallback
|| return_match (type
, context_type
)))
3446 printf_filtered (_("Multiple matches for %s\n"), name
);
3447 user_select_syms (syms
, m
, 1);
3453 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3454 in a listing of choices during disambiguation (see sort_choices, below).
3455 The idea is that overloadings of a subprogram name from the
3456 same package should sort in their source order. We settle for ordering
3457 such symbols by their trailing number (__N or $N). */
3460 encoded_ordered_before (const char *N0
, const char *N1
)
3464 else if (N0
== NULL
)
3470 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3472 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3474 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3475 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3480 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3483 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3485 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3486 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3488 return (strcmp (N0
, N1
) < 0);
3492 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3496 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3500 for (i
= 1; i
< nsyms
; i
+= 1)
3502 struct ada_symbol_info sym
= syms
[i
];
3505 for (j
= i
- 1; j
>= 0; j
-= 1)
3507 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3508 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3510 syms
[j
+ 1] = syms
[j
];
3516 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3517 by asking the user (if necessary), returning the number selected,
3518 and setting the first elements of SYMS items. Error if no symbols
3521 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3522 to be re-integrated one of these days. */
3525 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3528 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3530 int first_choice
= (max_results
== 1) ? 1 : 2;
3531 const char *select_mode
= multiple_symbols_select_mode ();
3533 if (max_results
< 1)
3534 error (_("Request to select 0 symbols!"));
3538 if (select_mode
== multiple_symbols_cancel
)
3540 canceled because the command is ambiguous\n\
3541 See set/show multiple-symbol."));
3543 /* If select_mode is "all", then return all possible symbols.
3544 Only do that if more than one symbol can be selected, of course.
3545 Otherwise, display the menu as usual. */
3546 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3549 printf_unfiltered (_("[0] cancel\n"));
3550 if (max_results
> 1)
3551 printf_unfiltered (_("[1] all\n"));
3553 sort_choices (syms
, nsyms
);
3555 for (i
= 0; i
< nsyms
; i
+= 1)
3557 if (syms
[i
].sym
== NULL
)
3560 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3562 struct symtab_and_line sal
=
3563 find_function_start_sal (syms
[i
].sym
, 1);
3565 if (sal
.symtab
== NULL
)
3566 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3568 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3571 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3572 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3573 sal
.symtab
->filename
, sal
.line
);
3579 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3580 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3581 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3582 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3584 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3585 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3587 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3588 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3589 else if (is_enumeral
3590 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3592 printf_unfiltered (("[%d] "), i
+ first_choice
);
3593 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3595 printf_unfiltered (_("'(%s) (enumeral)\n"),
3596 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3598 else if (symtab
!= NULL
)
3599 printf_unfiltered (is_enumeral
3600 ? _("[%d] %s in %s (enumeral)\n")
3601 : _("[%d] %s at %s:?\n"),
3603 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3606 printf_unfiltered (is_enumeral
3607 ? _("[%d] %s (enumeral)\n")
3608 : _("[%d] %s at ?\n"),
3610 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3614 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3617 for (i
= 0; i
< n_chosen
; i
+= 1)
3618 syms
[i
] = syms
[chosen
[i
]];
3623 /* Read and validate a set of numeric choices from the user in the
3624 range 0 .. N_CHOICES-1. Place the results in increasing
3625 order in CHOICES[0 .. N-1], and return N.
3627 The user types choices as a sequence of numbers on one line
3628 separated by blanks, encoding them as follows:
3630 + A choice of 0 means to cancel the selection, throwing an error.
3631 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3632 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3634 The user is not allowed to choose more than MAX_RESULTS values.
3636 ANNOTATION_SUFFIX, if present, is used to annotate the input
3637 prompts (for use with the -f switch). */
3640 get_selections (int *choices
, int n_choices
, int max_results
,
3641 int is_all_choice
, char *annotation_suffix
)
3646 int first_choice
= is_all_choice
? 2 : 1;
3648 prompt
= getenv ("PS2");
3652 args
= command_line_input (prompt
, 0, annotation_suffix
);
3655 error_no_arg (_("one or more choice numbers"));
3659 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3660 order, as given in args. Choices are validated. */
3666 args
= skip_spaces (args
);
3667 if (*args
== '\0' && n_chosen
== 0)
3668 error_no_arg (_("one or more choice numbers"));
3669 else if (*args
== '\0')
3672 choice
= strtol (args
, &args2
, 10);
3673 if (args
== args2
|| choice
< 0
3674 || choice
> n_choices
+ first_choice
- 1)
3675 error (_("Argument must be choice number"));
3679 error (_("cancelled"));
3681 if (choice
< first_choice
)
3683 n_chosen
= n_choices
;
3684 for (j
= 0; j
< n_choices
; j
+= 1)
3688 choice
-= first_choice
;
3690 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3694 if (j
< 0 || choice
!= choices
[j
])
3698 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3699 choices
[k
+ 1] = choices
[k
];
3700 choices
[j
+ 1] = choice
;
3705 if (n_chosen
> max_results
)
3706 error (_("Select no more than %d of the above"), max_results
);
3711 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3712 on the function identified by SYM and BLOCK, and taking NARGS
3713 arguments. Update *EXPP as needed to hold more space. */
3716 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3717 int oplen
, struct symbol
*sym
,
3718 struct block
*block
)
3720 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3721 symbol, -oplen for operator being replaced). */
3722 struct expression
*newexp
= (struct expression
*)
3723 xzalloc (sizeof (struct expression
)
3724 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3725 struct expression
*exp
= *expp
;
3727 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3728 newexp
->language_defn
= exp
->language_defn
;
3729 newexp
->gdbarch
= exp
->gdbarch
;
3730 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3731 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3732 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3734 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3735 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3737 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3738 newexp
->elts
[pc
+ 4].block
= block
;
3739 newexp
->elts
[pc
+ 5].symbol
= sym
;
3745 /* Type-class predicates */
3747 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3751 numeric_type_p (struct type
*type
)
3757 switch (TYPE_CODE (type
))
3762 case TYPE_CODE_RANGE
:
3763 return (type
== TYPE_TARGET_TYPE (type
)
3764 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3771 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3774 integer_type_p (struct type
*type
)
3780 switch (TYPE_CODE (type
))
3784 case TYPE_CODE_RANGE
:
3785 return (type
== TYPE_TARGET_TYPE (type
)
3786 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3793 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3796 scalar_type_p (struct type
*type
)
3802 switch (TYPE_CODE (type
))
3805 case TYPE_CODE_RANGE
:
3806 case TYPE_CODE_ENUM
:
3815 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3818 discrete_type_p (struct type
*type
)
3824 switch (TYPE_CODE (type
))
3827 case TYPE_CODE_RANGE
:
3828 case TYPE_CODE_ENUM
:
3829 case TYPE_CODE_BOOL
:
3837 /* Returns non-zero if OP with operands in the vector ARGS could be
3838 a user-defined function. Errs on the side of pre-defined operators
3839 (i.e., result 0). */
3842 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3844 struct type
*type0
=
3845 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3846 struct type
*type1
=
3847 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3861 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3865 case BINOP_BITWISE_AND
:
3866 case BINOP_BITWISE_IOR
:
3867 case BINOP_BITWISE_XOR
:
3868 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3871 case BINOP_NOTEQUAL
:
3876 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3879 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3882 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3886 case UNOP_LOGICAL_NOT
:
3888 return (!numeric_type_p (type0
));
3897 1. In the following, we assume that a renaming type's name may
3898 have an ___XD suffix. It would be nice if this went away at some
3900 2. We handle both the (old) purely type-based representation of
3901 renamings and the (new) variable-based encoding. At some point,
3902 it is devoutly to be hoped that the former goes away
3903 (FIXME: hilfinger-2007-07-09).
3904 3. Subprogram renamings are not implemented, although the XRS
3905 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3907 /* If SYM encodes a renaming,
3909 <renaming> renames <renamed entity>,
3911 sets *LEN to the length of the renamed entity's name,
3912 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3913 the string describing the subcomponent selected from the renamed
3914 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3915 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3916 are undefined). Otherwise, returns a value indicating the category
3917 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3918 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3919 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3920 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3921 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3922 may be NULL, in which case they are not assigned.
3924 [Currently, however, GCC does not generate subprogram renamings.] */
3926 enum ada_renaming_category
3927 ada_parse_renaming (struct symbol
*sym
,
3928 const char **renamed_entity
, int *len
,
3929 const char **renaming_expr
)
3931 enum ada_renaming_category kind
;
3936 return ADA_NOT_RENAMING
;
3937 switch (SYMBOL_CLASS (sym
))
3940 return ADA_NOT_RENAMING
;
3942 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3943 renamed_entity
, len
, renaming_expr
);
3947 case LOC_OPTIMIZED_OUT
:
3948 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3950 return ADA_NOT_RENAMING
;
3954 kind
= ADA_OBJECT_RENAMING
;
3958 kind
= ADA_EXCEPTION_RENAMING
;
3962 kind
= ADA_PACKAGE_RENAMING
;
3966 kind
= ADA_SUBPROGRAM_RENAMING
;
3970 return ADA_NOT_RENAMING
;
3974 if (renamed_entity
!= NULL
)
3975 *renamed_entity
= info
;
3976 suffix
= strstr (info
, "___XE");
3977 if (suffix
== NULL
|| suffix
== info
)
3978 return ADA_NOT_RENAMING
;
3980 *len
= strlen (info
) - strlen (suffix
);
3982 if (renaming_expr
!= NULL
)
3983 *renaming_expr
= suffix
;
3987 /* Assuming TYPE encodes a renaming according to the old encoding in
3988 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3989 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3990 ADA_NOT_RENAMING otherwise. */
3991 static enum ada_renaming_category
3992 parse_old_style_renaming (struct type
*type
,
3993 const char **renamed_entity
, int *len
,
3994 const char **renaming_expr
)
3996 enum ada_renaming_category kind
;
4001 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4002 || TYPE_NFIELDS (type
) != 1)
4003 return ADA_NOT_RENAMING
;
4005 name
= type_name_no_tag (type
);
4007 return ADA_NOT_RENAMING
;
4009 name
= strstr (name
, "___XR");
4011 return ADA_NOT_RENAMING
;
4016 kind
= ADA_OBJECT_RENAMING
;
4019 kind
= ADA_EXCEPTION_RENAMING
;
4022 kind
= ADA_PACKAGE_RENAMING
;
4025 kind
= ADA_SUBPROGRAM_RENAMING
;
4028 return ADA_NOT_RENAMING
;
4031 info
= TYPE_FIELD_NAME (type
, 0);
4033 return ADA_NOT_RENAMING
;
4034 if (renamed_entity
!= NULL
)
4035 *renamed_entity
= info
;
4036 suffix
= strstr (info
, "___XE");
4037 if (renaming_expr
!= NULL
)
4038 *renaming_expr
= suffix
+ 5;
4039 if (suffix
== NULL
|| suffix
== info
)
4040 return ADA_NOT_RENAMING
;
4042 *len
= suffix
- info
;
4046 /* Compute the value of the given RENAMING_SYM, which is expected to
4047 be a symbol encoding a renaming expression. BLOCK is the block
4048 used to evaluate the renaming. */
4050 static struct value
*
4051 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4052 struct block
*block
)
4055 struct expression
*expr
;
4056 struct value
*value
;
4057 struct cleanup
*old_chain
= NULL
;
4059 sym_name
= xstrdup (SYMBOL_LINKAGE_NAME (renaming_sym
));
4060 old_chain
= make_cleanup (xfree
, sym_name
);
4061 expr
= parse_exp_1 (&sym_name
, block
, 0);
4062 make_cleanup (free_current_contents
, &expr
);
4063 value
= evaluate_expression (expr
);
4065 do_cleanups (old_chain
);
4070 /* Evaluation: Function Calls */
4072 /* Return an lvalue containing the value VAL. This is the identity on
4073 lvalues, and otherwise has the side-effect of allocating memory
4074 in the inferior where a copy of the value contents is copied. */
4076 static struct value
*
4077 ensure_lval (struct value
*val
)
4079 if (VALUE_LVAL (val
) == not_lval
4080 || VALUE_LVAL (val
) == lval_internalvar
)
4082 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4083 const CORE_ADDR addr
=
4084 value_as_long (value_allocate_space_in_inferior (len
));
4086 set_value_address (val
, addr
);
4087 VALUE_LVAL (val
) = lval_memory
;
4088 write_memory (addr
, value_contents (val
), len
);
4094 /* Return the value ACTUAL, converted to be an appropriate value for a
4095 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4096 allocating any necessary descriptors (fat pointers), or copies of
4097 values not residing in memory, updating it as needed. */
4100 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4102 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4103 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4104 struct type
*formal_target
=
4105 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4106 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4107 struct type
*actual_target
=
4108 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4109 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4111 if (ada_is_array_descriptor_type (formal_target
)
4112 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4113 return make_array_descriptor (formal_type
, actual
);
4114 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4115 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4117 struct value
*result
;
4119 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4120 && ada_is_array_descriptor_type (actual_target
))
4121 result
= desc_data (actual
);
4122 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4124 if (VALUE_LVAL (actual
) != lval_memory
)
4128 actual_type
= ada_check_typedef (value_type (actual
));
4129 val
= allocate_value (actual_type
);
4130 memcpy ((char *) value_contents_raw (val
),
4131 (char *) value_contents (actual
),
4132 TYPE_LENGTH (actual_type
));
4133 actual
= ensure_lval (val
);
4135 result
= value_addr (actual
);
4139 return value_cast_pointers (formal_type
, result
);
4141 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4142 return ada_value_ind (actual
);
4147 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4148 type TYPE. This is usually an inefficient no-op except on some targets
4149 (such as AVR) where the representation of a pointer and an address
4153 value_pointer (struct value
*value
, struct type
*type
)
4155 struct gdbarch
*gdbarch
= get_type_arch (type
);
4156 unsigned len
= TYPE_LENGTH (type
);
4157 gdb_byte
*buf
= alloca (len
);
4160 addr
= value_address (value
);
4161 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4162 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4167 /* Push a descriptor of type TYPE for array value ARR on the stack at
4168 *SP, updating *SP to reflect the new descriptor. Return either
4169 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4170 to-descriptor type rather than a descriptor type), a struct value *
4171 representing a pointer to this descriptor. */
4173 static struct value
*
4174 make_array_descriptor (struct type
*type
, struct value
*arr
)
4176 struct type
*bounds_type
= desc_bounds_type (type
);
4177 struct type
*desc_type
= desc_base_type (type
);
4178 struct value
*descriptor
= allocate_value (desc_type
);
4179 struct value
*bounds
= allocate_value (bounds_type
);
4182 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4185 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4186 ada_array_bound (arr
, i
, 0),
4187 desc_bound_bitpos (bounds_type
, i
, 0),
4188 desc_bound_bitsize (bounds_type
, i
, 0));
4189 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4190 ada_array_bound (arr
, i
, 1),
4191 desc_bound_bitpos (bounds_type
, i
, 1),
4192 desc_bound_bitsize (bounds_type
, i
, 1));
4195 bounds
= ensure_lval (bounds
);
4197 modify_field (value_type (descriptor
),
4198 value_contents_writeable (descriptor
),
4199 value_pointer (ensure_lval (arr
),
4200 TYPE_FIELD_TYPE (desc_type
, 0)),
4201 fat_pntr_data_bitpos (desc_type
),
4202 fat_pntr_data_bitsize (desc_type
));
4204 modify_field (value_type (descriptor
),
4205 value_contents_writeable (descriptor
),
4206 value_pointer (bounds
,
4207 TYPE_FIELD_TYPE (desc_type
, 1)),
4208 fat_pntr_bounds_bitpos (desc_type
),
4209 fat_pntr_bounds_bitsize (desc_type
));
4211 descriptor
= ensure_lval (descriptor
);
4213 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4214 return value_addr (descriptor
);
4219 /* Dummy definitions for an experimental caching module that is not
4220 * used in the public sources. */
4223 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4224 struct symbol
**sym
, struct block
**block
)
4230 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4231 struct block
*block
)
4237 /* Return nonzero if wild matching should be used when searching for
4238 all symbols matching LOOKUP_NAME.
4240 LOOKUP_NAME is expected to be a symbol name after transformation
4241 for Ada lookups (see ada_name_for_lookup). */
4244 should_use_wild_match (const char *lookup_name
)
4246 return (strstr (lookup_name
, "__") == NULL
);
4249 /* Return the result of a standard (literal, C-like) lookup of NAME in
4250 given DOMAIN, visible from lexical block BLOCK. */
4252 static struct symbol
*
4253 standard_lookup (const char *name
, const struct block
*block
,
4258 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4260 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4261 cache_symbol (name
, domain
, sym
, block_found
);
4266 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4267 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4268 since they contend in overloading in the same way. */
4270 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4274 for (i
= 0; i
< n
; i
+= 1)
4275 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4276 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4277 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4283 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4284 struct types. Otherwise, they may not. */
4287 equiv_types (struct type
*type0
, struct type
*type1
)
4291 if (type0
== NULL
|| type1
== NULL
4292 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4294 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4295 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4296 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4297 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4303 /* True iff SYM0 represents the same entity as SYM1, or one that is
4304 no more defined than that of SYM1. */
4307 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4311 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4312 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4315 switch (SYMBOL_CLASS (sym0
))
4321 struct type
*type0
= SYMBOL_TYPE (sym0
);
4322 struct type
*type1
= SYMBOL_TYPE (sym1
);
4323 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4324 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4325 int len0
= strlen (name0
);
4328 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4329 && (equiv_types (type0
, type1
)
4330 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4331 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4334 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4335 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4341 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4342 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4345 add_defn_to_vec (struct obstack
*obstackp
,
4347 struct block
*block
)
4350 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4352 /* Do not try to complete stub types, as the debugger is probably
4353 already scanning all symbols matching a certain name at the
4354 time when this function is called. Trying to replace the stub
4355 type by its associated full type will cause us to restart a scan
4356 which may lead to an infinite recursion. Instead, the client
4357 collecting the matching symbols will end up collecting several
4358 matches, with at least one of them complete. It can then filter
4359 out the stub ones if needed. */
4361 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4363 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4365 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4367 prevDefns
[i
].sym
= sym
;
4368 prevDefns
[i
].block
= block
;
4374 struct ada_symbol_info info
;
4378 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4382 /* Number of ada_symbol_info structures currently collected in
4383 current vector in *OBSTACKP. */
4386 num_defns_collected (struct obstack
*obstackp
)
4388 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4391 /* Vector of ada_symbol_info structures currently collected in current
4392 vector in *OBSTACKP. If FINISH, close off the vector and return
4393 its final address. */
4395 static struct ada_symbol_info
*
4396 defns_collected (struct obstack
*obstackp
, int finish
)
4399 return obstack_finish (obstackp
);
4401 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4404 /* Return a minimal symbol matching NAME according to Ada decoding
4405 rules. Returns NULL if there is no such minimal symbol. Names
4406 prefixed with "standard__" are handled specially: "standard__" is
4407 first stripped off, and only static and global symbols are searched. */
4409 struct minimal_symbol
*
4410 ada_lookup_simple_minsym (const char *name
)
4412 struct objfile
*objfile
;
4413 struct minimal_symbol
*msymbol
;
4414 const int wild_match
= should_use_wild_match (name
);
4416 /* Special case: If the user specifies a symbol name inside package
4417 Standard, do a non-wild matching of the symbol name without
4418 the "standard__" prefix. This was primarily introduced in order
4419 to allow the user to specifically access the standard exceptions
4420 using, for instance, Standard.Constraint_Error when Constraint_Error
4421 is ambiguous (due to the user defining its own Constraint_Error
4422 entity inside its program). */
4423 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4424 name
+= sizeof ("standard__") - 1;
4426 ALL_MSYMBOLS (objfile
, msymbol
)
4428 if (match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4429 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4436 /* For all subprograms that statically enclose the subprogram of the
4437 selected frame, add symbols matching identifier NAME in DOMAIN
4438 and their blocks to the list of data in OBSTACKP, as for
4439 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4443 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4444 const char *name
, domain_enum
namespace,
4449 /* True if TYPE is definitely an artificial type supplied to a symbol
4450 for which no debugging information was given in the symbol file. */
4453 is_nondebugging_type (struct type
*type
)
4455 const char *name
= ada_type_name (type
);
4457 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4460 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4461 that are deemed "identical" for practical purposes.
4463 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4464 types and that their number of enumerals is identical (in other
4465 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4468 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4472 /* The heuristic we use here is fairly conservative. We consider
4473 that 2 enumerate types are identical if they have the same
4474 number of enumerals and that all enumerals have the same
4475 underlying value and name. */
4477 /* All enums in the type should have an identical underlying value. */
4478 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4479 if (TYPE_FIELD_BITPOS (type1
, i
) != TYPE_FIELD_BITPOS (type2
, i
))
4482 /* All enumerals should also have the same name (modulo any numerical
4484 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4486 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4487 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4488 int len_1
= strlen (name_1
);
4489 int len_2
= strlen (name_2
);
4491 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4492 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4494 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4495 TYPE_FIELD_NAME (type2
, i
),
4503 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4504 that are deemed "identical" for practical purposes. Sometimes,
4505 enumerals are not strictly identical, but their types are so similar
4506 that they can be considered identical.
4508 For instance, consider the following code:
4510 type Color is (Black, Red, Green, Blue, White);
4511 type RGB_Color is new Color range Red .. Blue;
4513 Type RGB_Color is a subrange of an implicit type which is a copy
4514 of type Color. If we call that implicit type RGB_ColorB ("B" is
4515 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4516 As a result, when an expression references any of the enumeral
4517 by name (Eg. "print green"), the expression is technically
4518 ambiguous and the user should be asked to disambiguate. But
4519 doing so would only hinder the user, since it wouldn't matter
4520 what choice he makes, the outcome would always be the same.
4521 So, for practical purposes, we consider them as the same. */
4524 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4528 /* Before performing a thorough comparison check of each type,
4529 we perform a series of inexpensive checks. We expect that these
4530 checks will quickly fail in the vast majority of cases, and thus
4531 help prevent the unnecessary use of a more expensive comparison.
4532 Said comparison also expects us to make some of these checks
4533 (see ada_identical_enum_types_p). */
4535 /* Quick check: All symbols should have an enum type. */
4536 for (i
= 0; i
< nsyms
; i
++)
4537 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4540 /* Quick check: They should all have the same value. */
4541 for (i
= 1; i
< nsyms
; i
++)
4542 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4545 /* Quick check: They should all have the same number of enumerals. */
4546 for (i
= 1; i
< nsyms
; i
++)
4547 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4548 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4551 /* All the sanity checks passed, so we might have a set of
4552 identical enumeration types. Perform a more complete
4553 comparison of the type of each symbol. */
4554 for (i
= 1; i
< nsyms
; i
++)
4555 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4556 SYMBOL_TYPE (syms
[0].sym
)))
4562 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4563 duplicate other symbols in the list (The only case I know of where
4564 this happens is when object files containing stabs-in-ecoff are
4565 linked with files containing ordinary ecoff debugging symbols (or no
4566 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4567 Returns the number of items in the modified list. */
4570 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4574 /* We should never be called with less than 2 symbols, as there
4575 cannot be any extra symbol in that case. But it's easy to
4576 handle, since we have nothing to do in that case. */
4585 /* If two symbols have the same name and one of them is a stub type,
4586 the get rid of the stub. */
4588 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4589 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4591 for (j
= 0; j
< nsyms
; j
++)
4594 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4595 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4596 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4597 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4602 /* Two symbols with the same name, same class and same address
4603 should be identical. */
4605 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4606 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4607 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4609 for (j
= 0; j
< nsyms
; j
+= 1)
4612 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4613 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4614 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4615 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4616 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4617 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4624 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4625 syms
[j
- 1] = syms
[j
];
4632 /* If all the remaining symbols are identical enumerals, then
4633 just keep the first one and discard the rest.
4635 Unlike what we did previously, we do not discard any entry
4636 unless they are ALL identical. This is because the symbol
4637 comparison is not a strict comparison, but rather a practical
4638 comparison. If all symbols are considered identical, then
4639 we can just go ahead and use the first one and discard the rest.
4640 But if we cannot reduce the list to a single element, we have
4641 to ask the user to disambiguate anyways. And if we have to
4642 present a multiple-choice menu, it's less confusing if the list
4643 isn't missing some choices that were identical and yet distinct. */
4644 if (symbols_are_identical_enums (syms
, nsyms
))
4650 /* Given a type that corresponds to a renaming entity, use the type name
4651 to extract the scope (package name or function name, fully qualified,
4652 and following the GNAT encoding convention) where this renaming has been
4653 defined. The string returned needs to be deallocated after use. */
4656 xget_renaming_scope (struct type
*renaming_type
)
4658 /* The renaming types adhere to the following convention:
4659 <scope>__<rename>___<XR extension>.
4660 So, to extract the scope, we search for the "___XR" extension,
4661 and then backtrack until we find the first "__". */
4663 const char *name
= type_name_no_tag (renaming_type
);
4664 char *suffix
= strstr (name
, "___XR");
4669 /* Now, backtrack a bit until we find the first "__". Start looking
4670 at suffix - 3, as the <rename> part is at least one character long. */
4672 for (last
= suffix
- 3; last
> name
; last
--)
4673 if (last
[0] == '_' && last
[1] == '_')
4676 /* Make a copy of scope and return it. */
4678 scope_len
= last
- name
;
4679 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4681 strncpy (scope
, name
, scope_len
);
4682 scope
[scope_len
] = '\0';
4687 /* Return nonzero if NAME corresponds to a package name. */
4690 is_package_name (const char *name
)
4692 /* Here, We take advantage of the fact that no symbols are generated
4693 for packages, while symbols are generated for each function.
4694 So the condition for NAME represent a package becomes equivalent
4695 to NAME not existing in our list of symbols. There is only one
4696 small complication with library-level functions (see below). */
4700 /* If it is a function that has not been defined at library level,
4701 then we should be able to look it up in the symbols. */
4702 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4705 /* Library-level function names start with "_ada_". See if function
4706 "_ada_" followed by NAME can be found. */
4708 /* Do a quick check that NAME does not contain "__", since library-level
4709 functions names cannot contain "__" in them. */
4710 if (strstr (name
, "__") != NULL
)
4713 fun_name
= xstrprintf ("_ada_%s", name
);
4715 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4718 /* Return nonzero if SYM corresponds to a renaming entity that is
4719 not visible from FUNCTION_NAME. */
4722 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
4726 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4729 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4731 make_cleanup (xfree
, scope
);
4733 /* If the rename has been defined in a package, then it is visible. */
4734 if (is_package_name (scope
))
4737 /* Check that the rename is in the current function scope by checking
4738 that its name starts with SCOPE. */
4740 /* If the function name starts with "_ada_", it means that it is
4741 a library-level function. Strip this prefix before doing the
4742 comparison, as the encoding for the renaming does not contain
4744 if (strncmp (function_name
, "_ada_", 5) == 0)
4747 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4750 /* Remove entries from SYMS that corresponds to a renaming entity that
4751 is not visible from the function associated with CURRENT_BLOCK or
4752 that is superfluous due to the presence of more specific renaming
4753 information. Places surviving symbols in the initial entries of
4754 SYMS and returns the number of surviving symbols.
4757 First, in cases where an object renaming is implemented as a
4758 reference variable, GNAT may produce both the actual reference
4759 variable and the renaming encoding. In this case, we discard the
4762 Second, GNAT emits a type following a specified encoding for each renaming
4763 entity. Unfortunately, STABS currently does not support the definition
4764 of types that are local to a given lexical block, so all renamings types
4765 are emitted at library level. As a consequence, if an application
4766 contains two renaming entities using the same name, and a user tries to
4767 print the value of one of these entities, the result of the ada symbol
4768 lookup will also contain the wrong renaming type.
4770 This function partially covers for this limitation by attempting to
4771 remove from the SYMS list renaming symbols that should be visible
4772 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4773 method with the current information available. The implementation
4774 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4776 - When the user tries to print a rename in a function while there
4777 is another rename entity defined in a package: Normally, the
4778 rename in the function has precedence over the rename in the
4779 package, so the latter should be removed from the list. This is
4780 currently not the case.
4782 - This function will incorrectly remove valid renames if
4783 the CURRENT_BLOCK corresponds to a function which symbol name
4784 has been changed by an "Export" pragma. As a consequence,
4785 the user will be unable to print such rename entities. */
4788 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4789 int nsyms
, const struct block
*current_block
)
4791 struct symbol
*current_function
;
4792 const char *current_function_name
;
4794 int is_new_style_renaming
;
4796 /* If there is both a renaming foo___XR... encoded as a variable and
4797 a simple variable foo in the same block, discard the latter.
4798 First, zero out such symbols, then compress. */
4799 is_new_style_renaming
= 0;
4800 for (i
= 0; i
< nsyms
; i
+= 1)
4802 struct symbol
*sym
= syms
[i
].sym
;
4803 struct block
*block
= syms
[i
].block
;
4807 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4809 name
= SYMBOL_LINKAGE_NAME (sym
);
4810 suffix
= strstr (name
, "___XR");
4814 int name_len
= suffix
- name
;
4817 is_new_style_renaming
= 1;
4818 for (j
= 0; j
< nsyms
; j
+= 1)
4819 if (i
!= j
&& syms
[j
].sym
!= NULL
4820 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4822 && block
== syms
[j
].block
)
4826 if (is_new_style_renaming
)
4830 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4831 if (syms
[j
].sym
!= NULL
)
4839 /* Extract the function name associated to CURRENT_BLOCK.
4840 Abort if unable to do so. */
4842 if (current_block
== NULL
)
4845 current_function
= block_linkage_function (current_block
);
4846 if (current_function
== NULL
)
4849 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4850 if (current_function_name
== NULL
)
4853 /* Check each of the symbols, and remove it from the list if it is
4854 a type corresponding to a renaming that is out of the scope of
4855 the current block. */
4860 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4861 == ADA_OBJECT_RENAMING
4862 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4866 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4867 syms
[j
- 1] = syms
[j
];
4877 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4878 whose name and domain match NAME and DOMAIN respectively.
4879 If no match was found, then extend the search to "enclosing"
4880 routines (in other words, if we're inside a nested function,
4881 search the symbols defined inside the enclosing functions).
4883 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4886 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4887 struct block
*block
, domain_enum domain
,
4890 int block_depth
= 0;
4892 while (block
!= NULL
)
4895 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4897 /* If we found a non-function match, assume that's the one. */
4898 if (is_nonfunction (defns_collected (obstackp
, 0),
4899 num_defns_collected (obstackp
)))
4902 block
= BLOCK_SUPERBLOCK (block
);
4905 /* If no luck so far, try to find NAME as a local symbol in some lexically
4906 enclosing subprogram. */
4907 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4908 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4911 /* An object of this type is used as the user_data argument when
4912 calling the map_matching_symbols method. */
4916 struct objfile
*objfile
;
4917 struct obstack
*obstackp
;
4918 struct symbol
*arg_sym
;
4922 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4923 to a list of symbols. DATA0 is a pointer to a struct match_data *
4924 containing the obstack that collects the symbol list, the file that SYM
4925 must come from, a flag indicating whether a non-argument symbol has
4926 been found in the current block, and the last argument symbol
4927 passed in SYM within the current block (if any). When SYM is null,
4928 marking the end of a block, the argument symbol is added if no
4929 other has been found. */
4932 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
4934 struct match_data
*data
= (struct match_data
*) data0
;
4938 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
4939 add_defn_to_vec (data
->obstackp
,
4940 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
4942 data
->found_sym
= 0;
4943 data
->arg_sym
= NULL
;
4947 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4949 else if (SYMBOL_IS_ARGUMENT (sym
))
4950 data
->arg_sym
= sym
;
4953 data
->found_sym
= 1;
4954 add_defn_to_vec (data
->obstackp
,
4955 fixup_symbol_section (sym
, data
->objfile
),
4962 /* Compare STRING1 to STRING2, with results as for strcmp.
4963 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4964 implies compare_names (STRING1, STRING2) (they may differ as to
4965 what symbols compare equal). */
4968 compare_names (const char *string1
, const char *string2
)
4970 while (*string1
!= '\0' && *string2
!= '\0')
4972 if (isspace (*string1
) || isspace (*string2
))
4973 return strcmp_iw_ordered (string1
, string2
);
4974 if (*string1
!= *string2
)
4982 return strcmp_iw_ordered (string1
, string2
);
4984 if (*string2
== '\0')
4986 if (is_name_suffix (string1
))
4993 if (*string2
== '(')
4994 return strcmp_iw_ordered (string1
, string2
);
4996 return *string1
- *string2
;
5000 /* Add to OBSTACKP all non-local symbols whose name and domain match
5001 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5002 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5005 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5006 domain_enum domain
, int global
,
5009 struct objfile
*objfile
;
5010 struct match_data data
;
5012 memset (&data
, 0, sizeof data
);
5013 data
.obstackp
= obstackp
;
5015 ALL_OBJFILES (objfile
)
5017 data
.objfile
= objfile
;
5020 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
5021 aux_add_nonlocal_symbols
, &data
,
5024 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
5025 aux_add_nonlocal_symbols
, &data
,
5026 full_match
, compare_names
);
5029 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5031 ALL_OBJFILES (objfile
)
5033 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5034 strcpy (name1
, "_ada_");
5035 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5036 data
.objfile
= objfile
;
5037 objfile
->sf
->qf
->map_matching_symbols (name1
, domain
,
5039 aux_add_nonlocal_symbols
,
5041 full_match
, compare_names
);
5046 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
5047 scope and in global scopes, returning the number of matches. Sets
5048 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5049 indicating the symbols found and the blocks and symbol tables (if
5050 any) in which they were found. This vector are transient---good only to
5051 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
5052 symbol match within the nest of blocks whose innermost member is BLOCK0,
5053 is the one match returned (no other matches in that or
5054 enclosing blocks is returned). If there are any matches in or
5055 surrounding BLOCK0, then these alone are returned. Otherwise, if
5056 FULL_SEARCH is non-zero, then the search extends to global and
5057 file-scope (static) symbol tables.
5058 Names prefixed with "standard__" are handled specially: "standard__"
5059 is first stripped off, and only static and global symbols are searched. */
5062 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5063 domain_enum
namespace,
5064 struct ada_symbol_info
**results
,
5068 struct block
*block
;
5070 const int wild_match
= should_use_wild_match (name0
);
5074 obstack_free (&symbol_list_obstack
, NULL
);
5075 obstack_init (&symbol_list_obstack
);
5079 /* Search specified block and its superiors. */
5082 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
5083 needed, but adding const will
5084 have a cascade effect. */
5086 /* Special case: If the user specifies a symbol name inside package
5087 Standard, do a non-wild matching of the symbol name without
5088 the "standard__" prefix. This was primarily introduced in order
5089 to allow the user to specifically access the standard exceptions
5090 using, for instance, Standard.Constraint_Error when Constraint_Error
5091 is ambiguous (due to the user defining its own Constraint_Error
5092 entity inside its program). */
5093 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5096 name
= name0
+ sizeof ("standard__") - 1;
5099 /* Check the non-global symbols. If we have ANY match, then we're done. */
5101 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
5103 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5106 /* No non-global symbols found. Check our cache to see if we have
5107 already performed this search before. If we have, then return
5111 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5114 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5118 /* Search symbols from all global blocks. */
5120 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5123 /* Now add symbols from all per-file blocks if we've gotten no hits
5124 (not strictly correct, but perhaps better than an error). */
5126 if (num_defns_collected (&symbol_list_obstack
) == 0)
5127 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5131 ndefns
= num_defns_collected (&symbol_list_obstack
);
5132 *results
= defns_collected (&symbol_list_obstack
, 1);
5134 ndefns
= remove_extra_symbols (*results
, ndefns
);
5136 if (ndefns
== 0 && full_search
)
5137 cache_symbol (name0
, namespace, NULL
, NULL
);
5139 if (ndefns
== 1 && full_search
&& cacheIfUnique
)
5140 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5142 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5147 /* If NAME is the name of an entity, return a string that should
5148 be used to look that entity up in Ada units. This string should
5149 be deallocated after use using xfree.
5151 NAME can have any form that the "break" or "print" commands might
5152 recognize. In other words, it does not have to be the "natural"
5153 name, or the "encoded" name. */
5156 ada_name_for_lookup (const char *name
)
5159 int nlen
= strlen (name
);
5161 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5163 canon
= xmalloc (nlen
- 1);
5164 memcpy (canon
, name
+ 1, nlen
- 2);
5165 canon
[nlen
- 2] = '\0';
5168 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5172 /* Implementation of the la_iterate_over_symbols method. */
5175 ada_iterate_over_symbols (const struct block
*block
,
5176 const char *name
, domain_enum domain
,
5177 symbol_found_callback_ftype
*callback
,
5181 struct ada_symbol_info
*results
;
5183 ndefs
= ada_lookup_symbol_list (name
, block
, domain
, &results
, 0);
5184 for (i
= 0; i
< ndefs
; ++i
)
5186 if (! (*callback
) (results
[i
].sym
, data
))
5192 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
5193 domain_enum
namespace, struct block
**block_found
)
5195 struct ada_symbol_info
*candidates
;
5198 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
,
5201 if (n_candidates
== 0)
5204 if (block_found
!= NULL
)
5205 *block_found
= candidates
[0].block
;
5207 return fixup_symbol_section (candidates
[0].sym
, NULL
);
5210 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5211 scope and in global scopes, or NULL if none. NAME is folded and
5212 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5213 choosing the first symbol if there are multiple choices.
5214 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
5215 table in which the symbol was found (in both cases, these
5216 assignments occur only if the pointers are non-null). */
5218 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5219 domain_enum
namespace, int *is_a_field_of_this
)
5221 if (is_a_field_of_this
!= NULL
)
5222 *is_a_field_of_this
= 0;
5225 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5226 block0
, namespace, NULL
);
5229 static struct symbol
*
5230 ada_lookup_symbol_nonlocal (const char *name
,
5231 const struct block
*block
,
5232 const domain_enum domain
)
5234 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5238 /* True iff STR is a possible encoded suffix of a normal Ada name
5239 that is to be ignored for matching purposes. Suffixes of parallel
5240 names (e.g., XVE) are not included here. Currently, the possible suffixes
5241 are given by any of the regular expressions:
5243 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5244 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5245 TKB [subprogram suffix for task bodies]
5246 _E[0-9]+[bs]$ [protected object entry suffixes]
5247 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5249 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5250 match is performed. This sequence is used to differentiate homonyms,
5251 is an optional part of a valid name suffix. */
5254 is_name_suffix (const char *str
)
5257 const char *matching
;
5258 const int len
= strlen (str
);
5260 /* Skip optional leading __[0-9]+. */
5262 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5265 while (isdigit (str
[0]))
5271 if (str
[0] == '.' || str
[0] == '$')
5274 while (isdigit (matching
[0]))
5276 if (matching
[0] == '\0')
5282 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5285 while (isdigit (matching
[0]))
5287 if (matching
[0] == '\0')
5291 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5293 if (strcmp (str
, "TKB") == 0)
5297 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5298 with a N at the end. Unfortunately, the compiler uses the same
5299 convention for other internal types it creates. So treating
5300 all entity names that end with an "N" as a name suffix causes
5301 some regressions. For instance, consider the case of an enumerated
5302 type. To support the 'Image attribute, it creates an array whose
5304 Having a single character like this as a suffix carrying some
5305 information is a bit risky. Perhaps we should change the encoding
5306 to be something like "_N" instead. In the meantime, do not do
5307 the following check. */
5308 /* Protected Object Subprograms */
5309 if (len
== 1 && str
[0] == 'N')
5314 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5317 while (isdigit (matching
[0]))
5319 if ((matching
[0] == 'b' || matching
[0] == 's')
5320 && matching
[1] == '\0')
5324 /* ??? We should not modify STR directly, as we are doing below. This
5325 is fine in this case, but may become problematic later if we find
5326 that this alternative did not work, and want to try matching
5327 another one from the begining of STR. Since we modified it, we
5328 won't be able to find the begining of the string anymore! */
5332 while (str
[0] != '_' && str
[0] != '\0')
5334 if (str
[0] != 'n' && str
[0] != 'b')
5340 if (str
[0] == '\000')
5345 if (str
[1] != '_' || str
[2] == '\000')
5349 if (strcmp (str
+ 3, "JM") == 0)
5351 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5352 the LJM suffix in favor of the JM one. But we will
5353 still accept LJM as a valid suffix for a reasonable
5354 amount of time, just to allow ourselves to debug programs
5355 compiled using an older version of GNAT. */
5356 if (strcmp (str
+ 3, "LJM") == 0)
5360 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5361 || str
[4] == 'U' || str
[4] == 'P')
5363 if (str
[4] == 'R' && str
[5] != 'T')
5367 if (!isdigit (str
[2]))
5369 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5370 if (!isdigit (str
[k
]) && str
[k
] != '_')
5374 if (str
[0] == '$' && isdigit (str
[1]))
5376 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5377 if (!isdigit (str
[k
]) && str
[k
] != '_')
5384 /* Return non-zero if the string starting at NAME and ending before
5385 NAME_END contains no capital letters. */
5388 is_valid_name_for_wild_match (const char *name0
)
5390 const char *decoded_name
= ada_decode (name0
);
5393 /* If the decoded name starts with an angle bracket, it means that
5394 NAME0 does not follow the GNAT encoding format. It should then
5395 not be allowed as a possible wild match. */
5396 if (decoded_name
[0] == '<')
5399 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5400 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5406 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5407 that could start a simple name. Assumes that *NAMEP points into
5408 the string beginning at NAME0. */
5411 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5413 const char *name
= *namep
;
5423 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5426 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5431 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5432 || name
[2] == target0
))
5440 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5450 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5451 informational suffixes of NAME (i.e., for which is_name_suffix is
5452 true). Assumes that PATN is a lower-cased Ada simple name. */
5455 wild_match (const char *name
, const char *patn
)
5458 const char *name0
= name
;
5462 const char *match
= name
;
5466 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5469 if (*p
== '\0' && is_name_suffix (name
))
5470 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5472 if (name
[-1] == '_')
5475 if (!advance_wild_match (&name
, name0
, *patn
))
5480 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5481 informational suffix. */
5484 full_match (const char *sym_name
, const char *search_name
)
5486 return !match_name (sym_name
, search_name
, 0);
5490 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5491 vector *defn_symbols, updating the list of symbols in OBSTACKP
5492 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5493 OBJFILE is the section containing BLOCK.
5494 SYMTAB is recorded with each symbol added. */
5497 ada_add_block_symbols (struct obstack
*obstackp
,
5498 struct block
*block
, const char *name
,
5499 domain_enum domain
, struct objfile
*objfile
,
5502 struct dict_iterator iter
;
5503 int name_len
= strlen (name
);
5504 /* A matching argument symbol, if any. */
5505 struct symbol
*arg_sym
;
5506 /* Set true when we find a matching non-argument symbol. */
5514 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5516 sym
!= NULL
; sym
= dict_iter_match_next (name
, wild_match
, &iter
))
5518 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5519 SYMBOL_DOMAIN (sym
), domain
)
5520 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5522 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5524 else if (SYMBOL_IS_ARGUMENT (sym
))
5529 add_defn_to_vec (obstackp
,
5530 fixup_symbol_section (sym
, objfile
),
5538 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5540 sym
!= NULL
; sym
= dict_iter_match_next (name
, full_match
, &iter
))
5542 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5543 SYMBOL_DOMAIN (sym
), domain
))
5545 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5547 if (SYMBOL_IS_ARGUMENT (sym
))
5552 add_defn_to_vec (obstackp
,
5553 fixup_symbol_section (sym
, objfile
),
5561 if (!found_sym
&& arg_sym
!= NULL
)
5563 add_defn_to_vec (obstackp
,
5564 fixup_symbol_section (arg_sym
, objfile
),
5573 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5575 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5576 SYMBOL_DOMAIN (sym
), domain
))
5580 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5583 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5585 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5590 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5592 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5594 if (SYMBOL_IS_ARGUMENT (sym
))
5599 add_defn_to_vec (obstackp
,
5600 fixup_symbol_section (sym
, objfile
),
5608 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5609 They aren't parameters, right? */
5610 if (!found_sym
&& arg_sym
!= NULL
)
5612 add_defn_to_vec (obstackp
,
5613 fixup_symbol_section (arg_sym
, objfile
),
5620 /* Symbol Completion */
5622 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5623 name in a form that's appropriate for the completion. The result
5624 does not need to be deallocated, but is only good until the next call.
5626 TEXT_LEN is equal to the length of TEXT.
5627 Perform a wild match if WILD_MATCH is set.
5628 ENCODED should be set if TEXT represents the start of a symbol name
5629 in its encoded form. */
5632 symbol_completion_match (const char *sym_name
,
5633 const char *text
, int text_len
,
5634 int wild_match
, int encoded
)
5636 const int verbatim_match
= (text
[0] == '<');
5641 /* Strip the leading angle bracket. */
5646 /* First, test against the fully qualified name of the symbol. */
5648 if (strncmp (sym_name
, text
, text_len
) == 0)
5651 if (match
&& !encoded
)
5653 /* One needed check before declaring a positive match is to verify
5654 that iff we are doing a verbatim match, the decoded version
5655 of the symbol name starts with '<'. Otherwise, this symbol name
5656 is not a suitable completion. */
5657 const char *sym_name_copy
= sym_name
;
5658 int has_angle_bracket
;
5660 sym_name
= ada_decode (sym_name
);
5661 has_angle_bracket
= (sym_name
[0] == '<');
5662 match
= (has_angle_bracket
== verbatim_match
);
5663 sym_name
= sym_name_copy
;
5666 if (match
&& !verbatim_match
)
5668 /* When doing non-verbatim match, another check that needs to
5669 be done is to verify that the potentially matching symbol name
5670 does not include capital letters, because the ada-mode would
5671 not be able to understand these symbol names without the
5672 angle bracket notation. */
5675 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5680 /* Second: Try wild matching... */
5682 if (!match
&& wild_match
)
5684 /* Since we are doing wild matching, this means that TEXT
5685 may represent an unqualified symbol name. We therefore must
5686 also compare TEXT against the unqualified name of the symbol. */
5687 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5689 if (strncmp (sym_name
, text
, text_len
) == 0)
5693 /* Finally: If we found a mach, prepare the result to return. */
5699 sym_name
= add_angle_brackets (sym_name
);
5702 sym_name
= ada_decode (sym_name
);
5707 /* A companion function to ada_make_symbol_completion_list().
5708 Check if SYM_NAME represents a symbol which name would be suitable
5709 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5710 it is appended at the end of the given string vector SV.
5712 ORIG_TEXT is the string original string from the user command
5713 that needs to be completed. WORD is the entire command on which
5714 completion should be performed. These two parameters are used to
5715 determine which part of the symbol name should be added to the
5717 if WILD_MATCH is set, then wild matching is performed.
5718 ENCODED should be set if TEXT represents a symbol name in its
5719 encoded formed (in which case the completion should also be
5723 symbol_completion_add (VEC(char_ptr
) **sv
,
5724 const char *sym_name
,
5725 const char *text
, int text_len
,
5726 const char *orig_text
, const char *word
,
5727 int wild_match
, int encoded
)
5729 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5730 wild_match
, encoded
);
5736 /* We found a match, so add the appropriate completion to the given
5739 if (word
== orig_text
)
5741 completion
= xmalloc (strlen (match
) + 5);
5742 strcpy (completion
, match
);
5744 else if (word
> orig_text
)
5746 /* Return some portion of sym_name. */
5747 completion
= xmalloc (strlen (match
) + 5);
5748 strcpy (completion
, match
+ (word
- orig_text
));
5752 /* Return some of ORIG_TEXT plus sym_name. */
5753 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5754 strncpy (completion
, word
, orig_text
- word
);
5755 completion
[orig_text
- word
] = '\0';
5756 strcat (completion
, match
);
5759 VEC_safe_push (char_ptr
, *sv
, completion
);
5762 /* An object of this type is passed as the user_data argument to the
5763 expand_partial_symbol_names method. */
5764 struct add_partial_datum
5766 VEC(char_ptr
) **completions
;
5775 /* A callback for expand_partial_symbol_names. */
5777 ada_expand_partial_symbol_name (const char *name
, void *user_data
)
5779 struct add_partial_datum
*data
= user_data
;
5781 return symbol_completion_match (name
, data
->text
, data
->text_len
,
5782 data
->wild_match
, data
->encoded
) != NULL
;
5785 /* Return a list of possible symbol names completing TEXT0. The list
5786 is NULL terminated. WORD is the entire command on which completion
5790 ada_make_symbol_completion_list (char *text0
, char *word
)
5796 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5799 struct minimal_symbol
*msymbol
;
5800 struct objfile
*objfile
;
5801 struct block
*b
, *surrounding_static_block
= 0;
5803 struct dict_iterator iter
;
5805 if (text0
[0] == '<')
5807 text
= xstrdup (text0
);
5808 make_cleanup (xfree
, text
);
5809 text_len
= strlen (text
);
5815 text
= xstrdup (ada_encode (text0
));
5816 make_cleanup (xfree
, text
);
5817 text_len
= strlen (text
);
5818 for (i
= 0; i
< text_len
; i
++)
5819 text
[i
] = tolower (text
[i
]);
5821 encoded
= (strstr (text0
, "__") != NULL
);
5822 /* If the name contains a ".", then the user is entering a fully
5823 qualified entity name, and the match must not be done in wild
5824 mode. Similarly, if the user wants to complete what looks like
5825 an encoded name, the match must not be done in wild mode. */
5826 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5829 /* First, look at the partial symtab symbols. */
5831 struct add_partial_datum data
;
5833 data
.completions
= &completions
;
5835 data
.text_len
= text_len
;
5838 data
.wild_match
= wild_match
;
5839 data
.encoded
= encoded
;
5840 expand_partial_symbol_names (ada_expand_partial_symbol_name
, &data
);
5843 /* At this point scan through the misc symbol vectors and add each
5844 symbol you find to the list. Eventually we want to ignore
5845 anything that isn't a text symbol (everything else will be
5846 handled by the psymtab code above). */
5848 ALL_MSYMBOLS (objfile
, msymbol
)
5851 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5852 text
, text_len
, text0
, word
, wild_match
, encoded
);
5855 /* Search upwards from currently selected frame (so that we can
5856 complete on local vars. */
5858 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5860 if (!BLOCK_SUPERBLOCK (b
))
5861 surrounding_static_block
= b
; /* For elmin of dups */
5863 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5865 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5866 text
, text_len
, text0
, word
,
5867 wild_match
, encoded
);
5871 /* Go through the symtabs and check the externs and statics for
5872 symbols which match. */
5874 ALL_SYMTABS (objfile
, s
)
5877 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5878 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5880 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5881 text
, text_len
, text0
, word
,
5882 wild_match
, encoded
);
5886 ALL_SYMTABS (objfile
, s
)
5889 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5890 /* Don't do this block twice. */
5891 if (b
== surrounding_static_block
)
5893 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5895 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5896 text
, text_len
, text0
, word
,
5897 wild_match
, encoded
);
5901 /* Append the closing NULL entry. */
5902 VEC_safe_push (char_ptr
, completions
, NULL
);
5904 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5905 return the copy. It's unfortunate that we have to make a copy
5906 of an array that we're about to destroy, but there is nothing much
5907 we can do about it. Fortunately, it's typically not a very large
5910 const size_t completions_size
=
5911 VEC_length (char_ptr
, completions
) * sizeof (char *);
5912 char **result
= xmalloc (completions_size
);
5914 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5916 VEC_free (char_ptr
, completions
);
5923 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5924 for tagged types. */
5927 ada_is_dispatch_table_ptr_type (struct type
*type
)
5931 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5934 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5938 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5941 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5942 to be invisible to users. */
5945 ada_is_ignored_field (struct type
*type
, int field_num
)
5947 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5950 /* Check the name of that field. */
5952 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5954 /* Anonymous field names should not be printed.
5955 brobecker/2007-02-20: I don't think this can actually happen
5956 but we don't want to print the value of annonymous fields anyway. */
5960 /* Normally, fields whose name start with an underscore ("_")
5961 are fields that have been internally generated by the compiler,
5962 and thus should not be printed. The "_parent" field is special,
5963 however: This is a field internally generated by the compiler
5964 for tagged types, and it contains the components inherited from
5965 the parent type. This field should not be printed as is, but
5966 should not be ignored either. */
5967 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5971 /* If this is the dispatch table of a tagged type, then ignore. */
5972 if (ada_is_tagged_type (type
, 1)
5973 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5976 /* Not a special field, so it should not be ignored. */
5980 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5981 pointer or reference type whose ultimate target has a tag field. */
5984 ada_is_tagged_type (struct type
*type
, int refok
)
5986 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5989 /* True iff TYPE represents the type of X'Tag */
5992 ada_is_tag_type (struct type
*type
)
5994 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5998 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6000 return (name
!= NULL
6001 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6005 /* The type of the tag on VAL. */
6008 ada_tag_type (struct value
*val
)
6010 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6013 /* The value of the tag on VAL. */
6016 ada_value_tag (struct value
*val
)
6018 return ada_value_struct_elt (val
, "_tag", 0);
6021 /* The value of the tag on the object of type TYPE whose contents are
6022 saved at VALADDR, if it is non-null, or is at memory address
6025 static struct value
*
6026 value_tag_from_contents_and_address (struct type
*type
,
6027 const gdb_byte
*valaddr
,
6030 int tag_byte_offset
;
6031 struct type
*tag_type
;
6033 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6036 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6038 : valaddr
+ tag_byte_offset
);
6039 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6041 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6046 static struct type
*
6047 type_from_tag (struct value
*tag
)
6049 const char *type_name
= ada_tag_name (tag
);
6051 if (type_name
!= NULL
)
6052 return ada_find_any_type (ada_encode (type_name
));
6056 /* Return the "ada__tags__type_specific_data" type. */
6058 static struct type
*
6059 ada_get_tsd_type (struct inferior
*inf
)
6061 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6063 if (data
->tsd_type
== 0)
6064 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6065 return data
->tsd_type
;
6068 /* Return the TSD (type-specific data) associated to the given TAG.
6069 TAG is assumed to be the tag of a tagged-type entity.
6071 May return NULL if we are unable to get the TSD. */
6073 static struct value
*
6074 ada_get_tsd_from_tag (struct value
*tag
)
6079 /* First option: The TSD is simply stored as a field of our TAG.
6080 Only older versions of GNAT would use this format, but we have
6081 to test it first, because there are no visible markers for
6082 the current approach except the absence of that field. */
6084 val
= ada_value_struct_elt (tag
, "tsd", 1);
6088 /* Try the second representation for the dispatch table (in which
6089 there is no explicit 'tsd' field in the referent of the tag pointer,
6090 and instead the tsd pointer is stored just before the dispatch
6093 type
= ada_get_tsd_type (current_inferior());
6096 type
= lookup_pointer_type (lookup_pointer_type (type
));
6097 val
= value_cast (type
, tag
);
6100 return value_ind (value_ptradd (val
, -1));
6103 /* Given the TSD of a tag (type-specific data), return a string
6104 containing the name of the associated type.
6106 The returned value is good until the next call. May return NULL
6107 if we are unable to determine the tag name. */
6110 ada_tag_name_from_tsd (struct value
*tsd
)
6112 static char name
[1024];
6116 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6119 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6120 for (p
= name
; *p
!= '\0'; p
+= 1)
6126 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6129 Return NULL if the TAG is not an Ada tag, or if we were unable to
6130 determine the name of that tag. The result is good until the next
6134 ada_tag_name (struct value
*tag
)
6136 volatile struct gdb_exception e
;
6139 if (!ada_is_tag_type (value_type (tag
)))
6142 /* It is perfectly possible that an exception be raised while trying
6143 to determine the TAG's name, even under normal circumstances:
6144 The associated variable may be uninitialized or corrupted, for
6145 instance. We do not let any exception propagate past this point.
6146 instead we return NULL.
6148 We also do not print the error message either (which often is very
6149 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6150 the caller print a more meaningful message if necessary. */
6151 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6153 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6156 name
= ada_tag_name_from_tsd (tsd
);
6162 /* The parent type of TYPE, or NULL if none. */
6165 ada_parent_type (struct type
*type
)
6169 type
= ada_check_typedef (type
);
6171 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6174 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6175 if (ada_is_parent_field (type
, i
))
6177 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6179 /* If the _parent field is a pointer, then dereference it. */
6180 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6181 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6182 /* If there is a parallel XVS type, get the actual base type. */
6183 parent_type
= ada_get_base_type (parent_type
);
6185 return ada_check_typedef (parent_type
);
6191 /* True iff field number FIELD_NUM of structure type TYPE contains the
6192 parent-type (inherited) fields of a derived type. Assumes TYPE is
6193 a structure type with at least FIELD_NUM+1 fields. */
6196 ada_is_parent_field (struct type
*type
, int field_num
)
6198 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6200 return (name
!= NULL
6201 && (strncmp (name
, "PARENT", 6) == 0
6202 || strncmp (name
, "_parent", 7) == 0));
6205 /* True iff field number FIELD_NUM of structure type TYPE is a
6206 transparent wrapper field (which should be silently traversed when doing
6207 field selection and flattened when printing). Assumes TYPE is a
6208 structure type with at least FIELD_NUM+1 fields. Such fields are always
6212 ada_is_wrapper_field (struct type
*type
, int field_num
)
6214 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6216 return (name
!= NULL
6217 && (strncmp (name
, "PARENT", 6) == 0
6218 || strcmp (name
, "REP") == 0
6219 || strncmp (name
, "_parent", 7) == 0
6220 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6223 /* True iff field number FIELD_NUM of structure or union type TYPE
6224 is a variant wrapper. Assumes TYPE is a structure type with at least
6225 FIELD_NUM+1 fields. */
6228 ada_is_variant_part (struct type
*type
, int field_num
)
6230 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6232 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6233 || (is_dynamic_field (type
, field_num
)
6234 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6235 == TYPE_CODE_UNION
)));
6238 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6239 whose discriminants are contained in the record type OUTER_TYPE,
6240 returns the type of the controlling discriminant for the variant.
6241 May return NULL if the type could not be found. */
6244 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6246 char *name
= ada_variant_discrim_name (var_type
);
6248 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6251 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6252 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6253 represents a 'when others' clause; otherwise 0. */
6256 ada_is_others_clause (struct type
*type
, int field_num
)
6258 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6260 return (name
!= NULL
&& name
[0] == 'O');
6263 /* Assuming that TYPE0 is the type of the variant part of a record,
6264 returns the name of the discriminant controlling the variant.
6265 The value is valid until the next call to ada_variant_discrim_name. */
6268 ada_variant_discrim_name (struct type
*type0
)
6270 static char *result
= NULL
;
6271 static size_t result_len
= 0;
6274 const char *discrim_end
;
6275 const char *discrim_start
;
6277 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6278 type
= TYPE_TARGET_TYPE (type0
);
6282 name
= ada_type_name (type
);
6284 if (name
== NULL
|| name
[0] == '\000')
6287 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6290 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6293 if (discrim_end
== name
)
6296 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6299 if (discrim_start
== name
+ 1)
6301 if ((discrim_start
> name
+ 3
6302 && strncmp (discrim_start
- 3, "___", 3) == 0)
6303 || discrim_start
[-1] == '.')
6307 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6308 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6309 result
[discrim_end
- discrim_start
] = '\0';
6313 /* Scan STR for a subtype-encoded number, beginning at position K.
6314 Put the position of the character just past the number scanned in
6315 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6316 Return 1 if there was a valid number at the given position, and 0
6317 otherwise. A "subtype-encoded" number consists of the absolute value
6318 in decimal, followed by the letter 'm' to indicate a negative number.
6319 Assumes 0m does not occur. */
6322 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6326 if (!isdigit (str
[k
]))
6329 /* Do it the hard way so as not to make any assumption about
6330 the relationship of unsigned long (%lu scan format code) and
6333 while (isdigit (str
[k
]))
6335 RU
= RU
* 10 + (str
[k
] - '0');
6342 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6348 /* NOTE on the above: Technically, C does not say what the results of
6349 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6350 number representable as a LONGEST (although either would probably work
6351 in most implementations). When RU>0, the locution in the then branch
6352 above is always equivalent to the negative of RU. */
6359 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6360 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6361 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6364 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6366 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6380 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6390 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6391 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6393 if (val
>= L
&& val
<= U
)
6405 /* FIXME: Lots of redundancy below. Try to consolidate. */
6407 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6408 ARG_TYPE, extract and return the value of one of its (non-static)
6409 fields. FIELDNO says which field. Differs from value_primitive_field
6410 only in that it can handle packed values of arbitrary type. */
6412 static struct value
*
6413 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6414 struct type
*arg_type
)
6418 arg_type
= ada_check_typedef (arg_type
);
6419 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6421 /* Handle packed fields. */
6423 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6425 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6426 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6428 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6429 offset
+ bit_pos
/ 8,
6430 bit_pos
% 8, bit_size
, type
);
6433 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6436 /* Find field with name NAME in object of type TYPE. If found,
6437 set the following for each argument that is non-null:
6438 - *FIELD_TYPE_P to the field's type;
6439 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6440 an object of that type;
6441 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6442 - *BIT_SIZE_P to its size in bits if the field is packed, and
6444 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6445 fields up to but not including the desired field, or by the total
6446 number of fields if not found. A NULL value of NAME never
6447 matches; the function just counts visible fields in this case.
6449 Returns 1 if found, 0 otherwise. */
6452 find_struct_field (const char *name
, struct type
*type
, int offset
,
6453 struct type
**field_type_p
,
6454 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6459 type
= ada_check_typedef (type
);
6461 if (field_type_p
!= NULL
)
6462 *field_type_p
= NULL
;
6463 if (byte_offset_p
!= NULL
)
6465 if (bit_offset_p
!= NULL
)
6467 if (bit_size_p
!= NULL
)
6470 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6472 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6473 int fld_offset
= offset
+ bit_pos
/ 8;
6474 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6476 if (t_field_name
== NULL
)
6479 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6481 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6483 if (field_type_p
!= NULL
)
6484 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6485 if (byte_offset_p
!= NULL
)
6486 *byte_offset_p
= fld_offset
;
6487 if (bit_offset_p
!= NULL
)
6488 *bit_offset_p
= bit_pos
% 8;
6489 if (bit_size_p
!= NULL
)
6490 *bit_size_p
= bit_size
;
6493 else if (ada_is_wrapper_field (type
, i
))
6495 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6496 field_type_p
, byte_offset_p
, bit_offset_p
,
6497 bit_size_p
, index_p
))
6500 else if (ada_is_variant_part (type
, i
))
6502 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6505 struct type
*field_type
6506 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6508 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6510 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6512 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6513 field_type_p
, byte_offset_p
,
6514 bit_offset_p
, bit_size_p
, index_p
))
6518 else if (index_p
!= NULL
)
6524 /* Number of user-visible fields in record type TYPE. */
6527 num_visible_fields (struct type
*type
)
6532 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6536 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6537 and search in it assuming it has (class) type TYPE.
6538 If found, return value, else return NULL.
6540 Searches recursively through wrapper fields (e.g., '_parent'). */
6542 static struct value
*
6543 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6548 type
= ada_check_typedef (type
);
6549 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6551 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6553 if (t_field_name
== NULL
)
6556 else if (field_name_match (t_field_name
, name
))
6557 return ada_value_primitive_field (arg
, offset
, i
, type
);
6559 else if (ada_is_wrapper_field (type
, i
))
6561 struct value
*v
= /* Do not let indent join lines here. */
6562 ada_search_struct_field (name
, arg
,
6563 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6564 TYPE_FIELD_TYPE (type
, i
));
6570 else if (ada_is_variant_part (type
, i
))
6572 /* PNH: Do we ever get here? See find_struct_field. */
6574 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6576 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6578 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6580 struct value
*v
= ada_search_struct_field
/* Force line
6583 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6584 TYPE_FIELD_TYPE (field_type
, j
));
6594 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6595 int, struct type
*);
6598 /* Return field #INDEX in ARG, where the index is that returned by
6599 * find_struct_field through its INDEX_P argument. Adjust the address
6600 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6601 * If found, return value, else return NULL. */
6603 static struct value
*
6604 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6607 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6611 /* Auxiliary function for ada_index_struct_field. Like
6612 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6615 static struct value
*
6616 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6620 type
= ada_check_typedef (type
);
6622 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6624 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6626 else if (ada_is_wrapper_field (type
, i
))
6628 struct value
*v
= /* Do not let indent join lines here. */
6629 ada_index_struct_field_1 (index_p
, arg
,
6630 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6631 TYPE_FIELD_TYPE (type
, i
));
6637 else if (ada_is_variant_part (type
, i
))
6639 /* PNH: Do we ever get here? See ada_search_struct_field,
6640 find_struct_field. */
6641 error (_("Cannot assign this kind of variant record"));
6643 else if (*index_p
== 0)
6644 return ada_value_primitive_field (arg
, offset
, i
, type
);
6651 /* Given ARG, a value of type (pointer or reference to a)*
6652 structure/union, extract the component named NAME from the ultimate
6653 target structure/union and return it as a value with its
6656 The routine searches for NAME among all members of the structure itself
6657 and (recursively) among all members of any wrapper members
6660 If NO_ERR, then simply return NULL in case of error, rather than
6664 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6666 struct type
*t
, *t1
;
6670 t1
= t
= ada_check_typedef (value_type (arg
));
6671 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6673 t1
= TYPE_TARGET_TYPE (t
);
6676 t1
= ada_check_typedef (t1
);
6677 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6679 arg
= coerce_ref (arg
);
6684 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6686 t1
= TYPE_TARGET_TYPE (t
);
6689 t1
= ada_check_typedef (t1
);
6690 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6692 arg
= value_ind (arg
);
6699 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6703 v
= ada_search_struct_field (name
, arg
, 0, t
);
6706 int bit_offset
, bit_size
, byte_offset
;
6707 struct type
*field_type
;
6710 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6711 address
= value_as_address (arg
);
6713 address
= unpack_pointer (t
, value_contents (arg
));
6715 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6716 if (find_struct_field (name
, t1
, 0,
6717 &field_type
, &byte_offset
, &bit_offset
,
6722 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6723 arg
= ada_coerce_ref (arg
);
6725 arg
= ada_value_ind (arg
);
6726 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6727 bit_offset
, bit_size
,
6731 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6735 if (v
!= NULL
|| no_err
)
6738 error (_("There is no member named %s."), name
);
6744 error (_("Attempt to extract a component of "
6745 "a value that is not a record."));
6748 /* Given a type TYPE, look up the type of the component of type named NAME.
6749 If DISPP is non-null, add its byte displacement from the beginning of a
6750 structure (pointed to by a value) of type TYPE to *DISPP (does not
6751 work for packed fields).
6753 Matches any field whose name has NAME as a prefix, possibly
6756 TYPE can be either a struct or union. If REFOK, TYPE may also
6757 be a (pointer or reference)+ to a struct or union, and the
6758 ultimate target type will be searched.
6760 Looks recursively into variant clauses and parent types.
6762 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6763 TYPE is not a type of the right kind. */
6765 static struct type
*
6766 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6767 int noerr
, int *dispp
)
6774 if (refok
&& type
!= NULL
)
6777 type
= ada_check_typedef (type
);
6778 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6779 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6781 type
= TYPE_TARGET_TYPE (type
);
6785 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6786 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6792 target_terminal_ours ();
6793 gdb_flush (gdb_stdout
);
6795 error (_("Type (null) is not a structure or union type"));
6798 /* XXX: type_sprint */
6799 fprintf_unfiltered (gdb_stderr
, _("Type "));
6800 type_print (type
, "", gdb_stderr
, -1);
6801 error (_(" is not a structure or union type"));
6806 type
= to_static_fixed_type (type
);
6808 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6810 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6814 if (t_field_name
== NULL
)
6817 else if (field_name_match (t_field_name
, name
))
6820 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6821 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6824 else if (ada_is_wrapper_field (type
, i
))
6827 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6832 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6837 else if (ada_is_variant_part (type
, i
))
6840 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6843 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6845 /* FIXME pnh 2008/01/26: We check for a field that is
6846 NOT wrapped in a struct, since the compiler sometimes
6847 generates these for unchecked variant types. Revisit
6848 if the compiler changes this practice. */
6849 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6851 if (v_field_name
!= NULL
6852 && field_name_match (v_field_name
, name
))
6853 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6855 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
6862 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6873 target_terminal_ours ();
6874 gdb_flush (gdb_stdout
);
6877 /* XXX: type_sprint */
6878 fprintf_unfiltered (gdb_stderr
, _("Type "));
6879 type_print (type
, "", gdb_stderr
, -1);
6880 error (_(" has no component named <null>"));
6884 /* XXX: type_sprint */
6885 fprintf_unfiltered (gdb_stderr
, _("Type "));
6886 type_print (type
, "", gdb_stderr
, -1);
6887 error (_(" has no component named %s"), name
);
6894 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6895 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6896 represents an unchecked union (that is, the variant part of a
6897 record that is named in an Unchecked_Union pragma). */
6900 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6902 char *discrim_name
= ada_variant_discrim_name (var_type
);
6904 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6909 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6910 within a value of type OUTER_TYPE that is stored in GDB at
6911 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6912 numbering from 0) is applicable. Returns -1 if none are. */
6915 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6916 const gdb_byte
*outer_valaddr
)
6920 char *discrim_name
= ada_variant_discrim_name (var_type
);
6921 struct value
*outer
;
6922 struct value
*discrim
;
6923 LONGEST discrim_val
;
6925 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6926 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6927 if (discrim
== NULL
)
6929 discrim_val
= value_as_long (discrim
);
6932 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6934 if (ada_is_others_clause (var_type
, i
))
6936 else if (ada_in_variant (discrim_val
, var_type
, i
))
6940 return others_clause
;
6945 /* Dynamic-Sized Records */
6947 /* Strategy: The type ostensibly attached to a value with dynamic size
6948 (i.e., a size that is not statically recorded in the debugging
6949 data) does not accurately reflect the size or layout of the value.
6950 Our strategy is to convert these values to values with accurate,
6951 conventional types that are constructed on the fly. */
6953 /* There is a subtle and tricky problem here. In general, we cannot
6954 determine the size of dynamic records without its data. However,
6955 the 'struct value' data structure, which GDB uses to represent
6956 quantities in the inferior process (the target), requires the size
6957 of the type at the time of its allocation in order to reserve space
6958 for GDB's internal copy of the data. That's why the
6959 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6960 rather than struct value*s.
6962 However, GDB's internal history variables ($1, $2, etc.) are
6963 struct value*s containing internal copies of the data that are not, in
6964 general, the same as the data at their corresponding addresses in
6965 the target. Fortunately, the types we give to these values are all
6966 conventional, fixed-size types (as per the strategy described
6967 above), so that we don't usually have to perform the
6968 'to_fixed_xxx_type' conversions to look at their values.
6969 Unfortunately, there is one exception: if one of the internal
6970 history variables is an array whose elements are unconstrained
6971 records, then we will need to create distinct fixed types for each
6972 element selected. */
6974 /* The upshot of all of this is that many routines take a (type, host
6975 address, target address) triple as arguments to represent a value.
6976 The host address, if non-null, is supposed to contain an internal
6977 copy of the relevant data; otherwise, the program is to consult the
6978 target at the target address. */
6980 /* Assuming that VAL0 represents a pointer value, the result of
6981 dereferencing it. Differs from value_ind in its treatment of
6982 dynamic-sized types. */
6985 ada_value_ind (struct value
*val0
)
6987 struct value
*val
= value_ind (val0
);
6989 return ada_to_fixed_value (val
);
6992 /* The value resulting from dereferencing any "reference to"
6993 qualifiers on VAL0. */
6995 static struct value
*
6996 ada_coerce_ref (struct value
*val0
)
6998 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7000 struct value
*val
= val0
;
7002 val
= coerce_ref (val
);
7003 return ada_to_fixed_value (val
);
7009 /* Return OFF rounded upward if necessary to a multiple of
7010 ALIGNMENT (a power of 2). */
7013 align_value (unsigned int off
, unsigned int alignment
)
7015 return (off
+ alignment
- 1) & ~(alignment
- 1);
7018 /* Return the bit alignment required for field #F of template type TYPE. */
7021 field_alignment (struct type
*type
, int f
)
7023 const char *name
= TYPE_FIELD_NAME (type
, f
);
7027 /* The field name should never be null, unless the debugging information
7028 is somehow malformed. In this case, we assume the field does not
7029 require any alignment. */
7033 len
= strlen (name
);
7035 if (!isdigit (name
[len
- 1]))
7038 if (isdigit (name
[len
- 2]))
7039 align_offset
= len
- 2;
7041 align_offset
= len
- 1;
7043 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7044 return TARGET_CHAR_BIT
;
7046 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7049 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7051 static struct symbol
*
7052 ada_find_any_type_symbol (const char *name
)
7056 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7057 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7060 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7064 /* Find a type named NAME. Ignores ambiguity. This routine will look
7065 solely for types defined by debug info, it will not search the GDB
7068 static struct type
*
7069 ada_find_any_type (const char *name
)
7071 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7074 return SYMBOL_TYPE (sym
);
7079 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7080 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7081 symbol, in which case it is returned. Otherwise, this looks for
7082 symbols whose name is that of NAME_SYM suffixed with "___XR".
7083 Return symbol if found, and NULL otherwise. */
7086 ada_find_renaming_symbol (struct symbol
*name_sym
, struct block
*block
)
7088 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7091 if (strstr (name
, "___XR") != NULL
)
7094 sym
= find_old_style_renaming_symbol (name
, block
);
7099 /* Not right yet. FIXME pnh 7/20/2007. */
7100 sym
= ada_find_any_type_symbol (name
);
7101 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7107 static struct symbol
*
7108 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
7110 const struct symbol
*function_sym
= block_linkage_function (block
);
7113 if (function_sym
!= NULL
)
7115 /* If the symbol is defined inside a function, NAME is not fully
7116 qualified. This means we need to prepend the function name
7117 as well as adding the ``___XR'' suffix to build the name of
7118 the associated renaming symbol. */
7119 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7120 /* Function names sometimes contain suffixes used
7121 for instance to qualify nested subprograms. When building
7122 the XR type name, we need to make sure that this suffix is
7123 not included. So do not include any suffix in the function
7124 name length below. */
7125 int function_name_len
= ada_name_prefix_len (function_name
);
7126 const int rename_len
= function_name_len
+ 2 /* "__" */
7127 + strlen (name
) + 6 /* "___XR\0" */ ;
7129 /* Strip the suffix if necessary. */
7130 ada_remove_trailing_digits (function_name
, &function_name_len
);
7131 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7132 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7134 /* Library-level functions are a special case, as GNAT adds
7135 a ``_ada_'' prefix to the function name to avoid namespace
7136 pollution. However, the renaming symbols themselves do not
7137 have this prefix, so we need to skip this prefix if present. */
7138 if (function_name_len
> 5 /* "_ada_" */
7139 && strstr (function_name
, "_ada_") == function_name
)
7142 function_name_len
-= 5;
7145 rename
= (char *) alloca (rename_len
* sizeof (char));
7146 strncpy (rename
, function_name
, function_name_len
);
7147 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7152 const int rename_len
= strlen (name
) + 6;
7154 rename
= (char *) alloca (rename_len
* sizeof (char));
7155 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7158 return ada_find_any_type_symbol (rename
);
7161 /* Because of GNAT encoding conventions, several GDB symbols may match a
7162 given type name. If the type denoted by TYPE0 is to be preferred to
7163 that of TYPE1 for purposes of type printing, return non-zero;
7164 otherwise return 0. */
7167 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7171 else if (type0
== NULL
)
7173 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7175 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7177 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7179 else if (ada_is_constrained_packed_array_type (type0
))
7181 else if (ada_is_array_descriptor_type (type0
)
7182 && !ada_is_array_descriptor_type (type1
))
7186 const char *type0_name
= type_name_no_tag (type0
);
7187 const char *type1_name
= type_name_no_tag (type1
);
7189 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7190 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7196 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7197 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7200 ada_type_name (struct type
*type
)
7204 else if (TYPE_NAME (type
) != NULL
)
7205 return TYPE_NAME (type
);
7207 return TYPE_TAG_NAME (type
);
7210 /* Search the list of "descriptive" types associated to TYPE for a type
7211 whose name is NAME. */
7213 static struct type
*
7214 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7216 struct type
*result
;
7218 /* If there no descriptive-type info, then there is no parallel type
7220 if (!HAVE_GNAT_AUX_INFO (type
))
7223 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7224 while (result
!= NULL
)
7226 const char *result_name
= ada_type_name (result
);
7228 if (result_name
== NULL
)
7230 warning (_("unexpected null name on descriptive type"));
7234 /* If the names match, stop. */
7235 if (strcmp (result_name
, name
) == 0)
7238 /* Otherwise, look at the next item on the list, if any. */
7239 if (HAVE_GNAT_AUX_INFO (result
))
7240 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7245 /* If we didn't find a match, see whether this is a packed array. With
7246 older compilers, the descriptive type information is either absent or
7247 irrelevant when it comes to packed arrays so the above lookup fails.
7248 Fall back to using a parallel lookup by name in this case. */
7249 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7250 return ada_find_any_type (name
);
7255 /* Find a parallel type to TYPE with the specified NAME, using the
7256 descriptive type taken from the debugging information, if available,
7257 and otherwise using the (slower) name-based method. */
7259 static struct type
*
7260 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7262 struct type
*result
= NULL
;
7264 if (HAVE_GNAT_AUX_INFO (type
))
7265 result
= find_parallel_type_by_descriptive_type (type
, name
);
7267 result
= ada_find_any_type (name
);
7272 /* Same as above, but specify the name of the parallel type by appending
7273 SUFFIX to the name of TYPE. */
7276 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7279 const char *typename
= ada_type_name (type
);
7282 if (typename
== NULL
)
7285 len
= strlen (typename
);
7287 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7289 strcpy (name
, typename
);
7290 strcpy (name
+ len
, suffix
);
7292 return ada_find_parallel_type_with_name (type
, name
);
7295 /* If TYPE is a variable-size record type, return the corresponding template
7296 type describing its fields. Otherwise, return NULL. */
7298 static struct type
*
7299 dynamic_template_type (struct type
*type
)
7301 type
= ada_check_typedef (type
);
7303 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7304 || ada_type_name (type
) == NULL
)
7308 int len
= strlen (ada_type_name (type
));
7310 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7313 return ada_find_parallel_type (type
, "___XVE");
7317 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7318 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7321 is_dynamic_field (struct type
*templ_type
, int field_num
)
7323 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7326 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7327 && strstr (name
, "___XVL") != NULL
;
7330 /* The index of the variant field of TYPE, or -1 if TYPE does not
7331 represent a variant record type. */
7334 variant_field_index (struct type
*type
)
7338 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7341 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7343 if (ada_is_variant_part (type
, f
))
7349 /* A record type with no fields. */
7351 static struct type
*
7352 empty_record (struct type
*template)
7354 struct type
*type
= alloc_type_copy (template);
7356 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7357 TYPE_NFIELDS (type
) = 0;
7358 TYPE_FIELDS (type
) = NULL
;
7359 INIT_CPLUS_SPECIFIC (type
);
7360 TYPE_NAME (type
) = "<empty>";
7361 TYPE_TAG_NAME (type
) = NULL
;
7362 TYPE_LENGTH (type
) = 0;
7366 /* An ordinary record type (with fixed-length fields) that describes
7367 the value of type TYPE at VALADDR or ADDRESS (see comments at
7368 the beginning of this section) VAL according to GNAT conventions.
7369 DVAL0 should describe the (portion of a) record that contains any
7370 necessary discriminants. It should be NULL if value_type (VAL) is
7371 an outer-level type (i.e., as opposed to a branch of a variant.) A
7372 variant field (unless unchecked) is replaced by a particular branch
7375 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7376 length are not statically known are discarded. As a consequence,
7377 VALADDR, ADDRESS and DVAL0 are ignored.
7379 NOTE: Limitations: For now, we assume that dynamic fields and
7380 variants occupy whole numbers of bytes. However, they need not be
7384 ada_template_to_fixed_record_type_1 (struct type
*type
,
7385 const gdb_byte
*valaddr
,
7386 CORE_ADDR address
, struct value
*dval0
,
7387 int keep_dynamic_fields
)
7389 struct value
*mark
= value_mark ();
7392 int nfields
, bit_len
;
7398 /* Compute the number of fields in this record type that are going
7399 to be processed: unless keep_dynamic_fields, this includes only
7400 fields whose position and length are static will be processed. */
7401 if (keep_dynamic_fields
)
7402 nfields
= TYPE_NFIELDS (type
);
7406 while (nfields
< TYPE_NFIELDS (type
)
7407 && !ada_is_variant_part (type
, nfields
)
7408 && !is_dynamic_field (type
, nfields
))
7412 rtype
= alloc_type_copy (type
);
7413 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7414 INIT_CPLUS_SPECIFIC (rtype
);
7415 TYPE_NFIELDS (rtype
) = nfields
;
7416 TYPE_FIELDS (rtype
) = (struct field
*)
7417 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7418 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7419 TYPE_NAME (rtype
) = ada_type_name (type
);
7420 TYPE_TAG_NAME (rtype
) = NULL
;
7421 TYPE_FIXED_INSTANCE (rtype
) = 1;
7427 for (f
= 0; f
< nfields
; f
+= 1)
7429 off
= align_value (off
, field_alignment (type
, f
))
7430 + TYPE_FIELD_BITPOS (type
, f
);
7431 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
7432 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7434 if (ada_is_variant_part (type
, f
))
7439 else if (is_dynamic_field (type
, f
))
7441 const gdb_byte
*field_valaddr
= valaddr
;
7442 CORE_ADDR field_address
= address
;
7443 struct type
*field_type
=
7444 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7448 /* rtype's length is computed based on the run-time
7449 value of discriminants. If the discriminants are not
7450 initialized, the type size may be completely bogus and
7451 GDB may fail to allocate a value for it. So check the
7452 size first before creating the value. */
7454 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7459 /* If the type referenced by this field is an aligner type, we need
7460 to unwrap that aligner type, because its size might not be set.
7461 Keeping the aligner type would cause us to compute the wrong
7462 size for this field, impacting the offset of the all the fields
7463 that follow this one. */
7464 if (ada_is_aligner_type (field_type
))
7466 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7468 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7469 field_address
= cond_offset_target (field_address
, field_offset
);
7470 field_type
= ada_aligned_type (field_type
);
7473 field_valaddr
= cond_offset_host (field_valaddr
,
7474 off
/ TARGET_CHAR_BIT
);
7475 field_address
= cond_offset_target (field_address
,
7476 off
/ TARGET_CHAR_BIT
);
7478 /* Get the fixed type of the field. Note that, in this case,
7479 we do not want to get the real type out of the tag: if
7480 the current field is the parent part of a tagged record,
7481 we will get the tag of the object. Clearly wrong: the real
7482 type of the parent is not the real type of the child. We
7483 would end up in an infinite loop. */
7484 field_type
= ada_get_base_type (field_type
);
7485 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7486 field_address
, dval
, 0);
7487 /* If the field size is already larger than the maximum
7488 object size, then the record itself will necessarily
7489 be larger than the maximum object size. We need to make
7490 this check now, because the size might be so ridiculously
7491 large (due to an uninitialized variable in the inferior)
7492 that it would cause an overflow when adding it to the
7494 check_size (field_type
);
7496 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7497 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7498 /* The multiplication can potentially overflow. But because
7499 the field length has been size-checked just above, and
7500 assuming that the maximum size is a reasonable value,
7501 an overflow should not happen in practice. So rather than
7502 adding overflow recovery code to this already complex code,
7503 we just assume that it's not going to happen. */
7505 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7509 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7511 /* If our field is a typedef type (most likely a typedef of
7512 a fat pointer, encoding an array access), then we need to
7513 look at its target type to determine its characteristics.
7514 In particular, we would miscompute the field size if we took
7515 the size of the typedef (zero), instead of the size of
7517 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7518 field_type
= ada_typedef_target_type (field_type
);
7520 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7521 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7522 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7524 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7527 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7529 if (off
+ fld_bit_len
> bit_len
)
7530 bit_len
= off
+ fld_bit_len
;
7532 TYPE_LENGTH (rtype
) =
7533 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7536 /* We handle the variant part, if any, at the end because of certain
7537 odd cases in which it is re-ordered so as NOT to be the last field of
7538 the record. This can happen in the presence of representation
7540 if (variant_field
>= 0)
7542 struct type
*branch_type
;
7544 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7547 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7552 to_fixed_variant_branch_type
7553 (TYPE_FIELD_TYPE (type
, variant_field
),
7554 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7555 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7556 if (branch_type
== NULL
)
7558 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7559 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7560 TYPE_NFIELDS (rtype
) -= 1;
7564 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7565 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7567 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7569 if (off
+ fld_bit_len
> bit_len
)
7570 bit_len
= off
+ fld_bit_len
;
7571 TYPE_LENGTH (rtype
) =
7572 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7576 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7577 should contain the alignment of that record, which should be a strictly
7578 positive value. If null or negative, then something is wrong, most
7579 probably in the debug info. In that case, we don't round up the size
7580 of the resulting type. If this record is not part of another structure,
7581 the current RTYPE length might be good enough for our purposes. */
7582 if (TYPE_LENGTH (type
) <= 0)
7584 if (TYPE_NAME (rtype
))
7585 warning (_("Invalid type size for `%s' detected: %d."),
7586 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7588 warning (_("Invalid type size for <unnamed> detected: %d."),
7589 TYPE_LENGTH (type
));
7593 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7594 TYPE_LENGTH (type
));
7597 value_free_to_mark (mark
);
7598 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7599 error (_("record type with dynamic size is larger than varsize-limit"));
7603 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7606 static struct type
*
7607 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7608 CORE_ADDR address
, struct value
*dval0
)
7610 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7614 /* An ordinary record type in which ___XVL-convention fields and
7615 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7616 static approximations, containing all possible fields. Uses
7617 no runtime values. Useless for use in values, but that's OK,
7618 since the results are used only for type determinations. Works on both
7619 structs and unions. Representation note: to save space, we memorize
7620 the result of this function in the TYPE_TARGET_TYPE of the
7623 static struct type
*
7624 template_to_static_fixed_type (struct type
*type0
)
7630 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7631 return TYPE_TARGET_TYPE (type0
);
7633 nfields
= TYPE_NFIELDS (type0
);
7636 for (f
= 0; f
< nfields
; f
+= 1)
7638 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7639 struct type
*new_type
;
7641 if (is_dynamic_field (type0
, f
))
7642 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7644 new_type
= static_unwrap_type (field_type
);
7645 if (type
== type0
&& new_type
!= field_type
)
7647 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7648 TYPE_CODE (type
) = TYPE_CODE (type0
);
7649 INIT_CPLUS_SPECIFIC (type
);
7650 TYPE_NFIELDS (type
) = nfields
;
7651 TYPE_FIELDS (type
) = (struct field
*)
7652 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7653 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7654 sizeof (struct field
) * nfields
);
7655 TYPE_NAME (type
) = ada_type_name (type0
);
7656 TYPE_TAG_NAME (type
) = NULL
;
7657 TYPE_FIXED_INSTANCE (type
) = 1;
7658 TYPE_LENGTH (type
) = 0;
7660 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7661 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7666 /* Given an object of type TYPE whose contents are at VALADDR and
7667 whose address in memory is ADDRESS, returns a revision of TYPE,
7668 which should be a non-dynamic-sized record, in which the variant
7669 part, if any, is replaced with the appropriate branch. Looks
7670 for discriminant values in DVAL0, which can be NULL if the record
7671 contains the necessary discriminant values. */
7673 static struct type
*
7674 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7675 CORE_ADDR address
, struct value
*dval0
)
7677 struct value
*mark
= value_mark ();
7680 struct type
*branch_type
;
7681 int nfields
= TYPE_NFIELDS (type
);
7682 int variant_field
= variant_field_index (type
);
7684 if (variant_field
== -1)
7688 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7692 rtype
= alloc_type_copy (type
);
7693 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7694 INIT_CPLUS_SPECIFIC (rtype
);
7695 TYPE_NFIELDS (rtype
) = nfields
;
7696 TYPE_FIELDS (rtype
) =
7697 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7698 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7699 sizeof (struct field
) * nfields
);
7700 TYPE_NAME (rtype
) = ada_type_name (type
);
7701 TYPE_TAG_NAME (rtype
) = NULL
;
7702 TYPE_FIXED_INSTANCE (rtype
) = 1;
7703 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7705 branch_type
= to_fixed_variant_branch_type
7706 (TYPE_FIELD_TYPE (type
, variant_field
),
7707 cond_offset_host (valaddr
,
7708 TYPE_FIELD_BITPOS (type
, variant_field
)
7710 cond_offset_target (address
,
7711 TYPE_FIELD_BITPOS (type
, variant_field
)
7712 / TARGET_CHAR_BIT
), dval
);
7713 if (branch_type
== NULL
)
7717 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7718 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7719 TYPE_NFIELDS (rtype
) -= 1;
7723 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7724 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7725 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7726 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7728 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7730 value_free_to_mark (mark
);
7734 /* An ordinary record type (with fixed-length fields) that describes
7735 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7736 beginning of this section]. Any necessary discriminants' values
7737 should be in DVAL, a record value; it may be NULL if the object
7738 at ADDR itself contains any necessary discriminant values.
7739 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7740 values from the record are needed. Except in the case that DVAL,
7741 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7742 unchecked) is replaced by a particular branch of the variant.
7744 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7745 is questionable and may be removed. It can arise during the
7746 processing of an unconstrained-array-of-record type where all the
7747 variant branches have exactly the same size. This is because in
7748 such cases, the compiler does not bother to use the XVS convention
7749 when encoding the record. I am currently dubious of this
7750 shortcut and suspect the compiler should be altered. FIXME. */
7752 static struct type
*
7753 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7754 CORE_ADDR address
, struct value
*dval
)
7756 struct type
*templ_type
;
7758 if (TYPE_FIXED_INSTANCE (type0
))
7761 templ_type
= dynamic_template_type (type0
);
7763 if (templ_type
!= NULL
)
7764 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7765 else if (variant_field_index (type0
) >= 0)
7767 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7769 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7774 TYPE_FIXED_INSTANCE (type0
) = 1;
7780 /* An ordinary record type (with fixed-length fields) that describes
7781 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7782 union type. Any necessary discriminants' values should be in DVAL,
7783 a record value. That is, this routine selects the appropriate
7784 branch of the union at ADDR according to the discriminant value
7785 indicated in the union's type name. Returns VAR_TYPE0 itself if
7786 it represents a variant subject to a pragma Unchecked_Union. */
7788 static struct type
*
7789 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7790 CORE_ADDR address
, struct value
*dval
)
7793 struct type
*templ_type
;
7794 struct type
*var_type
;
7796 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7797 var_type
= TYPE_TARGET_TYPE (var_type0
);
7799 var_type
= var_type0
;
7801 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7803 if (templ_type
!= NULL
)
7804 var_type
= templ_type
;
7806 if (is_unchecked_variant (var_type
, value_type (dval
)))
7809 ada_which_variant_applies (var_type
,
7810 value_type (dval
), value_contents (dval
));
7813 return empty_record (var_type
);
7814 else if (is_dynamic_field (var_type
, which
))
7815 return to_fixed_record_type
7816 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7817 valaddr
, address
, dval
);
7818 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7820 to_fixed_record_type
7821 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7823 return TYPE_FIELD_TYPE (var_type
, which
);
7826 /* Assuming that TYPE0 is an array type describing the type of a value
7827 at ADDR, and that DVAL describes a record containing any
7828 discriminants used in TYPE0, returns a type for the value that
7829 contains no dynamic components (that is, no components whose sizes
7830 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7831 true, gives an error message if the resulting type's size is over
7834 static struct type
*
7835 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7838 struct type
*index_type_desc
;
7839 struct type
*result
;
7840 int constrained_packed_array_p
;
7842 type0
= ada_check_typedef (type0
);
7843 if (TYPE_FIXED_INSTANCE (type0
))
7846 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7847 if (constrained_packed_array_p
)
7848 type0
= decode_constrained_packed_array_type (type0
);
7850 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7851 ada_fixup_array_indexes_type (index_type_desc
);
7852 if (index_type_desc
== NULL
)
7854 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7856 /* NOTE: elt_type---the fixed version of elt_type0---should never
7857 depend on the contents of the array in properly constructed
7859 /* Create a fixed version of the array element type.
7860 We're not providing the address of an element here,
7861 and thus the actual object value cannot be inspected to do
7862 the conversion. This should not be a problem, since arrays of
7863 unconstrained objects are not allowed. In particular, all
7864 the elements of an array of a tagged type should all be of
7865 the same type specified in the debugging info. No need to
7866 consult the object tag. */
7867 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7869 /* Make sure we always create a new array type when dealing with
7870 packed array types, since we're going to fix-up the array
7871 type length and element bitsize a little further down. */
7872 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7875 result
= create_array_type (alloc_type_copy (type0
),
7876 elt_type
, TYPE_INDEX_TYPE (type0
));
7881 struct type
*elt_type0
;
7884 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7885 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7887 /* NOTE: result---the fixed version of elt_type0---should never
7888 depend on the contents of the array in properly constructed
7890 /* Create a fixed version of the array element type.
7891 We're not providing the address of an element here,
7892 and thus the actual object value cannot be inspected to do
7893 the conversion. This should not be a problem, since arrays of
7894 unconstrained objects are not allowed. In particular, all
7895 the elements of an array of a tagged type should all be of
7896 the same type specified in the debugging info. No need to
7897 consult the object tag. */
7899 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7902 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7904 struct type
*range_type
=
7905 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
7907 result
= create_array_type (alloc_type_copy (elt_type0
),
7908 result
, range_type
);
7909 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7911 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7912 error (_("array type with dynamic size is larger than varsize-limit"));
7915 /* We want to preserve the type name. This can be useful when
7916 trying to get the type name of a value that has already been
7917 printed (for instance, if the user did "print VAR; whatis $". */
7918 TYPE_NAME (result
) = TYPE_NAME (type0
);
7920 if (constrained_packed_array_p
)
7922 /* So far, the resulting type has been created as if the original
7923 type was a regular (non-packed) array type. As a result, the
7924 bitsize of the array elements needs to be set again, and the array
7925 length needs to be recomputed based on that bitsize. */
7926 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7927 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7929 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7930 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7931 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7932 TYPE_LENGTH (result
)++;
7935 TYPE_FIXED_INSTANCE (result
) = 1;
7940 /* A standard type (containing no dynamically sized components)
7941 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7942 DVAL describes a record containing any discriminants used in TYPE0,
7943 and may be NULL if there are none, or if the object of type TYPE at
7944 ADDRESS or in VALADDR contains these discriminants.
7946 If CHECK_TAG is not null, in the case of tagged types, this function
7947 attempts to locate the object's tag and use it to compute the actual
7948 type. However, when ADDRESS is null, we cannot use it to determine the
7949 location of the tag, and therefore compute the tagged type's actual type.
7950 So we return the tagged type without consulting the tag. */
7952 static struct type
*
7953 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7954 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7956 type
= ada_check_typedef (type
);
7957 switch (TYPE_CODE (type
))
7961 case TYPE_CODE_STRUCT
:
7963 struct type
*static_type
= to_static_fixed_type (type
);
7964 struct type
*fixed_record_type
=
7965 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7967 /* If STATIC_TYPE is a tagged type and we know the object's address,
7968 then we can determine its tag, and compute the object's actual
7969 type from there. Note that we have to use the fixed record
7970 type (the parent part of the record may have dynamic fields
7971 and the way the location of _tag is expressed may depend on
7974 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7976 struct type
*real_type
=
7977 type_from_tag (value_tag_from_contents_and_address
7982 if (real_type
!= NULL
)
7983 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7986 /* Check to see if there is a parallel ___XVZ variable.
7987 If there is, then it provides the actual size of our type. */
7988 else if (ada_type_name (fixed_record_type
) != NULL
)
7990 const char *name
= ada_type_name (fixed_record_type
);
7991 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7995 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7996 size
= get_int_var_value (xvz_name
, &xvz_found
);
7997 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7999 fixed_record_type
= copy_type (fixed_record_type
);
8000 TYPE_LENGTH (fixed_record_type
) = size
;
8002 /* The FIXED_RECORD_TYPE may have be a stub. We have
8003 observed this when the debugging info is STABS, and
8004 apparently it is something that is hard to fix.
8006 In practice, we don't need the actual type definition
8007 at all, because the presence of the XVZ variable allows us
8008 to assume that there must be a XVS type as well, which we
8009 should be able to use later, when we need the actual type
8012 In the meantime, pretend that the "fixed" type we are
8013 returning is NOT a stub, because this can cause trouble
8014 when using this type to create new types targeting it.
8015 Indeed, the associated creation routines often check
8016 whether the target type is a stub and will try to replace
8017 it, thus using a type with the wrong size. This, in turn,
8018 might cause the new type to have the wrong size too.
8019 Consider the case of an array, for instance, where the size
8020 of the array is computed from the number of elements in
8021 our array multiplied by the size of its element. */
8022 TYPE_STUB (fixed_record_type
) = 0;
8025 return fixed_record_type
;
8027 case TYPE_CODE_ARRAY
:
8028 return to_fixed_array_type (type
, dval
, 1);
8029 case TYPE_CODE_UNION
:
8033 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8037 /* The same as ada_to_fixed_type_1, except that it preserves the type
8038 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8040 The typedef layer needs be preserved in order to differentiate between
8041 arrays and array pointers when both types are implemented using the same
8042 fat pointer. In the array pointer case, the pointer is encoded as
8043 a typedef of the pointer type. For instance, considering:
8045 type String_Access is access String;
8046 S1 : String_Access := null;
8048 To the debugger, S1 is defined as a typedef of type String. But
8049 to the user, it is a pointer. So if the user tries to print S1,
8050 we should not dereference the array, but print the array address
8053 If we didn't preserve the typedef layer, we would lose the fact that
8054 the type is to be presented as a pointer (needs de-reference before
8055 being printed). And we would also use the source-level type name. */
8058 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8059 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8062 struct type
*fixed_type
=
8063 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8065 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8066 then preserve the typedef layer.
8068 Implementation note: We can only check the main-type portion of
8069 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8070 from TYPE now returns a type that has the same instance flags
8071 as TYPE. For instance, if TYPE is a "typedef const", and its
8072 target type is a "struct", then the typedef elimination will return
8073 a "const" version of the target type. See check_typedef for more
8074 details about how the typedef layer elimination is done.
8076 brobecker/2010-11-19: It seems to me that the only case where it is
8077 useful to preserve the typedef layer is when dealing with fat pointers.
8078 Perhaps, we could add a check for that and preserve the typedef layer
8079 only in that situation. But this seems unecessary so far, probably
8080 because we call check_typedef/ada_check_typedef pretty much everywhere.
8082 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8083 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8084 == TYPE_MAIN_TYPE (fixed_type
)))
8090 /* A standard (static-sized) type corresponding as well as possible to
8091 TYPE0, but based on no runtime data. */
8093 static struct type
*
8094 to_static_fixed_type (struct type
*type0
)
8101 if (TYPE_FIXED_INSTANCE (type0
))
8104 type0
= ada_check_typedef (type0
);
8106 switch (TYPE_CODE (type0
))
8110 case TYPE_CODE_STRUCT
:
8111 type
= dynamic_template_type (type0
);
8113 return template_to_static_fixed_type (type
);
8115 return template_to_static_fixed_type (type0
);
8116 case TYPE_CODE_UNION
:
8117 type
= ada_find_parallel_type (type0
, "___XVU");
8119 return template_to_static_fixed_type (type
);
8121 return template_to_static_fixed_type (type0
);
8125 /* A static approximation of TYPE with all type wrappers removed. */
8127 static struct type
*
8128 static_unwrap_type (struct type
*type
)
8130 if (ada_is_aligner_type (type
))
8132 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8133 if (ada_type_name (type1
) == NULL
)
8134 TYPE_NAME (type1
) = ada_type_name (type
);
8136 return static_unwrap_type (type1
);
8140 struct type
*raw_real_type
= ada_get_base_type (type
);
8142 if (raw_real_type
== type
)
8145 return to_static_fixed_type (raw_real_type
);
8149 /* In some cases, incomplete and private types require
8150 cross-references that are not resolved as records (for example,
8152 type FooP is access Foo;
8154 type Foo is array ...;
8155 ). In these cases, since there is no mechanism for producing
8156 cross-references to such types, we instead substitute for FooP a
8157 stub enumeration type that is nowhere resolved, and whose tag is
8158 the name of the actual type. Call these types "non-record stubs". */
8160 /* A type equivalent to TYPE that is not a non-record stub, if one
8161 exists, otherwise TYPE. */
8164 ada_check_typedef (struct type
*type
)
8169 /* If our type is a typedef type of a fat pointer, then we're done.
8170 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8171 what allows us to distinguish between fat pointers that represent
8172 array types, and fat pointers that represent array access types
8173 (in both cases, the compiler implements them as fat pointers). */
8174 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8175 && is_thick_pntr (ada_typedef_target_type (type
)))
8178 CHECK_TYPEDEF (type
);
8179 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8180 || !TYPE_STUB (type
)
8181 || TYPE_TAG_NAME (type
) == NULL
)
8185 const char *name
= TYPE_TAG_NAME (type
);
8186 struct type
*type1
= ada_find_any_type (name
);
8191 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8192 stubs pointing to arrays, as we don't create symbols for array
8193 types, only for the typedef-to-array types). If that's the case,
8194 strip the typedef layer. */
8195 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8196 type1
= ada_check_typedef (type1
);
8202 /* A value representing the data at VALADDR/ADDRESS as described by
8203 type TYPE0, but with a standard (static-sized) type that correctly
8204 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8205 type, then return VAL0 [this feature is simply to avoid redundant
8206 creation of struct values]. */
8208 static struct value
*
8209 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8212 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8214 if (type
== type0
&& val0
!= NULL
)
8217 return value_from_contents_and_address (type
, 0, address
);
8220 /* A value representing VAL, but with a standard (static-sized) type
8221 that correctly describes it. Does not necessarily create a new
8225 ada_to_fixed_value (struct value
*val
)
8227 val
= unwrap_value (val
);
8228 val
= ada_to_fixed_value_create (value_type (val
),
8229 value_address (val
),
8237 /* Table mapping attribute numbers to names.
8238 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8240 static const char *attribute_names
[] = {
8258 ada_attribute_name (enum exp_opcode n
)
8260 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8261 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8263 return attribute_names
[0];
8266 /* Evaluate the 'POS attribute applied to ARG. */
8269 pos_atr (struct value
*arg
)
8271 struct value
*val
= coerce_ref (arg
);
8272 struct type
*type
= value_type (val
);
8274 if (!discrete_type_p (type
))
8275 error (_("'POS only defined on discrete types"));
8277 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8280 LONGEST v
= value_as_long (val
);
8282 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8284 if (v
== TYPE_FIELD_BITPOS (type
, i
))
8287 error (_("enumeration value is invalid: can't find 'POS"));
8290 return value_as_long (val
);
8293 static struct value
*
8294 value_pos_atr (struct type
*type
, struct value
*arg
)
8296 return value_from_longest (type
, pos_atr (arg
));
8299 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8301 static struct value
*
8302 value_val_atr (struct type
*type
, struct value
*arg
)
8304 if (!discrete_type_p (type
))
8305 error (_("'VAL only defined on discrete types"));
8306 if (!integer_type_p (value_type (arg
)))
8307 error (_("'VAL requires integral argument"));
8309 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8311 long pos
= value_as_long (arg
);
8313 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8314 error (_("argument to 'VAL out of range"));
8315 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
8318 return value_from_longest (type
, value_as_long (arg
));
8324 /* True if TYPE appears to be an Ada character type.
8325 [At the moment, this is true only for Character and Wide_Character;
8326 It is a heuristic test that could stand improvement]. */
8329 ada_is_character_type (struct type
*type
)
8333 /* If the type code says it's a character, then assume it really is,
8334 and don't check any further. */
8335 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8338 /* Otherwise, assume it's a character type iff it is a discrete type
8339 with a known character type name. */
8340 name
= ada_type_name (type
);
8341 return (name
!= NULL
8342 && (TYPE_CODE (type
) == TYPE_CODE_INT
8343 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8344 && (strcmp (name
, "character") == 0
8345 || strcmp (name
, "wide_character") == 0
8346 || strcmp (name
, "wide_wide_character") == 0
8347 || strcmp (name
, "unsigned char") == 0));
8350 /* True if TYPE appears to be an Ada string type. */
8353 ada_is_string_type (struct type
*type
)
8355 type
= ada_check_typedef (type
);
8357 && TYPE_CODE (type
) != TYPE_CODE_PTR
8358 && (ada_is_simple_array_type (type
)
8359 || ada_is_array_descriptor_type (type
))
8360 && ada_array_arity (type
) == 1)
8362 struct type
*elttype
= ada_array_element_type (type
, 1);
8364 return ada_is_character_type (elttype
);
8370 /* The compiler sometimes provides a parallel XVS type for a given
8371 PAD type. Normally, it is safe to follow the PAD type directly,
8372 but older versions of the compiler have a bug that causes the offset
8373 of its "F" field to be wrong. Following that field in that case
8374 would lead to incorrect results, but this can be worked around
8375 by ignoring the PAD type and using the associated XVS type instead.
8377 Set to True if the debugger should trust the contents of PAD types.
8378 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8379 static int trust_pad_over_xvs
= 1;
8381 /* True if TYPE is a struct type introduced by the compiler to force the
8382 alignment of a value. Such types have a single field with a
8383 distinctive name. */
8386 ada_is_aligner_type (struct type
*type
)
8388 type
= ada_check_typedef (type
);
8390 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8393 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8394 && TYPE_NFIELDS (type
) == 1
8395 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8398 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8399 the parallel type. */
8402 ada_get_base_type (struct type
*raw_type
)
8404 struct type
*real_type_namer
;
8405 struct type
*raw_real_type
;
8407 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8410 if (ada_is_aligner_type (raw_type
))
8411 /* The encoding specifies that we should always use the aligner type.
8412 So, even if this aligner type has an associated XVS type, we should
8415 According to the compiler gurus, an XVS type parallel to an aligner
8416 type may exist because of a stabs limitation. In stabs, aligner
8417 types are empty because the field has a variable-sized type, and
8418 thus cannot actually be used as an aligner type. As a result,
8419 we need the associated parallel XVS type to decode the type.
8420 Since the policy in the compiler is to not change the internal
8421 representation based on the debugging info format, we sometimes
8422 end up having a redundant XVS type parallel to the aligner type. */
8425 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8426 if (real_type_namer
== NULL
8427 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8428 || TYPE_NFIELDS (real_type_namer
) != 1)
8431 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8433 /* This is an older encoding form where the base type needs to be
8434 looked up by name. We prefer the newer enconding because it is
8436 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8437 if (raw_real_type
== NULL
)
8440 return raw_real_type
;
8443 /* The field in our XVS type is a reference to the base type. */
8444 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8447 /* The type of value designated by TYPE, with all aligners removed. */
8450 ada_aligned_type (struct type
*type
)
8452 if (ada_is_aligner_type (type
))
8453 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8455 return ada_get_base_type (type
);
8459 /* The address of the aligned value in an object at address VALADDR
8460 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8463 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8465 if (ada_is_aligner_type (type
))
8466 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8468 TYPE_FIELD_BITPOS (type
,
8469 0) / TARGET_CHAR_BIT
);
8476 /* The printed representation of an enumeration literal with encoded
8477 name NAME. The value is good to the next call of ada_enum_name. */
8479 ada_enum_name (const char *name
)
8481 static char *result
;
8482 static size_t result_len
= 0;
8485 /* First, unqualify the enumeration name:
8486 1. Search for the last '.' character. If we find one, then skip
8487 all the preceding characters, the unqualified name starts
8488 right after that dot.
8489 2. Otherwise, we may be debugging on a target where the compiler
8490 translates dots into "__". Search forward for double underscores,
8491 but stop searching when we hit an overloading suffix, which is
8492 of the form "__" followed by digits. */
8494 tmp
= strrchr (name
, '.');
8499 while ((tmp
= strstr (name
, "__")) != NULL
)
8501 if (isdigit (tmp
[2]))
8512 if (name
[1] == 'U' || name
[1] == 'W')
8514 if (sscanf (name
+ 2, "%x", &v
) != 1)
8520 GROW_VECT (result
, result_len
, 16);
8521 if (isascii (v
) && isprint (v
))
8522 xsnprintf (result
, result_len
, "'%c'", v
);
8523 else if (name
[1] == 'U')
8524 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8526 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
8532 tmp
= strstr (name
, "__");
8534 tmp
= strstr (name
, "$");
8537 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8538 strncpy (result
, name
, tmp
- name
);
8539 result
[tmp
- name
] = '\0';
8547 /* Evaluate the subexpression of EXP starting at *POS as for
8548 evaluate_type, updating *POS to point just past the evaluated
8551 static struct value
*
8552 evaluate_subexp_type (struct expression
*exp
, int *pos
)
8554 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8557 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8560 static struct value
*
8561 unwrap_value (struct value
*val
)
8563 struct type
*type
= ada_check_typedef (value_type (val
));
8565 if (ada_is_aligner_type (type
))
8567 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
8568 struct type
*val_type
= ada_check_typedef (value_type (v
));
8570 if (ada_type_name (val_type
) == NULL
)
8571 TYPE_NAME (val_type
) = ada_type_name (type
);
8573 return unwrap_value (v
);
8577 struct type
*raw_real_type
=
8578 ada_check_typedef (ada_get_base_type (type
));
8580 /* If there is no parallel XVS or XVE type, then the value is
8581 already unwrapped. Return it without further modification. */
8582 if ((type
== raw_real_type
)
8583 && ada_find_parallel_type (type
, "___XVE") == NULL
)
8587 coerce_unspec_val_to_type
8588 (val
, ada_to_fixed_type (raw_real_type
, 0,
8589 value_address (val
),
8594 static struct value
*
8595 cast_to_fixed (struct type
*type
, struct value
*arg
)
8599 if (type
== value_type (arg
))
8601 else if (ada_is_fixed_point_type (value_type (arg
)))
8602 val
= ada_float_to_fixed (type
,
8603 ada_fixed_to_float (value_type (arg
),
8604 value_as_long (arg
)));
8607 DOUBLEST argd
= value_as_double (arg
);
8609 val
= ada_float_to_fixed (type
, argd
);
8612 return value_from_longest (type
, val
);
8615 static struct value
*
8616 cast_from_fixed (struct type
*type
, struct value
*arg
)
8618 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
8619 value_as_long (arg
));
8621 return value_from_double (type
, val
);
8624 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8625 return the converted value. */
8627 static struct value
*
8628 coerce_for_assign (struct type
*type
, struct value
*val
)
8630 struct type
*type2
= value_type (val
);
8635 type2
= ada_check_typedef (type2
);
8636 type
= ada_check_typedef (type
);
8638 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8639 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8641 val
= ada_value_ind (val
);
8642 type2
= value_type (val
);
8645 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8646 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8648 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8649 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8650 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8651 error (_("Incompatible types in assignment"));
8652 deprecated_set_value_type (val
, type
);
8657 static struct value
*
8658 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8661 struct type
*type1
, *type2
;
8664 arg1
= coerce_ref (arg1
);
8665 arg2
= coerce_ref (arg2
);
8666 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
8667 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
8669 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8670 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8671 return value_binop (arg1
, arg2
, op
);
8680 return value_binop (arg1
, arg2
, op
);
8683 v2
= value_as_long (arg2
);
8685 error (_("second operand of %s must not be zero."), op_string (op
));
8687 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8688 return value_binop (arg1
, arg2
, op
);
8690 v1
= value_as_long (arg1
);
8695 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8696 v
+= v
> 0 ? -1 : 1;
8704 /* Should not reach this point. */
8708 val
= allocate_value (type1
);
8709 store_unsigned_integer (value_contents_raw (val
),
8710 TYPE_LENGTH (value_type (val
)),
8711 gdbarch_byte_order (get_type_arch (type1
)), v
);
8716 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8718 if (ada_is_direct_array_type (value_type (arg1
))
8719 || ada_is_direct_array_type (value_type (arg2
)))
8721 /* Automatically dereference any array reference before
8722 we attempt to perform the comparison. */
8723 arg1
= ada_coerce_ref (arg1
);
8724 arg2
= ada_coerce_ref (arg2
);
8726 arg1
= ada_coerce_to_simple_array (arg1
);
8727 arg2
= ada_coerce_to_simple_array (arg2
);
8728 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8729 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8730 error (_("Attempt to compare array with non-array"));
8731 /* FIXME: The following works only for types whose
8732 representations use all bits (no padding or undefined bits)
8733 and do not have user-defined equality. */
8735 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8736 && memcmp (value_contents (arg1
), value_contents (arg2
),
8737 TYPE_LENGTH (value_type (arg1
))) == 0;
8739 return value_equal (arg1
, arg2
);
8742 /* Total number of component associations in the aggregate starting at
8743 index PC in EXP. Assumes that index PC is the start of an
8747 num_component_specs (struct expression
*exp
, int pc
)
8751 m
= exp
->elts
[pc
+ 1].longconst
;
8754 for (i
= 0; i
< m
; i
+= 1)
8756 switch (exp
->elts
[pc
].opcode
)
8762 n
+= exp
->elts
[pc
+ 1].longconst
;
8765 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8770 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8771 component of LHS (a simple array or a record), updating *POS past
8772 the expression, assuming that LHS is contained in CONTAINER. Does
8773 not modify the inferior's memory, nor does it modify LHS (unless
8774 LHS == CONTAINER). */
8777 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8778 struct expression
*exp
, int *pos
)
8780 struct value
*mark
= value_mark ();
8783 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8785 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8786 struct value
*index_val
= value_from_longest (index_type
, index
);
8788 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8792 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8793 elt
= ada_to_fixed_value (elt
);
8796 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8797 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8799 value_assign_to_component (container
, elt
,
8800 ada_evaluate_subexp (NULL
, exp
, pos
,
8803 value_free_to_mark (mark
);
8806 /* Assuming that LHS represents an lvalue having a record or array
8807 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8808 of that aggregate's value to LHS, advancing *POS past the
8809 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8810 lvalue containing LHS (possibly LHS itself). Does not modify
8811 the inferior's memory, nor does it modify the contents of
8812 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8814 static struct value
*
8815 assign_aggregate (struct value
*container
,
8816 struct value
*lhs
, struct expression
*exp
,
8817 int *pos
, enum noside noside
)
8819 struct type
*lhs_type
;
8820 int n
= exp
->elts
[*pos
+1].longconst
;
8821 LONGEST low_index
, high_index
;
8824 int max_indices
, num_indices
;
8825 int is_array_aggregate
;
8829 if (noside
!= EVAL_NORMAL
)
8831 for (i
= 0; i
< n
; i
+= 1)
8832 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8836 container
= ada_coerce_ref (container
);
8837 if (ada_is_direct_array_type (value_type (container
)))
8838 container
= ada_coerce_to_simple_array (container
);
8839 lhs
= ada_coerce_ref (lhs
);
8840 if (!deprecated_value_modifiable (lhs
))
8841 error (_("Left operand of assignment is not a modifiable lvalue."));
8843 lhs_type
= value_type (lhs
);
8844 if (ada_is_direct_array_type (lhs_type
))
8846 lhs
= ada_coerce_to_simple_array (lhs
);
8847 lhs_type
= value_type (lhs
);
8848 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8849 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8850 is_array_aggregate
= 1;
8852 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8855 high_index
= num_visible_fields (lhs_type
) - 1;
8856 is_array_aggregate
= 0;
8859 error (_("Left-hand side must be array or record."));
8861 num_specs
= num_component_specs (exp
, *pos
- 3);
8862 max_indices
= 4 * num_specs
+ 4;
8863 indices
= alloca (max_indices
* sizeof (indices
[0]));
8864 indices
[0] = indices
[1] = low_index
- 1;
8865 indices
[2] = indices
[3] = high_index
+ 1;
8868 for (i
= 0; i
< n
; i
+= 1)
8870 switch (exp
->elts
[*pos
].opcode
)
8873 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8874 &num_indices
, max_indices
,
8875 low_index
, high_index
);
8878 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8879 &num_indices
, max_indices
,
8880 low_index
, high_index
);
8884 error (_("Misplaced 'others' clause"));
8885 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8886 num_indices
, low_index
, high_index
);
8889 error (_("Internal error: bad aggregate clause"));
8896 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8897 construct at *POS, updating *POS past the construct, given that
8898 the positions are relative to lower bound LOW, where HIGH is the
8899 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8900 updating *NUM_INDICES as needed. CONTAINER is as for
8901 assign_aggregate. */
8903 aggregate_assign_positional (struct value
*container
,
8904 struct value
*lhs
, struct expression
*exp
,
8905 int *pos
, LONGEST
*indices
, int *num_indices
,
8906 int max_indices
, LONGEST low
, LONGEST high
)
8908 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8910 if (ind
- 1 == high
)
8911 warning (_("Extra components in aggregate ignored."));
8914 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8916 assign_component (container
, lhs
, ind
, exp
, pos
);
8919 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8922 /* Assign into the components of LHS indexed by the OP_CHOICES
8923 construct at *POS, updating *POS past the construct, given that
8924 the allowable indices are LOW..HIGH. Record the indices assigned
8925 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8926 needed. CONTAINER is as for assign_aggregate. */
8928 aggregate_assign_from_choices (struct value
*container
,
8929 struct value
*lhs
, struct expression
*exp
,
8930 int *pos
, LONGEST
*indices
, int *num_indices
,
8931 int max_indices
, LONGEST low
, LONGEST high
)
8934 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8935 int choice_pos
, expr_pc
;
8936 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8938 choice_pos
= *pos
+= 3;
8940 for (j
= 0; j
< n_choices
; j
+= 1)
8941 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8943 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8945 for (j
= 0; j
< n_choices
; j
+= 1)
8947 LONGEST lower
, upper
;
8948 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8950 if (op
== OP_DISCRETE_RANGE
)
8953 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8955 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8960 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8972 name
= &exp
->elts
[choice_pos
+ 2].string
;
8975 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8978 error (_("Invalid record component association."));
8980 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8982 if (! find_struct_field (name
, value_type (lhs
), 0,
8983 NULL
, NULL
, NULL
, NULL
, &ind
))
8984 error (_("Unknown component name: %s."), name
);
8985 lower
= upper
= ind
;
8988 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8989 error (_("Index in component association out of bounds."));
8991 add_component_interval (lower
, upper
, indices
, num_indices
,
8993 while (lower
<= upper
)
8998 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9004 /* Assign the value of the expression in the OP_OTHERS construct in
9005 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9006 have not been previously assigned. The index intervals already assigned
9007 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9008 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9010 aggregate_assign_others (struct value
*container
,
9011 struct value
*lhs
, struct expression
*exp
,
9012 int *pos
, LONGEST
*indices
, int num_indices
,
9013 LONGEST low
, LONGEST high
)
9016 int expr_pc
= *pos
+ 1;
9018 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9022 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9027 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9030 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9033 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9034 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9035 modifying *SIZE as needed. It is an error if *SIZE exceeds
9036 MAX_SIZE. The resulting intervals do not overlap. */
9038 add_component_interval (LONGEST low
, LONGEST high
,
9039 LONGEST
* indices
, int *size
, int max_size
)
9043 for (i
= 0; i
< *size
; i
+= 2) {
9044 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9048 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9049 if (high
< indices
[kh
])
9051 if (low
< indices
[i
])
9053 indices
[i
+ 1] = indices
[kh
- 1];
9054 if (high
> indices
[i
+ 1])
9055 indices
[i
+ 1] = high
;
9056 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9057 *size
-= kh
- i
- 2;
9060 else if (high
< indices
[i
])
9064 if (*size
== max_size
)
9065 error (_("Internal error: miscounted aggregate components."));
9067 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9068 indices
[j
] = indices
[j
- 2];
9070 indices
[i
+ 1] = high
;
9073 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9076 static struct value
*
9077 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9079 if (type
== ada_check_typedef (value_type (arg2
)))
9082 if (ada_is_fixed_point_type (type
))
9083 return (cast_to_fixed (type
, arg2
));
9085 if (ada_is_fixed_point_type (value_type (arg2
)))
9086 return cast_from_fixed (type
, arg2
);
9088 return value_cast (type
, arg2
);
9091 /* Evaluating Ada expressions, and printing their result.
9092 ------------------------------------------------------
9097 We usually evaluate an Ada expression in order to print its value.
9098 We also evaluate an expression in order to print its type, which
9099 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9100 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9101 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9102 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9105 Evaluating expressions is a little more complicated for Ada entities
9106 than it is for entities in languages such as C. The main reason for
9107 this is that Ada provides types whose definition might be dynamic.
9108 One example of such types is variant records. Or another example
9109 would be an array whose bounds can only be known at run time.
9111 The following description is a general guide as to what should be
9112 done (and what should NOT be done) in order to evaluate an expression
9113 involving such types, and when. This does not cover how the semantic
9114 information is encoded by GNAT as this is covered separatly. For the
9115 document used as the reference for the GNAT encoding, see exp_dbug.ads
9116 in the GNAT sources.
9118 Ideally, we should embed each part of this description next to its
9119 associated code. Unfortunately, the amount of code is so vast right
9120 now that it's hard to see whether the code handling a particular
9121 situation might be duplicated or not. One day, when the code is
9122 cleaned up, this guide might become redundant with the comments
9123 inserted in the code, and we might want to remove it.
9125 2. ``Fixing'' an Entity, the Simple Case:
9126 -----------------------------------------
9128 When evaluating Ada expressions, the tricky issue is that they may
9129 reference entities whose type contents and size are not statically
9130 known. Consider for instance a variant record:
9132 type Rec (Empty : Boolean := True) is record
9135 when False => Value : Integer;
9138 Yes : Rec := (Empty => False, Value => 1);
9139 No : Rec := (empty => True);
9141 The size and contents of that record depends on the value of the
9142 descriminant (Rec.Empty). At this point, neither the debugging
9143 information nor the associated type structure in GDB are able to
9144 express such dynamic types. So what the debugger does is to create
9145 "fixed" versions of the type that applies to the specific object.
9146 We also informally refer to this opperation as "fixing" an object,
9147 which means creating its associated fixed type.
9149 Example: when printing the value of variable "Yes" above, its fixed
9150 type would look like this:
9157 On the other hand, if we printed the value of "No", its fixed type
9164 Things become a little more complicated when trying to fix an entity
9165 with a dynamic type that directly contains another dynamic type,
9166 such as an array of variant records, for instance. There are
9167 two possible cases: Arrays, and records.
9169 3. ``Fixing'' Arrays:
9170 ---------------------
9172 The type structure in GDB describes an array in terms of its bounds,
9173 and the type of its elements. By design, all elements in the array
9174 have the same type and we cannot represent an array of variant elements
9175 using the current type structure in GDB. When fixing an array,
9176 we cannot fix the array element, as we would potentially need one
9177 fixed type per element of the array. As a result, the best we can do
9178 when fixing an array is to produce an array whose bounds and size
9179 are correct (allowing us to read it from memory), but without having
9180 touched its element type. Fixing each element will be done later,
9181 when (if) necessary.
9183 Arrays are a little simpler to handle than records, because the same
9184 amount of memory is allocated for each element of the array, even if
9185 the amount of space actually used by each element differs from element
9186 to element. Consider for instance the following array of type Rec:
9188 type Rec_Array is array (1 .. 2) of Rec;
9190 The actual amount of memory occupied by each element might be different
9191 from element to element, depending on the value of their discriminant.
9192 But the amount of space reserved for each element in the array remains
9193 fixed regardless. So we simply need to compute that size using
9194 the debugging information available, from which we can then determine
9195 the array size (we multiply the number of elements of the array by
9196 the size of each element).
9198 The simplest case is when we have an array of a constrained element
9199 type. For instance, consider the following type declarations:
9201 type Bounded_String (Max_Size : Integer) is
9203 Buffer : String (1 .. Max_Size);
9205 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9207 In this case, the compiler describes the array as an array of
9208 variable-size elements (identified by its XVS suffix) for which
9209 the size can be read in the parallel XVZ variable.
9211 In the case of an array of an unconstrained element type, the compiler
9212 wraps the array element inside a private PAD type. This type should not
9213 be shown to the user, and must be "unwrap"'ed before printing. Note
9214 that we also use the adjective "aligner" in our code to designate
9215 these wrapper types.
9217 In some cases, the size allocated for each element is statically
9218 known. In that case, the PAD type already has the correct size,
9219 and the array element should remain unfixed.
9221 But there are cases when this size is not statically known.
9222 For instance, assuming that "Five" is an integer variable:
9224 type Dynamic is array (1 .. Five) of Integer;
9225 type Wrapper (Has_Length : Boolean := False) is record
9228 when True => Length : Integer;
9232 type Wrapper_Array is array (1 .. 2) of Wrapper;
9234 Hello : Wrapper_Array := (others => (Has_Length => True,
9235 Data => (others => 17),
9239 The debugging info would describe variable Hello as being an
9240 array of a PAD type. The size of that PAD type is not statically
9241 known, but can be determined using a parallel XVZ variable.
9242 In that case, a copy of the PAD type with the correct size should
9243 be used for the fixed array.
9245 3. ``Fixing'' record type objects:
9246 ----------------------------------
9248 Things are slightly different from arrays in the case of dynamic
9249 record types. In this case, in order to compute the associated
9250 fixed type, we need to determine the size and offset of each of
9251 its components. This, in turn, requires us to compute the fixed
9252 type of each of these components.
9254 Consider for instance the example:
9256 type Bounded_String (Max_Size : Natural) is record
9257 Str : String (1 .. Max_Size);
9260 My_String : Bounded_String (Max_Size => 10);
9262 In that case, the position of field "Length" depends on the size
9263 of field Str, which itself depends on the value of the Max_Size
9264 discriminant. In order to fix the type of variable My_String,
9265 we need to fix the type of field Str. Therefore, fixing a variant
9266 record requires us to fix each of its components.
9268 However, if a component does not have a dynamic size, the component
9269 should not be fixed. In particular, fields that use a PAD type
9270 should not fixed. Here is an example where this might happen
9271 (assuming type Rec above):
9273 type Container (Big : Boolean) is record
9277 when True => Another : Integer;
9281 My_Container : Container := (Big => False,
9282 First => (Empty => True),
9285 In that example, the compiler creates a PAD type for component First,
9286 whose size is constant, and then positions the component After just
9287 right after it. The offset of component After is therefore constant
9290 The debugger computes the position of each field based on an algorithm
9291 that uses, among other things, the actual position and size of the field
9292 preceding it. Let's now imagine that the user is trying to print
9293 the value of My_Container. If the type fixing was recursive, we would
9294 end up computing the offset of field After based on the size of the
9295 fixed version of field First. And since in our example First has
9296 only one actual field, the size of the fixed type is actually smaller
9297 than the amount of space allocated to that field, and thus we would
9298 compute the wrong offset of field After.
9300 To make things more complicated, we need to watch out for dynamic
9301 components of variant records (identified by the ___XVL suffix in
9302 the component name). Even if the target type is a PAD type, the size
9303 of that type might not be statically known. So the PAD type needs
9304 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9305 we might end up with the wrong size for our component. This can be
9306 observed with the following type declarations:
9308 type Octal is new Integer range 0 .. 7;
9309 type Octal_Array is array (Positive range <>) of Octal;
9310 pragma Pack (Octal_Array);
9312 type Octal_Buffer (Size : Positive) is record
9313 Buffer : Octal_Array (1 .. Size);
9317 In that case, Buffer is a PAD type whose size is unset and needs
9318 to be computed by fixing the unwrapped type.
9320 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9321 ----------------------------------------------------------
9323 Lastly, when should the sub-elements of an entity that remained unfixed
9324 thus far, be actually fixed?
9326 The answer is: Only when referencing that element. For instance
9327 when selecting one component of a record, this specific component
9328 should be fixed at that point in time. Or when printing the value
9329 of a record, each component should be fixed before its value gets
9330 printed. Similarly for arrays, the element of the array should be
9331 fixed when printing each element of the array, or when extracting
9332 one element out of that array. On the other hand, fixing should
9333 not be performed on the elements when taking a slice of an array!
9335 Note that one of the side-effects of miscomputing the offset and
9336 size of each field is that we end up also miscomputing the size
9337 of the containing type. This can have adverse results when computing
9338 the value of an entity. GDB fetches the value of an entity based
9339 on the size of its type, and thus a wrong size causes GDB to fetch
9340 the wrong amount of memory. In the case where the computed size is
9341 too small, GDB fetches too little data to print the value of our
9342 entiry. Results in this case as unpredicatble, as we usually read
9343 past the buffer containing the data =:-o. */
9345 /* Implement the evaluate_exp routine in the exp_descriptor structure
9346 for the Ada language. */
9348 static struct value
*
9349 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9350 int *pos
, enum noside noside
)
9355 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9358 struct value
**argvec
;
9362 op
= exp
->elts
[pc
].opcode
;
9368 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9369 arg1
= unwrap_value (arg1
);
9371 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9372 then we need to perform the conversion manually, because
9373 evaluate_subexp_standard doesn't do it. This conversion is
9374 necessary in Ada because the different kinds of float/fixed
9375 types in Ada have different representations.
9377 Similarly, we need to perform the conversion from OP_LONG
9379 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9380 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9386 struct value
*result
;
9389 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9390 /* The result type will have code OP_STRING, bashed there from
9391 OP_ARRAY. Bash it back. */
9392 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9393 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9399 type
= exp
->elts
[pc
+ 1].type
;
9400 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9401 if (noside
== EVAL_SKIP
)
9403 arg1
= ada_value_cast (type
, arg1
, noside
);
9408 type
= exp
->elts
[pc
+ 1].type
;
9409 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9412 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9413 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9415 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9416 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9418 return ada_value_assign (arg1
, arg1
);
9420 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9421 except if the lhs of our assignment is a convenience variable.
9422 In the case of assigning to a convenience variable, the lhs
9423 should be exactly the result of the evaluation of the rhs. */
9424 type
= value_type (arg1
);
9425 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9427 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9428 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9430 if (ada_is_fixed_point_type (value_type (arg1
)))
9431 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9432 else if (ada_is_fixed_point_type (value_type (arg2
)))
9434 (_("Fixed-point values must be assigned to fixed-point variables"));
9436 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9437 return ada_value_assign (arg1
, arg2
);
9440 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9441 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9442 if (noside
== EVAL_SKIP
)
9444 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9445 return (value_from_longest
9447 value_as_long (arg1
) + value_as_long (arg2
)));
9448 if ((ada_is_fixed_point_type (value_type (arg1
))
9449 || ada_is_fixed_point_type (value_type (arg2
)))
9450 && value_type (arg1
) != value_type (arg2
))
9451 error (_("Operands of fixed-point addition must have the same type"));
9452 /* Do the addition, and cast the result to the type of the first
9453 argument. We cannot cast the result to a reference type, so if
9454 ARG1 is a reference type, find its underlying type. */
9455 type
= value_type (arg1
);
9456 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9457 type
= TYPE_TARGET_TYPE (type
);
9458 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9459 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
9462 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9463 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9464 if (noside
== EVAL_SKIP
)
9466 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9467 return (value_from_longest
9469 value_as_long (arg1
) - value_as_long (arg2
)));
9470 if ((ada_is_fixed_point_type (value_type (arg1
))
9471 || ada_is_fixed_point_type (value_type (arg2
)))
9472 && value_type (arg1
) != value_type (arg2
))
9473 error (_("Operands of fixed-point subtraction "
9474 "must have the same type"));
9475 /* Do the substraction, and cast the result to the type of the first
9476 argument. We cannot cast the result to a reference type, so if
9477 ARG1 is a reference type, find its underlying type. */
9478 type
= value_type (arg1
);
9479 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9480 type
= TYPE_TARGET_TYPE (type
);
9481 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9482 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
9488 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9489 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9490 if (noside
== EVAL_SKIP
)
9492 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9494 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9495 return value_zero (value_type (arg1
), not_lval
);
9499 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
9500 if (ada_is_fixed_point_type (value_type (arg1
)))
9501 arg1
= cast_from_fixed (type
, arg1
);
9502 if (ada_is_fixed_point_type (value_type (arg2
)))
9503 arg2
= cast_from_fixed (type
, arg2
);
9504 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9505 return ada_value_binop (arg1
, arg2
, op
);
9509 case BINOP_NOTEQUAL
:
9510 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9511 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
9512 if (noside
== EVAL_SKIP
)
9514 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9518 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9519 tem
= ada_value_equal (arg1
, arg2
);
9521 if (op
== BINOP_NOTEQUAL
)
9523 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9524 return value_from_longest (type
, (LONGEST
) tem
);
9527 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9528 if (noside
== EVAL_SKIP
)
9530 else if (ada_is_fixed_point_type (value_type (arg1
)))
9531 return value_cast (value_type (arg1
), value_neg (arg1
));
9534 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9535 return value_neg (arg1
);
9538 case BINOP_LOGICAL_AND
:
9539 case BINOP_LOGICAL_OR
:
9540 case UNOP_LOGICAL_NOT
:
9545 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9546 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9547 return value_cast (type
, val
);
9550 case BINOP_BITWISE_AND
:
9551 case BINOP_BITWISE_IOR
:
9552 case BINOP_BITWISE_XOR
:
9556 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9558 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9560 return value_cast (value_type (arg1
), val
);
9566 if (noside
== EVAL_SKIP
)
9571 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
9572 /* Only encountered when an unresolved symbol occurs in a
9573 context other than a function call, in which case, it is
9575 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9576 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
9577 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9579 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
9580 /* Check to see if this is a tagged type. We also need to handle
9581 the case where the type is a reference to a tagged type, but
9582 we have to be careful to exclude pointers to tagged types.
9583 The latter should be shown as usual (as a pointer), whereas
9584 a reference should mostly be transparent to the user. */
9585 if (ada_is_tagged_type (type
, 0)
9586 || (TYPE_CODE(type
) == TYPE_CODE_REF
9587 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
9589 /* Tagged types are a little special in the fact that the real
9590 type is dynamic and can only be determined by inspecting the
9591 object's tag. This means that we need to get the object's
9592 value first (EVAL_NORMAL) and then extract the actual object
9595 Note that we cannot skip the final step where we extract
9596 the object type from its tag, because the EVAL_NORMAL phase
9597 results in dynamic components being resolved into fixed ones.
9598 This can cause problems when trying to print the type
9599 description of tagged types whose parent has a dynamic size:
9600 We use the type name of the "_parent" component in order
9601 to print the name of the ancestor type in the type description.
9602 If that component had a dynamic size, the resolution into
9603 a fixed type would result in the loss of that type name,
9604 thus preventing us from printing the name of the ancestor
9605 type in the type description. */
9606 struct type
*actual_type
;
9608 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
9609 actual_type
= type_from_tag (ada_value_tag (arg1
));
9610 if (actual_type
== NULL
)
9611 /* If, for some reason, we were unable to determine
9612 the actual type from the tag, then use the static
9613 approximation that we just computed as a fallback.
9614 This can happen if the debugging information is
9615 incomplete, for instance. */
9618 return value_zero (actual_type
, not_lval
);
9623 (to_static_fixed_type
9624 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
9629 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9630 return ada_to_fixed_value (arg1
);
9636 /* Allocate arg vector, including space for the function to be
9637 called in argvec[0] and a terminating NULL. */
9638 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9640 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
9642 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
9643 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
9644 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9645 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
9648 for (tem
= 0; tem
<= nargs
; tem
+= 1)
9649 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9652 if (noside
== EVAL_SKIP
)
9656 if (ada_is_constrained_packed_array_type
9657 (desc_base_type (value_type (argvec
[0]))))
9658 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
9659 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9660 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
9661 /* This is a packed array that has already been fixed, and
9662 therefore already coerced to a simple array. Nothing further
9665 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
9666 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9667 && VALUE_LVAL (argvec
[0]) == lval_memory
))
9668 argvec
[0] = value_addr (argvec
[0]);
9670 type
= ada_check_typedef (value_type (argvec
[0]));
9672 /* Ada allows us to implicitly dereference arrays when subscripting
9673 them. So, if this is an array typedef (encoding use for array
9674 access types encoded as fat pointers), strip it now. */
9675 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
9676 type
= ada_typedef_target_type (type
);
9678 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
9680 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
9682 case TYPE_CODE_FUNC
:
9683 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9685 case TYPE_CODE_ARRAY
:
9687 case TYPE_CODE_STRUCT
:
9688 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
9689 argvec
[0] = ada_value_ind (argvec
[0]);
9690 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9693 error (_("cannot subscript or call something of type `%s'"),
9694 ada_type_name (value_type (argvec
[0])));
9699 switch (TYPE_CODE (type
))
9701 case TYPE_CODE_FUNC
:
9702 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9703 return allocate_value (TYPE_TARGET_TYPE (type
));
9704 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
9705 case TYPE_CODE_STRUCT
:
9709 arity
= ada_array_arity (type
);
9710 type
= ada_array_element_type (type
, nargs
);
9712 error (_("cannot subscript or call a record"));
9714 error (_("wrong number of subscripts; expecting %d"), arity
);
9715 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9716 return value_zero (ada_aligned_type (type
), lval_memory
);
9718 unwrap_value (ada_value_subscript
9719 (argvec
[0], nargs
, argvec
+ 1));
9721 case TYPE_CODE_ARRAY
:
9722 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9724 type
= ada_array_element_type (type
, nargs
);
9726 error (_("element type of array unknown"));
9728 return value_zero (ada_aligned_type (type
), lval_memory
);
9731 unwrap_value (ada_value_subscript
9732 (ada_coerce_to_simple_array (argvec
[0]),
9733 nargs
, argvec
+ 1));
9734 case TYPE_CODE_PTR
: /* Pointer to array */
9735 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9736 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9738 type
= ada_array_element_type (type
, nargs
);
9740 error (_("element type of array unknown"));
9742 return value_zero (ada_aligned_type (type
), lval_memory
);
9745 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9746 nargs
, argvec
+ 1));
9749 error (_("Attempt to index or call something other than an "
9750 "array or function"));
9755 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9756 struct value
*low_bound_val
=
9757 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9758 struct value
*high_bound_val
=
9759 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9763 low_bound_val
= coerce_ref (low_bound_val
);
9764 high_bound_val
= coerce_ref (high_bound_val
);
9765 low_bound
= pos_atr (low_bound_val
);
9766 high_bound
= pos_atr (high_bound_val
);
9768 if (noside
== EVAL_SKIP
)
9771 /* If this is a reference to an aligner type, then remove all
9773 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9774 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9775 TYPE_TARGET_TYPE (value_type (array
)) =
9776 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9778 if (ada_is_constrained_packed_array_type (value_type (array
)))
9779 error (_("cannot slice a packed array"));
9781 /* If this is a reference to an array or an array lvalue,
9782 convert to a pointer. */
9783 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9784 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9785 && VALUE_LVAL (array
) == lval_memory
))
9786 array
= value_addr (array
);
9788 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9789 && ada_is_array_descriptor_type (ada_check_typedef
9790 (value_type (array
))))
9791 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9793 array
= ada_coerce_to_simple_array_ptr (array
);
9795 /* If we have more than one level of pointer indirection,
9796 dereference the value until we get only one level. */
9797 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9798 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9800 array
= value_ind (array
);
9802 /* Make sure we really do have an array type before going further,
9803 to avoid a SEGV when trying to get the index type or the target
9804 type later down the road if the debug info generated by
9805 the compiler is incorrect or incomplete. */
9806 if (!ada_is_simple_array_type (value_type (array
)))
9807 error (_("cannot take slice of non-array"));
9809 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
9812 struct type
*type0
= ada_check_typedef (value_type (array
));
9814 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9815 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
9818 struct type
*arr_type0
=
9819 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
9821 return ada_value_slice_from_ptr (array
, arr_type0
,
9822 longest_to_int (low_bound
),
9823 longest_to_int (high_bound
));
9826 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9828 else if (high_bound
< low_bound
)
9829 return empty_array (value_type (array
), low_bound
);
9831 return ada_value_slice (array
, longest_to_int (low_bound
),
9832 longest_to_int (high_bound
));
9837 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9838 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9840 if (noside
== EVAL_SKIP
)
9843 switch (TYPE_CODE (type
))
9846 lim_warning (_("Membership test incompletely implemented; "
9847 "always returns true"));
9848 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9849 return value_from_longest (type
, (LONGEST
) 1);
9851 case TYPE_CODE_RANGE
:
9852 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9853 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9854 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9855 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9856 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9858 value_from_longest (type
,
9859 (value_less (arg1
, arg3
)
9860 || value_equal (arg1
, arg3
))
9861 && (value_less (arg2
, arg1
)
9862 || value_equal (arg2
, arg1
)));
9865 case BINOP_IN_BOUNDS
:
9867 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9868 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9870 if (noside
== EVAL_SKIP
)
9873 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9875 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9876 return value_zero (type
, not_lval
);
9879 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9881 type
= ada_index_type (value_type (arg2
), tem
, "range");
9883 type
= value_type (arg1
);
9885 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9886 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9888 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9889 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9890 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9892 value_from_longest (type
,
9893 (value_less (arg1
, arg3
)
9894 || value_equal (arg1
, arg3
))
9895 && (value_less (arg2
, arg1
)
9896 || value_equal (arg2
, arg1
)));
9898 case TERNOP_IN_RANGE
:
9899 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9900 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9901 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9903 if (noside
== EVAL_SKIP
)
9906 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9907 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9908 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9910 value_from_longest (type
,
9911 (value_less (arg1
, arg3
)
9912 || value_equal (arg1
, arg3
))
9913 && (value_less (arg2
, arg1
)
9914 || value_equal (arg2
, arg1
)));
9920 struct type
*type_arg
;
9922 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9924 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9926 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9930 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9934 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9935 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9936 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9939 if (noside
== EVAL_SKIP
)
9942 if (type_arg
== NULL
)
9944 arg1
= ada_coerce_ref (arg1
);
9946 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9947 arg1
= ada_coerce_to_simple_array (arg1
);
9949 type
= ada_index_type (value_type (arg1
), tem
,
9950 ada_attribute_name (op
));
9952 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9954 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9955 return allocate_value (type
);
9959 default: /* Should never happen. */
9960 error (_("unexpected attribute encountered"));
9962 return value_from_longest
9963 (type
, ada_array_bound (arg1
, tem
, 0));
9965 return value_from_longest
9966 (type
, ada_array_bound (arg1
, tem
, 1));
9968 return value_from_longest
9969 (type
, ada_array_length (arg1
, tem
));
9972 else if (discrete_type_p (type_arg
))
9974 struct type
*range_type
;
9975 const char *name
= ada_type_name (type_arg
);
9978 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9979 range_type
= to_fixed_range_type (type_arg
, NULL
);
9980 if (range_type
== NULL
)
9981 range_type
= type_arg
;
9985 error (_("unexpected attribute encountered"));
9987 return value_from_longest
9988 (range_type
, ada_discrete_type_low_bound (range_type
));
9990 return value_from_longest
9991 (range_type
, ada_discrete_type_high_bound (range_type
));
9993 error (_("the 'length attribute applies only to array types"));
9996 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9997 error (_("unimplemented type attribute"));
10002 if (ada_is_constrained_packed_array_type (type_arg
))
10003 type_arg
= decode_constrained_packed_array_type (type_arg
);
10005 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10007 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10009 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10010 return allocate_value (type
);
10015 error (_("unexpected attribute encountered"));
10017 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10018 return value_from_longest (type
, low
);
10020 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10021 return value_from_longest (type
, high
);
10022 case OP_ATR_LENGTH
:
10023 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10024 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10025 return value_from_longest (type
, high
- low
+ 1);
10031 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10032 if (noside
== EVAL_SKIP
)
10035 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10036 return value_zero (ada_tag_type (arg1
), not_lval
);
10038 return ada_value_tag (arg1
);
10042 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10043 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10044 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10045 if (noside
== EVAL_SKIP
)
10047 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10048 return value_zero (value_type (arg1
), not_lval
);
10051 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10052 return value_binop (arg1
, arg2
,
10053 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10056 case OP_ATR_MODULUS
:
10058 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10060 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10061 if (noside
== EVAL_SKIP
)
10064 if (!ada_is_modular_type (type_arg
))
10065 error (_("'modulus must be applied to modular type"));
10067 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10068 ada_modulus (type_arg
));
10073 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10074 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10075 if (noside
== EVAL_SKIP
)
10077 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10078 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10079 return value_zero (type
, not_lval
);
10081 return value_pos_atr (type
, arg1
);
10084 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10085 type
= value_type (arg1
);
10087 /* If the argument is a reference, then dereference its type, since
10088 the user is really asking for the size of the actual object,
10089 not the size of the pointer. */
10090 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10091 type
= TYPE_TARGET_TYPE (type
);
10093 if (noside
== EVAL_SKIP
)
10095 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10096 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10098 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10099 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10102 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10103 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10104 type
= exp
->elts
[pc
+ 2].type
;
10105 if (noside
== EVAL_SKIP
)
10107 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10108 return value_zero (type
, not_lval
);
10110 return value_val_atr (type
, arg1
);
10113 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10114 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10115 if (noside
== EVAL_SKIP
)
10117 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10118 return value_zero (value_type (arg1
), not_lval
);
10121 /* For integer exponentiation operations,
10122 only promote the first argument. */
10123 if (is_integral_type (value_type (arg2
)))
10124 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10126 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10128 return value_binop (arg1
, arg2
, op
);
10132 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10133 if (noside
== EVAL_SKIP
)
10139 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10140 if (noside
== EVAL_SKIP
)
10142 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10143 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10144 return value_neg (arg1
);
10149 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10150 if (noside
== EVAL_SKIP
)
10152 type
= ada_check_typedef (value_type (arg1
));
10153 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10155 if (ada_is_array_descriptor_type (type
))
10156 /* GDB allows dereferencing GNAT array descriptors. */
10158 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10160 if (arrType
== NULL
)
10161 error (_("Attempt to dereference null array pointer."));
10162 return value_at_lazy (arrType
, 0);
10164 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10165 || TYPE_CODE (type
) == TYPE_CODE_REF
10166 /* In C you can dereference an array to get the 1st elt. */
10167 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10169 type
= to_static_fixed_type
10171 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10173 return value_zero (type
, lval_memory
);
10175 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10177 /* GDB allows dereferencing an int. */
10178 if (expect_type
== NULL
)
10179 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10184 to_static_fixed_type (ada_aligned_type (expect_type
));
10185 return value_zero (expect_type
, lval_memory
);
10189 error (_("Attempt to take contents of a non-pointer value."));
10191 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10192 type
= ada_check_typedef (value_type (arg1
));
10194 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10195 /* GDB allows dereferencing an int. If we were given
10196 the expect_type, then use that as the target type.
10197 Otherwise, assume that the target type is an int. */
10199 if (expect_type
!= NULL
)
10200 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10203 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10204 (CORE_ADDR
) value_as_address (arg1
));
10207 if (ada_is_array_descriptor_type (type
))
10208 /* GDB allows dereferencing GNAT array descriptors. */
10209 return ada_coerce_to_simple_array (arg1
);
10211 return ada_value_ind (arg1
);
10213 case STRUCTOP_STRUCT
:
10214 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10215 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10216 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10217 if (noside
== EVAL_SKIP
)
10219 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10221 struct type
*type1
= value_type (arg1
);
10223 if (ada_is_tagged_type (type1
, 1))
10225 type
= ada_lookup_struct_elt_type (type1
,
10226 &exp
->elts
[pc
+ 2].string
,
10229 /* In this case, we assume that the field COULD exist
10230 in some extension of the type. Return an object of
10231 "type" void, which will match any formal
10232 (see ada_type_match). */
10233 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
10238 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10241 return value_zero (ada_aligned_type (type
), lval_memory
);
10244 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10245 arg1
= unwrap_value (arg1
);
10246 return ada_to_fixed_value (arg1
);
10249 /* The value is not supposed to be used. This is here to make it
10250 easier to accommodate expressions that contain types. */
10252 if (noside
== EVAL_SKIP
)
10254 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10255 return allocate_value (exp
->elts
[pc
+ 1].type
);
10257 error (_("Attempt to use a type name as an expression"));
10262 case OP_DISCRETE_RANGE
:
10263 case OP_POSITIONAL
:
10265 if (noside
== EVAL_NORMAL
)
10269 error (_("Undefined name, ambiguous name, or renaming used in "
10270 "component association: %s."), &exp
->elts
[pc
+2].string
);
10272 error (_("Aggregates only allowed on the right of an assignment"));
10274 internal_error (__FILE__
, __LINE__
,
10275 _("aggregate apparently mangled"));
10278 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10280 for (tem
= 0; tem
< nargs
; tem
+= 1)
10281 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10286 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10292 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10293 type name that encodes the 'small and 'delta information.
10294 Otherwise, return NULL. */
10296 static const char *
10297 fixed_type_info (struct type
*type
)
10299 const char *name
= ada_type_name (type
);
10300 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10302 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10304 const char *tail
= strstr (name
, "___XF_");
10311 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10312 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10317 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10320 ada_is_fixed_point_type (struct type
*type
)
10322 return fixed_type_info (type
) != NULL
;
10325 /* Return non-zero iff TYPE represents a System.Address type. */
10328 ada_is_system_address_type (struct type
*type
)
10330 return (TYPE_NAME (type
)
10331 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10334 /* Assuming that TYPE is the representation of an Ada fixed-point
10335 type, return its delta, or -1 if the type is malformed and the
10336 delta cannot be determined. */
10339 ada_delta (struct type
*type
)
10341 const char *encoding
= fixed_type_info (type
);
10344 /* Strictly speaking, num and den are encoded as integer. However,
10345 they may not fit into a long, and they will have to be converted
10346 to DOUBLEST anyway. So scan them as DOUBLEST. */
10347 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10354 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10355 factor ('SMALL value) associated with the type. */
10358 scaling_factor (struct type
*type
)
10360 const char *encoding
= fixed_type_info (type
);
10361 DOUBLEST num0
, den0
, num1
, den1
;
10364 /* Strictly speaking, num's and den's are encoded as integer. However,
10365 they may not fit into a long, and they will have to be converted
10366 to DOUBLEST anyway. So scan them as DOUBLEST. */
10367 n
= sscanf (encoding
,
10368 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10369 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10370 &num0
, &den0
, &num1
, &den1
);
10375 return num1
/ den1
;
10377 return num0
/ den0
;
10381 /* Assuming that X is the representation of a value of fixed-point
10382 type TYPE, return its floating-point equivalent. */
10385 ada_fixed_to_float (struct type
*type
, LONGEST x
)
10387 return (DOUBLEST
) x
*scaling_factor (type
);
10390 /* The representation of a fixed-point value of type TYPE
10391 corresponding to the value X. */
10394 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
10396 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
10403 /* Scan STR beginning at position K for a discriminant name, and
10404 return the value of that discriminant field of DVAL in *PX. If
10405 PNEW_K is not null, put the position of the character beyond the
10406 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10407 not alter *PX and *PNEW_K if unsuccessful. */
10410 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
10413 static char *bound_buffer
= NULL
;
10414 static size_t bound_buffer_len
= 0;
10417 struct value
*bound_val
;
10419 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
10422 pend
= strstr (str
+ k
, "__");
10426 k
+= strlen (bound
);
10430 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
10431 bound
= bound_buffer
;
10432 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
10433 bound
[pend
- (str
+ k
)] = '\0';
10437 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
10438 if (bound_val
== NULL
)
10441 *px
= value_as_long (bound_val
);
10442 if (pnew_k
!= NULL
)
10447 /* Value of variable named NAME in the current environment. If
10448 no such variable found, then if ERR_MSG is null, returns 0, and
10449 otherwise causes an error with message ERR_MSG. */
10451 static struct value
*
10452 get_var_value (char *name
, char *err_msg
)
10454 struct ada_symbol_info
*syms
;
10457 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
10462 if (err_msg
== NULL
)
10465 error (("%s"), err_msg
);
10468 return value_of_variable (syms
[0].sym
, syms
[0].block
);
10471 /* Value of integer variable named NAME in the current environment. If
10472 no such variable found, returns 0, and sets *FLAG to 0. If
10473 successful, sets *FLAG to 1. */
10476 get_int_var_value (char *name
, int *flag
)
10478 struct value
*var_val
= get_var_value (name
, 0);
10490 return value_as_long (var_val
);
10495 /* Return a range type whose base type is that of the range type named
10496 NAME in the current environment, and whose bounds are calculated
10497 from NAME according to the GNAT range encoding conventions.
10498 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10499 corresponding range type from debug information; fall back to using it
10500 if symbol lookup fails. If a new type must be created, allocate it
10501 like ORIG_TYPE was. The bounds information, in general, is encoded
10502 in NAME, the base type given in the named range type. */
10504 static struct type
*
10505 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
10508 struct type
*base_type
;
10509 char *subtype_info
;
10511 gdb_assert (raw_type
!= NULL
);
10512 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
10514 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
10515 base_type
= TYPE_TARGET_TYPE (raw_type
);
10517 base_type
= raw_type
;
10519 name
= TYPE_NAME (raw_type
);
10520 subtype_info
= strstr (name
, "___XD");
10521 if (subtype_info
== NULL
)
10523 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
10524 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
10526 if (L
< INT_MIN
|| U
> INT_MAX
)
10529 return create_range_type (alloc_type_copy (raw_type
), raw_type
,
10530 ada_discrete_type_low_bound (raw_type
),
10531 ada_discrete_type_high_bound (raw_type
));
10535 static char *name_buf
= NULL
;
10536 static size_t name_len
= 0;
10537 int prefix_len
= subtype_info
- name
;
10543 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
10544 strncpy (name_buf
, name
, prefix_len
);
10545 name_buf
[prefix_len
] = '\0';
10548 bounds_str
= strchr (subtype_info
, '_');
10551 if (*subtype_info
== 'L')
10553 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
10554 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
10556 if (bounds_str
[n
] == '_')
10558 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
10566 strcpy (name_buf
+ prefix_len
, "___L");
10567 L
= get_int_var_value (name_buf
, &ok
);
10570 lim_warning (_("Unknown lower bound, using 1."));
10575 if (*subtype_info
== 'U')
10577 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
10578 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
10585 strcpy (name_buf
+ prefix_len
, "___U");
10586 U
= get_int_var_value (name_buf
, &ok
);
10589 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
10594 type
= create_range_type (alloc_type_copy (raw_type
), base_type
, L
, U
);
10595 TYPE_NAME (type
) = name
;
10600 /* True iff NAME is the name of a range type. */
10603 ada_is_range_type_name (const char *name
)
10605 return (name
!= NULL
&& strstr (name
, "___XD"));
10609 /* Modular types */
10611 /* True iff TYPE is an Ada modular type. */
10614 ada_is_modular_type (struct type
*type
)
10616 struct type
*subranged_type
= get_base_type (type
);
10618 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
10619 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
10620 && TYPE_UNSIGNED (subranged_type
));
10623 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10626 ada_modulus (struct type
*type
)
10628 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
10632 /* Ada exception catchpoint support:
10633 ---------------------------------
10635 We support 3 kinds of exception catchpoints:
10636 . catchpoints on Ada exceptions
10637 . catchpoints on unhandled Ada exceptions
10638 . catchpoints on failed assertions
10640 Exceptions raised during failed assertions, or unhandled exceptions
10641 could perfectly be caught with the general catchpoint on Ada exceptions.
10642 However, we can easily differentiate these two special cases, and having
10643 the option to distinguish these two cases from the rest can be useful
10644 to zero-in on certain situations.
10646 Exception catchpoints are a specialized form of breakpoint,
10647 since they rely on inserting breakpoints inside known routines
10648 of the GNAT runtime. The implementation therefore uses a standard
10649 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10652 Support in the runtime for exception catchpoints have been changed
10653 a few times already, and these changes affect the implementation
10654 of these catchpoints. In order to be able to support several
10655 variants of the runtime, we use a sniffer that will determine
10656 the runtime variant used by the program being debugged. */
10658 /* The different types of catchpoints that we introduced for catching
10661 enum exception_catchpoint_kind
10663 ex_catch_exception
,
10664 ex_catch_exception_unhandled
,
10668 /* Ada's standard exceptions. */
10670 static char *standard_exc
[] = {
10671 "constraint_error",
10677 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10679 /* A structure that describes how to support exception catchpoints
10680 for a given executable. */
10682 struct exception_support_info
10684 /* The name of the symbol to break on in order to insert
10685 a catchpoint on exceptions. */
10686 const char *catch_exception_sym
;
10688 /* The name of the symbol to break on in order to insert
10689 a catchpoint on unhandled exceptions. */
10690 const char *catch_exception_unhandled_sym
;
10692 /* The name of the symbol to break on in order to insert
10693 a catchpoint on failed assertions. */
10694 const char *catch_assert_sym
;
10696 /* Assuming that the inferior just triggered an unhandled exception
10697 catchpoint, this function is responsible for returning the address
10698 in inferior memory where the name of that exception is stored.
10699 Return zero if the address could not be computed. */
10700 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10703 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10704 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10706 /* The following exception support info structure describes how to
10707 implement exception catchpoints with the latest version of the
10708 Ada runtime (as of 2007-03-06). */
10710 static const struct exception_support_info default_exception_support_info
=
10712 "__gnat_debug_raise_exception", /* catch_exception_sym */
10713 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10714 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10715 ada_unhandled_exception_name_addr
10718 /* The following exception support info structure describes how to
10719 implement exception catchpoints with a slightly older version
10720 of the Ada runtime. */
10722 static const struct exception_support_info exception_support_info_fallback
=
10724 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10725 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10726 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10727 ada_unhandled_exception_name_addr_from_raise
10730 /* Return nonzero if we can detect the exception support routines
10731 described in EINFO.
10733 This function errors out if an abnormal situation is detected
10734 (for instance, if we find the exception support routines, but
10735 that support is found to be incomplete). */
10738 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
10740 struct symbol
*sym
;
10742 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10743 that should be compiled with debugging information. As a result, we
10744 expect to find that symbol in the symtabs. */
10746 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
10749 /* Perhaps we did not find our symbol because the Ada runtime was
10750 compiled without debugging info, or simply stripped of it.
10751 It happens on some GNU/Linux distributions for instance, where
10752 users have to install a separate debug package in order to get
10753 the runtime's debugging info. In that situation, let the user
10754 know why we cannot insert an Ada exception catchpoint.
10756 Note: Just for the purpose of inserting our Ada exception
10757 catchpoint, we could rely purely on the associated minimal symbol.
10758 But we would be operating in degraded mode anyway, since we are
10759 still lacking the debugging info needed later on to extract
10760 the name of the exception being raised (this name is printed in
10761 the catchpoint message, and is also used when trying to catch
10762 a specific exception). We do not handle this case for now. */
10763 if (lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
))
10764 error (_("Your Ada runtime appears to be missing some debugging "
10765 "information.\nCannot insert Ada exception catchpoint "
10766 "in this configuration."));
10771 /* Make sure that the symbol we found corresponds to a function. */
10773 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10774 error (_("Symbol \"%s\" is not a function (class = %d)"),
10775 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
10780 /* Inspect the Ada runtime and determine which exception info structure
10781 should be used to provide support for exception catchpoints.
10783 This function will always set the per-inferior exception_info,
10784 or raise an error. */
10787 ada_exception_support_info_sniffer (void)
10789 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
10790 struct symbol
*sym
;
10792 /* If the exception info is already known, then no need to recompute it. */
10793 if (data
->exception_info
!= NULL
)
10796 /* Check the latest (default) exception support info. */
10797 if (ada_has_this_exception_support (&default_exception_support_info
))
10799 data
->exception_info
= &default_exception_support_info
;
10803 /* Try our fallback exception suport info. */
10804 if (ada_has_this_exception_support (&exception_support_info_fallback
))
10806 data
->exception_info
= &exception_support_info_fallback
;
10810 /* Sometimes, it is normal for us to not be able to find the routine
10811 we are looking for. This happens when the program is linked with
10812 the shared version of the GNAT runtime, and the program has not been
10813 started yet. Inform the user of these two possible causes if
10816 if (ada_update_initial_language (language_unknown
) != language_ada
)
10817 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10819 /* If the symbol does not exist, then check that the program is
10820 already started, to make sure that shared libraries have been
10821 loaded. If it is not started, this may mean that the symbol is
10822 in a shared library. */
10824 if (ptid_get_pid (inferior_ptid
) == 0)
10825 error (_("Unable to insert catchpoint. Try to start the program first."));
10827 /* At this point, we know that we are debugging an Ada program and
10828 that the inferior has been started, but we still are not able to
10829 find the run-time symbols. That can mean that we are in
10830 configurable run time mode, or that a-except as been optimized
10831 out by the linker... In any case, at this point it is not worth
10832 supporting this feature. */
10834 error (_("Cannot insert Ada exception catchpoints in this configuration."));
10837 /* True iff FRAME is very likely to be that of a function that is
10838 part of the runtime system. This is all very heuristic, but is
10839 intended to be used as advice as to what frames are uninteresting
10843 is_known_support_routine (struct frame_info
*frame
)
10845 struct symtab_and_line sal
;
10846 const char *func_name
;
10847 enum language func_lang
;
10850 /* If this code does not have any debugging information (no symtab),
10851 This cannot be any user code. */
10853 find_frame_sal (frame
, &sal
);
10854 if (sal
.symtab
== NULL
)
10857 /* If there is a symtab, but the associated source file cannot be
10858 located, then assume this is not user code: Selecting a frame
10859 for which we cannot display the code would not be very helpful
10860 for the user. This should also take care of case such as VxWorks
10861 where the kernel has some debugging info provided for a few units. */
10863 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10866 /* Check the unit filename againt the Ada runtime file naming.
10867 We also check the name of the objfile against the name of some
10868 known system libraries that sometimes come with debugging info
10871 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10873 re_comp (known_runtime_file_name_patterns
[i
]);
10874 if (re_exec (sal
.symtab
->filename
))
10876 if (sal
.symtab
->objfile
!= NULL
10877 && re_exec (sal
.symtab
->objfile
->name
))
10881 /* Check whether the function is a GNAT-generated entity. */
10883 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
10884 if (func_name
== NULL
)
10887 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10889 re_comp (known_auxiliary_function_name_patterns
[i
]);
10890 if (re_exec (func_name
))
10897 /* Find the first frame that contains debugging information and that is not
10898 part of the Ada run-time, starting from FI and moving upward. */
10901 ada_find_printable_frame (struct frame_info
*fi
)
10903 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10905 if (!is_known_support_routine (fi
))
10914 /* Assuming that the inferior just triggered an unhandled exception
10915 catchpoint, return the address in inferior memory where the name
10916 of the exception is stored.
10918 Return zero if the address could not be computed. */
10921 ada_unhandled_exception_name_addr (void)
10923 return parse_and_eval_address ("e.full_name");
10926 /* Same as ada_unhandled_exception_name_addr, except that this function
10927 should be used when the inferior uses an older version of the runtime,
10928 where the exception name needs to be extracted from a specific frame
10929 several frames up in the callstack. */
10932 ada_unhandled_exception_name_addr_from_raise (void)
10935 struct frame_info
*fi
;
10936 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
10938 /* To determine the name of this exception, we need to select
10939 the frame corresponding to RAISE_SYM_NAME. This frame is
10940 at least 3 levels up, so we simply skip the first 3 frames
10941 without checking the name of their associated function. */
10942 fi
= get_current_frame ();
10943 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10945 fi
= get_prev_frame (fi
);
10949 const char *func_name
;
10950 enum language func_lang
;
10952 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
10953 if (func_name
!= NULL
10954 && strcmp (func_name
, data
->exception_info
->catch_exception_sym
) == 0)
10955 break; /* We found the frame we were looking for... */
10956 fi
= get_prev_frame (fi
);
10963 return parse_and_eval_address ("id.full_name");
10966 /* Assuming the inferior just triggered an Ada exception catchpoint
10967 (of any type), return the address in inferior memory where the name
10968 of the exception is stored, if applicable.
10970 Return zero if the address could not be computed, or if not relevant. */
10973 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10974 struct breakpoint
*b
)
10976 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
10980 case ex_catch_exception
:
10981 return (parse_and_eval_address ("e.full_name"));
10984 case ex_catch_exception_unhandled
:
10985 return data
->exception_info
->unhandled_exception_name_addr ();
10988 case ex_catch_assert
:
10989 return 0; /* Exception name is not relevant in this case. */
10993 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10997 return 0; /* Should never be reached. */
11000 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11001 any error that ada_exception_name_addr_1 might cause to be thrown.
11002 When an error is intercepted, a warning with the error message is printed,
11003 and zero is returned. */
11006 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
11007 struct breakpoint
*b
)
11009 volatile struct gdb_exception e
;
11010 CORE_ADDR result
= 0;
11012 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11014 result
= ada_exception_name_addr_1 (ex
, b
);
11019 warning (_("failed to get exception name: %s"), e
.message
);
11026 static struct symtab_and_line
ada_exception_sal (enum exception_catchpoint_kind
,
11028 const struct breakpoint_ops
**);
11029 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11031 /* Ada catchpoints.
11033 In the case of catchpoints on Ada exceptions, the catchpoint will
11034 stop the target on every exception the program throws. When a user
11035 specifies the name of a specific exception, we translate this
11036 request into a condition expression (in text form), and then parse
11037 it into an expression stored in each of the catchpoint's locations.
11038 We then use this condition to check whether the exception that was
11039 raised is the one the user is interested in. If not, then the
11040 target is resumed again. We store the name of the requested
11041 exception, in order to be able to re-set the condition expression
11042 when symbols change. */
11044 /* An instance of this type is used to represent an Ada catchpoint
11045 breakpoint location. It includes a "struct bp_location" as a kind
11046 of base class; users downcast to "struct bp_location *" when
11049 struct ada_catchpoint_location
11051 /* The base class. */
11052 struct bp_location base
;
11054 /* The condition that checks whether the exception that was raised
11055 is the specific exception the user specified on catchpoint
11057 struct expression
*excep_cond_expr
;
11060 /* Implement the DTOR method in the bp_location_ops structure for all
11061 Ada exception catchpoint kinds. */
11064 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11066 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11068 xfree (al
->excep_cond_expr
);
11071 /* The vtable to be used in Ada catchpoint locations. */
11073 static const struct bp_location_ops ada_catchpoint_location_ops
=
11075 ada_catchpoint_location_dtor
11078 /* An instance of this type is used to represent an Ada catchpoint.
11079 It includes a "struct breakpoint" as a kind of base class; users
11080 downcast to "struct breakpoint *" when needed. */
11082 struct ada_catchpoint
11084 /* The base class. */
11085 struct breakpoint base
;
11087 /* The name of the specific exception the user specified. */
11088 char *excep_string
;
11091 /* Parse the exception condition string in the context of each of the
11092 catchpoint's locations, and store them for later evaluation. */
11095 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11097 struct cleanup
*old_chain
;
11098 struct bp_location
*bl
;
11101 /* Nothing to do if there's no specific exception to catch. */
11102 if (c
->excep_string
== NULL
)
11105 /* Same if there are no locations... */
11106 if (c
->base
.loc
== NULL
)
11109 /* Compute the condition expression in text form, from the specific
11110 expection we want to catch. */
11111 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11112 old_chain
= make_cleanup (xfree
, cond_string
);
11114 /* Iterate over all the catchpoint's locations, and parse an
11115 expression for each. */
11116 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11118 struct ada_catchpoint_location
*ada_loc
11119 = (struct ada_catchpoint_location
*) bl
;
11120 struct expression
*exp
= NULL
;
11122 if (!bl
->shlib_disabled
)
11124 volatile struct gdb_exception e
;
11128 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11130 exp
= parse_exp_1 (&s
, block_for_pc (bl
->address
), 0);
11133 warning (_("failed to reevaluate internal exception condition "
11134 "for catchpoint %d: %s"),
11135 c
->base
.number
, e
.message
);
11138 ada_loc
->excep_cond_expr
= exp
;
11141 do_cleanups (old_chain
);
11144 /* Implement the DTOR method in the breakpoint_ops structure for all
11145 exception catchpoint kinds. */
11148 dtor_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
11150 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11152 xfree (c
->excep_string
);
11154 bkpt_breakpoint_ops
.dtor (b
);
11157 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11158 structure for all exception catchpoint kinds. */
11160 static struct bp_location
*
11161 allocate_location_exception (enum exception_catchpoint_kind ex
,
11162 struct breakpoint
*self
)
11164 struct ada_catchpoint_location
*loc
;
11166 loc
= XNEW (struct ada_catchpoint_location
);
11167 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11168 loc
->excep_cond_expr
= NULL
;
11172 /* Implement the RE_SET method in the breakpoint_ops structure for all
11173 exception catchpoint kinds. */
11176 re_set_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
11178 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11180 /* Call the base class's method. This updates the catchpoint's
11182 bkpt_breakpoint_ops
.re_set (b
);
11184 /* Reparse the exception conditional expressions. One for each
11186 create_excep_cond_exprs (c
);
11189 /* Returns true if we should stop for this breakpoint hit. If the
11190 user specified a specific exception, we only want to cause a stop
11191 if the program thrown that exception. */
11194 should_stop_exception (const struct bp_location
*bl
)
11196 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11197 const struct ada_catchpoint_location
*ada_loc
11198 = (const struct ada_catchpoint_location
*) bl
;
11199 volatile struct gdb_exception ex
;
11202 /* With no specific exception, should always stop. */
11203 if (c
->excep_string
== NULL
)
11206 if (ada_loc
->excep_cond_expr
== NULL
)
11208 /* We will have a NULL expression if back when we were creating
11209 the expressions, this location's had failed to parse. */
11214 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11216 struct value
*mark
;
11218 mark
= value_mark ();
11219 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11220 value_free_to_mark (mark
);
11223 exception_fprintf (gdb_stderr
, ex
,
11224 _("Error in testing exception condition:\n"));
11228 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11229 for all exception catchpoint kinds. */
11232 check_status_exception (enum exception_catchpoint_kind ex
, bpstat bs
)
11234 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11237 /* Implement the PRINT_IT method in the breakpoint_ops structure
11238 for all exception catchpoint kinds. */
11240 static enum print_stop_action
11241 print_it_exception (enum exception_catchpoint_kind ex
, bpstat bs
)
11243 struct ui_out
*uiout
= current_uiout
;
11244 struct breakpoint
*b
= bs
->breakpoint_at
;
11246 annotate_catchpoint (b
->number
);
11248 if (ui_out_is_mi_like_p (uiout
))
11250 ui_out_field_string (uiout
, "reason",
11251 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11252 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11255 ui_out_text (uiout
,
11256 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11257 : "\nCatchpoint ");
11258 ui_out_field_int (uiout
, "bkptno", b
->number
);
11259 ui_out_text (uiout
, ", ");
11263 case ex_catch_exception
:
11264 case ex_catch_exception_unhandled
:
11266 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11267 char exception_name
[256];
11271 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
11272 exception_name
[sizeof (exception_name
) - 1] = '\0';
11276 /* For some reason, we were unable to read the exception
11277 name. This could happen if the Runtime was compiled
11278 without debugging info, for instance. In that case,
11279 just replace the exception name by the generic string
11280 "exception" - it will read as "an exception" in the
11281 notification we are about to print. */
11282 memcpy (exception_name
, "exception", sizeof ("exception"));
11284 /* In the case of unhandled exception breakpoints, we print
11285 the exception name as "unhandled EXCEPTION_NAME", to make
11286 it clearer to the user which kind of catchpoint just got
11287 hit. We used ui_out_text to make sure that this extra
11288 info does not pollute the exception name in the MI case. */
11289 if (ex
== ex_catch_exception_unhandled
)
11290 ui_out_text (uiout
, "unhandled ");
11291 ui_out_field_string (uiout
, "exception-name", exception_name
);
11294 case ex_catch_assert
:
11295 /* In this case, the name of the exception is not really
11296 important. Just print "failed assertion" to make it clearer
11297 that his program just hit an assertion-failure catchpoint.
11298 We used ui_out_text because this info does not belong in
11300 ui_out_text (uiout
, "failed assertion");
11303 ui_out_text (uiout
, " at ");
11304 ada_find_printable_frame (get_current_frame ());
11306 return PRINT_SRC_AND_LOC
;
11309 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11310 for all exception catchpoint kinds. */
11313 print_one_exception (enum exception_catchpoint_kind ex
,
11314 struct breakpoint
*b
, struct bp_location
**last_loc
)
11316 struct ui_out
*uiout
= current_uiout
;
11317 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11318 struct value_print_options opts
;
11320 get_user_print_options (&opts
);
11321 if (opts
.addressprint
)
11323 annotate_field (4);
11324 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11327 annotate_field (5);
11328 *last_loc
= b
->loc
;
11331 case ex_catch_exception
:
11332 if (c
->excep_string
!= NULL
)
11334 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11336 ui_out_field_string (uiout
, "what", msg
);
11340 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11344 case ex_catch_exception_unhandled
:
11345 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
11348 case ex_catch_assert
:
11349 ui_out_field_string (uiout
, "what", "failed Ada assertions");
11353 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11358 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11359 for all exception catchpoint kinds. */
11362 print_mention_exception (enum exception_catchpoint_kind ex
,
11363 struct breakpoint
*b
)
11365 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11366 struct ui_out
*uiout
= current_uiout
;
11368 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
11369 : _("Catchpoint "));
11370 ui_out_field_int (uiout
, "bkptno", b
->number
);
11371 ui_out_text (uiout
, ": ");
11375 case ex_catch_exception
:
11376 if (c
->excep_string
!= NULL
)
11378 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11379 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
11381 ui_out_text (uiout
, info
);
11382 do_cleanups (old_chain
);
11385 ui_out_text (uiout
, _("all Ada exceptions"));
11388 case ex_catch_exception_unhandled
:
11389 ui_out_text (uiout
, _("unhandled Ada exceptions"));
11392 case ex_catch_assert
:
11393 ui_out_text (uiout
, _("failed Ada assertions"));
11397 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11402 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11403 for all exception catchpoint kinds. */
11406 print_recreate_exception (enum exception_catchpoint_kind ex
,
11407 struct breakpoint
*b
, struct ui_file
*fp
)
11409 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11413 case ex_catch_exception
:
11414 fprintf_filtered (fp
, "catch exception");
11415 if (c
->excep_string
!= NULL
)
11416 fprintf_filtered (fp
, " %s", c
->excep_string
);
11419 case ex_catch_exception_unhandled
:
11420 fprintf_filtered (fp
, "catch exception unhandled");
11423 case ex_catch_assert
:
11424 fprintf_filtered (fp
, "catch assert");
11428 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11430 print_recreate_thread (b
, fp
);
11433 /* Virtual table for "catch exception" breakpoints. */
11436 dtor_catch_exception (struct breakpoint
*b
)
11438 dtor_exception (ex_catch_exception
, b
);
11441 static struct bp_location
*
11442 allocate_location_catch_exception (struct breakpoint
*self
)
11444 return allocate_location_exception (ex_catch_exception
, self
);
11448 re_set_catch_exception (struct breakpoint
*b
)
11450 re_set_exception (ex_catch_exception
, b
);
11454 check_status_catch_exception (bpstat bs
)
11456 check_status_exception (ex_catch_exception
, bs
);
11459 static enum print_stop_action
11460 print_it_catch_exception (bpstat bs
)
11462 return print_it_exception (ex_catch_exception
, bs
);
11466 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
11468 print_one_exception (ex_catch_exception
, b
, last_loc
);
11472 print_mention_catch_exception (struct breakpoint
*b
)
11474 print_mention_exception (ex_catch_exception
, b
);
11478 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
11480 print_recreate_exception (ex_catch_exception
, b
, fp
);
11483 static struct breakpoint_ops catch_exception_breakpoint_ops
;
11485 /* Virtual table for "catch exception unhandled" breakpoints. */
11488 dtor_catch_exception_unhandled (struct breakpoint
*b
)
11490 dtor_exception (ex_catch_exception_unhandled
, b
);
11493 static struct bp_location
*
11494 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
11496 return allocate_location_exception (ex_catch_exception_unhandled
, self
);
11500 re_set_catch_exception_unhandled (struct breakpoint
*b
)
11502 re_set_exception (ex_catch_exception_unhandled
, b
);
11506 check_status_catch_exception_unhandled (bpstat bs
)
11508 check_status_exception (ex_catch_exception_unhandled
, bs
);
11511 static enum print_stop_action
11512 print_it_catch_exception_unhandled (bpstat bs
)
11514 return print_it_exception (ex_catch_exception_unhandled
, bs
);
11518 print_one_catch_exception_unhandled (struct breakpoint
*b
,
11519 struct bp_location
**last_loc
)
11521 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
11525 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
11527 print_mention_exception (ex_catch_exception_unhandled
, b
);
11531 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
11532 struct ui_file
*fp
)
11534 print_recreate_exception (ex_catch_exception_unhandled
, b
, fp
);
11537 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
11539 /* Virtual table for "catch assert" breakpoints. */
11542 dtor_catch_assert (struct breakpoint
*b
)
11544 dtor_exception (ex_catch_assert
, b
);
11547 static struct bp_location
*
11548 allocate_location_catch_assert (struct breakpoint
*self
)
11550 return allocate_location_exception (ex_catch_assert
, self
);
11554 re_set_catch_assert (struct breakpoint
*b
)
11556 return re_set_exception (ex_catch_assert
, b
);
11560 check_status_catch_assert (bpstat bs
)
11562 check_status_exception (ex_catch_assert
, bs
);
11565 static enum print_stop_action
11566 print_it_catch_assert (bpstat bs
)
11568 return print_it_exception (ex_catch_assert
, bs
);
11572 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
11574 print_one_exception (ex_catch_assert
, b
, last_loc
);
11578 print_mention_catch_assert (struct breakpoint
*b
)
11580 print_mention_exception (ex_catch_assert
, b
);
11584 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
11586 print_recreate_exception (ex_catch_assert
, b
, fp
);
11589 static struct breakpoint_ops catch_assert_breakpoint_ops
;
11591 /* Return a newly allocated copy of the first space-separated token
11592 in ARGSP, and then adjust ARGSP to point immediately after that
11595 Return NULL if ARGPS does not contain any more tokens. */
11598 ada_get_next_arg (char **argsp
)
11600 char *args
= *argsp
;
11604 args
= skip_spaces (args
);
11605 if (args
[0] == '\0')
11606 return NULL
; /* No more arguments. */
11608 /* Find the end of the current argument. */
11610 end
= skip_to_space (args
);
11612 /* Adjust ARGSP to point to the start of the next argument. */
11616 /* Make a copy of the current argument and return it. */
11618 result
= xmalloc (end
- args
+ 1);
11619 strncpy (result
, args
, end
- args
);
11620 result
[end
- args
] = '\0';
11625 /* Split the arguments specified in a "catch exception" command.
11626 Set EX to the appropriate catchpoint type.
11627 Set EXCEP_STRING to the name of the specific exception if
11628 specified by the user.
11629 If a condition is found at the end of the arguments, the condition
11630 expression is stored in COND_STRING (memory must be deallocated
11631 after use). Otherwise COND_STRING is set to NULL. */
11634 catch_ada_exception_command_split (char *args
,
11635 enum exception_catchpoint_kind
*ex
,
11636 char **excep_string
,
11637 char **cond_string
)
11639 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
11640 char *exception_name
;
11643 exception_name
= ada_get_next_arg (&args
);
11644 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
11646 /* This is not an exception name; this is the start of a condition
11647 expression for a catchpoint on all exceptions. So, "un-get"
11648 this token, and set exception_name to NULL. */
11649 xfree (exception_name
);
11650 exception_name
= NULL
;
11653 make_cleanup (xfree
, exception_name
);
11655 /* Check to see if we have a condition. */
11657 args
= skip_spaces (args
);
11658 if (strncmp (args
, "if", 2) == 0
11659 && (isspace (args
[2]) || args
[2] == '\0'))
11662 args
= skip_spaces (args
);
11664 if (args
[0] == '\0')
11665 error (_("Condition missing after `if' keyword"));
11666 cond
= xstrdup (args
);
11667 make_cleanup (xfree
, cond
);
11669 args
+= strlen (args
);
11672 /* Check that we do not have any more arguments. Anything else
11675 if (args
[0] != '\0')
11676 error (_("Junk at end of expression"));
11678 discard_cleanups (old_chain
);
11680 if (exception_name
== NULL
)
11682 /* Catch all exceptions. */
11683 *ex
= ex_catch_exception
;
11684 *excep_string
= NULL
;
11686 else if (strcmp (exception_name
, "unhandled") == 0)
11688 /* Catch unhandled exceptions. */
11689 *ex
= ex_catch_exception_unhandled
;
11690 *excep_string
= NULL
;
11694 /* Catch a specific exception. */
11695 *ex
= ex_catch_exception
;
11696 *excep_string
= exception_name
;
11698 *cond_string
= cond
;
11701 /* Return the name of the symbol on which we should break in order to
11702 implement a catchpoint of the EX kind. */
11704 static const char *
11705 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
11707 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11709 gdb_assert (data
->exception_info
!= NULL
);
11713 case ex_catch_exception
:
11714 return (data
->exception_info
->catch_exception_sym
);
11716 case ex_catch_exception_unhandled
:
11717 return (data
->exception_info
->catch_exception_unhandled_sym
);
11719 case ex_catch_assert
:
11720 return (data
->exception_info
->catch_assert_sym
);
11723 internal_error (__FILE__
, __LINE__
,
11724 _("unexpected catchpoint kind (%d)"), ex
);
11728 /* Return the breakpoint ops "virtual table" used for catchpoints
11731 static const struct breakpoint_ops
*
11732 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
11736 case ex_catch_exception
:
11737 return (&catch_exception_breakpoint_ops
);
11739 case ex_catch_exception_unhandled
:
11740 return (&catch_exception_unhandled_breakpoint_ops
);
11742 case ex_catch_assert
:
11743 return (&catch_assert_breakpoint_ops
);
11746 internal_error (__FILE__
, __LINE__
,
11747 _("unexpected catchpoint kind (%d)"), ex
);
11751 /* Return the condition that will be used to match the current exception
11752 being raised with the exception that the user wants to catch. This
11753 assumes that this condition is used when the inferior just triggered
11754 an exception catchpoint.
11756 The string returned is a newly allocated string that needs to be
11757 deallocated later. */
11760 ada_exception_catchpoint_cond_string (const char *excep_string
)
11764 /* The standard exceptions are a special case. They are defined in
11765 runtime units that have been compiled without debugging info; if
11766 EXCEP_STRING is the not-fully-qualified name of a standard
11767 exception (e.g. "constraint_error") then, during the evaluation
11768 of the condition expression, the symbol lookup on this name would
11769 *not* return this standard exception. The catchpoint condition
11770 may then be set only on user-defined exceptions which have the
11771 same not-fully-qualified name (e.g. my_package.constraint_error).
11773 To avoid this unexcepted behavior, these standard exceptions are
11774 systematically prefixed by "standard". This means that "catch
11775 exception constraint_error" is rewritten into "catch exception
11776 standard.constraint_error".
11778 If an exception named contraint_error is defined in another package of
11779 the inferior program, then the only way to specify this exception as a
11780 breakpoint condition is to use its fully-qualified named:
11781 e.g. my_package.constraint_error. */
11783 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
11785 if (strcmp (standard_exc
[i
], excep_string
) == 0)
11787 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11791 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
11794 /* Return the symtab_and_line that should be used to insert an exception
11795 catchpoint of the TYPE kind.
11797 EXCEP_STRING should contain the name of a specific exception that
11798 the catchpoint should catch, or NULL otherwise.
11800 ADDR_STRING returns the name of the function where the real
11801 breakpoint that implements the catchpoints is set, depending on the
11802 type of catchpoint we need to create. */
11804 static struct symtab_and_line
11805 ada_exception_sal (enum exception_catchpoint_kind ex
, char *excep_string
,
11806 char **addr_string
, const struct breakpoint_ops
**ops
)
11808 const char *sym_name
;
11809 struct symbol
*sym
;
11811 /* First, find out which exception support info to use. */
11812 ada_exception_support_info_sniffer ();
11814 /* Then lookup the function on which we will break in order to catch
11815 the Ada exceptions requested by the user. */
11816 sym_name
= ada_exception_sym_name (ex
);
11817 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
11819 /* We can assume that SYM is not NULL at this stage. If the symbol
11820 did not exist, ada_exception_support_info_sniffer would have
11821 raised an exception.
11823 Also, ada_exception_support_info_sniffer should have already
11824 verified that SYM is a function symbol. */
11825 gdb_assert (sym
!= NULL
);
11826 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
11828 /* Set ADDR_STRING. */
11829 *addr_string
= xstrdup (sym_name
);
11832 *ops
= ada_exception_breakpoint_ops (ex
);
11834 return find_function_start_sal (sym
, 1);
11837 /* Parse the arguments (ARGS) of the "catch exception" command.
11839 If the user asked the catchpoint to catch only a specific
11840 exception, then save the exception name in ADDR_STRING.
11842 If the user provided a condition, then set COND_STRING to
11843 that condition expression (the memory must be deallocated
11844 after use). Otherwise, set COND_STRING to NULL.
11846 See ada_exception_sal for a description of all the remaining
11847 function arguments of this function. */
11849 static struct symtab_and_line
11850 ada_decode_exception_location (char *args
, char **addr_string
,
11851 char **excep_string
,
11852 char **cond_string
,
11853 const struct breakpoint_ops
**ops
)
11855 enum exception_catchpoint_kind ex
;
11857 catch_ada_exception_command_split (args
, &ex
, excep_string
, cond_string
);
11858 return ada_exception_sal (ex
, *excep_string
, addr_string
, ops
);
11861 /* Create an Ada exception catchpoint. */
11864 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
11865 struct symtab_and_line sal
,
11867 char *excep_string
,
11869 const struct breakpoint_ops
*ops
,
11873 struct ada_catchpoint
*c
;
11875 c
= XNEW (struct ada_catchpoint
);
11876 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
11877 ops
, tempflag
, from_tty
);
11878 c
->excep_string
= excep_string
;
11879 create_excep_cond_exprs (c
);
11880 if (cond_string
!= NULL
)
11881 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
11882 install_breakpoint (0, &c
->base
, 1);
11885 /* Implement the "catch exception" command. */
11888 catch_ada_exception_command (char *arg
, int from_tty
,
11889 struct cmd_list_element
*command
)
11891 struct gdbarch
*gdbarch
= get_current_arch ();
11893 struct symtab_and_line sal
;
11894 char *addr_string
= NULL
;
11895 char *excep_string
= NULL
;
11896 char *cond_string
= NULL
;
11897 const struct breakpoint_ops
*ops
= NULL
;
11899 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
11903 sal
= ada_decode_exception_location (arg
, &addr_string
, &excep_string
,
11904 &cond_string
, &ops
);
11905 create_ada_exception_catchpoint (gdbarch
, sal
, addr_string
,
11906 excep_string
, cond_string
, ops
,
11907 tempflag
, from_tty
);
11910 /* Assuming that ARGS contains the arguments of a "catch assert"
11911 command, parse those arguments and return a symtab_and_line object
11912 for a failed assertion catchpoint.
11914 Set ADDR_STRING to the name of the function where the real
11915 breakpoint that implements the catchpoint is set.
11917 If ARGS contains a condition, set COND_STRING to that condition
11918 (the memory needs to be deallocated after use). Otherwise, set
11919 COND_STRING to NULL. */
11921 static struct symtab_and_line
11922 ada_decode_assert_location (char *args
, char **addr_string
,
11923 char **cond_string
,
11924 const struct breakpoint_ops
**ops
)
11926 args
= skip_spaces (args
);
11928 /* Check whether a condition was provided. */
11929 if (strncmp (args
, "if", 2) == 0
11930 && (isspace (args
[2]) || args
[2] == '\0'))
11933 args
= skip_spaces (args
);
11934 if (args
[0] == '\0')
11935 error (_("condition missing after `if' keyword"));
11936 *cond_string
= xstrdup (args
);
11939 /* Otherwise, there should be no other argument at the end of
11941 else if (args
[0] != '\0')
11942 error (_("Junk at end of arguments."));
11944 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, ops
);
11947 /* Implement the "catch assert" command. */
11950 catch_assert_command (char *arg
, int from_tty
,
11951 struct cmd_list_element
*command
)
11953 struct gdbarch
*gdbarch
= get_current_arch ();
11955 struct symtab_and_line sal
;
11956 char *addr_string
= NULL
;
11957 char *cond_string
= NULL
;
11958 const struct breakpoint_ops
*ops
= NULL
;
11960 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
11964 sal
= ada_decode_assert_location (arg
, &addr_string
, &cond_string
, &ops
);
11965 create_ada_exception_catchpoint (gdbarch
, sal
, addr_string
,
11966 NULL
, cond_string
, ops
, tempflag
,
11970 /* Information about operators given special treatment in functions
11972 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
11974 #define ADA_OPERATORS \
11975 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
11976 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
11977 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
11978 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
11979 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
11980 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
11981 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
11982 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
11983 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
11984 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
11985 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
11986 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
11987 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
11988 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
11989 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
11990 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
11991 OP_DEFN (OP_OTHERS, 1, 1, 0) \
11992 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
11993 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
11996 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
11999 switch (exp
->elts
[pc
- 1].opcode
)
12002 operator_length_standard (exp
, pc
, oplenp
, argsp
);
12005 #define OP_DEFN(op, len, args, binop) \
12006 case op: *oplenp = len; *argsp = args; break;
12012 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
12017 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
12022 /* Implementation of the exp_descriptor method operator_check. */
12025 ada_operator_check (struct expression
*exp
, int pos
,
12026 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
12029 const union exp_element
*const elts
= exp
->elts
;
12030 struct type
*type
= NULL
;
12032 switch (elts
[pos
].opcode
)
12034 case UNOP_IN_RANGE
:
12036 type
= elts
[pos
+ 1].type
;
12040 return operator_check_standard (exp
, pos
, objfile_func
, data
);
12043 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
12045 if (type
&& TYPE_OBJFILE (type
)
12046 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
12053 ada_op_name (enum exp_opcode opcode
)
12058 return op_name_standard (opcode
);
12060 #define OP_DEFN(op, len, args, binop) case op: return #op;
12065 return "OP_AGGREGATE";
12067 return "OP_CHOICES";
12073 /* As for operator_length, but assumes PC is pointing at the first
12074 element of the operator, and gives meaningful results only for the
12075 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
12078 ada_forward_operator_length (struct expression
*exp
, int pc
,
12079 int *oplenp
, int *argsp
)
12081 switch (exp
->elts
[pc
].opcode
)
12084 *oplenp
= *argsp
= 0;
12087 #define OP_DEFN(op, len, args, binop) \
12088 case op: *oplenp = len; *argsp = args; break;
12094 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
12099 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
12105 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
12107 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
12115 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
12117 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
12122 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
12126 /* Ada attributes ('Foo). */
12129 case OP_ATR_LENGTH
:
12133 case OP_ATR_MODULUS
:
12140 case UNOP_IN_RANGE
:
12142 /* XXX: gdb_sprint_host_address, type_sprint */
12143 fprintf_filtered (stream
, _("Type @"));
12144 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
12145 fprintf_filtered (stream
, " (");
12146 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
12147 fprintf_filtered (stream
, ")");
12149 case BINOP_IN_BOUNDS
:
12150 fprintf_filtered (stream
, " (%d)",
12151 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
12153 case TERNOP_IN_RANGE
:
12158 case OP_DISCRETE_RANGE
:
12159 case OP_POSITIONAL
:
12166 char *name
= &exp
->elts
[elt
+ 2].string
;
12167 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
12169 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
12174 return dump_subexp_body_standard (exp
, stream
, elt
);
12178 for (i
= 0; i
< nargs
; i
+= 1)
12179 elt
= dump_subexp (exp
, stream
, elt
);
12184 /* The Ada extension of print_subexp (q.v.). */
12187 ada_print_subexp (struct expression
*exp
, int *pos
,
12188 struct ui_file
*stream
, enum precedence prec
)
12190 int oplen
, nargs
, i
;
12192 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
12194 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
12201 print_subexp_standard (exp
, pos
, stream
, prec
);
12205 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
12208 case BINOP_IN_BOUNDS
:
12209 /* XXX: sprint_subexp */
12210 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12211 fputs_filtered (" in ", stream
);
12212 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12213 fputs_filtered ("'range", stream
);
12214 if (exp
->elts
[pc
+ 1].longconst
> 1)
12215 fprintf_filtered (stream
, "(%ld)",
12216 (long) exp
->elts
[pc
+ 1].longconst
);
12219 case TERNOP_IN_RANGE
:
12220 if (prec
>= PREC_EQUAL
)
12221 fputs_filtered ("(", stream
);
12222 /* XXX: sprint_subexp */
12223 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12224 fputs_filtered (" in ", stream
);
12225 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
12226 fputs_filtered (" .. ", stream
);
12227 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
12228 if (prec
>= PREC_EQUAL
)
12229 fputs_filtered (")", stream
);
12234 case OP_ATR_LENGTH
:
12238 case OP_ATR_MODULUS
:
12243 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
12245 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
12246 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
12250 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12251 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
12256 for (tem
= 1; tem
< nargs
; tem
+= 1)
12258 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
12259 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
12261 fputs_filtered (")", stream
);
12266 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
12267 fputs_filtered ("'(", stream
);
12268 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
12269 fputs_filtered (")", stream
);
12272 case UNOP_IN_RANGE
:
12273 /* XXX: sprint_subexp */
12274 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12275 fputs_filtered (" in ", stream
);
12276 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
12279 case OP_DISCRETE_RANGE
:
12280 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12281 fputs_filtered ("..", stream
);
12282 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12286 fputs_filtered ("others => ", stream
);
12287 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12291 for (i
= 0; i
< nargs
-1; i
+= 1)
12294 fputs_filtered ("|", stream
);
12295 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12297 fputs_filtered (" => ", stream
);
12298 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12301 case OP_POSITIONAL
:
12302 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12306 fputs_filtered ("(", stream
);
12307 for (i
= 0; i
< nargs
; i
+= 1)
12310 fputs_filtered (", ", stream
);
12311 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12313 fputs_filtered (")", stream
);
12318 /* Table mapping opcodes into strings for printing operators
12319 and precedences of the operators. */
12321 static const struct op_print ada_op_print_tab
[] = {
12322 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
12323 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
12324 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
12325 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
12326 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
12327 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
12328 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
12329 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
12330 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
12331 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
12332 {">", BINOP_GTR
, PREC_ORDER
, 0},
12333 {"<", BINOP_LESS
, PREC_ORDER
, 0},
12334 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
12335 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
12336 {"+", BINOP_ADD
, PREC_ADD
, 0},
12337 {"-", BINOP_SUB
, PREC_ADD
, 0},
12338 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
12339 {"*", BINOP_MUL
, PREC_MUL
, 0},
12340 {"/", BINOP_DIV
, PREC_MUL
, 0},
12341 {"rem", BINOP_REM
, PREC_MUL
, 0},
12342 {"mod", BINOP_MOD
, PREC_MUL
, 0},
12343 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
12344 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
12345 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
12346 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
12347 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
12348 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
12349 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
12350 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
12351 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
12352 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
12356 enum ada_primitive_types
{
12357 ada_primitive_type_int
,
12358 ada_primitive_type_long
,
12359 ada_primitive_type_short
,
12360 ada_primitive_type_char
,
12361 ada_primitive_type_float
,
12362 ada_primitive_type_double
,
12363 ada_primitive_type_void
,
12364 ada_primitive_type_long_long
,
12365 ada_primitive_type_long_double
,
12366 ada_primitive_type_natural
,
12367 ada_primitive_type_positive
,
12368 ada_primitive_type_system_address
,
12369 nr_ada_primitive_types
12373 ada_language_arch_info (struct gdbarch
*gdbarch
,
12374 struct language_arch_info
*lai
)
12376 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
12378 lai
->primitive_type_vector
12379 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
12382 lai
->primitive_type_vector
[ada_primitive_type_int
]
12383 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12385 lai
->primitive_type_vector
[ada_primitive_type_long
]
12386 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
12387 0, "long_integer");
12388 lai
->primitive_type_vector
[ada_primitive_type_short
]
12389 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
12390 0, "short_integer");
12391 lai
->string_char_type
12392 = lai
->primitive_type_vector
[ada_primitive_type_char
]
12393 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
12394 lai
->primitive_type_vector
[ada_primitive_type_float
]
12395 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
12397 lai
->primitive_type_vector
[ada_primitive_type_double
]
12398 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12399 "long_float", NULL
);
12400 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
12401 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
12402 0, "long_long_integer");
12403 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
12404 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12405 "long_long_float", NULL
);
12406 lai
->primitive_type_vector
[ada_primitive_type_natural
]
12407 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12409 lai
->primitive_type_vector
[ada_primitive_type_positive
]
12410 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12412 lai
->primitive_type_vector
[ada_primitive_type_void
]
12413 = builtin
->builtin_void
;
12415 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
12416 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
12417 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
12418 = "system__address";
12420 lai
->bool_type_symbol
= NULL
;
12421 lai
->bool_type_default
= builtin
->builtin_bool
;
12424 /* Language vector */
12426 /* Not really used, but needed in the ada_language_defn. */
12429 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
12431 ada_emit_char (c
, type
, stream
, quoter
, 1);
12437 warnings_issued
= 0;
12438 return ada_parse ();
12441 static const struct exp_descriptor ada_exp_descriptor
= {
12443 ada_operator_length
,
12444 ada_operator_check
,
12446 ada_dump_subexp_body
,
12447 ada_evaluate_subexp
12450 /* Implement the "la_get_symbol_name_cmp" language_defn method
12453 static symbol_name_cmp_ftype
12454 ada_get_symbol_name_cmp (const char *lookup_name
)
12456 if (should_use_wild_match (lookup_name
))
12459 return compare_names
;
12462 /* Implement the "la_read_var_value" language_defn method for Ada. */
12464 static struct value
*
12465 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
12467 struct block
*frame_block
= NULL
;
12468 struct symbol
*renaming_sym
= NULL
;
12470 /* The only case where default_read_var_value is not sufficient
12471 is when VAR is a renaming... */
12473 frame_block
= get_frame_block (frame
, NULL
);
12475 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
12476 if (renaming_sym
!= NULL
)
12477 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
12479 /* This is a typical case where we expect the default_read_var_value
12480 function to work. */
12481 return default_read_var_value (var
, frame
);
12484 const struct language_defn ada_language_defn
= {
12485 "ada", /* Language name */
12489 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
12490 that's not quite what this means. */
12492 macro_expansion_no
,
12493 &ada_exp_descriptor
,
12497 ada_printchar
, /* Print a character constant */
12498 ada_printstr
, /* Function to print string constant */
12499 emit_char
, /* Function to print single char (not used) */
12500 ada_print_type
, /* Print a type using appropriate syntax */
12501 ada_print_typedef
, /* Print a typedef using appropriate syntax */
12502 ada_val_print
, /* Print a value using appropriate syntax */
12503 ada_value_print
, /* Print a top-level value */
12504 ada_read_var_value
, /* la_read_var_value */
12505 NULL
, /* Language specific skip_trampoline */
12506 NULL
, /* name_of_this */
12507 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
12508 basic_lookup_transparent_type
, /* lookup_transparent_type */
12509 ada_la_decode
, /* Language specific symbol demangler */
12510 NULL
, /* Language specific
12511 class_name_from_physname */
12512 ada_op_print_tab
, /* expression operators for printing */
12513 0, /* c-style arrays */
12514 1, /* String lower bound */
12515 ada_get_gdb_completer_word_break_characters
,
12516 ada_make_symbol_completion_list
,
12517 ada_language_arch_info
,
12518 ada_print_array_index
,
12519 default_pass_by_reference
,
12521 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
12522 ada_iterate_over_symbols
,
12526 /* Provide a prototype to silence -Wmissing-prototypes. */
12527 extern initialize_file_ftype _initialize_ada_language
;
12529 /* Command-list for the "set/show ada" prefix command. */
12530 static struct cmd_list_element
*set_ada_list
;
12531 static struct cmd_list_element
*show_ada_list
;
12533 /* Implement the "set ada" prefix command. */
12536 set_ada_command (char *arg
, int from_tty
)
12538 printf_unfiltered (_(\
12539 "\"set ada\" must be followed by the name of a setting.\n"));
12540 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
12543 /* Implement the "show ada" prefix command. */
12546 show_ada_command (char *args
, int from_tty
)
12548 cmd_show_list (show_ada_list
, from_tty
, "");
12552 initialize_ada_catchpoint_ops (void)
12554 struct breakpoint_ops
*ops
;
12556 initialize_breakpoint_ops ();
12558 ops
= &catch_exception_breakpoint_ops
;
12559 *ops
= bkpt_breakpoint_ops
;
12560 ops
->dtor
= dtor_catch_exception
;
12561 ops
->allocate_location
= allocate_location_catch_exception
;
12562 ops
->re_set
= re_set_catch_exception
;
12563 ops
->check_status
= check_status_catch_exception
;
12564 ops
->print_it
= print_it_catch_exception
;
12565 ops
->print_one
= print_one_catch_exception
;
12566 ops
->print_mention
= print_mention_catch_exception
;
12567 ops
->print_recreate
= print_recreate_catch_exception
;
12569 ops
= &catch_exception_unhandled_breakpoint_ops
;
12570 *ops
= bkpt_breakpoint_ops
;
12571 ops
->dtor
= dtor_catch_exception_unhandled
;
12572 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
12573 ops
->re_set
= re_set_catch_exception_unhandled
;
12574 ops
->check_status
= check_status_catch_exception_unhandled
;
12575 ops
->print_it
= print_it_catch_exception_unhandled
;
12576 ops
->print_one
= print_one_catch_exception_unhandled
;
12577 ops
->print_mention
= print_mention_catch_exception_unhandled
;
12578 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
12580 ops
= &catch_assert_breakpoint_ops
;
12581 *ops
= bkpt_breakpoint_ops
;
12582 ops
->dtor
= dtor_catch_assert
;
12583 ops
->allocate_location
= allocate_location_catch_assert
;
12584 ops
->re_set
= re_set_catch_assert
;
12585 ops
->check_status
= check_status_catch_assert
;
12586 ops
->print_it
= print_it_catch_assert
;
12587 ops
->print_one
= print_one_catch_assert
;
12588 ops
->print_mention
= print_mention_catch_assert
;
12589 ops
->print_recreate
= print_recreate_catch_assert
;
12593 _initialize_ada_language (void)
12595 add_language (&ada_language_defn
);
12597 initialize_ada_catchpoint_ops ();
12599 add_prefix_cmd ("ada", no_class
, set_ada_command
,
12600 _("Prefix command for changing Ada-specfic settings"),
12601 &set_ada_list
, "set ada ", 0, &setlist
);
12603 add_prefix_cmd ("ada", no_class
, show_ada_command
,
12604 _("Generic command for showing Ada-specific settings."),
12605 &show_ada_list
, "show ada ", 0, &showlist
);
12607 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
12608 &trust_pad_over_xvs
, _("\
12609 Enable or disable an optimization trusting PAD types over XVS types"), _("\
12610 Show whether an optimization trusting PAD types over XVS types is activated"),
12612 This is related to the encoding used by the GNAT compiler. The debugger\n\
12613 should normally trust the contents of PAD types, but certain older versions\n\
12614 of GNAT have a bug that sometimes causes the information in the PAD type\n\
12615 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
12616 work around this bug. It is always safe to turn this option \"off\", but\n\
12617 this incurs a slight performance penalty, so it is recommended to NOT change\n\
12618 this option to \"off\" unless necessary."),
12619 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
12621 add_catch_command ("exception", _("\
12622 Catch Ada exceptions, when raised.\n\
12623 With an argument, catch only exceptions with the given name."),
12624 catch_ada_exception_command
,
12628 add_catch_command ("assert", _("\
12629 Catch failed Ada assertions, when raised.\n\
12630 With an argument, catch only exceptions with the given name."),
12631 catch_assert_command
,
12636 varsize_limit
= 65536;
12638 obstack_init (&symbol_list_obstack
);
12640 decoded_names_store
= htab_create_alloc
12641 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
12642 NULL
, xcalloc
, xfree
);
12644 /* Setup per-inferior data. */
12645 observer_attach_inferior_exit (ada_inferior_exit
);
12647 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup
);