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_ENUMVAL (type
, TYPE_NFIELDS (type
) - 1);
698 return max_of_type (type
);
700 error (_("Unexpected type in ada_discrete_type_high_bound."));
704 /* The smallest 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_ENUMVAL (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
))
2300 v
= value_at (type
, value_address (obj
));
2301 bytes
= (unsigned char *) alloca (len
);
2302 read_memory (value_address (v
) + offset
, bytes
, len
);
2306 v
= allocate_value (type
);
2307 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2312 long new_offset
= offset
;
2314 set_value_component_location (v
, obj
);
2315 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2316 set_value_bitsize (v
, bit_size
);
2317 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2320 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2322 set_value_offset (v
, new_offset
);
2324 /* Also set the parent value. This is needed when trying to
2325 assign a new value (in inferior memory). */
2326 set_value_parent (v
, obj
);
2330 set_value_bitsize (v
, bit_size
);
2331 unpacked
= (unsigned char *) value_contents (v
);
2333 srcBitsLeft
= bit_size
;
2335 ntarg
= TYPE_LENGTH (type
);
2339 memset (unpacked
, 0, TYPE_LENGTH (type
));
2342 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2345 if (has_negatives (type
)
2346 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2350 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2353 switch (TYPE_CODE (type
))
2355 case TYPE_CODE_ARRAY
:
2356 case TYPE_CODE_UNION
:
2357 case TYPE_CODE_STRUCT
:
2358 /* Non-scalar values must be aligned at a byte boundary... */
2360 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2361 /* ... And are placed at the beginning (most-significant) bytes
2363 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2368 targ
= TYPE_LENGTH (type
) - 1;
2374 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2377 unusedLS
= bit_offset
;
2380 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2387 /* Mask for removing bits of the next source byte that are not
2388 part of the value. */
2389 unsigned int unusedMSMask
=
2390 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2392 /* Sign-extend bits for this byte. */
2393 unsigned int signMask
= sign
& ~unusedMSMask
;
2396 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2397 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2398 if (accumSize
>= HOST_CHAR_BIT
)
2400 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2401 accumSize
-= HOST_CHAR_BIT
;
2402 accum
>>= HOST_CHAR_BIT
;
2406 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2413 accum
|= sign
<< accumSize
;
2414 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2415 accumSize
-= HOST_CHAR_BIT
;
2416 accum
>>= HOST_CHAR_BIT
;
2424 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2425 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2428 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2429 int src_offset
, int n
, int bits_big_endian_p
)
2431 unsigned int accum
, mask
;
2432 int accum_bits
, chunk_size
;
2434 target
+= targ_offset
/ HOST_CHAR_BIT
;
2435 targ_offset
%= HOST_CHAR_BIT
;
2436 source
+= src_offset
/ HOST_CHAR_BIT
;
2437 src_offset
%= HOST_CHAR_BIT
;
2438 if (bits_big_endian_p
)
2440 accum
= (unsigned char) *source
;
2442 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2448 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2449 accum_bits
+= HOST_CHAR_BIT
;
2451 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2454 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2455 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2458 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2460 accum_bits
-= chunk_size
;
2467 accum
= (unsigned char) *source
>> src_offset
;
2469 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2473 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2474 accum_bits
+= HOST_CHAR_BIT
;
2476 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2479 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2480 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2482 accum_bits
-= chunk_size
;
2483 accum
>>= chunk_size
;
2490 /* Store the contents of FROMVAL into the location of TOVAL.
2491 Return a new value with the location of TOVAL and contents of
2492 FROMVAL. Handles assignment into packed fields that have
2493 floating-point or non-scalar types. */
2495 static struct value
*
2496 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2498 struct type
*type
= value_type (toval
);
2499 int bits
= value_bitsize (toval
);
2501 toval
= ada_coerce_ref (toval
);
2502 fromval
= ada_coerce_ref (fromval
);
2504 if (ada_is_direct_array_type (value_type (toval
)))
2505 toval
= ada_coerce_to_simple_array (toval
);
2506 if (ada_is_direct_array_type (value_type (fromval
)))
2507 fromval
= ada_coerce_to_simple_array (fromval
);
2509 if (!deprecated_value_modifiable (toval
))
2510 error (_("Left operand of assignment is not a modifiable lvalue."));
2512 if (VALUE_LVAL (toval
) == lval_memory
2514 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2515 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2517 int len
= (value_bitpos (toval
)
2518 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2520 char *buffer
= (char *) alloca (len
);
2522 CORE_ADDR to_addr
= value_address (toval
);
2524 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2525 fromval
= value_cast (type
, fromval
);
2527 read_memory (to_addr
, buffer
, len
);
2528 from_size
= value_bitsize (fromval
);
2530 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2531 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2532 move_bits (buffer
, value_bitpos (toval
),
2533 value_contents (fromval
), from_size
- bits
, bits
, 1);
2535 move_bits (buffer
, value_bitpos (toval
),
2536 value_contents (fromval
), 0, bits
, 0);
2537 write_memory (to_addr
, buffer
, len
);
2538 observer_notify_memory_changed (to_addr
, len
, buffer
);
2540 val
= value_copy (toval
);
2541 memcpy (value_contents_raw (val
), value_contents (fromval
),
2542 TYPE_LENGTH (type
));
2543 deprecated_set_value_type (val
, type
);
2548 return value_assign (toval
, fromval
);
2552 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2553 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2554 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2555 * COMPONENT, and not the inferior's memory. The current contents
2556 * of COMPONENT are ignored. */
2558 value_assign_to_component (struct value
*container
, struct value
*component
,
2561 LONGEST offset_in_container
=
2562 (LONGEST
) (value_address (component
) - value_address (container
));
2563 int bit_offset_in_container
=
2564 value_bitpos (component
) - value_bitpos (container
);
2567 val
= value_cast (value_type (component
), val
);
2569 if (value_bitsize (component
) == 0)
2570 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2572 bits
= value_bitsize (component
);
2574 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2575 move_bits (value_contents_writeable (container
) + offset_in_container
,
2576 value_bitpos (container
) + bit_offset_in_container
,
2577 value_contents (val
),
2578 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2581 move_bits (value_contents_writeable (container
) + offset_in_container
,
2582 value_bitpos (container
) + bit_offset_in_container
,
2583 value_contents (val
), 0, bits
, 0);
2586 /* The value of the element of array ARR at the ARITY indices given in IND.
2587 ARR may be either a simple array, GNAT array descriptor, or pointer
2591 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2595 struct type
*elt_type
;
2597 elt
= ada_coerce_to_simple_array (arr
);
2599 elt_type
= ada_check_typedef (value_type (elt
));
2600 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2601 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2602 return value_subscript_packed (elt
, arity
, ind
);
2604 for (k
= 0; k
< arity
; k
+= 1)
2606 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2607 error (_("too many subscripts (%d expected)"), k
);
2608 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2613 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2614 value of the element of *ARR at the ARITY indices given in
2615 IND. Does not read the entire array into memory. */
2617 static struct value
*
2618 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2623 for (k
= 0; k
< arity
; k
+= 1)
2627 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2628 error (_("too many subscripts (%d expected)"), k
);
2629 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2631 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2632 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2633 type
= TYPE_TARGET_TYPE (type
);
2636 return value_ind (arr
);
2639 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2640 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2641 elements starting at index LOW. The lower bound of this array is LOW, as
2643 static struct value
*
2644 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2647 struct type
*type0
= ada_check_typedef (type
);
2648 CORE_ADDR base
= value_as_address (array_ptr
)
2649 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2650 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2651 struct type
*index_type
=
2652 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2654 struct type
*slice_type
=
2655 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2657 return value_at_lazy (slice_type
, base
);
2661 static struct value
*
2662 ada_value_slice (struct value
*array
, int low
, int high
)
2664 struct type
*type
= ada_check_typedef (value_type (array
));
2665 struct type
*index_type
=
2666 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2667 struct type
*slice_type
=
2668 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2670 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2673 /* If type is a record type in the form of a standard GNAT array
2674 descriptor, returns the number of dimensions for type. If arr is a
2675 simple array, returns the number of "array of"s that prefix its
2676 type designation. Otherwise, returns 0. */
2679 ada_array_arity (struct type
*type
)
2686 type
= desc_base_type (type
);
2689 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2690 return desc_arity (desc_bounds_type (type
));
2692 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2695 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2701 /* If TYPE is a record type in the form of a standard GNAT array
2702 descriptor or a simple array type, returns the element type for
2703 TYPE after indexing by NINDICES indices, or by all indices if
2704 NINDICES is -1. Otherwise, returns NULL. */
2707 ada_array_element_type (struct type
*type
, int nindices
)
2709 type
= desc_base_type (type
);
2711 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2714 struct type
*p_array_type
;
2716 p_array_type
= desc_data_target_type (type
);
2718 k
= ada_array_arity (type
);
2722 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2723 if (nindices
>= 0 && k
> nindices
)
2725 while (k
> 0 && p_array_type
!= NULL
)
2727 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2730 return p_array_type
;
2732 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2734 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2736 type
= TYPE_TARGET_TYPE (type
);
2745 /* The type of nth index in arrays of given type (n numbering from 1).
2746 Does not examine memory. Throws an error if N is invalid or TYPE
2747 is not an array type. NAME is the name of the Ada attribute being
2748 evaluated ('range, 'first, 'last, or 'length); it is used in building
2749 the error message. */
2751 static struct type
*
2752 ada_index_type (struct type
*type
, int n
, const char *name
)
2754 struct type
*result_type
;
2756 type
= desc_base_type (type
);
2758 if (n
< 0 || n
> ada_array_arity (type
))
2759 error (_("invalid dimension number to '%s"), name
);
2761 if (ada_is_simple_array_type (type
))
2765 for (i
= 1; i
< n
; i
+= 1)
2766 type
= TYPE_TARGET_TYPE (type
);
2767 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2768 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2769 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2770 perhaps stabsread.c would make more sense. */
2771 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2776 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2777 if (result_type
== NULL
)
2778 error (_("attempt to take bound of something that is not an array"));
2784 /* Given that arr is an array type, returns the lower bound of the
2785 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2786 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2787 array-descriptor type. It works for other arrays with bounds supplied
2788 by run-time quantities other than discriminants. */
2791 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2793 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2796 gdb_assert (which
== 0 || which
== 1);
2798 if (ada_is_constrained_packed_array_type (arr_type
))
2799 arr_type
= decode_constrained_packed_array_type (arr_type
);
2801 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2802 return (LONGEST
) - which
;
2804 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2805 type
= TYPE_TARGET_TYPE (arr_type
);
2810 for (i
= n
; i
> 1; i
--)
2811 elt_type
= TYPE_TARGET_TYPE (type
);
2813 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2814 ada_fixup_array_indexes_type (index_type_desc
);
2815 if (index_type_desc
!= NULL
)
2816 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2819 index_type
= TYPE_INDEX_TYPE (elt_type
);
2822 (LONGEST
) (which
== 0
2823 ? ada_discrete_type_low_bound (index_type
)
2824 : ada_discrete_type_high_bound (index_type
));
2827 /* Given that arr is an array value, returns the lower bound of the
2828 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2829 WHICH is 1. This routine will also work for arrays with bounds
2830 supplied by run-time quantities other than discriminants. */
2833 ada_array_bound (struct value
*arr
, int n
, int which
)
2835 struct type
*arr_type
= value_type (arr
);
2837 if (ada_is_constrained_packed_array_type (arr_type
))
2838 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2839 else if (ada_is_simple_array_type (arr_type
))
2840 return ada_array_bound_from_type (arr_type
, n
, which
);
2842 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2845 /* Given that arr is an array value, returns the length of the
2846 nth index. This routine will also work for arrays with bounds
2847 supplied by run-time quantities other than discriminants.
2848 Does not work for arrays indexed by enumeration types with representation
2849 clauses at the moment. */
2852 ada_array_length (struct value
*arr
, int n
)
2854 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2856 if (ada_is_constrained_packed_array_type (arr_type
))
2857 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2859 if (ada_is_simple_array_type (arr_type
))
2860 return (ada_array_bound_from_type (arr_type
, n
, 1)
2861 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2863 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2864 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2867 /* An empty array whose type is that of ARR_TYPE (an array type),
2868 with bounds LOW to LOW-1. */
2870 static struct value
*
2871 empty_array (struct type
*arr_type
, int low
)
2873 struct type
*arr_type0
= ada_check_typedef (arr_type
);
2874 struct type
*index_type
=
2875 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)),
2877 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
2879 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2883 /* Name resolution */
2885 /* The "decoded" name for the user-definable Ada operator corresponding
2889 ada_decoded_op_name (enum exp_opcode op
)
2893 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2895 if (ada_opname_table
[i
].op
== op
)
2896 return ada_opname_table
[i
].decoded
;
2898 error (_("Could not find operator name for opcode"));
2902 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2903 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2904 undefined namespace) and converts operators that are
2905 user-defined into appropriate function calls. If CONTEXT_TYPE is
2906 non-null, it provides a preferred result type [at the moment, only
2907 type void has any effect---causing procedures to be preferred over
2908 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2909 return type is preferred. May change (expand) *EXP. */
2912 resolve (struct expression
**expp
, int void_context_p
)
2914 struct type
*context_type
= NULL
;
2918 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2920 resolve_subexp (expp
, &pc
, 1, context_type
);
2923 /* Resolve the operator of the subexpression beginning at
2924 position *POS of *EXPP. "Resolving" consists of replacing
2925 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2926 with their resolutions, replacing built-in operators with
2927 function calls to user-defined operators, where appropriate, and,
2928 when DEPROCEDURE_P is non-zero, converting function-valued variables
2929 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2930 are as in ada_resolve, above. */
2932 static struct value
*
2933 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2934 struct type
*context_type
)
2938 struct expression
*exp
; /* Convenience: == *expp. */
2939 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2940 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2941 int nargs
; /* Number of operands. */
2948 /* Pass one: resolve operands, saving their types and updating *pos,
2953 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2954 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2959 resolve_subexp (expp
, pos
, 0, NULL
);
2961 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2966 resolve_subexp (expp
, pos
, 0, NULL
);
2971 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2974 case OP_ATR_MODULUS
:
2984 case TERNOP_IN_RANGE
:
2985 case BINOP_IN_BOUNDS
:
2991 case OP_DISCRETE_RANGE
:
2993 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
3002 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
3004 resolve_subexp (expp
, pos
, 1, NULL
);
3006 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
3023 case BINOP_LOGICAL_AND
:
3024 case BINOP_LOGICAL_OR
:
3025 case BINOP_BITWISE_AND
:
3026 case BINOP_BITWISE_IOR
:
3027 case BINOP_BITWISE_XOR
:
3030 case BINOP_NOTEQUAL
:
3037 case BINOP_SUBSCRIPT
:
3045 case UNOP_LOGICAL_NOT
:
3061 case OP_INTERNALVAR
:
3071 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3074 case STRUCTOP_STRUCT
:
3075 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3088 error (_("Unexpected operator during name resolution"));
3091 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3092 for (i
= 0; i
< nargs
; i
+= 1)
3093 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3097 /* Pass two: perform any resolution on principal operator. */
3104 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3106 struct ada_symbol_info
*candidates
;
3110 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3111 (exp
->elts
[pc
+ 2].symbol
),
3112 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3115 if (n_candidates
> 1)
3117 /* Types tend to get re-introduced locally, so if there
3118 are any local symbols that are not types, first filter
3121 for (j
= 0; j
< n_candidates
; j
+= 1)
3122 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3127 case LOC_REGPARM_ADDR
:
3135 if (j
< n_candidates
)
3138 while (j
< n_candidates
)
3140 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3142 candidates
[j
] = candidates
[n_candidates
- 1];
3151 if (n_candidates
== 0)
3152 error (_("No definition found for %s"),
3153 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3154 else if (n_candidates
== 1)
3156 else if (deprocedure_p
3157 && !is_nonfunction (candidates
, n_candidates
))
3159 i
= ada_resolve_function
3160 (candidates
, n_candidates
, NULL
, 0,
3161 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3164 error (_("Could not find a match for %s"),
3165 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3169 printf_filtered (_("Multiple matches for %s\n"),
3170 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3171 user_select_syms (candidates
, n_candidates
, 1);
3175 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3176 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3177 if (innermost_block
== NULL
3178 || contained_in (candidates
[i
].block
, innermost_block
))
3179 innermost_block
= candidates
[i
].block
;
3183 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3186 replace_operator_with_call (expp
, pc
, 0, 0,
3187 exp
->elts
[pc
+ 2].symbol
,
3188 exp
->elts
[pc
+ 1].block
);
3195 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3196 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3198 struct ada_symbol_info
*candidates
;
3202 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3203 (exp
->elts
[pc
+ 5].symbol
),
3204 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3206 if (n_candidates
== 1)
3210 i
= ada_resolve_function
3211 (candidates
, n_candidates
,
3213 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3216 error (_("Could not find a match for %s"),
3217 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3220 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3221 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3222 if (innermost_block
== NULL
3223 || contained_in (candidates
[i
].block
, innermost_block
))
3224 innermost_block
= candidates
[i
].block
;
3235 case BINOP_BITWISE_AND
:
3236 case BINOP_BITWISE_IOR
:
3237 case BINOP_BITWISE_XOR
:
3239 case BINOP_NOTEQUAL
:
3247 case UNOP_LOGICAL_NOT
:
3249 if (possible_user_operator_p (op
, argvec
))
3251 struct ada_symbol_info
*candidates
;
3255 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3256 (struct block
*) NULL
, VAR_DOMAIN
,
3258 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3259 ada_decoded_op_name (op
), NULL
);
3263 replace_operator_with_call (expp
, pc
, nargs
, 1,
3264 candidates
[i
].sym
, candidates
[i
].block
);
3275 return evaluate_subexp_type (exp
, pos
);
3278 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3279 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3281 /* The term "match" here is rather loose. The match is heuristic and
3285 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3287 ftype
= ada_check_typedef (ftype
);
3288 atype
= ada_check_typedef (atype
);
3290 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3291 ftype
= TYPE_TARGET_TYPE (ftype
);
3292 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3293 atype
= TYPE_TARGET_TYPE (atype
);
3295 switch (TYPE_CODE (ftype
))
3298 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3300 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3301 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3302 TYPE_TARGET_TYPE (atype
), 0);
3305 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3307 case TYPE_CODE_ENUM
:
3308 case TYPE_CODE_RANGE
:
3309 switch (TYPE_CODE (atype
))
3312 case TYPE_CODE_ENUM
:
3313 case TYPE_CODE_RANGE
:
3319 case TYPE_CODE_ARRAY
:
3320 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3321 || ada_is_array_descriptor_type (atype
));
3323 case TYPE_CODE_STRUCT
:
3324 if (ada_is_array_descriptor_type (ftype
))
3325 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3326 || ada_is_array_descriptor_type (atype
));
3328 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3329 && !ada_is_array_descriptor_type (atype
));
3331 case TYPE_CODE_UNION
:
3333 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3337 /* Return non-zero if the formals of FUNC "sufficiently match" the
3338 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3339 may also be an enumeral, in which case it is treated as a 0-
3340 argument function. */
3343 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3346 struct type
*func_type
= SYMBOL_TYPE (func
);
3348 if (SYMBOL_CLASS (func
) == LOC_CONST
3349 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3350 return (n_actuals
== 0);
3351 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3354 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3357 for (i
= 0; i
< n_actuals
; i
+= 1)
3359 if (actuals
[i
] == NULL
)
3363 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3365 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3367 if (!ada_type_match (ftype
, atype
, 1))
3374 /* False iff function type FUNC_TYPE definitely does not produce a value
3375 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3376 FUNC_TYPE is not a valid function type with a non-null return type
3377 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3380 return_match (struct type
*func_type
, struct type
*context_type
)
3382 struct type
*return_type
;
3384 if (func_type
== NULL
)
3387 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3388 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3390 return_type
= get_base_type (func_type
);
3391 if (return_type
== NULL
)
3394 context_type
= get_base_type (context_type
);
3396 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3397 return context_type
== NULL
|| return_type
== context_type
;
3398 else if (context_type
== NULL
)
3399 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3401 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3405 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3406 function (if any) that matches the types of the NARGS arguments in
3407 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3408 that returns that type, then eliminate matches that don't. If
3409 CONTEXT_TYPE is void and there is at least one match that does not
3410 return void, eliminate all matches that do.
3412 Asks the user if there is more than one match remaining. Returns -1
3413 if there is no such symbol or none is selected. NAME is used
3414 solely for messages. May re-arrange and modify SYMS in
3415 the process; the index returned is for the modified vector. */
3418 ada_resolve_function (struct ada_symbol_info syms
[],
3419 int nsyms
, struct value
**args
, int nargs
,
3420 const char *name
, struct type
*context_type
)
3424 int m
; /* Number of hits */
3427 /* In the first pass of the loop, we only accept functions matching
3428 context_type. If none are found, we add a second pass of the loop
3429 where every function is accepted. */
3430 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3432 for (k
= 0; k
< nsyms
; k
+= 1)
3434 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3436 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3437 && (fallback
|| return_match (type
, context_type
)))
3449 printf_filtered (_("Multiple matches for %s\n"), name
);
3450 user_select_syms (syms
, m
, 1);
3456 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3457 in a listing of choices during disambiguation (see sort_choices, below).
3458 The idea is that overloadings of a subprogram name from the
3459 same package should sort in their source order. We settle for ordering
3460 such symbols by their trailing number (__N or $N). */
3463 encoded_ordered_before (const char *N0
, const char *N1
)
3467 else if (N0
== NULL
)
3473 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3475 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3477 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3478 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3483 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3486 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3488 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3489 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3491 return (strcmp (N0
, N1
) < 0);
3495 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3499 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3503 for (i
= 1; i
< nsyms
; i
+= 1)
3505 struct ada_symbol_info sym
= syms
[i
];
3508 for (j
= i
- 1; j
>= 0; j
-= 1)
3510 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3511 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3513 syms
[j
+ 1] = syms
[j
];
3519 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3520 by asking the user (if necessary), returning the number selected,
3521 and setting the first elements of SYMS items. Error if no symbols
3524 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3525 to be re-integrated one of these days. */
3528 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3531 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3533 int first_choice
= (max_results
== 1) ? 1 : 2;
3534 const char *select_mode
= multiple_symbols_select_mode ();
3536 if (max_results
< 1)
3537 error (_("Request to select 0 symbols!"));
3541 if (select_mode
== multiple_symbols_cancel
)
3543 canceled because the command is ambiguous\n\
3544 See set/show multiple-symbol."));
3546 /* If select_mode is "all", then return all possible symbols.
3547 Only do that if more than one symbol can be selected, of course.
3548 Otherwise, display the menu as usual. */
3549 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3552 printf_unfiltered (_("[0] cancel\n"));
3553 if (max_results
> 1)
3554 printf_unfiltered (_("[1] all\n"));
3556 sort_choices (syms
, nsyms
);
3558 for (i
= 0; i
< nsyms
; i
+= 1)
3560 if (syms
[i
].sym
== NULL
)
3563 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3565 struct symtab_and_line sal
=
3566 find_function_start_sal (syms
[i
].sym
, 1);
3568 if (sal
.symtab
== NULL
)
3569 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3571 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3574 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3575 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3576 sal
.symtab
->filename
, sal
.line
);
3582 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3583 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3584 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3585 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3587 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3588 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3590 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3591 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3592 else if (is_enumeral
3593 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3595 printf_unfiltered (("[%d] "), i
+ first_choice
);
3596 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3598 printf_unfiltered (_("'(%s) (enumeral)\n"),
3599 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3601 else if (symtab
!= NULL
)
3602 printf_unfiltered (is_enumeral
3603 ? _("[%d] %s in %s (enumeral)\n")
3604 : _("[%d] %s at %s:?\n"),
3606 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3609 printf_unfiltered (is_enumeral
3610 ? _("[%d] %s (enumeral)\n")
3611 : _("[%d] %s at ?\n"),
3613 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3617 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3620 for (i
= 0; i
< n_chosen
; i
+= 1)
3621 syms
[i
] = syms
[chosen
[i
]];
3626 /* Read and validate a set of numeric choices from the user in the
3627 range 0 .. N_CHOICES-1. Place the results in increasing
3628 order in CHOICES[0 .. N-1], and return N.
3630 The user types choices as a sequence of numbers on one line
3631 separated by blanks, encoding them as follows:
3633 + A choice of 0 means to cancel the selection, throwing an error.
3634 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3635 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3637 The user is not allowed to choose more than MAX_RESULTS values.
3639 ANNOTATION_SUFFIX, if present, is used to annotate the input
3640 prompts (for use with the -f switch). */
3643 get_selections (int *choices
, int n_choices
, int max_results
,
3644 int is_all_choice
, char *annotation_suffix
)
3649 int first_choice
= is_all_choice
? 2 : 1;
3651 prompt
= getenv ("PS2");
3655 args
= command_line_input (prompt
, 0, annotation_suffix
);
3658 error_no_arg (_("one or more choice numbers"));
3662 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3663 order, as given in args. Choices are validated. */
3669 args
= skip_spaces (args
);
3670 if (*args
== '\0' && n_chosen
== 0)
3671 error_no_arg (_("one or more choice numbers"));
3672 else if (*args
== '\0')
3675 choice
= strtol (args
, &args2
, 10);
3676 if (args
== args2
|| choice
< 0
3677 || choice
> n_choices
+ first_choice
- 1)
3678 error (_("Argument must be choice number"));
3682 error (_("cancelled"));
3684 if (choice
< first_choice
)
3686 n_chosen
= n_choices
;
3687 for (j
= 0; j
< n_choices
; j
+= 1)
3691 choice
-= first_choice
;
3693 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3697 if (j
< 0 || choice
!= choices
[j
])
3701 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3702 choices
[k
+ 1] = choices
[k
];
3703 choices
[j
+ 1] = choice
;
3708 if (n_chosen
> max_results
)
3709 error (_("Select no more than %d of the above"), max_results
);
3714 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3715 on the function identified by SYM and BLOCK, and taking NARGS
3716 arguments. Update *EXPP as needed to hold more space. */
3719 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3720 int oplen
, struct symbol
*sym
,
3721 struct block
*block
)
3723 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3724 symbol, -oplen for operator being replaced). */
3725 struct expression
*newexp
= (struct expression
*)
3726 xzalloc (sizeof (struct expression
)
3727 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3728 struct expression
*exp
= *expp
;
3730 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3731 newexp
->language_defn
= exp
->language_defn
;
3732 newexp
->gdbarch
= exp
->gdbarch
;
3733 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3734 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3735 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3737 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3738 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3740 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3741 newexp
->elts
[pc
+ 4].block
= block
;
3742 newexp
->elts
[pc
+ 5].symbol
= sym
;
3748 /* Type-class predicates */
3750 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3754 numeric_type_p (struct type
*type
)
3760 switch (TYPE_CODE (type
))
3765 case TYPE_CODE_RANGE
:
3766 return (type
== TYPE_TARGET_TYPE (type
)
3767 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3774 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3777 integer_type_p (struct type
*type
)
3783 switch (TYPE_CODE (type
))
3787 case TYPE_CODE_RANGE
:
3788 return (type
== TYPE_TARGET_TYPE (type
)
3789 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3796 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3799 scalar_type_p (struct type
*type
)
3805 switch (TYPE_CODE (type
))
3808 case TYPE_CODE_RANGE
:
3809 case TYPE_CODE_ENUM
:
3818 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3821 discrete_type_p (struct type
*type
)
3827 switch (TYPE_CODE (type
))
3830 case TYPE_CODE_RANGE
:
3831 case TYPE_CODE_ENUM
:
3832 case TYPE_CODE_BOOL
:
3840 /* Returns non-zero if OP with operands in the vector ARGS could be
3841 a user-defined function. Errs on the side of pre-defined operators
3842 (i.e., result 0). */
3845 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3847 struct type
*type0
=
3848 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3849 struct type
*type1
=
3850 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3864 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3868 case BINOP_BITWISE_AND
:
3869 case BINOP_BITWISE_IOR
:
3870 case BINOP_BITWISE_XOR
:
3871 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3874 case BINOP_NOTEQUAL
:
3879 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3882 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3885 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3889 case UNOP_LOGICAL_NOT
:
3891 return (!numeric_type_p (type0
));
3900 1. In the following, we assume that a renaming type's name may
3901 have an ___XD suffix. It would be nice if this went away at some
3903 2. We handle both the (old) purely type-based representation of
3904 renamings and the (new) variable-based encoding. At some point,
3905 it is devoutly to be hoped that the former goes away
3906 (FIXME: hilfinger-2007-07-09).
3907 3. Subprogram renamings are not implemented, although the XRS
3908 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3910 /* If SYM encodes a renaming,
3912 <renaming> renames <renamed entity>,
3914 sets *LEN to the length of the renamed entity's name,
3915 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3916 the string describing the subcomponent selected from the renamed
3917 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3918 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3919 are undefined). Otherwise, returns a value indicating the category
3920 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3921 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3922 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3923 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3924 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3925 may be NULL, in which case they are not assigned.
3927 [Currently, however, GCC does not generate subprogram renamings.] */
3929 enum ada_renaming_category
3930 ada_parse_renaming (struct symbol
*sym
,
3931 const char **renamed_entity
, int *len
,
3932 const char **renaming_expr
)
3934 enum ada_renaming_category kind
;
3939 return ADA_NOT_RENAMING
;
3940 switch (SYMBOL_CLASS (sym
))
3943 return ADA_NOT_RENAMING
;
3945 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3946 renamed_entity
, len
, renaming_expr
);
3950 case LOC_OPTIMIZED_OUT
:
3951 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3953 return ADA_NOT_RENAMING
;
3957 kind
= ADA_OBJECT_RENAMING
;
3961 kind
= ADA_EXCEPTION_RENAMING
;
3965 kind
= ADA_PACKAGE_RENAMING
;
3969 kind
= ADA_SUBPROGRAM_RENAMING
;
3973 return ADA_NOT_RENAMING
;
3977 if (renamed_entity
!= NULL
)
3978 *renamed_entity
= info
;
3979 suffix
= strstr (info
, "___XE");
3980 if (suffix
== NULL
|| suffix
== info
)
3981 return ADA_NOT_RENAMING
;
3983 *len
= strlen (info
) - strlen (suffix
);
3985 if (renaming_expr
!= NULL
)
3986 *renaming_expr
= suffix
;
3990 /* Assuming TYPE encodes a renaming according to the old encoding in
3991 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3992 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3993 ADA_NOT_RENAMING otherwise. */
3994 static enum ada_renaming_category
3995 parse_old_style_renaming (struct type
*type
,
3996 const char **renamed_entity
, int *len
,
3997 const char **renaming_expr
)
3999 enum ada_renaming_category kind
;
4004 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
4005 || TYPE_NFIELDS (type
) != 1)
4006 return ADA_NOT_RENAMING
;
4008 name
= type_name_no_tag (type
);
4010 return ADA_NOT_RENAMING
;
4012 name
= strstr (name
, "___XR");
4014 return ADA_NOT_RENAMING
;
4019 kind
= ADA_OBJECT_RENAMING
;
4022 kind
= ADA_EXCEPTION_RENAMING
;
4025 kind
= ADA_PACKAGE_RENAMING
;
4028 kind
= ADA_SUBPROGRAM_RENAMING
;
4031 return ADA_NOT_RENAMING
;
4034 info
= TYPE_FIELD_NAME (type
, 0);
4036 return ADA_NOT_RENAMING
;
4037 if (renamed_entity
!= NULL
)
4038 *renamed_entity
= info
;
4039 suffix
= strstr (info
, "___XE");
4040 if (renaming_expr
!= NULL
)
4041 *renaming_expr
= suffix
+ 5;
4042 if (suffix
== NULL
|| suffix
== info
)
4043 return ADA_NOT_RENAMING
;
4045 *len
= suffix
- info
;
4049 /* Compute the value of the given RENAMING_SYM, which is expected to
4050 be a symbol encoding a renaming expression. BLOCK is the block
4051 used to evaluate the renaming. */
4053 static struct value
*
4054 ada_read_renaming_var_value (struct symbol
*renaming_sym
,
4055 struct block
*block
)
4058 struct expression
*expr
;
4059 struct value
*value
;
4060 struct cleanup
*old_chain
= NULL
;
4062 sym_name
= xstrdup (SYMBOL_LINKAGE_NAME (renaming_sym
));
4063 old_chain
= make_cleanup (xfree
, sym_name
);
4064 expr
= parse_exp_1 (&sym_name
, block
, 0);
4065 make_cleanup (free_current_contents
, &expr
);
4066 value
= evaluate_expression (expr
);
4068 do_cleanups (old_chain
);
4073 /* Evaluation: Function Calls */
4075 /* Return an lvalue containing the value VAL. This is the identity on
4076 lvalues, and otherwise has the side-effect of allocating memory
4077 in the inferior where a copy of the value contents is copied. */
4079 static struct value
*
4080 ensure_lval (struct value
*val
)
4082 if (VALUE_LVAL (val
) == not_lval
4083 || VALUE_LVAL (val
) == lval_internalvar
)
4085 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4086 const CORE_ADDR addr
=
4087 value_as_long (value_allocate_space_in_inferior (len
));
4089 set_value_address (val
, addr
);
4090 VALUE_LVAL (val
) = lval_memory
;
4091 write_memory (addr
, value_contents (val
), len
);
4097 /* Return the value ACTUAL, converted to be an appropriate value for a
4098 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4099 allocating any necessary descriptors (fat pointers), or copies of
4100 values not residing in memory, updating it as needed. */
4103 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4105 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4106 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4107 struct type
*formal_target
=
4108 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4109 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4110 struct type
*actual_target
=
4111 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4112 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4114 if (ada_is_array_descriptor_type (formal_target
)
4115 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4116 return make_array_descriptor (formal_type
, actual
);
4117 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4118 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4120 struct value
*result
;
4122 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4123 && ada_is_array_descriptor_type (actual_target
))
4124 result
= desc_data (actual
);
4125 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4127 if (VALUE_LVAL (actual
) != lval_memory
)
4131 actual_type
= ada_check_typedef (value_type (actual
));
4132 val
= allocate_value (actual_type
);
4133 memcpy ((char *) value_contents_raw (val
),
4134 (char *) value_contents (actual
),
4135 TYPE_LENGTH (actual_type
));
4136 actual
= ensure_lval (val
);
4138 result
= value_addr (actual
);
4142 return value_cast_pointers (formal_type
, result
);
4144 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4145 return ada_value_ind (actual
);
4150 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4151 type TYPE. This is usually an inefficient no-op except on some targets
4152 (such as AVR) where the representation of a pointer and an address
4156 value_pointer (struct value
*value
, struct type
*type
)
4158 struct gdbarch
*gdbarch
= get_type_arch (type
);
4159 unsigned len
= TYPE_LENGTH (type
);
4160 gdb_byte
*buf
= alloca (len
);
4163 addr
= value_address (value
);
4164 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4165 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4170 /* Push a descriptor of type TYPE for array value ARR on the stack at
4171 *SP, updating *SP to reflect the new descriptor. Return either
4172 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4173 to-descriptor type rather than a descriptor type), a struct value *
4174 representing a pointer to this descriptor. */
4176 static struct value
*
4177 make_array_descriptor (struct type
*type
, struct value
*arr
)
4179 struct type
*bounds_type
= desc_bounds_type (type
);
4180 struct type
*desc_type
= desc_base_type (type
);
4181 struct value
*descriptor
= allocate_value (desc_type
);
4182 struct value
*bounds
= allocate_value (bounds_type
);
4185 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4188 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4189 ada_array_bound (arr
, i
, 0),
4190 desc_bound_bitpos (bounds_type
, i
, 0),
4191 desc_bound_bitsize (bounds_type
, i
, 0));
4192 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4193 ada_array_bound (arr
, i
, 1),
4194 desc_bound_bitpos (bounds_type
, i
, 1),
4195 desc_bound_bitsize (bounds_type
, i
, 1));
4198 bounds
= ensure_lval (bounds
);
4200 modify_field (value_type (descriptor
),
4201 value_contents_writeable (descriptor
),
4202 value_pointer (ensure_lval (arr
),
4203 TYPE_FIELD_TYPE (desc_type
, 0)),
4204 fat_pntr_data_bitpos (desc_type
),
4205 fat_pntr_data_bitsize (desc_type
));
4207 modify_field (value_type (descriptor
),
4208 value_contents_writeable (descriptor
),
4209 value_pointer (bounds
,
4210 TYPE_FIELD_TYPE (desc_type
, 1)),
4211 fat_pntr_bounds_bitpos (desc_type
),
4212 fat_pntr_bounds_bitsize (desc_type
));
4214 descriptor
= ensure_lval (descriptor
);
4216 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4217 return value_addr (descriptor
);
4222 /* Dummy definitions for an experimental caching module that is not
4223 * used in the public sources. */
4226 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4227 struct symbol
**sym
, struct block
**block
)
4233 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4234 struct block
*block
)
4240 /* Return nonzero if wild matching should be used when searching for
4241 all symbols matching LOOKUP_NAME.
4243 LOOKUP_NAME is expected to be a symbol name after transformation
4244 for Ada lookups (see ada_name_for_lookup). */
4247 should_use_wild_match (const char *lookup_name
)
4249 return (strstr (lookup_name
, "__") == NULL
);
4252 /* Return the result of a standard (literal, C-like) lookup of NAME in
4253 given DOMAIN, visible from lexical block BLOCK. */
4255 static struct symbol
*
4256 standard_lookup (const char *name
, const struct block
*block
,
4261 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4263 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4264 cache_symbol (name
, domain
, sym
, block_found
);
4269 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4270 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4271 since they contend in overloading in the same way. */
4273 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4277 for (i
= 0; i
< n
; i
+= 1)
4278 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4279 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4280 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4286 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4287 struct types. Otherwise, they may not. */
4290 equiv_types (struct type
*type0
, struct type
*type1
)
4294 if (type0
== NULL
|| type1
== NULL
4295 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4297 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4298 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4299 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4300 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4306 /* True iff SYM0 represents the same entity as SYM1, or one that is
4307 no more defined than that of SYM1. */
4310 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4314 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4315 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4318 switch (SYMBOL_CLASS (sym0
))
4324 struct type
*type0
= SYMBOL_TYPE (sym0
);
4325 struct type
*type1
= SYMBOL_TYPE (sym1
);
4326 const char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4327 const char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4328 int len0
= strlen (name0
);
4331 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4332 && (equiv_types (type0
, type1
)
4333 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4334 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4337 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4338 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4344 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4345 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4348 add_defn_to_vec (struct obstack
*obstackp
,
4350 struct block
*block
)
4353 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4355 /* Do not try to complete stub types, as the debugger is probably
4356 already scanning all symbols matching a certain name at the
4357 time when this function is called. Trying to replace the stub
4358 type by its associated full type will cause us to restart a scan
4359 which may lead to an infinite recursion. Instead, the client
4360 collecting the matching symbols will end up collecting several
4361 matches, with at least one of them complete. It can then filter
4362 out the stub ones if needed. */
4364 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4366 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4368 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4370 prevDefns
[i
].sym
= sym
;
4371 prevDefns
[i
].block
= block
;
4377 struct ada_symbol_info info
;
4381 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4385 /* Number of ada_symbol_info structures currently collected in
4386 current vector in *OBSTACKP. */
4389 num_defns_collected (struct obstack
*obstackp
)
4391 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4394 /* Vector of ada_symbol_info structures currently collected in current
4395 vector in *OBSTACKP. If FINISH, close off the vector and return
4396 its final address. */
4398 static struct ada_symbol_info
*
4399 defns_collected (struct obstack
*obstackp
, int finish
)
4402 return obstack_finish (obstackp
);
4404 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4407 /* Return a minimal symbol matching NAME according to Ada decoding
4408 rules. Returns NULL if there is no such minimal symbol. Names
4409 prefixed with "standard__" are handled specially: "standard__" is
4410 first stripped off, and only static and global symbols are searched. */
4412 struct minimal_symbol
*
4413 ada_lookup_simple_minsym (const char *name
)
4415 struct objfile
*objfile
;
4416 struct minimal_symbol
*msymbol
;
4417 const int wild_match_p
= should_use_wild_match (name
);
4419 /* Special case: If the user specifies a symbol name inside package
4420 Standard, do a non-wild matching of the symbol name without
4421 the "standard__" prefix. This was primarily introduced in order
4422 to allow the user to specifically access the standard exceptions
4423 using, for instance, Standard.Constraint_Error when Constraint_Error
4424 is ambiguous (due to the user defining its own Constraint_Error
4425 entity inside its program). */
4426 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4427 name
+= sizeof ("standard__") - 1;
4429 ALL_MSYMBOLS (objfile
, msymbol
)
4431 if (match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match_p
)
4432 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4439 /* For all subprograms that statically enclose the subprogram of the
4440 selected frame, add symbols matching identifier NAME in DOMAIN
4441 and their blocks to the list of data in OBSTACKP, as for
4442 ada_add_block_symbols (q.v.). If WILD_MATCH_P, treat as NAME
4443 with a wildcard prefix. */
4446 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4447 const char *name
, domain_enum
namespace,
4452 /* True if TYPE is definitely an artificial type supplied to a symbol
4453 for which no debugging information was given in the symbol file. */
4456 is_nondebugging_type (struct type
*type
)
4458 const char *name
= ada_type_name (type
);
4460 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4463 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4464 that are deemed "identical" for practical purposes.
4466 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4467 types and that their number of enumerals is identical (in other
4468 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4471 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4475 /* The heuristic we use here is fairly conservative. We consider
4476 that 2 enumerate types are identical if they have the same
4477 number of enumerals and that all enumerals have the same
4478 underlying value and name. */
4480 /* All enums in the type should have an identical underlying value. */
4481 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4482 if (TYPE_FIELD_ENUMVAL (type1
, i
) != TYPE_FIELD_ENUMVAL (type2
, i
))
4485 /* All enumerals should also have the same name (modulo any numerical
4487 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4489 const char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4490 const char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4491 int len_1
= strlen (name_1
);
4492 int len_2
= strlen (name_2
);
4494 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4495 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4497 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4498 TYPE_FIELD_NAME (type2
, i
),
4506 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4507 that are deemed "identical" for practical purposes. Sometimes,
4508 enumerals are not strictly identical, but their types are so similar
4509 that they can be considered identical.
4511 For instance, consider the following code:
4513 type Color is (Black, Red, Green, Blue, White);
4514 type RGB_Color is new Color range Red .. Blue;
4516 Type RGB_Color is a subrange of an implicit type which is a copy
4517 of type Color. If we call that implicit type RGB_ColorB ("B" is
4518 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4519 As a result, when an expression references any of the enumeral
4520 by name (Eg. "print green"), the expression is technically
4521 ambiguous and the user should be asked to disambiguate. But
4522 doing so would only hinder the user, since it wouldn't matter
4523 what choice he makes, the outcome would always be the same.
4524 So, for practical purposes, we consider them as the same. */
4527 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4531 /* Before performing a thorough comparison check of each type,
4532 we perform a series of inexpensive checks. We expect that these
4533 checks will quickly fail in the vast majority of cases, and thus
4534 help prevent the unnecessary use of a more expensive comparison.
4535 Said comparison also expects us to make some of these checks
4536 (see ada_identical_enum_types_p). */
4538 /* Quick check: All symbols should have an enum type. */
4539 for (i
= 0; i
< nsyms
; i
++)
4540 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4543 /* Quick check: They should all have the same value. */
4544 for (i
= 1; i
< nsyms
; i
++)
4545 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4548 /* Quick check: They should all have the same number of enumerals. */
4549 for (i
= 1; i
< nsyms
; i
++)
4550 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4551 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4554 /* All the sanity checks passed, so we might have a set of
4555 identical enumeration types. Perform a more complete
4556 comparison of the type of each symbol. */
4557 for (i
= 1; i
< nsyms
; i
++)
4558 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4559 SYMBOL_TYPE (syms
[0].sym
)))
4565 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4566 duplicate other symbols in the list (The only case I know of where
4567 this happens is when object files containing stabs-in-ecoff are
4568 linked with files containing ordinary ecoff debugging symbols (or no
4569 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4570 Returns the number of items in the modified list. */
4573 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4577 /* We should never be called with less than 2 symbols, as there
4578 cannot be any extra symbol in that case. But it's easy to
4579 handle, since we have nothing to do in that case. */
4588 /* If two symbols have the same name and one of them is a stub type,
4589 the get rid of the stub. */
4591 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4592 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4594 for (j
= 0; j
< nsyms
; j
++)
4597 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4598 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4599 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4600 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4605 /* Two symbols with the same name, same class and same address
4606 should be identical. */
4608 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4609 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4610 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4612 for (j
= 0; j
< nsyms
; j
+= 1)
4615 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4616 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4617 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4618 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4619 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4620 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4627 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4628 syms
[j
- 1] = syms
[j
];
4635 /* If all the remaining symbols are identical enumerals, then
4636 just keep the first one and discard the rest.
4638 Unlike what we did previously, we do not discard any entry
4639 unless they are ALL identical. This is because the symbol
4640 comparison is not a strict comparison, but rather a practical
4641 comparison. If all symbols are considered identical, then
4642 we can just go ahead and use the first one and discard the rest.
4643 But if we cannot reduce the list to a single element, we have
4644 to ask the user to disambiguate anyways. And if we have to
4645 present a multiple-choice menu, it's less confusing if the list
4646 isn't missing some choices that were identical and yet distinct. */
4647 if (symbols_are_identical_enums (syms
, nsyms
))
4653 /* Given a type that corresponds to a renaming entity, use the type name
4654 to extract the scope (package name or function name, fully qualified,
4655 and following the GNAT encoding convention) where this renaming has been
4656 defined. The string returned needs to be deallocated after use. */
4659 xget_renaming_scope (struct type
*renaming_type
)
4661 /* The renaming types adhere to the following convention:
4662 <scope>__<rename>___<XR extension>.
4663 So, to extract the scope, we search for the "___XR" extension,
4664 and then backtrack until we find the first "__". */
4666 const char *name
= type_name_no_tag (renaming_type
);
4667 char *suffix
= strstr (name
, "___XR");
4672 /* Now, backtrack a bit until we find the first "__". Start looking
4673 at suffix - 3, as the <rename> part is at least one character long. */
4675 for (last
= suffix
- 3; last
> name
; last
--)
4676 if (last
[0] == '_' && last
[1] == '_')
4679 /* Make a copy of scope and return it. */
4681 scope_len
= last
- name
;
4682 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4684 strncpy (scope
, name
, scope_len
);
4685 scope
[scope_len
] = '\0';
4690 /* Return nonzero if NAME corresponds to a package name. */
4693 is_package_name (const char *name
)
4695 /* Here, We take advantage of the fact that no symbols are generated
4696 for packages, while symbols are generated for each function.
4697 So the condition for NAME represent a package becomes equivalent
4698 to NAME not existing in our list of symbols. There is only one
4699 small complication with library-level functions (see below). */
4703 /* If it is a function that has not been defined at library level,
4704 then we should be able to look it up in the symbols. */
4705 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4708 /* Library-level function names start with "_ada_". See if function
4709 "_ada_" followed by NAME can be found. */
4711 /* Do a quick check that NAME does not contain "__", since library-level
4712 functions names cannot contain "__" in them. */
4713 if (strstr (name
, "__") != NULL
)
4716 fun_name
= xstrprintf ("_ada_%s", name
);
4718 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4721 /* Return nonzero if SYM corresponds to a renaming entity that is
4722 not visible from FUNCTION_NAME. */
4725 old_renaming_is_invisible (const struct symbol
*sym
, const char *function_name
)
4729 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4732 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4734 make_cleanup (xfree
, scope
);
4736 /* If the rename has been defined in a package, then it is visible. */
4737 if (is_package_name (scope
))
4740 /* Check that the rename is in the current function scope by checking
4741 that its name starts with SCOPE. */
4743 /* If the function name starts with "_ada_", it means that it is
4744 a library-level function. Strip this prefix before doing the
4745 comparison, as the encoding for the renaming does not contain
4747 if (strncmp (function_name
, "_ada_", 5) == 0)
4750 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4753 /* Remove entries from SYMS that corresponds to a renaming entity that
4754 is not visible from the function associated with CURRENT_BLOCK or
4755 that is superfluous due to the presence of more specific renaming
4756 information. Places surviving symbols in the initial entries of
4757 SYMS and returns the number of surviving symbols.
4760 First, in cases where an object renaming is implemented as a
4761 reference variable, GNAT may produce both the actual reference
4762 variable and the renaming encoding. In this case, we discard the
4765 Second, GNAT emits a type following a specified encoding for each renaming
4766 entity. Unfortunately, STABS currently does not support the definition
4767 of types that are local to a given lexical block, so all renamings types
4768 are emitted at library level. As a consequence, if an application
4769 contains two renaming entities using the same name, and a user tries to
4770 print the value of one of these entities, the result of the ada symbol
4771 lookup will also contain the wrong renaming type.
4773 This function partially covers for this limitation by attempting to
4774 remove from the SYMS list renaming symbols that should be visible
4775 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4776 method with the current information available. The implementation
4777 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4779 - When the user tries to print a rename in a function while there
4780 is another rename entity defined in a package: Normally, the
4781 rename in the function has precedence over the rename in the
4782 package, so the latter should be removed from the list. This is
4783 currently not the case.
4785 - This function will incorrectly remove valid renames if
4786 the CURRENT_BLOCK corresponds to a function which symbol name
4787 has been changed by an "Export" pragma. As a consequence,
4788 the user will be unable to print such rename entities. */
4791 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4792 int nsyms
, const struct block
*current_block
)
4794 struct symbol
*current_function
;
4795 const char *current_function_name
;
4797 int is_new_style_renaming
;
4799 /* If there is both a renaming foo___XR... encoded as a variable and
4800 a simple variable foo in the same block, discard the latter.
4801 First, zero out such symbols, then compress. */
4802 is_new_style_renaming
= 0;
4803 for (i
= 0; i
< nsyms
; i
+= 1)
4805 struct symbol
*sym
= syms
[i
].sym
;
4806 struct block
*block
= syms
[i
].block
;
4810 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4812 name
= SYMBOL_LINKAGE_NAME (sym
);
4813 suffix
= strstr (name
, "___XR");
4817 int name_len
= suffix
- name
;
4820 is_new_style_renaming
= 1;
4821 for (j
= 0; j
< nsyms
; j
+= 1)
4822 if (i
!= j
&& syms
[j
].sym
!= NULL
4823 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4825 && block
== syms
[j
].block
)
4829 if (is_new_style_renaming
)
4833 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4834 if (syms
[j
].sym
!= NULL
)
4842 /* Extract the function name associated to CURRENT_BLOCK.
4843 Abort if unable to do so. */
4845 if (current_block
== NULL
)
4848 current_function
= block_linkage_function (current_block
);
4849 if (current_function
== NULL
)
4852 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4853 if (current_function_name
== NULL
)
4856 /* Check each of the symbols, and remove it from the list if it is
4857 a type corresponding to a renaming that is out of the scope of
4858 the current block. */
4863 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4864 == ADA_OBJECT_RENAMING
4865 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4869 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4870 syms
[j
- 1] = syms
[j
];
4880 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4881 whose name and domain match NAME and DOMAIN respectively.
4882 If no match was found, then extend the search to "enclosing"
4883 routines (in other words, if we're inside a nested function,
4884 search the symbols defined inside the enclosing functions).
4885 If WILD_MATCH_P is nonzero, perform the naming matching in
4886 "wild" mode (see function "wild_match" for more info).
4888 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4891 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4892 struct block
*block
, domain_enum domain
,
4895 int block_depth
= 0;
4897 while (block
!= NULL
)
4900 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
,
4903 /* If we found a non-function match, assume that's the one. */
4904 if (is_nonfunction (defns_collected (obstackp
, 0),
4905 num_defns_collected (obstackp
)))
4908 block
= BLOCK_SUPERBLOCK (block
);
4911 /* If no luck so far, try to find NAME as a local symbol in some lexically
4912 enclosing subprogram. */
4913 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4914 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match_p
);
4917 /* An object of this type is used as the user_data argument when
4918 calling the map_matching_symbols method. */
4922 struct objfile
*objfile
;
4923 struct obstack
*obstackp
;
4924 struct symbol
*arg_sym
;
4928 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4929 to a list of symbols. DATA0 is a pointer to a struct match_data *
4930 containing the obstack that collects the symbol list, the file that SYM
4931 must come from, a flag indicating whether a non-argument symbol has
4932 been found in the current block, and the last argument symbol
4933 passed in SYM within the current block (if any). When SYM is null,
4934 marking the end of a block, the argument symbol is added if no
4935 other has been found. */
4938 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
4940 struct match_data
*data
= (struct match_data
*) data0
;
4944 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
4945 add_defn_to_vec (data
->obstackp
,
4946 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
4948 data
->found_sym
= 0;
4949 data
->arg_sym
= NULL
;
4953 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4955 else if (SYMBOL_IS_ARGUMENT (sym
))
4956 data
->arg_sym
= sym
;
4959 data
->found_sym
= 1;
4960 add_defn_to_vec (data
->obstackp
,
4961 fixup_symbol_section (sym
, data
->objfile
),
4968 /* Compare STRING1 to STRING2, with results as for strcmp.
4969 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4970 implies compare_names (STRING1, STRING2) (they may differ as to
4971 what symbols compare equal). */
4974 compare_names (const char *string1
, const char *string2
)
4976 while (*string1
!= '\0' && *string2
!= '\0')
4978 if (isspace (*string1
) || isspace (*string2
))
4979 return strcmp_iw_ordered (string1
, string2
);
4980 if (*string1
!= *string2
)
4988 return strcmp_iw_ordered (string1
, string2
);
4990 if (*string2
== '\0')
4992 if (is_name_suffix (string1
))
4999 if (*string2
== '(')
5000 return strcmp_iw_ordered (string1
, string2
);
5002 return *string1
- *string2
;
5006 /* Add to OBSTACKP all non-local symbols whose name and domain match
5007 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5008 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5011 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5012 domain_enum domain
, int global
,
5015 struct objfile
*objfile
;
5016 struct match_data data
;
5018 memset (&data
, 0, sizeof data
);
5019 data
.obstackp
= obstackp
;
5021 ALL_OBJFILES (objfile
)
5023 data
.objfile
= objfile
;
5026 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
5027 aux_add_nonlocal_symbols
, &data
,
5030 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
5031 aux_add_nonlocal_symbols
, &data
,
5032 full_match
, compare_names
);
5035 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5037 ALL_OBJFILES (objfile
)
5039 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5040 strcpy (name1
, "_ada_");
5041 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5042 data
.objfile
= objfile
;
5043 objfile
->sf
->qf
->map_matching_symbols (name1
, domain
,
5045 aux_add_nonlocal_symbols
,
5047 full_match
, compare_names
);
5052 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
5053 scope and in global scopes, returning the number of matches.
5054 Sets *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5055 indicating the symbols found and the blocks and symbol tables (if
5056 any) in which they were found. This vector are transient---good only to
5057 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
5058 symbol match within the nest of blocks whose innermost member is BLOCK0,
5059 is the one match returned (no other matches in that or
5060 enclosing blocks is returned). If there are any matches in or
5061 surrounding BLOCK0, then these alone are returned. Otherwise, if
5062 FULL_SEARCH is non-zero, then the search extends to global and
5063 file-scope (static) symbol tables.
5064 Names prefixed with "standard__" are handled specially: "standard__"
5065 is first stripped off, and only static and global symbols are searched. */
5068 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5069 domain_enum
namespace,
5070 struct ada_symbol_info
**results
,
5074 struct block
*block
;
5076 const int wild_match_p
= should_use_wild_match (name0
);
5080 obstack_free (&symbol_list_obstack
, NULL
);
5081 obstack_init (&symbol_list_obstack
);
5085 /* Search specified block and its superiors. */
5088 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
5089 needed, but adding const will
5090 have a cascade effect. */
5092 /* Special case: If the user specifies a symbol name inside package
5093 Standard, do a non-wild matching of the symbol name without
5094 the "standard__" prefix. This was primarily introduced in order
5095 to allow the user to specifically access the standard exceptions
5096 using, for instance, Standard.Constraint_Error when Constraint_Error
5097 is ambiguous (due to the user defining its own Constraint_Error
5098 entity inside its program). */
5099 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5102 name
= name0
+ sizeof ("standard__") - 1;
5105 /* Check the non-global symbols. If we have ANY match, then we're done. */
5107 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
5109 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5112 /* No non-global symbols found. Check our cache to see if we have
5113 already performed this search before. If we have, then return
5117 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5120 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5124 /* Search symbols from all global blocks. */
5126 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5129 /* Now add symbols from all per-file blocks if we've gotten no hits
5130 (not strictly correct, but perhaps better than an error). */
5132 if (num_defns_collected (&symbol_list_obstack
) == 0)
5133 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5137 ndefns
= num_defns_collected (&symbol_list_obstack
);
5138 *results
= defns_collected (&symbol_list_obstack
, 1);
5140 ndefns
= remove_extra_symbols (*results
, ndefns
);
5142 if (ndefns
== 0 && full_search
)
5143 cache_symbol (name0
, namespace, NULL
, NULL
);
5145 if (ndefns
== 1 && full_search
&& cacheIfUnique
)
5146 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5148 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5153 /* If NAME is the name of an entity, return a string that should
5154 be used to look that entity up in Ada units. This string should
5155 be deallocated after use using xfree.
5157 NAME can have any form that the "break" or "print" commands might
5158 recognize. In other words, it does not have to be the "natural"
5159 name, or the "encoded" name. */
5162 ada_name_for_lookup (const char *name
)
5165 int nlen
= strlen (name
);
5167 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5169 canon
= xmalloc (nlen
- 1);
5170 memcpy (canon
, name
+ 1, nlen
- 2);
5171 canon
[nlen
- 2] = '\0';
5174 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5178 /* Implementation of the la_iterate_over_symbols method. */
5181 ada_iterate_over_symbols (const struct block
*block
,
5182 const char *name
, domain_enum domain
,
5183 symbol_found_callback_ftype
*callback
,
5187 struct ada_symbol_info
*results
;
5189 ndefs
= ada_lookup_symbol_list (name
, block
, domain
, &results
, 0);
5190 for (i
= 0; i
< ndefs
; ++i
)
5192 if (! (*callback
) (results
[i
].sym
, data
))
5197 /* The result is as for ada_lookup_symbol_list with FULL_SEARCH set
5198 to 1, but choosing the first symbol found if there are multiple
5201 The result is stored in *INFO, which must be non-NULL.
5202 If no match is found, INFO->SYM is set to NULL. */
5205 ada_lookup_encoded_symbol (const char *name
, const struct block
*block
,
5206 domain_enum
namespace,
5207 struct ada_symbol_info
*info
)
5209 struct ada_symbol_info
*candidates
;
5212 gdb_assert (info
!= NULL
);
5213 memset (info
, 0, sizeof (struct ada_symbol_info
));
5215 n_candidates
= ada_lookup_symbol_list (name
, block
, namespace, &candidates
,
5218 if (n_candidates
== 0)
5221 *info
= candidates
[0];
5222 info
->sym
= fixup_symbol_section (info
->sym
, NULL
);
5225 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5226 scope and in global scopes, or NULL if none. NAME is folded and
5227 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5228 choosing the first symbol if there are multiple choices.
5229 If IS_A_FIELD_OF_THIS is not NULL, it is set to zero. */
5232 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5233 domain_enum
namespace, int *is_a_field_of_this
)
5235 struct ada_symbol_info info
;
5237 if (is_a_field_of_this
!= NULL
)
5238 *is_a_field_of_this
= 0;
5240 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5241 block0
, namespace, &info
);
5245 static struct symbol
*
5246 ada_lookup_symbol_nonlocal (const char *name
,
5247 const struct block
*block
,
5248 const domain_enum domain
)
5250 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5254 /* True iff STR is a possible encoded suffix of a normal Ada name
5255 that is to be ignored for matching purposes. Suffixes of parallel
5256 names (e.g., XVE) are not included here. Currently, the possible suffixes
5257 are given by any of the regular expressions:
5259 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5260 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5261 TKB [subprogram suffix for task bodies]
5262 _E[0-9]+[bs]$ [protected object entry suffixes]
5263 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5265 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5266 match is performed. This sequence is used to differentiate homonyms,
5267 is an optional part of a valid name suffix. */
5270 is_name_suffix (const char *str
)
5273 const char *matching
;
5274 const int len
= strlen (str
);
5276 /* Skip optional leading __[0-9]+. */
5278 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5281 while (isdigit (str
[0]))
5287 if (str
[0] == '.' || str
[0] == '$')
5290 while (isdigit (matching
[0]))
5292 if (matching
[0] == '\0')
5298 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5301 while (isdigit (matching
[0]))
5303 if (matching
[0] == '\0')
5307 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5309 if (strcmp (str
, "TKB") == 0)
5313 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5314 with a N at the end. Unfortunately, the compiler uses the same
5315 convention for other internal types it creates. So treating
5316 all entity names that end with an "N" as a name suffix causes
5317 some regressions. For instance, consider the case of an enumerated
5318 type. To support the 'Image attribute, it creates an array whose
5320 Having a single character like this as a suffix carrying some
5321 information is a bit risky. Perhaps we should change the encoding
5322 to be something like "_N" instead. In the meantime, do not do
5323 the following check. */
5324 /* Protected Object Subprograms */
5325 if (len
== 1 && str
[0] == 'N')
5330 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5333 while (isdigit (matching
[0]))
5335 if ((matching
[0] == 'b' || matching
[0] == 's')
5336 && matching
[1] == '\0')
5340 /* ??? We should not modify STR directly, as we are doing below. This
5341 is fine in this case, but may become problematic later if we find
5342 that this alternative did not work, and want to try matching
5343 another one from the begining of STR. Since we modified it, we
5344 won't be able to find the begining of the string anymore! */
5348 while (str
[0] != '_' && str
[0] != '\0')
5350 if (str
[0] != 'n' && str
[0] != 'b')
5356 if (str
[0] == '\000')
5361 if (str
[1] != '_' || str
[2] == '\000')
5365 if (strcmp (str
+ 3, "JM") == 0)
5367 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5368 the LJM suffix in favor of the JM one. But we will
5369 still accept LJM as a valid suffix for a reasonable
5370 amount of time, just to allow ourselves to debug programs
5371 compiled using an older version of GNAT. */
5372 if (strcmp (str
+ 3, "LJM") == 0)
5376 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5377 || str
[4] == 'U' || str
[4] == 'P')
5379 if (str
[4] == 'R' && str
[5] != 'T')
5383 if (!isdigit (str
[2]))
5385 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5386 if (!isdigit (str
[k
]) && str
[k
] != '_')
5390 if (str
[0] == '$' && isdigit (str
[1]))
5392 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5393 if (!isdigit (str
[k
]) && str
[k
] != '_')
5400 /* Return non-zero if the string starting at NAME and ending before
5401 NAME_END contains no capital letters. */
5404 is_valid_name_for_wild_match (const char *name0
)
5406 const char *decoded_name
= ada_decode (name0
);
5409 /* If the decoded name starts with an angle bracket, it means that
5410 NAME0 does not follow the GNAT encoding format. It should then
5411 not be allowed as a possible wild match. */
5412 if (decoded_name
[0] == '<')
5415 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5416 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5422 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5423 that could start a simple name. Assumes that *NAMEP points into
5424 the string beginning at NAME0. */
5427 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5429 const char *name
= *namep
;
5439 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5442 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5447 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5448 || name
[2] == target0
))
5456 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5466 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5467 informational suffixes of NAME (i.e., for which is_name_suffix is
5468 true). Assumes that PATN is a lower-cased Ada simple name. */
5471 wild_match (const char *name
, const char *patn
)
5474 const char *name0
= name
;
5478 const char *match
= name
;
5482 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5485 if (*p
== '\0' && is_name_suffix (name
))
5486 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5488 if (name
[-1] == '_')
5491 if (!advance_wild_match (&name
, name0
, *patn
))
5496 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5497 informational suffix. */
5500 full_match (const char *sym_name
, const char *search_name
)
5502 return !match_name (sym_name
, search_name
, 0);
5506 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5507 vector *defn_symbols, updating the list of symbols in OBSTACKP
5508 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5509 OBJFILE is the section containing BLOCK.
5510 SYMTAB is recorded with each symbol added. */
5513 ada_add_block_symbols (struct obstack
*obstackp
,
5514 struct block
*block
, const char *name
,
5515 domain_enum domain
, struct objfile
*objfile
,
5518 struct block_iterator iter
;
5519 int name_len
= strlen (name
);
5520 /* A matching argument symbol, if any. */
5521 struct symbol
*arg_sym
;
5522 /* Set true when we find a matching non-argument symbol. */
5530 for (sym
= block_iter_match_first (block
, name
, wild_match
, &iter
);
5531 sym
!= NULL
; sym
= block_iter_match_next (name
, wild_match
, &iter
))
5533 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5534 SYMBOL_DOMAIN (sym
), domain
)
5535 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5537 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5539 else if (SYMBOL_IS_ARGUMENT (sym
))
5544 add_defn_to_vec (obstackp
,
5545 fixup_symbol_section (sym
, objfile
),
5553 for (sym
= block_iter_match_first (block
, name
, full_match
, &iter
);
5554 sym
!= NULL
; sym
= block_iter_match_next (name
, full_match
, &iter
))
5556 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5557 SYMBOL_DOMAIN (sym
), domain
))
5559 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5561 if (SYMBOL_IS_ARGUMENT (sym
))
5566 add_defn_to_vec (obstackp
,
5567 fixup_symbol_section (sym
, objfile
),
5575 if (!found_sym
&& arg_sym
!= NULL
)
5577 add_defn_to_vec (obstackp
,
5578 fixup_symbol_section (arg_sym
, objfile
),
5587 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5589 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5590 SYMBOL_DOMAIN (sym
), domain
))
5594 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5597 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5599 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5604 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5606 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5608 if (SYMBOL_IS_ARGUMENT (sym
))
5613 add_defn_to_vec (obstackp
,
5614 fixup_symbol_section (sym
, objfile
),
5622 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5623 They aren't parameters, right? */
5624 if (!found_sym
&& arg_sym
!= NULL
)
5626 add_defn_to_vec (obstackp
,
5627 fixup_symbol_section (arg_sym
, objfile
),
5634 /* Symbol Completion */
5636 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5637 name in a form that's appropriate for the completion. The result
5638 does not need to be deallocated, but is only good until the next call.
5640 TEXT_LEN is equal to the length of TEXT.
5641 Perform a wild match if WILD_MATCH_P is set.
5642 ENCODED_P should be set if TEXT represents the start of a symbol name
5643 in its encoded form. */
5646 symbol_completion_match (const char *sym_name
,
5647 const char *text
, int text_len
,
5648 int wild_match_p
, int encoded_p
)
5650 const int verbatim_match
= (text
[0] == '<');
5655 /* Strip the leading angle bracket. */
5660 /* First, test against the fully qualified name of the symbol. */
5662 if (strncmp (sym_name
, text
, text_len
) == 0)
5665 if (match
&& !encoded_p
)
5667 /* One needed check before declaring a positive match is to verify
5668 that iff we are doing a verbatim match, the decoded version
5669 of the symbol name starts with '<'. Otherwise, this symbol name
5670 is not a suitable completion. */
5671 const char *sym_name_copy
= sym_name
;
5672 int has_angle_bracket
;
5674 sym_name
= ada_decode (sym_name
);
5675 has_angle_bracket
= (sym_name
[0] == '<');
5676 match
= (has_angle_bracket
== verbatim_match
);
5677 sym_name
= sym_name_copy
;
5680 if (match
&& !verbatim_match
)
5682 /* When doing non-verbatim match, another check that needs to
5683 be done is to verify that the potentially matching symbol name
5684 does not include capital letters, because the ada-mode would
5685 not be able to understand these symbol names without the
5686 angle bracket notation. */
5689 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5694 /* Second: Try wild matching... */
5696 if (!match
&& wild_match_p
)
5698 /* Since we are doing wild matching, this means that TEXT
5699 may represent an unqualified symbol name. We therefore must
5700 also compare TEXT against the unqualified name of the symbol. */
5701 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5703 if (strncmp (sym_name
, text
, text_len
) == 0)
5707 /* Finally: If we found a mach, prepare the result to return. */
5713 sym_name
= add_angle_brackets (sym_name
);
5716 sym_name
= ada_decode (sym_name
);
5721 /* A companion function to ada_make_symbol_completion_list().
5722 Check if SYM_NAME represents a symbol which name would be suitable
5723 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5724 it is appended at the end of the given string vector SV.
5726 ORIG_TEXT is the string original string from the user command
5727 that needs to be completed. WORD is the entire command on which
5728 completion should be performed. These two parameters are used to
5729 determine which part of the symbol name should be added to the
5731 if WILD_MATCH_P is set, then wild matching is performed.
5732 ENCODED_P should be set if TEXT represents a symbol name in its
5733 encoded formed (in which case the completion should also be
5737 symbol_completion_add (VEC(char_ptr
) **sv
,
5738 const char *sym_name
,
5739 const char *text
, int text_len
,
5740 const char *orig_text
, const char *word
,
5741 int wild_match_p
, int encoded_p
)
5743 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5744 wild_match_p
, encoded_p
);
5750 /* We found a match, so add the appropriate completion to the given
5753 if (word
== orig_text
)
5755 completion
= xmalloc (strlen (match
) + 5);
5756 strcpy (completion
, match
);
5758 else if (word
> orig_text
)
5760 /* Return some portion of sym_name. */
5761 completion
= xmalloc (strlen (match
) + 5);
5762 strcpy (completion
, match
+ (word
- orig_text
));
5766 /* Return some of ORIG_TEXT plus sym_name. */
5767 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5768 strncpy (completion
, word
, orig_text
- word
);
5769 completion
[orig_text
- word
] = '\0';
5770 strcat (completion
, match
);
5773 VEC_safe_push (char_ptr
, *sv
, completion
);
5776 /* An object of this type is passed as the user_data argument to the
5777 expand_partial_symbol_names method. */
5778 struct add_partial_datum
5780 VEC(char_ptr
) **completions
;
5789 /* A callback for expand_partial_symbol_names. */
5791 ada_expand_partial_symbol_name (const char *name
, void *user_data
)
5793 struct add_partial_datum
*data
= user_data
;
5795 return symbol_completion_match (name
, data
->text
, data
->text_len
,
5796 data
->wild_match
, data
->encoded
) != NULL
;
5799 /* Return a list of possible symbol names completing TEXT0. The list
5800 is NULL terminated. WORD is the entire command on which completion
5804 ada_make_symbol_completion_list (char *text0
, char *word
)
5810 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5813 struct minimal_symbol
*msymbol
;
5814 struct objfile
*objfile
;
5815 struct block
*b
, *surrounding_static_block
= 0;
5817 struct block_iterator iter
;
5819 if (text0
[0] == '<')
5821 text
= xstrdup (text0
);
5822 make_cleanup (xfree
, text
);
5823 text_len
= strlen (text
);
5829 text
= xstrdup (ada_encode (text0
));
5830 make_cleanup (xfree
, text
);
5831 text_len
= strlen (text
);
5832 for (i
= 0; i
< text_len
; i
++)
5833 text
[i
] = tolower (text
[i
]);
5835 encoded_p
= (strstr (text0
, "__") != NULL
);
5836 /* If the name contains a ".", then the user is entering a fully
5837 qualified entity name, and the match must not be done in wild
5838 mode. Similarly, if the user wants to complete what looks like
5839 an encoded name, the match must not be done in wild mode. */
5840 wild_match_p
= (strchr (text0
, '.') == NULL
&& !encoded_p
);
5843 /* First, look at the partial symtab symbols. */
5845 struct add_partial_datum data
;
5847 data
.completions
= &completions
;
5849 data
.text_len
= text_len
;
5852 data
.wild_match
= wild_match_p
;
5853 data
.encoded
= encoded_p
;
5854 expand_partial_symbol_names (ada_expand_partial_symbol_name
, &data
);
5857 /* At this point scan through the misc symbol vectors and add each
5858 symbol you find to the list. Eventually we want to ignore
5859 anything that isn't a text symbol (everything else will be
5860 handled by the psymtab code above). */
5862 ALL_MSYMBOLS (objfile
, msymbol
)
5865 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5866 text
, text_len
, text0
, word
, wild_match_p
,
5870 /* Search upwards from currently selected frame (so that we can
5871 complete on local vars. */
5873 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5875 if (!BLOCK_SUPERBLOCK (b
))
5876 surrounding_static_block
= b
; /* For elmin of dups */
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_p
, encoded_p
);
5886 /* Go through the symtabs and check the externs and statics for
5887 symbols which match. */
5889 ALL_SYMTABS (objfile
, s
)
5892 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_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_p
, encoded_p
);
5901 ALL_SYMTABS (objfile
, s
)
5904 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5905 /* Don't do this block twice. */
5906 if (b
== surrounding_static_block
)
5908 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5910 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5911 text
, text_len
, text0
, word
,
5912 wild_match_p
, encoded_p
);
5916 /* Append the closing NULL entry. */
5917 VEC_safe_push (char_ptr
, completions
, NULL
);
5919 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5920 return the copy. It's unfortunate that we have to make a copy
5921 of an array that we're about to destroy, but there is nothing much
5922 we can do about it. Fortunately, it's typically not a very large
5925 const size_t completions_size
=
5926 VEC_length (char_ptr
, completions
) * sizeof (char *);
5927 char **result
= xmalloc (completions_size
);
5929 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5931 VEC_free (char_ptr
, completions
);
5938 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5939 for tagged types. */
5942 ada_is_dispatch_table_ptr_type (struct type
*type
)
5946 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5949 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5953 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5956 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5957 to be invisible to users. */
5960 ada_is_ignored_field (struct type
*type
, int field_num
)
5962 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5965 /* Check the name of that field. */
5967 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5969 /* Anonymous field names should not be printed.
5970 brobecker/2007-02-20: I don't think this can actually happen
5971 but we don't want to print the value of annonymous fields anyway. */
5975 /* Normally, fields whose name start with an underscore ("_")
5976 are fields that have been internally generated by the compiler,
5977 and thus should not be printed. The "_parent" field is special,
5978 however: This is a field internally generated by the compiler
5979 for tagged types, and it contains the components inherited from
5980 the parent type. This field should not be printed as is, but
5981 should not be ignored either. */
5982 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5986 /* If this is the dispatch table of a tagged type, then ignore. */
5987 if (ada_is_tagged_type (type
, 1)
5988 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5991 /* Not a special field, so it should not be ignored. */
5995 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5996 pointer or reference type whose ultimate target has a tag field. */
5999 ada_is_tagged_type (struct type
*type
, int refok
)
6001 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
6004 /* True iff TYPE represents the type of X'Tag */
6007 ada_is_tag_type (struct type
*type
)
6009 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6013 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6015 return (name
!= NULL
6016 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6020 /* The type of the tag on VAL. */
6023 ada_tag_type (struct value
*val
)
6025 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6028 /* The value of the tag on VAL. */
6031 ada_value_tag (struct value
*val
)
6033 return ada_value_struct_elt (val
, "_tag", 0);
6036 /* The value of the tag on the object of type TYPE whose contents are
6037 saved at VALADDR, if it is non-null, or is at memory address
6040 static struct value
*
6041 value_tag_from_contents_and_address (struct type
*type
,
6042 const gdb_byte
*valaddr
,
6045 int tag_byte_offset
;
6046 struct type
*tag_type
;
6048 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6051 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6053 : valaddr
+ tag_byte_offset
);
6054 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6056 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6061 static struct type
*
6062 type_from_tag (struct value
*tag
)
6064 const char *type_name
= ada_tag_name (tag
);
6066 if (type_name
!= NULL
)
6067 return ada_find_any_type (ada_encode (type_name
));
6071 /* Return the "ada__tags__type_specific_data" type. */
6073 static struct type
*
6074 ada_get_tsd_type (struct inferior
*inf
)
6076 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6078 if (data
->tsd_type
== 0)
6079 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6080 return data
->tsd_type
;
6083 /* Return the TSD (type-specific data) associated to the given TAG.
6084 TAG is assumed to be the tag of a tagged-type entity.
6086 May return NULL if we are unable to get the TSD. */
6088 static struct value
*
6089 ada_get_tsd_from_tag (struct value
*tag
)
6094 /* First option: The TSD is simply stored as a field of our TAG.
6095 Only older versions of GNAT would use this format, but we have
6096 to test it first, because there are no visible markers for
6097 the current approach except the absence of that field. */
6099 val
= ada_value_struct_elt (tag
, "tsd", 1);
6103 /* Try the second representation for the dispatch table (in which
6104 there is no explicit 'tsd' field in the referent of the tag pointer,
6105 and instead the tsd pointer is stored just before the dispatch
6108 type
= ada_get_tsd_type (current_inferior());
6111 type
= lookup_pointer_type (lookup_pointer_type (type
));
6112 val
= value_cast (type
, tag
);
6115 return value_ind (value_ptradd (val
, -1));
6118 /* Given the TSD of a tag (type-specific data), return a string
6119 containing the name of the associated type.
6121 The returned value is good until the next call. May return NULL
6122 if we are unable to determine the tag name. */
6125 ada_tag_name_from_tsd (struct value
*tsd
)
6127 static char name
[1024];
6131 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6134 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6135 for (p
= name
; *p
!= '\0'; p
+= 1)
6141 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6144 Return NULL if the TAG is not an Ada tag, or if we were unable to
6145 determine the name of that tag. The result is good until the next
6149 ada_tag_name (struct value
*tag
)
6151 volatile struct gdb_exception e
;
6154 if (!ada_is_tag_type (value_type (tag
)))
6157 /* It is perfectly possible that an exception be raised while trying
6158 to determine the TAG's name, even under normal circumstances:
6159 The associated variable may be uninitialized or corrupted, for
6160 instance. We do not let any exception propagate past this point.
6161 instead we return NULL.
6163 We also do not print the error message either (which often is very
6164 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6165 the caller print a more meaningful message if necessary. */
6166 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6168 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6171 name
= ada_tag_name_from_tsd (tsd
);
6177 /* The parent type of TYPE, or NULL if none. */
6180 ada_parent_type (struct type
*type
)
6184 type
= ada_check_typedef (type
);
6186 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6189 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6190 if (ada_is_parent_field (type
, i
))
6192 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6194 /* If the _parent field is a pointer, then dereference it. */
6195 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6196 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6197 /* If there is a parallel XVS type, get the actual base type. */
6198 parent_type
= ada_get_base_type (parent_type
);
6200 return ada_check_typedef (parent_type
);
6206 /* True iff field number FIELD_NUM of structure type TYPE contains the
6207 parent-type (inherited) fields of a derived type. Assumes TYPE is
6208 a structure type with at least FIELD_NUM+1 fields. */
6211 ada_is_parent_field (struct type
*type
, int field_num
)
6213 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6215 return (name
!= NULL
6216 && (strncmp (name
, "PARENT", 6) == 0
6217 || strncmp (name
, "_parent", 7) == 0));
6220 /* True iff field number FIELD_NUM of structure type TYPE is a
6221 transparent wrapper field (which should be silently traversed when doing
6222 field selection and flattened when printing). Assumes TYPE is a
6223 structure type with at least FIELD_NUM+1 fields. Such fields are always
6227 ada_is_wrapper_field (struct type
*type
, int field_num
)
6229 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6231 return (name
!= NULL
6232 && (strncmp (name
, "PARENT", 6) == 0
6233 || strcmp (name
, "REP") == 0
6234 || strncmp (name
, "_parent", 7) == 0
6235 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6238 /* True iff field number FIELD_NUM of structure or union type TYPE
6239 is a variant wrapper. Assumes TYPE is a structure type with at least
6240 FIELD_NUM+1 fields. */
6243 ada_is_variant_part (struct type
*type
, int field_num
)
6245 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6247 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6248 || (is_dynamic_field (type
, field_num
)
6249 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6250 == TYPE_CODE_UNION
)));
6253 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6254 whose discriminants are contained in the record type OUTER_TYPE,
6255 returns the type of the controlling discriminant for the variant.
6256 May return NULL if the type could not be found. */
6259 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6261 char *name
= ada_variant_discrim_name (var_type
);
6263 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6266 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6267 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6268 represents a 'when others' clause; otherwise 0. */
6271 ada_is_others_clause (struct type
*type
, int field_num
)
6273 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6275 return (name
!= NULL
&& name
[0] == 'O');
6278 /* Assuming that TYPE0 is the type of the variant part of a record,
6279 returns the name of the discriminant controlling the variant.
6280 The value is valid until the next call to ada_variant_discrim_name. */
6283 ada_variant_discrim_name (struct type
*type0
)
6285 static char *result
= NULL
;
6286 static size_t result_len
= 0;
6289 const char *discrim_end
;
6290 const char *discrim_start
;
6292 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6293 type
= TYPE_TARGET_TYPE (type0
);
6297 name
= ada_type_name (type
);
6299 if (name
== NULL
|| name
[0] == '\000')
6302 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6305 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6308 if (discrim_end
== name
)
6311 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6314 if (discrim_start
== name
+ 1)
6316 if ((discrim_start
> name
+ 3
6317 && strncmp (discrim_start
- 3, "___", 3) == 0)
6318 || discrim_start
[-1] == '.')
6322 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6323 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6324 result
[discrim_end
- discrim_start
] = '\0';
6328 /* Scan STR for a subtype-encoded number, beginning at position K.
6329 Put the position of the character just past the number scanned in
6330 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6331 Return 1 if there was a valid number at the given position, and 0
6332 otherwise. A "subtype-encoded" number consists of the absolute value
6333 in decimal, followed by the letter 'm' to indicate a negative number.
6334 Assumes 0m does not occur. */
6337 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6341 if (!isdigit (str
[k
]))
6344 /* Do it the hard way so as not to make any assumption about
6345 the relationship of unsigned long (%lu scan format code) and
6348 while (isdigit (str
[k
]))
6350 RU
= RU
* 10 + (str
[k
] - '0');
6357 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6363 /* NOTE on the above: Technically, C does not say what the results of
6364 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6365 number representable as a LONGEST (although either would probably work
6366 in most implementations). When RU>0, the locution in the then branch
6367 above is always equivalent to the negative of RU. */
6374 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6375 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6376 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6379 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6381 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6395 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6405 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6406 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6408 if (val
>= L
&& val
<= U
)
6420 /* FIXME: Lots of redundancy below. Try to consolidate. */
6422 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6423 ARG_TYPE, extract and return the value of one of its (non-static)
6424 fields. FIELDNO says which field. Differs from value_primitive_field
6425 only in that it can handle packed values of arbitrary type. */
6427 static struct value
*
6428 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6429 struct type
*arg_type
)
6433 arg_type
= ada_check_typedef (arg_type
);
6434 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6436 /* Handle packed fields. */
6438 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6440 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6441 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6443 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6444 offset
+ bit_pos
/ 8,
6445 bit_pos
% 8, bit_size
, type
);
6448 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6451 /* Find field with name NAME in object of type TYPE. If found,
6452 set the following for each argument that is non-null:
6453 - *FIELD_TYPE_P to the field's type;
6454 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6455 an object of that type;
6456 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6457 - *BIT_SIZE_P to its size in bits if the field is packed, and
6459 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6460 fields up to but not including the desired field, or by the total
6461 number of fields if not found. A NULL value of NAME never
6462 matches; the function just counts visible fields in this case.
6464 Returns 1 if found, 0 otherwise. */
6467 find_struct_field (const char *name
, struct type
*type
, int offset
,
6468 struct type
**field_type_p
,
6469 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6474 type
= ada_check_typedef (type
);
6476 if (field_type_p
!= NULL
)
6477 *field_type_p
= NULL
;
6478 if (byte_offset_p
!= NULL
)
6480 if (bit_offset_p
!= NULL
)
6482 if (bit_size_p
!= NULL
)
6485 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6487 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6488 int fld_offset
= offset
+ bit_pos
/ 8;
6489 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6491 if (t_field_name
== NULL
)
6494 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6496 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6498 if (field_type_p
!= NULL
)
6499 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6500 if (byte_offset_p
!= NULL
)
6501 *byte_offset_p
= fld_offset
;
6502 if (bit_offset_p
!= NULL
)
6503 *bit_offset_p
= bit_pos
% 8;
6504 if (bit_size_p
!= NULL
)
6505 *bit_size_p
= bit_size
;
6508 else if (ada_is_wrapper_field (type
, i
))
6510 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6511 field_type_p
, byte_offset_p
, bit_offset_p
,
6512 bit_size_p
, index_p
))
6515 else if (ada_is_variant_part (type
, i
))
6517 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6520 struct type
*field_type
6521 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6523 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6525 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6527 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6528 field_type_p
, byte_offset_p
,
6529 bit_offset_p
, bit_size_p
, index_p
))
6533 else if (index_p
!= NULL
)
6539 /* Number of user-visible fields in record type TYPE. */
6542 num_visible_fields (struct type
*type
)
6547 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6551 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6552 and search in it assuming it has (class) type TYPE.
6553 If found, return value, else return NULL.
6555 Searches recursively through wrapper fields (e.g., '_parent'). */
6557 static struct value
*
6558 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6563 type
= ada_check_typedef (type
);
6564 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6566 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6568 if (t_field_name
== NULL
)
6571 else if (field_name_match (t_field_name
, name
))
6572 return ada_value_primitive_field (arg
, offset
, i
, type
);
6574 else if (ada_is_wrapper_field (type
, i
))
6576 struct value
*v
= /* Do not let indent join lines here. */
6577 ada_search_struct_field (name
, arg
,
6578 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6579 TYPE_FIELD_TYPE (type
, i
));
6585 else if (ada_is_variant_part (type
, i
))
6587 /* PNH: Do we ever get here? See find_struct_field. */
6589 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6591 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6593 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6595 struct value
*v
= ada_search_struct_field
/* Force line
6598 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6599 TYPE_FIELD_TYPE (field_type
, j
));
6609 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6610 int, struct type
*);
6613 /* Return field #INDEX in ARG, where the index is that returned by
6614 * find_struct_field through its INDEX_P argument. Adjust the address
6615 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6616 * If found, return value, else return NULL. */
6618 static struct value
*
6619 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6622 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6626 /* Auxiliary function for ada_index_struct_field. Like
6627 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6630 static struct value
*
6631 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6635 type
= ada_check_typedef (type
);
6637 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6639 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6641 else if (ada_is_wrapper_field (type
, i
))
6643 struct value
*v
= /* Do not let indent join lines here. */
6644 ada_index_struct_field_1 (index_p
, arg
,
6645 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6646 TYPE_FIELD_TYPE (type
, i
));
6652 else if (ada_is_variant_part (type
, i
))
6654 /* PNH: Do we ever get here? See ada_search_struct_field,
6655 find_struct_field. */
6656 error (_("Cannot assign this kind of variant record"));
6658 else if (*index_p
== 0)
6659 return ada_value_primitive_field (arg
, offset
, i
, type
);
6666 /* Given ARG, a value of type (pointer or reference to a)*
6667 structure/union, extract the component named NAME from the ultimate
6668 target structure/union and return it as a value with its
6671 The routine searches for NAME among all members of the structure itself
6672 and (recursively) among all members of any wrapper members
6675 If NO_ERR, then simply return NULL in case of error, rather than
6679 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6681 struct type
*t
, *t1
;
6685 t1
= t
= ada_check_typedef (value_type (arg
));
6686 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6688 t1
= TYPE_TARGET_TYPE (t
);
6691 t1
= ada_check_typedef (t1
);
6692 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6694 arg
= coerce_ref (arg
);
6699 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6701 t1
= TYPE_TARGET_TYPE (t
);
6704 t1
= ada_check_typedef (t1
);
6705 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6707 arg
= value_ind (arg
);
6714 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6718 v
= ada_search_struct_field (name
, arg
, 0, t
);
6721 int bit_offset
, bit_size
, byte_offset
;
6722 struct type
*field_type
;
6725 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6726 address
= value_as_address (arg
);
6728 address
= unpack_pointer (t
, value_contents (arg
));
6730 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6731 if (find_struct_field (name
, t1
, 0,
6732 &field_type
, &byte_offset
, &bit_offset
,
6737 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6738 arg
= ada_coerce_ref (arg
);
6740 arg
= ada_value_ind (arg
);
6741 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6742 bit_offset
, bit_size
,
6746 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6750 if (v
!= NULL
|| no_err
)
6753 error (_("There is no member named %s."), name
);
6759 error (_("Attempt to extract a component of "
6760 "a value that is not a record."));
6763 /* Given a type TYPE, look up the type of the component of type named NAME.
6764 If DISPP is non-null, add its byte displacement from the beginning of a
6765 structure (pointed to by a value) of type TYPE to *DISPP (does not
6766 work for packed fields).
6768 Matches any field whose name has NAME as a prefix, possibly
6771 TYPE can be either a struct or union. If REFOK, TYPE may also
6772 be a (pointer or reference)+ to a struct or union, and the
6773 ultimate target type will be searched.
6775 Looks recursively into variant clauses and parent types.
6777 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6778 TYPE is not a type of the right kind. */
6780 static struct type
*
6781 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6782 int noerr
, int *dispp
)
6789 if (refok
&& type
!= NULL
)
6792 type
= ada_check_typedef (type
);
6793 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6794 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6796 type
= TYPE_TARGET_TYPE (type
);
6800 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6801 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6807 target_terminal_ours ();
6808 gdb_flush (gdb_stdout
);
6810 error (_("Type (null) is not a structure or union type"));
6813 /* XXX: type_sprint */
6814 fprintf_unfiltered (gdb_stderr
, _("Type "));
6815 type_print (type
, "", gdb_stderr
, -1);
6816 error (_(" is not a structure or union type"));
6821 type
= to_static_fixed_type (type
);
6823 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6825 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6829 if (t_field_name
== NULL
)
6832 else if (field_name_match (t_field_name
, name
))
6835 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6836 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6839 else if (ada_is_wrapper_field (type
, i
))
6842 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6847 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6852 else if (ada_is_variant_part (type
, i
))
6855 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6858 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6860 /* FIXME pnh 2008/01/26: We check for a field that is
6861 NOT wrapped in a struct, since the compiler sometimes
6862 generates these for unchecked variant types. Revisit
6863 if the compiler changes this practice. */
6864 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6866 if (v_field_name
!= NULL
6867 && field_name_match (v_field_name
, name
))
6868 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6870 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
6877 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6888 target_terminal_ours ();
6889 gdb_flush (gdb_stdout
);
6892 /* XXX: type_sprint */
6893 fprintf_unfiltered (gdb_stderr
, _("Type "));
6894 type_print (type
, "", gdb_stderr
, -1);
6895 error (_(" has no component named <null>"));
6899 /* XXX: type_sprint */
6900 fprintf_unfiltered (gdb_stderr
, _("Type "));
6901 type_print (type
, "", gdb_stderr
, -1);
6902 error (_(" has no component named %s"), name
);
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, return true iff VAR_TYPE
6911 represents an unchecked union (that is, the variant part of a
6912 record that is named in an Unchecked_Union pragma). */
6915 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6917 char *discrim_name
= ada_variant_discrim_name (var_type
);
6919 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6924 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6925 within a value of type OUTER_TYPE that is stored in GDB at
6926 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6927 numbering from 0) is applicable. Returns -1 if none are. */
6930 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6931 const gdb_byte
*outer_valaddr
)
6935 char *discrim_name
= ada_variant_discrim_name (var_type
);
6936 struct value
*outer
;
6937 struct value
*discrim
;
6938 LONGEST discrim_val
;
6940 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6941 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6942 if (discrim
== NULL
)
6944 discrim_val
= value_as_long (discrim
);
6947 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6949 if (ada_is_others_clause (var_type
, i
))
6951 else if (ada_in_variant (discrim_val
, var_type
, i
))
6955 return others_clause
;
6960 /* Dynamic-Sized Records */
6962 /* Strategy: The type ostensibly attached to a value with dynamic size
6963 (i.e., a size that is not statically recorded in the debugging
6964 data) does not accurately reflect the size or layout of the value.
6965 Our strategy is to convert these values to values with accurate,
6966 conventional types that are constructed on the fly. */
6968 /* There is a subtle and tricky problem here. In general, we cannot
6969 determine the size of dynamic records without its data. However,
6970 the 'struct value' data structure, which GDB uses to represent
6971 quantities in the inferior process (the target), requires the size
6972 of the type at the time of its allocation in order to reserve space
6973 for GDB's internal copy of the data. That's why the
6974 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6975 rather than struct value*s.
6977 However, GDB's internal history variables ($1, $2, etc.) are
6978 struct value*s containing internal copies of the data that are not, in
6979 general, the same as the data at their corresponding addresses in
6980 the target. Fortunately, the types we give to these values are all
6981 conventional, fixed-size types (as per the strategy described
6982 above), so that we don't usually have to perform the
6983 'to_fixed_xxx_type' conversions to look at their values.
6984 Unfortunately, there is one exception: if one of the internal
6985 history variables is an array whose elements are unconstrained
6986 records, then we will need to create distinct fixed types for each
6987 element selected. */
6989 /* The upshot of all of this is that many routines take a (type, host
6990 address, target address) triple as arguments to represent a value.
6991 The host address, if non-null, is supposed to contain an internal
6992 copy of the relevant data; otherwise, the program is to consult the
6993 target at the target address. */
6995 /* Assuming that VAL0 represents a pointer value, the result of
6996 dereferencing it. Differs from value_ind in its treatment of
6997 dynamic-sized types. */
7000 ada_value_ind (struct value
*val0
)
7002 struct value
*val
= value_ind (val0
);
7004 return ada_to_fixed_value (val
);
7007 /* The value resulting from dereferencing any "reference to"
7008 qualifiers on VAL0. */
7010 static struct value
*
7011 ada_coerce_ref (struct value
*val0
)
7013 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7015 struct value
*val
= val0
;
7017 val
= coerce_ref (val
);
7018 return ada_to_fixed_value (val
);
7024 /* Return OFF rounded upward if necessary to a multiple of
7025 ALIGNMENT (a power of 2). */
7028 align_value (unsigned int off
, unsigned int alignment
)
7030 return (off
+ alignment
- 1) & ~(alignment
- 1);
7033 /* Return the bit alignment required for field #F of template type TYPE. */
7036 field_alignment (struct type
*type
, int f
)
7038 const char *name
= TYPE_FIELD_NAME (type
, f
);
7042 /* The field name should never be null, unless the debugging information
7043 is somehow malformed. In this case, we assume the field does not
7044 require any alignment. */
7048 len
= strlen (name
);
7050 if (!isdigit (name
[len
- 1]))
7053 if (isdigit (name
[len
- 2]))
7054 align_offset
= len
- 2;
7056 align_offset
= len
- 1;
7058 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7059 return TARGET_CHAR_BIT
;
7061 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7064 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7066 static struct symbol
*
7067 ada_find_any_type_symbol (const char *name
)
7071 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7072 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7075 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7079 /* Find a type named NAME. Ignores ambiguity. This routine will look
7080 solely for types defined by debug info, it will not search the GDB
7083 static struct type
*
7084 ada_find_any_type (const char *name
)
7086 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7089 return SYMBOL_TYPE (sym
);
7094 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7095 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7096 symbol, in which case it is returned. Otherwise, this looks for
7097 symbols whose name is that of NAME_SYM suffixed with "___XR".
7098 Return symbol if found, and NULL otherwise. */
7101 ada_find_renaming_symbol (struct symbol
*name_sym
, struct block
*block
)
7103 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7106 if (strstr (name
, "___XR") != NULL
)
7109 sym
= find_old_style_renaming_symbol (name
, block
);
7114 /* Not right yet. FIXME pnh 7/20/2007. */
7115 sym
= ada_find_any_type_symbol (name
);
7116 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7122 static struct symbol
*
7123 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
7125 const struct symbol
*function_sym
= block_linkage_function (block
);
7128 if (function_sym
!= NULL
)
7130 /* If the symbol is defined inside a function, NAME is not fully
7131 qualified. This means we need to prepend the function name
7132 as well as adding the ``___XR'' suffix to build the name of
7133 the associated renaming symbol. */
7134 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7135 /* Function names sometimes contain suffixes used
7136 for instance to qualify nested subprograms. When building
7137 the XR type name, we need to make sure that this suffix is
7138 not included. So do not include any suffix in the function
7139 name length below. */
7140 int function_name_len
= ada_name_prefix_len (function_name
);
7141 const int rename_len
= function_name_len
+ 2 /* "__" */
7142 + strlen (name
) + 6 /* "___XR\0" */ ;
7144 /* Strip the suffix if necessary. */
7145 ada_remove_trailing_digits (function_name
, &function_name_len
);
7146 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7147 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7149 /* Library-level functions are a special case, as GNAT adds
7150 a ``_ada_'' prefix to the function name to avoid namespace
7151 pollution. However, the renaming symbols themselves do not
7152 have this prefix, so we need to skip this prefix if present. */
7153 if (function_name_len
> 5 /* "_ada_" */
7154 && strstr (function_name
, "_ada_") == function_name
)
7157 function_name_len
-= 5;
7160 rename
= (char *) alloca (rename_len
* sizeof (char));
7161 strncpy (rename
, function_name
, function_name_len
);
7162 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7167 const int rename_len
= strlen (name
) + 6;
7169 rename
= (char *) alloca (rename_len
* sizeof (char));
7170 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7173 return ada_find_any_type_symbol (rename
);
7176 /* Because of GNAT encoding conventions, several GDB symbols may match a
7177 given type name. If the type denoted by TYPE0 is to be preferred to
7178 that of TYPE1 for purposes of type printing, return non-zero;
7179 otherwise return 0. */
7182 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7186 else if (type0
== NULL
)
7188 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7190 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7192 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7194 else if (ada_is_constrained_packed_array_type (type0
))
7196 else if (ada_is_array_descriptor_type (type0
)
7197 && !ada_is_array_descriptor_type (type1
))
7201 const char *type0_name
= type_name_no_tag (type0
);
7202 const char *type1_name
= type_name_no_tag (type1
);
7204 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7205 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7211 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7212 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7215 ada_type_name (struct type
*type
)
7219 else if (TYPE_NAME (type
) != NULL
)
7220 return TYPE_NAME (type
);
7222 return TYPE_TAG_NAME (type
);
7225 /* Search the list of "descriptive" types associated to TYPE for a type
7226 whose name is NAME. */
7228 static struct type
*
7229 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7231 struct type
*result
;
7233 /* If there no descriptive-type info, then there is no parallel type
7235 if (!HAVE_GNAT_AUX_INFO (type
))
7238 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7239 while (result
!= NULL
)
7241 const char *result_name
= ada_type_name (result
);
7243 if (result_name
== NULL
)
7245 warning (_("unexpected null name on descriptive type"));
7249 /* If the names match, stop. */
7250 if (strcmp (result_name
, name
) == 0)
7253 /* Otherwise, look at the next item on the list, if any. */
7254 if (HAVE_GNAT_AUX_INFO (result
))
7255 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7260 /* If we didn't find a match, see whether this is a packed array. With
7261 older compilers, the descriptive type information is either absent or
7262 irrelevant when it comes to packed arrays so the above lookup fails.
7263 Fall back to using a parallel lookup by name in this case. */
7264 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7265 return ada_find_any_type (name
);
7270 /* Find a parallel type to TYPE with the specified NAME, using the
7271 descriptive type taken from the debugging information, if available,
7272 and otherwise using the (slower) name-based method. */
7274 static struct type
*
7275 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7277 struct type
*result
= NULL
;
7279 if (HAVE_GNAT_AUX_INFO (type
))
7280 result
= find_parallel_type_by_descriptive_type (type
, name
);
7282 result
= ada_find_any_type (name
);
7287 /* Same as above, but specify the name of the parallel type by appending
7288 SUFFIX to the name of TYPE. */
7291 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7294 const char *typename
= ada_type_name (type
);
7297 if (typename
== NULL
)
7300 len
= strlen (typename
);
7302 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7304 strcpy (name
, typename
);
7305 strcpy (name
+ len
, suffix
);
7307 return ada_find_parallel_type_with_name (type
, name
);
7310 /* If TYPE is a variable-size record type, return the corresponding template
7311 type describing its fields. Otherwise, return NULL. */
7313 static struct type
*
7314 dynamic_template_type (struct type
*type
)
7316 type
= ada_check_typedef (type
);
7318 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7319 || ada_type_name (type
) == NULL
)
7323 int len
= strlen (ada_type_name (type
));
7325 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7328 return ada_find_parallel_type (type
, "___XVE");
7332 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7333 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7336 is_dynamic_field (struct type
*templ_type
, int field_num
)
7338 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7341 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7342 && strstr (name
, "___XVL") != NULL
;
7345 /* The index of the variant field of TYPE, or -1 if TYPE does not
7346 represent a variant record type. */
7349 variant_field_index (struct type
*type
)
7353 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7356 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7358 if (ada_is_variant_part (type
, f
))
7364 /* A record type with no fields. */
7366 static struct type
*
7367 empty_record (struct type
*template)
7369 struct type
*type
= alloc_type_copy (template);
7371 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7372 TYPE_NFIELDS (type
) = 0;
7373 TYPE_FIELDS (type
) = NULL
;
7374 INIT_CPLUS_SPECIFIC (type
);
7375 TYPE_NAME (type
) = "<empty>";
7376 TYPE_TAG_NAME (type
) = NULL
;
7377 TYPE_LENGTH (type
) = 0;
7381 /* An ordinary record type (with fixed-length fields) that describes
7382 the value of type TYPE at VALADDR or ADDRESS (see comments at
7383 the beginning of this section) VAL according to GNAT conventions.
7384 DVAL0 should describe the (portion of a) record that contains any
7385 necessary discriminants. It should be NULL if value_type (VAL) is
7386 an outer-level type (i.e., as opposed to a branch of a variant.) A
7387 variant field (unless unchecked) is replaced by a particular branch
7390 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7391 length are not statically known are discarded. As a consequence,
7392 VALADDR, ADDRESS and DVAL0 are ignored.
7394 NOTE: Limitations: For now, we assume that dynamic fields and
7395 variants occupy whole numbers of bytes. However, they need not be
7399 ada_template_to_fixed_record_type_1 (struct type
*type
,
7400 const gdb_byte
*valaddr
,
7401 CORE_ADDR address
, struct value
*dval0
,
7402 int keep_dynamic_fields
)
7404 struct value
*mark
= value_mark ();
7407 int nfields
, bit_len
;
7413 /* Compute the number of fields in this record type that are going
7414 to be processed: unless keep_dynamic_fields, this includes only
7415 fields whose position and length are static will be processed. */
7416 if (keep_dynamic_fields
)
7417 nfields
= TYPE_NFIELDS (type
);
7421 while (nfields
< TYPE_NFIELDS (type
)
7422 && !ada_is_variant_part (type
, nfields
)
7423 && !is_dynamic_field (type
, nfields
))
7427 rtype
= alloc_type_copy (type
);
7428 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7429 INIT_CPLUS_SPECIFIC (rtype
);
7430 TYPE_NFIELDS (rtype
) = nfields
;
7431 TYPE_FIELDS (rtype
) = (struct field
*)
7432 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7433 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7434 TYPE_NAME (rtype
) = ada_type_name (type
);
7435 TYPE_TAG_NAME (rtype
) = NULL
;
7436 TYPE_FIXED_INSTANCE (rtype
) = 1;
7442 for (f
= 0; f
< nfields
; f
+= 1)
7444 off
= align_value (off
, field_alignment (type
, f
))
7445 + TYPE_FIELD_BITPOS (type
, f
);
7446 SET_FIELD_BITPOS (TYPE_FIELD (rtype
, f
), off
);
7447 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7449 if (ada_is_variant_part (type
, f
))
7454 else if (is_dynamic_field (type
, f
))
7456 const gdb_byte
*field_valaddr
= valaddr
;
7457 CORE_ADDR field_address
= address
;
7458 struct type
*field_type
=
7459 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7463 /* rtype's length is computed based on the run-time
7464 value of discriminants. If the discriminants are not
7465 initialized, the type size may be completely bogus and
7466 GDB may fail to allocate a value for it. So check the
7467 size first before creating the value. */
7469 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7474 /* If the type referenced by this field is an aligner type, we need
7475 to unwrap that aligner type, because its size might not be set.
7476 Keeping the aligner type would cause us to compute the wrong
7477 size for this field, impacting the offset of the all the fields
7478 that follow this one. */
7479 if (ada_is_aligner_type (field_type
))
7481 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7483 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7484 field_address
= cond_offset_target (field_address
, field_offset
);
7485 field_type
= ada_aligned_type (field_type
);
7488 field_valaddr
= cond_offset_host (field_valaddr
,
7489 off
/ TARGET_CHAR_BIT
);
7490 field_address
= cond_offset_target (field_address
,
7491 off
/ TARGET_CHAR_BIT
);
7493 /* Get the fixed type of the field. Note that, in this case,
7494 we do not want to get the real type out of the tag: if
7495 the current field is the parent part of a tagged record,
7496 we will get the tag of the object. Clearly wrong: the real
7497 type of the parent is not the real type of the child. We
7498 would end up in an infinite loop. */
7499 field_type
= ada_get_base_type (field_type
);
7500 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7501 field_address
, dval
, 0);
7502 /* If the field size is already larger than the maximum
7503 object size, then the record itself will necessarily
7504 be larger than the maximum object size. We need to make
7505 this check now, because the size might be so ridiculously
7506 large (due to an uninitialized variable in the inferior)
7507 that it would cause an overflow when adding it to the
7509 check_size (field_type
);
7511 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7512 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7513 /* The multiplication can potentially overflow. But because
7514 the field length has been size-checked just above, and
7515 assuming that the maximum size is a reasonable value,
7516 an overflow should not happen in practice. So rather than
7517 adding overflow recovery code to this already complex code,
7518 we just assume that it's not going to happen. */
7520 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7524 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7526 /* If our field is a typedef type (most likely a typedef of
7527 a fat pointer, encoding an array access), then we need to
7528 look at its target type to determine its characteristics.
7529 In particular, we would miscompute the field size if we took
7530 the size of the typedef (zero), instead of the size of
7532 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7533 field_type
= ada_typedef_target_type (field_type
);
7535 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7536 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7537 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7539 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7542 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7544 if (off
+ fld_bit_len
> bit_len
)
7545 bit_len
= off
+ fld_bit_len
;
7547 TYPE_LENGTH (rtype
) =
7548 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7551 /* We handle the variant part, if any, at the end because of certain
7552 odd cases in which it is re-ordered so as NOT to be the last field of
7553 the record. This can happen in the presence of representation
7555 if (variant_field
>= 0)
7557 struct type
*branch_type
;
7559 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7562 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7567 to_fixed_variant_branch_type
7568 (TYPE_FIELD_TYPE (type
, variant_field
),
7569 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7570 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7571 if (branch_type
== NULL
)
7573 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7574 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7575 TYPE_NFIELDS (rtype
) -= 1;
7579 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7580 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7582 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7584 if (off
+ fld_bit_len
> bit_len
)
7585 bit_len
= off
+ fld_bit_len
;
7586 TYPE_LENGTH (rtype
) =
7587 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7591 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7592 should contain the alignment of that record, which should be a strictly
7593 positive value. If null or negative, then something is wrong, most
7594 probably in the debug info. In that case, we don't round up the size
7595 of the resulting type. If this record is not part of another structure,
7596 the current RTYPE length might be good enough for our purposes. */
7597 if (TYPE_LENGTH (type
) <= 0)
7599 if (TYPE_NAME (rtype
))
7600 warning (_("Invalid type size for `%s' detected: %d."),
7601 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7603 warning (_("Invalid type size for <unnamed> detected: %d."),
7604 TYPE_LENGTH (type
));
7608 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7609 TYPE_LENGTH (type
));
7612 value_free_to_mark (mark
);
7613 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7614 error (_("record type with dynamic size is larger than varsize-limit"));
7618 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7621 static struct type
*
7622 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7623 CORE_ADDR address
, struct value
*dval0
)
7625 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7629 /* An ordinary record type in which ___XVL-convention fields and
7630 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7631 static approximations, containing all possible fields. Uses
7632 no runtime values. Useless for use in values, but that's OK,
7633 since the results are used only for type determinations. Works on both
7634 structs and unions. Representation note: to save space, we memorize
7635 the result of this function in the TYPE_TARGET_TYPE of the
7638 static struct type
*
7639 template_to_static_fixed_type (struct type
*type0
)
7645 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7646 return TYPE_TARGET_TYPE (type0
);
7648 nfields
= TYPE_NFIELDS (type0
);
7651 for (f
= 0; f
< nfields
; f
+= 1)
7653 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7654 struct type
*new_type
;
7656 if (is_dynamic_field (type0
, f
))
7657 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7659 new_type
= static_unwrap_type (field_type
);
7660 if (type
== type0
&& new_type
!= field_type
)
7662 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7663 TYPE_CODE (type
) = TYPE_CODE (type0
);
7664 INIT_CPLUS_SPECIFIC (type
);
7665 TYPE_NFIELDS (type
) = nfields
;
7666 TYPE_FIELDS (type
) = (struct field
*)
7667 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7668 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7669 sizeof (struct field
) * nfields
);
7670 TYPE_NAME (type
) = ada_type_name (type0
);
7671 TYPE_TAG_NAME (type
) = NULL
;
7672 TYPE_FIXED_INSTANCE (type
) = 1;
7673 TYPE_LENGTH (type
) = 0;
7675 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7676 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7681 /* Given an object of type TYPE whose contents are at VALADDR and
7682 whose address in memory is ADDRESS, returns a revision of TYPE,
7683 which should be a non-dynamic-sized record, in which the variant
7684 part, if any, is replaced with the appropriate branch. Looks
7685 for discriminant values in DVAL0, which can be NULL if the record
7686 contains the necessary discriminant values. */
7688 static struct type
*
7689 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7690 CORE_ADDR address
, struct value
*dval0
)
7692 struct value
*mark
= value_mark ();
7695 struct type
*branch_type
;
7696 int nfields
= TYPE_NFIELDS (type
);
7697 int variant_field
= variant_field_index (type
);
7699 if (variant_field
== -1)
7703 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7707 rtype
= alloc_type_copy (type
);
7708 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7709 INIT_CPLUS_SPECIFIC (rtype
);
7710 TYPE_NFIELDS (rtype
) = nfields
;
7711 TYPE_FIELDS (rtype
) =
7712 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7713 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7714 sizeof (struct field
) * nfields
);
7715 TYPE_NAME (rtype
) = ada_type_name (type
);
7716 TYPE_TAG_NAME (rtype
) = NULL
;
7717 TYPE_FIXED_INSTANCE (rtype
) = 1;
7718 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7720 branch_type
= to_fixed_variant_branch_type
7721 (TYPE_FIELD_TYPE (type
, variant_field
),
7722 cond_offset_host (valaddr
,
7723 TYPE_FIELD_BITPOS (type
, variant_field
)
7725 cond_offset_target (address
,
7726 TYPE_FIELD_BITPOS (type
, variant_field
)
7727 / TARGET_CHAR_BIT
), dval
);
7728 if (branch_type
== NULL
)
7732 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7733 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7734 TYPE_NFIELDS (rtype
) -= 1;
7738 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7739 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7740 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7741 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7743 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7745 value_free_to_mark (mark
);
7749 /* An ordinary record type (with fixed-length fields) that describes
7750 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7751 beginning of this section]. Any necessary discriminants' values
7752 should be in DVAL, a record value; it may be NULL if the object
7753 at ADDR itself contains any necessary discriminant values.
7754 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7755 values from the record are needed. Except in the case that DVAL,
7756 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7757 unchecked) is replaced by a particular branch of the variant.
7759 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7760 is questionable and may be removed. It can arise during the
7761 processing of an unconstrained-array-of-record type where all the
7762 variant branches have exactly the same size. This is because in
7763 such cases, the compiler does not bother to use the XVS convention
7764 when encoding the record. I am currently dubious of this
7765 shortcut and suspect the compiler should be altered. FIXME. */
7767 static struct type
*
7768 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7769 CORE_ADDR address
, struct value
*dval
)
7771 struct type
*templ_type
;
7773 if (TYPE_FIXED_INSTANCE (type0
))
7776 templ_type
= dynamic_template_type (type0
);
7778 if (templ_type
!= NULL
)
7779 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7780 else if (variant_field_index (type0
) >= 0)
7782 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7784 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7789 TYPE_FIXED_INSTANCE (type0
) = 1;
7795 /* An ordinary record type (with fixed-length fields) that describes
7796 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7797 union type. Any necessary discriminants' values should be in DVAL,
7798 a record value. That is, this routine selects the appropriate
7799 branch of the union at ADDR according to the discriminant value
7800 indicated in the union's type name. Returns VAR_TYPE0 itself if
7801 it represents a variant subject to a pragma Unchecked_Union. */
7803 static struct type
*
7804 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7805 CORE_ADDR address
, struct value
*dval
)
7808 struct type
*templ_type
;
7809 struct type
*var_type
;
7811 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7812 var_type
= TYPE_TARGET_TYPE (var_type0
);
7814 var_type
= var_type0
;
7816 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7818 if (templ_type
!= NULL
)
7819 var_type
= templ_type
;
7821 if (is_unchecked_variant (var_type
, value_type (dval
)))
7824 ada_which_variant_applies (var_type
,
7825 value_type (dval
), value_contents (dval
));
7828 return empty_record (var_type
);
7829 else if (is_dynamic_field (var_type
, which
))
7830 return to_fixed_record_type
7831 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7832 valaddr
, address
, dval
);
7833 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7835 to_fixed_record_type
7836 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7838 return TYPE_FIELD_TYPE (var_type
, which
);
7841 /* Assuming that TYPE0 is an array type describing the type of a value
7842 at ADDR, and that DVAL describes a record containing any
7843 discriminants used in TYPE0, returns a type for the value that
7844 contains no dynamic components (that is, no components whose sizes
7845 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7846 true, gives an error message if the resulting type's size is over
7849 static struct type
*
7850 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7853 struct type
*index_type_desc
;
7854 struct type
*result
;
7855 int constrained_packed_array_p
;
7857 type0
= ada_check_typedef (type0
);
7858 if (TYPE_FIXED_INSTANCE (type0
))
7861 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7862 if (constrained_packed_array_p
)
7863 type0
= decode_constrained_packed_array_type (type0
);
7865 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7866 ada_fixup_array_indexes_type (index_type_desc
);
7867 if (index_type_desc
== NULL
)
7869 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7871 /* NOTE: elt_type---the fixed version of elt_type0---should never
7872 depend on the contents of the array in properly constructed
7874 /* Create a fixed version of the array element type.
7875 We're not providing the address of an element here,
7876 and thus the actual object value cannot be inspected to do
7877 the conversion. This should not be a problem, since arrays of
7878 unconstrained objects are not allowed. In particular, all
7879 the elements of an array of a tagged type should all be of
7880 the same type specified in the debugging info. No need to
7881 consult the object tag. */
7882 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7884 /* Make sure we always create a new array type when dealing with
7885 packed array types, since we're going to fix-up the array
7886 type length and element bitsize a little further down. */
7887 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7890 result
= create_array_type (alloc_type_copy (type0
),
7891 elt_type
, TYPE_INDEX_TYPE (type0
));
7896 struct type
*elt_type0
;
7899 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7900 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7902 /* NOTE: result---the fixed version of elt_type0---should never
7903 depend on the contents of the array in properly constructed
7905 /* Create a fixed version of the array element type.
7906 We're not providing the address of an element here,
7907 and thus the actual object value cannot be inspected to do
7908 the conversion. This should not be a problem, since arrays of
7909 unconstrained objects are not allowed. In particular, all
7910 the elements of an array of a tagged type should all be of
7911 the same type specified in the debugging info. No need to
7912 consult the object tag. */
7914 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7917 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7919 struct type
*range_type
=
7920 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
7922 result
= create_array_type (alloc_type_copy (elt_type0
),
7923 result
, range_type
);
7924 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7926 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7927 error (_("array type with dynamic size is larger than varsize-limit"));
7930 /* We want to preserve the type name. This can be useful when
7931 trying to get the type name of a value that has already been
7932 printed (for instance, if the user did "print VAR; whatis $". */
7933 TYPE_NAME (result
) = TYPE_NAME (type0
);
7935 if (constrained_packed_array_p
)
7937 /* So far, the resulting type has been created as if the original
7938 type was a regular (non-packed) array type. As a result, the
7939 bitsize of the array elements needs to be set again, and the array
7940 length needs to be recomputed based on that bitsize. */
7941 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7942 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7944 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7945 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7946 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7947 TYPE_LENGTH (result
)++;
7950 TYPE_FIXED_INSTANCE (result
) = 1;
7955 /* A standard type (containing no dynamically sized components)
7956 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7957 DVAL describes a record containing any discriminants used in TYPE0,
7958 and may be NULL if there are none, or if the object of type TYPE at
7959 ADDRESS or in VALADDR contains these discriminants.
7961 If CHECK_TAG is not null, in the case of tagged types, this function
7962 attempts to locate the object's tag and use it to compute the actual
7963 type. However, when ADDRESS is null, we cannot use it to determine the
7964 location of the tag, and therefore compute the tagged type's actual type.
7965 So we return the tagged type without consulting the tag. */
7967 static struct type
*
7968 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7969 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7971 type
= ada_check_typedef (type
);
7972 switch (TYPE_CODE (type
))
7976 case TYPE_CODE_STRUCT
:
7978 struct type
*static_type
= to_static_fixed_type (type
);
7979 struct type
*fixed_record_type
=
7980 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7982 /* If STATIC_TYPE is a tagged type and we know the object's address,
7983 then we can determine its tag, and compute the object's actual
7984 type from there. Note that we have to use the fixed record
7985 type (the parent part of the record may have dynamic fields
7986 and the way the location of _tag is expressed may depend on
7989 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7991 struct type
*real_type
=
7992 type_from_tag (value_tag_from_contents_and_address
7997 if (real_type
!= NULL
)
7998 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
8001 /* Check to see if there is a parallel ___XVZ variable.
8002 If there is, then it provides the actual size of our type. */
8003 else if (ada_type_name (fixed_record_type
) != NULL
)
8005 const char *name
= ada_type_name (fixed_record_type
);
8006 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
8010 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
8011 size
= get_int_var_value (xvz_name
, &xvz_found
);
8012 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8014 fixed_record_type
= copy_type (fixed_record_type
);
8015 TYPE_LENGTH (fixed_record_type
) = size
;
8017 /* The FIXED_RECORD_TYPE may have be a stub. We have
8018 observed this when the debugging info is STABS, and
8019 apparently it is something that is hard to fix.
8021 In practice, we don't need the actual type definition
8022 at all, because the presence of the XVZ variable allows us
8023 to assume that there must be a XVS type as well, which we
8024 should be able to use later, when we need the actual type
8027 In the meantime, pretend that the "fixed" type we are
8028 returning is NOT a stub, because this can cause trouble
8029 when using this type to create new types targeting it.
8030 Indeed, the associated creation routines often check
8031 whether the target type is a stub and will try to replace
8032 it, thus using a type with the wrong size. This, in turn,
8033 might cause the new type to have the wrong size too.
8034 Consider the case of an array, for instance, where the size
8035 of the array is computed from the number of elements in
8036 our array multiplied by the size of its element. */
8037 TYPE_STUB (fixed_record_type
) = 0;
8040 return fixed_record_type
;
8042 case TYPE_CODE_ARRAY
:
8043 return to_fixed_array_type (type
, dval
, 1);
8044 case TYPE_CODE_UNION
:
8048 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8052 /* The same as ada_to_fixed_type_1, except that it preserves the type
8053 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8055 The typedef layer needs be preserved in order to differentiate between
8056 arrays and array pointers when both types are implemented using the same
8057 fat pointer. In the array pointer case, the pointer is encoded as
8058 a typedef of the pointer type. For instance, considering:
8060 type String_Access is access String;
8061 S1 : String_Access := null;
8063 To the debugger, S1 is defined as a typedef of type String. But
8064 to the user, it is a pointer. So if the user tries to print S1,
8065 we should not dereference the array, but print the array address
8068 If we didn't preserve the typedef layer, we would lose the fact that
8069 the type is to be presented as a pointer (needs de-reference before
8070 being printed). And we would also use the source-level type name. */
8073 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8074 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8077 struct type
*fixed_type
=
8078 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8080 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8081 then preserve the typedef layer.
8083 Implementation note: We can only check the main-type portion of
8084 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8085 from TYPE now returns a type that has the same instance flags
8086 as TYPE. For instance, if TYPE is a "typedef const", and its
8087 target type is a "struct", then the typedef elimination will return
8088 a "const" version of the target type. See check_typedef for more
8089 details about how the typedef layer elimination is done.
8091 brobecker/2010-11-19: It seems to me that the only case where it is
8092 useful to preserve the typedef layer is when dealing with fat pointers.
8093 Perhaps, we could add a check for that and preserve the typedef layer
8094 only in that situation. But this seems unecessary so far, probably
8095 because we call check_typedef/ada_check_typedef pretty much everywhere.
8097 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8098 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8099 == TYPE_MAIN_TYPE (fixed_type
)))
8105 /* A standard (static-sized) type corresponding as well as possible to
8106 TYPE0, but based on no runtime data. */
8108 static struct type
*
8109 to_static_fixed_type (struct type
*type0
)
8116 if (TYPE_FIXED_INSTANCE (type0
))
8119 type0
= ada_check_typedef (type0
);
8121 switch (TYPE_CODE (type0
))
8125 case TYPE_CODE_STRUCT
:
8126 type
= dynamic_template_type (type0
);
8128 return template_to_static_fixed_type (type
);
8130 return template_to_static_fixed_type (type0
);
8131 case TYPE_CODE_UNION
:
8132 type
= ada_find_parallel_type (type0
, "___XVU");
8134 return template_to_static_fixed_type (type
);
8136 return template_to_static_fixed_type (type0
);
8140 /* A static approximation of TYPE with all type wrappers removed. */
8142 static struct type
*
8143 static_unwrap_type (struct type
*type
)
8145 if (ada_is_aligner_type (type
))
8147 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8148 if (ada_type_name (type1
) == NULL
)
8149 TYPE_NAME (type1
) = ada_type_name (type
);
8151 return static_unwrap_type (type1
);
8155 struct type
*raw_real_type
= ada_get_base_type (type
);
8157 if (raw_real_type
== type
)
8160 return to_static_fixed_type (raw_real_type
);
8164 /* In some cases, incomplete and private types require
8165 cross-references that are not resolved as records (for example,
8167 type FooP is access Foo;
8169 type Foo is array ...;
8170 ). In these cases, since there is no mechanism for producing
8171 cross-references to such types, we instead substitute for FooP a
8172 stub enumeration type that is nowhere resolved, and whose tag is
8173 the name of the actual type. Call these types "non-record stubs". */
8175 /* A type equivalent to TYPE that is not a non-record stub, if one
8176 exists, otherwise TYPE. */
8179 ada_check_typedef (struct type
*type
)
8184 /* If our type is a typedef type of a fat pointer, then we're done.
8185 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8186 what allows us to distinguish between fat pointers that represent
8187 array types, and fat pointers that represent array access types
8188 (in both cases, the compiler implements them as fat pointers). */
8189 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8190 && is_thick_pntr (ada_typedef_target_type (type
)))
8193 CHECK_TYPEDEF (type
);
8194 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8195 || !TYPE_STUB (type
)
8196 || TYPE_TAG_NAME (type
) == NULL
)
8200 const char *name
= TYPE_TAG_NAME (type
);
8201 struct type
*type1
= ada_find_any_type (name
);
8206 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8207 stubs pointing to arrays, as we don't create symbols for array
8208 types, only for the typedef-to-array types). If that's the case,
8209 strip the typedef layer. */
8210 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8211 type1
= ada_check_typedef (type1
);
8217 /* A value representing the data at VALADDR/ADDRESS as described by
8218 type TYPE0, but with a standard (static-sized) type that correctly
8219 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8220 type, then return VAL0 [this feature is simply to avoid redundant
8221 creation of struct values]. */
8223 static struct value
*
8224 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8227 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8229 if (type
== type0
&& val0
!= NULL
)
8232 return value_from_contents_and_address (type
, 0, address
);
8235 /* A value representing VAL, but with a standard (static-sized) type
8236 that correctly describes it. Does not necessarily create a new
8240 ada_to_fixed_value (struct value
*val
)
8242 val
= unwrap_value (val
);
8243 val
= ada_to_fixed_value_create (value_type (val
),
8244 value_address (val
),
8252 /* Table mapping attribute numbers to names.
8253 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8255 static const char *attribute_names
[] = {
8273 ada_attribute_name (enum exp_opcode n
)
8275 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8276 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8278 return attribute_names
[0];
8281 /* Evaluate the 'POS attribute applied to ARG. */
8284 pos_atr (struct value
*arg
)
8286 struct value
*val
= coerce_ref (arg
);
8287 struct type
*type
= value_type (val
);
8289 if (!discrete_type_p (type
))
8290 error (_("'POS only defined on discrete types"));
8292 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8295 LONGEST v
= value_as_long (val
);
8297 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8299 if (v
== TYPE_FIELD_ENUMVAL (type
, i
))
8302 error (_("enumeration value is invalid: can't find 'POS"));
8305 return value_as_long (val
);
8308 static struct value
*
8309 value_pos_atr (struct type
*type
, struct value
*arg
)
8311 return value_from_longest (type
, pos_atr (arg
));
8314 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8316 static struct value
*
8317 value_val_atr (struct type
*type
, struct value
*arg
)
8319 if (!discrete_type_p (type
))
8320 error (_("'VAL only defined on discrete types"));
8321 if (!integer_type_p (value_type (arg
)))
8322 error (_("'VAL requires integral argument"));
8324 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8326 long pos
= value_as_long (arg
);
8328 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8329 error (_("argument to 'VAL out of range"));
8330 return value_from_longest (type
, TYPE_FIELD_ENUMVAL (type
, pos
));
8333 return value_from_longest (type
, value_as_long (arg
));
8339 /* True if TYPE appears to be an Ada character type.
8340 [At the moment, this is true only for Character and Wide_Character;
8341 It is a heuristic test that could stand improvement]. */
8344 ada_is_character_type (struct type
*type
)
8348 /* If the type code says it's a character, then assume it really is,
8349 and don't check any further. */
8350 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8353 /* Otherwise, assume it's a character type iff it is a discrete type
8354 with a known character type name. */
8355 name
= ada_type_name (type
);
8356 return (name
!= NULL
8357 && (TYPE_CODE (type
) == TYPE_CODE_INT
8358 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8359 && (strcmp (name
, "character") == 0
8360 || strcmp (name
, "wide_character") == 0
8361 || strcmp (name
, "wide_wide_character") == 0
8362 || strcmp (name
, "unsigned char") == 0));
8365 /* True if TYPE appears to be an Ada string type. */
8368 ada_is_string_type (struct type
*type
)
8370 type
= ada_check_typedef (type
);
8372 && TYPE_CODE (type
) != TYPE_CODE_PTR
8373 && (ada_is_simple_array_type (type
)
8374 || ada_is_array_descriptor_type (type
))
8375 && ada_array_arity (type
) == 1)
8377 struct type
*elttype
= ada_array_element_type (type
, 1);
8379 return ada_is_character_type (elttype
);
8385 /* The compiler sometimes provides a parallel XVS type for a given
8386 PAD type. Normally, it is safe to follow the PAD type directly,
8387 but older versions of the compiler have a bug that causes the offset
8388 of its "F" field to be wrong. Following that field in that case
8389 would lead to incorrect results, but this can be worked around
8390 by ignoring the PAD type and using the associated XVS type instead.
8392 Set to True if the debugger should trust the contents of PAD types.
8393 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8394 static int trust_pad_over_xvs
= 1;
8396 /* True if TYPE is a struct type introduced by the compiler to force the
8397 alignment of a value. Such types have a single field with a
8398 distinctive name. */
8401 ada_is_aligner_type (struct type
*type
)
8403 type
= ada_check_typedef (type
);
8405 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8408 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8409 && TYPE_NFIELDS (type
) == 1
8410 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8413 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8414 the parallel type. */
8417 ada_get_base_type (struct type
*raw_type
)
8419 struct type
*real_type_namer
;
8420 struct type
*raw_real_type
;
8422 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8425 if (ada_is_aligner_type (raw_type
))
8426 /* The encoding specifies that we should always use the aligner type.
8427 So, even if this aligner type has an associated XVS type, we should
8430 According to the compiler gurus, an XVS type parallel to an aligner
8431 type may exist because of a stabs limitation. In stabs, aligner
8432 types are empty because the field has a variable-sized type, and
8433 thus cannot actually be used as an aligner type. As a result,
8434 we need the associated parallel XVS type to decode the type.
8435 Since the policy in the compiler is to not change the internal
8436 representation based on the debugging info format, we sometimes
8437 end up having a redundant XVS type parallel to the aligner type. */
8440 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8441 if (real_type_namer
== NULL
8442 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8443 || TYPE_NFIELDS (real_type_namer
) != 1)
8446 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8448 /* This is an older encoding form where the base type needs to be
8449 looked up by name. We prefer the newer enconding because it is
8451 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8452 if (raw_real_type
== NULL
)
8455 return raw_real_type
;
8458 /* The field in our XVS type is a reference to the base type. */
8459 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8462 /* The type of value designated by TYPE, with all aligners removed. */
8465 ada_aligned_type (struct type
*type
)
8467 if (ada_is_aligner_type (type
))
8468 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8470 return ada_get_base_type (type
);
8474 /* The address of the aligned value in an object at address VALADDR
8475 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8478 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8480 if (ada_is_aligner_type (type
))
8481 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8483 TYPE_FIELD_BITPOS (type
,
8484 0) / TARGET_CHAR_BIT
);
8491 /* The printed representation of an enumeration literal with encoded
8492 name NAME. The value is good to the next call of ada_enum_name. */
8494 ada_enum_name (const char *name
)
8496 static char *result
;
8497 static size_t result_len
= 0;
8500 /* First, unqualify the enumeration name:
8501 1. Search for the last '.' character. If we find one, then skip
8502 all the preceding characters, the unqualified name starts
8503 right after that dot.
8504 2. Otherwise, we may be debugging on a target where the compiler
8505 translates dots into "__". Search forward for double underscores,
8506 but stop searching when we hit an overloading suffix, which is
8507 of the form "__" followed by digits. */
8509 tmp
= strrchr (name
, '.');
8514 while ((tmp
= strstr (name
, "__")) != NULL
)
8516 if (isdigit (tmp
[2]))
8527 if (name
[1] == 'U' || name
[1] == 'W')
8529 if (sscanf (name
+ 2, "%x", &v
) != 1)
8535 GROW_VECT (result
, result_len
, 16);
8536 if (isascii (v
) && isprint (v
))
8537 xsnprintf (result
, result_len
, "'%c'", v
);
8538 else if (name
[1] == 'U')
8539 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8541 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
8547 tmp
= strstr (name
, "__");
8549 tmp
= strstr (name
, "$");
8552 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8553 strncpy (result
, name
, tmp
- name
);
8554 result
[tmp
- name
] = '\0';
8562 /* Evaluate the subexpression of EXP starting at *POS as for
8563 evaluate_type, updating *POS to point just past the evaluated
8566 static struct value
*
8567 evaluate_subexp_type (struct expression
*exp
, int *pos
)
8569 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8572 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8575 static struct value
*
8576 unwrap_value (struct value
*val
)
8578 struct type
*type
= ada_check_typedef (value_type (val
));
8580 if (ada_is_aligner_type (type
))
8582 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
8583 struct type
*val_type
= ada_check_typedef (value_type (v
));
8585 if (ada_type_name (val_type
) == NULL
)
8586 TYPE_NAME (val_type
) = ada_type_name (type
);
8588 return unwrap_value (v
);
8592 struct type
*raw_real_type
=
8593 ada_check_typedef (ada_get_base_type (type
));
8595 /* If there is no parallel XVS or XVE type, then the value is
8596 already unwrapped. Return it without further modification. */
8597 if ((type
== raw_real_type
)
8598 && ada_find_parallel_type (type
, "___XVE") == NULL
)
8602 coerce_unspec_val_to_type
8603 (val
, ada_to_fixed_type (raw_real_type
, 0,
8604 value_address (val
),
8609 static struct value
*
8610 cast_to_fixed (struct type
*type
, struct value
*arg
)
8614 if (type
== value_type (arg
))
8616 else if (ada_is_fixed_point_type (value_type (arg
)))
8617 val
= ada_float_to_fixed (type
,
8618 ada_fixed_to_float (value_type (arg
),
8619 value_as_long (arg
)));
8622 DOUBLEST argd
= value_as_double (arg
);
8624 val
= ada_float_to_fixed (type
, argd
);
8627 return value_from_longest (type
, val
);
8630 static struct value
*
8631 cast_from_fixed (struct type
*type
, struct value
*arg
)
8633 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
8634 value_as_long (arg
));
8636 return value_from_double (type
, val
);
8639 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8640 return the converted value. */
8642 static struct value
*
8643 coerce_for_assign (struct type
*type
, struct value
*val
)
8645 struct type
*type2
= value_type (val
);
8650 type2
= ada_check_typedef (type2
);
8651 type
= ada_check_typedef (type
);
8653 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8654 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8656 val
= ada_value_ind (val
);
8657 type2
= value_type (val
);
8660 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8661 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8663 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8664 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8665 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8666 error (_("Incompatible types in assignment"));
8667 deprecated_set_value_type (val
, type
);
8672 static struct value
*
8673 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8676 struct type
*type1
, *type2
;
8679 arg1
= coerce_ref (arg1
);
8680 arg2
= coerce_ref (arg2
);
8681 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
8682 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
8684 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8685 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8686 return value_binop (arg1
, arg2
, op
);
8695 return value_binop (arg1
, arg2
, op
);
8698 v2
= value_as_long (arg2
);
8700 error (_("second operand of %s must not be zero."), op_string (op
));
8702 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8703 return value_binop (arg1
, arg2
, op
);
8705 v1
= value_as_long (arg1
);
8710 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8711 v
+= v
> 0 ? -1 : 1;
8719 /* Should not reach this point. */
8723 val
= allocate_value (type1
);
8724 store_unsigned_integer (value_contents_raw (val
),
8725 TYPE_LENGTH (value_type (val
)),
8726 gdbarch_byte_order (get_type_arch (type1
)), v
);
8731 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8733 if (ada_is_direct_array_type (value_type (arg1
))
8734 || ada_is_direct_array_type (value_type (arg2
)))
8736 /* Automatically dereference any array reference before
8737 we attempt to perform the comparison. */
8738 arg1
= ada_coerce_ref (arg1
);
8739 arg2
= ada_coerce_ref (arg2
);
8741 arg1
= ada_coerce_to_simple_array (arg1
);
8742 arg2
= ada_coerce_to_simple_array (arg2
);
8743 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8744 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8745 error (_("Attempt to compare array with non-array"));
8746 /* FIXME: The following works only for types whose
8747 representations use all bits (no padding or undefined bits)
8748 and do not have user-defined equality. */
8750 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8751 && memcmp (value_contents (arg1
), value_contents (arg2
),
8752 TYPE_LENGTH (value_type (arg1
))) == 0;
8754 return value_equal (arg1
, arg2
);
8757 /* Total number of component associations in the aggregate starting at
8758 index PC in EXP. Assumes that index PC is the start of an
8762 num_component_specs (struct expression
*exp
, int pc
)
8766 m
= exp
->elts
[pc
+ 1].longconst
;
8769 for (i
= 0; i
< m
; i
+= 1)
8771 switch (exp
->elts
[pc
].opcode
)
8777 n
+= exp
->elts
[pc
+ 1].longconst
;
8780 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8785 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8786 component of LHS (a simple array or a record), updating *POS past
8787 the expression, assuming that LHS is contained in CONTAINER. Does
8788 not modify the inferior's memory, nor does it modify LHS (unless
8789 LHS == CONTAINER). */
8792 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8793 struct expression
*exp
, int *pos
)
8795 struct value
*mark
= value_mark ();
8798 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8800 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8801 struct value
*index_val
= value_from_longest (index_type
, index
);
8803 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8807 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8808 elt
= ada_to_fixed_value (elt
);
8811 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8812 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8814 value_assign_to_component (container
, elt
,
8815 ada_evaluate_subexp (NULL
, exp
, pos
,
8818 value_free_to_mark (mark
);
8821 /* Assuming that LHS represents an lvalue having a record or array
8822 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8823 of that aggregate's value to LHS, advancing *POS past the
8824 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8825 lvalue containing LHS (possibly LHS itself). Does not modify
8826 the inferior's memory, nor does it modify the contents of
8827 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8829 static struct value
*
8830 assign_aggregate (struct value
*container
,
8831 struct value
*lhs
, struct expression
*exp
,
8832 int *pos
, enum noside noside
)
8834 struct type
*lhs_type
;
8835 int n
= exp
->elts
[*pos
+1].longconst
;
8836 LONGEST low_index
, high_index
;
8839 int max_indices
, num_indices
;
8840 int is_array_aggregate
;
8844 if (noside
!= EVAL_NORMAL
)
8846 for (i
= 0; i
< n
; i
+= 1)
8847 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8851 container
= ada_coerce_ref (container
);
8852 if (ada_is_direct_array_type (value_type (container
)))
8853 container
= ada_coerce_to_simple_array (container
);
8854 lhs
= ada_coerce_ref (lhs
);
8855 if (!deprecated_value_modifiable (lhs
))
8856 error (_("Left operand of assignment is not a modifiable lvalue."));
8858 lhs_type
= value_type (lhs
);
8859 if (ada_is_direct_array_type (lhs_type
))
8861 lhs
= ada_coerce_to_simple_array (lhs
);
8862 lhs_type
= value_type (lhs
);
8863 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8864 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8865 is_array_aggregate
= 1;
8867 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8870 high_index
= num_visible_fields (lhs_type
) - 1;
8871 is_array_aggregate
= 0;
8874 error (_("Left-hand side must be array or record."));
8876 num_specs
= num_component_specs (exp
, *pos
- 3);
8877 max_indices
= 4 * num_specs
+ 4;
8878 indices
= alloca (max_indices
* sizeof (indices
[0]));
8879 indices
[0] = indices
[1] = low_index
- 1;
8880 indices
[2] = indices
[3] = high_index
+ 1;
8883 for (i
= 0; i
< n
; i
+= 1)
8885 switch (exp
->elts
[*pos
].opcode
)
8888 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8889 &num_indices
, max_indices
,
8890 low_index
, high_index
);
8893 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8894 &num_indices
, max_indices
,
8895 low_index
, high_index
);
8899 error (_("Misplaced 'others' clause"));
8900 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8901 num_indices
, low_index
, high_index
);
8904 error (_("Internal error: bad aggregate clause"));
8911 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8912 construct at *POS, updating *POS past the construct, given that
8913 the positions are relative to lower bound LOW, where HIGH is the
8914 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8915 updating *NUM_INDICES as needed. CONTAINER is as for
8916 assign_aggregate. */
8918 aggregate_assign_positional (struct value
*container
,
8919 struct value
*lhs
, struct expression
*exp
,
8920 int *pos
, LONGEST
*indices
, int *num_indices
,
8921 int max_indices
, LONGEST low
, LONGEST high
)
8923 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8925 if (ind
- 1 == high
)
8926 warning (_("Extra components in aggregate ignored."));
8929 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8931 assign_component (container
, lhs
, ind
, exp
, pos
);
8934 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8937 /* Assign into the components of LHS indexed by the OP_CHOICES
8938 construct at *POS, updating *POS past the construct, given that
8939 the allowable indices are LOW..HIGH. Record the indices assigned
8940 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8941 needed. CONTAINER is as for assign_aggregate. */
8943 aggregate_assign_from_choices (struct value
*container
,
8944 struct value
*lhs
, struct expression
*exp
,
8945 int *pos
, LONGEST
*indices
, int *num_indices
,
8946 int max_indices
, LONGEST low
, LONGEST high
)
8949 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8950 int choice_pos
, expr_pc
;
8951 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8953 choice_pos
= *pos
+= 3;
8955 for (j
= 0; j
< n_choices
; j
+= 1)
8956 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8958 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8960 for (j
= 0; j
< n_choices
; j
+= 1)
8962 LONGEST lower
, upper
;
8963 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8965 if (op
== OP_DISCRETE_RANGE
)
8968 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8970 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8975 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8987 name
= &exp
->elts
[choice_pos
+ 2].string
;
8990 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8993 error (_("Invalid record component association."));
8995 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8997 if (! find_struct_field (name
, value_type (lhs
), 0,
8998 NULL
, NULL
, NULL
, NULL
, &ind
))
8999 error (_("Unknown component name: %s."), name
);
9000 lower
= upper
= ind
;
9003 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
9004 error (_("Index in component association out of bounds."));
9006 add_component_interval (lower
, upper
, indices
, num_indices
,
9008 while (lower
<= upper
)
9013 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9019 /* Assign the value of the expression in the OP_OTHERS construct in
9020 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9021 have not been previously assigned. The index intervals already assigned
9022 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9023 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9025 aggregate_assign_others (struct value
*container
,
9026 struct value
*lhs
, struct expression
*exp
,
9027 int *pos
, LONGEST
*indices
, int num_indices
,
9028 LONGEST low
, LONGEST high
)
9031 int expr_pc
= *pos
+ 1;
9033 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9037 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9042 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9045 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9048 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9049 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9050 modifying *SIZE as needed. It is an error if *SIZE exceeds
9051 MAX_SIZE. The resulting intervals do not overlap. */
9053 add_component_interval (LONGEST low
, LONGEST high
,
9054 LONGEST
* indices
, int *size
, int max_size
)
9058 for (i
= 0; i
< *size
; i
+= 2) {
9059 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9063 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9064 if (high
< indices
[kh
])
9066 if (low
< indices
[i
])
9068 indices
[i
+ 1] = indices
[kh
- 1];
9069 if (high
> indices
[i
+ 1])
9070 indices
[i
+ 1] = high
;
9071 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9072 *size
-= kh
- i
- 2;
9075 else if (high
< indices
[i
])
9079 if (*size
== max_size
)
9080 error (_("Internal error: miscounted aggregate components."));
9082 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9083 indices
[j
] = indices
[j
- 2];
9085 indices
[i
+ 1] = high
;
9088 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9091 static struct value
*
9092 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9094 if (type
== ada_check_typedef (value_type (arg2
)))
9097 if (ada_is_fixed_point_type (type
))
9098 return (cast_to_fixed (type
, arg2
));
9100 if (ada_is_fixed_point_type (value_type (arg2
)))
9101 return cast_from_fixed (type
, arg2
);
9103 return value_cast (type
, arg2
);
9106 /* Evaluating Ada expressions, and printing their result.
9107 ------------------------------------------------------
9112 We usually evaluate an Ada expression in order to print its value.
9113 We also evaluate an expression in order to print its type, which
9114 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9115 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9116 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9117 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9120 Evaluating expressions is a little more complicated for Ada entities
9121 than it is for entities in languages such as C. The main reason for
9122 this is that Ada provides types whose definition might be dynamic.
9123 One example of such types is variant records. Or another example
9124 would be an array whose bounds can only be known at run time.
9126 The following description is a general guide as to what should be
9127 done (and what should NOT be done) in order to evaluate an expression
9128 involving such types, and when. This does not cover how the semantic
9129 information is encoded by GNAT as this is covered separatly. For the
9130 document used as the reference for the GNAT encoding, see exp_dbug.ads
9131 in the GNAT sources.
9133 Ideally, we should embed each part of this description next to its
9134 associated code. Unfortunately, the amount of code is so vast right
9135 now that it's hard to see whether the code handling a particular
9136 situation might be duplicated or not. One day, when the code is
9137 cleaned up, this guide might become redundant with the comments
9138 inserted in the code, and we might want to remove it.
9140 2. ``Fixing'' an Entity, the Simple Case:
9141 -----------------------------------------
9143 When evaluating Ada expressions, the tricky issue is that they may
9144 reference entities whose type contents and size are not statically
9145 known. Consider for instance a variant record:
9147 type Rec (Empty : Boolean := True) is record
9150 when False => Value : Integer;
9153 Yes : Rec := (Empty => False, Value => 1);
9154 No : Rec := (empty => True);
9156 The size and contents of that record depends on the value of the
9157 descriminant (Rec.Empty). At this point, neither the debugging
9158 information nor the associated type structure in GDB are able to
9159 express such dynamic types. So what the debugger does is to create
9160 "fixed" versions of the type that applies to the specific object.
9161 We also informally refer to this opperation as "fixing" an object,
9162 which means creating its associated fixed type.
9164 Example: when printing the value of variable "Yes" above, its fixed
9165 type would look like this:
9172 On the other hand, if we printed the value of "No", its fixed type
9179 Things become a little more complicated when trying to fix an entity
9180 with a dynamic type that directly contains another dynamic type,
9181 such as an array of variant records, for instance. There are
9182 two possible cases: Arrays, and records.
9184 3. ``Fixing'' Arrays:
9185 ---------------------
9187 The type structure in GDB describes an array in terms of its bounds,
9188 and the type of its elements. By design, all elements in the array
9189 have the same type and we cannot represent an array of variant elements
9190 using the current type structure in GDB. When fixing an array,
9191 we cannot fix the array element, as we would potentially need one
9192 fixed type per element of the array. As a result, the best we can do
9193 when fixing an array is to produce an array whose bounds and size
9194 are correct (allowing us to read it from memory), but without having
9195 touched its element type. Fixing each element will be done later,
9196 when (if) necessary.
9198 Arrays are a little simpler to handle than records, because the same
9199 amount of memory is allocated for each element of the array, even if
9200 the amount of space actually used by each element differs from element
9201 to element. Consider for instance the following array of type Rec:
9203 type Rec_Array is array (1 .. 2) of Rec;
9205 The actual amount of memory occupied by each element might be different
9206 from element to element, depending on the value of their discriminant.
9207 But the amount of space reserved for each element in the array remains
9208 fixed regardless. So we simply need to compute that size using
9209 the debugging information available, from which we can then determine
9210 the array size (we multiply the number of elements of the array by
9211 the size of each element).
9213 The simplest case is when we have an array of a constrained element
9214 type. For instance, consider the following type declarations:
9216 type Bounded_String (Max_Size : Integer) is
9218 Buffer : String (1 .. Max_Size);
9220 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9222 In this case, the compiler describes the array as an array of
9223 variable-size elements (identified by its XVS suffix) for which
9224 the size can be read in the parallel XVZ variable.
9226 In the case of an array of an unconstrained element type, the compiler
9227 wraps the array element inside a private PAD type. This type should not
9228 be shown to the user, and must be "unwrap"'ed before printing. Note
9229 that we also use the adjective "aligner" in our code to designate
9230 these wrapper types.
9232 In some cases, the size allocated for each element is statically
9233 known. In that case, the PAD type already has the correct size,
9234 and the array element should remain unfixed.
9236 But there are cases when this size is not statically known.
9237 For instance, assuming that "Five" is an integer variable:
9239 type Dynamic is array (1 .. Five) of Integer;
9240 type Wrapper (Has_Length : Boolean := False) is record
9243 when True => Length : Integer;
9247 type Wrapper_Array is array (1 .. 2) of Wrapper;
9249 Hello : Wrapper_Array := (others => (Has_Length => True,
9250 Data => (others => 17),
9254 The debugging info would describe variable Hello as being an
9255 array of a PAD type. The size of that PAD type is not statically
9256 known, but can be determined using a parallel XVZ variable.
9257 In that case, a copy of the PAD type with the correct size should
9258 be used for the fixed array.
9260 3. ``Fixing'' record type objects:
9261 ----------------------------------
9263 Things are slightly different from arrays in the case of dynamic
9264 record types. In this case, in order to compute the associated
9265 fixed type, we need to determine the size and offset of each of
9266 its components. This, in turn, requires us to compute the fixed
9267 type of each of these components.
9269 Consider for instance the example:
9271 type Bounded_String (Max_Size : Natural) is record
9272 Str : String (1 .. Max_Size);
9275 My_String : Bounded_String (Max_Size => 10);
9277 In that case, the position of field "Length" depends on the size
9278 of field Str, which itself depends on the value of the Max_Size
9279 discriminant. In order to fix the type of variable My_String,
9280 we need to fix the type of field Str. Therefore, fixing a variant
9281 record requires us to fix each of its components.
9283 However, if a component does not have a dynamic size, the component
9284 should not be fixed. In particular, fields that use a PAD type
9285 should not fixed. Here is an example where this might happen
9286 (assuming type Rec above):
9288 type Container (Big : Boolean) is record
9292 when True => Another : Integer;
9296 My_Container : Container := (Big => False,
9297 First => (Empty => True),
9300 In that example, the compiler creates a PAD type for component First,
9301 whose size is constant, and then positions the component After just
9302 right after it. The offset of component After is therefore constant
9305 The debugger computes the position of each field based on an algorithm
9306 that uses, among other things, the actual position and size of the field
9307 preceding it. Let's now imagine that the user is trying to print
9308 the value of My_Container. If the type fixing was recursive, we would
9309 end up computing the offset of field After based on the size of the
9310 fixed version of field First. And since in our example First has
9311 only one actual field, the size of the fixed type is actually smaller
9312 than the amount of space allocated to that field, and thus we would
9313 compute the wrong offset of field After.
9315 To make things more complicated, we need to watch out for dynamic
9316 components of variant records (identified by the ___XVL suffix in
9317 the component name). Even if the target type is a PAD type, the size
9318 of that type might not be statically known. So the PAD type needs
9319 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9320 we might end up with the wrong size for our component. This can be
9321 observed with the following type declarations:
9323 type Octal is new Integer range 0 .. 7;
9324 type Octal_Array is array (Positive range <>) of Octal;
9325 pragma Pack (Octal_Array);
9327 type Octal_Buffer (Size : Positive) is record
9328 Buffer : Octal_Array (1 .. Size);
9332 In that case, Buffer is a PAD type whose size is unset and needs
9333 to be computed by fixing the unwrapped type.
9335 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9336 ----------------------------------------------------------
9338 Lastly, when should the sub-elements of an entity that remained unfixed
9339 thus far, be actually fixed?
9341 The answer is: Only when referencing that element. For instance
9342 when selecting one component of a record, this specific component
9343 should be fixed at that point in time. Or when printing the value
9344 of a record, each component should be fixed before its value gets
9345 printed. Similarly for arrays, the element of the array should be
9346 fixed when printing each element of the array, or when extracting
9347 one element out of that array. On the other hand, fixing should
9348 not be performed on the elements when taking a slice of an array!
9350 Note that one of the side-effects of miscomputing the offset and
9351 size of each field is that we end up also miscomputing the size
9352 of the containing type. This can have adverse results when computing
9353 the value of an entity. GDB fetches the value of an entity based
9354 on the size of its type, and thus a wrong size causes GDB to fetch
9355 the wrong amount of memory. In the case where the computed size is
9356 too small, GDB fetches too little data to print the value of our
9357 entiry. Results in this case as unpredicatble, as we usually read
9358 past the buffer containing the data =:-o. */
9360 /* Implement the evaluate_exp routine in the exp_descriptor structure
9361 for the Ada language. */
9363 static struct value
*
9364 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9365 int *pos
, enum noside noside
)
9370 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9373 struct value
**argvec
;
9377 op
= exp
->elts
[pc
].opcode
;
9383 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9384 arg1
= unwrap_value (arg1
);
9386 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9387 then we need to perform the conversion manually, because
9388 evaluate_subexp_standard doesn't do it. This conversion is
9389 necessary in Ada because the different kinds of float/fixed
9390 types in Ada have different representations.
9392 Similarly, we need to perform the conversion from OP_LONG
9394 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9395 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9401 struct value
*result
;
9404 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9405 /* The result type will have code OP_STRING, bashed there from
9406 OP_ARRAY. Bash it back. */
9407 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9408 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9414 type
= exp
->elts
[pc
+ 1].type
;
9415 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9416 if (noside
== EVAL_SKIP
)
9418 arg1
= ada_value_cast (type
, arg1
, noside
);
9423 type
= exp
->elts
[pc
+ 1].type
;
9424 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9427 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9428 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9430 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9431 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9433 return ada_value_assign (arg1
, arg1
);
9435 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9436 except if the lhs of our assignment is a convenience variable.
9437 In the case of assigning to a convenience variable, the lhs
9438 should be exactly the result of the evaluation of the rhs. */
9439 type
= value_type (arg1
);
9440 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9442 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9443 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9445 if (ada_is_fixed_point_type (value_type (arg1
)))
9446 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9447 else if (ada_is_fixed_point_type (value_type (arg2
)))
9449 (_("Fixed-point values must be assigned to fixed-point variables"));
9451 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9452 return ada_value_assign (arg1
, arg2
);
9455 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9456 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9457 if (noside
== EVAL_SKIP
)
9459 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9460 return (value_from_longest
9462 value_as_long (arg1
) + value_as_long (arg2
)));
9463 if ((ada_is_fixed_point_type (value_type (arg1
))
9464 || ada_is_fixed_point_type (value_type (arg2
)))
9465 && value_type (arg1
) != value_type (arg2
))
9466 error (_("Operands of fixed-point addition must have the same type"));
9467 /* Do the addition, and cast the result to the type of the first
9468 argument. We cannot cast the result to a reference type, so if
9469 ARG1 is a reference type, find its underlying type. */
9470 type
= value_type (arg1
);
9471 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9472 type
= TYPE_TARGET_TYPE (type
);
9473 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9474 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
9477 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9478 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9479 if (noside
== EVAL_SKIP
)
9481 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9482 return (value_from_longest
9484 value_as_long (arg1
) - value_as_long (arg2
)));
9485 if ((ada_is_fixed_point_type (value_type (arg1
))
9486 || ada_is_fixed_point_type (value_type (arg2
)))
9487 && value_type (arg1
) != value_type (arg2
))
9488 error (_("Operands of fixed-point subtraction "
9489 "must have the same type"));
9490 /* Do the substraction, and cast the result to the type of the first
9491 argument. We cannot cast the result to a reference type, so if
9492 ARG1 is a reference type, find its underlying type. */
9493 type
= value_type (arg1
);
9494 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9495 type
= TYPE_TARGET_TYPE (type
);
9496 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9497 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
9503 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9504 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9505 if (noside
== EVAL_SKIP
)
9507 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9509 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9510 return value_zero (value_type (arg1
), not_lval
);
9514 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
9515 if (ada_is_fixed_point_type (value_type (arg1
)))
9516 arg1
= cast_from_fixed (type
, arg1
);
9517 if (ada_is_fixed_point_type (value_type (arg2
)))
9518 arg2
= cast_from_fixed (type
, arg2
);
9519 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9520 return ada_value_binop (arg1
, arg2
, op
);
9524 case BINOP_NOTEQUAL
:
9525 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9526 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
9527 if (noside
== EVAL_SKIP
)
9529 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9533 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9534 tem
= ada_value_equal (arg1
, arg2
);
9536 if (op
== BINOP_NOTEQUAL
)
9538 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9539 return value_from_longest (type
, (LONGEST
) tem
);
9542 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9543 if (noside
== EVAL_SKIP
)
9545 else if (ada_is_fixed_point_type (value_type (arg1
)))
9546 return value_cast (value_type (arg1
), value_neg (arg1
));
9549 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9550 return value_neg (arg1
);
9553 case BINOP_LOGICAL_AND
:
9554 case BINOP_LOGICAL_OR
:
9555 case UNOP_LOGICAL_NOT
:
9560 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9561 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9562 return value_cast (type
, val
);
9565 case BINOP_BITWISE_AND
:
9566 case BINOP_BITWISE_IOR
:
9567 case BINOP_BITWISE_XOR
:
9571 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9573 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9575 return value_cast (value_type (arg1
), val
);
9581 if (noside
== EVAL_SKIP
)
9586 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
9587 /* Only encountered when an unresolved symbol occurs in a
9588 context other than a function call, in which case, it is
9590 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9591 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
9592 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9594 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
9595 /* Check to see if this is a tagged type. We also need to handle
9596 the case where the type is a reference to a tagged type, but
9597 we have to be careful to exclude pointers to tagged types.
9598 The latter should be shown as usual (as a pointer), whereas
9599 a reference should mostly be transparent to the user. */
9600 if (ada_is_tagged_type (type
, 0)
9601 || (TYPE_CODE(type
) == TYPE_CODE_REF
9602 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
9604 /* Tagged types are a little special in the fact that the real
9605 type is dynamic and can only be determined by inspecting the
9606 object's tag. This means that we need to get the object's
9607 value first (EVAL_NORMAL) and then extract the actual object
9610 Note that we cannot skip the final step where we extract
9611 the object type from its tag, because the EVAL_NORMAL phase
9612 results in dynamic components being resolved into fixed ones.
9613 This can cause problems when trying to print the type
9614 description of tagged types whose parent has a dynamic size:
9615 We use the type name of the "_parent" component in order
9616 to print the name of the ancestor type in the type description.
9617 If that component had a dynamic size, the resolution into
9618 a fixed type would result in the loss of that type name,
9619 thus preventing us from printing the name of the ancestor
9620 type in the type description. */
9621 struct type
*actual_type
;
9623 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
9624 actual_type
= type_from_tag (ada_value_tag (arg1
));
9625 if (actual_type
== NULL
)
9626 /* If, for some reason, we were unable to determine
9627 the actual type from the tag, then use the static
9628 approximation that we just computed as a fallback.
9629 This can happen if the debugging information is
9630 incomplete, for instance. */
9633 return value_zero (actual_type
, not_lval
);
9638 (to_static_fixed_type
9639 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
9644 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9645 return ada_to_fixed_value (arg1
);
9651 /* Allocate arg vector, including space for the function to be
9652 called in argvec[0] and a terminating NULL. */
9653 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9655 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
9657 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
9658 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
9659 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9660 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
9663 for (tem
= 0; tem
<= nargs
; tem
+= 1)
9664 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9667 if (noside
== EVAL_SKIP
)
9671 if (ada_is_constrained_packed_array_type
9672 (desc_base_type (value_type (argvec
[0]))))
9673 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
9674 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9675 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
9676 /* This is a packed array that has already been fixed, and
9677 therefore already coerced to a simple array. Nothing further
9680 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
9681 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9682 && VALUE_LVAL (argvec
[0]) == lval_memory
))
9683 argvec
[0] = value_addr (argvec
[0]);
9685 type
= ada_check_typedef (value_type (argvec
[0]));
9687 /* Ada allows us to implicitly dereference arrays when subscripting
9688 them. So, if this is an array typedef (encoding use for array
9689 access types encoded as fat pointers), strip it now. */
9690 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
9691 type
= ada_typedef_target_type (type
);
9693 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
9695 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
9697 case TYPE_CODE_FUNC
:
9698 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9700 case TYPE_CODE_ARRAY
:
9702 case TYPE_CODE_STRUCT
:
9703 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
9704 argvec
[0] = ada_value_ind (argvec
[0]);
9705 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9708 error (_("cannot subscript or call something of type `%s'"),
9709 ada_type_name (value_type (argvec
[0])));
9714 switch (TYPE_CODE (type
))
9716 case TYPE_CODE_FUNC
:
9717 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9719 struct type
*rtype
= TYPE_TARGET_TYPE (type
);
9721 if (TYPE_GNU_IFUNC (type
))
9722 return allocate_value (TYPE_TARGET_TYPE (rtype
));
9723 return allocate_value (rtype
);
9725 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
9726 case TYPE_CODE_INTERNAL_FUNCTION
:
9727 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9728 /* We don't know anything about what the internal
9729 function might return, but we have to return
9731 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9734 return call_internal_function (exp
->gdbarch
, exp
->language_defn
,
9735 argvec
[0], nargs
, argvec
+ 1);
9737 case TYPE_CODE_STRUCT
:
9741 arity
= ada_array_arity (type
);
9742 type
= ada_array_element_type (type
, nargs
);
9744 error (_("cannot subscript or call a record"));
9746 error (_("wrong number of subscripts; expecting %d"), arity
);
9747 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9748 return value_zero (ada_aligned_type (type
), lval_memory
);
9750 unwrap_value (ada_value_subscript
9751 (argvec
[0], nargs
, argvec
+ 1));
9753 case TYPE_CODE_ARRAY
:
9754 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9756 type
= ada_array_element_type (type
, nargs
);
9758 error (_("element type of array unknown"));
9760 return value_zero (ada_aligned_type (type
), lval_memory
);
9763 unwrap_value (ada_value_subscript
9764 (ada_coerce_to_simple_array (argvec
[0]),
9765 nargs
, argvec
+ 1));
9766 case TYPE_CODE_PTR
: /* Pointer to array */
9767 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9768 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9770 type
= ada_array_element_type (type
, nargs
);
9772 error (_("element type of array unknown"));
9774 return value_zero (ada_aligned_type (type
), lval_memory
);
9777 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9778 nargs
, argvec
+ 1));
9781 error (_("Attempt to index or call something other than an "
9782 "array or function"));
9787 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9788 struct value
*low_bound_val
=
9789 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9790 struct value
*high_bound_val
=
9791 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9795 low_bound_val
= coerce_ref (low_bound_val
);
9796 high_bound_val
= coerce_ref (high_bound_val
);
9797 low_bound
= pos_atr (low_bound_val
);
9798 high_bound
= pos_atr (high_bound_val
);
9800 if (noside
== EVAL_SKIP
)
9803 /* If this is a reference to an aligner type, then remove all
9805 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9806 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9807 TYPE_TARGET_TYPE (value_type (array
)) =
9808 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9810 if (ada_is_constrained_packed_array_type (value_type (array
)))
9811 error (_("cannot slice a packed array"));
9813 /* If this is a reference to an array or an array lvalue,
9814 convert to a pointer. */
9815 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9816 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9817 && VALUE_LVAL (array
) == lval_memory
))
9818 array
= value_addr (array
);
9820 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9821 && ada_is_array_descriptor_type (ada_check_typedef
9822 (value_type (array
))))
9823 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9825 array
= ada_coerce_to_simple_array_ptr (array
);
9827 /* If we have more than one level of pointer indirection,
9828 dereference the value until we get only one level. */
9829 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9830 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9832 array
= value_ind (array
);
9834 /* Make sure we really do have an array type before going further,
9835 to avoid a SEGV when trying to get the index type or the target
9836 type later down the road if the debug info generated by
9837 the compiler is incorrect or incomplete. */
9838 if (!ada_is_simple_array_type (value_type (array
)))
9839 error (_("cannot take slice of non-array"));
9841 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
9844 struct type
*type0
= ada_check_typedef (value_type (array
));
9846 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9847 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
9850 struct type
*arr_type0
=
9851 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
9853 return ada_value_slice_from_ptr (array
, arr_type0
,
9854 longest_to_int (low_bound
),
9855 longest_to_int (high_bound
));
9858 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9860 else if (high_bound
< low_bound
)
9861 return empty_array (value_type (array
), low_bound
);
9863 return ada_value_slice (array
, longest_to_int (low_bound
),
9864 longest_to_int (high_bound
));
9869 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9870 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9872 if (noside
== EVAL_SKIP
)
9875 switch (TYPE_CODE (type
))
9878 lim_warning (_("Membership test incompletely implemented; "
9879 "always returns true"));
9880 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9881 return value_from_longest (type
, (LONGEST
) 1);
9883 case TYPE_CODE_RANGE
:
9884 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9885 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9886 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9887 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9888 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9890 value_from_longest (type
,
9891 (value_less (arg1
, arg3
)
9892 || value_equal (arg1
, arg3
))
9893 && (value_less (arg2
, arg1
)
9894 || value_equal (arg2
, arg1
)));
9897 case BINOP_IN_BOUNDS
:
9899 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9900 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9902 if (noside
== EVAL_SKIP
)
9905 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9907 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9908 return value_zero (type
, not_lval
);
9911 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9913 type
= ada_index_type (value_type (arg2
), tem
, "range");
9915 type
= value_type (arg1
);
9917 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9918 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9920 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9921 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9922 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9924 value_from_longest (type
,
9925 (value_less (arg1
, arg3
)
9926 || value_equal (arg1
, arg3
))
9927 && (value_less (arg2
, arg1
)
9928 || value_equal (arg2
, arg1
)));
9930 case TERNOP_IN_RANGE
:
9931 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9932 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9933 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9935 if (noside
== EVAL_SKIP
)
9938 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9939 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9940 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9942 value_from_longest (type
,
9943 (value_less (arg1
, arg3
)
9944 || value_equal (arg1
, arg3
))
9945 && (value_less (arg2
, arg1
)
9946 || value_equal (arg2
, arg1
)));
9952 struct type
*type_arg
;
9954 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9956 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9958 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9962 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9966 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9967 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9968 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9971 if (noside
== EVAL_SKIP
)
9974 if (type_arg
== NULL
)
9976 arg1
= ada_coerce_ref (arg1
);
9978 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9979 arg1
= ada_coerce_to_simple_array (arg1
);
9981 type
= ada_index_type (value_type (arg1
), tem
,
9982 ada_attribute_name (op
));
9984 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9986 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9987 return allocate_value (type
);
9991 default: /* Should never happen. */
9992 error (_("unexpected attribute encountered"));
9994 return value_from_longest
9995 (type
, ada_array_bound (arg1
, tem
, 0));
9997 return value_from_longest
9998 (type
, ada_array_bound (arg1
, tem
, 1));
10000 return value_from_longest
10001 (type
, ada_array_length (arg1
, tem
));
10004 else if (discrete_type_p (type_arg
))
10006 struct type
*range_type
;
10007 const char *name
= ada_type_name (type_arg
);
10010 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
10011 range_type
= to_fixed_range_type (type_arg
, NULL
);
10012 if (range_type
== NULL
)
10013 range_type
= type_arg
;
10017 error (_("unexpected attribute encountered"));
10019 return value_from_longest
10020 (range_type
, ada_discrete_type_low_bound (range_type
));
10022 return value_from_longest
10023 (range_type
, ada_discrete_type_high_bound (range_type
));
10024 case OP_ATR_LENGTH
:
10025 error (_("the 'length attribute applies only to array types"));
10028 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10029 error (_("unimplemented type attribute"));
10034 if (ada_is_constrained_packed_array_type (type_arg
))
10035 type_arg
= decode_constrained_packed_array_type (type_arg
);
10037 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10039 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10041 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10042 return allocate_value (type
);
10047 error (_("unexpected attribute encountered"));
10049 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10050 return value_from_longest (type
, low
);
10052 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10053 return value_from_longest (type
, high
);
10054 case OP_ATR_LENGTH
:
10055 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10056 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10057 return value_from_longest (type
, high
- low
+ 1);
10063 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10064 if (noside
== EVAL_SKIP
)
10067 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10068 return value_zero (ada_tag_type (arg1
), not_lval
);
10070 return ada_value_tag (arg1
);
10074 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10075 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10076 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10077 if (noside
== EVAL_SKIP
)
10079 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10080 return value_zero (value_type (arg1
), not_lval
);
10083 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10084 return value_binop (arg1
, arg2
,
10085 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10088 case OP_ATR_MODULUS
:
10090 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10092 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10093 if (noside
== EVAL_SKIP
)
10096 if (!ada_is_modular_type (type_arg
))
10097 error (_("'modulus must be applied to modular type"));
10099 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10100 ada_modulus (type_arg
));
10105 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10106 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10107 if (noside
== EVAL_SKIP
)
10109 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10110 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10111 return value_zero (type
, not_lval
);
10113 return value_pos_atr (type
, arg1
);
10116 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10117 type
= value_type (arg1
);
10119 /* If the argument is a reference, then dereference its type, since
10120 the user is really asking for the size of the actual object,
10121 not the size of the pointer. */
10122 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10123 type
= TYPE_TARGET_TYPE (type
);
10125 if (noside
== EVAL_SKIP
)
10127 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10128 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10130 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10131 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10134 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10135 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10136 type
= exp
->elts
[pc
+ 2].type
;
10137 if (noside
== EVAL_SKIP
)
10139 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10140 return value_zero (type
, not_lval
);
10142 return value_val_atr (type
, arg1
);
10145 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10146 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10147 if (noside
== EVAL_SKIP
)
10149 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10150 return value_zero (value_type (arg1
), not_lval
);
10153 /* For integer exponentiation operations,
10154 only promote the first argument. */
10155 if (is_integral_type (value_type (arg2
)))
10156 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10158 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10160 return value_binop (arg1
, arg2
, op
);
10164 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10165 if (noside
== EVAL_SKIP
)
10171 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10172 if (noside
== EVAL_SKIP
)
10174 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10175 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10176 return value_neg (arg1
);
10181 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10182 if (noside
== EVAL_SKIP
)
10184 type
= ada_check_typedef (value_type (arg1
));
10185 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10187 if (ada_is_array_descriptor_type (type
))
10188 /* GDB allows dereferencing GNAT array descriptors. */
10190 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10192 if (arrType
== NULL
)
10193 error (_("Attempt to dereference null array pointer."));
10194 return value_at_lazy (arrType
, 0);
10196 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10197 || TYPE_CODE (type
) == TYPE_CODE_REF
10198 /* In C you can dereference an array to get the 1st elt. */
10199 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10201 type
= to_static_fixed_type
10203 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10205 return value_zero (type
, lval_memory
);
10207 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10209 /* GDB allows dereferencing an int. */
10210 if (expect_type
== NULL
)
10211 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10216 to_static_fixed_type (ada_aligned_type (expect_type
));
10217 return value_zero (expect_type
, lval_memory
);
10221 error (_("Attempt to take contents of a non-pointer value."));
10223 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10224 type
= ada_check_typedef (value_type (arg1
));
10226 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10227 /* GDB allows dereferencing an int. If we were given
10228 the expect_type, then use that as the target type.
10229 Otherwise, assume that the target type is an int. */
10231 if (expect_type
!= NULL
)
10232 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10235 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10236 (CORE_ADDR
) value_as_address (arg1
));
10239 if (ada_is_array_descriptor_type (type
))
10240 /* GDB allows dereferencing GNAT array descriptors. */
10241 return ada_coerce_to_simple_array (arg1
);
10243 return ada_value_ind (arg1
);
10245 case STRUCTOP_STRUCT
:
10246 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10247 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10248 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10249 if (noside
== EVAL_SKIP
)
10251 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10253 struct type
*type1
= value_type (arg1
);
10255 if (ada_is_tagged_type (type1
, 1))
10257 type
= ada_lookup_struct_elt_type (type1
,
10258 &exp
->elts
[pc
+ 2].string
,
10261 /* In this case, we assume that the field COULD exist
10262 in some extension of the type. Return an object of
10263 "type" void, which will match any formal
10264 (see ada_type_match). */
10265 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
10270 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10273 return value_zero (ada_aligned_type (type
), lval_memory
);
10276 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10277 arg1
= unwrap_value (arg1
);
10278 return ada_to_fixed_value (arg1
);
10281 /* The value is not supposed to be used. This is here to make it
10282 easier to accommodate expressions that contain types. */
10284 if (noside
== EVAL_SKIP
)
10286 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10287 return allocate_value (exp
->elts
[pc
+ 1].type
);
10289 error (_("Attempt to use a type name as an expression"));
10294 case OP_DISCRETE_RANGE
:
10295 case OP_POSITIONAL
:
10297 if (noside
== EVAL_NORMAL
)
10301 error (_("Undefined name, ambiguous name, or renaming used in "
10302 "component association: %s."), &exp
->elts
[pc
+2].string
);
10304 error (_("Aggregates only allowed on the right of an assignment"));
10306 internal_error (__FILE__
, __LINE__
,
10307 _("aggregate apparently mangled"));
10310 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10312 for (tem
= 0; tem
< nargs
; tem
+= 1)
10313 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10318 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10324 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10325 type name that encodes the 'small and 'delta information.
10326 Otherwise, return NULL. */
10328 static const char *
10329 fixed_type_info (struct type
*type
)
10331 const char *name
= ada_type_name (type
);
10332 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10334 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10336 const char *tail
= strstr (name
, "___XF_");
10343 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10344 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10349 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10352 ada_is_fixed_point_type (struct type
*type
)
10354 return fixed_type_info (type
) != NULL
;
10357 /* Return non-zero iff TYPE represents a System.Address type. */
10360 ada_is_system_address_type (struct type
*type
)
10362 return (TYPE_NAME (type
)
10363 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10366 /* Assuming that TYPE is the representation of an Ada fixed-point
10367 type, return its delta, or -1 if the type is malformed and the
10368 delta cannot be determined. */
10371 ada_delta (struct type
*type
)
10373 const char *encoding
= fixed_type_info (type
);
10376 /* Strictly speaking, num and den are encoded as integer. However,
10377 they may not fit into a long, and they will have to be converted
10378 to DOUBLEST anyway. So scan them as DOUBLEST. */
10379 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10386 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10387 factor ('SMALL value) associated with the type. */
10390 scaling_factor (struct type
*type
)
10392 const char *encoding
= fixed_type_info (type
);
10393 DOUBLEST num0
, den0
, num1
, den1
;
10396 /* Strictly speaking, num's and den's are encoded as integer. However,
10397 they may not fit into a long, and they will have to be converted
10398 to DOUBLEST anyway. So scan them as DOUBLEST. */
10399 n
= sscanf (encoding
,
10400 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10401 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10402 &num0
, &den0
, &num1
, &den1
);
10407 return num1
/ den1
;
10409 return num0
/ den0
;
10413 /* Assuming that X is the representation of a value of fixed-point
10414 type TYPE, return its floating-point equivalent. */
10417 ada_fixed_to_float (struct type
*type
, LONGEST x
)
10419 return (DOUBLEST
) x
*scaling_factor (type
);
10422 /* The representation of a fixed-point value of type TYPE
10423 corresponding to the value X. */
10426 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
10428 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
10435 /* Scan STR beginning at position K for a discriminant name, and
10436 return the value of that discriminant field of DVAL in *PX. If
10437 PNEW_K is not null, put the position of the character beyond the
10438 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10439 not alter *PX and *PNEW_K if unsuccessful. */
10442 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
10445 static char *bound_buffer
= NULL
;
10446 static size_t bound_buffer_len
= 0;
10449 struct value
*bound_val
;
10451 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
10454 pend
= strstr (str
+ k
, "__");
10458 k
+= strlen (bound
);
10462 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
10463 bound
= bound_buffer
;
10464 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
10465 bound
[pend
- (str
+ k
)] = '\0';
10469 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
10470 if (bound_val
== NULL
)
10473 *px
= value_as_long (bound_val
);
10474 if (pnew_k
!= NULL
)
10479 /* Value of variable named NAME in the current environment. If
10480 no such variable found, then if ERR_MSG is null, returns 0, and
10481 otherwise causes an error with message ERR_MSG. */
10483 static struct value
*
10484 get_var_value (char *name
, char *err_msg
)
10486 struct ada_symbol_info
*syms
;
10489 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
10494 if (err_msg
== NULL
)
10497 error (("%s"), err_msg
);
10500 return value_of_variable (syms
[0].sym
, syms
[0].block
);
10503 /* Value of integer variable named NAME in the current environment. If
10504 no such variable found, returns 0, and sets *FLAG to 0. If
10505 successful, sets *FLAG to 1. */
10508 get_int_var_value (char *name
, int *flag
)
10510 struct value
*var_val
= get_var_value (name
, 0);
10522 return value_as_long (var_val
);
10527 /* Return a range type whose base type is that of the range type named
10528 NAME in the current environment, and whose bounds are calculated
10529 from NAME according to the GNAT range encoding conventions.
10530 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10531 corresponding range type from debug information; fall back to using it
10532 if symbol lookup fails. If a new type must be created, allocate it
10533 like ORIG_TYPE was. The bounds information, in general, is encoded
10534 in NAME, the base type given in the named range type. */
10536 static struct type
*
10537 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
10540 struct type
*base_type
;
10541 char *subtype_info
;
10543 gdb_assert (raw_type
!= NULL
);
10544 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
10546 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
10547 base_type
= TYPE_TARGET_TYPE (raw_type
);
10549 base_type
= raw_type
;
10551 name
= TYPE_NAME (raw_type
);
10552 subtype_info
= strstr (name
, "___XD");
10553 if (subtype_info
== NULL
)
10555 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
10556 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
10558 if (L
< INT_MIN
|| U
> INT_MAX
)
10561 return create_range_type (alloc_type_copy (raw_type
), raw_type
,
10562 ada_discrete_type_low_bound (raw_type
),
10563 ada_discrete_type_high_bound (raw_type
));
10567 static char *name_buf
= NULL
;
10568 static size_t name_len
= 0;
10569 int prefix_len
= subtype_info
- name
;
10575 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
10576 strncpy (name_buf
, name
, prefix_len
);
10577 name_buf
[prefix_len
] = '\0';
10580 bounds_str
= strchr (subtype_info
, '_');
10583 if (*subtype_info
== 'L')
10585 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
10586 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
10588 if (bounds_str
[n
] == '_')
10590 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
10598 strcpy (name_buf
+ prefix_len
, "___L");
10599 L
= get_int_var_value (name_buf
, &ok
);
10602 lim_warning (_("Unknown lower bound, using 1."));
10607 if (*subtype_info
== 'U')
10609 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
10610 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
10617 strcpy (name_buf
+ prefix_len
, "___U");
10618 U
= get_int_var_value (name_buf
, &ok
);
10621 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
10626 type
= create_range_type (alloc_type_copy (raw_type
), base_type
, L
, U
);
10627 TYPE_NAME (type
) = name
;
10632 /* True iff NAME is the name of a range type. */
10635 ada_is_range_type_name (const char *name
)
10637 return (name
!= NULL
&& strstr (name
, "___XD"));
10641 /* Modular types */
10643 /* True iff TYPE is an Ada modular type. */
10646 ada_is_modular_type (struct type
*type
)
10648 struct type
*subranged_type
= get_base_type (type
);
10650 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
10651 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
10652 && TYPE_UNSIGNED (subranged_type
));
10655 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10658 ada_modulus (struct type
*type
)
10660 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
10664 /* Ada exception catchpoint support:
10665 ---------------------------------
10667 We support 3 kinds of exception catchpoints:
10668 . catchpoints on Ada exceptions
10669 . catchpoints on unhandled Ada exceptions
10670 . catchpoints on failed assertions
10672 Exceptions raised during failed assertions, or unhandled exceptions
10673 could perfectly be caught with the general catchpoint on Ada exceptions.
10674 However, we can easily differentiate these two special cases, and having
10675 the option to distinguish these two cases from the rest can be useful
10676 to zero-in on certain situations.
10678 Exception catchpoints are a specialized form of breakpoint,
10679 since they rely on inserting breakpoints inside known routines
10680 of the GNAT runtime. The implementation therefore uses a standard
10681 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10684 Support in the runtime for exception catchpoints have been changed
10685 a few times already, and these changes affect the implementation
10686 of these catchpoints. In order to be able to support several
10687 variants of the runtime, we use a sniffer that will determine
10688 the runtime variant used by the program being debugged. */
10690 /* The different types of catchpoints that we introduced for catching
10693 enum exception_catchpoint_kind
10695 ex_catch_exception
,
10696 ex_catch_exception_unhandled
,
10700 /* Ada's standard exceptions. */
10702 static char *standard_exc
[] = {
10703 "constraint_error",
10709 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10711 /* A structure that describes how to support exception catchpoints
10712 for a given executable. */
10714 struct exception_support_info
10716 /* The name of the symbol to break on in order to insert
10717 a catchpoint on exceptions. */
10718 const char *catch_exception_sym
;
10720 /* The name of the symbol to break on in order to insert
10721 a catchpoint on unhandled exceptions. */
10722 const char *catch_exception_unhandled_sym
;
10724 /* The name of the symbol to break on in order to insert
10725 a catchpoint on failed assertions. */
10726 const char *catch_assert_sym
;
10728 /* Assuming that the inferior just triggered an unhandled exception
10729 catchpoint, this function is responsible for returning the address
10730 in inferior memory where the name of that exception is stored.
10731 Return zero if the address could not be computed. */
10732 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10735 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10736 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10738 /* The following exception support info structure describes how to
10739 implement exception catchpoints with the latest version of the
10740 Ada runtime (as of 2007-03-06). */
10742 static const struct exception_support_info default_exception_support_info
=
10744 "__gnat_debug_raise_exception", /* catch_exception_sym */
10745 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10746 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10747 ada_unhandled_exception_name_addr
10750 /* The following exception support info structure describes how to
10751 implement exception catchpoints with a slightly older version
10752 of the Ada runtime. */
10754 static const struct exception_support_info exception_support_info_fallback
=
10756 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10757 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10758 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10759 ada_unhandled_exception_name_addr_from_raise
10762 /* Return nonzero if we can detect the exception support routines
10763 described in EINFO.
10765 This function errors out if an abnormal situation is detected
10766 (for instance, if we find the exception support routines, but
10767 that support is found to be incomplete). */
10770 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
10772 struct symbol
*sym
;
10774 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10775 that should be compiled with debugging information. As a result, we
10776 expect to find that symbol in the symtabs. */
10778 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
10781 /* Perhaps we did not find our symbol because the Ada runtime was
10782 compiled without debugging info, or simply stripped of it.
10783 It happens on some GNU/Linux distributions for instance, where
10784 users have to install a separate debug package in order to get
10785 the runtime's debugging info. In that situation, let the user
10786 know why we cannot insert an Ada exception catchpoint.
10788 Note: Just for the purpose of inserting our Ada exception
10789 catchpoint, we could rely purely on the associated minimal symbol.
10790 But we would be operating in degraded mode anyway, since we are
10791 still lacking the debugging info needed later on to extract
10792 the name of the exception being raised (this name is printed in
10793 the catchpoint message, and is also used when trying to catch
10794 a specific exception). We do not handle this case for now. */
10795 if (lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
))
10796 error (_("Your Ada runtime appears to be missing some debugging "
10797 "information.\nCannot insert Ada exception catchpoint "
10798 "in this configuration."));
10803 /* Make sure that the symbol we found corresponds to a function. */
10805 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10806 error (_("Symbol \"%s\" is not a function (class = %d)"),
10807 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
10812 /* Inspect the Ada runtime and determine which exception info structure
10813 should be used to provide support for exception catchpoints.
10815 This function will always set the per-inferior exception_info,
10816 or raise an error. */
10819 ada_exception_support_info_sniffer (void)
10821 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
10822 struct symbol
*sym
;
10824 /* If the exception info is already known, then no need to recompute it. */
10825 if (data
->exception_info
!= NULL
)
10828 /* Check the latest (default) exception support info. */
10829 if (ada_has_this_exception_support (&default_exception_support_info
))
10831 data
->exception_info
= &default_exception_support_info
;
10835 /* Try our fallback exception suport info. */
10836 if (ada_has_this_exception_support (&exception_support_info_fallback
))
10838 data
->exception_info
= &exception_support_info_fallback
;
10842 /* Sometimes, it is normal for us to not be able to find the routine
10843 we are looking for. This happens when the program is linked with
10844 the shared version of the GNAT runtime, and the program has not been
10845 started yet. Inform the user of these two possible causes if
10848 if (ada_update_initial_language (language_unknown
) != language_ada
)
10849 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10851 /* If the symbol does not exist, then check that the program is
10852 already started, to make sure that shared libraries have been
10853 loaded. If it is not started, this may mean that the symbol is
10854 in a shared library. */
10856 if (ptid_get_pid (inferior_ptid
) == 0)
10857 error (_("Unable to insert catchpoint. Try to start the program first."));
10859 /* At this point, we know that we are debugging an Ada program and
10860 that the inferior has been started, but we still are not able to
10861 find the run-time symbols. That can mean that we are in
10862 configurable run time mode, or that a-except as been optimized
10863 out by the linker... In any case, at this point it is not worth
10864 supporting this feature. */
10866 error (_("Cannot insert Ada exception catchpoints in this configuration."));
10869 /* True iff FRAME is very likely to be that of a function that is
10870 part of the runtime system. This is all very heuristic, but is
10871 intended to be used as advice as to what frames are uninteresting
10875 is_known_support_routine (struct frame_info
*frame
)
10877 struct symtab_and_line sal
;
10878 const char *func_name
;
10879 enum language func_lang
;
10882 /* If this code does not have any debugging information (no symtab),
10883 This cannot be any user code. */
10885 find_frame_sal (frame
, &sal
);
10886 if (sal
.symtab
== NULL
)
10889 /* If there is a symtab, but the associated source file cannot be
10890 located, then assume this is not user code: Selecting a frame
10891 for which we cannot display the code would not be very helpful
10892 for the user. This should also take care of case such as VxWorks
10893 where the kernel has some debugging info provided for a few units. */
10895 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10898 /* Check the unit filename againt the Ada runtime file naming.
10899 We also check the name of the objfile against the name of some
10900 known system libraries that sometimes come with debugging info
10903 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10905 re_comp (known_runtime_file_name_patterns
[i
]);
10906 if (re_exec (sal
.symtab
->filename
))
10908 if (sal
.symtab
->objfile
!= NULL
10909 && re_exec (sal
.symtab
->objfile
->name
))
10913 /* Check whether the function is a GNAT-generated entity. */
10915 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
10916 if (func_name
== NULL
)
10919 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10921 re_comp (known_auxiliary_function_name_patterns
[i
]);
10922 if (re_exec (func_name
))
10929 /* Find the first frame that contains debugging information and that is not
10930 part of the Ada run-time, starting from FI and moving upward. */
10933 ada_find_printable_frame (struct frame_info
*fi
)
10935 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10937 if (!is_known_support_routine (fi
))
10946 /* Assuming that the inferior just triggered an unhandled exception
10947 catchpoint, return the address in inferior memory where the name
10948 of the exception is stored.
10950 Return zero if the address could not be computed. */
10953 ada_unhandled_exception_name_addr (void)
10955 return parse_and_eval_address ("e.full_name");
10958 /* Same as ada_unhandled_exception_name_addr, except that this function
10959 should be used when the inferior uses an older version of the runtime,
10960 where the exception name needs to be extracted from a specific frame
10961 several frames up in the callstack. */
10964 ada_unhandled_exception_name_addr_from_raise (void)
10967 struct frame_info
*fi
;
10968 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
10970 /* To determine the name of this exception, we need to select
10971 the frame corresponding to RAISE_SYM_NAME. This frame is
10972 at least 3 levels up, so we simply skip the first 3 frames
10973 without checking the name of their associated function. */
10974 fi
= get_current_frame ();
10975 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10977 fi
= get_prev_frame (fi
);
10981 const char *func_name
;
10982 enum language func_lang
;
10984 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
10985 if (func_name
!= NULL
10986 && strcmp (func_name
, data
->exception_info
->catch_exception_sym
) == 0)
10987 break; /* We found the frame we were looking for... */
10988 fi
= get_prev_frame (fi
);
10995 return parse_and_eval_address ("id.full_name");
10998 /* Assuming the inferior just triggered an Ada exception catchpoint
10999 (of any type), return the address in inferior memory where the name
11000 of the exception is stored, if applicable.
11002 Return zero if the address could not be computed, or if not relevant. */
11005 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
11006 struct breakpoint
*b
)
11008 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11012 case ex_catch_exception
:
11013 return (parse_and_eval_address ("e.full_name"));
11016 case ex_catch_exception_unhandled
:
11017 return data
->exception_info
->unhandled_exception_name_addr ();
11020 case ex_catch_assert
:
11021 return 0; /* Exception name is not relevant in this case. */
11025 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11029 return 0; /* Should never be reached. */
11032 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11033 any error that ada_exception_name_addr_1 might cause to be thrown.
11034 When an error is intercepted, a warning with the error message is printed,
11035 and zero is returned. */
11038 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
11039 struct breakpoint
*b
)
11041 volatile struct gdb_exception e
;
11042 CORE_ADDR result
= 0;
11044 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11046 result
= ada_exception_name_addr_1 (ex
, b
);
11051 warning (_("failed to get exception name: %s"), e
.message
);
11058 static struct symtab_and_line
ada_exception_sal (enum exception_catchpoint_kind
,
11060 const struct breakpoint_ops
**);
11061 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11063 /* Ada catchpoints.
11065 In the case of catchpoints on Ada exceptions, the catchpoint will
11066 stop the target on every exception the program throws. When a user
11067 specifies the name of a specific exception, we translate this
11068 request into a condition expression (in text form), and then parse
11069 it into an expression stored in each of the catchpoint's locations.
11070 We then use this condition to check whether the exception that was
11071 raised is the one the user is interested in. If not, then the
11072 target is resumed again. We store the name of the requested
11073 exception, in order to be able to re-set the condition expression
11074 when symbols change. */
11076 /* An instance of this type is used to represent an Ada catchpoint
11077 breakpoint location. It includes a "struct bp_location" as a kind
11078 of base class; users downcast to "struct bp_location *" when
11081 struct ada_catchpoint_location
11083 /* The base class. */
11084 struct bp_location base
;
11086 /* The condition that checks whether the exception that was raised
11087 is the specific exception the user specified on catchpoint
11089 struct expression
*excep_cond_expr
;
11092 /* Implement the DTOR method in the bp_location_ops structure for all
11093 Ada exception catchpoint kinds. */
11096 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11098 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11100 xfree (al
->excep_cond_expr
);
11103 /* The vtable to be used in Ada catchpoint locations. */
11105 static const struct bp_location_ops ada_catchpoint_location_ops
=
11107 ada_catchpoint_location_dtor
11110 /* An instance of this type is used to represent an Ada catchpoint.
11111 It includes a "struct breakpoint" as a kind of base class; users
11112 downcast to "struct breakpoint *" when needed. */
11114 struct ada_catchpoint
11116 /* The base class. */
11117 struct breakpoint base
;
11119 /* The name of the specific exception the user specified. */
11120 char *excep_string
;
11123 /* Parse the exception condition string in the context of each of the
11124 catchpoint's locations, and store them for later evaluation. */
11127 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11129 struct cleanup
*old_chain
;
11130 struct bp_location
*bl
;
11133 /* Nothing to do if there's no specific exception to catch. */
11134 if (c
->excep_string
== NULL
)
11137 /* Same if there are no locations... */
11138 if (c
->base
.loc
== NULL
)
11141 /* Compute the condition expression in text form, from the specific
11142 expection we want to catch. */
11143 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11144 old_chain
= make_cleanup (xfree
, cond_string
);
11146 /* Iterate over all the catchpoint's locations, and parse an
11147 expression for each. */
11148 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11150 struct ada_catchpoint_location
*ada_loc
11151 = (struct ada_catchpoint_location
*) bl
;
11152 struct expression
*exp
= NULL
;
11154 if (!bl
->shlib_disabled
)
11156 volatile struct gdb_exception e
;
11160 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11162 exp
= parse_exp_1 (&s
, block_for_pc (bl
->address
), 0);
11165 warning (_("failed to reevaluate internal exception condition "
11166 "for catchpoint %d: %s"),
11167 c
->base
.number
, e
.message
);
11170 ada_loc
->excep_cond_expr
= exp
;
11173 do_cleanups (old_chain
);
11176 /* Implement the DTOR method in the breakpoint_ops structure for all
11177 exception catchpoint kinds. */
11180 dtor_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
11182 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11184 xfree (c
->excep_string
);
11186 bkpt_breakpoint_ops
.dtor (b
);
11189 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11190 structure for all exception catchpoint kinds. */
11192 static struct bp_location
*
11193 allocate_location_exception (enum exception_catchpoint_kind ex
,
11194 struct breakpoint
*self
)
11196 struct ada_catchpoint_location
*loc
;
11198 loc
= XNEW (struct ada_catchpoint_location
);
11199 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11200 loc
->excep_cond_expr
= NULL
;
11204 /* Implement the RE_SET method in the breakpoint_ops structure for all
11205 exception catchpoint kinds. */
11208 re_set_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
11210 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11212 /* Call the base class's method. This updates the catchpoint's
11214 bkpt_breakpoint_ops
.re_set (b
);
11216 /* Reparse the exception conditional expressions. One for each
11218 create_excep_cond_exprs (c
);
11221 /* Returns true if we should stop for this breakpoint hit. If the
11222 user specified a specific exception, we only want to cause a stop
11223 if the program thrown that exception. */
11226 should_stop_exception (const struct bp_location
*bl
)
11228 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11229 const struct ada_catchpoint_location
*ada_loc
11230 = (const struct ada_catchpoint_location
*) bl
;
11231 volatile struct gdb_exception ex
;
11234 /* With no specific exception, should always stop. */
11235 if (c
->excep_string
== NULL
)
11238 if (ada_loc
->excep_cond_expr
== NULL
)
11240 /* We will have a NULL expression if back when we were creating
11241 the expressions, this location's had failed to parse. */
11246 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11248 struct value
*mark
;
11250 mark
= value_mark ();
11251 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11252 value_free_to_mark (mark
);
11255 exception_fprintf (gdb_stderr
, ex
,
11256 _("Error in testing exception condition:\n"));
11260 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11261 for all exception catchpoint kinds. */
11264 check_status_exception (enum exception_catchpoint_kind ex
, bpstat bs
)
11266 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11269 /* Implement the PRINT_IT method in the breakpoint_ops structure
11270 for all exception catchpoint kinds. */
11272 static enum print_stop_action
11273 print_it_exception (enum exception_catchpoint_kind ex
, bpstat bs
)
11275 struct ui_out
*uiout
= current_uiout
;
11276 struct breakpoint
*b
= bs
->breakpoint_at
;
11278 annotate_catchpoint (b
->number
);
11280 if (ui_out_is_mi_like_p (uiout
))
11282 ui_out_field_string (uiout
, "reason",
11283 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11284 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11287 ui_out_text (uiout
,
11288 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11289 : "\nCatchpoint ");
11290 ui_out_field_int (uiout
, "bkptno", b
->number
);
11291 ui_out_text (uiout
, ", ");
11295 case ex_catch_exception
:
11296 case ex_catch_exception_unhandled
:
11298 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11299 char exception_name
[256];
11303 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
11304 exception_name
[sizeof (exception_name
) - 1] = '\0';
11308 /* For some reason, we were unable to read the exception
11309 name. This could happen if the Runtime was compiled
11310 without debugging info, for instance. In that case,
11311 just replace the exception name by the generic string
11312 "exception" - it will read as "an exception" in the
11313 notification we are about to print. */
11314 memcpy (exception_name
, "exception", sizeof ("exception"));
11316 /* In the case of unhandled exception breakpoints, we print
11317 the exception name as "unhandled EXCEPTION_NAME", to make
11318 it clearer to the user which kind of catchpoint just got
11319 hit. We used ui_out_text to make sure that this extra
11320 info does not pollute the exception name in the MI case. */
11321 if (ex
== ex_catch_exception_unhandled
)
11322 ui_out_text (uiout
, "unhandled ");
11323 ui_out_field_string (uiout
, "exception-name", exception_name
);
11326 case ex_catch_assert
:
11327 /* In this case, the name of the exception is not really
11328 important. Just print "failed assertion" to make it clearer
11329 that his program just hit an assertion-failure catchpoint.
11330 We used ui_out_text because this info does not belong in
11332 ui_out_text (uiout
, "failed assertion");
11335 ui_out_text (uiout
, " at ");
11336 ada_find_printable_frame (get_current_frame ());
11338 return PRINT_SRC_AND_LOC
;
11341 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11342 for all exception catchpoint kinds. */
11345 print_one_exception (enum exception_catchpoint_kind ex
,
11346 struct breakpoint
*b
, struct bp_location
**last_loc
)
11348 struct ui_out
*uiout
= current_uiout
;
11349 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11350 struct value_print_options opts
;
11352 get_user_print_options (&opts
);
11353 if (opts
.addressprint
)
11355 annotate_field (4);
11356 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11359 annotate_field (5);
11360 *last_loc
= b
->loc
;
11363 case ex_catch_exception
:
11364 if (c
->excep_string
!= NULL
)
11366 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11368 ui_out_field_string (uiout
, "what", msg
);
11372 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11376 case ex_catch_exception_unhandled
:
11377 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
11380 case ex_catch_assert
:
11381 ui_out_field_string (uiout
, "what", "failed Ada assertions");
11385 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11390 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11391 for all exception catchpoint kinds. */
11394 print_mention_exception (enum exception_catchpoint_kind ex
,
11395 struct breakpoint
*b
)
11397 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11398 struct ui_out
*uiout
= current_uiout
;
11400 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
11401 : _("Catchpoint "));
11402 ui_out_field_int (uiout
, "bkptno", b
->number
);
11403 ui_out_text (uiout
, ": ");
11407 case ex_catch_exception
:
11408 if (c
->excep_string
!= NULL
)
11410 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11411 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
11413 ui_out_text (uiout
, info
);
11414 do_cleanups (old_chain
);
11417 ui_out_text (uiout
, _("all Ada exceptions"));
11420 case ex_catch_exception_unhandled
:
11421 ui_out_text (uiout
, _("unhandled Ada exceptions"));
11424 case ex_catch_assert
:
11425 ui_out_text (uiout
, _("failed Ada assertions"));
11429 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11434 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11435 for all exception catchpoint kinds. */
11438 print_recreate_exception (enum exception_catchpoint_kind ex
,
11439 struct breakpoint
*b
, struct ui_file
*fp
)
11441 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11445 case ex_catch_exception
:
11446 fprintf_filtered (fp
, "catch exception");
11447 if (c
->excep_string
!= NULL
)
11448 fprintf_filtered (fp
, " %s", c
->excep_string
);
11451 case ex_catch_exception_unhandled
:
11452 fprintf_filtered (fp
, "catch exception unhandled");
11455 case ex_catch_assert
:
11456 fprintf_filtered (fp
, "catch assert");
11460 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11462 print_recreate_thread (b
, fp
);
11465 /* Virtual table for "catch exception" breakpoints. */
11468 dtor_catch_exception (struct breakpoint
*b
)
11470 dtor_exception (ex_catch_exception
, b
);
11473 static struct bp_location
*
11474 allocate_location_catch_exception (struct breakpoint
*self
)
11476 return allocate_location_exception (ex_catch_exception
, self
);
11480 re_set_catch_exception (struct breakpoint
*b
)
11482 re_set_exception (ex_catch_exception
, b
);
11486 check_status_catch_exception (bpstat bs
)
11488 check_status_exception (ex_catch_exception
, bs
);
11491 static enum print_stop_action
11492 print_it_catch_exception (bpstat bs
)
11494 return print_it_exception (ex_catch_exception
, bs
);
11498 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
11500 print_one_exception (ex_catch_exception
, b
, last_loc
);
11504 print_mention_catch_exception (struct breakpoint
*b
)
11506 print_mention_exception (ex_catch_exception
, b
);
11510 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
11512 print_recreate_exception (ex_catch_exception
, b
, fp
);
11515 static struct breakpoint_ops catch_exception_breakpoint_ops
;
11517 /* Virtual table for "catch exception unhandled" breakpoints. */
11520 dtor_catch_exception_unhandled (struct breakpoint
*b
)
11522 dtor_exception (ex_catch_exception_unhandled
, b
);
11525 static struct bp_location
*
11526 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
11528 return allocate_location_exception (ex_catch_exception_unhandled
, self
);
11532 re_set_catch_exception_unhandled (struct breakpoint
*b
)
11534 re_set_exception (ex_catch_exception_unhandled
, b
);
11538 check_status_catch_exception_unhandled (bpstat bs
)
11540 check_status_exception (ex_catch_exception_unhandled
, bs
);
11543 static enum print_stop_action
11544 print_it_catch_exception_unhandled (bpstat bs
)
11546 return print_it_exception (ex_catch_exception_unhandled
, bs
);
11550 print_one_catch_exception_unhandled (struct breakpoint
*b
,
11551 struct bp_location
**last_loc
)
11553 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
11557 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
11559 print_mention_exception (ex_catch_exception_unhandled
, b
);
11563 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
11564 struct ui_file
*fp
)
11566 print_recreate_exception (ex_catch_exception_unhandled
, b
, fp
);
11569 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
11571 /* Virtual table for "catch assert" breakpoints. */
11574 dtor_catch_assert (struct breakpoint
*b
)
11576 dtor_exception (ex_catch_assert
, b
);
11579 static struct bp_location
*
11580 allocate_location_catch_assert (struct breakpoint
*self
)
11582 return allocate_location_exception (ex_catch_assert
, self
);
11586 re_set_catch_assert (struct breakpoint
*b
)
11588 return re_set_exception (ex_catch_assert
, b
);
11592 check_status_catch_assert (bpstat bs
)
11594 check_status_exception (ex_catch_assert
, bs
);
11597 static enum print_stop_action
11598 print_it_catch_assert (bpstat bs
)
11600 return print_it_exception (ex_catch_assert
, bs
);
11604 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
11606 print_one_exception (ex_catch_assert
, b
, last_loc
);
11610 print_mention_catch_assert (struct breakpoint
*b
)
11612 print_mention_exception (ex_catch_assert
, b
);
11616 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
11618 print_recreate_exception (ex_catch_assert
, b
, fp
);
11621 static struct breakpoint_ops catch_assert_breakpoint_ops
;
11623 /* Return a newly allocated copy of the first space-separated token
11624 in ARGSP, and then adjust ARGSP to point immediately after that
11627 Return NULL if ARGPS does not contain any more tokens. */
11630 ada_get_next_arg (char **argsp
)
11632 char *args
= *argsp
;
11636 args
= skip_spaces (args
);
11637 if (args
[0] == '\0')
11638 return NULL
; /* No more arguments. */
11640 /* Find the end of the current argument. */
11642 end
= skip_to_space (args
);
11644 /* Adjust ARGSP to point to the start of the next argument. */
11648 /* Make a copy of the current argument and return it. */
11650 result
= xmalloc (end
- args
+ 1);
11651 strncpy (result
, args
, end
- args
);
11652 result
[end
- args
] = '\0';
11657 /* Split the arguments specified in a "catch exception" command.
11658 Set EX to the appropriate catchpoint type.
11659 Set EXCEP_STRING to the name of the specific exception if
11660 specified by the user.
11661 If a condition is found at the end of the arguments, the condition
11662 expression is stored in COND_STRING (memory must be deallocated
11663 after use). Otherwise COND_STRING is set to NULL. */
11666 catch_ada_exception_command_split (char *args
,
11667 enum exception_catchpoint_kind
*ex
,
11668 char **excep_string
,
11669 char **cond_string
)
11671 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
11672 char *exception_name
;
11675 exception_name
= ada_get_next_arg (&args
);
11676 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
11678 /* This is not an exception name; this is the start of a condition
11679 expression for a catchpoint on all exceptions. So, "un-get"
11680 this token, and set exception_name to NULL. */
11681 xfree (exception_name
);
11682 exception_name
= NULL
;
11685 make_cleanup (xfree
, exception_name
);
11687 /* Check to see if we have a condition. */
11689 args
= skip_spaces (args
);
11690 if (strncmp (args
, "if", 2) == 0
11691 && (isspace (args
[2]) || args
[2] == '\0'))
11694 args
= skip_spaces (args
);
11696 if (args
[0] == '\0')
11697 error (_("Condition missing after `if' keyword"));
11698 cond
= xstrdup (args
);
11699 make_cleanup (xfree
, cond
);
11701 args
+= strlen (args
);
11704 /* Check that we do not have any more arguments. Anything else
11707 if (args
[0] != '\0')
11708 error (_("Junk at end of expression"));
11710 discard_cleanups (old_chain
);
11712 if (exception_name
== NULL
)
11714 /* Catch all exceptions. */
11715 *ex
= ex_catch_exception
;
11716 *excep_string
= NULL
;
11718 else if (strcmp (exception_name
, "unhandled") == 0)
11720 /* Catch unhandled exceptions. */
11721 *ex
= ex_catch_exception_unhandled
;
11722 *excep_string
= NULL
;
11726 /* Catch a specific exception. */
11727 *ex
= ex_catch_exception
;
11728 *excep_string
= exception_name
;
11730 *cond_string
= cond
;
11733 /* Return the name of the symbol on which we should break in order to
11734 implement a catchpoint of the EX kind. */
11736 static const char *
11737 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
11739 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11741 gdb_assert (data
->exception_info
!= NULL
);
11745 case ex_catch_exception
:
11746 return (data
->exception_info
->catch_exception_sym
);
11748 case ex_catch_exception_unhandled
:
11749 return (data
->exception_info
->catch_exception_unhandled_sym
);
11751 case ex_catch_assert
:
11752 return (data
->exception_info
->catch_assert_sym
);
11755 internal_error (__FILE__
, __LINE__
,
11756 _("unexpected catchpoint kind (%d)"), ex
);
11760 /* Return the breakpoint ops "virtual table" used for catchpoints
11763 static const struct breakpoint_ops
*
11764 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
11768 case ex_catch_exception
:
11769 return (&catch_exception_breakpoint_ops
);
11771 case ex_catch_exception_unhandled
:
11772 return (&catch_exception_unhandled_breakpoint_ops
);
11774 case ex_catch_assert
:
11775 return (&catch_assert_breakpoint_ops
);
11778 internal_error (__FILE__
, __LINE__
,
11779 _("unexpected catchpoint kind (%d)"), ex
);
11783 /* Return the condition that will be used to match the current exception
11784 being raised with the exception that the user wants to catch. This
11785 assumes that this condition is used when the inferior just triggered
11786 an exception catchpoint.
11788 The string returned is a newly allocated string that needs to be
11789 deallocated later. */
11792 ada_exception_catchpoint_cond_string (const char *excep_string
)
11796 /* The standard exceptions are a special case. They are defined in
11797 runtime units that have been compiled without debugging info; if
11798 EXCEP_STRING is the not-fully-qualified name of a standard
11799 exception (e.g. "constraint_error") then, during the evaluation
11800 of the condition expression, the symbol lookup on this name would
11801 *not* return this standard exception. The catchpoint condition
11802 may then be set only on user-defined exceptions which have the
11803 same not-fully-qualified name (e.g. my_package.constraint_error).
11805 To avoid this unexcepted behavior, these standard exceptions are
11806 systematically prefixed by "standard". This means that "catch
11807 exception constraint_error" is rewritten into "catch exception
11808 standard.constraint_error".
11810 If an exception named contraint_error is defined in another package of
11811 the inferior program, then the only way to specify this exception as a
11812 breakpoint condition is to use its fully-qualified named:
11813 e.g. my_package.constraint_error. */
11815 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
11817 if (strcmp (standard_exc
[i
], excep_string
) == 0)
11819 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11823 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
11826 /* Return the symtab_and_line that should be used to insert an exception
11827 catchpoint of the TYPE kind.
11829 EXCEP_STRING should contain the name of a specific exception that
11830 the catchpoint should catch, or NULL otherwise.
11832 ADDR_STRING returns the name of the function where the real
11833 breakpoint that implements the catchpoints is set, depending on the
11834 type of catchpoint we need to create. */
11836 static struct symtab_and_line
11837 ada_exception_sal (enum exception_catchpoint_kind ex
, char *excep_string
,
11838 char **addr_string
, const struct breakpoint_ops
**ops
)
11840 const char *sym_name
;
11841 struct symbol
*sym
;
11843 /* First, find out which exception support info to use. */
11844 ada_exception_support_info_sniffer ();
11846 /* Then lookup the function on which we will break in order to catch
11847 the Ada exceptions requested by the user. */
11848 sym_name
= ada_exception_sym_name (ex
);
11849 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
11851 /* We can assume that SYM is not NULL at this stage. If the symbol
11852 did not exist, ada_exception_support_info_sniffer would have
11853 raised an exception.
11855 Also, ada_exception_support_info_sniffer should have already
11856 verified that SYM is a function symbol. */
11857 gdb_assert (sym
!= NULL
);
11858 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
11860 /* Set ADDR_STRING. */
11861 *addr_string
= xstrdup (sym_name
);
11864 *ops
= ada_exception_breakpoint_ops (ex
);
11866 return find_function_start_sal (sym
, 1);
11869 /* Parse the arguments (ARGS) of the "catch exception" command.
11871 If the user asked the catchpoint to catch only a specific
11872 exception, then save the exception name in ADDR_STRING.
11874 If the user provided a condition, then set COND_STRING to
11875 that condition expression (the memory must be deallocated
11876 after use). Otherwise, set COND_STRING to NULL.
11878 See ada_exception_sal for a description of all the remaining
11879 function arguments of this function. */
11881 static struct symtab_and_line
11882 ada_decode_exception_location (char *args
, char **addr_string
,
11883 char **excep_string
,
11884 char **cond_string
,
11885 const struct breakpoint_ops
**ops
)
11887 enum exception_catchpoint_kind ex
;
11889 catch_ada_exception_command_split (args
, &ex
, excep_string
, cond_string
);
11890 return ada_exception_sal (ex
, *excep_string
, addr_string
, ops
);
11893 /* Create an Ada exception catchpoint. */
11896 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
11897 struct symtab_and_line sal
,
11899 char *excep_string
,
11901 const struct breakpoint_ops
*ops
,
11905 struct ada_catchpoint
*c
;
11907 c
= XNEW (struct ada_catchpoint
);
11908 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
11909 ops
, tempflag
, from_tty
);
11910 c
->excep_string
= excep_string
;
11911 create_excep_cond_exprs (c
);
11912 if (cond_string
!= NULL
)
11913 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
11914 install_breakpoint (0, &c
->base
, 1);
11917 /* Implement the "catch exception" command. */
11920 catch_ada_exception_command (char *arg
, int from_tty
,
11921 struct cmd_list_element
*command
)
11923 struct gdbarch
*gdbarch
= get_current_arch ();
11925 struct symtab_and_line sal
;
11926 char *addr_string
= NULL
;
11927 char *excep_string
= NULL
;
11928 char *cond_string
= NULL
;
11929 const struct breakpoint_ops
*ops
= NULL
;
11931 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
11935 sal
= ada_decode_exception_location (arg
, &addr_string
, &excep_string
,
11936 &cond_string
, &ops
);
11937 create_ada_exception_catchpoint (gdbarch
, sal
, addr_string
,
11938 excep_string
, cond_string
, ops
,
11939 tempflag
, from_tty
);
11942 /* Assuming that ARGS contains the arguments of a "catch assert"
11943 command, parse those arguments and return a symtab_and_line object
11944 for a failed assertion catchpoint.
11946 Set ADDR_STRING to the name of the function where the real
11947 breakpoint that implements the catchpoint is set.
11949 If ARGS contains a condition, set COND_STRING to that condition
11950 (the memory needs to be deallocated after use). Otherwise, set
11951 COND_STRING to NULL. */
11953 static struct symtab_and_line
11954 ada_decode_assert_location (char *args
, char **addr_string
,
11955 char **cond_string
,
11956 const struct breakpoint_ops
**ops
)
11958 args
= skip_spaces (args
);
11960 /* Check whether a condition was provided. */
11961 if (strncmp (args
, "if", 2) == 0
11962 && (isspace (args
[2]) || args
[2] == '\0'))
11965 args
= skip_spaces (args
);
11966 if (args
[0] == '\0')
11967 error (_("condition missing after `if' keyword"));
11968 *cond_string
= xstrdup (args
);
11971 /* Otherwise, there should be no other argument at the end of
11973 else if (args
[0] != '\0')
11974 error (_("Junk at end of arguments."));
11976 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, ops
);
11979 /* Implement the "catch assert" command. */
11982 catch_assert_command (char *arg
, int from_tty
,
11983 struct cmd_list_element
*command
)
11985 struct gdbarch
*gdbarch
= get_current_arch ();
11987 struct symtab_and_line sal
;
11988 char *addr_string
= NULL
;
11989 char *cond_string
= NULL
;
11990 const struct breakpoint_ops
*ops
= NULL
;
11992 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
11996 sal
= ada_decode_assert_location (arg
, &addr_string
, &cond_string
, &ops
);
11997 create_ada_exception_catchpoint (gdbarch
, sal
, addr_string
,
11998 NULL
, cond_string
, ops
, tempflag
,
12002 /* Information about operators given special treatment in functions
12004 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
12006 #define ADA_OPERATORS \
12007 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
12008 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
12009 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
12010 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
12011 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
12012 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
12013 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
12014 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
12015 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
12016 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
12017 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
12018 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
12019 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
12020 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
12021 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
12022 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
12023 OP_DEFN (OP_OTHERS, 1, 1, 0) \
12024 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
12025 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
12028 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
12031 switch (exp
->elts
[pc
- 1].opcode
)
12034 operator_length_standard (exp
, pc
, oplenp
, argsp
);
12037 #define OP_DEFN(op, len, args, binop) \
12038 case op: *oplenp = len; *argsp = args; break;
12044 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
12049 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
12054 /* Implementation of the exp_descriptor method operator_check. */
12057 ada_operator_check (struct expression
*exp
, int pos
,
12058 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
12061 const union exp_element
*const elts
= exp
->elts
;
12062 struct type
*type
= NULL
;
12064 switch (elts
[pos
].opcode
)
12066 case UNOP_IN_RANGE
:
12068 type
= elts
[pos
+ 1].type
;
12072 return operator_check_standard (exp
, pos
, objfile_func
, data
);
12075 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
12077 if (type
&& TYPE_OBJFILE (type
)
12078 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
12085 ada_op_name (enum exp_opcode opcode
)
12090 return op_name_standard (opcode
);
12092 #define OP_DEFN(op, len, args, binop) case op: return #op;
12097 return "OP_AGGREGATE";
12099 return "OP_CHOICES";
12105 /* As for operator_length, but assumes PC is pointing at the first
12106 element of the operator, and gives meaningful results only for the
12107 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
12110 ada_forward_operator_length (struct expression
*exp
, int pc
,
12111 int *oplenp
, int *argsp
)
12113 switch (exp
->elts
[pc
].opcode
)
12116 *oplenp
= *argsp
= 0;
12119 #define OP_DEFN(op, len, args, binop) \
12120 case op: *oplenp = len; *argsp = args; break;
12126 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
12131 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
12137 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
12139 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
12147 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
12149 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
12154 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
12158 /* Ada attributes ('Foo). */
12161 case OP_ATR_LENGTH
:
12165 case OP_ATR_MODULUS
:
12172 case UNOP_IN_RANGE
:
12174 /* XXX: gdb_sprint_host_address, type_sprint */
12175 fprintf_filtered (stream
, _("Type @"));
12176 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
12177 fprintf_filtered (stream
, " (");
12178 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
12179 fprintf_filtered (stream
, ")");
12181 case BINOP_IN_BOUNDS
:
12182 fprintf_filtered (stream
, " (%d)",
12183 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
12185 case TERNOP_IN_RANGE
:
12190 case OP_DISCRETE_RANGE
:
12191 case OP_POSITIONAL
:
12198 char *name
= &exp
->elts
[elt
+ 2].string
;
12199 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
12201 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
12206 return dump_subexp_body_standard (exp
, stream
, elt
);
12210 for (i
= 0; i
< nargs
; i
+= 1)
12211 elt
= dump_subexp (exp
, stream
, elt
);
12216 /* The Ada extension of print_subexp (q.v.). */
12219 ada_print_subexp (struct expression
*exp
, int *pos
,
12220 struct ui_file
*stream
, enum precedence prec
)
12222 int oplen
, nargs
, i
;
12224 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
12226 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
12233 print_subexp_standard (exp
, pos
, stream
, prec
);
12237 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
12240 case BINOP_IN_BOUNDS
:
12241 /* XXX: sprint_subexp */
12242 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12243 fputs_filtered (" in ", stream
);
12244 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12245 fputs_filtered ("'range", stream
);
12246 if (exp
->elts
[pc
+ 1].longconst
> 1)
12247 fprintf_filtered (stream
, "(%ld)",
12248 (long) exp
->elts
[pc
+ 1].longconst
);
12251 case TERNOP_IN_RANGE
:
12252 if (prec
>= PREC_EQUAL
)
12253 fputs_filtered ("(", stream
);
12254 /* XXX: sprint_subexp */
12255 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12256 fputs_filtered (" in ", stream
);
12257 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
12258 fputs_filtered (" .. ", stream
);
12259 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
12260 if (prec
>= PREC_EQUAL
)
12261 fputs_filtered (")", stream
);
12266 case OP_ATR_LENGTH
:
12270 case OP_ATR_MODULUS
:
12275 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
12277 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
12278 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
12282 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12283 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
12288 for (tem
= 1; tem
< nargs
; tem
+= 1)
12290 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
12291 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
12293 fputs_filtered (")", stream
);
12298 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
12299 fputs_filtered ("'(", stream
);
12300 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
12301 fputs_filtered (")", stream
);
12304 case UNOP_IN_RANGE
:
12305 /* XXX: sprint_subexp */
12306 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12307 fputs_filtered (" in ", stream
);
12308 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
12311 case OP_DISCRETE_RANGE
:
12312 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12313 fputs_filtered ("..", stream
);
12314 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12318 fputs_filtered ("others => ", stream
);
12319 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12323 for (i
= 0; i
< nargs
-1; i
+= 1)
12326 fputs_filtered ("|", stream
);
12327 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12329 fputs_filtered (" => ", stream
);
12330 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12333 case OP_POSITIONAL
:
12334 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12338 fputs_filtered ("(", stream
);
12339 for (i
= 0; i
< nargs
; i
+= 1)
12342 fputs_filtered (", ", stream
);
12343 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12345 fputs_filtered (")", stream
);
12350 /* Table mapping opcodes into strings for printing operators
12351 and precedences of the operators. */
12353 static const struct op_print ada_op_print_tab
[] = {
12354 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
12355 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
12356 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
12357 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
12358 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
12359 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
12360 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
12361 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
12362 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
12363 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
12364 {">", BINOP_GTR
, PREC_ORDER
, 0},
12365 {"<", BINOP_LESS
, PREC_ORDER
, 0},
12366 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
12367 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
12368 {"+", BINOP_ADD
, PREC_ADD
, 0},
12369 {"-", BINOP_SUB
, PREC_ADD
, 0},
12370 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
12371 {"*", BINOP_MUL
, PREC_MUL
, 0},
12372 {"/", BINOP_DIV
, PREC_MUL
, 0},
12373 {"rem", BINOP_REM
, PREC_MUL
, 0},
12374 {"mod", BINOP_MOD
, PREC_MUL
, 0},
12375 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
12376 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
12377 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
12378 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
12379 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
12380 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
12381 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
12382 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
12383 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
12384 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
12388 enum ada_primitive_types
{
12389 ada_primitive_type_int
,
12390 ada_primitive_type_long
,
12391 ada_primitive_type_short
,
12392 ada_primitive_type_char
,
12393 ada_primitive_type_float
,
12394 ada_primitive_type_double
,
12395 ada_primitive_type_void
,
12396 ada_primitive_type_long_long
,
12397 ada_primitive_type_long_double
,
12398 ada_primitive_type_natural
,
12399 ada_primitive_type_positive
,
12400 ada_primitive_type_system_address
,
12401 nr_ada_primitive_types
12405 ada_language_arch_info (struct gdbarch
*gdbarch
,
12406 struct language_arch_info
*lai
)
12408 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
12410 lai
->primitive_type_vector
12411 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
12414 lai
->primitive_type_vector
[ada_primitive_type_int
]
12415 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12417 lai
->primitive_type_vector
[ada_primitive_type_long
]
12418 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
12419 0, "long_integer");
12420 lai
->primitive_type_vector
[ada_primitive_type_short
]
12421 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
12422 0, "short_integer");
12423 lai
->string_char_type
12424 = lai
->primitive_type_vector
[ada_primitive_type_char
]
12425 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
12426 lai
->primitive_type_vector
[ada_primitive_type_float
]
12427 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
12429 lai
->primitive_type_vector
[ada_primitive_type_double
]
12430 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12431 "long_float", NULL
);
12432 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
12433 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
12434 0, "long_long_integer");
12435 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
12436 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12437 "long_long_float", NULL
);
12438 lai
->primitive_type_vector
[ada_primitive_type_natural
]
12439 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12441 lai
->primitive_type_vector
[ada_primitive_type_positive
]
12442 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12444 lai
->primitive_type_vector
[ada_primitive_type_void
]
12445 = builtin
->builtin_void
;
12447 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
12448 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
12449 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
12450 = "system__address";
12452 lai
->bool_type_symbol
= NULL
;
12453 lai
->bool_type_default
= builtin
->builtin_bool
;
12456 /* Language vector */
12458 /* Not really used, but needed in the ada_language_defn. */
12461 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
12463 ada_emit_char (c
, type
, stream
, quoter
, 1);
12469 warnings_issued
= 0;
12470 return ada_parse ();
12473 static const struct exp_descriptor ada_exp_descriptor
= {
12475 ada_operator_length
,
12476 ada_operator_check
,
12478 ada_dump_subexp_body
,
12479 ada_evaluate_subexp
12482 /* Implement the "la_get_symbol_name_cmp" language_defn method
12485 static symbol_name_cmp_ftype
12486 ada_get_symbol_name_cmp (const char *lookup_name
)
12488 if (should_use_wild_match (lookup_name
))
12491 return compare_names
;
12494 /* Implement the "la_read_var_value" language_defn method for Ada. */
12496 static struct value
*
12497 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
12499 struct block
*frame_block
= NULL
;
12500 struct symbol
*renaming_sym
= NULL
;
12502 /* The only case where default_read_var_value is not sufficient
12503 is when VAR is a renaming... */
12505 frame_block
= get_frame_block (frame
, NULL
);
12507 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
12508 if (renaming_sym
!= NULL
)
12509 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
12511 /* This is a typical case where we expect the default_read_var_value
12512 function to work. */
12513 return default_read_var_value (var
, frame
);
12516 const struct language_defn ada_language_defn
= {
12517 "ada", /* Language name */
12521 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
12522 that's not quite what this means. */
12524 macro_expansion_no
,
12525 &ada_exp_descriptor
,
12529 ada_printchar
, /* Print a character constant */
12530 ada_printstr
, /* Function to print string constant */
12531 emit_char
, /* Function to print single char (not used) */
12532 ada_print_type
, /* Print a type using appropriate syntax */
12533 ada_print_typedef
, /* Print a typedef using appropriate syntax */
12534 ada_val_print
, /* Print a value using appropriate syntax */
12535 ada_value_print
, /* Print a top-level value */
12536 ada_read_var_value
, /* la_read_var_value */
12537 NULL
, /* Language specific skip_trampoline */
12538 NULL
, /* name_of_this */
12539 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
12540 basic_lookup_transparent_type
, /* lookup_transparent_type */
12541 ada_la_decode
, /* Language specific symbol demangler */
12542 NULL
, /* Language specific
12543 class_name_from_physname */
12544 ada_op_print_tab
, /* expression operators for printing */
12545 0, /* c-style arrays */
12546 1, /* String lower bound */
12547 ada_get_gdb_completer_word_break_characters
,
12548 ada_make_symbol_completion_list
,
12549 ada_language_arch_info
,
12550 ada_print_array_index
,
12551 default_pass_by_reference
,
12553 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
12554 ada_iterate_over_symbols
,
12558 /* Provide a prototype to silence -Wmissing-prototypes. */
12559 extern initialize_file_ftype _initialize_ada_language
;
12561 /* Command-list for the "set/show ada" prefix command. */
12562 static struct cmd_list_element
*set_ada_list
;
12563 static struct cmd_list_element
*show_ada_list
;
12565 /* Implement the "set ada" prefix command. */
12568 set_ada_command (char *arg
, int from_tty
)
12570 printf_unfiltered (_(\
12571 "\"set ada\" must be followed by the name of a setting.\n"));
12572 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
12575 /* Implement the "show ada" prefix command. */
12578 show_ada_command (char *args
, int from_tty
)
12580 cmd_show_list (show_ada_list
, from_tty
, "");
12584 initialize_ada_catchpoint_ops (void)
12586 struct breakpoint_ops
*ops
;
12588 initialize_breakpoint_ops ();
12590 ops
= &catch_exception_breakpoint_ops
;
12591 *ops
= bkpt_breakpoint_ops
;
12592 ops
->dtor
= dtor_catch_exception
;
12593 ops
->allocate_location
= allocate_location_catch_exception
;
12594 ops
->re_set
= re_set_catch_exception
;
12595 ops
->check_status
= check_status_catch_exception
;
12596 ops
->print_it
= print_it_catch_exception
;
12597 ops
->print_one
= print_one_catch_exception
;
12598 ops
->print_mention
= print_mention_catch_exception
;
12599 ops
->print_recreate
= print_recreate_catch_exception
;
12601 ops
= &catch_exception_unhandled_breakpoint_ops
;
12602 *ops
= bkpt_breakpoint_ops
;
12603 ops
->dtor
= dtor_catch_exception_unhandled
;
12604 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
12605 ops
->re_set
= re_set_catch_exception_unhandled
;
12606 ops
->check_status
= check_status_catch_exception_unhandled
;
12607 ops
->print_it
= print_it_catch_exception_unhandled
;
12608 ops
->print_one
= print_one_catch_exception_unhandled
;
12609 ops
->print_mention
= print_mention_catch_exception_unhandled
;
12610 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
12612 ops
= &catch_assert_breakpoint_ops
;
12613 *ops
= bkpt_breakpoint_ops
;
12614 ops
->dtor
= dtor_catch_assert
;
12615 ops
->allocate_location
= allocate_location_catch_assert
;
12616 ops
->re_set
= re_set_catch_assert
;
12617 ops
->check_status
= check_status_catch_assert
;
12618 ops
->print_it
= print_it_catch_assert
;
12619 ops
->print_one
= print_one_catch_assert
;
12620 ops
->print_mention
= print_mention_catch_assert
;
12621 ops
->print_recreate
= print_recreate_catch_assert
;
12625 _initialize_ada_language (void)
12627 add_language (&ada_language_defn
);
12629 initialize_ada_catchpoint_ops ();
12631 add_prefix_cmd ("ada", no_class
, set_ada_command
,
12632 _("Prefix command for changing Ada-specfic settings"),
12633 &set_ada_list
, "set ada ", 0, &setlist
);
12635 add_prefix_cmd ("ada", no_class
, show_ada_command
,
12636 _("Generic command for showing Ada-specific settings."),
12637 &show_ada_list
, "show ada ", 0, &showlist
);
12639 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
12640 &trust_pad_over_xvs
, _("\
12641 Enable or disable an optimization trusting PAD types over XVS types"), _("\
12642 Show whether an optimization trusting PAD types over XVS types is activated"),
12644 This is related to the encoding used by the GNAT compiler. The debugger\n\
12645 should normally trust the contents of PAD types, but certain older versions\n\
12646 of GNAT have a bug that sometimes causes the information in the PAD type\n\
12647 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
12648 work around this bug. It is always safe to turn this option \"off\", but\n\
12649 this incurs a slight performance penalty, so it is recommended to NOT change\n\
12650 this option to \"off\" unless necessary."),
12651 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
12653 add_catch_command ("exception", _("\
12654 Catch Ada exceptions, when raised.\n\
12655 With an argument, catch only exceptions with the given name."),
12656 catch_ada_exception_command
,
12660 add_catch_command ("assert", _("\
12661 Catch failed Ada assertions, when raised.\n\
12662 With an argument, catch only exceptions with the given name."),
12663 catch_assert_command
,
12668 varsize_limit
= 65536;
12670 obstack_init (&symbol_list_obstack
);
12672 decoded_names_store
= htab_create_alloc
12673 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
12674 NULL
, xcalloc
, xfree
);
12676 /* Setup per-inferior data. */
12677 observer_attach_inferior_exit (ada_inferior_exit
);
12679 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup
);