1 /* Ada language support routines for GDB, the GNU debugger.
3 Copyright (C) 1992-1994, 1997-2000, 2003-2005, 2007-2012 Free
4 Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
64 #include "mi/mi-common.h"
65 #include "arch-utils.h"
66 #include "exceptions.h"
67 #include "cli/cli-utils.h"
69 /* Define whether or not the C operator '/' truncates towards zero for
70 differently signed operands (truncation direction is undefined in C).
71 Copied from valarith.c. */
73 #ifndef TRUNCATION_TOWARDS_ZERO
74 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
77 static struct type
*desc_base_type (struct type
*);
79 static struct type
*desc_bounds_type (struct type
*);
81 static struct value
*desc_bounds (struct value
*);
83 static int fat_pntr_bounds_bitpos (struct type
*);
85 static int fat_pntr_bounds_bitsize (struct type
*);
87 static struct type
*desc_data_target_type (struct type
*);
89 static struct value
*desc_data (struct value
*);
91 static int fat_pntr_data_bitpos (struct type
*);
93 static int fat_pntr_data_bitsize (struct type
*);
95 static struct value
*desc_one_bound (struct value
*, int, int);
97 static int desc_bound_bitpos (struct type
*, int, int);
99 static int desc_bound_bitsize (struct type
*, int, int);
101 static struct type
*desc_index_type (struct type
*, int);
103 static int desc_arity (struct type
*);
105 static int ada_type_match (struct type
*, struct type
*, int);
107 static int ada_args_match (struct symbol
*, struct value
**, int);
109 static int full_match (const char *, const char *);
111 static struct value
*make_array_descriptor (struct type
*, struct value
*);
113 static void ada_add_block_symbols (struct obstack
*,
114 struct block
*, const char *,
115 domain_enum
, struct objfile
*, int);
117 static int is_nonfunction (struct ada_symbol_info
*, int);
119 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
122 static int num_defns_collected (struct obstack
*);
124 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
126 static struct value
*resolve_subexp (struct expression
**, int *, int,
129 static void replace_operator_with_call (struct expression
**, int, int, int,
130 struct symbol
*, struct block
*);
132 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
134 static char *ada_op_name (enum exp_opcode
);
136 static const char *ada_decoded_op_name (enum exp_opcode
);
138 static int numeric_type_p (struct type
*);
140 static int integer_type_p (struct type
*);
142 static int scalar_type_p (struct type
*);
144 static int discrete_type_p (struct type
*);
146 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
151 static struct symbol
*find_old_style_renaming_symbol (const char *,
154 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
157 static struct value
*evaluate_subexp_type (struct expression
*, int *);
159 static struct type
*ada_find_parallel_type_with_name (struct type
*,
162 static int is_dynamic_field (struct type
*, int);
164 static struct type
*to_fixed_variant_branch_type (struct type
*,
166 CORE_ADDR
, struct value
*);
168 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
170 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
172 static struct type
*to_static_fixed_type (struct type
*);
173 static struct type
*static_unwrap_type (struct type
*type
);
175 static struct value
*unwrap_value (struct value
*);
177 static struct type
*constrained_packed_array_type (struct type
*, long *);
179 static struct type
*decode_constrained_packed_array_type (struct type
*);
181 static long decode_packed_array_bitsize (struct type
*);
183 static struct value
*decode_constrained_packed_array (struct value
*);
185 static int ada_is_packed_array_type (struct type
*);
187 static int ada_is_unconstrained_packed_array_type (struct type
*);
189 static struct value
*value_subscript_packed (struct value
*, int,
192 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
194 static struct value
*coerce_unspec_val_to_type (struct value
*,
197 static struct value
*get_var_value (char *, char *);
199 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
201 static int equiv_types (struct type
*, struct type
*);
203 static int is_name_suffix (const char *);
205 static int advance_wild_match (const char **, const char *, int);
207 static int wild_match (const char *, const char *);
209 static struct value
*ada_coerce_ref (struct value
*);
211 static LONGEST
pos_atr (struct value
*);
213 static struct value
*value_pos_atr (struct type
*, struct value
*);
215 static struct value
*value_val_atr (struct type
*, struct value
*);
217 static struct symbol
*standard_lookup (const char *, const struct block
*,
220 static struct value
*ada_search_struct_field (char *, struct value
*, int,
223 static struct value
*ada_value_primitive_field (struct value
*, int, int,
226 static int find_struct_field (const char *, struct type
*, int,
227 struct type
**, int *, int *, int *, int *);
229 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
232 static int ada_resolve_function (struct ada_symbol_info
*, int,
233 struct value
**, int, const char *,
236 static int ada_is_direct_array_type (struct type
*);
238 static void ada_language_arch_info (struct gdbarch
*,
239 struct language_arch_info
*);
241 static void check_size (const struct type
*);
243 static struct value
*ada_index_struct_field (int, struct value
*, int,
246 static struct value
*assign_aggregate (struct value
*, struct value
*,
250 static void aggregate_assign_from_choices (struct value
*, struct value
*,
252 int *, LONGEST
*, int *,
253 int, LONGEST
, LONGEST
);
255 static void aggregate_assign_positional (struct value
*, struct value
*,
257 int *, LONGEST
*, int *, int,
261 static void aggregate_assign_others (struct value
*, struct value
*,
263 int *, LONGEST
*, int, LONGEST
, LONGEST
);
266 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
269 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
272 static void ada_forward_operator_length (struct expression
*, int, int *,
275 static struct type
*ada_find_any_type (const char *name
);
279 /* Maximum-sized dynamic type. */
280 static unsigned int varsize_limit
;
282 /* FIXME: brobecker/2003-09-17: No longer a const because it is
283 returned by a function that does not return a const char *. */
284 static char *ada_completer_word_break_characters
=
286 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
288 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
291 /* The name of the symbol to use to get the name of the main subprogram. */
292 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
293 = "__gnat_ada_main_program_name";
295 /* Limit on the number of warnings to raise per expression evaluation. */
296 static int warning_limit
= 2;
298 /* Number of warning messages issued; reset to 0 by cleanups after
299 expression evaluation. */
300 static int warnings_issued
= 0;
302 static const char *known_runtime_file_name_patterns
[] = {
303 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
306 static const char *known_auxiliary_function_name_patterns
[] = {
307 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
310 /* Space for allocating results of ada_lookup_symbol_list. */
311 static struct obstack symbol_list_obstack
;
313 /* Inferior-specific data. */
315 /* Per-inferior data for this module. */
317 struct ada_inferior_data
319 /* The ada__tags__type_specific_data type, which is used when decoding
320 tagged types. With older versions of GNAT, this type was directly
321 accessible through a component ("tsd") in the object tag. But this
322 is no longer the case, so we cache it for each inferior. */
323 struct type
*tsd_type
;
325 /* The exception_support_info data. This data is used to determine
326 how to implement support for Ada exception catchpoints in a given
328 const struct exception_support_info
*exception_info
;
331 /* Our key to this module's inferior data. */
332 static const struct inferior_data
*ada_inferior_data
;
334 /* A cleanup routine for our inferior data. */
336 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
338 struct ada_inferior_data
*data
;
340 data
= inferior_data (inf
, ada_inferior_data
);
345 /* Return our inferior data for the given inferior (INF).
347 This function always returns a valid pointer to an allocated
348 ada_inferior_data structure. If INF's inferior data has not
349 been previously set, this functions creates a new one with all
350 fields set to zero, sets INF's inferior to it, and then returns
351 a pointer to that newly allocated ada_inferior_data. */
353 static struct ada_inferior_data
*
354 get_ada_inferior_data (struct inferior
*inf
)
356 struct ada_inferior_data
*data
;
358 data
= inferior_data (inf
, ada_inferior_data
);
361 data
= XZALLOC (struct ada_inferior_data
);
362 set_inferior_data (inf
, ada_inferior_data
, data
);
368 /* Perform all necessary cleanups regarding our module's inferior data
369 that is required after the inferior INF just exited. */
372 ada_inferior_exit (struct inferior
*inf
)
374 ada_inferior_data_cleanup (inf
, NULL
);
375 set_inferior_data (inf
, ada_inferior_data
, NULL
);
380 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
381 all typedef layers have been peeled. Otherwise, return TYPE.
383 Normally, we really expect a typedef type to only have 1 typedef layer.
384 In other words, we really expect the target type of a typedef type to be
385 a non-typedef type. This is particularly true for Ada units, because
386 the language does not have a typedef vs not-typedef distinction.
387 In that respect, the Ada compiler has been trying to eliminate as many
388 typedef definitions in the debugging information, since they generally
389 do not bring any extra information (we still use typedef under certain
390 circumstances related mostly to the GNAT encoding).
392 Unfortunately, we have seen situations where the debugging information
393 generated by the compiler leads to such multiple typedef layers. For
394 instance, consider the following example with stabs:
396 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
397 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
399 This is an error in the debugging information which causes type
400 pck__float_array___XUP to be defined twice, and the second time,
401 it is defined as a typedef of a typedef.
403 This is on the fringe of legality as far as debugging information is
404 concerned, and certainly unexpected. But it is easy to handle these
405 situations correctly, so we can afford to be lenient in this case. */
408 ada_typedef_target_type (struct type
*type
)
410 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
411 type
= TYPE_TARGET_TYPE (type
);
415 /* Given DECODED_NAME a string holding a symbol name in its
416 decoded form (ie using the Ada dotted notation), returns
417 its unqualified name. */
420 ada_unqualified_name (const char *decoded_name
)
422 const char *result
= strrchr (decoded_name
, '.');
425 result
++; /* Skip the dot... */
427 result
= decoded_name
;
432 /* Return a string starting with '<', followed by STR, and '>'.
433 The result is good until the next call. */
436 add_angle_brackets (const char *str
)
438 static char *result
= NULL
;
441 result
= xstrprintf ("<%s>", str
);
446 ada_get_gdb_completer_word_break_characters (void)
448 return ada_completer_word_break_characters
;
451 /* Print an array element index using the Ada syntax. */
454 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
455 const struct value_print_options
*options
)
457 LA_VALUE_PRINT (index_value
, stream
, options
);
458 fprintf_filtered (stream
, " => ");
461 /* Assuming VECT points to an array of *SIZE objects of size
462 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
463 updating *SIZE as necessary and returning the (new) array. */
466 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
468 if (*size
< min_size
)
471 if (*size
< min_size
)
473 vect
= xrealloc (vect
, *size
* element_size
);
478 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
479 suffix of FIELD_NAME beginning "___". */
482 field_name_match (const char *field_name
, const char *target
)
484 int len
= strlen (target
);
487 (strncmp (field_name
, target
, len
) == 0
488 && (field_name
[len
] == '\0'
489 || (strncmp (field_name
+ len
, "___", 3) == 0
490 && strcmp (field_name
+ strlen (field_name
) - 6,
495 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
496 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
497 and return its index. This function also handles fields whose name
498 have ___ suffixes because the compiler sometimes alters their name
499 by adding such a suffix to represent fields with certain constraints.
500 If the field could not be found, return a negative number if
501 MAYBE_MISSING is set. Otherwise raise an error. */
504 ada_get_field_index (const struct type
*type
, const char *field_name
,
508 struct type
*struct_type
= check_typedef ((struct type
*) type
);
510 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
511 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
515 error (_("Unable to find field %s in struct %s. Aborting"),
516 field_name
, TYPE_NAME (struct_type
));
521 /* The length of the prefix of NAME prior to any "___" suffix. */
524 ada_name_prefix_len (const char *name
)
530 const char *p
= strstr (name
, "___");
533 return strlen (name
);
539 /* Return non-zero if SUFFIX is a suffix of STR.
540 Return zero if STR is null. */
543 is_suffix (const char *str
, const char *suffix
)
550 len2
= strlen (suffix
);
551 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
554 /* The contents of value VAL, treated as a value of type TYPE. The
555 result is an lval in memory if VAL is. */
557 static struct value
*
558 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
560 type
= ada_check_typedef (type
);
561 if (value_type (val
) == type
)
565 struct value
*result
;
567 /* Make sure that the object size is not unreasonable before
568 trying to allocate some memory for it. */
572 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
573 result
= allocate_value_lazy (type
);
576 result
= allocate_value (type
);
577 memcpy (value_contents_raw (result
), value_contents (val
),
580 set_value_component_location (result
, val
);
581 set_value_bitsize (result
, value_bitsize (val
));
582 set_value_bitpos (result
, value_bitpos (val
));
583 set_value_address (result
, value_address (val
));
588 static const gdb_byte
*
589 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
594 return valaddr
+ offset
;
598 cond_offset_target (CORE_ADDR address
, long offset
)
603 return address
+ offset
;
606 /* Issue a warning (as for the definition of warning in utils.c, but
607 with exactly one argument rather than ...), unless the limit on the
608 number of warnings has passed during the evaluation of the current
611 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
612 provided by "complaint". */
613 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
616 lim_warning (const char *format
, ...)
620 va_start (args
, format
);
621 warnings_issued
+= 1;
622 if (warnings_issued
<= warning_limit
)
623 vwarning (format
, args
);
628 /* Issue an error if the size of an object of type T is unreasonable,
629 i.e. if it would be a bad idea to allocate a value of this type in
633 check_size (const struct type
*type
)
635 if (TYPE_LENGTH (type
) > varsize_limit
)
636 error (_("object size is larger than varsize-limit"));
639 /* Maximum value of a SIZE-byte signed integer type. */
641 max_of_size (int size
)
643 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
645 return top_bit
| (top_bit
- 1);
648 /* Minimum value of a SIZE-byte signed integer type. */
650 min_of_size (int size
)
652 return -max_of_size (size
) - 1;
655 /* Maximum value of a SIZE-byte unsigned integer type. */
657 umax_of_size (int size
)
659 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
661 return top_bit
| (top_bit
- 1);
664 /* Maximum value of integral type T, as a signed quantity. */
666 max_of_type (struct type
*t
)
668 if (TYPE_UNSIGNED (t
))
669 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
671 return max_of_size (TYPE_LENGTH (t
));
674 /* Minimum value of integral type T, as a signed quantity. */
676 min_of_type (struct type
*t
)
678 if (TYPE_UNSIGNED (t
))
681 return min_of_size (TYPE_LENGTH (t
));
684 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
686 ada_discrete_type_high_bound (struct type
*type
)
688 switch (TYPE_CODE (type
))
690 case TYPE_CODE_RANGE
:
691 return TYPE_HIGH_BOUND (type
);
693 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
698 return max_of_type (type
);
700 error (_("Unexpected type in ada_discrete_type_high_bound."));
704 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
706 ada_discrete_type_low_bound (struct type
*type
)
708 switch (TYPE_CODE (type
))
710 case TYPE_CODE_RANGE
:
711 return TYPE_LOW_BOUND (type
);
713 return TYPE_FIELD_BITPOS (type
, 0);
718 return min_of_type (type
);
720 error (_("Unexpected type in ada_discrete_type_low_bound."));
724 /* The identity on non-range types. For range types, the underlying
725 non-range scalar type. */
728 get_base_type (struct type
*type
)
730 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
732 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
734 type
= TYPE_TARGET_TYPE (type
);
739 /* Return a decoded version of the given VALUE. This means returning
740 a value whose type is obtained by applying all the GNAT-specific
741 encondings, making the resulting type a static but standard description
742 of the initial type. */
745 ada_get_decoded_value (struct value
*value
)
747 struct type
*type
= ada_check_typedef (value_type (value
));
749 if (ada_is_array_descriptor_type (type
)
750 || (ada_is_constrained_packed_array_type (type
)
751 && TYPE_CODE (type
) != TYPE_CODE_PTR
))
753 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
) /* array access type. */
754 value
= ada_coerce_to_simple_array_ptr (value
);
756 value
= ada_coerce_to_simple_array (value
);
759 value
= ada_to_fixed_value (value
);
764 /* Same as ada_get_decoded_value, but with the given TYPE.
765 Because there is no associated actual value for this type,
766 the resulting type might be a best-effort approximation in
767 the case of dynamic types. */
770 ada_get_decoded_type (struct type
*type
)
772 type
= to_static_fixed_type (type
);
773 if (ada_is_constrained_packed_array_type (type
))
774 type
= ada_coerce_to_simple_array_type (type
);
780 /* Language Selection */
782 /* If the main program is in Ada, return language_ada, otherwise return LANG
783 (the main program is in Ada iif the adainit symbol is found). */
786 ada_update_initial_language (enum language lang
)
788 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
789 (struct objfile
*) NULL
) != NULL
)
795 /* If the main procedure is written in Ada, then return its name.
796 The result is good until the next call. Return NULL if the main
797 procedure doesn't appear to be in Ada. */
802 struct minimal_symbol
*msym
;
803 static char *main_program_name
= NULL
;
805 /* For Ada, the name of the main procedure is stored in a specific
806 string constant, generated by the binder. Look for that symbol,
807 extract its address, and then read that string. If we didn't find
808 that string, then most probably the main procedure is not written
810 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
814 CORE_ADDR main_program_name_addr
;
817 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
818 if (main_program_name_addr
== 0)
819 error (_("Invalid address for Ada main program name."));
821 xfree (main_program_name
);
822 target_read_string (main_program_name_addr
, &main_program_name
,
827 return main_program_name
;
830 /* The main procedure doesn't seem to be in Ada. */
836 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
839 const struct ada_opname_map ada_opname_table
[] = {
840 {"Oadd", "\"+\"", BINOP_ADD
},
841 {"Osubtract", "\"-\"", BINOP_SUB
},
842 {"Omultiply", "\"*\"", BINOP_MUL
},
843 {"Odivide", "\"/\"", BINOP_DIV
},
844 {"Omod", "\"mod\"", BINOP_MOD
},
845 {"Orem", "\"rem\"", BINOP_REM
},
846 {"Oexpon", "\"**\"", BINOP_EXP
},
847 {"Olt", "\"<\"", BINOP_LESS
},
848 {"Ole", "\"<=\"", BINOP_LEQ
},
849 {"Ogt", "\">\"", BINOP_GTR
},
850 {"Oge", "\">=\"", BINOP_GEQ
},
851 {"Oeq", "\"=\"", BINOP_EQUAL
},
852 {"One", "\"/=\"", BINOP_NOTEQUAL
},
853 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
854 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
855 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
856 {"Oconcat", "\"&\"", BINOP_CONCAT
},
857 {"Oabs", "\"abs\"", UNOP_ABS
},
858 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
859 {"Oadd", "\"+\"", UNOP_PLUS
},
860 {"Osubtract", "\"-\"", UNOP_NEG
},
864 /* The "encoded" form of DECODED, according to GNAT conventions.
865 The result is valid until the next call to ada_encode. */
868 ada_encode (const char *decoded
)
870 static char *encoding_buffer
= NULL
;
871 static size_t encoding_buffer_size
= 0;
878 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
879 2 * strlen (decoded
) + 10);
882 for (p
= decoded
; *p
!= '\0'; p
+= 1)
886 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
891 const struct ada_opname_map
*mapping
;
893 for (mapping
= ada_opname_table
;
894 mapping
->encoded
!= NULL
895 && strncmp (mapping
->decoded
, p
,
896 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
898 if (mapping
->encoded
== NULL
)
899 error (_("invalid Ada operator name: %s"), p
);
900 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
901 k
+= strlen (mapping
->encoded
);
906 encoding_buffer
[k
] = *p
;
911 encoding_buffer
[k
] = '\0';
912 return encoding_buffer
;
915 /* Return NAME folded to lower case, or, if surrounded by single
916 quotes, unfolded, but with the quotes stripped away. Result good
920 ada_fold_name (const char *name
)
922 static char *fold_buffer
= NULL
;
923 static size_t fold_buffer_size
= 0;
925 int len
= strlen (name
);
926 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
930 strncpy (fold_buffer
, name
+ 1, len
- 2);
931 fold_buffer
[len
- 2] = '\000';
937 for (i
= 0; i
<= len
; i
+= 1)
938 fold_buffer
[i
] = tolower (name
[i
]);
944 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
947 is_lower_alphanum (const char c
)
949 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
952 /* ENCODED is the linkage name of a symbol and LEN contains its length.
953 This function saves in LEN the length of that same symbol name but
954 without either of these suffixes:
960 These are suffixes introduced by the compiler for entities such as
961 nested subprogram for instance, in order to avoid name clashes.
962 They do not serve any purpose for the debugger. */
965 ada_remove_trailing_digits (const char *encoded
, int *len
)
967 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
971 while (i
> 0 && isdigit (encoded
[i
]))
973 if (i
>= 0 && encoded
[i
] == '.')
975 else if (i
>= 0 && encoded
[i
] == '$')
977 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
979 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
984 /* Remove the suffix introduced by the compiler for protected object
988 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
990 /* Remove trailing N. */
992 /* Protected entry subprograms are broken into two
993 separate subprograms: The first one is unprotected, and has
994 a 'N' suffix; the second is the protected version, and has
995 the 'P' suffix. The second calls the first one after handling
996 the protection. Since the P subprograms are internally generated,
997 we leave these names undecoded, giving the user a clue that this
998 entity is internal. */
1001 && encoded
[*len
- 1] == 'N'
1002 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
1006 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
1009 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
1013 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
1016 if (encoded
[i
] != 'X')
1022 if (isalnum (encoded
[i
-1]))
1026 /* If ENCODED follows the GNAT entity encoding conventions, then return
1027 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
1028 replaced by ENCODED.
1030 The resulting string is valid until the next call of ada_decode.
1031 If the string is unchanged by decoding, the original string pointer
1035 ada_decode (const char *encoded
)
1042 static char *decoding_buffer
= NULL
;
1043 static size_t decoding_buffer_size
= 0;
1045 /* The name of the Ada main procedure starts with "_ada_".
1046 This prefix is not part of the decoded name, so skip this part
1047 if we see this prefix. */
1048 if (strncmp (encoded
, "_ada_", 5) == 0)
1051 /* If the name starts with '_', then it is not a properly encoded
1052 name, so do not attempt to decode it. Similarly, if the name
1053 starts with '<', the name should not be decoded. */
1054 if (encoded
[0] == '_' || encoded
[0] == '<')
1057 len0
= strlen (encoded
);
1059 ada_remove_trailing_digits (encoded
, &len0
);
1060 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1062 /* Remove the ___X.* suffix if present. Do not forget to verify that
1063 the suffix is located before the current "end" of ENCODED. We want
1064 to avoid re-matching parts of ENCODED that have previously been
1065 marked as discarded (by decrementing LEN0). */
1066 p
= strstr (encoded
, "___");
1067 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1075 /* Remove any trailing TKB suffix. It tells us that this symbol
1076 is for the body of a task, but that information does not actually
1077 appear in the decoded name. */
1079 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1082 /* Remove any trailing TB suffix. The TB suffix is slightly different
1083 from the TKB suffix because it is used for non-anonymous task
1086 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1089 /* Remove trailing "B" suffixes. */
1090 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1092 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1095 /* Make decoded big enough for possible expansion by operator name. */
1097 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1098 decoded
= decoding_buffer
;
1100 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1102 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1105 while ((i
>= 0 && isdigit (encoded
[i
]))
1106 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1108 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1110 else if (encoded
[i
] == '$')
1114 /* The first few characters that are not alphabetic are not part
1115 of any encoding we use, so we can copy them over verbatim. */
1117 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1118 decoded
[j
] = encoded
[i
];
1123 /* Is this a symbol function? */
1124 if (at_start_name
&& encoded
[i
] == 'O')
1128 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1130 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1131 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1133 && !isalnum (encoded
[i
+ op_len
]))
1135 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1138 j
+= strlen (ada_opname_table
[k
].decoded
);
1142 if (ada_opname_table
[k
].encoded
!= NULL
)
1147 /* Replace "TK__" with "__", which will eventually be translated
1148 into "." (just below). */
1150 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1153 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1154 be translated into "." (just below). These are internal names
1155 generated for anonymous blocks inside which our symbol is nested. */
1157 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1158 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1159 && isdigit (encoded
[i
+4]))
1163 while (k
< len0
&& isdigit (encoded
[k
]))
1164 k
++; /* Skip any extra digit. */
1166 /* Double-check that the "__B_{DIGITS}+" sequence we found
1167 is indeed followed by "__". */
1168 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1172 /* Remove _E{DIGITS}+[sb] */
1174 /* Just as for protected object subprograms, there are 2 categories
1175 of subprograms created by the compiler for each entry. The first
1176 one implements the actual entry code, and has a suffix following
1177 the convention above; the second one implements the barrier and
1178 uses the same convention as above, except that the 'E' is replaced
1181 Just as above, we do not decode the name of barrier functions
1182 to give the user a clue that the code he is debugging has been
1183 internally generated. */
1185 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1186 && isdigit (encoded
[i
+2]))
1190 while (k
< len0
&& isdigit (encoded
[k
]))
1194 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1197 /* Just as an extra precaution, make sure that if this
1198 suffix is followed by anything else, it is a '_'.
1199 Otherwise, we matched this sequence by accident. */
1201 || (k
< len0
&& encoded
[k
] == '_'))
1206 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1207 the GNAT front-end in protected object subprograms. */
1210 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1212 /* Backtrack a bit up until we reach either the begining of
1213 the encoded name, or "__". Make sure that we only find
1214 digits or lowercase characters. */
1215 const char *ptr
= encoded
+ i
- 1;
1217 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1220 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1224 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1226 /* This is a X[bn]* sequence not separated from the previous
1227 part of the name with a non-alpha-numeric character (in other
1228 words, immediately following an alpha-numeric character), then
1229 verify that it is placed at the end of the encoded name. If
1230 not, then the encoding is not valid and we should abort the
1231 decoding. Otherwise, just skip it, it is used in body-nested
1235 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1239 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1241 /* Replace '__' by '.'. */
1249 /* It's a character part of the decoded name, so just copy it
1251 decoded
[j
] = encoded
[i
];
1256 decoded
[j
] = '\000';
1258 /* Decoded names should never contain any uppercase character.
1259 Double-check this, and abort the decoding if we find one. */
1261 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1262 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1265 if (strcmp (decoded
, encoded
) == 0)
1271 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1272 decoded
= decoding_buffer
;
1273 if (encoded
[0] == '<')
1274 strcpy (decoded
, encoded
);
1276 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1281 /* Table for keeping permanent unique copies of decoded names. Once
1282 allocated, names in this table are never released. While this is a
1283 storage leak, it should not be significant unless there are massive
1284 changes in the set of decoded names in successive versions of a
1285 symbol table loaded during a single session. */
1286 static struct htab
*decoded_names_store
;
1288 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1289 in the language-specific part of GSYMBOL, if it has not been
1290 previously computed. Tries to save the decoded name in the same
1291 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1292 in any case, the decoded symbol has a lifetime at least that of
1294 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1295 const, but nevertheless modified to a semantically equivalent form
1296 when a decoded name is cached in it. */
1299 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1302 (char **) &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1304 if (*resultp
== NULL
)
1306 const char *decoded
= ada_decode (gsymbol
->name
);
1308 if (gsymbol
->obj_section
!= NULL
)
1310 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1312 *resultp
= obsavestring (decoded
, strlen (decoded
),
1313 &objf
->objfile_obstack
);
1315 /* Sometimes, we can't find a corresponding objfile, in which
1316 case, we put the result on the heap. Since we only decode
1317 when needed, we hope this usually does not cause a
1318 significant memory leak (FIXME). */
1319 if (*resultp
== NULL
)
1321 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1325 *slot
= xstrdup (decoded
);
1334 ada_la_decode (const char *encoded
, int options
)
1336 return xstrdup (ada_decode (encoded
));
1339 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1340 suffixes that encode debugging information or leading _ada_ on
1341 SYM_NAME (see is_name_suffix commentary for the debugging
1342 information that is ignored). If WILD, then NAME need only match a
1343 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1344 either argument is NULL. */
1347 match_name (const char *sym_name
, const char *name
, int wild
)
1349 if (sym_name
== NULL
|| name
== NULL
)
1352 return wild_match (sym_name
, name
) == 0;
1355 int len_name
= strlen (name
);
1357 return (strncmp (sym_name
, name
, len_name
) == 0
1358 && is_name_suffix (sym_name
+ len_name
))
1359 || (strncmp (sym_name
, "_ada_", 5) == 0
1360 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1361 && is_name_suffix (sym_name
+ len_name
+ 5));
1368 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1369 generated by the GNAT compiler to describe the index type used
1370 for each dimension of an array, check whether it follows the latest
1371 known encoding. If not, fix it up to conform to the latest encoding.
1372 Otherwise, do nothing. This function also does nothing if
1373 INDEX_DESC_TYPE is NULL.
1375 The GNAT encoding used to describle the array index type evolved a bit.
1376 Initially, the information would be provided through the name of each
1377 field of the structure type only, while the type of these fields was
1378 described as unspecified and irrelevant. The debugger was then expected
1379 to perform a global type lookup using the name of that field in order
1380 to get access to the full index type description. Because these global
1381 lookups can be very expensive, the encoding was later enhanced to make
1382 the global lookup unnecessary by defining the field type as being
1383 the full index type description.
1385 The purpose of this routine is to allow us to support older versions
1386 of the compiler by detecting the use of the older encoding, and by
1387 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1388 we essentially replace each field's meaningless type by the associated
1392 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1396 if (index_desc_type
== NULL
)
1398 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1400 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1401 to check one field only, no need to check them all). If not, return
1404 If our INDEX_DESC_TYPE was generated using the older encoding,
1405 the field type should be a meaningless integer type whose name
1406 is not equal to the field name. */
1407 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1408 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1409 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1412 /* Fixup each field of INDEX_DESC_TYPE. */
1413 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1415 const char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1416 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1419 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1423 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1425 static char *bound_name
[] = {
1426 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1427 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1430 /* Maximum number of array dimensions we are prepared to handle. */
1432 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1435 /* The desc_* routines return primitive portions of array descriptors
1438 /* The descriptor or array type, if any, indicated by TYPE; removes
1439 level of indirection, if needed. */
1441 static struct type
*
1442 desc_base_type (struct type
*type
)
1446 type
= ada_check_typedef (type
);
1447 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1448 type
= ada_typedef_target_type (type
);
1451 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1452 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1453 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1458 /* True iff TYPE indicates a "thin" array pointer type. */
1461 is_thin_pntr (struct type
*type
)
1464 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1465 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1468 /* The descriptor type for thin pointer type TYPE. */
1470 static struct type
*
1471 thin_descriptor_type (struct type
*type
)
1473 struct type
*base_type
= desc_base_type (type
);
1475 if (base_type
== NULL
)
1477 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1481 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1483 if (alt_type
== NULL
)
1490 /* A pointer to the array data for thin-pointer value VAL. */
1492 static struct value
*
1493 thin_data_pntr (struct value
*val
)
1495 struct type
*type
= ada_check_typedef (value_type (val
));
1496 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1498 data_type
= lookup_pointer_type (data_type
);
1500 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1501 return value_cast (data_type
, value_copy (val
));
1503 return value_from_longest (data_type
, value_address (val
));
1506 /* True iff TYPE indicates a "thick" array pointer type. */
1509 is_thick_pntr (struct type
*type
)
1511 type
= desc_base_type (type
);
1512 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1513 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1516 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1517 pointer to one, the type of its bounds data; otherwise, NULL. */
1519 static struct type
*
1520 desc_bounds_type (struct type
*type
)
1524 type
= desc_base_type (type
);
1528 else if (is_thin_pntr (type
))
1530 type
= thin_descriptor_type (type
);
1533 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1535 return ada_check_typedef (r
);
1537 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1539 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1541 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1546 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1547 one, a pointer to its bounds data. Otherwise NULL. */
1549 static struct value
*
1550 desc_bounds (struct value
*arr
)
1552 struct type
*type
= ada_check_typedef (value_type (arr
));
1554 if (is_thin_pntr (type
))
1556 struct type
*bounds_type
=
1557 desc_bounds_type (thin_descriptor_type (type
));
1560 if (bounds_type
== NULL
)
1561 error (_("Bad GNAT array descriptor"));
1563 /* NOTE: The following calculation is not really kosher, but
1564 since desc_type is an XVE-encoded type (and shouldn't be),
1565 the correct calculation is a real pain. FIXME (and fix GCC). */
1566 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1567 addr
= value_as_long (arr
);
1569 addr
= value_address (arr
);
1572 value_from_longest (lookup_pointer_type (bounds_type
),
1573 addr
- TYPE_LENGTH (bounds_type
));
1576 else if (is_thick_pntr (type
))
1578 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1579 _("Bad GNAT array descriptor"));
1580 struct type
*p_bounds_type
= value_type (p_bounds
);
1583 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1585 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1587 if (TYPE_STUB (target_type
))
1588 p_bounds
= value_cast (lookup_pointer_type
1589 (ada_check_typedef (target_type
)),
1593 error (_("Bad GNAT array descriptor"));
1601 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1602 position of the field containing the address of the bounds data. */
1605 fat_pntr_bounds_bitpos (struct type
*type
)
1607 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1610 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1611 size of the field containing the address of the bounds data. */
1614 fat_pntr_bounds_bitsize (struct type
*type
)
1616 type
= desc_base_type (type
);
1618 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1619 return TYPE_FIELD_BITSIZE (type
, 1);
1621 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1624 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1625 pointer to one, the type of its array data (a array-with-no-bounds type);
1626 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1629 static struct type
*
1630 desc_data_target_type (struct type
*type
)
1632 type
= desc_base_type (type
);
1634 /* NOTE: The following is bogus; see comment in desc_bounds. */
1635 if (is_thin_pntr (type
))
1636 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1637 else if (is_thick_pntr (type
))
1639 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1642 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1643 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1649 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1652 static struct value
*
1653 desc_data (struct value
*arr
)
1655 struct type
*type
= value_type (arr
);
1657 if (is_thin_pntr (type
))
1658 return thin_data_pntr (arr
);
1659 else if (is_thick_pntr (type
))
1660 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1661 _("Bad GNAT array descriptor"));
1667 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1668 position of the field containing the address of the data. */
1671 fat_pntr_data_bitpos (struct type
*type
)
1673 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1676 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1677 size of the field containing the address of the data. */
1680 fat_pntr_data_bitsize (struct type
*type
)
1682 type
= desc_base_type (type
);
1684 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1685 return TYPE_FIELD_BITSIZE (type
, 0);
1687 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1690 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1691 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1692 bound, if WHICH is 1. The first bound is I=1. */
1694 static struct value
*
1695 desc_one_bound (struct value
*bounds
, int i
, int which
)
1697 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1698 _("Bad GNAT array descriptor bounds"));
1701 /* If BOUNDS is an array-bounds structure type, return the bit position
1702 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1703 bound, if WHICH is 1. The first bound is I=1. */
1706 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1708 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1711 /* If BOUNDS is an array-bounds structure type, return the bit field size
1712 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1713 bound, if WHICH is 1. The first bound is I=1. */
1716 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1718 type
= desc_base_type (type
);
1720 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1721 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1723 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1726 /* If TYPE is the type of an array-bounds structure, the type of its
1727 Ith bound (numbering from 1). Otherwise, NULL. */
1729 static struct type
*
1730 desc_index_type (struct type
*type
, int i
)
1732 type
= desc_base_type (type
);
1734 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1735 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1740 /* The number of index positions in the array-bounds type TYPE.
1741 Return 0 if TYPE is NULL. */
1744 desc_arity (struct type
*type
)
1746 type
= desc_base_type (type
);
1749 return TYPE_NFIELDS (type
) / 2;
1753 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1754 an array descriptor type (representing an unconstrained array
1758 ada_is_direct_array_type (struct type
*type
)
1762 type
= ada_check_typedef (type
);
1763 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1764 || ada_is_array_descriptor_type (type
));
1767 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1771 ada_is_array_type (struct type
*type
)
1774 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1775 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1776 type
= TYPE_TARGET_TYPE (type
);
1777 return ada_is_direct_array_type (type
);
1780 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1783 ada_is_simple_array_type (struct type
*type
)
1787 type
= ada_check_typedef (type
);
1788 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1789 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1790 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1791 == TYPE_CODE_ARRAY
));
1794 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1797 ada_is_array_descriptor_type (struct type
*type
)
1799 struct type
*data_type
= desc_data_target_type (type
);
1803 type
= ada_check_typedef (type
);
1804 return (data_type
!= NULL
1805 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1806 && desc_arity (desc_bounds_type (type
)) > 0);
1809 /* Non-zero iff type is a partially mal-formed GNAT array
1810 descriptor. FIXME: This is to compensate for some problems with
1811 debugging output from GNAT. Re-examine periodically to see if it
1815 ada_is_bogus_array_descriptor (struct type
*type
)
1819 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1820 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1821 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1822 && !ada_is_array_descriptor_type (type
);
1826 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1827 (fat pointer) returns the type of the array data described---specifically,
1828 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1829 in from the descriptor; otherwise, they are left unspecified. If
1830 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1831 returns NULL. The result is simply the type of ARR if ARR is not
1834 ada_type_of_array (struct value
*arr
, int bounds
)
1836 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1837 return decode_constrained_packed_array_type (value_type (arr
));
1839 if (!ada_is_array_descriptor_type (value_type (arr
)))
1840 return value_type (arr
);
1844 struct type
*array_type
=
1845 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1847 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1848 TYPE_FIELD_BITSIZE (array_type
, 0) =
1849 decode_packed_array_bitsize (value_type (arr
));
1855 struct type
*elt_type
;
1857 struct value
*descriptor
;
1859 elt_type
= ada_array_element_type (value_type (arr
), -1);
1860 arity
= ada_array_arity (value_type (arr
));
1862 if (elt_type
== NULL
|| arity
== 0)
1863 return ada_check_typedef (value_type (arr
));
1865 descriptor
= desc_bounds (arr
);
1866 if (value_as_long (descriptor
) == 0)
1870 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1871 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1872 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1873 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1876 create_range_type (range_type
, value_type (low
),
1877 longest_to_int (value_as_long (low
)),
1878 longest_to_int (value_as_long (high
)));
1879 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1881 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1883 /* We need to store the element packed bitsize, as well as
1884 recompute the array size, because it was previously
1885 computed based on the unpacked element size. */
1886 LONGEST lo
= value_as_long (low
);
1887 LONGEST hi
= value_as_long (high
);
1889 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1890 decode_packed_array_bitsize (value_type (arr
));
1891 /* If the array has no element, then the size is already
1892 zero, and does not need to be recomputed. */
1896 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1898 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1903 return lookup_pointer_type (elt_type
);
1907 /* If ARR does not represent an array, returns ARR unchanged.
1908 Otherwise, returns either a standard GDB array with bounds set
1909 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1910 GDB array. Returns NULL if ARR is a null fat pointer. */
1913 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1915 if (ada_is_array_descriptor_type (value_type (arr
)))
1917 struct type
*arrType
= ada_type_of_array (arr
, 1);
1919 if (arrType
== NULL
)
1921 return value_cast (arrType
, value_copy (desc_data (arr
)));
1923 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1924 return decode_constrained_packed_array (arr
);
1929 /* If ARR does not represent an array, returns ARR unchanged.
1930 Otherwise, returns a standard GDB array describing ARR (which may
1931 be ARR itself if it already is in the proper form). */
1934 ada_coerce_to_simple_array (struct value
*arr
)
1936 if (ada_is_array_descriptor_type (value_type (arr
)))
1938 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1941 error (_("Bounds unavailable for null array pointer."));
1942 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1943 return value_ind (arrVal
);
1945 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1946 return decode_constrained_packed_array (arr
);
1951 /* If TYPE represents a GNAT array type, return it translated to an
1952 ordinary GDB array type (possibly with BITSIZE fields indicating
1953 packing). For other types, is the identity. */
1956 ada_coerce_to_simple_array_type (struct type
*type
)
1958 if (ada_is_constrained_packed_array_type (type
))
1959 return decode_constrained_packed_array_type (type
);
1961 if (ada_is_array_descriptor_type (type
))
1962 return ada_check_typedef (desc_data_target_type (type
));
1967 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1970 ada_is_packed_array_type (struct type
*type
)
1974 type
= desc_base_type (type
);
1975 type
= ada_check_typedef (type
);
1977 ada_type_name (type
) != NULL
1978 && strstr (ada_type_name (type
), "___XP") != NULL
;
1981 /* Non-zero iff TYPE represents a standard GNAT constrained
1982 packed-array type. */
1985 ada_is_constrained_packed_array_type (struct type
*type
)
1987 return ada_is_packed_array_type (type
)
1988 && !ada_is_array_descriptor_type (type
);
1991 /* Non-zero iff TYPE represents an array descriptor for a
1992 unconstrained packed-array type. */
1995 ada_is_unconstrained_packed_array_type (struct type
*type
)
1997 return ada_is_packed_array_type (type
)
1998 && ada_is_array_descriptor_type (type
);
2001 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
2002 return the size of its elements in bits. */
2005 decode_packed_array_bitsize (struct type
*type
)
2007 const char *raw_name
;
2011 /* Access to arrays implemented as fat pointers are encoded as a typedef
2012 of the fat pointer type. We need the name of the fat pointer type
2013 to do the decoding, so strip the typedef layer. */
2014 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
2015 type
= ada_typedef_target_type (type
);
2017 raw_name
= ada_type_name (ada_check_typedef (type
));
2019 raw_name
= ada_type_name (desc_base_type (type
));
2024 tail
= strstr (raw_name
, "___XP");
2025 gdb_assert (tail
!= NULL
);
2027 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
2030 (_("could not understand bit size information on packed array"));
2037 /* Given that TYPE is a standard GDB array type with all bounds filled
2038 in, and that the element size of its ultimate scalar constituents
2039 (that is, either its elements, or, if it is an array of arrays, its
2040 elements' elements, etc.) is *ELT_BITS, return an identical type,
2041 but with the bit sizes of its elements (and those of any
2042 constituent arrays) recorded in the BITSIZE components of its
2043 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
2046 static struct type
*
2047 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2049 struct type
*new_elt_type
;
2050 struct type
*new_type
;
2051 struct type
*index_type_desc
;
2052 struct type
*index_type
;
2053 LONGEST low_bound
, high_bound
;
2055 type
= ada_check_typedef (type
);
2056 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2059 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2060 if (index_type_desc
)
2061 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, 0),
2064 index_type
= TYPE_INDEX_TYPE (type
);
2066 new_type
= alloc_type_copy (type
);
2068 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2070 create_array_type (new_type
, new_elt_type
, index_type
);
2071 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2072 TYPE_NAME (new_type
) = ada_type_name (type
);
2074 if (get_discrete_bounds (index_type
, &low_bound
, &high_bound
) < 0)
2075 low_bound
= high_bound
= 0;
2076 if (high_bound
< low_bound
)
2077 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2080 *elt_bits
*= (high_bound
- low_bound
+ 1);
2081 TYPE_LENGTH (new_type
) =
2082 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2085 TYPE_FIXED_INSTANCE (new_type
) = 1;
2089 /* The array type encoded by TYPE, where
2090 ada_is_constrained_packed_array_type (TYPE). */
2092 static struct type
*
2093 decode_constrained_packed_array_type (struct type
*type
)
2095 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
2098 struct type
*shadow_type
;
2102 raw_name
= ada_type_name (desc_base_type (type
));
2107 name
= (char *) alloca (strlen (raw_name
) + 1);
2108 tail
= strstr (raw_name
, "___XP");
2109 type
= desc_base_type (type
);
2111 memcpy (name
, raw_name
, tail
- raw_name
);
2112 name
[tail
- raw_name
] = '\000';
2114 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2116 if (shadow_type
== NULL
)
2118 lim_warning (_("could not find bounds information on packed array"));
2121 CHECK_TYPEDEF (shadow_type
);
2123 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2125 lim_warning (_("could not understand bounds "
2126 "information on packed array"));
2130 bits
= decode_packed_array_bitsize (type
);
2131 return constrained_packed_array_type (shadow_type
, &bits
);
2134 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2135 array, returns a simple array that denotes that array. Its type is a
2136 standard GDB array type except that the BITSIZEs of the array
2137 target types are set to the number of bits in each element, and the
2138 type length is set appropriately. */
2140 static struct value
*
2141 decode_constrained_packed_array (struct value
*arr
)
2145 arr
= ada_coerce_ref (arr
);
2147 /* If our value is a pointer, then dererence it. Make sure that
2148 this operation does not cause the target type to be fixed, as
2149 this would indirectly cause this array to be decoded. The rest
2150 of the routine assumes that the array hasn't been decoded yet,
2151 so we use the basic "value_ind" routine to perform the dereferencing,
2152 as opposed to using "ada_value_ind". */
2153 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2154 arr
= value_ind (arr
);
2156 type
= decode_constrained_packed_array_type (value_type (arr
));
2159 error (_("can't unpack array"));
2163 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2164 && ada_is_modular_type (value_type (arr
)))
2166 /* This is a (right-justified) modular type representing a packed
2167 array with no wrapper. In order to interpret the value through
2168 the (left-justified) packed array type we just built, we must
2169 first left-justify it. */
2170 int bit_size
, bit_pos
;
2173 mod
= ada_modulus (value_type (arr
)) - 1;
2180 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2181 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2182 bit_pos
/ HOST_CHAR_BIT
,
2183 bit_pos
% HOST_CHAR_BIT
,
2188 return coerce_unspec_val_to_type (arr
, type
);
2192 /* The value of the element of packed array ARR at the ARITY indices
2193 given in IND. ARR must be a simple array. */
2195 static struct value
*
2196 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2199 int bits
, elt_off
, bit_off
;
2200 long elt_total_bit_offset
;
2201 struct type
*elt_type
;
2205 elt_total_bit_offset
= 0;
2206 elt_type
= ada_check_typedef (value_type (arr
));
2207 for (i
= 0; i
< arity
; i
+= 1)
2209 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2210 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2212 (_("attempt to do packed indexing of "
2213 "something other than a packed array"));
2216 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2217 LONGEST lowerbound
, upperbound
;
2220 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2222 lim_warning (_("don't know bounds of array"));
2223 lowerbound
= upperbound
= 0;
2226 idx
= pos_atr (ind
[i
]);
2227 if (idx
< lowerbound
|| idx
> upperbound
)
2228 lim_warning (_("packed array index %ld out of bounds"),
2230 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2231 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2232 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2235 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2236 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2238 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2243 /* Non-zero iff TYPE includes negative integer values. */
2246 has_negatives (struct type
*type
)
2248 switch (TYPE_CODE (type
))
2253 return !TYPE_UNSIGNED (type
);
2254 case TYPE_CODE_RANGE
:
2255 return TYPE_LOW_BOUND (type
) < 0;
2260 /* Create a new value of type TYPE from the contents of OBJ starting
2261 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2262 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2263 assigning through the result will set the field fetched from.
2264 VALADDR is ignored unless OBJ is NULL, in which case,
2265 VALADDR+OFFSET must address the start of storage containing the
2266 packed value. The value returned in this case is never an lval.
2267 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2270 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2271 long offset
, int bit_offset
, int bit_size
,
2275 int src
, /* Index into the source area */
2276 targ
, /* Index into the target area */
2277 srcBitsLeft
, /* Number of source bits left to move */
2278 nsrc
, ntarg
, /* Number of source and target bytes */
2279 unusedLS
, /* Number of bits in next significant
2280 byte of source that are unused */
2281 accumSize
; /* Number of meaningful bits in accum */
2282 unsigned char *bytes
; /* First byte containing data to unpack */
2283 unsigned char *unpacked
;
2284 unsigned long accum
; /* Staging area for bits being transferred */
2286 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2287 /* Transmit bytes from least to most significant; delta is the direction
2288 the indices move. */
2289 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2291 type
= ada_check_typedef (type
);
2295 v
= allocate_value (type
);
2296 bytes
= (unsigned char *) (valaddr
+ offset
);
2298 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
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
= 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
)
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, treat as NAME with a
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_BITPOS (type1
, i
) != TYPE_FIELD_BITPOS (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).
4886 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4889 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4890 struct block
*block
, domain_enum domain
,
4893 int block_depth
= 0;
4895 while (block
!= NULL
)
4898 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4900 /* If we found a non-function match, assume that's the one. */
4901 if (is_nonfunction (defns_collected (obstackp
, 0),
4902 num_defns_collected (obstackp
)))
4905 block
= BLOCK_SUPERBLOCK (block
);
4908 /* If no luck so far, try to find NAME as a local symbol in some lexically
4909 enclosing subprogram. */
4910 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4911 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4914 /* An object of this type is used as the user_data argument when
4915 calling the map_matching_symbols method. */
4919 struct objfile
*objfile
;
4920 struct obstack
*obstackp
;
4921 struct symbol
*arg_sym
;
4925 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4926 to a list of symbols. DATA0 is a pointer to a struct match_data *
4927 containing the obstack that collects the symbol list, the file that SYM
4928 must come from, a flag indicating whether a non-argument symbol has
4929 been found in the current block, and the last argument symbol
4930 passed in SYM within the current block (if any). When SYM is null,
4931 marking the end of a block, the argument symbol is added if no
4932 other has been found. */
4935 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
4937 struct match_data
*data
= (struct match_data
*) data0
;
4941 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
4942 add_defn_to_vec (data
->obstackp
,
4943 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
4945 data
->found_sym
= 0;
4946 data
->arg_sym
= NULL
;
4950 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4952 else if (SYMBOL_IS_ARGUMENT (sym
))
4953 data
->arg_sym
= sym
;
4956 data
->found_sym
= 1;
4957 add_defn_to_vec (data
->obstackp
,
4958 fixup_symbol_section (sym
, data
->objfile
),
4965 /* Compare STRING1 to STRING2, with results as for strcmp.
4966 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4967 implies compare_names (STRING1, STRING2) (they may differ as to
4968 what symbols compare equal). */
4971 compare_names (const char *string1
, const char *string2
)
4973 while (*string1
!= '\0' && *string2
!= '\0')
4975 if (isspace (*string1
) || isspace (*string2
))
4976 return strcmp_iw_ordered (string1
, string2
);
4977 if (*string1
!= *string2
)
4985 return strcmp_iw_ordered (string1
, string2
);
4987 if (*string2
== '\0')
4989 if (is_name_suffix (string1
))
4996 if (*string2
== '(')
4997 return strcmp_iw_ordered (string1
, string2
);
4999 return *string1
- *string2
;
5003 /* Add to OBSTACKP all non-local symbols whose name and domain match
5004 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
5005 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
5008 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
5009 domain_enum domain
, int global
,
5012 struct objfile
*objfile
;
5013 struct match_data data
;
5015 memset (&data
, 0, sizeof data
);
5016 data
.obstackp
= obstackp
;
5018 ALL_OBJFILES (objfile
)
5020 data
.objfile
= objfile
;
5023 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
5024 aux_add_nonlocal_symbols
, &data
,
5027 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
5028 aux_add_nonlocal_symbols
, &data
,
5029 full_match
, compare_names
);
5032 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
5034 ALL_OBJFILES (objfile
)
5036 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
5037 strcpy (name1
, "_ada_");
5038 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
5039 data
.objfile
= objfile
;
5040 objfile
->sf
->qf
->map_matching_symbols (name1
, domain
,
5042 aux_add_nonlocal_symbols
,
5044 full_match
, compare_names
);
5049 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
5050 scope and in global scopes, returning the number of matches. Sets
5051 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
5052 indicating the symbols found and the blocks and symbol tables (if
5053 any) in which they were found. This vector are transient---good only to
5054 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
5055 symbol match within the nest of blocks whose innermost member is BLOCK0,
5056 is the one match returned (no other matches in that or
5057 enclosing blocks is returned). If there are any matches in or
5058 surrounding BLOCK0, then these alone are returned. Otherwise, if
5059 FULL_SEARCH is non-zero, then the search extends to global and
5060 file-scope (static) symbol tables.
5061 Names prefixed with "standard__" are handled specially: "standard__"
5062 is first stripped off, and only static and global symbols are searched. */
5065 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
5066 domain_enum
namespace,
5067 struct ada_symbol_info
**results
,
5071 struct block
*block
;
5073 const int wild_match
= should_use_wild_match (name0
);
5077 obstack_free (&symbol_list_obstack
, NULL
);
5078 obstack_init (&symbol_list_obstack
);
5082 /* Search specified block and its superiors. */
5085 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
5086 needed, but adding const will
5087 have a cascade effect. */
5089 /* Special case: If the user specifies a symbol name inside package
5090 Standard, do a non-wild matching of the symbol name without
5091 the "standard__" prefix. This was primarily introduced in order
5092 to allow the user to specifically access the standard exceptions
5093 using, for instance, Standard.Constraint_Error when Constraint_Error
5094 is ambiguous (due to the user defining its own Constraint_Error
5095 entity inside its program). */
5096 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5099 name
= name0
+ sizeof ("standard__") - 1;
5102 /* Check the non-global symbols. If we have ANY match, then we're done. */
5104 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
5106 if (num_defns_collected (&symbol_list_obstack
) > 0 || !full_search
)
5109 /* No non-global symbols found. Check our cache to see if we have
5110 already performed this search before. If we have, then return
5114 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5117 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5121 /* Search symbols from all global blocks. */
5123 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5126 /* Now add symbols from all per-file blocks if we've gotten no hits
5127 (not strictly correct, but perhaps better than an error). */
5129 if (num_defns_collected (&symbol_list_obstack
) == 0)
5130 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5134 ndefns
= num_defns_collected (&symbol_list_obstack
);
5135 *results
= defns_collected (&symbol_list_obstack
, 1);
5137 ndefns
= remove_extra_symbols (*results
, ndefns
);
5139 if (ndefns
== 0 && full_search
)
5140 cache_symbol (name0
, namespace, NULL
, NULL
);
5142 if (ndefns
== 1 && full_search
&& cacheIfUnique
)
5143 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5145 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5150 /* If NAME is the name of an entity, return a string that should
5151 be used to look that entity up in Ada units. This string should
5152 be deallocated after use using xfree.
5154 NAME can have any form that the "break" or "print" commands might
5155 recognize. In other words, it does not have to be the "natural"
5156 name, or the "encoded" name. */
5159 ada_name_for_lookup (const char *name
)
5162 int nlen
= strlen (name
);
5164 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5166 canon
= xmalloc (nlen
- 1);
5167 memcpy (canon
, name
+ 1, nlen
- 2);
5168 canon
[nlen
- 2] = '\0';
5171 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5175 /* Implementation of the la_iterate_over_symbols method. */
5178 ada_iterate_over_symbols (const struct block
*block
,
5179 const char *name
, domain_enum domain
,
5180 symbol_found_callback_ftype
*callback
,
5184 struct ada_symbol_info
*results
;
5186 ndefs
= ada_lookup_symbol_list (name
, block
, domain
, &results
, 0);
5187 for (i
= 0; i
< ndefs
; ++i
)
5189 if (! (*callback
) (results
[i
].sym
, data
))
5195 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
5196 domain_enum
namespace, struct block
**block_found
)
5198 struct ada_symbol_info
*candidates
;
5201 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
,
5204 if (n_candidates
== 0)
5207 if (block_found
!= NULL
)
5208 *block_found
= candidates
[0].block
;
5210 return fixup_symbol_section (candidates
[0].sym
, NULL
);
5213 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5214 scope and in global scopes, or NULL if none. NAME is folded and
5215 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5216 choosing the first symbol if there are multiple choices.
5217 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
5218 table in which the symbol was found (in both cases, these
5219 assignments occur only if the pointers are non-null). */
5221 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5222 domain_enum
namespace, int *is_a_field_of_this
)
5224 if (is_a_field_of_this
!= NULL
)
5225 *is_a_field_of_this
= 0;
5228 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5229 block0
, namespace, NULL
);
5232 static struct symbol
*
5233 ada_lookup_symbol_nonlocal (const char *name
,
5234 const struct block
*block
,
5235 const domain_enum domain
)
5237 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5241 /* True iff STR is a possible encoded suffix of a normal Ada name
5242 that is to be ignored for matching purposes. Suffixes of parallel
5243 names (e.g., XVE) are not included here. Currently, the possible suffixes
5244 are given by any of the regular expressions:
5246 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5247 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5248 TKB [subprogram suffix for task bodies]
5249 _E[0-9]+[bs]$ [protected object entry suffixes]
5250 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5252 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5253 match is performed. This sequence is used to differentiate homonyms,
5254 is an optional part of a valid name suffix. */
5257 is_name_suffix (const char *str
)
5260 const char *matching
;
5261 const int len
= strlen (str
);
5263 /* Skip optional leading __[0-9]+. */
5265 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5268 while (isdigit (str
[0]))
5274 if (str
[0] == '.' || str
[0] == '$')
5277 while (isdigit (matching
[0]))
5279 if (matching
[0] == '\0')
5285 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5288 while (isdigit (matching
[0]))
5290 if (matching
[0] == '\0')
5294 /* "TKB" suffixes are used for subprograms implementing task bodies. */
5296 if (strcmp (str
, "TKB") == 0)
5300 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5301 with a N at the end. Unfortunately, the compiler uses the same
5302 convention for other internal types it creates. So treating
5303 all entity names that end with an "N" as a name suffix causes
5304 some regressions. For instance, consider the case of an enumerated
5305 type. To support the 'Image attribute, it creates an array whose
5307 Having a single character like this as a suffix carrying some
5308 information is a bit risky. Perhaps we should change the encoding
5309 to be something like "_N" instead. In the meantime, do not do
5310 the following check. */
5311 /* Protected Object Subprograms */
5312 if (len
== 1 && str
[0] == 'N')
5317 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5320 while (isdigit (matching
[0]))
5322 if ((matching
[0] == 'b' || matching
[0] == 's')
5323 && matching
[1] == '\0')
5327 /* ??? We should not modify STR directly, as we are doing below. This
5328 is fine in this case, but may become problematic later if we find
5329 that this alternative did not work, and want to try matching
5330 another one from the begining of STR. Since we modified it, we
5331 won't be able to find the begining of the string anymore! */
5335 while (str
[0] != '_' && str
[0] != '\0')
5337 if (str
[0] != 'n' && str
[0] != 'b')
5343 if (str
[0] == '\000')
5348 if (str
[1] != '_' || str
[2] == '\000')
5352 if (strcmp (str
+ 3, "JM") == 0)
5354 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5355 the LJM suffix in favor of the JM one. But we will
5356 still accept LJM as a valid suffix for a reasonable
5357 amount of time, just to allow ourselves to debug programs
5358 compiled using an older version of GNAT. */
5359 if (strcmp (str
+ 3, "LJM") == 0)
5363 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5364 || str
[4] == 'U' || str
[4] == 'P')
5366 if (str
[4] == 'R' && str
[5] != 'T')
5370 if (!isdigit (str
[2]))
5372 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5373 if (!isdigit (str
[k
]) && str
[k
] != '_')
5377 if (str
[0] == '$' && isdigit (str
[1]))
5379 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5380 if (!isdigit (str
[k
]) && str
[k
] != '_')
5387 /* Return non-zero if the string starting at NAME and ending before
5388 NAME_END contains no capital letters. */
5391 is_valid_name_for_wild_match (const char *name0
)
5393 const char *decoded_name
= ada_decode (name0
);
5396 /* If the decoded name starts with an angle bracket, it means that
5397 NAME0 does not follow the GNAT encoding format. It should then
5398 not be allowed as a possible wild match. */
5399 if (decoded_name
[0] == '<')
5402 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5403 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5409 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5410 that could start a simple name. Assumes that *NAMEP points into
5411 the string beginning at NAME0. */
5414 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5416 const char *name
= *namep
;
5426 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5429 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5434 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5435 || name
[2] == target0
))
5443 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5453 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5454 informational suffixes of NAME (i.e., for which is_name_suffix is
5455 true). Assumes that PATN is a lower-cased Ada simple name. */
5458 wild_match (const char *name
, const char *patn
)
5461 const char *name0
= name
;
5465 const char *match
= name
;
5469 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5472 if (*p
== '\0' && is_name_suffix (name
))
5473 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5475 if (name
[-1] == '_')
5478 if (!advance_wild_match (&name
, name0
, *patn
))
5483 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5484 informational suffix. */
5487 full_match (const char *sym_name
, const char *search_name
)
5489 return !match_name (sym_name
, search_name
, 0);
5493 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5494 vector *defn_symbols, updating the list of symbols in OBSTACKP
5495 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5496 OBJFILE is the section containing BLOCK.
5497 SYMTAB is recorded with each symbol added. */
5500 ada_add_block_symbols (struct obstack
*obstackp
,
5501 struct block
*block
, const char *name
,
5502 domain_enum domain
, struct objfile
*objfile
,
5505 struct dict_iterator iter
;
5506 int name_len
= strlen (name
);
5507 /* A matching argument symbol, if any. */
5508 struct symbol
*arg_sym
;
5509 /* Set true when we find a matching non-argument symbol. */
5517 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5519 sym
!= NULL
; sym
= dict_iter_match_next (name
, wild_match
, &iter
))
5521 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5522 SYMBOL_DOMAIN (sym
), domain
)
5523 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5525 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5527 else if (SYMBOL_IS_ARGUMENT (sym
))
5532 add_defn_to_vec (obstackp
,
5533 fixup_symbol_section (sym
, objfile
),
5541 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5543 sym
!= NULL
; sym
= dict_iter_match_next (name
, full_match
, &iter
))
5545 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5546 SYMBOL_DOMAIN (sym
), domain
))
5548 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5550 if (SYMBOL_IS_ARGUMENT (sym
))
5555 add_defn_to_vec (obstackp
,
5556 fixup_symbol_section (sym
, objfile
),
5564 if (!found_sym
&& arg_sym
!= NULL
)
5566 add_defn_to_vec (obstackp
,
5567 fixup_symbol_section (arg_sym
, objfile
),
5576 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5578 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5579 SYMBOL_DOMAIN (sym
), domain
))
5583 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5586 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5588 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5593 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5595 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5597 if (SYMBOL_IS_ARGUMENT (sym
))
5602 add_defn_to_vec (obstackp
,
5603 fixup_symbol_section (sym
, objfile
),
5611 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5612 They aren't parameters, right? */
5613 if (!found_sym
&& arg_sym
!= NULL
)
5615 add_defn_to_vec (obstackp
,
5616 fixup_symbol_section (arg_sym
, objfile
),
5623 /* Symbol Completion */
5625 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5626 name in a form that's appropriate for the completion. The result
5627 does not need to be deallocated, but is only good until the next call.
5629 TEXT_LEN is equal to the length of TEXT.
5630 Perform a wild match if WILD_MATCH is set.
5631 ENCODED should be set if TEXT represents the start of a symbol name
5632 in its encoded form. */
5635 symbol_completion_match (const char *sym_name
,
5636 const char *text
, int text_len
,
5637 int wild_match
, int encoded
)
5639 const int verbatim_match
= (text
[0] == '<');
5644 /* Strip the leading angle bracket. */
5649 /* First, test against the fully qualified name of the symbol. */
5651 if (strncmp (sym_name
, text
, text_len
) == 0)
5654 if (match
&& !encoded
)
5656 /* One needed check before declaring a positive match is to verify
5657 that iff we are doing a verbatim match, the decoded version
5658 of the symbol name starts with '<'. Otherwise, this symbol name
5659 is not a suitable completion. */
5660 const char *sym_name_copy
= sym_name
;
5661 int has_angle_bracket
;
5663 sym_name
= ada_decode (sym_name
);
5664 has_angle_bracket
= (sym_name
[0] == '<');
5665 match
= (has_angle_bracket
== verbatim_match
);
5666 sym_name
= sym_name_copy
;
5669 if (match
&& !verbatim_match
)
5671 /* When doing non-verbatim match, another check that needs to
5672 be done is to verify that the potentially matching symbol name
5673 does not include capital letters, because the ada-mode would
5674 not be able to understand these symbol names without the
5675 angle bracket notation. */
5678 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5683 /* Second: Try wild matching... */
5685 if (!match
&& wild_match
)
5687 /* Since we are doing wild matching, this means that TEXT
5688 may represent an unqualified symbol name. We therefore must
5689 also compare TEXT against the unqualified name of the symbol. */
5690 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5692 if (strncmp (sym_name
, text
, text_len
) == 0)
5696 /* Finally: If we found a mach, prepare the result to return. */
5702 sym_name
= add_angle_brackets (sym_name
);
5705 sym_name
= ada_decode (sym_name
);
5710 /* A companion function to ada_make_symbol_completion_list().
5711 Check if SYM_NAME represents a symbol which name would be suitable
5712 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5713 it is appended at the end of the given string vector SV.
5715 ORIG_TEXT is the string original string from the user command
5716 that needs to be completed. WORD is the entire command on which
5717 completion should be performed. These two parameters are used to
5718 determine which part of the symbol name should be added to the
5720 if WILD_MATCH is set, then wild matching is performed.
5721 ENCODED should be set if TEXT represents a symbol name in its
5722 encoded formed (in which case the completion should also be
5726 symbol_completion_add (VEC(char_ptr
) **sv
,
5727 const char *sym_name
,
5728 const char *text
, int text_len
,
5729 const char *orig_text
, const char *word
,
5730 int wild_match
, int encoded
)
5732 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5733 wild_match
, encoded
);
5739 /* We found a match, so add the appropriate completion to the given
5742 if (word
== orig_text
)
5744 completion
= xmalloc (strlen (match
) + 5);
5745 strcpy (completion
, match
);
5747 else if (word
> orig_text
)
5749 /* Return some portion of sym_name. */
5750 completion
= xmalloc (strlen (match
) + 5);
5751 strcpy (completion
, match
+ (word
- orig_text
));
5755 /* Return some of ORIG_TEXT plus sym_name. */
5756 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5757 strncpy (completion
, word
, orig_text
- word
);
5758 completion
[orig_text
- word
] = '\0';
5759 strcat (completion
, match
);
5762 VEC_safe_push (char_ptr
, *sv
, completion
);
5765 /* An object of this type is passed as the user_data argument to the
5766 expand_partial_symbol_names method. */
5767 struct add_partial_datum
5769 VEC(char_ptr
) **completions
;
5778 /* A callback for expand_partial_symbol_names. */
5780 ada_expand_partial_symbol_name (const char *name
, void *user_data
)
5782 struct add_partial_datum
*data
= user_data
;
5784 return symbol_completion_match (name
, data
->text
, data
->text_len
,
5785 data
->wild_match
, data
->encoded
) != NULL
;
5788 /* Return a list of possible symbol names completing TEXT0. The list
5789 is NULL terminated. WORD is the entire command on which completion
5793 ada_make_symbol_completion_list (char *text0
, char *word
)
5799 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5802 struct minimal_symbol
*msymbol
;
5803 struct objfile
*objfile
;
5804 struct block
*b
, *surrounding_static_block
= 0;
5806 struct dict_iterator iter
;
5808 if (text0
[0] == '<')
5810 text
= xstrdup (text0
);
5811 make_cleanup (xfree
, text
);
5812 text_len
= strlen (text
);
5818 text
= xstrdup (ada_encode (text0
));
5819 make_cleanup (xfree
, text
);
5820 text_len
= strlen (text
);
5821 for (i
= 0; i
< text_len
; i
++)
5822 text
[i
] = tolower (text
[i
]);
5824 encoded
= (strstr (text0
, "__") != NULL
);
5825 /* If the name contains a ".", then the user is entering a fully
5826 qualified entity name, and the match must not be done in wild
5827 mode. Similarly, if the user wants to complete what looks like
5828 an encoded name, the match must not be done in wild mode. */
5829 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5832 /* First, look at the partial symtab symbols. */
5834 struct add_partial_datum data
;
5836 data
.completions
= &completions
;
5838 data
.text_len
= text_len
;
5841 data
.wild_match
= wild_match
;
5842 data
.encoded
= encoded
;
5843 expand_partial_symbol_names (ada_expand_partial_symbol_name
, &data
);
5846 /* At this point scan through the misc symbol vectors and add each
5847 symbol you find to the list. Eventually we want to ignore
5848 anything that isn't a text symbol (everything else will be
5849 handled by the psymtab code above). */
5851 ALL_MSYMBOLS (objfile
, msymbol
)
5854 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5855 text
, text_len
, text0
, word
, wild_match
, encoded
);
5858 /* Search upwards from currently selected frame (so that we can
5859 complete on local vars. */
5861 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5863 if (!BLOCK_SUPERBLOCK (b
))
5864 surrounding_static_block
= b
; /* For elmin of dups */
5866 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5868 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5869 text
, text_len
, text0
, word
,
5870 wild_match
, encoded
);
5874 /* Go through the symtabs and check the externs and statics for
5875 symbols which match. */
5877 ALL_SYMTABS (objfile
, s
)
5880 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5881 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5883 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5884 text
, text_len
, text0
, word
,
5885 wild_match
, encoded
);
5889 ALL_SYMTABS (objfile
, s
)
5892 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5893 /* Don't do this block twice. */
5894 if (b
== surrounding_static_block
)
5896 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5898 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5899 text
, text_len
, text0
, word
,
5900 wild_match
, encoded
);
5904 /* Append the closing NULL entry. */
5905 VEC_safe_push (char_ptr
, completions
, NULL
);
5907 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5908 return the copy. It's unfortunate that we have to make a copy
5909 of an array that we're about to destroy, but there is nothing much
5910 we can do about it. Fortunately, it's typically not a very large
5913 const size_t completions_size
=
5914 VEC_length (char_ptr
, completions
) * sizeof (char *);
5915 char **result
= xmalloc (completions_size
);
5917 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5919 VEC_free (char_ptr
, completions
);
5926 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5927 for tagged types. */
5930 ada_is_dispatch_table_ptr_type (struct type
*type
)
5934 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5937 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5941 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5944 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5945 to be invisible to users. */
5948 ada_is_ignored_field (struct type
*type
, int field_num
)
5950 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5953 /* Check the name of that field. */
5955 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5957 /* Anonymous field names should not be printed.
5958 brobecker/2007-02-20: I don't think this can actually happen
5959 but we don't want to print the value of annonymous fields anyway. */
5963 /* Normally, fields whose name start with an underscore ("_")
5964 are fields that have been internally generated by the compiler,
5965 and thus should not be printed. The "_parent" field is special,
5966 however: This is a field internally generated by the compiler
5967 for tagged types, and it contains the components inherited from
5968 the parent type. This field should not be printed as is, but
5969 should not be ignored either. */
5970 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5974 /* If this is the dispatch table of a tagged type, then ignore. */
5975 if (ada_is_tagged_type (type
, 1)
5976 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5979 /* Not a special field, so it should not be ignored. */
5983 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5984 pointer or reference type whose ultimate target has a tag field. */
5987 ada_is_tagged_type (struct type
*type
, int refok
)
5989 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5992 /* True iff TYPE represents the type of X'Tag */
5995 ada_is_tag_type (struct type
*type
)
5997 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
6001 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
6003 return (name
!= NULL
6004 && strcmp (name
, "ada__tags__dispatch_table") == 0);
6008 /* The type of the tag on VAL. */
6011 ada_tag_type (struct value
*val
)
6013 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
6016 /* The value of the tag on VAL. */
6019 ada_value_tag (struct value
*val
)
6021 return ada_value_struct_elt (val
, "_tag", 0);
6024 /* The value of the tag on the object of type TYPE whose contents are
6025 saved at VALADDR, if it is non-null, or is at memory address
6028 static struct value
*
6029 value_tag_from_contents_and_address (struct type
*type
,
6030 const gdb_byte
*valaddr
,
6033 int tag_byte_offset
;
6034 struct type
*tag_type
;
6036 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
6039 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
6041 : valaddr
+ tag_byte_offset
);
6042 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
6044 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
6049 static struct type
*
6050 type_from_tag (struct value
*tag
)
6052 const char *type_name
= ada_tag_name (tag
);
6054 if (type_name
!= NULL
)
6055 return ada_find_any_type (ada_encode (type_name
));
6059 /* Return the "ada__tags__type_specific_data" type. */
6061 static struct type
*
6062 ada_get_tsd_type (struct inferior
*inf
)
6064 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6066 if (data
->tsd_type
== 0)
6067 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6068 return data
->tsd_type
;
6071 /* Return the TSD (type-specific data) associated to the given TAG.
6072 TAG is assumed to be the tag of a tagged-type entity.
6074 May return NULL if we are unable to get the TSD. */
6076 static struct value
*
6077 ada_get_tsd_from_tag (struct value
*tag
)
6082 /* First option: The TSD is simply stored as a field of our TAG.
6083 Only older versions of GNAT would use this format, but we have
6084 to test it first, because there are no visible markers for
6085 the current approach except the absence of that field. */
6087 val
= ada_value_struct_elt (tag
, "tsd", 1);
6091 /* Try the second representation for the dispatch table (in which
6092 there is no explicit 'tsd' field in the referent of the tag pointer,
6093 and instead the tsd pointer is stored just before the dispatch
6096 type
= ada_get_tsd_type (current_inferior());
6099 type
= lookup_pointer_type (lookup_pointer_type (type
));
6100 val
= value_cast (type
, tag
);
6103 return value_ind (value_ptradd (val
, -1));
6106 /* Given the TSD of a tag (type-specific data), return a string
6107 containing the name of the associated type.
6109 The returned value is good until the next call. May return NULL
6110 if we are unable to determine the tag name. */
6113 ada_tag_name_from_tsd (struct value
*tsd
)
6115 static char name
[1024];
6119 val
= ada_value_struct_elt (tsd
, "expanded_name", 1);
6122 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6123 for (p
= name
; *p
!= '\0'; p
+= 1)
6129 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6132 Return NULL if the TAG is not an Ada tag, or if we were unable to
6133 determine the name of that tag. The result is good until the next
6137 ada_tag_name (struct value
*tag
)
6139 volatile struct gdb_exception e
;
6142 if (!ada_is_tag_type (value_type (tag
)))
6145 /* It is perfectly possible that an exception be raised while trying
6146 to determine the TAG's name, even under normal circumstances:
6147 The associated variable may be uninitialized or corrupted, for
6148 instance. We do not let any exception propagate past this point.
6149 instead we return NULL.
6151 We also do not print the error message either (which often is very
6152 low-level (Eg: "Cannot read memory at 0x[...]"), but instead let
6153 the caller print a more meaningful message if necessary. */
6154 TRY_CATCH (e
, RETURN_MASK_ERROR
)
6156 struct value
*tsd
= ada_get_tsd_from_tag (tag
);
6159 name
= ada_tag_name_from_tsd (tsd
);
6165 /* The parent type of TYPE, or NULL if none. */
6168 ada_parent_type (struct type
*type
)
6172 type
= ada_check_typedef (type
);
6174 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6177 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6178 if (ada_is_parent_field (type
, i
))
6180 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6182 /* If the _parent field is a pointer, then dereference it. */
6183 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6184 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6185 /* If there is a parallel XVS type, get the actual base type. */
6186 parent_type
= ada_get_base_type (parent_type
);
6188 return ada_check_typedef (parent_type
);
6194 /* True iff field number FIELD_NUM of structure type TYPE contains the
6195 parent-type (inherited) fields of a derived type. Assumes TYPE is
6196 a structure type with at least FIELD_NUM+1 fields. */
6199 ada_is_parent_field (struct type
*type
, int field_num
)
6201 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6203 return (name
!= NULL
6204 && (strncmp (name
, "PARENT", 6) == 0
6205 || strncmp (name
, "_parent", 7) == 0));
6208 /* True iff field number FIELD_NUM of structure type TYPE is a
6209 transparent wrapper field (which should be silently traversed when doing
6210 field selection and flattened when printing). Assumes TYPE is a
6211 structure type with at least FIELD_NUM+1 fields. Such fields are always
6215 ada_is_wrapper_field (struct type
*type
, int field_num
)
6217 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6219 return (name
!= NULL
6220 && (strncmp (name
, "PARENT", 6) == 0
6221 || strcmp (name
, "REP") == 0
6222 || strncmp (name
, "_parent", 7) == 0
6223 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6226 /* True iff field number FIELD_NUM of structure or union type TYPE
6227 is a variant wrapper. Assumes TYPE is a structure type with at least
6228 FIELD_NUM+1 fields. */
6231 ada_is_variant_part (struct type
*type
, int field_num
)
6233 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6235 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6236 || (is_dynamic_field (type
, field_num
)
6237 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6238 == TYPE_CODE_UNION
)));
6241 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6242 whose discriminants are contained in the record type OUTER_TYPE,
6243 returns the type of the controlling discriminant for the variant.
6244 May return NULL if the type could not be found. */
6247 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6249 char *name
= ada_variant_discrim_name (var_type
);
6251 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6254 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6255 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6256 represents a 'when others' clause; otherwise 0. */
6259 ada_is_others_clause (struct type
*type
, int field_num
)
6261 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6263 return (name
!= NULL
&& name
[0] == 'O');
6266 /* Assuming that TYPE0 is the type of the variant part of a record,
6267 returns the name of the discriminant controlling the variant.
6268 The value is valid until the next call to ada_variant_discrim_name. */
6271 ada_variant_discrim_name (struct type
*type0
)
6273 static char *result
= NULL
;
6274 static size_t result_len
= 0;
6277 const char *discrim_end
;
6278 const char *discrim_start
;
6280 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6281 type
= TYPE_TARGET_TYPE (type0
);
6285 name
= ada_type_name (type
);
6287 if (name
== NULL
|| name
[0] == '\000')
6290 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6293 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6296 if (discrim_end
== name
)
6299 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6302 if (discrim_start
== name
+ 1)
6304 if ((discrim_start
> name
+ 3
6305 && strncmp (discrim_start
- 3, "___", 3) == 0)
6306 || discrim_start
[-1] == '.')
6310 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6311 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6312 result
[discrim_end
- discrim_start
] = '\0';
6316 /* Scan STR for a subtype-encoded number, beginning at position K.
6317 Put the position of the character just past the number scanned in
6318 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6319 Return 1 if there was a valid number at the given position, and 0
6320 otherwise. A "subtype-encoded" number consists of the absolute value
6321 in decimal, followed by the letter 'm' to indicate a negative number.
6322 Assumes 0m does not occur. */
6325 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6329 if (!isdigit (str
[k
]))
6332 /* Do it the hard way so as not to make any assumption about
6333 the relationship of unsigned long (%lu scan format code) and
6336 while (isdigit (str
[k
]))
6338 RU
= RU
* 10 + (str
[k
] - '0');
6345 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6351 /* NOTE on the above: Technically, C does not say what the results of
6352 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6353 number representable as a LONGEST (although either would probably work
6354 in most implementations). When RU>0, the locution in the then branch
6355 above is always equivalent to the negative of RU. */
6362 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6363 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6364 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6367 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6369 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6383 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6393 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6394 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6396 if (val
>= L
&& val
<= U
)
6408 /* FIXME: Lots of redundancy below. Try to consolidate. */
6410 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6411 ARG_TYPE, extract and return the value of one of its (non-static)
6412 fields. FIELDNO says which field. Differs from value_primitive_field
6413 only in that it can handle packed values of arbitrary type. */
6415 static struct value
*
6416 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6417 struct type
*arg_type
)
6421 arg_type
= ada_check_typedef (arg_type
);
6422 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6424 /* Handle packed fields. */
6426 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6428 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6429 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6431 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6432 offset
+ bit_pos
/ 8,
6433 bit_pos
% 8, bit_size
, type
);
6436 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6439 /* Find field with name NAME in object of type TYPE. If found,
6440 set the following for each argument that is non-null:
6441 - *FIELD_TYPE_P to the field's type;
6442 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6443 an object of that type;
6444 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6445 - *BIT_SIZE_P to its size in bits if the field is packed, and
6447 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6448 fields up to but not including the desired field, or by the total
6449 number of fields if not found. A NULL value of NAME never
6450 matches; the function just counts visible fields in this case.
6452 Returns 1 if found, 0 otherwise. */
6455 find_struct_field (const char *name
, struct type
*type
, int offset
,
6456 struct type
**field_type_p
,
6457 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6462 type
= ada_check_typedef (type
);
6464 if (field_type_p
!= NULL
)
6465 *field_type_p
= NULL
;
6466 if (byte_offset_p
!= NULL
)
6468 if (bit_offset_p
!= NULL
)
6470 if (bit_size_p
!= NULL
)
6473 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6475 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6476 int fld_offset
= offset
+ bit_pos
/ 8;
6477 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6479 if (t_field_name
== NULL
)
6482 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6484 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6486 if (field_type_p
!= NULL
)
6487 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6488 if (byte_offset_p
!= NULL
)
6489 *byte_offset_p
= fld_offset
;
6490 if (bit_offset_p
!= NULL
)
6491 *bit_offset_p
= bit_pos
% 8;
6492 if (bit_size_p
!= NULL
)
6493 *bit_size_p
= bit_size
;
6496 else if (ada_is_wrapper_field (type
, i
))
6498 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6499 field_type_p
, byte_offset_p
, bit_offset_p
,
6500 bit_size_p
, index_p
))
6503 else if (ada_is_variant_part (type
, i
))
6505 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6508 struct type
*field_type
6509 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6511 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6513 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6515 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6516 field_type_p
, byte_offset_p
,
6517 bit_offset_p
, bit_size_p
, index_p
))
6521 else if (index_p
!= NULL
)
6527 /* Number of user-visible fields in record type TYPE. */
6530 num_visible_fields (struct type
*type
)
6535 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6539 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6540 and search in it assuming it has (class) type TYPE.
6541 If found, return value, else return NULL.
6543 Searches recursively through wrapper fields (e.g., '_parent'). */
6545 static struct value
*
6546 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6551 type
= ada_check_typedef (type
);
6552 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6554 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6556 if (t_field_name
== NULL
)
6559 else if (field_name_match (t_field_name
, name
))
6560 return ada_value_primitive_field (arg
, offset
, i
, type
);
6562 else if (ada_is_wrapper_field (type
, i
))
6564 struct value
*v
= /* Do not let indent join lines here. */
6565 ada_search_struct_field (name
, arg
,
6566 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6567 TYPE_FIELD_TYPE (type
, i
));
6573 else if (ada_is_variant_part (type
, i
))
6575 /* PNH: Do we ever get here? See find_struct_field. */
6577 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6579 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6581 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6583 struct value
*v
= ada_search_struct_field
/* Force line
6586 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6587 TYPE_FIELD_TYPE (field_type
, j
));
6597 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6598 int, struct type
*);
6601 /* Return field #INDEX in ARG, where the index is that returned by
6602 * find_struct_field through its INDEX_P argument. Adjust the address
6603 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6604 * If found, return value, else return NULL. */
6606 static struct value
*
6607 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6610 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6614 /* Auxiliary function for ada_index_struct_field. Like
6615 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6618 static struct value
*
6619 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6623 type
= ada_check_typedef (type
);
6625 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6627 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6629 else if (ada_is_wrapper_field (type
, i
))
6631 struct value
*v
= /* Do not let indent join lines here. */
6632 ada_index_struct_field_1 (index_p
, arg
,
6633 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6634 TYPE_FIELD_TYPE (type
, i
));
6640 else if (ada_is_variant_part (type
, i
))
6642 /* PNH: Do we ever get here? See ada_search_struct_field,
6643 find_struct_field. */
6644 error (_("Cannot assign this kind of variant record"));
6646 else if (*index_p
== 0)
6647 return ada_value_primitive_field (arg
, offset
, i
, type
);
6654 /* Given ARG, a value of type (pointer or reference to a)*
6655 structure/union, extract the component named NAME from the ultimate
6656 target structure/union and return it as a value with its
6659 The routine searches for NAME among all members of the structure itself
6660 and (recursively) among all members of any wrapper members
6663 If NO_ERR, then simply return NULL in case of error, rather than
6667 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6669 struct type
*t
, *t1
;
6673 t1
= t
= ada_check_typedef (value_type (arg
));
6674 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6676 t1
= TYPE_TARGET_TYPE (t
);
6679 t1
= ada_check_typedef (t1
);
6680 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6682 arg
= coerce_ref (arg
);
6687 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6689 t1
= TYPE_TARGET_TYPE (t
);
6692 t1
= ada_check_typedef (t1
);
6693 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6695 arg
= value_ind (arg
);
6702 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6706 v
= ada_search_struct_field (name
, arg
, 0, t
);
6709 int bit_offset
, bit_size
, byte_offset
;
6710 struct type
*field_type
;
6713 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6714 address
= value_as_address (arg
);
6716 address
= unpack_pointer (t
, value_contents (arg
));
6718 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6719 if (find_struct_field (name
, t1
, 0,
6720 &field_type
, &byte_offset
, &bit_offset
,
6725 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6726 arg
= ada_coerce_ref (arg
);
6728 arg
= ada_value_ind (arg
);
6729 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6730 bit_offset
, bit_size
,
6734 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6738 if (v
!= NULL
|| no_err
)
6741 error (_("There is no member named %s."), name
);
6747 error (_("Attempt to extract a component of "
6748 "a value that is not a record."));
6751 /* Given a type TYPE, look up the type of the component of type named NAME.
6752 If DISPP is non-null, add its byte displacement from the beginning of a
6753 structure (pointed to by a value) of type TYPE to *DISPP (does not
6754 work for packed fields).
6756 Matches any field whose name has NAME as a prefix, possibly
6759 TYPE can be either a struct or union. If REFOK, TYPE may also
6760 be a (pointer or reference)+ to a struct or union, and the
6761 ultimate target type will be searched.
6763 Looks recursively into variant clauses and parent types.
6765 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6766 TYPE is not a type of the right kind. */
6768 static struct type
*
6769 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6770 int noerr
, int *dispp
)
6777 if (refok
&& type
!= NULL
)
6780 type
= ada_check_typedef (type
);
6781 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6782 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6784 type
= TYPE_TARGET_TYPE (type
);
6788 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6789 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6795 target_terminal_ours ();
6796 gdb_flush (gdb_stdout
);
6798 error (_("Type (null) is not a structure or union type"));
6801 /* XXX: type_sprint */
6802 fprintf_unfiltered (gdb_stderr
, _("Type "));
6803 type_print (type
, "", gdb_stderr
, -1);
6804 error (_(" is not a structure or union type"));
6809 type
= to_static_fixed_type (type
);
6811 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6813 const char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6817 if (t_field_name
== NULL
)
6820 else if (field_name_match (t_field_name
, name
))
6823 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6824 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6827 else if (ada_is_wrapper_field (type
, i
))
6830 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6835 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6840 else if (ada_is_variant_part (type
, i
))
6843 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6846 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6848 /* FIXME pnh 2008/01/26: We check for a field that is
6849 NOT wrapped in a struct, since the compiler sometimes
6850 generates these for unchecked variant types. Revisit
6851 if the compiler changes this practice. */
6852 const char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6854 if (v_field_name
!= NULL
6855 && field_name_match (v_field_name
, name
))
6856 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6858 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
6865 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6876 target_terminal_ours ();
6877 gdb_flush (gdb_stdout
);
6880 /* XXX: type_sprint */
6881 fprintf_unfiltered (gdb_stderr
, _("Type "));
6882 type_print (type
, "", gdb_stderr
, -1);
6883 error (_(" has no component named <null>"));
6887 /* XXX: type_sprint */
6888 fprintf_unfiltered (gdb_stderr
, _("Type "));
6889 type_print (type
, "", gdb_stderr
, -1);
6890 error (_(" has no component named %s"), name
);
6897 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6898 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6899 represents an unchecked union (that is, the variant part of a
6900 record that is named in an Unchecked_Union pragma). */
6903 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6905 char *discrim_name
= ada_variant_discrim_name (var_type
);
6907 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6912 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6913 within a value of type OUTER_TYPE that is stored in GDB at
6914 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6915 numbering from 0) is applicable. Returns -1 if none are. */
6918 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6919 const gdb_byte
*outer_valaddr
)
6923 char *discrim_name
= ada_variant_discrim_name (var_type
);
6924 struct value
*outer
;
6925 struct value
*discrim
;
6926 LONGEST discrim_val
;
6928 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6929 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6930 if (discrim
== NULL
)
6932 discrim_val
= value_as_long (discrim
);
6935 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6937 if (ada_is_others_clause (var_type
, i
))
6939 else if (ada_in_variant (discrim_val
, var_type
, i
))
6943 return others_clause
;
6948 /* Dynamic-Sized Records */
6950 /* Strategy: The type ostensibly attached to a value with dynamic size
6951 (i.e., a size that is not statically recorded in the debugging
6952 data) does not accurately reflect the size or layout of the value.
6953 Our strategy is to convert these values to values with accurate,
6954 conventional types that are constructed on the fly. */
6956 /* There is a subtle and tricky problem here. In general, we cannot
6957 determine the size of dynamic records without its data. However,
6958 the 'struct value' data structure, which GDB uses to represent
6959 quantities in the inferior process (the target), requires the size
6960 of the type at the time of its allocation in order to reserve space
6961 for GDB's internal copy of the data. That's why the
6962 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6963 rather than struct value*s.
6965 However, GDB's internal history variables ($1, $2, etc.) are
6966 struct value*s containing internal copies of the data that are not, in
6967 general, the same as the data at their corresponding addresses in
6968 the target. Fortunately, the types we give to these values are all
6969 conventional, fixed-size types (as per the strategy described
6970 above), so that we don't usually have to perform the
6971 'to_fixed_xxx_type' conversions to look at their values.
6972 Unfortunately, there is one exception: if one of the internal
6973 history variables is an array whose elements are unconstrained
6974 records, then we will need to create distinct fixed types for each
6975 element selected. */
6977 /* The upshot of all of this is that many routines take a (type, host
6978 address, target address) triple as arguments to represent a value.
6979 The host address, if non-null, is supposed to contain an internal
6980 copy of the relevant data; otherwise, the program is to consult the
6981 target at the target address. */
6983 /* Assuming that VAL0 represents a pointer value, the result of
6984 dereferencing it. Differs from value_ind in its treatment of
6985 dynamic-sized types. */
6988 ada_value_ind (struct value
*val0
)
6990 struct value
*val
= value_ind (val0
);
6992 return ada_to_fixed_value (val
);
6995 /* The value resulting from dereferencing any "reference to"
6996 qualifiers on VAL0. */
6998 static struct value
*
6999 ada_coerce_ref (struct value
*val0
)
7001 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
7003 struct value
*val
= val0
;
7005 val
= coerce_ref (val
);
7006 return ada_to_fixed_value (val
);
7012 /* Return OFF rounded upward if necessary to a multiple of
7013 ALIGNMENT (a power of 2). */
7016 align_value (unsigned int off
, unsigned int alignment
)
7018 return (off
+ alignment
- 1) & ~(alignment
- 1);
7021 /* Return the bit alignment required for field #F of template type TYPE. */
7024 field_alignment (struct type
*type
, int f
)
7026 const char *name
= TYPE_FIELD_NAME (type
, f
);
7030 /* The field name should never be null, unless the debugging information
7031 is somehow malformed. In this case, we assume the field does not
7032 require any alignment. */
7036 len
= strlen (name
);
7038 if (!isdigit (name
[len
- 1]))
7041 if (isdigit (name
[len
- 2]))
7042 align_offset
= len
- 2;
7044 align_offset
= len
- 1;
7046 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
7047 return TARGET_CHAR_BIT
;
7049 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
7052 /* Find a typedef or tag symbol named NAME. Ignores ambiguity. */
7054 static struct symbol
*
7055 ada_find_any_type_symbol (const char *name
)
7059 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
7060 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
7063 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
7067 /* Find a type named NAME. Ignores ambiguity. This routine will look
7068 solely for types defined by debug info, it will not search the GDB
7071 static struct type
*
7072 ada_find_any_type (const char *name
)
7074 struct symbol
*sym
= ada_find_any_type_symbol (name
);
7077 return SYMBOL_TYPE (sym
);
7082 /* Given NAME_SYM and an associated BLOCK, find a "renaming" symbol
7083 associated with NAME_SYM's name. NAME_SYM may itself be a renaming
7084 symbol, in which case it is returned. Otherwise, this looks for
7085 symbols whose name is that of NAME_SYM suffixed with "___XR".
7086 Return symbol if found, and NULL otherwise. */
7089 ada_find_renaming_symbol (struct symbol
*name_sym
, struct block
*block
)
7091 const char *name
= SYMBOL_LINKAGE_NAME (name_sym
);
7094 if (strstr (name
, "___XR") != NULL
)
7097 sym
= find_old_style_renaming_symbol (name
, block
);
7102 /* Not right yet. FIXME pnh 7/20/2007. */
7103 sym
= ada_find_any_type_symbol (name
);
7104 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
7110 static struct symbol
*
7111 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
7113 const struct symbol
*function_sym
= block_linkage_function (block
);
7116 if (function_sym
!= NULL
)
7118 /* If the symbol is defined inside a function, NAME is not fully
7119 qualified. This means we need to prepend the function name
7120 as well as adding the ``___XR'' suffix to build the name of
7121 the associated renaming symbol. */
7122 const char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7123 /* Function names sometimes contain suffixes used
7124 for instance to qualify nested subprograms. When building
7125 the XR type name, we need to make sure that this suffix is
7126 not included. So do not include any suffix in the function
7127 name length below. */
7128 int function_name_len
= ada_name_prefix_len (function_name
);
7129 const int rename_len
= function_name_len
+ 2 /* "__" */
7130 + strlen (name
) + 6 /* "___XR\0" */ ;
7132 /* Strip the suffix if necessary. */
7133 ada_remove_trailing_digits (function_name
, &function_name_len
);
7134 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7135 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7137 /* Library-level functions are a special case, as GNAT adds
7138 a ``_ada_'' prefix to the function name to avoid namespace
7139 pollution. However, the renaming symbols themselves do not
7140 have this prefix, so we need to skip this prefix if present. */
7141 if (function_name_len
> 5 /* "_ada_" */
7142 && strstr (function_name
, "_ada_") == function_name
)
7145 function_name_len
-= 5;
7148 rename
= (char *) alloca (rename_len
* sizeof (char));
7149 strncpy (rename
, function_name
, function_name_len
);
7150 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7155 const int rename_len
= strlen (name
) + 6;
7157 rename
= (char *) alloca (rename_len
* sizeof (char));
7158 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7161 return ada_find_any_type_symbol (rename
);
7164 /* Because of GNAT encoding conventions, several GDB symbols may match a
7165 given type name. If the type denoted by TYPE0 is to be preferred to
7166 that of TYPE1 for purposes of type printing, return non-zero;
7167 otherwise return 0. */
7170 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7174 else if (type0
== NULL
)
7176 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7178 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7180 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7182 else if (ada_is_constrained_packed_array_type (type0
))
7184 else if (ada_is_array_descriptor_type (type0
)
7185 && !ada_is_array_descriptor_type (type1
))
7189 const char *type0_name
= type_name_no_tag (type0
);
7190 const char *type1_name
= type_name_no_tag (type1
);
7192 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7193 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7199 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7200 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7203 ada_type_name (struct type
*type
)
7207 else if (TYPE_NAME (type
) != NULL
)
7208 return TYPE_NAME (type
);
7210 return TYPE_TAG_NAME (type
);
7213 /* Search the list of "descriptive" types associated to TYPE for a type
7214 whose name is NAME. */
7216 static struct type
*
7217 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7219 struct type
*result
;
7221 /* If there no descriptive-type info, then there is no parallel type
7223 if (!HAVE_GNAT_AUX_INFO (type
))
7226 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7227 while (result
!= NULL
)
7229 const char *result_name
= ada_type_name (result
);
7231 if (result_name
== NULL
)
7233 warning (_("unexpected null name on descriptive type"));
7237 /* If the names match, stop. */
7238 if (strcmp (result_name
, name
) == 0)
7241 /* Otherwise, look at the next item on the list, if any. */
7242 if (HAVE_GNAT_AUX_INFO (result
))
7243 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7248 /* If we didn't find a match, see whether this is a packed array. With
7249 older compilers, the descriptive type information is either absent or
7250 irrelevant when it comes to packed arrays so the above lookup fails.
7251 Fall back to using a parallel lookup by name in this case. */
7252 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7253 return ada_find_any_type (name
);
7258 /* Find a parallel type to TYPE with the specified NAME, using the
7259 descriptive type taken from the debugging information, if available,
7260 and otherwise using the (slower) name-based method. */
7262 static struct type
*
7263 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7265 struct type
*result
= NULL
;
7267 if (HAVE_GNAT_AUX_INFO (type
))
7268 result
= find_parallel_type_by_descriptive_type (type
, name
);
7270 result
= ada_find_any_type (name
);
7275 /* Same as above, but specify the name of the parallel type by appending
7276 SUFFIX to the name of TYPE. */
7279 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7282 const char *typename
= ada_type_name (type
);
7285 if (typename
== NULL
)
7288 len
= strlen (typename
);
7290 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7292 strcpy (name
, typename
);
7293 strcpy (name
+ len
, suffix
);
7295 return ada_find_parallel_type_with_name (type
, name
);
7298 /* If TYPE is a variable-size record type, return the corresponding template
7299 type describing its fields. Otherwise, return NULL. */
7301 static struct type
*
7302 dynamic_template_type (struct type
*type
)
7304 type
= ada_check_typedef (type
);
7306 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7307 || ada_type_name (type
) == NULL
)
7311 int len
= strlen (ada_type_name (type
));
7313 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7316 return ada_find_parallel_type (type
, "___XVE");
7320 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7321 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7324 is_dynamic_field (struct type
*templ_type
, int field_num
)
7326 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7329 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7330 && strstr (name
, "___XVL") != NULL
;
7333 /* The index of the variant field of TYPE, or -1 if TYPE does not
7334 represent a variant record type. */
7337 variant_field_index (struct type
*type
)
7341 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7344 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7346 if (ada_is_variant_part (type
, f
))
7352 /* A record type with no fields. */
7354 static struct type
*
7355 empty_record (struct type
*template)
7357 struct type
*type
= alloc_type_copy (template);
7359 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7360 TYPE_NFIELDS (type
) = 0;
7361 TYPE_FIELDS (type
) = NULL
;
7362 INIT_CPLUS_SPECIFIC (type
);
7363 TYPE_NAME (type
) = "<empty>";
7364 TYPE_TAG_NAME (type
) = NULL
;
7365 TYPE_LENGTH (type
) = 0;
7369 /* An ordinary record type (with fixed-length fields) that describes
7370 the value of type TYPE at VALADDR or ADDRESS (see comments at
7371 the beginning of this section) VAL according to GNAT conventions.
7372 DVAL0 should describe the (portion of a) record that contains any
7373 necessary discriminants. It should be NULL if value_type (VAL) is
7374 an outer-level type (i.e., as opposed to a branch of a variant.) A
7375 variant field (unless unchecked) is replaced by a particular branch
7378 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7379 length are not statically known are discarded. As a consequence,
7380 VALADDR, ADDRESS and DVAL0 are ignored.
7382 NOTE: Limitations: For now, we assume that dynamic fields and
7383 variants occupy whole numbers of bytes. However, they need not be
7387 ada_template_to_fixed_record_type_1 (struct type
*type
,
7388 const gdb_byte
*valaddr
,
7389 CORE_ADDR address
, struct value
*dval0
,
7390 int keep_dynamic_fields
)
7392 struct value
*mark
= value_mark ();
7395 int nfields
, bit_len
;
7401 /* Compute the number of fields in this record type that are going
7402 to be processed: unless keep_dynamic_fields, this includes only
7403 fields whose position and length are static will be processed. */
7404 if (keep_dynamic_fields
)
7405 nfields
= TYPE_NFIELDS (type
);
7409 while (nfields
< TYPE_NFIELDS (type
)
7410 && !ada_is_variant_part (type
, nfields
)
7411 && !is_dynamic_field (type
, nfields
))
7415 rtype
= alloc_type_copy (type
);
7416 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7417 INIT_CPLUS_SPECIFIC (rtype
);
7418 TYPE_NFIELDS (rtype
) = nfields
;
7419 TYPE_FIELDS (rtype
) = (struct field
*)
7420 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7421 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7422 TYPE_NAME (rtype
) = ada_type_name (type
);
7423 TYPE_TAG_NAME (rtype
) = NULL
;
7424 TYPE_FIXED_INSTANCE (rtype
) = 1;
7430 for (f
= 0; f
< nfields
; f
+= 1)
7432 off
= align_value (off
, field_alignment (type
, f
))
7433 + TYPE_FIELD_BITPOS (type
, f
);
7434 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
7435 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7437 if (ada_is_variant_part (type
, f
))
7442 else if (is_dynamic_field (type
, f
))
7444 const gdb_byte
*field_valaddr
= valaddr
;
7445 CORE_ADDR field_address
= address
;
7446 struct type
*field_type
=
7447 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7451 /* rtype's length is computed based on the run-time
7452 value of discriminants. If the discriminants are not
7453 initialized, the type size may be completely bogus and
7454 GDB may fail to allocate a value for it. So check the
7455 size first before creating the value. */
7457 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7462 /* If the type referenced by this field is an aligner type, we need
7463 to unwrap that aligner type, because its size might not be set.
7464 Keeping the aligner type would cause us to compute the wrong
7465 size for this field, impacting the offset of the all the fields
7466 that follow this one. */
7467 if (ada_is_aligner_type (field_type
))
7469 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7471 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7472 field_address
= cond_offset_target (field_address
, field_offset
);
7473 field_type
= ada_aligned_type (field_type
);
7476 field_valaddr
= cond_offset_host (field_valaddr
,
7477 off
/ TARGET_CHAR_BIT
);
7478 field_address
= cond_offset_target (field_address
,
7479 off
/ TARGET_CHAR_BIT
);
7481 /* Get the fixed type of the field. Note that, in this case,
7482 we do not want to get the real type out of the tag: if
7483 the current field is the parent part of a tagged record,
7484 we will get the tag of the object. Clearly wrong: the real
7485 type of the parent is not the real type of the child. We
7486 would end up in an infinite loop. */
7487 field_type
= ada_get_base_type (field_type
);
7488 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7489 field_address
, dval
, 0);
7490 /* If the field size is already larger than the maximum
7491 object size, then the record itself will necessarily
7492 be larger than the maximum object size. We need to make
7493 this check now, because the size might be so ridiculously
7494 large (due to an uninitialized variable in the inferior)
7495 that it would cause an overflow when adding it to the
7497 check_size (field_type
);
7499 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7500 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7501 /* The multiplication can potentially overflow. But because
7502 the field length has been size-checked just above, and
7503 assuming that the maximum size is a reasonable value,
7504 an overflow should not happen in practice. So rather than
7505 adding overflow recovery code to this already complex code,
7506 we just assume that it's not going to happen. */
7508 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7512 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7514 /* If our field is a typedef type (most likely a typedef of
7515 a fat pointer, encoding an array access), then we need to
7516 look at its target type to determine its characteristics.
7517 In particular, we would miscompute the field size if we took
7518 the size of the typedef (zero), instead of the size of
7520 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7521 field_type
= ada_typedef_target_type (field_type
);
7523 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7524 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7525 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7527 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7530 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7532 if (off
+ fld_bit_len
> bit_len
)
7533 bit_len
= off
+ fld_bit_len
;
7535 TYPE_LENGTH (rtype
) =
7536 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7539 /* We handle the variant part, if any, at the end because of certain
7540 odd cases in which it is re-ordered so as NOT to be the last field of
7541 the record. This can happen in the presence of representation
7543 if (variant_field
>= 0)
7545 struct type
*branch_type
;
7547 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7550 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7555 to_fixed_variant_branch_type
7556 (TYPE_FIELD_TYPE (type
, variant_field
),
7557 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7558 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7559 if (branch_type
== NULL
)
7561 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7562 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7563 TYPE_NFIELDS (rtype
) -= 1;
7567 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7568 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7570 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7572 if (off
+ fld_bit_len
> bit_len
)
7573 bit_len
= off
+ fld_bit_len
;
7574 TYPE_LENGTH (rtype
) =
7575 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7579 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7580 should contain the alignment of that record, which should be a strictly
7581 positive value. If null or negative, then something is wrong, most
7582 probably in the debug info. In that case, we don't round up the size
7583 of the resulting type. If this record is not part of another structure,
7584 the current RTYPE length might be good enough for our purposes. */
7585 if (TYPE_LENGTH (type
) <= 0)
7587 if (TYPE_NAME (rtype
))
7588 warning (_("Invalid type size for `%s' detected: %d."),
7589 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7591 warning (_("Invalid type size for <unnamed> detected: %d."),
7592 TYPE_LENGTH (type
));
7596 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7597 TYPE_LENGTH (type
));
7600 value_free_to_mark (mark
);
7601 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7602 error (_("record type with dynamic size is larger than varsize-limit"));
7606 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7609 static struct type
*
7610 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7611 CORE_ADDR address
, struct value
*dval0
)
7613 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7617 /* An ordinary record type in which ___XVL-convention fields and
7618 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7619 static approximations, containing all possible fields. Uses
7620 no runtime values. Useless for use in values, but that's OK,
7621 since the results are used only for type determinations. Works on both
7622 structs and unions. Representation note: to save space, we memorize
7623 the result of this function in the TYPE_TARGET_TYPE of the
7626 static struct type
*
7627 template_to_static_fixed_type (struct type
*type0
)
7633 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7634 return TYPE_TARGET_TYPE (type0
);
7636 nfields
= TYPE_NFIELDS (type0
);
7639 for (f
= 0; f
< nfields
; f
+= 1)
7641 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7642 struct type
*new_type
;
7644 if (is_dynamic_field (type0
, f
))
7645 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7647 new_type
= static_unwrap_type (field_type
);
7648 if (type
== type0
&& new_type
!= field_type
)
7650 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7651 TYPE_CODE (type
) = TYPE_CODE (type0
);
7652 INIT_CPLUS_SPECIFIC (type
);
7653 TYPE_NFIELDS (type
) = nfields
;
7654 TYPE_FIELDS (type
) = (struct field
*)
7655 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7656 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7657 sizeof (struct field
) * nfields
);
7658 TYPE_NAME (type
) = ada_type_name (type0
);
7659 TYPE_TAG_NAME (type
) = NULL
;
7660 TYPE_FIXED_INSTANCE (type
) = 1;
7661 TYPE_LENGTH (type
) = 0;
7663 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7664 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7669 /* Given an object of type TYPE whose contents are at VALADDR and
7670 whose address in memory is ADDRESS, returns a revision of TYPE,
7671 which should be a non-dynamic-sized record, in which the variant
7672 part, if any, is replaced with the appropriate branch. Looks
7673 for discriminant values in DVAL0, which can be NULL if the record
7674 contains the necessary discriminant values. */
7676 static struct type
*
7677 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7678 CORE_ADDR address
, struct value
*dval0
)
7680 struct value
*mark
= value_mark ();
7683 struct type
*branch_type
;
7684 int nfields
= TYPE_NFIELDS (type
);
7685 int variant_field
= variant_field_index (type
);
7687 if (variant_field
== -1)
7691 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7695 rtype
= alloc_type_copy (type
);
7696 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7697 INIT_CPLUS_SPECIFIC (rtype
);
7698 TYPE_NFIELDS (rtype
) = nfields
;
7699 TYPE_FIELDS (rtype
) =
7700 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7701 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7702 sizeof (struct field
) * nfields
);
7703 TYPE_NAME (rtype
) = ada_type_name (type
);
7704 TYPE_TAG_NAME (rtype
) = NULL
;
7705 TYPE_FIXED_INSTANCE (rtype
) = 1;
7706 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7708 branch_type
= to_fixed_variant_branch_type
7709 (TYPE_FIELD_TYPE (type
, variant_field
),
7710 cond_offset_host (valaddr
,
7711 TYPE_FIELD_BITPOS (type
, variant_field
)
7713 cond_offset_target (address
,
7714 TYPE_FIELD_BITPOS (type
, variant_field
)
7715 / TARGET_CHAR_BIT
), dval
);
7716 if (branch_type
== NULL
)
7720 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7721 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7722 TYPE_NFIELDS (rtype
) -= 1;
7726 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7727 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7728 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7729 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7731 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7733 value_free_to_mark (mark
);
7737 /* An ordinary record type (with fixed-length fields) that describes
7738 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7739 beginning of this section]. Any necessary discriminants' values
7740 should be in DVAL, a record value; it may be NULL if the object
7741 at ADDR itself contains any necessary discriminant values.
7742 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7743 values from the record are needed. Except in the case that DVAL,
7744 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7745 unchecked) is replaced by a particular branch of the variant.
7747 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7748 is questionable and may be removed. It can arise during the
7749 processing of an unconstrained-array-of-record type where all the
7750 variant branches have exactly the same size. This is because in
7751 such cases, the compiler does not bother to use the XVS convention
7752 when encoding the record. I am currently dubious of this
7753 shortcut and suspect the compiler should be altered. FIXME. */
7755 static struct type
*
7756 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7757 CORE_ADDR address
, struct value
*dval
)
7759 struct type
*templ_type
;
7761 if (TYPE_FIXED_INSTANCE (type0
))
7764 templ_type
= dynamic_template_type (type0
);
7766 if (templ_type
!= NULL
)
7767 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7768 else if (variant_field_index (type0
) >= 0)
7770 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7772 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7777 TYPE_FIXED_INSTANCE (type0
) = 1;
7783 /* An ordinary record type (with fixed-length fields) that describes
7784 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7785 union type. Any necessary discriminants' values should be in DVAL,
7786 a record value. That is, this routine selects the appropriate
7787 branch of the union at ADDR according to the discriminant value
7788 indicated in the union's type name. Returns VAR_TYPE0 itself if
7789 it represents a variant subject to a pragma Unchecked_Union. */
7791 static struct type
*
7792 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7793 CORE_ADDR address
, struct value
*dval
)
7796 struct type
*templ_type
;
7797 struct type
*var_type
;
7799 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7800 var_type
= TYPE_TARGET_TYPE (var_type0
);
7802 var_type
= var_type0
;
7804 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7806 if (templ_type
!= NULL
)
7807 var_type
= templ_type
;
7809 if (is_unchecked_variant (var_type
, value_type (dval
)))
7812 ada_which_variant_applies (var_type
,
7813 value_type (dval
), value_contents (dval
));
7816 return empty_record (var_type
);
7817 else if (is_dynamic_field (var_type
, which
))
7818 return to_fixed_record_type
7819 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7820 valaddr
, address
, dval
);
7821 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7823 to_fixed_record_type
7824 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7826 return TYPE_FIELD_TYPE (var_type
, which
);
7829 /* Assuming that TYPE0 is an array type describing the type of a value
7830 at ADDR, and that DVAL describes a record containing any
7831 discriminants used in TYPE0, returns a type for the value that
7832 contains no dynamic components (that is, no components whose sizes
7833 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7834 true, gives an error message if the resulting type's size is over
7837 static struct type
*
7838 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7841 struct type
*index_type_desc
;
7842 struct type
*result
;
7843 int constrained_packed_array_p
;
7845 type0
= ada_check_typedef (type0
);
7846 if (TYPE_FIXED_INSTANCE (type0
))
7849 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7850 if (constrained_packed_array_p
)
7851 type0
= decode_constrained_packed_array_type (type0
);
7853 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7854 ada_fixup_array_indexes_type (index_type_desc
);
7855 if (index_type_desc
== NULL
)
7857 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7859 /* NOTE: elt_type---the fixed version of elt_type0---should never
7860 depend on the contents of the array in properly constructed
7862 /* Create a fixed version of the array element type.
7863 We're not providing the address of an element here,
7864 and thus the actual object value cannot be inspected to do
7865 the conversion. This should not be a problem, since arrays of
7866 unconstrained objects are not allowed. In particular, all
7867 the elements of an array of a tagged type should all be of
7868 the same type specified in the debugging info. No need to
7869 consult the object tag. */
7870 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7872 /* Make sure we always create a new array type when dealing with
7873 packed array types, since we're going to fix-up the array
7874 type length and element bitsize a little further down. */
7875 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7878 result
= create_array_type (alloc_type_copy (type0
),
7879 elt_type
, TYPE_INDEX_TYPE (type0
));
7884 struct type
*elt_type0
;
7887 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7888 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7890 /* NOTE: result---the fixed version of elt_type0---should never
7891 depend on the contents of the array in properly constructed
7893 /* Create a fixed version of the array element type.
7894 We're not providing the address of an element here,
7895 and thus the actual object value cannot be inspected to do
7896 the conversion. This should not be a problem, since arrays of
7897 unconstrained objects are not allowed. In particular, all
7898 the elements of an array of a tagged type should all be of
7899 the same type specified in the debugging info. No need to
7900 consult the object tag. */
7902 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7905 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7907 struct type
*range_type
=
7908 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
7910 result
= create_array_type (alloc_type_copy (elt_type0
),
7911 result
, range_type
);
7912 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7914 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7915 error (_("array type with dynamic size is larger than varsize-limit"));
7918 /* We want to preserve the type name. This can be useful when
7919 trying to get the type name of a value that has already been
7920 printed (for instance, if the user did "print VAR; whatis $". */
7921 TYPE_NAME (result
) = TYPE_NAME (type0
);
7923 if (constrained_packed_array_p
)
7925 /* So far, the resulting type has been created as if the original
7926 type was a regular (non-packed) array type. As a result, the
7927 bitsize of the array elements needs to be set again, and the array
7928 length needs to be recomputed based on that bitsize. */
7929 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7930 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7932 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7933 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7934 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7935 TYPE_LENGTH (result
)++;
7938 TYPE_FIXED_INSTANCE (result
) = 1;
7943 /* A standard type (containing no dynamically sized components)
7944 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7945 DVAL describes a record containing any discriminants used in TYPE0,
7946 and may be NULL if there are none, or if the object of type TYPE at
7947 ADDRESS or in VALADDR contains these discriminants.
7949 If CHECK_TAG is not null, in the case of tagged types, this function
7950 attempts to locate the object's tag and use it to compute the actual
7951 type. However, when ADDRESS is null, we cannot use it to determine the
7952 location of the tag, and therefore compute the tagged type's actual type.
7953 So we return the tagged type without consulting the tag. */
7955 static struct type
*
7956 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7957 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7959 type
= ada_check_typedef (type
);
7960 switch (TYPE_CODE (type
))
7964 case TYPE_CODE_STRUCT
:
7966 struct type
*static_type
= to_static_fixed_type (type
);
7967 struct type
*fixed_record_type
=
7968 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7970 /* If STATIC_TYPE is a tagged type and we know the object's address,
7971 then we can determine its tag, and compute the object's actual
7972 type from there. Note that we have to use the fixed record
7973 type (the parent part of the record may have dynamic fields
7974 and the way the location of _tag is expressed may depend on
7977 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7979 struct type
*real_type
=
7980 type_from_tag (value_tag_from_contents_and_address
7985 if (real_type
!= NULL
)
7986 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7989 /* Check to see if there is a parallel ___XVZ variable.
7990 If there is, then it provides the actual size of our type. */
7991 else if (ada_type_name (fixed_record_type
) != NULL
)
7993 const char *name
= ada_type_name (fixed_record_type
);
7994 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7998 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7999 size
= get_int_var_value (xvz_name
, &xvz_found
);
8000 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
8002 fixed_record_type
= copy_type (fixed_record_type
);
8003 TYPE_LENGTH (fixed_record_type
) = size
;
8005 /* The FIXED_RECORD_TYPE may have be a stub. We have
8006 observed this when the debugging info is STABS, and
8007 apparently it is something that is hard to fix.
8009 In practice, we don't need the actual type definition
8010 at all, because the presence of the XVZ variable allows us
8011 to assume that there must be a XVS type as well, which we
8012 should be able to use later, when we need the actual type
8015 In the meantime, pretend that the "fixed" type we are
8016 returning is NOT a stub, because this can cause trouble
8017 when using this type to create new types targeting it.
8018 Indeed, the associated creation routines often check
8019 whether the target type is a stub and will try to replace
8020 it, thus using a type with the wrong size. This, in turn,
8021 might cause the new type to have the wrong size too.
8022 Consider the case of an array, for instance, where the size
8023 of the array is computed from the number of elements in
8024 our array multiplied by the size of its element. */
8025 TYPE_STUB (fixed_record_type
) = 0;
8028 return fixed_record_type
;
8030 case TYPE_CODE_ARRAY
:
8031 return to_fixed_array_type (type
, dval
, 1);
8032 case TYPE_CODE_UNION
:
8036 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
8040 /* The same as ada_to_fixed_type_1, except that it preserves the type
8041 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
8043 The typedef layer needs be preserved in order to differentiate between
8044 arrays and array pointers when both types are implemented using the same
8045 fat pointer. In the array pointer case, the pointer is encoded as
8046 a typedef of the pointer type. For instance, considering:
8048 type String_Access is access String;
8049 S1 : String_Access := null;
8051 To the debugger, S1 is defined as a typedef of type String. But
8052 to the user, it is a pointer. So if the user tries to print S1,
8053 we should not dereference the array, but print the array address
8056 If we didn't preserve the typedef layer, we would lose the fact that
8057 the type is to be presented as a pointer (needs de-reference before
8058 being printed). And we would also use the source-level type name. */
8061 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
8062 CORE_ADDR address
, struct value
*dval
, int check_tag
)
8065 struct type
*fixed_type
=
8066 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
8068 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
8069 then preserve the typedef layer.
8071 Implementation note: We can only check the main-type portion of
8072 the TYPE and FIXED_TYPE, because eliminating the typedef layer
8073 from TYPE now returns a type that has the same instance flags
8074 as TYPE. For instance, if TYPE is a "typedef const", and its
8075 target type is a "struct", then the typedef elimination will return
8076 a "const" version of the target type. See check_typedef for more
8077 details about how the typedef layer elimination is done.
8079 brobecker/2010-11-19: It seems to me that the only case where it is
8080 useful to preserve the typedef layer is when dealing with fat pointers.
8081 Perhaps, we could add a check for that and preserve the typedef layer
8082 only in that situation. But this seems unecessary so far, probably
8083 because we call check_typedef/ada_check_typedef pretty much everywhere.
8085 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8086 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
8087 == TYPE_MAIN_TYPE (fixed_type
)))
8093 /* A standard (static-sized) type corresponding as well as possible to
8094 TYPE0, but based on no runtime data. */
8096 static struct type
*
8097 to_static_fixed_type (struct type
*type0
)
8104 if (TYPE_FIXED_INSTANCE (type0
))
8107 type0
= ada_check_typedef (type0
);
8109 switch (TYPE_CODE (type0
))
8113 case TYPE_CODE_STRUCT
:
8114 type
= dynamic_template_type (type0
);
8116 return template_to_static_fixed_type (type
);
8118 return template_to_static_fixed_type (type0
);
8119 case TYPE_CODE_UNION
:
8120 type
= ada_find_parallel_type (type0
, "___XVU");
8122 return template_to_static_fixed_type (type
);
8124 return template_to_static_fixed_type (type0
);
8128 /* A static approximation of TYPE with all type wrappers removed. */
8130 static struct type
*
8131 static_unwrap_type (struct type
*type
)
8133 if (ada_is_aligner_type (type
))
8135 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8136 if (ada_type_name (type1
) == NULL
)
8137 TYPE_NAME (type1
) = ada_type_name (type
);
8139 return static_unwrap_type (type1
);
8143 struct type
*raw_real_type
= ada_get_base_type (type
);
8145 if (raw_real_type
== type
)
8148 return to_static_fixed_type (raw_real_type
);
8152 /* In some cases, incomplete and private types require
8153 cross-references that are not resolved as records (for example,
8155 type FooP is access Foo;
8157 type Foo is array ...;
8158 ). In these cases, since there is no mechanism for producing
8159 cross-references to such types, we instead substitute for FooP a
8160 stub enumeration type that is nowhere resolved, and whose tag is
8161 the name of the actual type. Call these types "non-record stubs". */
8163 /* A type equivalent to TYPE that is not a non-record stub, if one
8164 exists, otherwise TYPE. */
8167 ada_check_typedef (struct type
*type
)
8172 /* If our type is a typedef type of a fat pointer, then we're done.
8173 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8174 what allows us to distinguish between fat pointers that represent
8175 array types, and fat pointers that represent array access types
8176 (in both cases, the compiler implements them as fat pointers). */
8177 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8178 && is_thick_pntr (ada_typedef_target_type (type
)))
8181 CHECK_TYPEDEF (type
);
8182 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8183 || !TYPE_STUB (type
)
8184 || TYPE_TAG_NAME (type
) == NULL
)
8188 const char *name
= TYPE_TAG_NAME (type
);
8189 struct type
*type1
= ada_find_any_type (name
);
8194 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8195 stubs pointing to arrays, as we don't create symbols for array
8196 types, only for the typedef-to-array types). If that's the case,
8197 strip the typedef layer. */
8198 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8199 type1
= ada_check_typedef (type1
);
8205 /* A value representing the data at VALADDR/ADDRESS as described by
8206 type TYPE0, but with a standard (static-sized) type that correctly
8207 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8208 type, then return VAL0 [this feature is simply to avoid redundant
8209 creation of struct values]. */
8211 static struct value
*
8212 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8215 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8217 if (type
== type0
&& val0
!= NULL
)
8220 return value_from_contents_and_address (type
, 0, address
);
8223 /* A value representing VAL, but with a standard (static-sized) type
8224 that correctly describes it. Does not necessarily create a new
8228 ada_to_fixed_value (struct value
*val
)
8230 val
= unwrap_value (val
);
8231 val
= ada_to_fixed_value_create (value_type (val
),
8232 value_address (val
),
8240 /* Table mapping attribute numbers to names.
8241 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8243 static const char *attribute_names
[] = {
8261 ada_attribute_name (enum exp_opcode n
)
8263 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8264 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8266 return attribute_names
[0];
8269 /* Evaluate the 'POS attribute applied to ARG. */
8272 pos_atr (struct value
*arg
)
8274 struct value
*val
= coerce_ref (arg
);
8275 struct type
*type
= value_type (val
);
8277 if (!discrete_type_p (type
))
8278 error (_("'POS only defined on discrete types"));
8280 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8283 LONGEST v
= value_as_long (val
);
8285 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8287 if (v
== TYPE_FIELD_BITPOS (type
, i
))
8290 error (_("enumeration value is invalid: can't find 'POS"));
8293 return value_as_long (val
);
8296 static struct value
*
8297 value_pos_atr (struct type
*type
, struct value
*arg
)
8299 return value_from_longest (type
, pos_atr (arg
));
8302 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8304 static struct value
*
8305 value_val_atr (struct type
*type
, struct value
*arg
)
8307 if (!discrete_type_p (type
))
8308 error (_("'VAL only defined on discrete types"));
8309 if (!integer_type_p (value_type (arg
)))
8310 error (_("'VAL requires integral argument"));
8312 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8314 long pos
= value_as_long (arg
);
8316 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8317 error (_("argument to 'VAL out of range"));
8318 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
8321 return value_from_longest (type
, value_as_long (arg
));
8327 /* True if TYPE appears to be an Ada character type.
8328 [At the moment, this is true only for Character and Wide_Character;
8329 It is a heuristic test that could stand improvement]. */
8332 ada_is_character_type (struct type
*type
)
8336 /* If the type code says it's a character, then assume it really is,
8337 and don't check any further. */
8338 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8341 /* Otherwise, assume it's a character type iff it is a discrete type
8342 with a known character type name. */
8343 name
= ada_type_name (type
);
8344 return (name
!= NULL
8345 && (TYPE_CODE (type
) == TYPE_CODE_INT
8346 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8347 && (strcmp (name
, "character") == 0
8348 || strcmp (name
, "wide_character") == 0
8349 || strcmp (name
, "wide_wide_character") == 0
8350 || strcmp (name
, "unsigned char") == 0));
8353 /* True if TYPE appears to be an Ada string type. */
8356 ada_is_string_type (struct type
*type
)
8358 type
= ada_check_typedef (type
);
8360 && TYPE_CODE (type
) != TYPE_CODE_PTR
8361 && (ada_is_simple_array_type (type
)
8362 || ada_is_array_descriptor_type (type
))
8363 && ada_array_arity (type
) == 1)
8365 struct type
*elttype
= ada_array_element_type (type
, 1);
8367 return ada_is_character_type (elttype
);
8373 /* The compiler sometimes provides a parallel XVS type for a given
8374 PAD type. Normally, it is safe to follow the PAD type directly,
8375 but older versions of the compiler have a bug that causes the offset
8376 of its "F" field to be wrong. Following that field in that case
8377 would lead to incorrect results, but this can be worked around
8378 by ignoring the PAD type and using the associated XVS type instead.
8380 Set to True if the debugger should trust the contents of PAD types.
8381 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8382 static int trust_pad_over_xvs
= 1;
8384 /* True if TYPE is a struct type introduced by the compiler to force the
8385 alignment of a value. Such types have a single field with a
8386 distinctive name. */
8389 ada_is_aligner_type (struct type
*type
)
8391 type
= ada_check_typedef (type
);
8393 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8396 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8397 && TYPE_NFIELDS (type
) == 1
8398 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8401 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8402 the parallel type. */
8405 ada_get_base_type (struct type
*raw_type
)
8407 struct type
*real_type_namer
;
8408 struct type
*raw_real_type
;
8410 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8413 if (ada_is_aligner_type (raw_type
))
8414 /* The encoding specifies that we should always use the aligner type.
8415 So, even if this aligner type has an associated XVS type, we should
8418 According to the compiler gurus, an XVS type parallel to an aligner
8419 type may exist because of a stabs limitation. In stabs, aligner
8420 types are empty because the field has a variable-sized type, and
8421 thus cannot actually be used as an aligner type. As a result,
8422 we need the associated parallel XVS type to decode the type.
8423 Since the policy in the compiler is to not change the internal
8424 representation based on the debugging info format, we sometimes
8425 end up having a redundant XVS type parallel to the aligner type. */
8428 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8429 if (real_type_namer
== NULL
8430 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8431 || TYPE_NFIELDS (real_type_namer
) != 1)
8434 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8436 /* This is an older encoding form where the base type needs to be
8437 looked up by name. We prefer the newer enconding because it is
8439 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8440 if (raw_real_type
== NULL
)
8443 return raw_real_type
;
8446 /* The field in our XVS type is a reference to the base type. */
8447 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8450 /* The type of value designated by TYPE, with all aligners removed. */
8453 ada_aligned_type (struct type
*type
)
8455 if (ada_is_aligner_type (type
))
8456 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8458 return ada_get_base_type (type
);
8462 /* The address of the aligned value in an object at address VALADDR
8463 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8466 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8468 if (ada_is_aligner_type (type
))
8469 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8471 TYPE_FIELD_BITPOS (type
,
8472 0) / TARGET_CHAR_BIT
);
8479 /* The printed representation of an enumeration literal with encoded
8480 name NAME. The value is good to the next call of ada_enum_name. */
8482 ada_enum_name (const char *name
)
8484 static char *result
;
8485 static size_t result_len
= 0;
8488 /* First, unqualify the enumeration name:
8489 1. Search for the last '.' character. If we find one, then skip
8490 all the preceding characters, the unqualified name starts
8491 right after that dot.
8492 2. Otherwise, we may be debugging on a target where the compiler
8493 translates dots into "__". Search forward for double underscores,
8494 but stop searching when we hit an overloading suffix, which is
8495 of the form "__" followed by digits. */
8497 tmp
= strrchr (name
, '.');
8502 while ((tmp
= strstr (name
, "__")) != NULL
)
8504 if (isdigit (tmp
[2]))
8515 if (name
[1] == 'U' || name
[1] == 'W')
8517 if (sscanf (name
+ 2, "%x", &v
) != 1)
8523 GROW_VECT (result
, result_len
, 16);
8524 if (isascii (v
) && isprint (v
))
8525 xsnprintf (result
, result_len
, "'%c'", v
);
8526 else if (name
[1] == 'U')
8527 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8529 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
8535 tmp
= strstr (name
, "__");
8537 tmp
= strstr (name
, "$");
8540 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8541 strncpy (result
, name
, tmp
- name
);
8542 result
[tmp
- name
] = '\0';
8550 /* Evaluate the subexpression of EXP starting at *POS as for
8551 evaluate_type, updating *POS to point just past the evaluated
8554 static struct value
*
8555 evaluate_subexp_type (struct expression
*exp
, int *pos
)
8557 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8560 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8563 static struct value
*
8564 unwrap_value (struct value
*val
)
8566 struct type
*type
= ada_check_typedef (value_type (val
));
8568 if (ada_is_aligner_type (type
))
8570 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
8571 struct type
*val_type
= ada_check_typedef (value_type (v
));
8573 if (ada_type_name (val_type
) == NULL
)
8574 TYPE_NAME (val_type
) = ada_type_name (type
);
8576 return unwrap_value (v
);
8580 struct type
*raw_real_type
=
8581 ada_check_typedef (ada_get_base_type (type
));
8583 /* If there is no parallel XVS or XVE type, then the value is
8584 already unwrapped. Return it without further modification. */
8585 if ((type
== raw_real_type
)
8586 && ada_find_parallel_type (type
, "___XVE") == NULL
)
8590 coerce_unspec_val_to_type
8591 (val
, ada_to_fixed_type (raw_real_type
, 0,
8592 value_address (val
),
8597 static struct value
*
8598 cast_to_fixed (struct type
*type
, struct value
*arg
)
8602 if (type
== value_type (arg
))
8604 else if (ada_is_fixed_point_type (value_type (arg
)))
8605 val
= ada_float_to_fixed (type
,
8606 ada_fixed_to_float (value_type (arg
),
8607 value_as_long (arg
)));
8610 DOUBLEST argd
= value_as_double (arg
);
8612 val
= ada_float_to_fixed (type
, argd
);
8615 return value_from_longest (type
, val
);
8618 static struct value
*
8619 cast_from_fixed (struct type
*type
, struct value
*arg
)
8621 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
8622 value_as_long (arg
));
8624 return value_from_double (type
, val
);
8627 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8628 return the converted value. */
8630 static struct value
*
8631 coerce_for_assign (struct type
*type
, struct value
*val
)
8633 struct type
*type2
= value_type (val
);
8638 type2
= ada_check_typedef (type2
);
8639 type
= ada_check_typedef (type
);
8641 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8642 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8644 val
= ada_value_ind (val
);
8645 type2
= value_type (val
);
8648 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8649 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8651 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8652 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8653 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8654 error (_("Incompatible types in assignment"));
8655 deprecated_set_value_type (val
, type
);
8660 static struct value
*
8661 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8664 struct type
*type1
, *type2
;
8667 arg1
= coerce_ref (arg1
);
8668 arg2
= coerce_ref (arg2
);
8669 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
8670 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
8672 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8673 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8674 return value_binop (arg1
, arg2
, op
);
8683 return value_binop (arg1
, arg2
, op
);
8686 v2
= value_as_long (arg2
);
8688 error (_("second operand of %s must not be zero."), op_string (op
));
8690 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8691 return value_binop (arg1
, arg2
, op
);
8693 v1
= value_as_long (arg1
);
8698 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8699 v
+= v
> 0 ? -1 : 1;
8707 /* Should not reach this point. */
8711 val
= allocate_value (type1
);
8712 store_unsigned_integer (value_contents_raw (val
),
8713 TYPE_LENGTH (value_type (val
)),
8714 gdbarch_byte_order (get_type_arch (type1
)), v
);
8719 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8721 if (ada_is_direct_array_type (value_type (arg1
))
8722 || ada_is_direct_array_type (value_type (arg2
)))
8724 /* Automatically dereference any array reference before
8725 we attempt to perform the comparison. */
8726 arg1
= ada_coerce_ref (arg1
);
8727 arg2
= ada_coerce_ref (arg2
);
8729 arg1
= ada_coerce_to_simple_array (arg1
);
8730 arg2
= ada_coerce_to_simple_array (arg2
);
8731 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8732 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8733 error (_("Attempt to compare array with non-array"));
8734 /* FIXME: The following works only for types whose
8735 representations use all bits (no padding or undefined bits)
8736 and do not have user-defined equality. */
8738 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8739 && memcmp (value_contents (arg1
), value_contents (arg2
),
8740 TYPE_LENGTH (value_type (arg1
))) == 0;
8742 return value_equal (arg1
, arg2
);
8745 /* Total number of component associations in the aggregate starting at
8746 index PC in EXP. Assumes that index PC is the start of an
8750 num_component_specs (struct expression
*exp
, int pc
)
8754 m
= exp
->elts
[pc
+ 1].longconst
;
8757 for (i
= 0; i
< m
; i
+= 1)
8759 switch (exp
->elts
[pc
].opcode
)
8765 n
+= exp
->elts
[pc
+ 1].longconst
;
8768 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8773 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8774 component of LHS (a simple array or a record), updating *POS past
8775 the expression, assuming that LHS is contained in CONTAINER. Does
8776 not modify the inferior's memory, nor does it modify LHS (unless
8777 LHS == CONTAINER). */
8780 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8781 struct expression
*exp
, int *pos
)
8783 struct value
*mark
= value_mark ();
8786 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8788 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8789 struct value
*index_val
= value_from_longest (index_type
, index
);
8791 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8795 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8796 elt
= ada_to_fixed_value (elt
);
8799 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8800 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8802 value_assign_to_component (container
, elt
,
8803 ada_evaluate_subexp (NULL
, exp
, pos
,
8806 value_free_to_mark (mark
);
8809 /* Assuming that LHS represents an lvalue having a record or array
8810 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8811 of that aggregate's value to LHS, advancing *POS past the
8812 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8813 lvalue containing LHS (possibly LHS itself). Does not modify
8814 the inferior's memory, nor does it modify the contents of
8815 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8817 static struct value
*
8818 assign_aggregate (struct value
*container
,
8819 struct value
*lhs
, struct expression
*exp
,
8820 int *pos
, enum noside noside
)
8822 struct type
*lhs_type
;
8823 int n
= exp
->elts
[*pos
+1].longconst
;
8824 LONGEST low_index
, high_index
;
8827 int max_indices
, num_indices
;
8828 int is_array_aggregate
;
8832 if (noside
!= EVAL_NORMAL
)
8834 for (i
= 0; i
< n
; i
+= 1)
8835 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8839 container
= ada_coerce_ref (container
);
8840 if (ada_is_direct_array_type (value_type (container
)))
8841 container
= ada_coerce_to_simple_array (container
);
8842 lhs
= ada_coerce_ref (lhs
);
8843 if (!deprecated_value_modifiable (lhs
))
8844 error (_("Left operand of assignment is not a modifiable lvalue."));
8846 lhs_type
= value_type (lhs
);
8847 if (ada_is_direct_array_type (lhs_type
))
8849 lhs
= ada_coerce_to_simple_array (lhs
);
8850 lhs_type
= value_type (lhs
);
8851 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8852 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8853 is_array_aggregate
= 1;
8855 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8858 high_index
= num_visible_fields (lhs_type
) - 1;
8859 is_array_aggregate
= 0;
8862 error (_("Left-hand side must be array or record."));
8864 num_specs
= num_component_specs (exp
, *pos
- 3);
8865 max_indices
= 4 * num_specs
+ 4;
8866 indices
= alloca (max_indices
* sizeof (indices
[0]));
8867 indices
[0] = indices
[1] = low_index
- 1;
8868 indices
[2] = indices
[3] = high_index
+ 1;
8871 for (i
= 0; i
< n
; i
+= 1)
8873 switch (exp
->elts
[*pos
].opcode
)
8876 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8877 &num_indices
, max_indices
,
8878 low_index
, high_index
);
8881 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8882 &num_indices
, max_indices
,
8883 low_index
, high_index
);
8887 error (_("Misplaced 'others' clause"));
8888 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8889 num_indices
, low_index
, high_index
);
8892 error (_("Internal error: bad aggregate clause"));
8899 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8900 construct at *POS, updating *POS past the construct, given that
8901 the positions are relative to lower bound LOW, where HIGH is the
8902 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8903 updating *NUM_INDICES as needed. CONTAINER is as for
8904 assign_aggregate. */
8906 aggregate_assign_positional (struct value
*container
,
8907 struct value
*lhs
, struct expression
*exp
,
8908 int *pos
, LONGEST
*indices
, int *num_indices
,
8909 int max_indices
, LONGEST low
, LONGEST high
)
8911 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8913 if (ind
- 1 == high
)
8914 warning (_("Extra components in aggregate ignored."));
8917 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8919 assign_component (container
, lhs
, ind
, exp
, pos
);
8922 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8925 /* Assign into the components of LHS indexed by the OP_CHOICES
8926 construct at *POS, updating *POS past the construct, given that
8927 the allowable indices are LOW..HIGH. Record the indices assigned
8928 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8929 needed. CONTAINER is as for assign_aggregate. */
8931 aggregate_assign_from_choices (struct value
*container
,
8932 struct value
*lhs
, struct expression
*exp
,
8933 int *pos
, LONGEST
*indices
, int *num_indices
,
8934 int max_indices
, LONGEST low
, LONGEST high
)
8937 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8938 int choice_pos
, expr_pc
;
8939 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8941 choice_pos
= *pos
+= 3;
8943 for (j
= 0; j
< n_choices
; j
+= 1)
8944 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8946 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8948 for (j
= 0; j
< n_choices
; j
+= 1)
8950 LONGEST lower
, upper
;
8951 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8953 if (op
== OP_DISCRETE_RANGE
)
8956 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8958 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8963 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8975 name
= &exp
->elts
[choice_pos
+ 2].string
;
8978 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8981 error (_("Invalid record component association."));
8983 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8985 if (! find_struct_field (name
, value_type (lhs
), 0,
8986 NULL
, NULL
, NULL
, NULL
, &ind
))
8987 error (_("Unknown component name: %s."), name
);
8988 lower
= upper
= ind
;
8991 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8992 error (_("Index in component association out of bounds."));
8994 add_component_interval (lower
, upper
, indices
, num_indices
,
8996 while (lower
<= upper
)
9001 assign_component (container
, lhs
, lower
, exp
, &pos1
);
9007 /* Assign the value of the expression in the OP_OTHERS construct in
9008 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
9009 have not been previously assigned. The index intervals already assigned
9010 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
9011 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
9013 aggregate_assign_others (struct value
*container
,
9014 struct value
*lhs
, struct expression
*exp
,
9015 int *pos
, LONGEST
*indices
, int num_indices
,
9016 LONGEST low
, LONGEST high
)
9019 int expr_pc
= *pos
+ 1;
9021 for (i
= 0; i
< num_indices
- 2; i
+= 2)
9025 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
9030 assign_component (container
, lhs
, ind
, exp
, &localpos
);
9033 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
9036 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
9037 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
9038 modifying *SIZE as needed. It is an error if *SIZE exceeds
9039 MAX_SIZE. The resulting intervals do not overlap. */
9041 add_component_interval (LONGEST low
, LONGEST high
,
9042 LONGEST
* indices
, int *size
, int max_size
)
9046 for (i
= 0; i
< *size
; i
+= 2) {
9047 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
9051 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
9052 if (high
< indices
[kh
])
9054 if (low
< indices
[i
])
9056 indices
[i
+ 1] = indices
[kh
- 1];
9057 if (high
> indices
[i
+ 1])
9058 indices
[i
+ 1] = high
;
9059 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
9060 *size
-= kh
- i
- 2;
9063 else if (high
< indices
[i
])
9067 if (*size
== max_size
)
9068 error (_("Internal error: miscounted aggregate components."));
9070 for (j
= *size
-1; j
>= i
+2; j
-= 1)
9071 indices
[j
] = indices
[j
- 2];
9073 indices
[i
+ 1] = high
;
9076 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
9079 static struct value
*
9080 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
9082 if (type
== ada_check_typedef (value_type (arg2
)))
9085 if (ada_is_fixed_point_type (type
))
9086 return (cast_to_fixed (type
, arg2
));
9088 if (ada_is_fixed_point_type (value_type (arg2
)))
9089 return cast_from_fixed (type
, arg2
);
9091 return value_cast (type
, arg2
);
9094 /* Evaluating Ada expressions, and printing their result.
9095 ------------------------------------------------------
9100 We usually evaluate an Ada expression in order to print its value.
9101 We also evaluate an expression in order to print its type, which
9102 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
9103 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
9104 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
9105 the evaluation compared to the EVAL_NORMAL, but is otherwise very
9108 Evaluating expressions is a little more complicated for Ada entities
9109 than it is for entities in languages such as C. The main reason for
9110 this is that Ada provides types whose definition might be dynamic.
9111 One example of such types is variant records. Or another example
9112 would be an array whose bounds can only be known at run time.
9114 The following description is a general guide as to what should be
9115 done (and what should NOT be done) in order to evaluate an expression
9116 involving such types, and when. This does not cover how the semantic
9117 information is encoded by GNAT as this is covered separatly. For the
9118 document used as the reference for the GNAT encoding, see exp_dbug.ads
9119 in the GNAT sources.
9121 Ideally, we should embed each part of this description next to its
9122 associated code. Unfortunately, the amount of code is so vast right
9123 now that it's hard to see whether the code handling a particular
9124 situation might be duplicated or not. One day, when the code is
9125 cleaned up, this guide might become redundant with the comments
9126 inserted in the code, and we might want to remove it.
9128 2. ``Fixing'' an Entity, the Simple Case:
9129 -----------------------------------------
9131 When evaluating Ada expressions, the tricky issue is that they may
9132 reference entities whose type contents and size are not statically
9133 known. Consider for instance a variant record:
9135 type Rec (Empty : Boolean := True) is record
9138 when False => Value : Integer;
9141 Yes : Rec := (Empty => False, Value => 1);
9142 No : Rec := (empty => True);
9144 The size and contents of that record depends on the value of the
9145 descriminant (Rec.Empty). At this point, neither the debugging
9146 information nor the associated type structure in GDB are able to
9147 express such dynamic types. So what the debugger does is to create
9148 "fixed" versions of the type that applies to the specific object.
9149 We also informally refer to this opperation as "fixing" an object,
9150 which means creating its associated fixed type.
9152 Example: when printing the value of variable "Yes" above, its fixed
9153 type would look like this:
9160 On the other hand, if we printed the value of "No", its fixed type
9167 Things become a little more complicated when trying to fix an entity
9168 with a dynamic type that directly contains another dynamic type,
9169 such as an array of variant records, for instance. There are
9170 two possible cases: Arrays, and records.
9172 3. ``Fixing'' Arrays:
9173 ---------------------
9175 The type structure in GDB describes an array in terms of its bounds,
9176 and the type of its elements. By design, all elements in the array
9177 have the same type and we cannot represent an array of variant elements
9178 using the current type structure in GDB. When fixing an array,
9179 we cannot fix the array element, as we would potentially need one
9180 fixed type per element of the array. As a result, the best we can do
9181 when fixing an array is to produce an array whose bounds and size
9182 are correct (allowing us to read it from memory), but without having
9183 touched its element type. Fixing each element will be done later,
9184 when (if) necessary.
9186 Arrays are a little simpler to handle than records, because the same
9187 amount of memory is allocated for each element of the array, even if
9188 the amount of space actually used by each element differs from element
9189 to element. Consider for instance the following array of type Rec:
9191 type Rec_Array is array (1 .. 2) of Rec;
9193 The actual amount of memory occupied by each element might be different
9194 from element to element, depending on the value of their discriminant.
9195 But the amount of space reserved for each element in the array remains
9196 fixed regardless. So we simply need to compute that size using
9197 the debugging information available, from which we can then determine
9198 the array size (we multiply the number of elements of the array by
9199 the size of each element).
9201 The simplest case is when we have an array of a constrained element
9202 type. For instance, consider the following type declarations:
9204 type Bounded_String (Max_Size : Integer) is
9206 Buffer : String (1 .. Max_Size);
9208 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9210 In this case, the compiler describes the array as an array of
9211 variable-size elements (identified by its XVS suffix) for which
9212 the size can be read in the parallel XVZ variable.
9214 In the case of an array of an unconstrained element type, the compiler
9215 wraps the array element inside a private PAD type. This type should not
9216 be shown to the user, and must be "unwrap"'ed before printing. Note
9217 that we also use the adjective "aligner" in our code to designate
9218 these wrapper types.
9220 In some cases, the size allocated for each element is statically
9221 known. In that case, the PAD type already has the correct size,
9222 and the array element should remain unfixed.
9224 But there are cases when this size is not statically known.
9225 For instance, assuming that "Five" is an integer variable:
9227 type Dynamic is array (1 .. Five) of Integer;
9228 type Wrapper (Has_Length : Boolean := False) is record
9231 when True => Length : Integer;
9235 type Wrapper_Array is array (1 .. 2) of Wrapper;
9237 Hello : Wrapper_Array := (others => (Has_Length => True,
9238 Data => (others => 17),
9242 The debugging info would describe variable Hello as being an
9243 array of a PAD type. The size of that PAD type is not statically
9244 known, but can be determined using a parallel XVZ variable.
9245 In that case, a copy of the PAD type with the correct size should
9246 be used for the fixed array.
9248 3. ``Fixing'' record type objects:
9249 ----------------------------------
9251 Things are slightly different from arrays in the case of dynamic
9252 record types. In this case, in order to compute the associated
9253 fixed type, we need to determine the size and offset of each of
9254 its components. This, in turn, requires us to compute the fixed
9255 type of each of these components.
9257 Consider for instance the example:
9259 type Bounded_String (Max_Size : Natural) is record
9260 Str : String (1 .. Max_Size);
9263 My_String : Bounded_String (Max_Size => 10);
9265 In that case, the position of field "Length" depends on the size
9266 of field Str, which itself depends on the value of the Max_Size
9267 discriminant. In order to fix the type of variable My_String,
9268 we need to fix the type of field Str. Therefore, fixing a variant
9269 record requires us to fix each of its components.
9271 However, if a component does not have a dynamic size, the component
9272 should not be fixed. In particular, fields that use a PAD type
9273 should not fixed. Here is an example where this might happen
9274 (assuming type Rec above):
9276 type Container (Big : Boolean) is record
9280 when True => Another : Integer;
9284 My_Container : Container := (Big => False,
9285 First => (Empty => True),
9288 In that example, the compiler creates a PAD type for component First,
9289 whose size is constant, and then positions the component After just
9290 right after it. The offset of component After is therefore constant
9293 The debugger computes the position of each field based on an algorithm
9294 that uses, among other things, the actual position and size of the field
9295 preceding it. Let's now imagine that the user is trying to print
9296 the value of My_Container. If the type fixing was recursive, we would
9297 end up computing the offset of field After based on the size of the
9298 fixed version of field First. And since in our example First has
9299 only one actual field, the size of the fixed type is actually smaller
9300 than the amount of space allocated to that field, and thus we would
9301 compute the wrong offset of field After.
9303 To make things more complicated, we need to watch out for dynamic
9304 components of variant records (identified by the ___XVL suffix in
9305 the component name). Even if the target type is a PAD type, the size
9306 of that type might not be statically known. So the PAD type needs
9307 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9308 we might end up with the wrong size for our component. This can be
9309 observed with the following type declarations:
9311 type Octal is new Integer range 0 .. 7;
9312 type Octal_Array is array (Positive range <>) of Octal;
9313 pragma Pack (Octal_Array);
9315 type Octal_Buffer (Size : Positive) is record
9316 Buffer : Octal_Array (1 .. Size);
9320 In that case, Buffer is a PAD type whose size is unset and needs
9321 to be computed by fixing the unwrapped type.
9323 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9324 ----------------------------------------------------------
9326 Lastly, when should the sub-elements of an entity that remained unfixed
9327 thus far, be actually fixed?
9329 The answer is: Only when referencing that element. For instance
9330 when selecting one component of a record, this specific component
9331 should be fixed at that point in time. Or when printing the value
9332 of a record, each component should be fixed before its value gets
9333 printed. Similarly for arrays, the element of the array should be
9334 fixed when printing each element of the array, or when extracting
9335 one element out of that array. On the other hand, fixing should
9336 not be performed on the elements when taking a slice of an array!
9338 Note that one of the side-effects of miscomputing the offset and
9339 size of each field is that we end up also miscomputing the size
9340 of the containing type. This can have adverse results when computing
9341 the value of an entity. GDB fetches the value of an entity based
9342 on the size of its type, and thus a wrong size causes GDB to fetch
9343 the wrong amount of memory. In the case where the computed size is
9344 too small, GDB fetches too little data to print the value of our
9345 entiry. Results in this case as unpredicatble, as we usually read
9346 past the buffer containing the data =:-o. */
9348 /* Implement the evaluate_exp routine in the exp_descriptor structure
9349 for the Ada language. */
9351 static struct value
*
9352 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9353 int *pos
, enum noside noside
)
9358 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9361 struct value
**argvec
;
9365 op
= exp
->elts
[pc
].opcode
;
9371 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9372 arg1
= unwrap_value (arg1
);
9374 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9375 then we need to perform the conversion manually, because
9376 evaluate_subexp_standard doesn't do it. This conversion is
9377 necessary in Ada because the different kinds of float/fixed
9378 types in Ada have different representations.
9380 Similarly, we need to perform the conversion from OP_LONG
9382 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9383 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9389 struct value
*result
;
9392 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9393 /* The result type will have code OP_STRING, bashed there from
9394 OP_ARRAY. Bash it back. */
9395 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9396 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9402 type
= exp
->elts
[pc
+ 1].type
;
9403 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9404 if (noside
== EVAL_SKIP
)
9406 arg1
= ada_value_cast (type
, arg1
, noside
);
9411 type
= exp
->elts
[pc
+ 1].type
;
9412 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9415 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9416 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9418 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9419 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9421 return ada_value_assign (arg1
, arg1
);
9423 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9424 except if the lhs of our assignment is a convenience variable.
9425 In the case of assigning to a convenience variable, the lhs
9426 should be exactly the result of the evaluation of the rhs. */
9427 type
= value_type (arg1
);
9428 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9430 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9431 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9433 if (ada_is_fixed_point_type (value_type (arg1
)))
9434 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9435 else if (ada_is_fixed_point_type (value_type (arg2
)))
9437 (_("Fixed-point values must be assigned to fixed-point variables"));
9439 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9440 return ada_value_assign (arg1
, arg2
);
9443 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9444 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9445 if (noside
== EVAL_SKIP
)
9447 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9448 return (value_from_longest
9450 value_as_long (arg1
) + value_as_long (arg2
)));
9451 if ((ada_is_fixed_point_type (value_type (arg1
))
9452 || ada_is_fixed_point_type (value_type (arg2
)))
9453 && value_type (arg1
) != value_type (arg2
))
9454 error (_("Operands of fixed-point addition must have the same type"));
9455 /* Do the addition, and cast the result to the type of the first
9456 argument. We cannot cast the result to a reference type, so if
9457 ARG1 is a reference type, find its underlying type. */
9458 type
= value_type (arg1
);
9459 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9460 type
= TYPE_TARGET_TYPE (type
);
9461 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9462 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
9465 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9466 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9467 if (noside
== EVAL_SKIP
)
9469 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9470 return (value_from_longest
9472 value_as_long (arg1
) - value_as_long (arg2
)));
9473 if ((ada_is_fixed_point_type (value_type (arg1
))
9474 || ada_is_fixed_point_type (value_type (arg2
)))
9475 && value_type (arg1
) != value_type (arg2
))
9476 error (_("Operands of fixed-point subtraction "
9477 "must have the same type"));
9478 /* Do the substraction, and cast the result to the type of the first
9479 argument. We cannot cast the result to a reference type, so if
9480 ARG1 is a reference type, find its underlying type. */
9481 type
= value_type (arg1
);
9482 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9483 type
= TYPE_TARGET_TYPE (type
);
9484 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9485 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
9491 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9492 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9493 if (noside
== EVAL_SKIP
)
9495 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9497 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9498 return value_zero (value_type (arg1
), not_lval
);
9502 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
9503 if (ada_is_fixed_point_type (value_type (arg1
)))
9504 arg1
= cast_from_fixed (type
, arg1
);
9505 if (ada_is_fixed_point_type (value_type (arg2
)))
9506 arg2
= cast_from_fixed (type
, arg2
);
9507 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9508 return ada_value_binop (arg1
, arg2
, op
);
9512 case BINOP_NOTEQUAL
:
9513 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9514 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
9515 if (noside
== EVAL_SKIP
)
9517 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9521 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9522 tem
= ada_value_equal (arg1
, arg2
);
9524 if (op
== BINOP_NOTEQUAL
)
9526 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9527 return value_from_longest (type
, (LONGEST
) tem
);
9530 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9531 if (noside
== EVAL_SKIP
)
9533 else if (ada_is_fixed_point_type (value_type (arg1
)))
9534 return value_cast (value_type (arg1
), value_neg (arg1
));
9537 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9538 return value_neg (arg1
);
9541 case BINOP_LOGICAL_AND
:
9542 case BINOP_LOGICAL_OR
:
9543 case UNOP_LOGICAL_NOT
:
9548 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9549 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9550 return value_cast (type
, val
);
9553 case BINOP_BITWISE_AND
:
9554 case BINOP_BITWISE_IOR
:
9555 case BINOP_BITWISE_XOR
:
9559 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9561 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9563 return value_cast (value_type (arg1
), val
);
9569 if (noside
== EVAL_SKIP
)
9574 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
9575 /* Only encountered when an unresolved symbol occurs in a
9576 context other than a function call, in which case, it is
9578 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9579 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
9580 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9582 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
9583 /* Check to see if this is a tagged type. We also need to handle
9584 the case where the type is a reference to a tagged type, but
9585 we have to be careful to exclude pointers to tagged types.
9586 The latter should be shown as usual (as a pointer), whereas
9587 a reference should mostly be transparent to the user. */
9588 if (ada_is_tagged_type (type
, 0)
9589 || (TYPE_CODE(type
) == TYPE_CODE_REF
9590 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
9592 /* Tagged types are a little special in the fact that the real
9593 type is dynamic and can only be determined by inspecting the
9594 object's tag. This means that we need to get the object's
9595 value first (EVAL_NORMAL) and then extract the actual object
9598 Note that we cannot skip the final step where we extract
9599 the object type from its tag, because the EVAL_NORMAL phase
9600 results in dynamic components being resolved into fixed ones.
9601 This can cause problems when trying to print the type
9602 description of tagged types whose parent has a dynamic size:
9603 We use the type name of the "_parent" component in order
9604 to print the name of the ancestor type in the type description.
9605 If that component had a dynamic size, the resolution into
9606 a fixed type would result in the loss of that type name,
9607 thus preventing us from printing the name of the ancestor
9608 type in the type description. */
9609 struct type
*actual_type
;
9611 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
9612 actual_type
= type_from_tag (ada_value_tag (arg1
));
9613 if (actual_type
== NULL
)
9614 /* If, for some reason, we were unable to determine
9615 the actual type from the tag, then use the static
9616 approximation that we just computed as a fallback.
9617 This can happen if the debugging information is
9618 incomplete, for instance. */
9621 return value_zero (actual_type
, not_lval
);
9626 (to_static_fixed_type
9627 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
9632 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9633 return ada_to_fixed_value (arg1
);
9639 /* Allocate arg vector, including space for the function to be
9640 called in argvec[0] and a terminating NULL. */
9641 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9643 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
9645 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
9646 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
9647 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9648 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
9651 for (tem
= 0; tem
<= nargs
; tem
+= 1)
9652 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9655 if (noside
== EVAL_SKIP
)
9659 if (ada_is_constrained_packed_array_type
9660 (desc_base_type (value_type (argvec
[0]))))
9661 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
9662 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9663 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
9664 /* This is a packed array that has already been fixed, and
9665 therefore already coerced to a simple array. Nothing further
9668 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
9669 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9670 && VALUE_LVAL (argvec
[0]) == lval_memory
))
9671 argvec
[0] = value_addr (argvec
[0]);
9673 type
= ada_check_typedef (value_type (argvec
[0]));
9675 /* Ada allows us to implicitly dereference arrays when subscripting
9676 them. So, if this is an array typedef (encoding use for array
9677 access types encoded as fat pointers), strip it now. */
9678 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
9679 type
= ada_typedef_target_type (type
);
9681 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
9683 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
9685 case TYPE_CODE_FUNC
:
9686 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9688 case TYPE_CODE_ARRAY
:
9690 case TYPE_CODE_STRUCT
:
9691 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
9692 argvec
[0] = ada_value_ind (argvec
[0]);
9693 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9696 error (_("cannot subscript or call something of type `%s'"),
9697 ada_type_name (value_type (argvec
[0])));
9702 switch (TYPE_CODE (type
))
9704 case TYPE_CODE_FUNC
:
9705 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9706 return allocate_value (TYPE_TARGET_TYPE (type
));
9707 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
9708 case TYPE_CODE_STRUCT
:
9712 arity
= ada_array_arity (type
);
9713 type
= ada_array_element_type (type
, nargs
);
9715 error (_("cannot subscript or call a record"));
9717 error (_("wrong number of subscripts; expecting %d"), arity
);
9718 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9719 return value_zero (ada_aligned_type (type
), lval_memory
);
9721 unwrap_value (ada_value_subscript
9722 (argvec
[0], nargs
, argvec
+ 1));
9724 case TYPE_CODE_ARRAY
:
9725 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9727 type
= ada_array_element_type (type
, nargs
);
9729 error (_("element type of array unknown"));
9731 return value_zero (ada_aligned_type (type
), lval_memory
);
9734 unwrap_value (ada_value_subscript
9735 (ada_coerce_to_simple_array (argvec
[0]),
9736 nargs
, argvec
+ 1));
9737 case TYPE_CODE_PTR
: /* Pointer to array */
9738 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9739 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9741 type
= ada_array_element_type (type
, nargs
);
9743 error (_("element type of array unknown"));
9745 return value_zero (ada_aligned_type (type
), lval_memory
);
9748 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9749 nargs
, argvec
+ 1));
9752 error (_("Attempt to index or call something other than an "
9753 "array or function"));
9758 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9759 struct value
*low_bound_val
=
9760 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9761 struct value
*high_bound_val
=
9762 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9766 low_bound_val
= coerce_ref (low_bound_val
);
9767 high_bound_val
= coerce_ref (high_bound_val
);
9768 low_bound
= pos_atr (low_bound_val
);
9769 high_bound
= pos_atr (high_bound_val
);
9771 if (noside
== EVAL_SKIP
)
9774 /* If this is a reference to an aligner type, then remove all
9776 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9777 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9778 TYPE_TARGET_TYPE (value_type (array
)) =
9779 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9781 if (ada_is_constrained_packed_array_type (value_type (array
)))
9782 error (_("cannot slice a packed array"));
9784 /* If this is a reference to an array or an array lvalue,
9785 convert to a pointer. */
9786 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9787 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9788 && VALUE_LVAL (array
) == lval_memory
))
9789 array
= value_addr (array
);
9791 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9792 && ada_is_array_descriptor_type (ada_check_typedef
9793 (value_type (array
))))
9794 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9796 array
= ada_coerce_to_simple_array_ptr (array
);
9798 /* If we have more than one level of pointer indirection,
9799 dereference the value until we get only one level. */
9800 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9801 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9803 array
= value_ind (array
);
9805 /* Make sure we really do have an array type before going further,
9806 to avoid a SEGV when trying to get the index type or the target
9807 type later down the road if the debug info generated by
9808 the compiler is incorrect or incomplete. */
9809 if (!ada_is_simple_array_type (value_type (array
)))
9810 error (_("cannot take slice of non-array"));
9812 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
9815 struct type
*type0
= ada_check_typedef (value_type (array
));
9817 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9818 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
9821 struct type
*arr_type0
=
9822 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
9824 return ada_value_slice_from_ptr (array
, arr_type0
,
9825 longest_to_int (low_bound
),
9826 longest_to_int (high_bound
));
9829 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9831 else if (high_bound
< low_bound
)
9832 return empty_array (value_type (array
), low_bound
);
9834 return ada_value_slice (array
, longest_to_int (low_bound
),
9835 longest_to_int (high_bound
));
9840 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9841 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9843 if (noside
== EVAL_SKIP
)
9846 switch (TYPE_CODE (type
))
9849 lim_warning (_("Membership test incompletely implemented; "
9850 "always returns true"));
9851 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9852 return value_from_longest (type
, (LONGEST
) 1);
9854 case TYPE_CODE_RANGE
:
9855 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9856 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9857 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9858 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9859 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9861 value_from_longest (type
,
9862 (value_less (arg1
, arg3
)
9863 || value_equal (arg1
, arg3
))
9864 && (value_less (arg2
, arg1
)
9865 || value_equal (arg2
, arg1
)));
9868 case BINOP_IN_BOUNDS
:
9870 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9871 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9873 if (noside
== EVAL_SKIP
)
9876 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9878 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9879 return value_zero (type
, not_lval
);
9882 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9884 type
= ada_index_type (value_type (arg2
), tem
, "range");
9886 type
= value_type (arg1
);
9888 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9889 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9891 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9892 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9893 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9895 value_from_longest (type
,
9896 (value_less (arg1
, arg3
)
9897 || value_equal (arg1
, arg3
))
9898 && (value_less (arg2
, arg1
)
9899 || value_equal (arg2
, arg1
)));
9901 case TERNOP_IN_RANGE
:
9902 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9903 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9904 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9906 if (noside
== EVAL_SKIP
)
9909 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9910 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9911 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9913 value_from_longest (type
,
9914 (value_less (arg1
, arg3
)
9915 || value_equal (arg1
, arg3
))
9916 && (value_less (arg2
, arg1
)
9917 || value_equal (arg2
, arg1
)));
9923 struct type
*type_arg
;
9925 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9927 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9929 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9933 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9937 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9938 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9939 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9942 if (noside
== EVAL_SKIP
)
9945 if (type_arg
== NULL
)
9947 arg1
= ada_coerce_ref (arg1
);
9949 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9950 arg1
= ada_coerce_to_simple_array (arg1
);
9952 type
= ada_index_type (value_type (arg1
), tem
,
9953 ada_attribute_name (op
));
9955 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9957 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9958 return allocate_value (type
);
9962 default: /* Should never happen. */
9963 error (_("unexpected attribute encountered"));
9965 return value_from_longest
9966 (type
, ada_array_bound (arg1
, tem
, 0));
9968 return value_from_longest
9969 (type
, ada_array_bound (arg1
, tem
, 1));
9971 return value_from_longest
9972 (type
, ada_array_length (arg1
, tem
));
9975 else if (discrete_type_p (type_arg
))
9977 struct type
*range_type
;
9978 const char *name
= ada_type_name (type_arg
);
9981 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9982 range_type
= to_fixed_range_type (type_arg
, NULL
);
9983 if (range_type
== NULL
)
9984 range_type
= type_arg
;
9988 error (_("unexpected attribute encountered"));
9990 return value_from_longest
9991 (range_type
, ada_discrete_type_low_bound (range_type
));
9993 return value_from_longest
9994 (range_type
, ada_discrete_type_high_bound (range_type
));
9996 error (_("the 'length attribute applies only to array types"));
9999 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
10000 error (_("unimplemented type attribute"));
10005 if (ada_is_constrained_packed_array_type (type_arg
))
10006 type_arg
= decode_constrained_packed_array_type (type_arg
);
10008 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
10010 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10012 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10013 return allocate_value (type
);
10018 error (_("unexpected attribute encountered"));
10020 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10021 return value_from_longest (type
, low
);
10023 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10024 return value_from_longest (type
, high
);
10025 case OP_ATR_LENGTH
:
10026 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
10027 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
10028 return value_from_longest (type
, high
- low
+ 1);
10034 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10035 if (noside
== EVAL_SKIP
)
10038 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10039 return value_zero (ada_tag_type (arg1
), not_lval
);
10041 return ada_value_tag (arg1
);
10045 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10046 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10047 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10048 if (noside
== EVAL_SKIP
)
10050 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10051 return value_zero (value_type (arg1
), not_lval
);
10054 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10055 return value_binop (arg1
, arg2
,
10056 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
10059 case OP_ATR_MODULUS
:
10061 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
10063 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10064 if (noside
== EVAL_SKIP
)
10067 if (!ada_is_modular_type (type_arg
))
10068 error (_("'modulus must be applied to modular type"));
10070 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
10071 ada_modulus (type_arg
));
10076 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10077 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10078 if (noside
== EVAL_SKIP
)
10080 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
10081 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10082 return value_zero (type
, not_lval
);
10084 return value_pos_atr (type
, arg1
);
10087 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10088 type
= value_type (arg1
);
10090 /* If the argument is a reference, then dereference its type, since
10091 the user is really asking for the size of the actual object,
10092 not the size of the pointer. */
10093 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
10094 type
= TYPE_TARGET_TYPE (type
);
10096 if (noside
== EVAL_SKIP
)
10098 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10099 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
10101 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
10102 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
10105 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
10106 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10107 type
= exp
->elts
[pc
+ 2].type
;
10108 if (noside
== EVAL_SKIP
)
10110 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10111 return value_zero (type
, not_lval
);
10113 return value_val_atr (type
, arg1
);
10116 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10117 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10118 if (noside
== EVAL_SKIP
)
10120 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10121 return value_zero (value_type (arg1
), not_lval
);
10124 /* For integer exponentiation operations,
10125 only promote the first argument. */
10126 if (is_integral_type (value_type (arg2
)))
10127 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10129 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10131 return value_binop (arg1
, arg2
, op
);
10135 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10136 if (noside
== EVAL_SKIP
)
10142 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10143 if (noside
== EVAL_SKIP
)
10145 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10146 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10147 return value_neg (arg1
);
10152 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10153 if (noside
== EVAL_SKIP
)
10155 type
= ada_check_typedef (value_type (arg1
));
10156 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10158 if (ada_is_array_descriptor_type (type
))
10159 /* GDB allows dereferencing GNAT array descriptors. */
10161 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10163 if (arrType
== NULL
)
10164 error (_("Attempt to dereference null array pointer."));
10165 return value_at_lazy (arrType
, 0);
10167 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10168 || TYPE_CODE (type
) == TYPE_CODE_REF
10169 /* In C you can dereference an array to get the 1st elt. */
10170 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10172 type
= to_static_fixed_type
10174 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10176 return value_zero (type
, lval_memory
);
10178 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10180 /* GDB allows dereferencing an int. */
10181 if (expect_type
== NULL
)
10182 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10187 to_static_fixed_type (ada_aligned_type (expect_type
));
10188 return value_zero (expect_type
, lval_memory
);
10192 error (_("Attempt to take contents of a non-pointer value."));
10194 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10195 type
= ada_check_typedef (value_type (arg1
));
10197 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10198 /* GDB allows dereferencing an int. If we were given
10199 the expect_type, then use that as the target type.
10200 Otherwise, assume that the target type is an int. */
10202 if (expect_type
!= NULL
)
10203 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10206 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10207 (CORE_ADDR
) value_as_address (arg1
));
10210 if (ada_is_array_descriptor_type (type
))
10211 /* GDB allows dereferencing GNAT array descriptors. */
10212 return ada_coerce_to_simple_array (arg1
);
10214 return ada_value_ind (arg1
);
10216 case STRUCTOP_STRUCT
:
10217 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10218 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10219 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10220 if (noside
== EVAL_SKIP
)
10222 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10224 struct type
*type1
= value_type (arg1
);
10226 if (ada_is_tagged_type (type1
, 1))
10228 type
= ada_lookup_struct_elt_type (type1
,
10229 &exp
->elts
[pc
+ 2].string
,
10232 /* In this case, we assume that the field COULD exist
10233 in some extension of the type. Return an object of
10234 "type" void, which will match any formal
10235 (see ada_type_match). */
10236 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
10241 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10244 return value_zero (ada_aligned_type (type
), lval_memory
);
10247 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10248 arg1
= unwrap_value (arg1
);
10249 return ada_to_fixed_value (arg1
);
10252 /* The value is not supposed to be used. This is here to make it
10253 easier to accommodate expressions that contain types. */
10255 if (noside
== EVAL_SKIP
)
10257 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10258 return allocate_value (exp
->elts
[pc
+ 1].type
);
10260 error (_("Attempt to use a type name as an expression"));
10265 case OP_DISCRETE_RANGE
:
10266 case OP_POSITIONAL
:
10268 if (noside
== EVAL_NORMAL
)
10272 error (_("Undefined name, ambiguous name, or renaming used in "
10273 "component association: %s."), &exp
->elts
[pc
+2].string
);
10275 error (_("Aggregates only allowed on the right of an assignment"));
10277 internal_error (__FILE__
, __LINE__
,
10278 _("aggregate apparently mangled"));
10281 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10283 for (tem
= 0; tem
< nargs
; tem
+= 1)
10284 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10289 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10295 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10296 type name that encodes the 'small and 'delta information.
10297 Otherwise, return NULL. */
10299 static const char *
10300 fixed_type_info (struct type
*type
)
10302 const char *name
= ada_type_name (type
);
10303 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10305 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10307 const char *tail
= strstr (name
, "___XF_");
10314 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10315 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10320 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10323 ada_is_fixed_point_type (struct type
*type
)
10325 return fixed_type_info (type
) != NULL
;
10328 /* Return non-zero iff TYPE represents a System.Address type. */
10331 ada_is_system_address_type (struct type
*type
)
10333 return (TYPE_NAME (type
)
10334 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10337 /* Assuming that TYPE is the representation of an Ada fixed-point
10338 type, return its delta, or -1 if the type is malformed and the
10339 delta cannot be determined. */
10342 ada_delta (struct type
*type
)
10344 const char *encoding
= fixed_type_info (type
);
10347 /* Strictly speaking, num and den are encoded as integer. However,
10348 they may not fit into a long, and they will have to be converted
10349 to DOUBLEST anyway. So scan them as DOUBLEST. */
10350 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10357 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10358 factor ('SMALL value) associated with the type. */
10361 scaling_factor (struct type
*type
)
10363 const char *encoding
= fixed_type_info (type
);
10364 DOUBLEST num0
, den0
, num1
, den1
;
10367 /* Strictly speaking, num's and den's are encoded as integer. However,
10368 they may not fit into a long, and they will have to be converted
10369 to DOUBLEST anyway. So scan them as DOUBLEST. */
10370 n
= sscanf (encoding
,
10371 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10372 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10373 &num0
, &den0
, &num1
, &den1
);
10378 return num1
/ den1
;
10380 return num0
/ den0
;
10384 /* Assuming that X is the representation of a value of fixed-point
10385 type TYPE, return its floating-point equivalent. */
10388 ada_fixed_to_float (struct type
*type
, LONGEST x
)
10390 return (DOUBLEST
) x
*scaling_factor (type
);
10393 /* The representation of a fixed-point value of type TYPE
10394 corresponding to the value X. */
10397 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
10399 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
10406 /* Scan STR beginning at position K for a discriminant name, and
10407 return the value of that discriminant field of DVAL in *PX. If
10408 PNEW_K is not null, put the position of the character beyond the
10409 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10410 not alter *PX and *PNEW_K if unsuccessful. */
10413 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
10416 static char *bound_buffer
= NULL
;
10417 static size_t bound_buffer_len
= 0;
10420 struct value
*bound_val
;
10422 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
10425 pend
= strstr (str
+ k
, "__");
10429 k
+= strlen (bound
);
10433 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
10434 bound
= bound_buffer
;
10435 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
10436 bound
[pend
- (str
+ k
)] = '\0';
10440 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
10441 if (bound_val
== NULL
)
10444 *px
= value_as_long (bound_val
);
10445 if (pnew_k
!= NULL
)
10450 /* Value of variable named NAME in the current environment. If
10451 no such variable found, then if ERR_MSG is null, returns 0, and
10452 otherwise causes an error with message ERR_MSG. */
10454 static struct value
*
10455 get_var_value (char *name
, char *err_msg
)
10457 struct ada_symbol_info
*syms
;
10460 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
10465 if (err_msg
== NULL
)
10468 error (("%s"), err_msg
);
10471 return value_of_variable (syms
[0].sym
, syms
[0].block
);
10474 /* Value of integer variable named NAME in the current environment. If
10475 no such variable found, returns 0, and sets *FLAG to 0. If
10476 successful, sets *FLAG to 1. */
10479 get_int_var_value (char *name
, int *flag
)
10481 struct value
*var_val
= get_var_value (name
, 0);
10493 return value_as_long (var_val
);
10498 /* Return a range type whose base type is that of the range type named
10499 NAME in the current environment, and whose bounds are calculated
10500 from NAME according to the GNAT range encoding conventions.
10501 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10502 corresponding range type from debug information; fall back to using it
10503 if symbol lookup fails. If a new type must be created, allocate it
10504 like ORIG_TYPE was. The bounds information, in general, is encoded
10505 in NAME, the base type given in the named range type. */
10507 static struct type
*
10508 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
10511 struct type
*base_type
;
10512 char *subtype_info
;
10514 gdb_assert (raw_type
!= NULL
);
10515 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
10517 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
10518 base_type
= TYPE_TARGET_TYPE (raw_type
);
10520 base_type
= raw_type
;
10522 name
= TYPE_NAME (raw_type
);
10523 subtype_info
= strstr (name
, "___XD");
10524 if (subtype_info
== NULL
)
10526 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
10527 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
10529 if (L
< INT_MIN
|| U
> INT_MAX
)
10532 return create_range_type (alloc_type_copy (raw_type
), raw_type
,
10533 ada_discrete_type_low_bound (raw_type
),
10534 ada_discrete_type_high_bound (raw_type
));
10538 static char *name_buf
= NULL
;
10539 static size_t name_len
= 0;
10540 int prefix_len
= subtype_info
- name
;
10546 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
10547 strncpy (name_buf
, name
, prefix_len
);
10548 name_buf
[prefix_len
] = '\0';
10551 bounds_str
= strchr (subtype_info
, '_');
10554 if (*subtype_info
== 'L')
10556 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
10557 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
10559 if (bounds_str
[n
] == '_')
10561 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
10569 strcpy (name_buf
+ prefix_len
, "___L");
10570 L
= get_int_var_value (name_buf
, &ok
);
10573 lim_warning (_("Unknown lower bound, using 1."));
10578 if (*subtype_info
== 'U')
10580 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
10581 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
10588 strcpy (name_buf
+ prefix_len
, "___U");
10589 U
= get_int_var_value (name_buf
, &ok
);
10592 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
10597 type
= create_range_type (alloc_type_copy (raw_type
), base_type
, L
, U
);
10598 TYPE_NAME (type
) = name
;
10603 /* True iff NAME is the name of a range type. */
10606 ada_is_range_type_name (const char *name
)
10608 return (name
!= NULL
&& strstr (name
, "___XD"));
10612 /* Modular types */
10614 /* True iff TYPE is an Ada modular type. */
10617 ada_is_modular_type (struct type
*type
)
10619 struct type
*subranged_type
= get_base_type (type
);
10621 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
10622 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
10623 && TYPE_UNSIGNED (subranged_type
));
10626 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10629 ada_modulus (struct type
*type
)
10631 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
10635 /* Ada exception catchpoint support:
10636 ---------------------------------
10638 We support 3 kinds of exception catchpoints:
10639 . catchpoints on Ada exceptions
10640 . catchpoints on unhandled Ada exceptions
10641 . catchpoints on failed assertions
10643 Exceptions raised during failed assertions, or unhandled exceptions
10644 could perfectly be caught with the general catchpoint on Ada exceptions.
10645 However, we can easily differentiate these two special cases, and having
10646 the option to distinguish these two cases from the rest can be useful
10647 to zero-in on certain situations.
10649 Exception catchpoints are a specialized form of breakpoint,
10650 since they rely on inserting breakpoints inside known routines
10651 of the GNAT runtime. The implementation therefore uses a standard
10652 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10655 Support in the runtime for exception catchpoints have been changed
10656 a few times already, and these changes affect the implementation
10657 of these catchpoints. In order to be able to support several
10658 variants of the runtime, we use a sniffer that will determine
10659 the runtime variant used by the program being debugged. */
10661 /* The different types of catchpoints that we introduced for catching
10664 enum exception_catchpoint_kind
10666 ex_catch_exception
,
10667 ex_catch_exception_unhandled
,
10671 /* Ada's standard exceptions. */
10673 static char *standard_exc
[] = {
10674 "constraint_error",
10680 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10682 /* A structure that describes how to support exception catchpoints
10683 for a given executable. */
10685 struct exception_support_info
10687 /* The name of the symbol to break on in order to insert
10688 a catchpoint on exceptions. */
10689 const char *catch_exception_sym
;
10691 /* The name of the symbol to break on in order to insert
10692 a catchpoint on unhandled exceptions. */
10693 const char *catch_exception_unhandled_sym
;
10695 /* The name of the symbol to break on in order to insert
10696 a catchpoint on failed assertions. */
10697 const char *catch_assert_sym
;
10699 /* Assuming that the inferior just triggered an unhandled exception
10700 catchpoint, this function is responsible for returning the address
10701 in inferior memory where the name of that exception is stored.
10702 Return zero if the address could not be computed. */
10703 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10706 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10707 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10709 /* The following exception support info structure describes how to
10710 implement exception catchpoints with the latest version of the
10711 Ada runtime (as of 2007-03-06). */
10713 static const struct exception_support_info default_exception_support_info
=
10715 "__gnat_debug_raise_exception", /* catch_exception_sym */
10716 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10717 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10718 ada_unhandled_exception_name_addr
10721 /* The following exception support info structure describes how to
10722 implement exception catchpoints with a slightly older version
10723 of the Ada runtime. */
10725 static const struct exception_support_info exception_support_info_fallback
=
10727 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10728 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10729 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10730 ada_unhandled_exception_name_addr_from_raise
10733 /* Return nonzero if we can detect the exception support routines
10734 described in EINFO.
10736 This function errors out if an abnormal situation is detected
10737 (for instance, if we find the exception support routines, but
10738 that support is found to be incomplete). */
10741 ada_has_this_exception_support (const struct exception_support_info
*einfo
)
10743 struct symbol
*sym
;
10745 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10746 that should be compiled with debugging information. As a result, we
10747 expect to find that symbol in the symtabs. */
10749 sym
= standard_lookup (einfo
->catch_exception_sym
, NULL
, VAR_DOMAIN
);
10752 /* Perhaps we did not find our symbol because the Ada runtime was
10753 compiled without debugging info, or simply stripped of it.
10754 It happens on some GNU/Linux distributions for instance, where
10755 users have to install a separate debug package in order to get
10756 the runtime's debugging info. In that situation, let the user
10757 know why we cannot insert an Ada exception catchpoint.
10759 Note: Just for the purpose of inserting our Ada exception
10760 catchpoint, we could rely purely on the associated minimal symbol.
10761 But we would be operating in degraded mode anyway, since we are
10762 still lacking the debugging info needed later on to extract
10763 the name of the exception being raised (this name is printed in
10764 the catchpoint message, and is also used when trying to catch
10765 a specific exception). We do not handle this case for now. */
10766 if (lookup_minimal_symbol (einfo
->catch_exception_sym
, NULL
, NULL
))
10767 error (_("Your Ada runtime appears to be missing some debugging "
10768 "information.\nCannot insert Ada exception catchpoint "
10769 "in this configuration."));
10774 /* Make sure that the symbol we found corresponds to a function. */
10776 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10777 error (_("Symbol \"%s\" is not a function (class = %d)"),
10778 SYMBOL_LINKAGE_NAME (sym
), SYMBOL_CLASS (sym
));
10783 /* Inspect the Ada runtime and determine which exception info structure
10784 should be used to provide support for exception catchpoints.
10786 This function will always set the per-inferior exception_info,
10787 or raise an error. */
10790 ada_exception_support_info_sniffer (void)
10792 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
10793 struct symbol
*sym
;
10795 /* If the exception info is already known, then no need to recompute it. */
10796 if (data
->exception_info
!= NULL
)
10799 /* Check the latest (default) exception support info. */
10800 if (ada_has_this_exception_support (&default_exception_support_info
))
10802 data
->exception_info
= &default_exception_support_info
;
10806 /* Try our fallback exception suport info. */
10807 if (ada_has_this_exception_support (&exception_support_info_fallback
))
10809 data
->exception_info
= &exception_support_info_fallback
;
10813 /* Sometimes, it is normal for us to not be able to find the routine
10814 we are looking for. This happens when the program is linked with
10815 the shared version of the GNAT runtime, and the program has not been
10816 started yet. Inform the user of these two possible causes if
10819 if (ada_update_initial_language (language_unknown
) != language_ada
)
10820 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10822 /* If the symbol does not exist, then check that the program is
10823 already started, to make sure that shared libraries have been
10824 loaded. If it is not started, this may mean that the symbol is
10825 in a shared library. */
10827 if (ptid_get_pid (inferior_ptid
) == 0)
10828 error (_("Unable to insert catchpoint. Try to start the program first."));
10830 /* At this point, we know that we are debugging an Ada program and
10831 that the inferior has been started, but we still are not able to
10832 find the run-time symbols. That can mean that we are in
10833 configurable run time mode, or that a-except as been optimized
10834 out by the linker... In any case, at this point it is not worth
10835 supporting this feature. */
10837 error (_("Cannot insert Ada exception catchpoints in this configuration."));
10840 /* True iff FRAME is very likely to be that of a function that is
10841 part of the runtime system. This is all very heuristic, but is
10842 intended to be used as advice as to what frames are uninteresting
10846 is_known_support_routine (struct frame_info
*frame
)
10848 struct symtab_and_line sal
;
10849 const char *func_name
;
10850 enum language func_lang
;
10853 /* If this code does not have any debugging information (no symtab),
10854 This cannot be any user code. */
10856 find_frame_sal (frame
, &sal
);
10857 if (sal
.symtab
== NULL
)
10860 /* If there is a symtab, but the associated source file cannot be
10861 located, then assume this is not user code: Selecting a frame
10862 for which we cannot display the code would not be very helpful
10863 for the user. This should also take care of case such as VxWorks
10864 where the kernel has some debugging info provided for a few units. */
10866 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10869 /* Check the unit filename againt the Ada runtime file naming.
10870 We also check the name of the objfile against the name of some
10871 known system libraries that sometimes come with debugging info
10874 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10876 re_comp (known_runtime_file_name_patterns
[i
]);
10877 if (re_exec (sal
.symtab
->filename
))
10879 if (sal
.symtab
->objfile
!= NULL
10880 && re_exec (sal
.symtab
->objfile
->name
))
10884 /* Check whether the function is a GNAT-generated entity. */
10886 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
10887 if (func_name
== NULL
)
10890 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10892 re_comp (known_auxiliary_function_name_patterns
[i
]);
10893 if (re_exec (func_name
))
10900 /* Find the first frame that contains debugging information and that is not
10901 part of the Ada run-time, starting from FI and moving upward. */
10904 ada_find_printable_frame (struct frame_info
*fi
)
10906 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10908 if (!is_known_support_routine (fi
))
10917 /* Assuming that the inferior just triggered an unhandled exception
10918 catchpoint, return the address in inferior memory where the name
10919 of the exception is stored.
10921 Return zero if the address could not be computed. */
10924 ada_unhandled_exception_name_addr (void)
10926 return parse_and_eval_address ("e.full_name");
10929 /* Same as ada_unhandled_exception_name_addr, except that this function
10930 should be used when the inferior uses an older version of the runtime,
10931 where the exception name needs to be extracted from a specific frame
10932 several frames up in the callstack. */
10935 ada_unhandled_exception_name_addr_from_raise (void)
10938 struct frame_info
*fi
;
10939 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
10941 /* To determine the name of this exception, we need to select
10942 the frame corresponding to RAISE_SYM_NAME. This frame is
10943 at least 3 levels up, so we simply skip the first 3 frames
10944 without checking the name of their associated function. */
10945 fi
= get_current_frame ();
10946 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10948 fi
= get_prev_frame (fi
);
10952 const char *func_name
;
10953 enum language func_lang
;
10955 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
10956 if (func_name
!= NULL
10957 && strcmp (func_name
, data
->exception_info
->catch_exception_sym
) == 0)
10958 break; /* We found the frame we were looking for... */
10959 fi
= get_prev_frame (fi
);
10966 return parse_and_eval_address ("id.full_name");
10969 /* Assuming the inferior just triggered an Ada exception catchpoint
10970 (of any type), return the address in inferior memory where the name
10971 of the exception is stored, if applicable.
10973 Return zero if the address could not be computed, or if not relevant. */
10976 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10977 struct breakpoint
*b
)
10979 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
10983 case ex_catch_exception
:
10984 return (parse_and_eval_address ("e.full_name"));
10987 case ex_catch_exception_unhandled
:
10988 return data
->exception_info
->unhandled_exception_name_addr ();
10991 case ex_catch_assert
:
10992 return 0; /* Exception name is not relevant in this case. */
10996 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11000 return 0; /* Should never be reached. */
11003 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
11004 any error that ada_exception_name_addr_1 might cause to be thrown.
11005 When an error is intercepted, a warning with the error message is printed,
11006 and zero is returned. */
11009 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
11010 struct breakpoint
*b
)
11012 volatile struct gdb_exception e
;
11013 CORE_ADDR result
= 0;
11015 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11017 result
= ada_exception_name_addr_1 (ex
, b
);
11022 warning (_("failed to get exception name: %s"), e
.message
);
11029 static struct symtab_and_line
ada_exception_sal (enum exception_catchpoint_kind
,
11031 const struct breakpoint_ops
**);
11032 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
11034 /* Ada catchpoints.
11036 In the case of catchpoints on Ada exceptions, the catchpoint will
11037 stop the target on every exception the program throws. When a user
11038 specifies the name of a specific exception, we translate this
11039 request into a condition expression (in text form), and then parse
11040 it into an expression stored in each of the catchpoint's locations.
11041 We then use this condition to check whether the exception that was
11042 raised is the one the user is interested in. If not, then the
11043 target is resumed again. We store the name of the requested
11044 exception, in order to be able to re-set the condition expression
11045 when symbols change. */
11047 /* An instance of this type is used to represent an Ada catchpoint
11048 breakpoint location. It includes a "struct bp_location" as a kind
11049 of base class; users downcast to "struct bp_location *" when
11052 struct ada_catchpoint_location
11054 /* The base class. */
11055 struct bp_location base
;
11057 /* The condition that checks whether the exception that was raised
11058 is the specific exception the user specified on catchpoint
11060 struct expression
*excep_cond_expr
;
11063 /* Implement the DTOR method in the bp_location_ops structure for all
11064 Ada exception catchpoint kinds. */
11067 ada_catchpoint_location_dtor (struct bp_location
*bl
)
11069 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
11071 xfree (al
->excep_cond_expr
);
11074 /* The vtable to be used in Ada catchpoint locations. */
11076 static const struct bp_location_ops ada_catchpoint_location_ops
=
11078 ada_catchpoint_location_dtor
11081 /* An instance of this type is used to represent an Ada catchpoint.
11082 It includes a "struct breakpoint" as a kind of base class; users
11083 downcast to "struct breakpoint *" when needed. */
11085 struct ada_catchpoint
11087 /* The base class. */
11088 struct breakpoint base
;
11090 /* The name of the specific exception the user specified. */
11091 char *excep_string
;
11094 /* Parse the exception condition string in the context of each of the
11095 catchpoint's locations, and store them for later evaluation. */
11098 create_excep_cond_exprs (struct ada_catchpoint
*c
)
11100 struct cleanup
*old_chain
;
11101 struct bp_location
*bl
;
11104 /* Nothing to do if there's no specific exception to catch. */
11105 if (c
->excep_string
== NULL
)
11108 /* Same if there are no locations... */
11109 if (c
->base
.loc
== NULL
)
11112 /* Compute the condition expression in text form, from the specific
11113 expection we want to catch. */
11114 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
11115 old_chain
= make_cleanup (xfree
, cond_string
);
11117 /* Iterate over all the catchpoint's locations, and parse an
11118 expression for each. */
11119 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
11121 struct ada_catchpoint_location
*ada_loc
11122 = (struct ada_catchpoint_location
*) bl
;
11123 struct expression
*exp
= NULL
;
11125 if (!bl
->shlib_disabled
)
11127 volatile struct gdb_exception e
;
11131 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11133 exp
= parse_exp_1 (&s
, block_for_pc (bl
->address
), 0);
11136 warning (_("failed to reevaluate internal exception condition "
11137 "for catchpoint %d: %s"),
11138 c
->base
.number
, e
.message
);
11141 ada_loc
->excep_cond_expr
= exp
;
11144 do_cleanups (old_chain
);
11147 /* Implement the DTOR method in the breakpoint_ops structure for all
11148 exception catchpoint kinds. */
11151 dtor_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
11153 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11155 xfree (c
->excep_string
);
11157 bkpt_breakpoint_ops
.dtor (b
);
11160 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11161 structure for all exception catchpoint kinds. */
11163 static struct bp_location
*
11164 allocate_location_exception (enum exception_catchpoint_kind ex
,
11165 struct breakpoint
*self
)
11167 struct ada_catchpoint_location
*loc
;
11169 loc
= XNEW (struct ada_catchpoint_location
);
11170 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11171 loc
->excep_cond_expr
= NULL
;
11175 /* Implement the RE_SET method in the breakpoint_ops structure for all
11176 exception catchpoint kinds. */
11179 re_set_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
11181 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11183 /* Call the base class's method. This updates the catchpoint's
11185 bkpt_breakpoint_ops
.re_set (b
);
11187 /* Reparse the exception conditional expressions. One for each
11189 create_excep_cond_exprs (c
);
11192 /* Returns true if we should stop for this breakpoint hit. If the
11193 user specified a specific exception, we only want to cause a stop
11194 if the program thrown that exception. */
11197 should_stop_exception (const struct bp_location
*bl
)
11199 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11200 const struct ada_catchpoint_location
*ada_loc
11201 = (const struct ada_catchpoint_location
*) bl
;
11202 volatile struct gdb_exception ex
;
11205 /* With no specific exception, should always stop. */
11206 if (c
->excep_string
== NULL
)
11209 if (ada_loc
->excep_cond_expr
== NULL
)
11211 /* We will have a NULL expression if back when we were creating
11212 the expressions, this location's had failed to parse. */
11217 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11219 struct value
*mark
;
11221 mark
= value_mark ();
11222 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11223 value_free_to_mark (mark
);
11226 exception_fprintf (gdb_stderr
, ex
,
11227 _("Error in testing exception condition:\n"));
11231 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11232 for all exception catchpoint kinds. */
11235 check_status_exception (enum exception_catchpoint_kind ex
, bpstat bs
)
11237 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11240 /* Implement the PRINT_IT method in the breakpoint_ops structure
11241 for all exception catchpoint kinds. */
11243 static enum print_stop_action
11244 print_it_exception (enum exception_catchpoint_kind ex
, bpstat bs
)
11246 struct ui_out
*uiout
= current_uiout
;
11247 struct breakpoint
*b
= bs
->breakpoint_at
;
11249 annotate_catchpoint (b
->number
);
11251 if (ui_out_is_mi_like_p (uiout
))
11253 ui_out_field_string (uiout
, "reason",
11254 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11255 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11258 ui_out_text (uiout
,
11259 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11260 : "\nCatchpoint ");
11261 ui_out_field_int (uiout
, "bkptno", b
->number
);
11262 ui_out_text (uiout
, ", ");
11266 case ex_catch_exception
:
11267 case ex_catch_exception_unhandled
:
11269 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11270 char exception_name
[256];
11274 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
11275 exception_name
[sizeof (exception_name
) - 1] = '\0';
11279 /* For some reason, we were unable to read the exception
11280 name. This could happen if the Runtime was compiled
11281 without debugging info, for instance. In that case,
11282 just replace the exception name by the generic string
11283 "exception" - it will read as "an exception" in the
11284 notification we are about to print. */
11285 memcpy (exception_name
, "exception", sizeof ("exception"));
11287 /* In the case of unhandled exception breakpoints, we print
11288 the exception name as "unhandled EXCEPTION_NAME", to make
11289 it clearer to the user which kind of catchpoint just got
11290 hit. We used ui_out_text to make sure that this extra
11291 info does not pollute the exception name in the MI case. */
11292 if (ex
== ex_catch_exception_unhandled
)
11293 ui_out_text (uiout
, "unhandled ");
11294 ui_out_field_string (uiout
, "exception-name", exception_name
);
11297 case ex_catch_assert
:
11298 /* In this case, the name of the exception is not really
11299 important. Just print "failed assertion" to make it clearer
11300 that his program just hit an assertion-failure catchpoint.
11301 We used ui_out_text because this info does not belong in
11303 ui_out_text (uiout
, "failed assertion");
11306 ui_out_text (uiout
, " at ");
11307 ada_find_printable_frame (get_current_frame ());
11309 return PRINT_SRC_AND_LOC
;
11312 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11313 for all exception catchpoint kinds. */
11316 print_one_exception (enum exception_catchpoint_kind ex
,
11317 struct breakpoint
*b
, struct bp_location
**last_loc
)
11319 struct ui_out
*uiout
= current_uiout
;
11320 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11321 struct value_print_options opts
;
11323 get_user_print_options (&opts
);
11324 if (opts
.addressprint
)
11326 annotate_field (4);
11327 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11330 annotate_field (5);
11331 *last_loc
= b
->loc
;
11334 case ex_catch_exception
:
11335 if (c
->excep_string
!= NULL
)
11337 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11339 ui_out_field_string (uiout
, "what", msg
);
11343 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11347 case ex_catch_exception_unhandled
:
11348 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
11351 case ex_catch_assert
:
11352 ui_out_field_string (uiout
, "what", "failed Ada assertions");
11356 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11361 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11362 for all exception catchpoint kinds. */
11365 print_mention_exception (enum exception_catchpoint_kind ex
,
11366 struct breakpoint
*b
)
11368 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11369 struct ui_out
*uiout
= current_uiout
;
11371 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
11372 : _("Catchpoint "));
11373 ui_out_field_int (uiout
, "bkptno", b
->number
);
11374 ui_out_text (uiout
, ": ");
11378 case ex_catch_exception
:
11379 if (c
->excep_string
!= NULL
)
11381 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11382 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
11384 ui_out_text (uiout
, info
);
11385 do_cleanups (old_chain
);
11388 ui_out_text (uiout
, _("all Ada exceptions"));
11391 case ex_catch_exception_unhandled
:
11392 ui_out_text (uiout
, _("unhandled Ada exceptions"));
11395 case ex_catch_assert
:
11396 ui_out_text (uiout
, _("failed Ada assertions"));
11400 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11405 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11406 for all exception catchpoint kinds. */
11409 print_recreate_exception (enum exception_catchpoint_kind ex
,
11410 struct breakpoint
*b
, struct ui_file
*fp
)
11412 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11416 case ex_catch_exception
:
11417 fprintf_filtered (fp
, "catch exception");
11418 if (c
->excep_string
!= NULL
)
11419 fprintf_filtered (fp
, " %s", c
->excep_string
);
11422 case ex_catch_exception_unhandled
:
11423 fprintf_filtered (fp
, "catch exception unhandled");
11426 case ex_catch_assert
:
11427 fprintf_filtered (fp
, "catch assert");
11431 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11433 print_recreate_thread (b
, fp
);
11436 /* Virtual table for "catch exception" breakpoints. */
11439 dtor_catch_exception (struct breakpoint
*b
)
11441 dtor_exception (ex_catch_exception
, b
);
11444 static struct bp_location
*
11445 allocate_location_catch_exception (struct breakpoint
*self
)
11447 return allocate_location_exception (ex_catch_exception
, self
);
11451 re_set_catch_exception (struct breakpoint
*b
)
11453 re_set_exception (ex_catch_exception
, b
);
11457 check_status_catch_exception (bpstat bs
)
11459 check_status_exception (ex_catch_exception
, bs
);
11462 static enum print_stop_action
11463 print_it_catch_exception (bpstat bs
)
11465 return print_it_exception (ex_catch_exception
, bs
);
11469 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
11471 print_one_exception (ex_catch_exception
, b
, last_loc
);
11475 print_mention_catch_exception (struct breakpoint
*b
)
11477 print_mention_exception (ex_catch_exception
, b
);
11481 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
11483 print_recreate_exception (ex_catch_exception
, b
, fp
);
11486 static struct breakpoint_ops catch_exception_breakpoint_ops
;
11488 /* Virtual table for "catch exception unhandled" breakpoints. */
11491 dtor_catch_exception_unhandled (struct breakpoint
*b
)
11493 dtor_exception (ex_catch_exception_unhandled
, b
);
11496 static struct bp_location
*
11497 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
11499 return allocate_location_exception (ex_catch_exception_unhandled
, self
);
11503 re_set_catch_exception_unhandled (struct breakpoint
*b
)
11505 re_set_exception (ex_catch_exception_unhandled
, b
);
11509 check_status_catch_exception_unhandled (bpstat bs
)
11511 check_status_exception (ex_catch_exception_unhandled
, bs
);
11514 static enum print_stop_action
11515 print_it_catch_exception_unhandled (bpstat bs
)
11517 return print_it_exception (ex_catch_exception_unhandled
, bs
);
11521 print_one_catch_exception_unhandled (struct breakpoint
*b
,
11522 struct bp_location
**last_loc
)
11524 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
11528 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
11530 print_mention_exception (ex_catch_exception_unhandled
, b
);
11534 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
11535 struct ui_file
*fp
)
11537 print_recreate_exception (ex_catch_exception_unhandled
, b
, fp
);
11540 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
11542 /* Virtual table for "catch assert" breakpoints. */
11545 dtor_catch_assert (struct breakpoint
*b
)
11547 dtor_exception (ex_catch_assert
, b
);
11550 static struct bp_location
*
11551 allocate_location_catch_assert (struct breakpoint
*self
)
11553 return allocate_location_exception (ex_catch_assert
, self
);
11557 re_set_catch_assert (struct breakpoint
*b
)
11559 return re_set_exception (ex_catch_assert
, b
);
11563 check_status_catch_assert (bpstat bs
)
11565 check_status_exception (ex_catch_assert
, bs
);
11568 static enum print_stop_action
11569 print_it_catch_assert (bpstat bs
)
11571 return print_it_exception (ex_catch_assert
, bs
);
11575 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
11577 print_one_exception (ex_catch_assert
, b
, last_loc
);
11581 print_mention_catch_assert (struct breakpoint
*b
)
11583 print_mention_exception (ex_catch_assert
, b
);
11587 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
11589 print_recreate_exception (ex_catch_assert
, b
, fp
);
11592 static struct breakpoint_ops catch_assert_breakpoint_ops
;
11594 /* Return a newly allocated copy of the first space-separated token
11595 in ARGSP, and then adjust ARGSP to point immediately after that
11598 Return NULL if ARGPS does not contain any more tokens. */
11601 ada_get_next_arg (char **argsp
)
11603 char *args
= *argsp
;
11607 args
= skip_spaces (args
);
11608 if (args
[0] == '\0')
11609 return NULL
; /* No more arguments. */
11611 /* Find the end of the current argument. */
11613 end
= skip_to_space (args
);
11615 /* Adjust ARGSP to point to the start of the next argument. */
11619 /* Make a copy of the current argument and return it. */
11621 result
= xmalloc (end
- args
+ 1);
11622 strncpy (result
, args
, end
- args
);
11623 result
[end
- args
] = '\0';
11628 /* Split the arguments specified in a "catch exception" command.
11629 Set EX to the appropriate catchpoint type.
11630 Set EXCEP_STRING to the name of the specific exception if
11631 specified by the user.
11632 If a condition is found at the end of the arguments, the condition
11633 expression is stored in COND_STRING (memory must be deallocated
11634 after use). Otherwise COND_STRING is set to NULL. */
11637 catch_ada_exception_command_split (char *args
,
11638 enum exception_catchpoint_kind
*ex
,
11639 char **excep_string
,
11640 char **cond_string
)
11642 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
11643 char *exception_name
;
11646 exception_name
= ada_get_next_arg (&args
);
11647 if (exception_name
!= NULL
&& strcmp (exception_name
, "if") == 0)
11649 /* This is not an exception name; this is the start of a condition
11650 expression for a catchpoint on all exceptions. So, "un-get"
11651 this token, and set exception_name to NULL. */
11652 xfree (exception_name
);
11653 exception_name
= NULL
;
11656 make_cleanup (xfree
, exception_name
);
11658 /* Check to see if we have a condition. */
11660 args
= skip_spaces (args
);
11661 if (strncmp (args
, "if", 2) == 0
11662 && (isspace (args
[2]) || args
[2] == '\0'))
11665 args
= skip_spaces (args
);
11667 if (args
[0] == '\0')
11668 error (_("Condition missing after `if' keyword"));
11669 cond
= xstrdup (args
);
11670 make_cleanup (xfree
, cond
);
11672 args
+= strlen (args
);
11675 /* Check that we do not have any more arguments. Anything else
11678 if (args
[0] != '\0')
11679 error (_("Junk at end of expression"));
11681 discard_cleanups (old_chain
);
11683 if (exception_name
== NULL
)
11685 /* Catch all exceptions. */
11686 *ex
= ex_catch_exception
;
11687 *excep_string
= NULL
;
11689 else if (strcmp (exception_name
, "unhandled") == 0)
11691 /* Catch unhandled exceptions. */
11692 *ex
= ex_catch_exception_unhandled
;
11693 *excep_string
= NULL
;
11697 /* Catch a specific exception. */
11698 *ex
= ex_catch_exception
;
11699 *excep_string
= exception_name
;
11701 *cond_string
= cond
;
11704 /* Return the name of the symbol on which we should break in order to
11705 implement a catchpoint of the EX kind. */
11707 static const char *
11708 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
11710 struct ada_inferior_data
*data
= get_ada_inferior_data (current_inferior ());
11712 gdb_assert (data
->exception_info
!= NULL
);
11716 case ex_catch_exception
:
11717 return (data
->exception_info
->catch_exception_sym
);
11719 case ex_catch_exception_unhandled
:
11720 return (data
->exception_info
->catch_exception_unhandled_sym
);
11722 case ex_catch_assert
:
11723 return (data
->exception_info
->catch_assert_sym
);
11726 internal_error (__FILE__
, __LINE__
,
11727 _("unexpected catchpoint kind (%d)"), ex
);
11731 /* Return the breakpoint ops "virtual table" used for catchpoints
11734 static const struct breakpoint_ops
*
11735 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
11739 case ex_catch_exception
:
11740 return (&catch_exception_breakpoint_ops
);
11742 case ex_catch_exception_unhandled
:
11743 return (&catch_exception_unhandled_breakpoint_ops
);
11745 case ex_catch_assert
:
11746 return (&catch_assert_breakpoint_ops
);
11749 internal_error (__FILE__
, __LINE__
,
11750 _("unexpected catchpoint kind (%d)"), ex
);
11754 /* Return the condition that will be used to match the current exception
11755 being raised with the exception that the user wants to catch. This
11756 assumes that this condition is used when the inferior just triggered
11757 an exception catchpoint.
11759 The string returned is a newly allocated string that needs to be
11760 deallocated later. */
11763 ada_exception_catchpoint_cond_string (const char *excep_string
)
11767 /* The standard exceptions are a special case. They are defined in
11768 runtime units that have been compiled without debugging info; if
11769 EXCEP_STRING is the not-fully-qualified name of a standard
11770 exception (e.g. "constraint_error") then, during the evaluation
11771 of the condition expression, the symbol lookup on this name would
11772 *not* return this standard exception. The catchpoint condition
11773 may then be set only on user-defined exceptions which have the
11774 same not-fully-qualified name (e.g. my_package.constraint_error).
11776 To avoid this unexcepted behavior, these standard exceptions are
11777 systematically prefixed by "standard". This means that "catch
11778 exception constraint_error" is rewritten into "catch exception
11779 standard.constraint_error".
11781 If an exception named contraint_error is defined in another package of
11782 the inferior program, then the only way to specify this exception as a
11783 breakpoint condition is to use its fully-qualified named:
11784 e.g. my_package.constraint_error. */
11786 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
11788 if (strcmp (standard_exc
[i
], excep_string
) == 0)
11790 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11794 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
11797 /* Return the symtab_and_line that should be used to insert an exception
11798 catchpoint of the TYPE kind.
11800 EXCEP_STRING should contain the name of a specific exception that
11801 the catchpoint should catch, or NULL otherwise.
11803 ADDR_STRING returns the name of the function where the real
11804 breakpoint that implements the catchpoints is set, depending on the
11805 type of catchpoint we need to create. */
11807 static struct symtab_and_line
11808 ada_exception_sal (enum exception_catchpoint_kind ex
, char *excep_string
,
11809 char **addr_string
, const struct breakpoint_ops
**ops
)
11811 const char *sym_name
;
11812 struct symbol
*sym
;
11814 /* First, find out which exception support info to use. */
11815 ada_exception_support_info_sniffer ();
11817 /* Then lookup the function on which we will break in order to catch
11818 the Ada exceptions requested by the user. */
11819 sym_name
= ada_exception_sym_name (ex
);
11820 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
11822 /* We can assume that SYM is not NULL at this stage. If the symbol
11823 did not exist, ada_exception_support_info_sniffer would have
11824 raised an exception.
11826 Also, ada_exception_support_info_sniffer should have already
11827 verified that SYM is a function symbol. */
11828 gdb_assert (sym
!= NULL
);
11829 gdb_assert (SYMBOL_CLASS (sym
) == LOC_BLOCK
);
11831 /* Set ADDR_STRING. */
11832 *addr_string
= xstrdup (sym_name
);
11835 *ops
= ada_exception_breakpoint_ops (ex
);
11837 return find_function_start_sal (sym
, 1);
11840 /* Parse the arguments (ARGS) of the "catch exception" command.
11842 If the user asked the catchpoint to catch only a specific
11843 exception, then save the exception name in ADDR_STRING.
11845 If the user provided a condition, then set COND_STRING to
11846 that condition expression (the memory must be deallocated
11847 after use). Otherwise, set COND_STRING to NULL.
11849 See ada_exception_sal for a description of all the remaining
11850 function arguments of this function. */
11852 static struct symtab_and_line
11853 ada_decode_exception_location (char *args
, char **addr_string
,
11854 char **excep_string
,
11855 char **cond_string
,
11856 const struct breakpoint_ops
**ops
)
11858 enum exception_catchpoint_kind ex
;
11860 catch_ada_exception_command_split (args
, &ex
, excep_string
, cond_string
);
11861 return ada_exception_sal (ex
, *excep_string
, addr_string
, ops
);
11864 /* Create an Ada exception catchpoint. */
11867 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
11868 struct symtab_and_line sal
,
11870 char *excep_string
,
11872 const struct breakpoint_ops
*ops
,
11876 struct ada_catchpoint
*c
;
11878 c
= XNEW (struct ada_catchpoint
);
11879 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
11880 ops
, tempflag
, from_tty
);
11881 c
->excep_string
= excep_string
;
11882 create_excep_cond_exprs (c
);
11883 if (cond_string
!= NULL
)
11884 set_breakpoint_condition (&c
->base
, cond_string
, from_tty
);
11885 install_breakpoint (0, &c
->base
, 1);
11888 /* Implement the "catch exception" command. */
11891 catch_ada_exception_command (char *arg
, int from_tty
,
11892 struct cmd_list_element
*command
)
11894 struct gdbarch
*gdbarch
= get_current_arch ();
11896 struct symtab_and_line sal
;
11897 char *addr_string
= NULL
;
11898 char *excep_string
= NULL
;
11899 char *cond_string
= NULL
;
11900 const struct breakpoint_ops
*ops
= NULL
;
11902 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
11906 sal
= ada_decode_exception_location (arg
, &addr_string
, &excep_string
,
11907 &cond_string
, &ops
);
11908 create_ada_exception_catchpoint (gdbarch
, sal
, addr_string
,
11909 excep_string
, cond_string
, ops
,
11910 tempflag
, from_tty
);
11913 /* Assuming that ARGS contains the arguments of a "catch assert"
11914 command, parse those arguments and return a symtab_and_line object
11915 for a failed assertion catchpoint.
11917 Set ADDR_STRING to the name of the function where the real
11918 breakpoint that implements the catchpoint is set.
11920 If ARGS contains a condition, set COND_STRING to that condition
11921 (the memory needs to be deallocated after use). Otherwise, set
11922 COND_STRING to NULL. */
11924 static struct symtab_and_line
11925 ada_decode_assert_location (char *args
, char **addr_string
,
11926 char **cond_string
,
11927 const struct breakpoint_ops
**ops
)
11929 args
= skip_spaces (args
);
11931 /* Check whether a condition was provided. */
11932 if (strncmp (args
, "if", 2) == 0
11933 && (isspace (args
[2]) || args
[2] == '\0'))
11936 args
= skip_spaces (args
);
11937 if (args
[0] == '\0')
11938 error (_("condition missing after `if' keyword"));
11939 *cond_string
= xstrdup (args
);
11942 /* Otherwise, there should be no other argument at the end of
11944 else if (args
[0] != '\0')
11945 error (_("Junk at end of arguments."));
11947 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, ops
);
11950 /* Implement the "catch assert" command. */
11953 catch_assert_command (char *arg
, int from_tty
,
11954 struct cmd_list_element
*command
)
11956 struct gdbarch
*gdbarch
= get_current_arch ();
11958 struct symtab_and_line sal
;
11959 char *addr_string
= NULL
;
11960 char *cond_string
= NULL
;
11961 const struct breakpoint_ops
*ops
= NULL
;
11963 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
11967 sal
= ada_decode_assert_location (arg
, &addr_string
, &cond_string
, &ops
);
11968 create_ada_exception_catchpoint (gdbarch
, sal
, addr_string
,
11969 NULL
, cond_string
, ops
, tempflag
,
11973 /* Information about operators given special treatment in functions
11975 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
11977 #define ADA_OPERATORS \
11978 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
11979 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
11980 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
11981 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
11982 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
11983 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
11984 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
11985 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
11986 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
11987 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
11988 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
11989 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
11990 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
11991 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
11992 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
11993 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
11994 OP_DEFN (OP_OTHERS, 1, 1, 0) \
11995 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
11996 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
11999 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
12002 switch (exp
->elts
[pc
- 1].opcode
)
12005 operator_length_standard (exp
, pc
, oplenp
, argsp
);
12008 #define OP_DEFN(op, len, args, binop) \
12009 case op: *oplenp = len; *argsp = args; break;
12015 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
12020 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
12025 /* Implementation of the exp_descriptor method operator_check. */
12028 ada_operator_check (struct expression
*exp
, int pos
,
12029 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
12032 const union exp_element
*const elts
= exp
->elts
;
12033 struct type
*type
= NULL
;
12035 switch (elts
[pos
].opcode
)
12037 case UNOP_IN_RANGE
:
12039 type
= elts
[pos
+ 1].type
;
12043 return operator_check_standard (exp
, pos
, objfile_func
, data
);
12046 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
12048 if (type
&& TYPE_OBJFILE (type
)
12049 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
12056 ada_op_name (enum exp_opcode opcode
)
12061 return op_name_standard (opcode
);
12063 #define OP_DEFN(op, len, args, binop) case op: return #op;
12068 return "OP_AGGREGATE";
12070 return "OP_CHOICES";
12076 /* As for operator_length, but assumes PC is pointing at the first
12077 element of the operator, and gives meaningful results only for the
12078 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
12081 ada_forward_operator_length (struct expression
*exp
, int pc
,
12082 int *oplenp
, int *argsp
)
12084 switch (exp
->elts
[pc
].opcode
)
12087 *oplenp
= *argsp
= 0;
12090 #define OP_DEFN(op, len, args, binop) \
12091 case op: *oplenp = len; *argsp = args; break;
12097 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
12102 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
12108 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
12110 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
12118 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
12120 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
12125 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
12129 /* Ada attributes ('Foo). */
12132 case OP_ATR_LENGTH
:
12136 case OP_ATR_MODULUS
:
12143 case UNOP_IN_RANGE
:
12145 /* XXX: gdb_sprint_host_address, type_sprint */
12146 fprintf_filtered (stream
, _("Type @"));
12147 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
12148 fprintf_filtered (stream
, " (");
12149 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
12150 fprintf_filtered (stream
, ")");
12152 case BINOP_IN_BOUNDS
:
12153 fprintf_filtered (stream
, " (%d)",
12154 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
12156 case TERNOP_IN_RANGE
:
12161 case OP_DISCRETE_RANGE
:
12162 case OP_POSITIONAL
:
12169 char *name
= &exp
->elts
[elt
+ 2].string
;
12170 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
12172 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
12177 return dump_subexp_body_standard (exp
, stream
, elt
);
12181 for (i
= 0; i
< nargs
; i
+= 1)
12182 elt
= dump_subexp (exp
, stream
, elt
);
12187 /* The Ada extension of print_subexp (q.v.). */
12190 ada_print_subexp (struct expression
*exp
, int *pos
,
12191 struct ui_file
*stream
, enum precedence prec
)
12193 int oplen
, nargs
, i
;
12195 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
12197 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
12204 print_subexp_standard (exp
, pos
, stream
, prec
);
12208 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
12211 case BINOP_IN_BOUNDS
:
12212 /* XXX: sprint_subexp */
12213 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12214 fputs_filtered (" in ", stream
);
12215 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12216 fputs_filtered ("'range", stream
);
12217 if (exp
->elts
[pc
+ 1].longconst
> 1)
12218 fprintf_filtered (stream
, "(%ld)",
12219 (long) exp
->elts
[pc
+ 1].longconst
);
12222 case TERNOP_IN_RANGE
:
12223 if (prec
>= PREC_EQUAL
)
12224 fputs_filtered ("(", stream
);
12225 /* XXX: sprint_subexp */
12226 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12227 fputs_filtered (" in ", stream
);
12228 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
12229 fputs_filtered (" .. ", stream
);
12230 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
12231 if (prec
>= PREC_EQUAL
)
12232 fputs_filtered (")", stream
);
12237 case OP_ATR_LENGTH
:
12241 case OP_ATR_MODULUS
:
12246 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
12248 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
12249 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
12253 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12254 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
12259 for (tem
= 1; tem
< nargs
; tem
+= 1)
12261 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
12262 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
12264 fputs_filtered (")", stream
);
12269 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
12270 fputs_filtered ("'(", stream
);
12271 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
12272 fputs_filtered (")", stream
);
12275 case UNOP_IN_RANGE
:
12276 /* XXX: sprint_subexp */
12277 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12278 fputs_filtered (" in ", stream
);
12279 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
12282 case OP_DISCRETE_RANGE
:
12283 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12284 fputs_filtered ("..", stream
);
12285 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12289 fputs_filtered ("others => ", stream
);
12290 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12294 for (i
= 0; i
< nargs
-1; i
+= 1)
12297 fputs_filtered ("|", stream
);
12298 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12300 fputs_filtered (" => ", stream
);
12301 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12304 case OP_POSITIONAL
:
12305 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12309 fputs_filtered ("(", stream
);
12310 for (i
= 0; i
< nargs
; i
+= 1)
12313 fputs_filtered (", ", stream
);
12314 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12316 fputs_filtered (")", stream
);
12321 /* Table mapping opcodes into strings for printing operators
12322 and precedences of the operators. */
12324 static const struct op_print ada_op_print_tab
[] = {
12325 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
12326 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
12327 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
12328 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
12329 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
12330 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
12331 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
12332 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
12333 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
12334 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
12335 {">", BINOP_GTR
, PREC_ORDER
, 0},
12336 {"<", BINOP_LESS
, PREC_ORDER
, 0},
12337 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
12338 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
12339 {"+", BINOP_ADD
, PREC_ADD
, 0},
12340 {"-", BINOP_SUB
, PREC_ADD
, 0},
12341 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
12342 {"*", BINOP_MUL
, PREC_MUL
, 0},
12343 {"/", BINOP_DIV
, PREC_MUL
, 0},
12344 {"rem", BINOP_REM
, PREC_MUL
, 0},
12345 {"mod", BINOP_MOD
, PREC_MUL
, 0},
12346 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
12347 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
12348 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
12349 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
12350 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
12351 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
12352 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
12353 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
12354 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
12355 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
12359 enum ada_primitive_types
{
12360 ada_primitive_type_int
,
12361 ada_primitive_type_long
,
12362 ada_primitive_type_short
,
12363 ada_primitive_type_char
,
12364 ada_primitive_type_float
,
12365 ada_primitive_type_double
,
12366 ada_primitive_type_void
,
12367 ada_primitive_type_long_long
,
12368 ada_primitive_type_long_double
,
12369 ada_primitive_type_natural
,
12370 ada_primitive_type_positive
,
12371 ada_primitive_type_system_address
,
12372 nr_ada_primitive_types
12376 ada_language_arch_info (struct gdbarch
*gdbarch
,
12377 struct language_arch_info
*lai
)
12379 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
12381 lai
->primitive_type_vector
12382 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
12385 lai
->primitive_type_vector
[ada_primitive_type_int
]
12386 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12388 lai
->primitive_type_vector
[ada_primitive_type_long
]
12389 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
12390 0, "long_integer");
12391 lai
->primitive_type_vector
[ada_primitive_type_short
]
12392 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
12393 0, "short_integer");
12394 lai
->string_char_type
12395 = lai
->primitive_type_vector
[ada_primitive_type_char
]
12396 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
12397 lai
->primitive_type_vector
[ada_primitive_type_float
]
12398 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
12400 lai
->primitive_type_vector
[ada_primitive_type_double
]
12401 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12402 "long_float", NULL
);
12403 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
12404 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
12405 0, "long_long_integer");
12406 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
12407 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12408 "long_long_float", NULL
);
12409 lai
->primitive_type_vector
[ada_primitive_type_natural
]
12410 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12412 lai
->primitive_type_vector
[ada_primitive_type_positive
]
12413 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12415 lai
->primitive_type_vector
[ada_primitive_type_void
]
12416 = builtin
->builtin_void
;
12418 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
12419 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
12420 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
12421 = "system__address";
12423 lai
->bool_type_symbol
= NULL
;
12424 lai
->bool_type_default
= builtin
->builtin_bool
;
12427 /* Language vector */
12429 /* Not really used, but needed in the ada_language_defn. */
12432 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
12434 ada_emit_char (c
, type
, stream
, quoter
, 1);
12440 warnings_issued
= 0;
12441 return ada_parse ();
12444 static const struct exp_descriptor ada_exp_descriptor
= {
12446 ada_operator_length
,
12447 ada_operator_check
,
12449 ada_dump_subexp_body
,
12450 ada_evaluate_subexp
12453 /* Implement the "la_get_symbol_name_cmp" language_defn method
12456 static symbol_name_cmp_ftype
12457 ada_get_symbol_name_cmp (const char *lookup_name
)
12459 if (should_use_wild_match (lookup_name
))
12462 return compare_names
;
12465 /* Implement the "la_read_var_value" language_defn method for Ada. */
12467 static struct value
*
12468 ada_read_var_value (struct symbol
*var
, struct frame_info
*frame
)
12470 struct block
*frame_block
= NULL
;
12471 struct symbol
*renaming_sym
= NULL
;
12473 /* The only case where default_read_var_value is not sufficient
12474 is when VAR is a renaming... */
12476 frame_block
= get_frame_block (frame
, NULL
);
12478 renaming_sym
= ada_find_renaming_symbol (var
, frame_block
);
12479 if (renaming_sym
!= NULL
)
12480 return ada_read_renaming_var_value (renaming_sym
, frame_block
);
12482 /* This is a typical case where we expect the default_read_var_value
12483 function to work. */
12484 return default_read_var_value (var
, frame
);
12487 const struct language_defn ada_language_defn
= {
12488 "ada", /* Language name */
12492 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
12493 that's not quite what this means. */
12495 macro_expansion_no
,
12496 &ada_exp_descriptor
,
12500 ada_printchar
, /* Print a character constant */
12501 ada_printstr
, /* Function to print string constant */
12502 emit_char
, /* Function to print single char (not used) */
12503 ada_print_type
, /* Print a type using appropriate syntax */
12504 ada_print_typedef
, /* Print a typedef using appropriate syntax */
12505 ada_val_print
, /* Print a value using appropriate syntax */
12506 ada_value_print
, /* Print a top-level value */
12507 ada_read_var_value
, /* la_read_var_value */
12508 NULL
, /* Language specific skip_trampoline */
12509 NULL
, /* name_of_this */
12510 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
12511 basic_lookup_transparent_type
, /* lookup_transparent_type */
12512 ada_la_decode
, /* Language specific symbol demangler */
12513 NULL
, /* Language specific
12514 class_name_from_physname */
12515 ada_op_print_tab
, /* expression operators for printing */
12516 0, /* c-style arrays */
12517 1, /* String lower bound */
12518 ada_get_gdb_completer_word_break_characters
,
12519 ada_make_symbol_completion_list
,
12520 ada_language_arch_info
,
12521 ada_print_array_index
,
12522 default_pass_by_reference
,
12524 ada_get_symbol_name_cmp
, /* la_get_symbol_name_cmp */
12525 ada_iterate_over_symbols
,
12529 /* Provide a prototype to silence -Wmissing-prototypes. */
12530 extern initialize_file_ftype _initialize_ada_language
;
12532 /* Command-list for the "set/show ada" prefix command. */
12533 static struct cmd_list_element
*set_ada_list
;
12534 static struct cmd_list_element
*show_ada_list
;
12536 /* Implement the "set ada" prefix command. */
12539 set_ada_command (char *arg
, int from_tty
)
12541 printf_unfiltered (_(\
12542 "\"set ada\" must be followed by the name of a setting.\n"));
12543 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
12546 /* Implement the "show ada" prefix command. */
12549 show_ada_command (char *args
, int from_tty
)
12551 cmd_show_list (show_ada_list
, from_tty
, "");
12555 initialize_ada_catchpoint_ops (void)
12557 struct breakpoint_ops
*ops
;
12559 initialize_breakpoint_ops ();
12561 ops
= &catch_exception_breakpoint_ops
;
12562 *ops
= bkpt_breakpoint_ops
;
12563 ops
->dtor
= dtor_catch_exception
;
12564 ops
->allocate_location
= allocate_location_catch_exception
;
12565 ops
->re_set
= re_set_catch_exception
;
12566 ops
->check_status
= check_status_catch_exception
;
12567 ops
->print_it
= print_it_catch_exception
;
12568 ops
->print_one
= print_one_catch_exception
;
12569 ops
->print_mention
= print_mention_catch_exception
;
12570 ops
->print_recreate
= print_recreate_catch_exception
;
12572 ops
= &catch_exception_unhandled_breakpoint_ops
;
12573 *ops
= bkpt_breakpoint_ops
;
12574 ops
->dtor
= dtor_catch_exception_unhandled
;
12575 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
12576 ops
->re_set
= re_set_catch_exception_unhandled
;
12577 ops
->check_status
= check_status_catch_exception_unhandled
;
12578 ops
->print_it
= print_it_catch_exception_unhandled
;
12579 ops
->print_one
= print_one_catch_exception_unhandled
;
12580 ops
->print_mention
= print_mention_catch_exception_unhandled
;
12581 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
12583 ops
= &catch_assert_breakpoint_ops
;
12584 *ops
= bkpt_breakpoint_ops
;
12585 ops
->dtor
= dtor_catch_assert
;
12586 ops
->allocate_location
= allocate_location_catch_assert
;
12587 ops
->re_set
= re_set_catch_assert
;
12588 ops
->check_status
= check_status_catch_assert
;
12589 ops
->print_it
= print_it_catch_assert
;
12590 ops
->print_one
= print_one_catch_assert
;
12591 ops
->print_mention
= print_mention_catch_assert
;
12592 ops
->print_recreate
= print_recreate_catch_assert
;
12596 _initialize_ada_language (void)
12598 add_language (&ada_language_defn
);
12600 initialize_ada_catchpoint_ops ();
12602 add_prefix_cmd ("ada", no_class
, set_ada_command
,
12603 _("Prefix command for changing Ada-specfic settings"),
12604 &set_ada_list
, "set ada ", 0, &setlist
);
12606 add_prefix_cmd ("ada", no_class
, show_ada_command
,
12607 _("Generic command for showing Ada-specific settings."),
12608 &show_ada_list
, "show ada ", 0, &showlist
);
12610 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
12611 &trust_pad_over_xvs
, _("\
12612 Enable or disable an optimization trusting PAD types over XVS types"), _("\
12613 Show whether an optimization trusting PAD types over XVS types is activated"),
12615 This is related to the encoding used by the GNAT compiler. The debugger\n\
12616 should normally trust the contents of PAD types, but certain older versions\n\
12617 of GNAT have a bug that sometimes causes the information in the PAD type\n\
12618 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
12619 work around this bug. It is always safe to turn this option \"off\", but\n\
12620 this incurs a slight performance penalty, so it is recommended to NOT change\n\
12621 this option to \"off\" unless necessary."),
12622 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
12624 add_catch_command ("exception", _("\
12625 Catch Ada exceptions, when raised.\n\
12626 With an argument, catch only exceptions with the given name."),
12627 catch_ada_exception_command
,
12631 add_catch_command ("assert", _("\
12632 Catch failed Ada assertions, when raised.\n\
12633 With an argument, catch only exceptions with the given name."),
12634 catch_assert_command
,
12639 varsize_limit
= 65536;
12641 obstack_init (&symbol_list_obstack
);
12643 decoded_names_store
= htab_create_alloc
12644 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
12645 NULL
, xcalloc
, xfree
);
12647 /* Setup per-inferior data. */
12648 observer_attach_inferior_exit (ada_inferior_exit
);
12650 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup
);