1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
64 /* Define whether or not the C operator '/' truncates towards zero for
65 differently signed operands (truncation direction is undefined in C).
66 Copied from valarith.c. */
68 #ifndef TRUNCATION_TOWARDS_ZERO
69 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_target_type (struct type
*);
84 static struct value
*desc_data (struct value
*);
86 static int fat_pntr_data_bitpos (struct type
*);
88 static int fat_pntr_data_bitsize (struct type
*);
90 static struct value
*desc_one_bound (struct value
*, int, int);
92 static int desc_bound_bitpos (struct type
*, int, int);
94 static int desc_bound_bitsize (struct type
*, int, int);
96 static struct type
*desc_index_type (struct type
*, int);
98 static int desc_arity (struct type
*);
100 static int ada_type_match (struct type
*, struct type
*, int);
102 static int ada_args_match (struct symbol
*, struct value
**, int);
104 static int full_match (const char *, const char *);
106 static struct value
*make_array_descriptor (struct type
*, struct value
*);
108 static void ada_add_block_symbols (struct obstack
*,
109 struct block
*, const char *,
110 domain_enum
, struct objfile
*, int);
112 static int is_nonfunction (struct ada_symbol_info
*, int);
114 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
117 static int num_defns_collected (struct obstack
*);
119 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
121 static struct value
*resolve_subexp (struct expression
**, int *, int,
124 static void replace_operator_with_call (struct expression
**, int, int, int,
125 struct symbol
*, struct block
*);
127 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
129 static char *ada_op_name (enum exp_opcode
);
131 static const char *ada_decoded_op_name (enum exp_opcode
);
133 static int numeric_type_p (struct type
*);
135 static int integer_type_p (struct type
*);
137 static int scalar_type_p (struct type
*);
139 static int discrete_type_p (struct type
*);
141 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
146 static struct symbol
*find_old_style_renaming_symbol (const char *,
149 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
152 static struct value
*evaluate_subexp_type (struct expression
*, int *);
154 static struct type
*ada_find_parallel_type_with_name (struct type
*,
157 static int is_dynamic_field (struct type
*, int);
159 static struct type
*to_fixed_variant_branch_type (struct type
*,
161 CORE_ADDR
, struct value
*);
163 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
165 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
167 static struct type
*to_static_fixed_type (struct type
*);
168 static struct type
*static_unwrap_type (struct type
*type
);
170 static struct value
*unwrap_value (struct value
*);
172 static struct type
*constrained_packed_array_type (struct type
*, long *);
174 static struct type
*decode_constrained_packed_array_type (struct type
*);
176 static long decode_packed_array_bitsize (struct type
*);
178 static struct value
*decode_constrained_packed_array (struct value
*);
180 static int ada_is_packed_array_type (struct type
*);
182 static int ada_is_unconstrained_packed_array_type (struct type
*);
184 static struct value
*value_subscript_packed (struct value
*, int,
187 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
189 static struct value
*coerce_unspec_val_to_type (struct value
*,
192 static struct value
*get_var_value (char *, char *);
194 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
196 static int equiv_types (struct type
*, struct type
*);
198 static int is_name_suffix (const char *);
200 static int advance_wild_match (const char **, const char *, int);
202 static int wild_match (const char *, const char *);
204 static struct value
*ada_coerce_ref (struct value
*);
206 static LONGEST
pos_atr (struct value
*);
208 static struct value
*value_pos_atr (struct type
*, struct value
*);
210 static struct value
*value_val_atr (struct type
*, struct value
*);
212 static struct symbol
*standard_lookup (const char *, const struct block
*,
215 static struct value
*ada_search_struct_field (char *, struct value
*, int,
218 static struct value
*ada_value_primitive_field (struct value
*, int, int,
221 static int find_struct_field (char *, struct type
*, int,
222 struct type
**, int *, int *, int *, int *);
224 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
227 static int ada_resolve_function (struct ada_symbol_info
*, int,
228 struct value
**, int, const char *,
231 static int ada_is_direct_array_type (struct type
*);
233 static void ada_language_arch_info (struct gdbarch
*,
234 struct language_arch_info
*);
236 static void check_size (const struct type
*);
238 static struct value
*ada_index_struct_field (int, struct value
*, int,
241 static struct value
*assign_aggregate (struct value
*, struct value
*,
245 static void aggregate_assign_from_choices (struct value
*, struct value
*,
247 int *, LONGEST
*, int *,
248 int, LONGEST
, LONGEST
);
250 static void aggregate_assign_positional (struct value
*, struct value
*,
252 int *, LONGEST
*, int *, int,
256 static void aggregate_assign_others (struct value
*, struct value
*,
258 int *, LONGEST
*, int, LONGEST
, LONGEST
);
261 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
264 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
267 static void ada_forward_operator_length (struct expression
*, int, int *,
272 /* Maximum-sized dynamic type. */
273 static unsigned int varsize_limit
;
275 /* FIXME: brobecker/2003-09-17: No longer a const because it is
276 returned by a function that does not return a const char *. */
277 static char *ada_completer_word_break_characters
=
279 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
281 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
284 /* The name of the symbol to use to get the name of the main subprogram. */
285 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
286 = "__gnat_ada_main_program_name";
288 /* Limit on the number of warnings to raise per expression evaluation. */
289 static int warning_limit
= 2;
291 /* Number of warning messages issued; reset to 0 by cleanups after
292 expression evaluation. */
293 static int warnings_issued
= 0;
295 static const char *known_runtime_file_name_patterns
[] = {
296 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
299 static const char *known_auxiliary_function_name_patterns
[] = {
300 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
303 /* Space for allocating results of ada_lookup_symbol_list. */
304 static struct obstack symbol_list_obstack
;
306 /* Inferior-specific data. */
308 /* Per-inferior data for this module. */
310 struct ada_inferior_data
312 /* The ada__tags__type_specific_data type, which is used when decoding
313 tagged types. With older versions of GNAT, this type was directly
314 accessible through a component ("tsd") in the object tag. But this
315 is no longer the case, so we cache it for each inferior. */
316 struct type
*tsd_type
;
319 /* Our key to this module's inferior data. */
320 static const struct inferior_data
*ada_inferior_data
;
322 /* A cleanup routine for our inferior data. */
324 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
326 struct ada_inferior_data
*data
;
328 data
= inferior_data (inf
, ada_inferior_data
);
333 /* Return our inferior data for the given inferior (INF).
335 This function always returns a valid pointer to an allocated
336 ada_inferior_data structure. If INF's inferior data has not
337 been previously set, this functions creates a new one with all
338 fields set to zero, sets INF's inferior to it, and then returns
339 a pointer to that newly allocated ada_inferior_data. */
341 static struct ada_inferior_data
*
342 get_ada_inferior_data (struct inferior
*inf
)
344 struct ada_inferior_data
*data
;
346 data
= inferior_data (inf
, ada_inferior_data
);
349 data
= XZALLOC (struct ada_inferior_data
);
350 set_inferior_data (inf
, ada_inferior_data
, data
);
356 /* Perform all necessary cleanups regarding our module's inferior data
357 that is required after the inferior INF just exited. */
360 ada_inferior_exit (struct inferior
*inf
)
362 ada_inferior_data_cleanup (inf
, NULL
);
363 set_inferior_data (inf
, ada_inferior_data
, NULL
);
368 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
369 all typedef layers have been peeled. Otherwise, return TYPE.
371 Normally, we really expect a typedef type to only have 1 typedef layer.
372 In other words, we really expect the target type of a typedef type to be
373 a non-typedef type. This is particularly true for Ada units, because
374 the language does not have a typedef vs not-typedef distinction.
375 In that respect, the Ada compiler has been trying to eliminate as many
376 typedef definitions in the debugging information, since they generally
377 do not bring any extra information (we still use typedef under certain
378 circumstances related mostly to the GNAT encoding).
380 Unfortunately, we have seen situations where the debugging information
381 generated by the compiler leads to such multiple typedef layers. For
382 instance, consider the following example with stabs:
384 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
385 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
387 This is an error in the debugging information which causes type
388 pck__float_array___XUP to be defined twice, and the second time,
389 it is defined as a typedef of a typedef.
391 This is on the fringe of legality as far as debugging information is
392 concerned, and certainly unexpected. But it is easy to handle these
393 situations correctly, so we can afford to be lenient in this case. */
396 ada_typedef_target_type (struct type
*type
)
398 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
399 type
= TYPE_TARGET_TYPE (type
);
403 /* Given DECODED_NAME a string holding a symbol name in its
404 decoded form (ie using the Ada dotted notation), returns
405 its unqualified name. */
408 ada_unqualified_name (const char *decoded_name
)
410 const char *result
= strrchr (decoded_name
, '.');
413 result
++; /* Skip the dot... */
415 result
= decoded_name
;
420 /* Return a string starting with '<', followed by STR, and '>'.
421 The result is good until the next call. */
424 add_angle_brackets (const char *str
)
426 static char *result
= NULL
;
429 result
= xstrprintf ("<%s>", str
);
434 ada_get_gdb_completer_word_break_characters (void)
436 return ada_completer_word_break_characters
;
439 /* Print an array element index using the Ada syntax. */
442 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
443 const struct value_print_options
*options
)
445 LA_VALUE_PRINT (index_value
, stream
, options
);
446 fprintf_filtered (stream
, " => ");
449 /* Assuming VECT points to an array of *SIZE objects of size
450 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
451 updating *SIZE as necessary and returning the (new) array. */
454 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
456 if (*size
< min_size
)
459 if (*size
< min_size
)
461 vect
= xrealloc (vect
, *size
* element_size
);
466 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
467 suffix of FIELD_NAME beginning "___". */
470 field_name_match (const char *field_name
, const char *target
)
472 int len
= strlen (target
);
475 (strncmp (field_name
, target
, len
) == 0
476 && (field_name
[len
] == '\0'
477 || (strncmp (field_name
+ len
, "___", 3) == 0
478 && strcmp (field_name
+ strlen (field_name
) - 6,
483 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
484 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
485 and return its index. This function also handles fields whose name
486 have ___ suffixes because the compiler sometimes alters their name
487 by adding such a suffix to represent fields with certain constraints.
488 If the field could not be found, return a negative number if
489 MAYBE_MISSING is set. Otherwise raise an error. */
492 ada_get_field_index (const struct type
*type
, const char *field_name
,
496 struct type
*struct_type
= check_typedef ((struct type
*) type
);
498 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
499 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
503 error (_("Unable to find field %s in struct %s. Aborting"),
504 field_name
, TYPE_NAME (struct_type
));
509 /* The length of the prefix of NAME prior to any "___" suffix. */
512 ada_name_prefix_len (const char *name
)
518 const char *p
= strstr (name
, "___");
521 return strlen (name
);
527 /* Return non-zero if SUFFIX is a suffix of STR.
528 Return zero if STR is null. */
531 is_suffix (const char *str
, const char *suffix
)
538 len2
= strlen (suffix
);
539 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
542 /* The contents of value VAL, treated as a value of type TYPE. The
543 result is an lval in memory if VAL is. */
545 static struct value
*
546 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
548 type
= ada_check_typedef (type
);
549 if (value_type (val
) == type
)
553 struct value
*result
;
555 /* Make sure that the object size is not unreasonable before
556 trying to allocate some memory for it. */
559 result
= allocate_value (type
);
560 set_value_component_location (result
, val
);
561 set_value_bitsize (result
, value_bitsize (val
));
562 set_value_bitpos (result
, value_bitpos (val
));
563 set_value_address (result
, value_address (val
));
565 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
566 set_value_lazy (result
, 1);
568 memcpy (value_contents_raw (result
), value_contents (val
),
574 static const gdb_byte
*
575 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
580 return valaddr
+ offset
;
584 cond_offset_target (CORE_ADDR address
, long offset
)
589 return address
+ offset
;
592 /* Issue a warning (as for the definition of warning in utils.c, but
593 with exactly one argument rather than ...), unless the limit on the
594 number of warnings has passed during the evaluation of the current
597 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
598 provided by "complaint". */
599 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
602 lim_warning (const char *format
, ...)
606 va_start (args
, format
);
607 warnings_issued
+= 1;
608 if (warnings_issued
<= warning_limit
)
609 vwarning (format
, args
);
614 /* Issue an error if the size of an object of type T is unreasonable,
615 i.e. if it would be a bad idea to allocate a value of this type in
619 check_size (const struct type
*type
)
621 if (TYPE_LENGTH (type
) > varsize_limit
)
622 error (_("object size is larger than varsize-limit"));
625 /* Maximum value of a SIZE-byte signed integer type. */
627 max_of_size (int size
)
629 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
631 return top_bit
| (top_bit
- 1);
634 /* Minimum value of a SIZE-byte signed integer type. */
636 min_of_size (int size
)
638 return -max_of_size (size
) - 1;
641 /* Maximum value of a SIZE-byte unsigned integer type. */
643 umax_of_size (int size
)
645 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
647 return top_bit
| (top_bit
- 1);
650 /* Maximum value of integral type T, as a signed quantity. */
652 max_of_type (struct type
*t
)
654 if (TYPE_UNSIGNED (t
))
655 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
657 return max_of_size (TYPE_LENGTH (t
));
660 /* Minimum value of integral type T, as a signed quantity. */
662 min_of_type (struct type
*t
)
664 if (TYPE_UNSIGNED (t
))
667 return min_of_size (TYPE_LENGTH (t
));
670 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
672 ada_discrete_type_high_bound (struct type
*type
)
674 switch (TYPE_CODE (type
))
676 case TYPE_CODE_RANGE
:
677 return TYPE_HIGH_BOUND (type
);
679 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
684 return max_of_type (type
);
686 error (_("Unexpected type in ada_discrete_type_high_bound."));
690 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
692 ada_discrete_type_low_bound (struct type
*type
)
694 switch (TYPE_CODE (type
))
696 case TYPE_CODE_RANGE
:
697 return TYPE_LOW_BOUND (type
);
699 return TYPE_FIELD_BITPOS (type
, 0);
704 return min_of_type (type
);
706 error (_("Unexpected type in ada_discrete_type_low_bound."));
710 /* The identity on non-range types. For range types, the underlying
711 non-range scalar type. */
714 base_type (struct type
*type
)
716 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
718 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
720 type
= TYPE_TARGET_TYPE (type
);
726 /* Language Selection */
728 /* If the main program is in Ada, return language_ada, otherwise return LANG
729 (the main program is in Ada iif the adainit symbol is found). */
732 ada_update_initial_language (enum language lang
)
734 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
735 (struct objfile
*) NULL
) != NULL
)
741 /* If the main procedure is written in Ada, then return its name.
742 The result is good until the next call. Return NULL if the main
743 procedure doesn't appear to be in Ada. */
748 struct minimal_symbol
*msym
;
749 static char *main_program_name
= NULL
;
751 /* For Ada, the name of the main procedure is stored in a specific
752 string constant, generated by the binder. Look for that symbol,
753 extract its address, and then read that string. If we didn't find
754 that string, then most probably the main procedure is not written
756 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
760 CORE_ADDR main_program_name_addr
;
763 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
764 if (main_program_name_addr
== 0)
765 error (_("Invalid address for Ada main program name."));
767 xfree (main_program_name
);
768 target_read_string (main_program_name_addr
, &main_program_name
,
773 return main_program_name
;
776 /* The main procedure doesn't seem to be in Ada. */
782 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
785 const struct ada_opname_map ada_opname_table
[] = {
786 {"Oadd", "\"+\"", BINOP_ADD
},
787 {"Osubtract", "\"-\"", BINOP_SUB
},
788 {"Omultiply", "\"*\"", BINOP_MUL
},
789 {"Odivide", "\"/\"", BINOP_DIV
},
790 {"Omod", "\"mod\"", BINOP_MOD
},
791 {"Orem", "\"rem\"", BINOP_REM
},
792 {"Oexpon", "\"**\"", BINOP_EXP
},
793 {"Olt", "\"<\"", BINOP_LESS
},
794 {"Ole", "\"<=\"", BINOP_LEQ
},
795 {"Ogt", "\">\"", BINOP_GTR
},
796 {"Oge", "\">=\"", BINOP_GEQ
},
797 {"Oeq", "\"=\"", BINOP_EQUAL
},
798 {"One", "\"/=\"", BINOP_NOTEQUAL
},
799 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
800 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
801 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
802 {"Oconcat", "\"&\"", BINOP_CONCAT
},
803 {"Oabs", "\"abs\"", UNOP_ABS
},
804 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
805 {"Oadd", "\"+\"", UNOP_PLUS
},
806 {"Osubtract", "\"-\"", UNOP_NEG
},
810 /* The "encoded" form of DECODED, according to GNAT conventions.
811 The result is valid until the next call to ada_encode. */
814 ada_encode (const char *decoded
)
816 static char *encoding_buffer
= NULL
;
817 static size_t encoding_buffer_size
= 0;
824 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
825 2 * strlen (decoded
) + 10);
828 for (p
= decoded
; *p
!= '\0'; p
+= 1)
832 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
837 const struct ada_opname_map
*mapping
;
839 for (mapping
= ada_opname_table
;
840 mapping
->encoded
!= NULL
841 && strncmp (mapping
->decoded
, p
,
842 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
844 if (mapping
->encoded
== NULL
)
845 error (_("invalid Ada operator name: %s"), p
);
846 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
847 k
+= strlen (mapping
->encoded
);
852 encoding_buffer
[k
] = *p
;
857 encoding_buffer
[k
] = '\0';
858 return encoding_buffer
;
861 /* Return NAME folded to lower case, or, if surrounded by single
862 quotes, unfolded, but with the quotes stripped away. Result good
866 ada_fold_name (const char *name
)
868 static char *fold_buffer
= NULL
;
869 static size_t fold_buffer_size
= 0;
871 int len
= strlen (name
);
872 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
876 strncpy (fold_buffer
, name
+ 1, len
- 2);
877 fold_buffer
[len
- 2] = '\000';
883 for (i
= 0; i
<= len
; i
+= 1)
884 fold_buffer
[i
] = tolower (name
[i
]);
890 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
893 is_lower_alphanum (const char c
)
895 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
898 /* Remove either of these suffixes:
903 These are suffixes introduced by the compiler for entities such as
904 nested subprogram for instance, in order to avoid name clashes.
905 They do not serve any purpose for the debugger. */
908 ada_remove_trailing_digits (const char *encoded
, int *len
)
910 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
914 while (i
> 0 && isdigit (encoded
[i
]))
916 if (i
>= 0 && encoded
[i
] == '.')
918 else if (i
>= 0 && encoded
[i
] == '$')
920 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
922 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
927 /* Remove the suffix introduced by the compiler for protected object
931 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
933 /* Remove trailing N. */
935 /* Protected entry subprograms are broken into two
936 separate subprograms: The first one is unprotected, and has
937 a 'N' suffix; the second is the protected version, and has
938 the 'P' suffix. The second calls the first one after handling
939 the protection. Since the P subprograms are internally generated,
940 we leave these names undecoded, giving the user a clue that this
941 entity is internal. */
944 && encoded
[*len
- 1] == 'N'
945 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
949 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
952 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
956 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
959 if (encoded
[i
] != 'X')
965 if (isalnum (encoded
[i
-1]))
969 /* If ENCODED follows the GNAT entity encoding conventions, then return
970 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
973 The resulting string is valid until the next call of ada_decode.
974 If the string is unchanged by decoding, the original string pointer
978 ada_decode (const char *encoded
)
985 static char *decoding_buffer
= NULL
;
986 static size_t decoding_buffer_size
= 0;
988 /* The name of the Ada main procedure starts with "_ada_".
989 This prefix is not part of the decoded name, so skip this part
990 if we see this prefix. */
991 if (strncmp (encoded
, "_ada_", 5) == 0)
994 /* If the name starts with '_', then it is not a properly encoded
995 name, so do not attempt to decode it. Similarly, if the name
996 starts with '<', the name should not be decoded. */
997 if (encoded
[0] == '_' || encoded
[0] == '<')
1000 len0
= strlen (encoded
);
1002 ada_remove_trailing_digits (encoded
, &len0
);
1003 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1005 /* Remove the ___X.* suffix if present. Do not forget to verify that
1006 the suffix is located before the current "end" of ENCODED. We want
1007 to avoid re-matching parts of ENCODED that have previously been
1008 marked as discarded (by decrementing LEN0). */
1009 p
= strstr (encoded
, "___");
1010 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1018 /* Remove any trailing TKB suffix. It tells us that this symbol
1019 is for the body of a task, but that information does not actually
1020 appear in the decoded name. */
1022 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1025 /* Remove any trailing TB suffix. The TB suffix is slightly different
1026 from the TKB suffix because it is used for non-anonymous task
1029 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1032 /* Remove trailing "B" suffixes. */
1033 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1035 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1038 /* Make decoded big enough for possible expansion by operator name. */
1040 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1041 decoded
= decoding_buffer
;
1043 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1045 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1048 while ((i
>= 0 && isdigit (encoded
[i
]))
1049 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1051 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1053 else if (encoded
[i
] == '$')
1057 /* The first few characters that are not alphabetic are not part
1058 of any encoding we use, so we can copy them over verbatim. */
1060 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1061 decoded
[j
] = encoded
[i
];
1066 /* Is this a symbol function? */
1067 if (at_start_name
&& encoded
[i
] == 'O')
1071 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1073 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1074 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1076 && !isalnum (encoded
[i
+ op_len
]))
1078 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1081 j
+= strlen (ada_opname_table
[k
].decoded
);
1085 if (ada_opname_table
[k
].encoded
!= NULL
)
1090 /* Replace "TK__" with "__", which will eventually be translated
1091 into "." (just below). */
1093 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1096 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1097 be translated into "." (just below). These are internal names
1098 generated for anonymous blocks inside which our symbol is nested. */
1100 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1101 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1102 && isdigit (encoded
[i
+4]))
1106 while (k
< len0
&& isdigit (encoded
[k
]))
1107 k
++; /* Skip any extra digit. */
1109 /* Double-check that the "__B_{DIGITS}+" sequence we found
1110 is indeed followed by "__". */
1111 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1115 /* Remove _E{DIGITS}+[sb] */
1117 /* Just as for protected object subprograms, there are 2 categories
1118 of subprograms created by the compiler for each entry. The first
1119 one implements the actual entry code, and has a suffix following
1120 the convention above; the second one implements the barrier and
1121 uses the same convention as above, except that the 'E' is replaced
1124 Just as above, we do not decode the name of barrier functions
1125 to give the user a clue that the code he is debugging has been
1126 internally generated. */
1128 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1129 && isdigit (encoded
[i
+2]))
1133 while (k
< len0
&& isdigit (encoded
[k
]))
1137 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1140 /* Just as an extra precaution, make sure that if this
1141 suffix is followed by anything else, it is a '_'.
1142 Otherwise, we matched this sequence by accident. */
1144 || (k
< len0
&& encoded
[k
] == '_'))
1149 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1150 the GNAT front-end in protected object subprograms. */
1153 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1155 /* Backtrack a bit up until we reach either the begining of
1156 the encoded name, or "__". Make sure that we only find
1157 digits or lowercase characters. */
1158 const char *ptr
= encoded
+ i
- 1;
1160 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1163 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1167 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1169 /* This is a X[bn]* sequence not separated from the previous
1170 part of the name with a non-alpha-numeric character (in other
1171 words, immediately following an alpha-numeric character), then
1172 verify that it is placed at the end of the encoded name. If
1173 not, then the encoding is not valid and we should abort the
1174 decoding. Otherwise, just skip it, it is used in body-nested
1178 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1182 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1184 /* Replace '__' by '.'. */
1192 /* It's a character part of the decoded name, so just copy it
1194 decoded
[j
] = encoded
[i
];
1199 decoded
[j
] = '\000';
1201 /* Decoded names should never contain any uppercase character.
1202 Double-check this, and abort the decoding if we find one. */
1204 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1205 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1208 if (strcmp (decoded
, encoded
) == 0)
1214 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1215 decoded
= decoding_buffer
;
1216 if (encoded
[0] == '<')
1217 strcpy (decoded
, encoded
);
1219 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1224 /* Table for keeping permanent unique copies of decoded names. Once
1225 allocated, names in this table are never released. While this is a
1226 storage leak, it should not be significant unless there are massive
1227 changes in the set of decoded names in successive versions of a
1228 symbol table loaded during a single session. */
1229 static struct htab
*decoded_names_store
;
1231 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1232 in the language-specific part of GSYMBOL, if it has not been
1233 previously computed. Tries to save the decoded name in the same
1234 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1235 in any case, the decoded symbol has a lifetime at least that of
1237 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1238 const, but nevertheless modified to a semantically equivalent form
1239 when a decoded name is cached in it. */
1242 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1245 (char **) &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1247 if (*resultp
== NULL
)
1249 const char *decoded
= ada_decode (gsymbol
->name
);
1251 if (gsymbol
->obj_section
!= NULL
)
1253 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1255 *resultp
= obsavestring (decoded
, strlen (decoded
),
1256 &objf
->objfile_obstack
);
1258 /* Sometimes, we can't find a corresponding objfile, in which
1259 case, we put the result on the heap. Since we only decode
1260 when needed, we hope this usually does not cause a
1261 significant memory leak (FIXME). */
1262 if (*resultp
== NULL
)
1264 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1268 *slot
= xstrdup (decoded
);
1277 ada_la_decode (const char *encoded
, int options
)
1279 return xstrdup (ada_decode (encoded
));
1282 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1283 suffixes that encode debugging information or leading _ada_ on
1284 SYM_NAME (see is_name_suffix commentary for the debugging
1285 information that is ignored). If WILD, then NAME need only match a
1286 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1287 either argument is NULL. */
1290 match_name (const char *sym_name
, const char *name
, int wild
)
1292 if (sym_name
== NULL
|| name
== NULL
)
1295 return wild_match (sym_name
, name
) == 0;
1298 int len_name
= strlen (name
);
1300 return (strncmp (sym_name
, name
, len_name
) == 0
1301 && is_name_suffix (sym_name
+ len_name
))
1302 || (strncmp (sym_name
, "_ada_", 5) == 0
1303 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1304 && is_name_suffix (sym_name
+ len_name
+ 5));
1311 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1312 generated by the GNAT compiler to describe the index type used
1313 for each dimension of an array, check whether it follows the latest
1314 known encoding. If not, fix it up to conform to the latest encoding.
1315 Otherwise, do nothing. This function also does nothing if
1316 INDEX_DESC_TYPE is NULL.
1318 The GNAT encoding used to describle the array index type evolved a bit.
1319 Initially, the information would be provided through the name of each
1320 field of the structure type only, while the type of these fields was
1321 described as unspecified and irrelevant. The debugger was then expected
1322 to perform a global type lookup using the name of that field in order
1323 to get access to the full index type description. Because these global
1324 lookups can be very expensive, the encoding was later enhanced to make
1325 the global lookup unnecessary by defining the field type as being
1326 the full index type description.
1328 The purpose of this routine is to allow us to support older versions
1329 of the compiler by detecting the use of the older encoding, and by
1330 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1331 we essentially replace each field's meaningless type by the associated
1335 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1339 if (index_desc_type
== NULL
)
1341 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1343 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1344 to check one field only, no need to check them all). If not, return
1347 If our INDEX_DESC_TYPE was generated using the older encoding,
1348 the field type should be a meaningless integer type whose name
1349 is not equal to the field name. */
1350 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1351 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1352 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1355 /* Fixup each field of INDEX_DESC_TYPE. */
1356 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1358 char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1359 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1362 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1366 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1368 static char *bound_name
[] = {
1369 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1370 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1373 /* Maximum number of array dimensions we are prepared to handle. */
1375 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1378 /* The desc_* routines return primitive portions of array descriptors
1381 /* The descriptor or array type, if any, indicated by TYPE; removes
1382 level of indirection, if needed. */
1384 static struct type
*
1385 desc_base_type (struct type
*type
)
1389 type
= ada_check_typedef (type
);
1390 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1391 type
= ada_typedef_target_type (type
);
1394 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1395 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1396 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1401 /* True iff TYPE indicates a "thin" array pointer type. */
1404 is_thin_pntr (struct type
*type
)
1407 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1408 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1411 /* The descriptor type for thin pointer type TYPE. */
1413 static struct type
*
1414 thin_descriptor_type (struct type
*type
)
1416 struct type
*base_type
= desc_base_type (type
);
1418 if (base_type
== NULL
)
1420 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1424 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1426 if (alt_type
== NULL
)
1433 /* A pointer to the array data for thin-pointer value VAL. */
1435 static struct value
*
1436 thin_data_pntr (struct value
*val
)
1438 struct type
*type
= value_type (val
);
1439 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1441 data_type
= lookup_pointer_type (data_type
);
1443 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1444 return value_cast (data_type
, value_copy (val
));
1446 return value_from_longest (data_type
, value_address (val
));
1449 /* True iff TYPE indicates a "thick" array pointer type. */
1452 is_thick_pntr (struct type
*type
)
1454 type
= desc_base_type (type
);
1455 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1456 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1459 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1460 pointer to one, the type of its bounds data; otherwise, NULL. */
1462 static struct type
*
1463 desc_bounds_type (struct type
*type
)
1467 type
= desc_base_type (type
);
1471 else if (is_thin_pntr (type
))
1473 type
= thin_descriptor_type (type
);
1476 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1478 return ada_check_typedef (r
);
1480 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1482 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1484 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1489 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1490 one, a pointer to its bounds data. Otherwise NULL. */
1492 static struct value
*
1493 desc_bounds (struct value
*arr
)
1495 struct type
*type
= ada_check_typedef (value_type (arr
));
1497 if (is_thin_pntr (type
))
1499 struct type
*bounds_type
=
1500 desc_bounds_type (thin_descriptor_type (type
));
1503 if (bounds_type
== NULL
)
1504 error (_("Bad GNAT array descriptor"));
1506 /* NOTE: The following calculation is not really kosher, but
1507 since desc_type is an XVE-encoded type (and shouldn't be),
1508 the correct calculation is a real pain. FIXME (and fix GCC). */
1509 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1510 addr
= value_as_long (arr
);
1512 addr
= value_address (arr
);
1515 value_from_longest (lookup_pointer_type (bounds_type
),
1516 addr
- TYPE_LENGTH (bounds_type
));
1519 else if (is_thick_pntr (type
))
1521 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1522 _("Bad GNAT array descriptor"));
1523 struct type
*p_bounds_type
= value_type (p_bounds
);
1526 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1528 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1530 if (TYPE_STUB (target_type
))
1531 p_bounds
= value_cast (lookup_pointer_type
1532 (ada_check_typedef (target_type
)),
1536 error (_("Bad GNAT array descriptor"));
1544 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1545 position of the field containing the address of the bounds data. */
1548 fat_pntr_bounds_bitpos (struct type
*type
)
1550 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1553 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1554 size of the field containing the address of the bounds data. */
1557 fat_pntr_bounds_bitsize (struct type
*type
)
1559 type
= desc_base_type (type
);
1561 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1562 return TYPE_FIELD_BITSIZE (type
, 1);
1564 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1567 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1568 pointer to one, the type of its array data (a array-with-no-bounds type);
1569 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1572 static struct type
*
1573 desc_data_target_type (struct type
*type
)
1575 type
= desc_base_type (type
);
1577 /* NOTE: The following is bogus; see comment in desc_bounds. */
1578 if (is_thin_pntr (type
))
1579 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1580 else if (is_thick_pntr (type
))
1582 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1585 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1586 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1592 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1595 static struct value
*
1596 desc_data (struct value
*arr
)
1598 struct type
*type
= value_type (arr
);
1600 if (is_thin_pntr (type
))
1601 return thin_data_pntr (arr
);
1602 else if (is_thick_pntr (type
))
1603 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1604 _("Bad GNAT array descriptor"));
1610 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1611 position of the field containing the address of the data. */
1614 fat_pntr_data_bitpos (struct type
*type
)
1616 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1619 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1620 size of the field containing the address of the data. */
1623 fat_pntr_data_bitsize (struct type
*type
)
1625 type
= desc_base_type (type
);
1627 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1628 return TYPE_FIELD_BITSIZE (type
, 0);
1630 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1633 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1634 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1635 bound, if WHICH is 1. The first bound is I=1. */
1637 static struct value
*
1638 desc_one_bound (struct value
*bounds
, int i
, int which
)
1640 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1641 _("Bad GNAT array descriptor bounds"));
1644 /* If BOUNDS is an array-bounds structure type, return the bit position
1645 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1646 bound, if WHICH is 1. The first bound is I=1. */
1649 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1651 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1654 /* If BOUNDS is an array-bounds structure type, return the bit field size
1655 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1656 bound, if WHICH is 1. The first bound is I=1. */
1659 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1661 type
= desc_base_type (type
);
1663 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1664 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1666 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1669 /* If TYPE is the type of an array-bounds structure, the type of its
1670 Ith bound (numbering from 1). Otherwise, NULL. */
1672 static struct type
*
1673 desc_index_type (struct type
*type
, int i
)
1675 type
= desc_base_type (type
);
1677 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1678 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1683 /* The number of index positions in the array-bounds type TYPE.
1684 Return 0 if TYPE is NULL. */
1687 desc_arity (struct type
*type
)
1689 type
= desc_base_type (type
);
1692 return TYPE_NFIELDS (type
) / 2;
1696 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1697 an array descriptor type (representing an unconstrained array
1701 ada_is_direct_array_type (struct type
*type
)
1705 type
= ada_check_typedef (type
);
1706 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1707 || ada_is_array_descriptor_type (type
));
1710 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1714 ada_is_array_type (struct type
*type
)
1717 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1718 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1719 type
= TYPE_TARGET_TYPE (type
);
1720 return ada_is_direct_array_type (type
);
1723 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1726 ada_is_simple_array_type (struct type
*type
)
1730 type
= ada_check_typedef (type
);
1731 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1732 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1733 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1736 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1739 ada_is_array_descriptor_type (struct type
*type
)
1741 struct type
*data_type
= desc_data_target_type (type
);
1745 type
= ada_check_typedef (type
);
1746 return (data_type
!= NULL
1747 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1748 && desc_arity (desc_bounds_type (type
)) > 0);
1751 /* Non-zero iff type is a partially mal-formed GNAT array
1752 descriptor. FIXME: This is to compensate for some problems with
1753 debugging output from GNAT. Re-examine periodically to see if it
1757 ada_is_bogus_array_descriptor (struct type
*type
)
1761 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1762 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1763 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1764 && !ada_is_array_descriptor_type (type
);
1768 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1769 (fat pointer) returns the type of the array data described---specifically,
1770 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1771 in from the descriptor; otherwise, they are left unspecified. If
1772 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1773 returns NULL. The result is simply the type of ARR if ARR is not
1776 ada_type_of_array (struct value
*arr
, int bounds
)
1778 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1779 return decode_constrained_packed_array_type (value_type (arr
));
1781 if (!ada_is_array_descriptor_type (value_type (arr
)))
1782 return value_type (arr
);
1786 struct type
*array_type
=
1787 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1789 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1790 TYPE_FIELD_BITSIZE (array_type
, 0) =
1791 decode_packed_array_bitsize (value_type (arr
));
1797 struct type
*elt_type
;
1799 struct value
*descriptor
;
1801 elt_type
= ada_array_element_type (value_type (arr
), -1);
1802 arity
= ada_array_arity (value_type (arr
));
1804 if (elt_type
== NULL
|| arity
== 0)
1805 return ada_check_typedef (value_type (arr
));
1807 descriptor
= desc_bounds (arr
);
1808 if (value_as_long (descriptor
) == 0)
1812 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1813 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1814 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1815 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1818 create_range_type (range_type
, value_type (low
),
1819 longest_to_int (value_as_long (low
)),
1820 longest_to_int (value_as_long (high
)));
1821 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1823 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1824 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1825 decode_packed_array_bitsize (value_type (arr
));
1828 return lookup_pointer_type (elt_type
);
1832 /* If ARR does not represent an array, returns ARR unchanged.
1833 Otherwise, returns either a standard GDB array with bounds set
1834 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1835 GDB array. Returns NULL if ARR is a null fat pointer. */
1838 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1840 if (ada_is_array_descriptor_type (value_type (arr
)))
1842 struct type
*arrType
= ada_type_of_array (arr
, 1);
1844 if (arrType
== NULL
)
1846 return value_cast (arrType
, value_copy (desc_data (arr
)));
1848 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1849 return decode_constrained_packed_array (arr
);
1854 /* If ARR does not represent an array, returns ARR unchanged.
1855 Otherwise, returns a standard GDB array describing ARR (which may
1856 be ARR itself if it already is in the proper form). */
1859 ada_coerce_to_simple_array (struct value
*arr
)
1861 if (ada_is_array_descriptor_type (value_type (arr
)))
1863 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1866 error (_("Bounds unavailable for null array pointer."));
1867 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1868 return value_ind (arrVal
);
1870 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1871 return decode_constrained_packed_array (arr
);
1876 /* If TYPE represents a GNAT array type, return it translated to an
1877 ordinary GDB array type (possibly with BITSIZE fields indicating
1878 packing). For other types, is the identity. */
1881 ada_coerce_to_simple_array_type (struct type
*type
)
1883 if (ada_is_constrained_packed_array_type (type
))
1884 return decode_constrained_packed_array_type (type
);
1886 if (ada_is_array_descriptor_type (type
))
1887 return ada_check_typedef (desc_data_target_type (type
));
1892 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1895 ada_is_packed_array_type (struct type
*type
)
1899 type
= desc_base_type (type
);
1900 type
= ada_check_typedef (type
);
1902 ada_type_name (type
) != NULL
1903 && strstr (ada_type_name (type
), "___XP") != NULL
;
1906 /* Non-zero iff TYPE represents a standard GNAT constrained
1907 packed-array type. */
1910 ada_is_constrained_packed_array_type (struct type
*type
)
1912 return ada_is_packed_array_type (type
)
1913 && !ada_is_array_descriptor_type (type
);
1916 /* Non-zero iff TYPE represents an array descriptor for a
1917 unconstrained packed-array type. */
1920 ada_is_unconstrained_packed_array_type (struct type
*type
)
1922 return ada_is_packed_array_type (type
)
1923 && ada_is_array_descriptor_type (type
);
1926 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1927 return the size of its elements in bits. */
1930 decode_packed_array_bitsize (struct type
*type
)
1936 /* Access to arrays implemented as fat pointers are encoded as a typedef
1937 of the fat pointer type. We need the name of the fat pointer type
1938 to do the decoding, so strip the typedef layer. */
1939 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1940 type
= ada_typedef_target_type (type
);
1942 raw_name
= ada_type_name (ada_check_typedef (type
));
1944 raw_name
= ada_type_name (desc_base_type (type
));
1949 tail
= strstr (raw_name
, "___XP");
1950 gdb_assert (tail
!= NULL
);
1952 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1955 (_("could not understand bit size information on packed array"));
1962 /* Given that TYPE is a standard GDB array type with all bounds filled
1963 in, and that the element size of its ultimate scalar constituents
1964 (that is, either its elements, or, if it is an array of arrays, its
1965 elements' elements, etc.) is *ELT_BITS, return an identical type,
1966 but with the bit sizes of its elements (and those of any
1967 constituent arrays) recorded in the BITSIZE components of its
1968 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1971 static struct type
*
1972 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
1974 struct type
*new_elt_type
;
1975 struct type
*new_type
;
1976 LONGEST low_bound
, high_bound
;
1978 type
= ada_check_typedef (type
);
1979 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1982 new_type
= alloc_type_copy (type
);
1984 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1986 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1987 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1988 TYPE_NAME (new_type
) = ada_type_name (type
);
1990 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1991 &low_bound
, &high_bound
) < 0)
1992 low_bound
= high_bound
= 0;
1993 if (high_bound
< low_bound
)
1994 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1997 *elt_bits
*= (high_bound
- low_bound
+ 1);
1998 TYPE_LENGTH (new_type
) =
1999 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2002 TYPE_FIXED_INSTANCE (new_type
) = 1;
2006 /* The array type encoded by TYPE, where
2007 ada_is_constrained_packed_array_type (TYPE). */
2009 static struct type
*
2010 decode_constrained_packed_array_type (struct type
*type
)
2012 char *raw_name
= ada_type_name (ada_check_typedef (type
));
2015 struct type
*shadow_type
;
2019 raw_name
= ada_type_name (desc_base_type (type
));
2024 name
= (char *) alloca (strlen (raw_name
) + 1);
2025 tail
= strstr (raw_name
, "___XP");
2026 type
= desc_base_type (type
);
2028 memcpy (name
, raw_name
, tail
- raw_name
);
2029 name
[tail
- raw_name
] = '\000';
2031 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2033 if (shadow_type
== NULL
)
2035 lim_warning (_("could not find bounds information on packed array"));
2038 CHECK_TYPEDEF (shadow_type
);
2040 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2042 lim_warning (_("could not understand bounds "
2043 "information on packed array"));
2047 bits
= decode_packed_array_bitsize (type
);
2048 return constrained_packed_array_type (shadow_type
, &bits
);
2051 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2052 array, returns a simple array that denotes that array. Its type is a
2053 standard GDB array type except that the BITSIZEs of the array
2054 target types are set to the number of bits in each element, and the
2055 type length is set appropriately. */
2057 static struct value
*
2058 decode_constrained_packed_array (struct value
*arr
)
2062 arr
= ada_coerce_ref (arr
);
2064 /* If our value is a pointer, then dererence it. Make sure that
2065 this operation does not cause the target type to be fixed, as
2066 this would indirectly cause this array to be decoded. The rest
2067 of the routine assumes that the array hasn't been decoded yet,
2068 so we use the basic "value_ind" routine to perform the dereferencing,
2069 as opposed to using "ada_value_ind". */
2070 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
2071 arr
= value_ind (arr
);
2073 type
= decode_constrained_packed_array_type (value_type (arr
));
2076 error (_("can't unpack array"));
2080 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2081 && ada_is_modular_type (value_type (arr
)))
2083 /* This is a (right-justified) modular type representing a packed
2084 array with no wrapper. In order to interpret the value through
2085 the (left-justified) packed array type we just built, we must
2086 first left-justify it. */
2087 int bit_size
, bit_pos
;
2090 mod
= ada_modulus (value_type (arr
)) - 1;
2097 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2098 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2099 bit_pos
/ HOST_CHAR_BIT
,
2100 bit_pos
% HOST_CHAR_BIT
,
2105 return coerce_unspec_val_to_type (arr
, type
);
2109 /* The value of the element of packed array ARR at the ARITY indices
2110 given in IND. ARR must be a simple array. */
2112 static struct value
*
2113 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2116 int bits
, elt_off
, bit_off
;
2117 long elt_total_bit_offset
;
2118 struct type
*elt_type
;
2122 elt_total_bit_offset
= 0;
2123 elt_type
= ada_check_typedef (value_type (arr
));
2124 for (i
= 0; i
< arity
; i
+= 1)
2126 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2127 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2129 (_("attempt to do packed indexing of "
2130 "something other than a packed array"));
2133 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2134 LONGEST lowerbound
, upperbound
;
2137 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2139 lim_warning (_("don't know bounds of array"));
2140 lowerbound
= upperbound
= 0;
2143 idx
= pos_atr (ind
[i
]);
2144 if (idx
< lowerbound
|| idx
> upperbound
)
2145 lim_warning (_("packed array index %ld out of bounds"),
2147 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2148 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2149 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2152 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2153 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2155 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2160 /* Non-zero iff TYPE includes negative integer values. */
2163 has_negatives (struct type
*type
)
2165 switch (TYPE_CODE (type
))
2170 return !TYPE_UNSIGNED (type
);
2171 case TYPE_CODE_RANGE
:
2172 return TYPE_LOW_BOUND (type
) < 0;
2177 /* Create a new value of type TYPE from the contents of OBJ starting
2178 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2179 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2180 assigning through the result will set the field fetched from.
2181 VALADDR is ignored unless OBJ is NULL, in which case,
2182 VALADDR+OFFSET must address the start of storage containing the
2183 packed value. The value returned in this case is never an lval.
2184 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2187 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2188 long offset
, int bit_offset
, int bit_size
,
2192 int src
, /* Index into the source area */
2193 targ
, /* Index into the target area */
2194 srcBitsLeft
, /* Number of source bits left to move */
2195 nsrc
, ntarg
, /* Number of source and target bytes */
2196 unusedLS
, /* Number of bits in next significant
2197 byte of source that are unused */
2198 accumSize
; /* Number of meaningful bits in accum */
2199 unsigned char *bytes
; /* First byte containing data to unpack */
2200 unsigned char *unpacked
;
2201 unsigned long accum
; /* Staging area for bits being transferred */
2203 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2204 /* Transmit bytes from least to most significant; delta is the direction
2205 the indices move. */
2206 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2208 type
= ada_check_typedef (type
);
2212 v
= allocate_value (type
);
2213 bytes
= (unsigned char *) (valaddr
+ offset
);
2215 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2218 value_address (obj
) + offset
);
2219 bytes
= (unsigned char *) alloca (len
);
2220 read_memory (value_address (v
), bytes
, len
);
2224 v
= allocate_value (type
);
2225 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2232 set_value_component_location (v
, obj
);
2233 new_addr
= value_address (obj
) + offset
;
2234 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2235 set_value_bitsize (v
, bit_size
);
2236 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2239 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2241 set_value_address (v
, new_addr
);
2244 set_value_bitsize (v
, bit_size
);
2245 unpacked
= (unsigned char *) value_contents (v
);
2247 srcBitsLeft
= bit_size
;
2249 ntarg
= TYPE_LENGTH (type
);
2253 memset (unpacked
, 0, TYPE_LENGTH (type
));
2256 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2259 if (has_negatives (type
)
2260 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2264 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2267 switch (TYPE_CODE (type
))
2269 case TYPE_CODE_ARRAY
:
2270 case TYPE_CODE_UNION
:
2271 case TYPE_CODE_STRUCT
:
2272 /* Non-scalar values must be aligned at a byte boundary... */
2274 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2275 /* ... And are placed at the beginning (most-significant) bytes
2277 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2282 targ
= TYPE_LENGTH (type
) - 1;
2288 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2291 unusedLS
= bit_offset
;
2294 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2301 /* Mask for removing bits of the next source byte that are not
2302 part of the value. */
2303 unsigned int unusedMSMask
=
2304 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2306 /* Sign-extend bits for this byte. */
2307 unsigned int signMask
= sign
& ~unusedMSMask
;
2310 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2311 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2312 if (accumSize
>= HOST_CHAR_BIT
)
2314 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2315 accumSize
-= HOST_CHAR_BIT
;
2316 accum
>>= HOST_CHAR_BIT
;
2320 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2327 accum
|= sign
<< accumSize
;
2328 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2329 accumSize
-= HOST_CHAR_BIT
;
2330 accum
>>= HOST_CHAR_BIT
;
2338 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2339 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2342 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2343 int src_offset
, int n
, int bits_big_endian_p
)
2345 unsigned int accum
, mask
;
2346 int accum_bits
, chunk_size
;
2348 target
+= targ_offset
/ HOST_CHAR_BIT
;
2349 targ_offset
%= HOST_CHAR_BIT
;
2350 source
+= src_offset
/ HOST_CHAR_BIT
;
2351 src_offset
%= HOST_CHAR_BIT
;
2352 if (bits_big_endian_p
)
2354 accum
= (unsigned char) *source
;
2356 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2362 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2363 accum_bits
+= HOST_CHAR_BIT
;
2365 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2368 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2369 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2372 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2374 accum_bits
-= chunk_size
;
2381 accum
= (unsigned char) *source
>> src_offset
;
2383 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2387 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2388 accum_bits
+= HOST_CHAR_BIT
;
2390 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2393 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2394 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2396 accum_bits
-= chunk_size
;
2397 accum
>>= chunk_size
;
2404 /* Store the contents of FROMVAL into the location of TOVAL.
2405 Return a new value with the location of TOVAL and contents of
2406 FROMVAL. Handles assignment into packed fields that have
2407 floating-point or non-scalar types. */
2409 static struct value
*
2410 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2412 struct type
*type
= value_type (toval
);
2413 int bits
= value_bitsize (toval
);
2415 toval
= ada_coerce_ref (toval
);
2416 fromval
= ada_coerce_ref (fromval
);
2418 if (ada_is_direct_array_type (value_type (toval
)))
2419 toval
= ada_coerce_to_simple_array (toval
);
2420 if (ada_is_direct_array_type (value_type (fromval
)))
2421 fromval
= ada_coerce_to_simple_array (fromval
);
2423 if (!deprecated_value_modifiable (toval
))
2424 error (_("Left operand of assignment is not a modifiable lvalue."));
2426 if (VALUE_LVAL (toval
) == lval_memory
2428 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2429 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2431 int len
= (value_bitpos (toval
)
2432 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2434 char *buffer
= (char *) alloca (len
);
2436 CORE_ADDR to_addr
= value_address (toval
);
2438 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2439 fromval
= value_cast (type
, fromval
);
2441 read_memory (to_addr
, buffer
, len
);
2442 from_size
= value_bitsize (fromval
);
2444 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2445 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2446 move_bits (buffer
, value_bitpos (toval
),
2447 value_contents (fromval
), from_size
- bits
, bits
, 1);
2449 move_bits (buffer
, value_bitpos (toval
),
2450 value_contents (fromval
), 0, bits
, 0);
2451 write_memory (to_addr
, buffer
, len
);
2452 observer_notify_memory_changed (to_addr
, len
, buffer
);
2454 val
= value_copy (toval
);
2455 memcpy (value_contents_raw (val
), value_contents (fromval
),
2456 TYPE_LENGTH (type
));
2457 deprecated_set_value_type (val
, type
);
2462 return value_assign (toval
, fromval
);
2466 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2467 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2468 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2469 * COMPONENT, and not the inferior's memory. The current contents
2470 * of COMPONENT are ignored. */
2472 value_assign_to_component (struct value
*container
, struct value
*component
,
2475 LONGEST offset_in_container
=
2476 (LONGEST
) (value_address (component
) - value_address (container
));
2477 int bit_offset_in_container
=
2478 value_bitpos (component
) - value_bitpos (container
);
2481 val
= value_cast (value_type (component
), val
);
2483 if (value_bitsize (component
) == 0)
2484 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2486 bits
= value_bitsize (component
);
2488 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2489 move_bits (value_contents_writeable (container
) + offset_in_container
,
2490 value_bitpos (container
) + bit_offset_in_container
,
2491 value_contents (val
),
2492 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2495 move_bits (value_contents_writeable (container
) + offset_in_container
,
2496 value_bitpos (container
) + bit_offset_in_container
,
2497 value_contents (val
), 0, bits
, 0);
2500 /* The value of the element of array ARR at the ARITY indices given in IND.
2501 ARR may be either a simple array, GNAT array descriptor, or pointer
2505 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2509 struct type
*elt_type
;
2511 elt
= ada_coerce_to_simple_array (arr
);
2513 elt_type
= ada_check_typedef (value_type (elt
));
2514 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2515 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2516 return value_subscript_packed (elt
, arity
, ind
);
2518 for (k
= 0; k
< arity
; k
+= 1)
2520 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2521 error (_("too many subscripts (%d expected)"), k
);
2522 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2527 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2528 value of the element of *ARR at the ARITY indices given in
2529 IND. Does not read the entire array into memory. */
2531 static struct value
*
2532 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2537 for (k
= 0; k
< arity
; k
+= 1)
2541 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2542 error (_("too many subscripts (%d expected)"), k
);
2543 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2545 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2546 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2547 type
= TYPE_TARGET_TYPE (type
);
2550 return value_ind (arr
);
2553 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2554 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2555 elements starting at index LOW. The lower bound of this array is LOW, as
2557 static struct value
*
2558 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2561 CORE_ADDR base
= value_as_address (array_ptr
)
2562 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type
)))
2563 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2564 struct type
*index_type
=
2565 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2567 struct type
*slice_type
=
2568 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2570 return value_at_lazy (slice_type
, base
);
2574 static struct value
*
2575 ada_value_slice (struct value
*array
, int low
, int high
)
2577 struct type
*type
= value_type (array
);
2578 struct type
*index_type
=
2579 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2580 struct type
*slice_type
=
2581 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2583 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2586 /* If type is a record type in the form of a standard GNAT array
2587 descriptor, returns the number of dimensions for type. If arr is a
2588 simple array, returns the number of "array of"s that prefix its
2589 type designation. Otherwise, returns 0. */
2592 ada_array_arity (struct type
*type
)
2599 type
= desc_base_type (type
);
2602 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2603 return desc_arity (desc_bounds_type (type
));
2605 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2608 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2614 /* If TYPE is a record type in the form of a standard GNAT array
2615 descriptor or a simple array type, returns the element type for
2616 TYPE after indexing by NINDICES indices, or by all indices if
2617 NINDICES is -1. Otherwise, returns NULL. */
2620 ada_array_element_type (struct type
*type
, int nindices
)
2622 type
= desc_base_type (type
);
2624 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2627 struct type
*p_array_type
;
2629 p_array_type
= desc_data_target_type (type
);
2631 k
= ada_array_arity (type
);
2635 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2636 if (nindices
>= 0 && k
> nindices
)
2638 while (k
> 0 && p_array_type
!= NULL
)
2640 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2643 return p_array_type
;
2645 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2647 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2649 type
= TYPE_TARGET_TYPE (type
);
2658 /* The type of nth index in arrays of given type (n numbering from 1).
2659 Does not examine memory. Throws an error if N is invalid or TYPE
2660 is not an array type. NAME is the name of the Ada attribute being
2661 evaluated ('range, 'first, 'last, or 'length); it is used in building
2662 the error message. */
2664 static struct type
*
2665 ada_index_type (struct type
*type
, int n
, const char *name
)
2667 struct type
*result_type
;
2669 type
= desc_base_type (type
);
2671 if (n
< 0 || n
> ada_array_arity (type
))
2672 error (_("invalid dimension number to '%s"), name
);
2674 if (ada_is_simple_array_type (type
))
2678 for (i
= 1; i
< n
; i
+= 1)
2679 type
= TYPE_TARGET_TYPE (type
);
2680 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2681 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2682 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2683 perhaps stabsread.c would make more sense. */
2684 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2689 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2690 if (result_type
== NULL
)
2691 error (_("attempt to take bound of something that is not an array"));
2697 /* Given that arr is an array type, returns the lower bound of the
2698 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2699 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2700 array-descriptor type. It works for other arrays with bounds supplied
2701 by run-time quantities other than discriminants. */
2704 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2706 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2709 gdb_assert (which
== 0 || which
== 1);
2711 if (ada_is_constrained_packed_array_type (arr_type
))
2712 arr_type
= decode_constrained_packed_array_type (arr_type
);
2714 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2715 return (LONGEST
) - which
;
2717 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2718 type
= TYPE_TARGET_TYPE (arr_type
);
2723 for (i
= n
; i
> 1; i
--)
2724 elt_type
= TYPE_TARGET_TYPE (type
);
2726 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2727 ada_fixup_array_indexes_type (index_type_desc
);
2728 if (index_type_desc
!= NULL
)
2729 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2732 index_type
= TYPE_INDEX_TYPE (elt_type
);
2735 (LONGEST
) (which
== 0
2736 ? ada_discrete_type_low_bound (index_type
)
2737 : ada_discrete_type_high_bound (index_type
));
2740 /* Given that arr is an array value, returns the lower bound of the
2741 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2742 WHICH is 1. This routine will also work for arrays with bounds
2743 supplied by run-time quantities other than discriminants. */
2746 ada_array_bound (struct value
*arr
, int n
, int which
)
2748 struct type
*arr_type
= value_type (arr
);
2750 if (ada_is_constrained_packed_array_type (arr_type
))
2751 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2752 else if (ada_is_simple_array_type (arr_type
))
2753 return ada_array_bound_from_type (arr_type
, n
, which
);
2755 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2758 /* Given that arr is an array value, returns the length of the
2759 nth index. This routine will also work for arrays with bounds
2760 supplied by run-time quantities other than discriminants.
2761 Does not work for arrays indexed by enumeration types with representation
2762 clauses at the moment. */
2765 ada_array_length (struct value
*arr
, int n
)
2767 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2769 if (ada_is_constrained_packed_array_type (arr_type
))
2770 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2772 if (ada_is_simple_array_type (arr_type
))
2773 return (ada_array_bound_from_type (arr_type
, n
, 1)
2774 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2776 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2777 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2780 /* An empty array whose type is that of ARR_TYPE (an array type),
2781 with bounds LOW to LOW-1. */
2783 static struct value
*
2784 empty_array (struct type
*arr_type
, int low
)
2786 struct type
*index_type
=
2787 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2789 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2791 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2795 /* Name resolution */
2797 /* The "decoded" name for the user-definable Ada operator corresponding
2801 ada_decoded_op_name (enum exp_opcode op
)
2805 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2807 if (ada_opname_table
[i
].op
== op
)
2808 return ada_opname_table
[i
].decoded
;
2810 error (_("Could not find operator name for opcode"));
2814 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2815 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2816 undefined namespace) and converts operators that are
2817 user-defined into appropriate function calls. If CONTEXT_TYPE is
2818 non-null, it provides a preferred result type [at the moment, only
2819 type void has any effect---causing procedures to be preferred over
2820 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2821 return type is preferred. May change (expand) *EXP. */
2824 resolve (struct expression
**expp
, int void_context_p
)
2826 struct type
*context_type
= NULL
;
2830 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2832 resolve_subexp (expp
, &pc
, 1, context_type
);
2835 /* Resolve the operator of the subexpression beginning at
2836 position *POS of *EXPP. "Resolving" consists of replacing
2837 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2838 with their resolutions, replacing built-in operators with
2839 function calls to user-defined operators, where appropriate, and,
2840 when DEPROCEDURE_P is non-zero, converting function-valued variables
2841 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2842 are as in ada_resolve, above. */
2844 static struct value
*
2845 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2846 struct type
*context_type
)
2850 struct expression
*exp
; /* Convenience: == *expp. */
2851 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2852 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2853 int nargs
; /* Number of operands. */
2860 /* Pass one: resolve operands, saving their types and updating *pos,
2865 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2866 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2871 resolve_subexp (expp
, pos
, 0, NULL
);
2873 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2878 resolve_subexp (expp
, pos
, 0, NULL
);
2883 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2886 case OP_ATR_MODULUS
:
2896 case TERNOP_IN_RANGE
:
2897 case BINOP_IN_BOUNDS
:
2903 case OP_DISCRETE_RANGE
:
2905 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2914 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2916 resolve_subexp (expp
, pos
, 1, NULL
);
2918 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2935 case BINOP_LOGICAL_AND
:
2936 case BINOP_LOGICAL_OR
:
2937 case BINOP_BITWISE_AND
:
2938 case BINOP_BITWISE_IOR
:
2939 case BINOP_BITWISE_XOR
:
2942 case BINOP_NOTEQUAL
:
2949 case BINOP_SUBSCRIPT
:
2957 case UNOP_LOGICAL_NOT
:
2973 case OP_INTERNALVAR
:
2983 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2986 case STRUCTOP_STRUCT
:
2987 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3000 error (_("Unexpected operator during name resolution"));
3003 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3004 for (i
= 0; i
< nargs
; i
+= 1)
3005 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3009 /* Pass two: perform any resolution on principal operator. */
3016 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3018 struct ada_symbol_info
*candidates
;
3022 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3023 (exp
->elts
[pc
+ 2].symbol
),
3024 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3027 if (n_candidates
> 1)
3029 /* Types tend to get re-introduced locally, so if there
3030 are any local symbols that are not types, first filter
3033 for (j
= 0; j
< n_candidates
; j
+= 1)
3034 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3039 case LOC_REGPARM_ADDR
:
3047 if (j
< n_candidates
)
3050 while (j
< n_candidates
)
3052 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3054 candidates
[j
] = candidates
[n_candidates
- 1];
3063 if (n_candidates
== 0)
3064 error (_("No definition found for %s"),
3065 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3066 else if (n_candidates
== 1)
3068 else if (deprocedure_p
3069 && !is_nonfunction (candidates
, n_candidates
))
3071 i
= ada_resolve_function
3072 (candidates
, n_candidates
, NULL
, 0,
3073 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3076 error (_("Could not find a match for %s"),
3077 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3081 printf_filtered (_("Multiple matches for %s\n"),
3082 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3083 user_select_syms (candidates
, n_candidates
, 1);
3087 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3088 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3089 if (innermost_block
== NULL
3090 || contained_in (candidates
[i
].block
, innermost_block
))
3091 innermost_block
= candidates
[i
].block
;
3095 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3098 replace_operator_with_call (expp
, pc
, 0, 0,
3099 exp
->elts
[pc
+ 2].symbol
,
3100 exp
->elts
[pc
+ 1].block
);
3107 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3108 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3110 struct ada_symbol_info
*candidates
;
3114 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3115 (exp
->elts
[pc
+ 5].symbol
),
3116 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3118 if (n_candidates
== 1)
3122 i
= ada_resolve_function
3123 (candidates
, n_candidates
,
3125 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3128 error (_("Could not find a match for %s"),
3129 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3132 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3133 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3134 if (innermost_block
== NULL
3135 || contained_in (candidates
[i
].block
, innermost_block
))
3136 innermost_block
= candidates
[i
].block
;
3147 case BINOP_BITWISE_AND
:
3148 case BINOP_BITWISE_IOR
:
3149 case BINOP_BITWISE_XOR
:
3151 case BINOP_NOTEQUAL
:
3159 case UNOP_LOGICAL_NOT
:
3161 if (possible_user_operator_p (op
, argvec
))
3163 struct ada_symbol_info
*candidates
;
3167 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3168 (struct block
*) NULL
, VAR_DOMAIN
,
3170 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3171 ada_decoded_op_name (op
), NULL
);
3175 replace_operator_with_call (expp
, pc
, nargs
, 1,
3176 candidates
[i
].sym
, candidates
[i
].block
);
3187 return evaluate_subexp_type (exp
, pos
);
3190 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3191 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3193 /* The term "match" here is rather loose. The match is heuristic and
3197 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3199 ftype
= ada_check_typedef (ftype
);
3200 atype
= ada_check_typedef (atype
);
3202 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3203 ftype
= TYPE_TARGET_TYPE (ftype
);
3204 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3205 atype
= TYPE_TARGET_TYPE (atype
);
3207 switch (TYPE_CODE (ftype
))
3210 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3212 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3213 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3214 TYPE_TARGET_TYPE (atype
), 0);
3217 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3219 case TYPE_CODE_ENUM
:
3220 case TYPE_CODE_RANGE
:
3221 switch (TYPE_CODE (atype
))
3224 case TYPE_CODE_ENUM
:
3225 case TYPE_CODE_RANGE
:
3231 case TYPE_CODE_ARRAY
:
3232 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3233 || ada_is_array_descriptor_type (atype
));
3235 case TYPE_CODE_STRUCT
:
3236 if (ada_is_array_descriptor_type (ftype
))
3237 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3238 || ada_is_array_descriptor_type (atype
));
3240 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3241 && !ada_is_array_descriptor_type (atype
));
3243 case TYPE_CODE_UNION
:
3245 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3249 /* Return non-zero if the formals of FUNC "sufficiently match" the
3250 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3251 may also be an enumeral, in which case it is treated as a 0-
3252 argument function. */
3255 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3258 struct type
*func_type
= SYMBOL_TYPE (func
);
3260 if (SYMBOL_CLASS (func
) == LOC_CONST
3261 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3262 return (n_actuals
== 0);
3263 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3266 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3269 for (i
= 0; i
< n_actuals
; i
+= 1)
3271 if (actuals
[i
] == NULL
)
3275 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3277 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3279 if (!ada_type_match (ftype
, atype
, 1))
3286 /* False iff function type FUNC_TYPE definitely does not produce a value
3287 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3288 FUNC_TYPE is not a valid function type with a non-null return type
3289 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3292 return_match (struct type
*func_type
, struct type
*context_type
)
3294 struct type
*return_type
;
3296 if (func_type
== NULL
)
3299 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3300 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3302 return_type
= base_type (func_type
);
3303 if (return_type
== NULL
)
3306 context_type
= base_type (context_type
);
3308 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3309 return context_type
== NULL
|| return_type
== context_type
;
3310 else if (context_type
== NULL
)
3311 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3313 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3317 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3318 function (if any) that matches the types of the NARGS arguments in
3319 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3320 that returns that type, then eliminate matches that don't. If
3321 CONTEXT_TYPE is void and there is at least one match that does not
3322 return void, eliminate all matches that do.
3324 Asks the user if there is more than one match remaining. Returns -1
3325 if there is no such symbol or none is selected. NAME is used
3326 solely for messages. May re-arrange and modify SYMS in
3327 the process; the index returned is for the modified vector. */
3330 ada_resolve_function (struct ada_symbol_info syms
[],
3331 int nsyms
, struct value
**args
, int nargs
,
3332 const char *name
, struct type
*context_type
)
3336 int m
; /* Number of hits */
3339 /* In the first pass of the loop, we only accept functions matching
3340 context_type. If none are found, we add a second pass of the loop
3341 where every function is accepted. */
3342 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3344 for (k
= 0; k
< nsyms
; k
+= 1)
3346 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3348 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3349 && (fallback
|| return_match (type
, context_type
)))
3361 printf_filtered (_("Multiple matches for %s\n"), name
);
3362 user_select_syms (syms
, m
, 1);
3368 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3369 in a listing of choices during disambiguation (see sort_choices, below).
3370 The idea is that overloadings of a subprogram name from the
3371 same package should sort in their source order. We settle for ordering
3372 such symbols by their trailing number (__N or $N). */
3375 encoded_ordered_before (char *N0
, char *N1
)
3379 else if (N0
== NULL
)
3385 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3387 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3389 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3390 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3395 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3398 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3400 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3401 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3403 return (strcmp (N0
, N1
) < 0);
3407 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3411 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3415 for (i
= 1; i
< nsyms
; i
+= 1)
3417 struct ada_symbol_info sym
= syms
[i
];
3420 for (j
= i
- 1; j
>= 0; j
-= 1)
3422 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3423 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3425 syms
[j
+ 1] = syms
[j
];
3431 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3432 by asking the user (if necessary), returning the number selected,
3433 and setting the first elements of SYMS items. Error if no symbols
3436 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3437 to be re-integrated one of these days. */
3440 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3443 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3445 int first_choice
= (max_results
== 1) ? 1 : 2;
3446 const char *select_mode
= multiple_symbols_select_mode ();
3448 if (max_results
< 1)
3449 error (_("Request to select 0 symbols!"));
3453 if (select_mode
== multiple_symbols_cancel
)
3455 canceled because the command is ambiguous\n\
3456 See set/show multiple-symbol."));
3458 /* If select_mode is "all", then return all possible symbols.
3459 Only do that if more than one symbol can be selected, of course.
3460 Otherwise, display the menu as usual. */
3461 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3464 printf_unfiltered (_("[0] cancel\n"));
3465 if (max_results
> 1)
3466 printf_unfiltered (_("[1] all\n"));
3468 sort_choices (syms
, nsyms
);
3470 for (i
= 0; i
< nsyms
; i
+= 1)
3472 if (syms
[i
].sym
== NULL
)
3475 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3477 struct symtab_and_line sal
=
3478 find_function_start_sal (syms
[i
].sym
, 1);
3480 if (sal
.symtab
== NULL
)
3481 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3483 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3486 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3487 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3488 sal
.symtab
->filename
, sal
.line
);
3494 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3495 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3496 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3497 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3499 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3500 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3502 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3503 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3504 else if (is_enumeral
3505 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3507 printf_unfiltered (("[%d] "), i
+ first_choice
);
3508 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3510 printf_unfiltered (_("'(%s) (enumeral)\n"),
3511 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3513 else if (symtab
!= NULL
)
3514 printf_unfiltered (is_enumeral
3515 ? _("[%d] %s in %s (enumeral)\n")
3516 : _("[%d] %s at %s:?\n"),
3518 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3521 printf_unfiltered (is_enumeral
3522 ? _("[%d] %s (enumeral)\n")
3523 : _("[%d] %s at ?\n"),
3525 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3529 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3532 for (i
= 0; i
< n_chosen
; i
+= 1)
3533 syms
[i
] = syms
[chosen
[i
]];
3538 /* Read and validate a set of numeric choices from the user in the
3539 range 0 .. N_CHOICES-1. Place the results in increasing
3540 order in CHOICES[0 .. N-1], and return N.
3542 The user types choices as a sequence of numbers on one line
3543 separated by blanks, encoding them as follows:
3545 + A choice of 0 means to cancel the selection, throwing an error.
3546 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3547 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3549 The user is not allowed to choose more than MAX_RESULTS values.
3551 ANNOTATION_SUFFIX, if present, is used to annotate the input
3552 prompts (for use with the -f switch). */
3555 get_selections (int *choices
, int n_choices
, int max_results
,
3556 int is_all_choice
, char *annotation_suffix
)
3561 int first_choice
= is_all_choice
? 2 : 1;
3563 prompt
= getenv ("PS2");
3567 args
= command_line_input (prompt
, 0, annotation_suffix
);
3570 error_no_arg (_("one or more choice numbers"));
3574 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3575 order, as given in args. Choices are validated. */
3581 while (isspace (*args
))
3583 if (*args
== '\0' && n_chosen
== 0)
3584 error_no_arg (_("one or more choice numbers"));
3585 else if (*args
== '\0')
3588 choice
= strtol (args
, &args2
, 10);
3589 if (args
== args2
|| choice
< 0
3590 || choice
> n_choices
+ first_choice
- 1)
3591 error (_("Argument must be choice number"));
3595 error (_("cancelled"));
3597 if (choice
< first_choice
)
3599 n_chosen
= n_choices
;
3600 for (j
= 0; j
< n_choices
; j
+= 1)
3604 choice
-= first_choice
;
3606 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3610 if (j
< 0 || choice
!= choices
[j
])
3614 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3615 choices
[k
+ 1] = choices
[k
];
3616 choices
[j
+ 1] = choice
;
3621 if (n_chosen
> max_results
)
3622 error (_("Select no more than %d of the above"), max_results
);
3627 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3628 on the function identified by SYM and BLOCK, and taking NARGS
3629 arguments. Update *EXPP as needed to hold more space. */
3632 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3633 int oplen
, struct symbol
*sym
,
3634 struct block
*block
)
3636 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3637 symbol, -oplen for operator being replaced). */
3638 struct expression
*newexp
= (struct expression
*)
3639 xmalloc (sizeof (struct expression
)
3640 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3641 struct expression
*exp
= *expp
;
3643 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3644 newexp
->language_defn
= exp
->language_defn
;
3645 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3646 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3647 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3649 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3650 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3652 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3653 newexp
->elts
[pc
+ 4].block
= block
;
3654 newexp
->elts
[pc
+ 5].symbol
= sym
;
3660 /* Type-class predicates */
3662 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3666 numeric_type_p (struct type
*type
)
3672 switch (TYPE_CODE (type
))
3677 case TYPE_CODE_RANGE
:
3678 return (type
== TYPE_TARGET_TYPE (type
)
3679 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3686 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3689 integer_type_p (struct type
*type
)
3695 switch (TYPE_CODE (type
))
3699 case TYPE_CODE_RANGE
:
3700 return (type
== TYPE_TARGET_TYPE (type
)
3701 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3708 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3711 scalar_type_p (struct type
*type
)
3717 switch (TYPE_CODE (type
))
3720 case TYPE_CODE_RANGE
:
3721 case TYPE_CODE_ENUM
:
3730 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3733 discrete_type_p (struct type
*type
)
3739 switch (TYPE_CODE (type
))
3742 case TYPE_CODE_RANGE
:
3743 case TYPE_CODE_ENUM
:
3744 case TYPE_CODE_BOOL
:
3752 /* Returns non-zero if OP with operands in the vector ARGS could be
3753 a user-defined function. Errs on the side of pre-defined operators
3754 (i.e., result 0). */
3757 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3759 struct type
*type0
=
3760 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3761 struct type
*type1
=
3762 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3776 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3780 case BINOP_BITWISE_AND
:
3781 case BINOP_BITWISE_IOR
:
3782 case BINOP_BITWISE_XOR
:
3783 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3786 case BINOP_NOTEQUAL
:
3791 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3794 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3797 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3801 case UNOP_LOGICAL_NOT
:
3803 return (!numeric_type_p (type0
));
3812 1. In the following, we assume that a renaming type's name may
3813 have an ___XD suffix. It would be nice if this went away at some
3815 2. We handle both the (old) purely type-based representation of
3816 renamings and the (new) variable-based encoding. At some point,
3817 it is devoutly to be hoped that the former goes away
3818 (FIXME: hilfinger-2007-07-09).
3819 3. Subprogram renamings are not implemented, although the XRS
3820 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3822 /* If SYM encodes a renaming,
3824 <renaming> renames <renamed entity>,
3826 sets *LEN to the length of the renamed entity's name,
3827 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3828 the string describing the subcomponent selected from the renamed
3829 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3830 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3831 are undefined). Otherwise, returns a value indicating the category
3832 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3833 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3834 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3835 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3836 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3837 may be NULL, in which case they are not assigned.
3839 [Currently, however, GCC does not generate subprogram renamings.] */
3841 enum ada_renaming_category
3842 ada_parse_renaming (struct symbol
*sym
,
3843 const char **renamed_entity
, int *len
,
3844 const char **renaming_expr
)
3846 enum ada_renaming_category kind
;
3851 return ADA_NOT_RENAMING
;
3852 switch (SYMBOL_CLASS (sym
))
3855 return ADA_NOT_RENAMING
;
3857 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3858 renamed_entity
, len
, renaming_expr
);
3862 case LOC_OPTIMIZED_OUT
:
3863 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3865 return ADA_NOT_RENAMING
;
3869 kind
= ADA_OBJECT_RENAMING
;
3873 kind
= ADA_EXCEPTION_RENAMING
;
3877 kind
= ADA_PACKAGE_RENAMING
;
3881 kind
= ADA_SUBPROGRAM_RENAMING
;
3885 return ADA_NOT_RENAMING
;
3889 if (renamed_entity
!= NULL
)
3890 *renamed_entity
= info
;
3891 suffix
= strstr (info
, "___XE");
3892 if (suffix
== NULL
|| suffix
== info
)
3893 return ADA_NOT_RENAMING
;
3895 *len
= strlen (info
) - strlen (suffix
);
3897 if (renaming_expr
!= NULL
)
3898 *renaming_expr
= suffix
;
3902 /* Assuming TYPE encodes a renaming according to the old encoding in
3903 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3904 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3905 ADA_NOT_RENAMING otherwise. */
3906 static enum ada_renaming_category
3907 parse_old_style_renaming (struct type
*type
,
3908 const char **renamed_entity
, int *len
,
3909 const char **renaming_expr
)
3911 enum ada_renaming_category kind
;
3916 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3917 || TYPE_NFIELDS (type
) != 1)
3918 return ADA_NOT_RENAMING
;
3920 name
= type_name_no_tag (type
);
3922 return ADA_NOT_RENAMING
;
3924 name
= strstr (name
, "___XR");
3926 return ADA_NOT_RENAMING
;
3931 kind
= ADA_OBJECT_RENAMING
;
3934 kind
= ADA_EXCEPTION_RENAMING
;
3937 kind
= ADA_PACKAGE_RENAMING
;
3940 kind
= ADA_SUBPROGRAM_RENAMING
;
3943 return ADA_NOT_RENAMING
;
3946 info
= TYPE_FIELD_NAME (type
, 0);
3948 return ADA_NOT_RENAMING
;
3949 if (renamed_entity
!= NULL
)
3950 *renamed_entity
= info
;
3951 suffix
= strstr (info
, "___XE");
3952 if (renaming_expr
!= NULL
)
3953 *renaming_expr
= suffix
+ 5;
3954 if (suffix
== NULL
|| suffix
== info
)
3955 return ADA_NOT_RENAMING
;
3957 *len
= suffix
- info
;
3963 /* Evaluation: Function Calls */
3965 /* Return an lvalue containing the value VAL. This is the identity on
3966 lvalues, and otherwise has the side-effect of allocating memory
3967 in the inferior where a copy of the value contents is copied. */
3969 static struct value
*
3970 ensure_lval (struct value
*val
)
3972 if (VALUE_LVAL (val
) == not_lval
3973 || VALUE_LVAL (val
) == lval_internalvar
)
3975 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3976 const CORE_ADDR addr
=
3977 value_as_long (value_allocate_space_in_inferior (len
));
3979 set_value_address (val
, addr
);
3980 VALUE_LVAL (val
) = lval_memory
;
3981 write_memory (addr
, value_contents (val
), len
);
3987 /* Return the value ACTUAL, converted to be an appropriate value for a
3988 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3989 allocating any necessary descriptors (fat pointers), or copies of
3990 values not residing in memory, updating it as needed. */
3993 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
3995 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3996 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3997 struct type
*formal_target
=
3998 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3999 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4000 struct type
*actual_target
=
4001 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4002 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4004 if (ada_is_array_descriptor_type (formal_target
)
4005 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4006 return make_array_descriptor (formal_type
, actual
);
4007 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4008 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4010 struct value
*result
;
4012 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4013 && ada_is_array_descriptor_type (actual_target
))
4014 result
= desc_data (actual
);
4015 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4017 if (VALUE_LVAL (actual
) != lval_memory
)
4021 actual_type
= ada_check_typedef (value_type (actual
));
4022 val
= allocate_value (actual_type
);
4023 memcpy ((char *) value_contents_raw (val
),
4024 (char *) value_contents (actual
),
4025 TYPE_LENGTH (actual_type
));
4026 actual
= ensure_lval (val
);
4028 result
= value_addr (actual
);
4032 return value_cast_pointers (formal_type
, result
);
4034 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4035 return ada_value_ind (actual
);
4040 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4041 type TYPE. This is usually an inefficient no-op except on some targets
4042 (such as AVR) where the representation of a pointer and an address
4046 value_pointer (struct value
*value
, struct type
*type
)
4048 struct gdbarch
*gdbarch
= get_type_arch (type
);
4049 unsigned len
= TYPE_LENGTH (type
);
4050 gdb_byte
*buf
= alloca (len
);
4053 addr
= value_address (value
);
4054 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4055 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4060 /* Push a descriptor of type TYPE for array value ARR on the stack at
4061 *SP, updating *SP to reflect the new descriptor. Return either
4062 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4063 to-descriptor type rather than a descriptor type), a struct value *
4064 representing a pointer to this descriptor. */
4066 static struct value
*
4067 make_array_descriptor (struct type
*type
, struct value
*arr
)
4069 struct type
*bounds_type
= desc_bounds_type (type
);
4070 struct type
*desc_type
= desc_base_type (type
);
4071 struct value
*descriptor
= allocate_value (desc_type
);
4072 struct value
*bounds
= allocate_value (bounds_type
);
4075 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4078 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4079 ada_array_bound (arr
, i
, 0),
4080 desc_bound_bitpos (bounds_type
, i
, 0),
4081 desc_bound_bitsize (bounds_type
, i
, 0));
4082 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4083 ada_array_bound (arr
, i
, 1),
4084 desc_bound_bitpos (bounds_type
, i
, 1),
4085 desc_bound_bitsize (bounds_type
, i
, 1));
4088 bounds
= ensure_lval (bounds
);
4090 modify_field (value_type (descriptor
),
4091 value_contents_writeable (descriptor
),
4092 value_pointer (ensure_lval (arr
),
4093 TYPE_FIELD_TYPE (desc_type
, 0)),
4094 fat_pntr_data_bitpos (desc_type
),
4095 fat_pntr_data_bitsize (desc_type
));
4097 modify_field (value_type (descriptor
),
4098 value_contents_writeable (descriptor
),
4099 value_pointer (bounds
,
4100 TYPE_FIELD_TYPE (desc_type
, 1)),
4101 fat_pntr_bounds_bitpos (desc_type
),
4102 fat_pntr_bounds_bitsize (desc_type
));
4104 descriptor
= ensure_lval (descriptor
);
4106 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4107 return value_addr (descriptor
);
4112 /* Dummy definitions for an experimental caching module that is not
4113 * used in the public sources. */
4116 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4117 struct symbol
**sym
, struct block
**block
)
4123 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4124 struct block
*block
)
4130 /* Return the result of a standard (literal, C-like) lookup of NAME in
4131 given DOMAIN, visible from lexical block BLOCK. */
4133 static struct symbol
*
4134 standard_lookup (const char *name
, const struct block
*block
,
4139 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4141 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4142 cache_symbol (name
, domain
, sym
, block_found
);
4147 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4148 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4149 since they contend in overloading in the same way. */
4151 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4155 for (i
= 0; i
< n
; i
+= 1)
4156 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4157 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4158 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4164 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4165 struct types. Otherwise, they may not. */
4168 equiv_types (struct type
*type0
, struct type
*type1
)
4172 if (type0
== NULL
|| type1
== NULL
4173 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4175 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4176 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4177 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4178 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4184 /* True iff SYM0 represents the same entity as SYM1, or one that is
4185 no more defined than that of SYM1. */
4188 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4192 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4193 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4196 switch (SYMBOL_CLASS (sym0
))
4202 struct type
*type0
= SYMBOL_TYPE (sym0
);
4203 struct type
*type1
= SYMBOL_TYPE (sym1
);
4204 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4205 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4206 int len0
= strlen (name0
);
4209 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4210 && (equiv_types (type0
, type1
)
4211 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4212 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4215 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4216 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4222 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4223 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4226 add_defn_to_vec (struct obstack
*obstackp
,
4228 struct block
*block
)
4231 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4233 /* Do not try to complete stub types, as the debugger is probably
4234 already scanning all symbols matching a certain name at the
4235 time when this function is called. Trying to replace the stub
4236 type by its associated full type will cause us to restart a scan
4237 which may lead to an infinite recursion. Instead, the client
4238 collecting the matching symbols will end up collecting several
4239 matches, with at least one of them complete. It can then filter
4240 out the stub ones if needed. */
4242 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4244 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4246 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4248 prevDefns
[i
].sym
= sym
;
4249 prevDefns
[i
].block
= block
;
4255 struct ada_symbol_info info
;
4259 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4263 /* Number of ada_symbol_info structures currently collected in
4264 current vector in *OBSTACKP. */
4267 num_defns_collected (struct obstack
*obstackp
)
4269 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4272 /* Vector of ada_symbol_info structures currently collected in current
4273 vector in *OBSTACKP. If FINISH, close off the vector and return
4274 its final address. */
4276 static struct ada_symbol_info
*
4277 defns_collected (struct obstack
*obstackp
, int finish
)
4280 return obstack_finish (obstackp
);
4282 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4285 /* Return a minimal symbol matching NAME according to Ada decoding
4286 rules. Returns NULL if there is no such minimal symbol. Names
4287 prefixed with "standard__" are handled specially: "standard__" is
4288 first stripped off, and only static and global symbols are searched. */
4290 struct minimal_symbol
*
4291 ada_lookup_simple_minsym (const char *name
)
4293 struct objfile
*objfile
;
4294 struct minimal_symbol
*msymbol
;
4297 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4299 name
+= sizeof ("standard__") - 1;
4303 wild_match
= (strstr (name
, "__") == NULL
);
4305 ALL_MSYMBOLS (objfile
, msymbol
)
4307 if (match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4308 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4315 /* For all subprograms that statically enclose the subprogram of the
4316 selected frame, add symbols matching identifier NAME in DOMAIN
4317 and their blocks to the list of data in OBSTACKP, as for
4318 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4322 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4323 const char *name
, domain_enum
namespace,
4328 /* True if TYPE is definitely an artificial type supplied to a symbol
4329 for which no debugging information was given in the symbol file. */
4332 is_nondebugging_type (struct type
*type
)
4334 char *name
= ada_type_name (type
);
4336 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4339 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4340 duplicate other symbols in the list (The only case I know of where
4341 this happens is when object files containing stabs-in-ecoff are
4342 linked with files containing ordinary ecoff debugging symbols (or no
4343 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4344 Returns the number of items in the modified list. */
4347 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4356 /* If two symbols have the same name and one of them is a stub type,
4357 the get rid of the stub. */
4359 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4360 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4362 for (j
= 0; j
< nsyms
; j
++)
4365 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4366 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4367 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4368 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4373 /* Two symbols with the same name, same class and same address
4374 should be identical. */
4376 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4377 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4378 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4380 for (j
= 0; j
< nsyms
; j
+= 1)
4383 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4384 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4385 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4386 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4387 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4388 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4395 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4396 syms
[j
- 1] = syms
[j
];
4405 /* Given a type that corresponds to a renaming entity, use the type name
4406 to extract the scope (package name or function name, fully qualified,
4407 and following the GNAT encoding convention) where this renaming has been
4408 defined. The string returned needs to be deallocated after use. */
4411 xget_renaming_scope (struct type
*renaming_type
)
4413 /* The renaming types adhere to the following convention:
4414 <scope>__<rename>___<XR extension>.
4415 So, to extract the scope, we search for the "___XR" extension,
4416 and then backtrack until we find the first "__". */
4418 const char *name
= type_name_no_tag (renaming_type
);
4419 char *suffix
= strstr (name
, "___XR");
4424 /* Now, backtrack a bit until we find the first "__". Start looking
4425 at suffix - 3, as the <rename> part is at least one character long. */
4427 for (last
= suffix
- 3; last
> name
; last
--)
4428 if (last
[0] == '_' && last
[1] == '_')
4431 /* Make a copy of scope and return it. */
4433 scope_len
= last
- name
;
4434 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4436 strncpy (scope
, name
, scope_len
);
4437 scope
[scope_len
] = '\0';
4442 /* Return nonzero if NAME corresponds to a package name. */
4445 is_package_name (const char *name
)
4447 /* Here, We take advantage of the fact that no symbols are generated
4448 for packages, while symbols are generated for each function.
4449 So the condition for NAME represent a package becomes equivalent
4450 to NAME not existing in our list of symbols. There is only one
4451 small complication with library-level functions (see below). */
4455 /* If it is a function that has not been defined at library level,
4456 then we should be able to look it up in the symbols. */
4457 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4460 /* Library-level function names start with "_ada_". See if function
4461 "_ada_" followed by NAME can be found. */
4463 /* Do a quick check that NAME does not contain "__", since library-level
4464 functions names cannot contain "__" in them. */
4465 if (strstr (name
, "__") != NULL
)
4468 fun_name
= xstrprintf ("_ada_%s", name
);
4470 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4473 /* Return nonzero if SYM corresponds to a renaming entity that is
4474 not visible from FUNCTION_NAME. */
4477 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4481 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4484 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4486 make_cleanup (xfree
, scope
);
4488 /* If the rename has been defined in a package, then it is visible. */
4489 if (is_package_name (scope
))
4492 /* Check that the rename is in the current function scope by checking
4493 that its name starts with SCOPE. */
4495 /* If the function name starts with "_ada_", it means that it is
4496 a library-level function. Strip this prefix before doing the
4497 comparison, as the encoding for the renaming does not contain
4499 if (strncmp (function_name
, "_ada_", 5) == 0)
4502 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4505 /* Remove entries from SYMS that corresponds to a renaming entity that
4506 is not visible from the function associated with CURRENT_BLOCK or
4507 that is superfluous due to the presence of more specific renaming
4508 information. Places surviving symbols in the initial entries of
4509 SYMS and returns the number of surviving symbols.
4512 First, in cases where an object renaming is implemented as a
4513 reference variable, GNAT may produce both the actual reference
4514 variable and the renaming encoding. In this case, we discard the
4517 Second, GNAT emits a type following a specified encoding for each renaming
4518 entity. Unfortunately, STABS currently does not support the definition
4519 of types that are local to a given lexical block, so all renamings types
4520 are emitted at library level. As a consequence, if an application
4521 contains two renaming entities using the same name, and a user tries to
4522 print the value of one of these entities, the result of the ada symbol
4523 lookup will also contain the wrong renaming type.
4525 This function partially covers for this limitation by attempting to
4526 remove from the SYMS list renaming symbols that should be visible
4527 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4528 method with the current information available. The implementation
4529 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4531 - When the user tries to print a rename in a function while there
4532 is another rename entity defined in a package: Normally, the
4533 rename in the function has precedence over the rename in the
4534 package, so the latter should be removed from the list. This is
4535 currently not the case.
4537 - This function will incorrectly remove valid renames if
4538 the CURRENT_BLOCK corresponds to a function which symbol name
4539 has been changed by an "Export" pragma. As a consequence,
4540 the user will be unable to print such rename entities. */
4543 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4544 int nsyms
, const struct block
*current_block
)
4546 struct symbol
*current_function
;
4547 char *current_function_name
;
4549 int is_new_style_renaming
;
4551 /* If there is both a renaming foo___XR... encoded as a variable and
4552 a simple variable foo in the same block, discard the latter.
4553 First, zero out such symbols, then compress. */
4554 is_new_style_renaming
= 0;
4555 for (i
= 0; i
< nsyms
; i
+= 1)
4557 struct symbol
*sym
= syms
[i
].sym
;
4558 struct block
*block
= syms
[i
].block
;
4562 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4564 name
= SYMBOL_LINKAGE_NAME (sym
);
4565 suffix
= strstr (name
, "___XR");
4569 int name_len
= suffix
- name
;
4572 is_new_style_renaming
= 1;
4573 for (j
= 0; j
< nsyms
; j
+= 1)
4574 if (i
!= j
&& syms
[j
].sym
!= NULL
4575 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4577 && block
== syms
[j
].block
)
4581 if (is_new_style_renaming
)
4585 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4586 if (syms
[j
].sym
!= NULL
)
4594 /* Extract the function name associated to CURRENT_BLOCK.
4595 Abort if unable to do so. */
4597 if (current_block
== NULL
)
4600 current_function
= block_linkage_function (current_block
);
4601 if (current_function
== NULL
)
4604 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4605 if (current_function_name
== NULL
)
4608 /* Check each of the symbols, and remove it from the list if it is
4609 a type corresponding to a renaming that is out of the scope of
4610 the current block. */
4615 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4616 == ADA_OBJECT_RENAMING
4617 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4621 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4622 syms
[j
- 1] = syms
[j
];
4632 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4633 whose name and domain match NAME and DOMAIN respectively.
4634 If no match was found, then extend the search to "enclosing"
4635 routines (in other words, if we're inside a nested function,
4636 search the symbols defined inside the enclosing functions).
4638 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4641 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4642 struct block
*block
, domain_enum domain
,
4645 int block_depth
= 0;
4647 while (block
!= NULL
)
4650 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4652 /* If we found a non-function match, assume that's the one. */
4653 if (is_nonfunction (defns_collected (obstackp
, 0),
4654 num_defns_collected (obstackp
)))
4657 block
= BLOCK_SUPERBLOCK (block
);
4660 /* If no luck so far, try to find NAME as a local symbol in some lexically
4661 enclosing subprogram. */
4662 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4663 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4666 /* An object of this type is used as the user_data argument when
4667 calling the map_matching_symbols method. */
4671 struct objfile
*objfile
;
4672 struct obstack
*obstackp
;
4673 struct symbol
*arg_sym
;
4677 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4678 to a list of symbols. DATA0 is a pointer to a struct match_data *
4679 containing the obstack that collects the symbol list, the file that SYM
4680 must come from, a flag indicating whether a non-argument symbol has
4681 been found in the current block, and the last argument symbol
4682 passed in SYM within the current block (if any). When SYM is null,
4683 marking the end of a block, the argument symbol is added if no
4684 other has been found. */
4687 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
4689 struct match_data
*data
= (struct match_data
*) data0
;
4693 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
4694 add_defn_to_vec (data
->obstackp
,
4695 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
4697 data
->found_sym
= 0;
4698 data
->arg_sym
= NULL
;
4702 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4704 else if (SYMBOL_IS_ARGUMENT (sym
))
4705 data
->arg_sym
= sym
;
4708 data
->found_sym
= 1;
4709 add_defn_to_vec (data
->obstackp
,
4710 fixup_symbol_section (sym
, data
->objfile
),
4717 /* Compare STRING1 to STRING2, with results as for strcmp.
4718 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4719 implies compare_names (STRING1, STRING2) (they may differ as to
4720 what symbols compare equal). */
4723 compare_names (const char *string1
, const char *string2
)
4725 while (*string1
!= '\0' && *string2
!= '\0')
4727 if (isspace (*string1
) || isspace (*string2
))
4728 return strcmp_iw_ordered (string1
, string2
);
4729 if (*string1
!= *string2
)
4737 return strcmp_iw_ordered (string1
, string2
);
4739 if (*string2
== '\0')
4741 if (is_name_suffix (string2
))
4747 if (*string2
== '(')
4748 return strcmp_iw_ordered (string1
, string2
);
4750 return *string1
- *string2
;
4754 /* Add to OBSTACKP all non-local symbols whose name and domain match
4755 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4756 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4759 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
4760 domain_enum domain
, int global
,
4763 struct objfile
*objfile
;
4764 struct match_data data
;
4766 data
.obstackp
= obstackp
;
4767 data
.arg_sym
= NULL
;
4769 ALL_OBJFILES (objfile
)
4771 data
.objfile
= objfile
;
4774 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
4775 aux_add_nonlocal_symbols
, &data
,
4778 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
4779 aux_add_nonlocal_symbols
, &data
,
4780 full_match
, compare_names
);
4783 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
4785 ALL_OBJFILES (objfile
)
4787 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
4788 strcpy (name1
, "_ada_");
4789 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
4790 data
.objfile
= objfile
;
4791 objfile
->sf
->qf
->map_matching_symbols (name1
, domain
,
4793 aux_add_nonlocal_symbols
,
4795 full_match
, compare_names
);
4800 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4801 scope and in global scopes, returning the number of matches. Sets
4802 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4803 indicating the symbols found and the blocks and symbol tables (if
4804 any) in which they were found. This vector are transient---good only to
4805 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4806 symbol match within the nest of blocks whose innermost member is BLOCK0,
4807 is the one match returned (no other matches in that or
4808 enclosing blocks is returned). If there are any matches in or
4809 surrounding BLOCK0, then these alone are returned. Otherwise, the
4810 search extends to global and file-scope (static) symbol tables.
4811 Names prefixed with "standard__" are handled specially: "standard__"
4812 is first stripped off, and only static and global symbols are searched. */
4815 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4816 domain_enum
namespace,
4817 struct ada_symbol_info
**results
)
4820 struct block
*block
;
4826 obstack_free (&symbol_list_obstack
, NULL
);
4827 obstack_init (&symbol_list_obstack
);
4831 /* Search specified block and its superiors. */
4833 wild_match
= (strstr (name0
, "__") == NULL
);
4835 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4836 needed, but adding const will
4837 have a cascade effect. */
4839 /* Special case: If the user specifies a symbol name inside package
4840 Standard, do a non-wild matching of the symbol name without
4841 the "standard__" prefix. This was primarily introduced in order
4842 to allow the user to specifically access the standard exceptions
4843 using, for instance, Standard.Constraint_Error when Constraint_Error
4844 is ambiguous (due to the user defining its own Constraint_Error
4845 entity inside its program). */
4846 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4850 name
= name0
+ sizeof ("standard__") - 1;
4853 /* Check the non-global symbols. If we have ANY match, then we're done. */
4855 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4857 if (num_defns_collected (&symbol_list_obstack
) > 0)
4860 /* No non-global symbols found. Check our cache to see if we have
4861 already performed this search before. If we have, then return
4865 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4868 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4872 /* Search symbols from all global blocks. */
4874 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
4877 /* Now add symbols from all per-file blocks if we've gotten no hits
4878 (not strictly correct, but perhaps better than an error). */
4880 if (num_defns_collected (&symbol_list_obstack
) == 0)
4881 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
4885 ndefns
= num_defns_collected (&symbol_list_obstack
);
4886 *results
= defns_collected (&symbol_list_obstack
, 1);
4888 ndefns
= remove_extra_symbols (*results
, ndefns
);
4891 cache_symbol (name0
, namespace, NULL
, NULL
);
4893 if (ndefns
== 1 && cacheIfUnique
)
4894 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4896 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4902 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4903 domain_enum
namespace, struct block
**block_found
)
4905 struct ada_symbol_info
*candidates
;
4908 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4910 if (n_candidates
== 0)
4913 if (block_found
!= NULL
)
4914 *block_found
= candidates
[0].block
;
4916 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4919 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4920 scope and in global scopes, or NULL if none. NAME is folded and
4921 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4922 choosing the first symbol if there are multiple choices.
4923 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4924 table in which the symbol was found (in both cases, these
4925 assignments occur only if the pointers are non-null). */
4927 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4928 domain_enum
namespace, int *is_a_field_of_this
)
4930 if (is_a_field_of_this
!= NULL
)
4931 *is_a_field_of_this
= 0;
4934 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4935 block0
, namespace, NULL
);
4938 static struct symbol
*
4939 ada_lookup_symbol_nonlocal (const char *name
,
4940 const struct block
*block
,
4941 const domain_enum domain
)
4943 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
4947 /* True iff STR is a possible encoded suffix of a normal Ada name
4948 that is to be ignored for matching purposes. Suffixes of parallel
4949 names (e.g., XVE) are not included here. Currently, the possible suffixes
4950 are given by any of the regular expressions:
4952 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4953 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4954 _E[0-9]+[bs]$ [protected object entry suffixes]
4955 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4957 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4958 match is performed. This sequence is used to differentiate homonyms,
4959 is an optional part of a valid name suffix. */
4962 is_name_suffix (const char *str
)
4965 const char *matching
;
4966 const int len
= strlen (str
);
4968 /* Skip optional leading __[0-9]+. */
4970 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4973 while (isdigit (str
[0]))
4979 if (str
[0] == '.' || str
[0] == '$')
4982 while (isdigit (matching
[0]))
4984 if (matching
[0] == '\0')
4990 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4993 while (isdigit (matching
[0]))
4995 if (matching
[0] == '\0')
5000 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5001 with a N at the end. Unfortunately, the compiler uses the same
5002 convention for other internal types it creates. So treating
5003 all entity names that end with an "N" as a name suffix causes
5004 some regressions. For instance, consider the case of an enumerated
5005 type. To support the 'Image attribute, it creates an array whose
5007 Having a single character like this as a suffix carrying some
5008 information is a bit risky. Perhaps we should change the encoding
5009 to be something like "_N" instead. In the meantime, do not do
5010 the following check. */
5011 /* Protected Object Subprograms */
5012 if (len
== 1 && str
[0] == 'N')
5017 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5020 while (isdigit (matching
[0]))
5022 if ((matching
[0] == 'b' || matching
[0] == 's')
5023 && matching
[1] == '\0')
5027 /* ??? We should not modify STR directly, as we are doing below. This
5028 is fine in this case, but may become problematic later if we find
5029 that this alternative did not work, and want to try matching
5030 another one from the begining of STR. Since we modified it, we
5031 won't be able to find the begining of the string anymore! */
5035 while (str
[0] != '_' && str
[0] != '\0')
5037 if (str
[0] != 'n' && str
[0] != 'b')
5043 if (str
[0] == '\000')
5048 if (str
[1] != '_' || str
[2] == '\000')
5052 if (strcmp (str
+ 3, "JM") == 0)
5054 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5055 the LJM suffix in favor of the JM one. But we will
5056 still accept LJM as a valid suffix for a reasonable
5057 amount of time, just to allow ourselves to debug programs
5058 compiled using an older version of GNAT. */
5059 if (strcmp (str
+ 3, "LJM") == 0)
5063 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5064 || str
[4] == 'U' || str
[4] == 'P')
5066 if (str
[4] == 'R' && str
[5] != 'T')
5070 if (!isdigit (str
[2]))
5072 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5073 if (!isdigit (str
[k
]) && str
[k
] != '_')
5077 if (str
[0] == '$' && isdigit (str
[1]))
5079 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5080 if (!isdigit (str
[k
]) && str
[k
] != '_')
5087 /* Return non-zero if the string starting at NAME and ending before
5088 NAME_END contains no capital letters. */
5091 is_valid_name_for_wild_match (const char *name0
)
5093 const char *decoded_name
= ada_decode (name0
);
5096 /* If the decoded name starts with an angle bracket, it means that
5097 NAME0 does not follow the GNAT encoding format. It should then
5098 not be allowed as a possible wild match. */
5099 if (decoded_name
[0] == '<')
5102 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5103 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5109 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5110 that could start a simple name. Assumes that *NAMEP points into
5111 the string beginning at NAME0. */
5114 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5116 const char *name
= *namep
;
5126 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5129 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5134 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5135 || name
[2] == target0
))
5143 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5153 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5154 informational suffixes of NAME (i.e., for which is_name_suffix is
5155 true). Assumes that PATN is a lower-cased Ada simple name. */
5158 wild_match (const char *name
, const char *patn
)
5161 const char *name0
= name
;
5165 const char *match
= name
;
5169 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5172 if (*p
== '\0' && is_name_suffix (name
))
5173 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5175 if (name
[-1] == '_')
5178 if (!advance_wild_match (&name
, name0
, *patn
))
5183 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5184 informational suffix. */
5187 full_match (const char *sym_name
, const char *search_name
)
5189 return !match_name (sym_name
, search_name
, 0);
5193 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5194 vector *defn_symbols, updating the list of symbols in OBSTACKP
5195 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5196 OBJFILE is the section containing BLOCK.
5197 SYMTAB is recorded with each symbol added. */
5200 ada_add_block_symbols (struct obstack
*obstackp
,
5201 struct block
*block
, const char *name
,
5202 domain_enum domain
, struct objfile
*objfile
,
5205 struct dict_iterator iter
;
5206 int name_len
= strlen (name
);
5207 /* A matching argument symbol, if any. */
5208 struct symbol
*arg_sym
;
5209 /* Set true when we find a matching non-argument symbol. */
5217 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5219 sym
!= NULL
; sym
= dict_iter_match_next (name
, wild_match
, &iter
))
5221 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5222 SYMBOL_DOMAIN (sym
), domain
)
5223 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5225 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5227 else if (SYMBOL_IS_ARGUMENT (sym
))
5232 add_defn_to_vec (obstackp
,
5233 fixup_symbol_section (sym
, objfile
),
5241 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5243 sym
!= NULL
; sym
= dict_iter_match_next (name
, full_match
, &iter
))
5245 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5246 SYMBOL_DOMAIN (sym
), domain
))
5248 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5250 if (SYMBOL_IS_ARGUMENT (sym
))
5255 add_defn_to_vec (obstackp
,
5256 fixup_symbol_section (sym
, objfile
),
5264 if (!found_sym
&& arg_sym
!= NULL
)
5266 add_defn_to_vec (obstackp
,
5267 fixup_symbol_section (arg_sym
, objfile
),
5276 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5278 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5279 SYMBOL_DOMAIN (sym
), domain
))
5283 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5286 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5288 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5293 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5295 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5297 if (SYMBOL_IS_ARGUMENT (sym
))
5302 add_defn_to_vec (obstackp
,
5303 fixup_symbol_section (sym
, objfile
),
5311 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5312 They aren't parameters, right? */
5313 if (!found_sym
&& arg_sym
!= NULL
)
5315 add_defn_to_vec (obstackp
,
5316 fixup_symbol_section (arg_sym
, objfile
),
5323 /* Symbol Completion */
5325 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5326 name in a form that's appropriate for the completion. The result
5327 does not need to be deallocated, but is only good until the next call.
5329 TEXT_LEN is equal to the length of TEXT.
5330 Perform a wild match if WILD_MATCH is set.
5331 ENCODED should be set if TEXT represents the start of a symbol name
5332 in its encoded form. */
5335 symbol_completion_match (const char *sym_name
,
5336 const char *text
, int text_len
,
5337 int wild_match
, int encoded
)
5339 const int verbatim_match
= (text
[0] == '<');
5344 /* Strip the leading angle bracket. */
5349 /* First, test against the fully qualified name of the symbol. */
5351 if (strncmp (sym_name
, text
, text_len
) == 0)
5354 if (match
&& !encoded
)
5356 /* One needed check before declaring a positive match is to verify
5357 that iff we are doing a verbatim match, the decoded version
5358 of the symbol name starts with '<'. Otherwise, this symbol name
5359 is not a suitable completion. */
5360 const char *sym_name_copy
= sym_name
;
5361 int has_angle_bracket
;
5363 sym_name
= ada_decode (sym_name
);
5364 has_angle_bracket
= (sym_name
[0] == '<');
5365 match
= (has_angle_bracket
== verbatim_match
);
5366 sym_name
= sym_name_copy
;
5369 if (match
&& !verbatim_match
)
5371 /* When doing non-verbatim match, another check that needs to
5372 be done is to verify that the potentially matching symbol name
5373 does not include capital letters, because the ada-mode would
5374 not be able to understand these symbol names without the
5375 angle bracket notation. */
5378 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5383 /* Second: Try wild matching... */
5385 if (!match
&& wild_match
)
5387 /* Since we are doing wild matching, this means that TEXT
5388 may represent an unqualified symbol name. We therefore must
5389 also compare TEXT against the unqualified name of the symbol. */
5390 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5392 if (strncmp (sym_name
, text
, text_len
) == 0)
5396 /* Finally: If we found a mach, prepare the result to return. */
5402 sym_name
= add_angle_brackets (sym_name
);
5405 sym_name
= ada_decode (sym_name
);
5410 DEF_VEC_P (char_ptr
);
5412 /* A companion function to ada_make_symbol_completion_list().
5413 Check if SYM_NAME represents a symbol which name would be suitable
5414 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5415 it is appended at the end of the given string vector SV.
5417 ORIG_TEXT is the string original string from the user command
5418 that needs to be completed. WORD is the entire command on which
5419 completion should be performed. These two parameters are used to
5420 determine which part of the symbol name should be added to the
5422 if WILD_MATCH is set, then wild matching is performed.
5423 ENCODED should be set if TEXT represents a symbol name in its
5424 encoded formed (in which case the completion should also be
5428 symbol_completion_add (VEC(char_ptr
) **sv
,
5429 const char *sym_name
,
5430 const char *text
, int text_len
,
5431 const char *orig_text
, const char *word
,
5432 int wild_match
, int encoded
)
5434 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5435 wild_match
, encoded
);
5441 /* We found a match, so add the appropriate completion to the given
5444 if (word
== orig_text
)
5446 completion
= xmalloc (strlen (match
) + 5);
5447 strcpy (completion
, match
);
5449 else if (word
> orig_text
)
5451 /* Return some portion of sym_name. */
5452 completion
= xmalloc (strlen (match
) + 5);
5453 strcpy (completion
, match
+ (word
- orig_text
));
5457 /* Return some of ORIG_TEXT plus sym_name. */
5458 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5459 strncpy (completion
, word
, orig_text
- word
);
5460 completion
[orig_text
- word
] = '\0';
5461 strcat (completion
, match
);
5464 VEC_safe_push (char_ptr
, *sv
, completion
);
5467 /* An object of this type is passed as the user_data argument to the
5468 map_partial_symbol_names method. */
5469 struct add_partial_datum
5471 VEC(char_ptr
) **completions
;
5480 /* A callback for map_partial_symbol_names. */
5482 ada_add_partial_symbol_completions (const char *name
, void *user_data
)
5484 struct add_partial_datum
*data
= user_data
;
5486 symbol_completion_add (data
->completions
, name
,
5487 data
->text
, data
->text_len
, data
->text0
, data
->word
,
5488 data
->wild_match
, data
->encoded
);
5491 /* Return a list of possible symbol names completing TEXT0. The list
5492 is NULL terminated. WORD is the entire command on which completion
5496 ada_make_symbol_completion_list (char *text0
, char *word
)
5502 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5505 struct minimal_symbol
*msymbol
;
5506 struct objfile
*objfile
;
5507 struct block
*b
, *surrounding_static_block
= 0;
5509 struct dict_iterator iter
;
5511 if (text0
[0] == '<')
5513 text
= xstrdup (text0
);
5514 make_cleanup (xfree
, text
);
5515 text_len
= strlen (text
);
5521 text
= xstrdup (ada_encode (text0
));
5522 make_cleanup (xfree
, text
);
5523 text_len
= strlen (text
);
5524 for (i
= 0; i
< text_len
; i
++)
5525 text
[i
] = tolower (text
[i
]);
5527 encoded
= (strstr (text0
, "__") != NULL
);
5528 /* If the name contains a ".", then the user is entering a fully
5529 qualified entity name, and the match must not be done in wild
5530 mode. Similarly, if the user wants to complete what looks like
5531 an encoded name, the match must not be done in wild mode. */
5532 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5535 /* First, look at the partial symtab symbols. */
5537 struct add_partial_datum data
;
5539 data
.completions
= &completions
;
5541 data
.text_len
= text_len
;
5544 data
.wild_match
= wild_match
;
5545 data
.encoded
= encoded
;
5546 map_partial_symbol_names (ada_add_partial_symbol_completions
, &data
);
5549 /* At this point scan through the misc symbol vectors and add each
5550 symbol you find to the list. Eventually we want to ignore
5551 anything that isn't a text symbol (everything else will be
5552 handled by the psymtab code above). */
5554 ALL_MSYMBOLS (objfile
, msymbol
)
5557 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5558 text
, text_len
, text0
, word
, wild_match
, encoded
);
5561 /* Search upwards from currently selected frame (so that we can
5562 complete on local vars. */
5564 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5566 if (!BLOCK_SUPERBLOCK (b
))
5567 surrounding_static_block
= b
; /* For elmin of dups */
5569 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5571 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5572 text
, text_len
, text0
, word
,
5573 wild_match
, encoded
);
5577 /* Go through the symtabs and check the externs and statics for
5578 symbols which match. */
5580 ALL_SYMTABS (objfile
, s
)
5583 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5584 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5586 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5587 text
, text_len
, text0
, word
,
5588 wild_match
, encoded
);
5592 ALL_SYMTABS (objfile
, s
)
5595 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5596 /* Don't do this block twice. */
5597 if (b
== surrounding_static_block
)
5599 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5601 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5602 text
, text_len
, text0
, word
,
5603 wild_match
, encoded
);
5607 /* Append the closing NULL entry. */
5608 VEC_safe_push (char_ptr
, completions
, NULL
);
5610 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5611 return the copy. It's unfortunate that we have to make a copy
5612 of an array that we're about to destroy, but there is nothing much
5613 we can do about it. Fortunately, it's typically not a very large
5616 const size_t completions_size
=
5617 VEC_length (char_ptr
, completions
) * sizeof (char *);
5618 char **result
= malloc (completions_size
);
5620 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5622 VEC_free (char_ptr
, completions
);
5629 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5630 for tagged types. */
5633 ada_is_dispatch_table_ptr_type (struct type
*type
)
5637 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5640 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5644 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5647 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5648 to be invisible to users. */
5651 ada_is_ignored_field (struct type
*type
, int field_num
)
5653 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5656 /* Check the name of that field. */
5658 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5660 /* Anonymous field names should not be printed.
5661 brobecker/2007-02-20: I don't think this can actually happen
5662 but we don't want to print the value of annonymous fields anyway. */
5666 /* A field named "_parent" is internally generated by GNAT for
5667 tagged types, and should not be printed either. */
5668 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5672 /* If this is the dispatch table of a tagged type, then ignore. */
5673 if (ada_is_tagged_type (type
, 1)
5674 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5677 /* Not a special field, so it should not be ignored. */
5681 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5682 pointer or reference type whose ultimate target has a tag field. */
5685 ada_is_tagged_type (struct type
*type
, int refok
)
5687 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5690 /* True iff TYPE represents the type of X'Tag */
5693 ada_is_tag_type (struct type
*type
)
5695 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5699 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5701 return (name
!= NULL
5702 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5706 /* The type of the tag on VAL. */
5709 ada_tag_type (struct value
*val
)
5711 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5714 /* The value of the tag on VAL. */
5717 ada_value_tag (struct value
*val
)
5719 return ada_value_struct_elt (val
, "_tag", 0);
5722 /* The value of the tag on the object of type TYPE whose contents are
5723 saved at VALADDR, if it is non-null, or is at memory address
5726 static struct value
*
5727 value_tag_from_contents_and_address (struct type
*type
,
5728 const gdb_byte
*valaddr
,
5731 int tag_byte_offset
;
5732 struct type
*tag_type
;
5734 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5737 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5739 : valaddr
+ tag_byte_offset
);
5740 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5742 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5747 static struct type
*
5748 type_from_tag (struct value
*tag
)
5750 const char *type_name
= ada_tag_name (tag
);
5752 if (type_name
!= NULL
)
5753 return ada_find_any_type (ada_encode (type_name
));
5764 static int ada_tag_name_1 (void *);
5765 static int ada_tag_name_2 (struct tag_args
*);
5767 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5768 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5769 The value stored in ARGS->name is valid until the next call to
5773 ada_tag_name_1 (void *args0
)
5775 struct tag_args
*args
= (struct tag_args
*) args0
;
5776 static char name
[1024];
5781 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5783 return ada_tag_name_2 (args
);
5784 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5787 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5788 for (p
= name
; *p
!= '\0'; p
+= 1)
5795 /* Return the "ada__tags__type_specific_data" type. */
5797 static struct type
*
5798 ada_get_tsd_type (struct inferior
*inf
)
5800 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
5802 if (data
->tsd_type
== 0)
5803 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
5804 return data
->tsd_type
;
5807 /* Utility function for ada_tag_name_1 that tries the second
5808 representation for the dispatch table (in which there is no
5809 explicit 'tsd' field in the referent of the tag pointer, and instead
5810 the tsd pointer is stored just before the dispatch table. */
5813 ada_tag_name_2 (struct tag_args
*args
)
5815 struct type
*info_type
;
5816 static char name
[1024];
5818 struct value
*val
, *valp
;
5821 info_type
= ada_get_tsd_type (current_inferior());
5822 if (info_type
== NULL
)
5824 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5825 valp
= value_cast (info_type
, args
->tag
);
5828 val
= value_ind (value_ptradd (valp
, -1));
5831 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5834 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5835 for (p
= name
; *p
!= '\0'; p
+= 1)
5842 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5846 ada_tag_name (struct value
*tag
)
5848 struct tag_args args
;
5850 if (!ada_is_tag_type (value_type (tag
)))
5854 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5858 /* The parent type of TYPE, or NULL if none. */
5861 ada_parent_type (struct type
*type
)
5865 type
= ada_check_typedef (type
);
5867 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5870 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5871 if (ada_is_parent_field (type
, i
))
5873 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5875 /* If the _parent field is a pointer, then dereference it. */
5876 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5877 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5878 /* If there is a parallel XVS type, get the actual base type. */
5879 parent_type
= ada_get_base_type (parent_type
);
5881 return ada_check_typedef (parent_type
);
5887 /* True iff field number FIELD_NUM of structure type TYPE contains the
5888 parent-type (inherited) fields of a derived type. Assumes TYPE is
5889 a structure type with at least FIELD_NUM+1 fields. */
5892 ada_is_parent_field (struct type
*type
, int field_num
)
5894 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5896 return (name
!= NULL
5897 && (strncmp (name
, "PARENT", 6) == 0
5898 || strncmp (name
, "_parent", 7) == 0));
5901 /* True iff field number FIELD_NUM of structure type TYPE is a
5902 transparent wrapper field (which should be silently traversed when doing
5903 field selection and flattened when printing). Assumes TYPE is a
5904 structure type with at least FIELD_NUM+1 fields. Such fields are always
5908 ada_is_wrapper_field (struct type
*type
, int field_num
)
5910 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5912 return (name
!= NULL
5913 && (strncmp (name
, "PARENT", 6) == 0
5914 || strcmp (name
, "REP") == 0
5915 || strncmp (name
, "_parent", 7) == 0
5916 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5919 /* True iff field number FIELD_NUM of structure or union type TYPE
5920 is a variant wrapper. Assumes TYPE is a structure type with at least
5921 FIELD_NUM+1 fields. */
5924 ada_is_variant_part (struct type
*type
, int field_num
)
5926 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5928 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5929 || (is_dynamic_field (type
, field_num
)
5930 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5931 == TYPE_CODE_UNION
)));
5934 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5935 whose discriminants are contained in the record type OUTER_TYPE,
5936 returns the type of the controlling discriminant for the variant.
5937 May return NULL if the type could not be found. */
5940 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5942 char *name
= ada_variant_discrim_name (var_type
);
5944 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5947 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5948 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5949 represents a 'when others' clause; otherwise 0. */
5952 ada_is_others_clause (struct type
*type
, int field_num
)
5954 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5956 return (name
!= NULL
&& name
[0] == 'O');
5959 /* Assuming that TYPE0 is the type of the variant part of a record,
5960 returns the name of the discriminant controlling the variant.
5961 The value is valid until the next call to ada_variant_discrim_name. */
5964 ada_variant_discrim_name (struct type
*type0
)
5966 static char *result
= NULL
;
5967 static size_t result_len
= 0;
5970 const char *discrim_end
;
5971 const char *discrim_start
;
5973 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5974 type
= TYPE_TARGET_TYPE (type0
);
5978 name
= ada_type_name (type
);
5980 if (name
== NULL
|| name
[0] == '\000')
5983 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5986 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5989 if (discrim_end
== name
)
5992 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5995 if (discrim_start
== name
+ 1)
5997 if ((discrim_start
> name
+ 3
5998 && strncmp (discrim_start
- 3, "___", 3) == 0)
5999 || discrim_start
[-1] == '.')
6003 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6004 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6005 result
[discrim_end
- discrim_start
] = '\0';
6009 /* Scan STR for a subtype-encoded number, beginning at position K.
6010 Put the position of the character just past the number scanned in
6011 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6012 Return 1 if there was a valid number at the given position, and 0
6013 otherwise. A "subtype-encoded" number consists of the absolute value
6014 in decimal, followed by the letter 'm' to indicate a negative number.
6015 Assumes 0m does not occur. */
6018 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6022 if (!isdigit (str
[k
]))
6025 /* Do it the hard way so as not to make any assumption about
6026 the relationship of unsigned long (%lu scan format code) and
6029 while (isdigit (str
[k
]))
6031 RU
= RU
* 10 + (str
[k
] - '0');
6038 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6044 /* NOTE on the above: Technically, C does not say what the results of
6045 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6046 number representable as a LONGEST (although either would probably work
6047 in most implementations). When RU>0, the locution in the then branch
6048 above is always equivalent to the negative of RU. */
6055 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6056 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6057 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6060 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6062 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6076 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6086 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6087 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6089 if (val
>= L
&& val
<= U
)
6101 /* FIXME: Lots of redundancy below. Try to consolidate. */
6103 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6104 ARG_TYPE, extract and return the value of one of its (non-static)
6105 fields. FIELDNO says which field. Differs from value_primitive_field
6106 only in that it can handle packed values of arbitrary type. */
6108 static struct value
*
6109 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6110 struct type
*arg_type
)
6114 arg_type
= ada_check_typedef (arg_type
);
6115 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6117 /* Handle packed fields. */
6119 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6121 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6122 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6124 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6125 offset
+ bit_pos
/ 8,
6126 bit_pos
% 8, bit_size
, type
);
6129 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6132 /* Find field with name NAME in object of type TYPE. If found,
6133 set the following for each argument that is non-null:
6134 - *FIELD_TYPE_P to the field's type;
6135 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6136 an object of that type;
6137 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6138 - *BIT_SIZE_P to its size in bits if the field is packed, and
6140 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6141 fields up to but not including the desired field, or by the total
6142 number of fields if not found. A NULL value of NAME never
6143 matches; the function just counts visible fields in this case.
6145 Returns 1 if found, 0 otherwise. */
6148 find_struct_field (char *name
, struct type
*type
, int offset
,
6149 struct type
**field_type_p
,
6150 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6155 type
= ada_check_typedef (type
);
6157 if (field_type_p
!= NULL
)
6158 *field_type_p
= NULL
;
6159 if (byte_offset_p
!= NULL
)
6161 if (bit_offset_p
!= NULL
)
6163 if (bit_size_p
!= NULL
)
6166 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6168 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6169 int fld_offset
= offset
+ bit_pos
/ 8;
6170 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6172 if (t_field_name
== NULL
)
6175 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6177 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6179 if (field_type_p
!= NULL
)
6180 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6181 if (byte_offset_p
!= NULL
)
6182 *byte_offset_p
= fld_offset
;
6183 if (bit_offset_p
!= NULL
)
6184 *bit_offset_p
= bit_pos
% 8;
6185 if (bit_size_p
!= NULL
)
6186 *bit_size_p
= bit_size
;
6189 else if (ada_is_wrapper_field (type
, i
))
6191 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6192 field_type_p
, byte_offset_p
, bit_offset_p
,
6193 bit_size_p
, index_p
))
6196 else if (ada_is_variant_part (type
, i
))
6198 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6201 struct type
*field_type
6202 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6204 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6206 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6208 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6209 field_type_p
, byte_offset_p
,
6210 bit_offset_p
, bit_size_p
, index_p
))
6214 else if (index_p
!= NULL
)
6220 /* Number of user-visible fields in record type TYPE. */
6223 num_visible_fields (struct type
*type
)
6228 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6232 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6233 and search in it assuming it has (class) type TYPE.
6234 If found, return value, else return NULL.
6236 Searches recursively through wrapper fields (e.g., '_parent'). */
6238 static struct value
*
6239 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6244 type
= ada_check_typedef (type
);
6245 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6247 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6249 if (t_field_name
== NULL
)
6252 else if (field_name_match (t_field_name
, name
))
6253 return ada_value_primitive_field (arg
, offset
, i
, type
);
6255 else if (ada_is_wrapper_field (type
, i
))
6257 struct value
*v
= /* Do not let indent join lines here. */
6258 ada_search_struct_field (name
, arg
,
6259 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6260 TYPE_FIELD_TYPE (type
, i
));
6266 else if (ada_is_variant_part (type
, i
))
6268 /* PNH: Do we ever get here? See find_struct_field. */
6270 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6272 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6274 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6276 struct value
*v
= ada_search_struct_field
/* Force line
6279 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6280 TYPE_FIELD_TYPE (field_type
, j
));
6290 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6291 int, struct type
*);
6294 /* Return field #INDEX in ARG, where the index is that returned by
6295 * find_struct_field through its INDEX_P argument. Adjust the address
6296 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6297 * If found, return value, else return NULL. */
6299 static struct value
*
6300 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6303 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6307 /* Auxiliary function for ada_index_struct_field. Like
6308 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6311 static struct value
*
6312 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6316 type
= ada_check_typedef (type
);
6318 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6320 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6322 else if (ada_is_wrapper_field (type
, i
))
6324 struct value
*v
= /* Do not let indent join lines here. */
6325 ada_index_struct_field_1 (index_p
, arg
,
6326 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6327 TYPE_FIELD_TYPE (type
, i
));
6333 else if (ada_is_variant_part (type
, i
))
6335 /* PNH: Do we ever get here? See ada_search_struct_field,
6336 find_struct_field. */
6337 error (_("Cannot assign this kind of variant record"));
6339 else if (*index_p
== 0)
6340 return ada_value_primitive_field (arg
, offset
, i
, type
);
6347 /* Given ARG, a value of type (pointer or reference to a)*
6348 structure/union, extract the component named NAME from the ultimate
6349 target structure/union and return it as a value with its
6352 The routine searches for NAME among all members of the structure itself
6353 and (recursively) among all members of any wrapper members
6356 If NO_ERR, then simply return NULL in case of error, rather than
6360 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6362 struct type
*t
, *t1
;
6366 t1
= t
= ada_check_typedef (value_type (arg
));
6367 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6369 t1
= TYPE_TARGET_TYPE (t
);
6372 t1
= ada_check_typedef (t1
);
6373 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6375 arg
= coerce_ref (arg
);
6380 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6382 t1
= TYPE_TARGET_TYPE (t
);
6385 t1
= ada_check_typedef (t1
);
6386 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6388 arg
= value_ind (arg
);
6395 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6399 v
= ada_search_struct_field (name
, arg
, 0, t
);
6402 int bit_offset
, bit_size
, byte_offset
;
6403 struct type
*field_type
;
6406 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6407 address
= value_as_address (arg
);
6409 address
= unpack_pointer (t
, value_contents (arg
));
6411 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6412 if (find_struct_field (name
, t1
, 0,
6413 &field_type
, &byte_offset
, &bit_offset
,
6418 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6419 arg
= ada_coerce_ref (arg
);
6421 arg
= ada_value_ind (arg
);
6422 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6423 bit_offset
, bit_size
,
6427 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6431 if (v
!= NULL
|| no_err
)
6434 error (_("There is no member named %s."), name
);
6440 error (_("Attempt to extract a component of "
6441 "a value that is not a record."));
6444 /* Given a type TYPE, look up the type of the component of type named NAME.
6445 If DISPP is non-null, add its byte displacement from the beginning of a
6446 structure (pointed to by a value) of type TYPE to *DISPP (does not
6447 work for packed fields).
6449 Matches any field whose name has NAME as a prefix, possibly
6452 TYPE can be either a struct or union. If REFOK, TYPE may also
6453 be a (pointer or reference)+ to a struct or union, and the
6454 ultimate target type will be searched.
6456 Looks recursively into variant clauses and parent types.
6458 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6459 TYPE is not a type of the right kind. */
6461 static struct type
*
6462 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6463 int noerr
, int *dispp
)
6470 if (refok
&& type
!= NULL
)
6473 type
= ada_check_typedef (type
);
6474 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6475 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6477 type
= TYPE_TARGET_TYPE (type
);
6481 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6482 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6488 target_terminal_ours ();
6489 gdb_flush (gdb_stdout
);
6491 error (_("Type (null) is not a structure or union type"));
6494 /* XXX: type_sprint */
6495 fprintf_unfiltered (gdb_stderr
, _("Type "));
6496 type_print (type
, "", gdb_stderr
, -1);
6497 error (_(" is not a structure or union type"));
6502 type
= to_static_fixed_type (type
);
6504 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6506 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6510 if (t_field_name
== NULL
)
6513 else if (field_name_match (t_field_name
, name
))
6516 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6517 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6520 else if (ada_is_wrapper_field (type
, i
))
6523 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6528 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6533 else if (ada_is_variant_part (type
, i
))
6536 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6539 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6541 /* FIXME pnh 2008/01/26: We check for a field that is
6542 NOT wrapped in a struct, since the compiler sometimes
6543 generates these for unchecked variant types. Revisit
6544 if the compiler changes this practice. */
6545 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6547 if (v_field_name
!= NULL
6548 && field_name_match (v_field_name
, name
))
6549 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6551 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
6558 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6569 target_terminal_ours ();
6570 gdb_flush (gdb_stdout
);
6573 /* XXX: type_sprint */
6574 fprintf_unfiltered (gdb_stderr
, _("Type "));
6575 type_print (type
, "", gdb_stderr
, -1);
6576 error (_(" has no component named <null>"));
6580 /* XXX: type_sprint */
6581 fprintf_unfiltered (gdb_stderr
, _("Type "));
6582 type_print (type
, "", gdb_stderr
, -1);
6583 error (_(" has no component named %s"), name
);
6590 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6591 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6592 represents an unchecked union (that is, the variant part of a
6593 record that is named in an Unchecked_Union pragma). */
6596 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6598 char *discrim_name
= ada_variant_discrim_name (var_type
);
6600 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6605 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6606 within a value of type OUTER_TYPE that is stored in GDB at
6607 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6608 numbering from 0) is applicable. Returns -1 if none are. */
6611 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6612 const gdb_byte
*outer_valaddr
)
6616 char *discrim_name
= ada_variant_discrim_name (var_type
);
6617 struct value
*outer
;
6618 struct value
*discrim
;
6619 LONGEST discrim_val
;
6621 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6622 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6623 if (discrim
== NULL
)
6625 discrim_val
= value_as_long (discrim
);
6628 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6630 if (ada_is_others_clause (var_type
, i
))
6632 else if (ada_in_variant (discrim_val
, var_type
, i
))
6636 return others_clause
;
6641 /* Dynamic-Sized Records */
6643 /* Strategy: The type ostensibly attached to a value with dynamic size
6644 (i.e., a size that is not statically recorded in the debugging
6645 data) does not accurately reflect the size or layout of the value.
6646 Our strategy is to convert these values to values with accurate,
6647 conventional types that are constructed on the fly. */
6649 /* There is a subtle and tricky problem here. In general, we cannot
6650 determine the size of dynamic records without its data. However,
6651 the 'struct value' data structure, which GDB uses to represent
6652 quantities in the inferior process (the target), requires the size
6653 of the type at the time of its allocation in order to reserve space
6654 for GDB's internal copy of the data. That's why the
6655 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6656 rather than struct value*s.
6658 However, GDB's internal history variables ($1, $2, etc.) are
6659 struct value*s containing internal copies of the data that are not, in
6660 general, the same as the data at their corresponding addresses in
6661 the target. Fortunately, the types we give to these values are all
6662 conventional, fixed-size types (as per the strategy described
6663 above), so that we don't usually have to perform the
6664 'to_fixed_xxx_type' conversions to look at their values.
6665 Unfortunately, there is one exception: if one of the internal
6666 history variables is an array whose elements are unconstrained
6667 records, then we will need to create distinct fixed types for each
6668 element selected. */
6670 /* The upshot of all of this is that many routines take a (type, host
6671 address, target address) triple as arguments to represent a value.
6672 The host address, if non-null, is supposed to contain an internal
6673 copy of the relevant data; otherwise, the program is to consult the
6674 target at the target address. */
6676 /* Assuming that VAL0 represents a pointer value, the result of
6677 dereferencing it. Differs from value_ind in its treatment of
6678 dynamic-sized types. */
6681 ada_value_ind (struct value
*val0
)
6683 struct value
*val
= unwrap_value (value_ind (val0
));
6685 return ada_to_fixed_value (val
);
6688 /* The value resulting from dereferencing any "reference to"
6689 qualifiers on VAL0. */
6691 static struct value
*
6692 ada_coerce_ref (struct value
*val0
)
6694 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6696 struct value
*val
= val0
;
6698 val
= coerce_ref (val
);
6699 val
= unwrap_value (val
);
6700 return ada_to_fixed_value (val
);
6706 /* Return OFF rounded upward if necessary to a multiple of
6707 ALIGNMENT (a power of 2). */
6710 align_value (unsigned int off
, unsigned int alignment
)
6712 return (off
+ alignment
- 1) & ~(alignment
- 1);
6715 /* Return the bit alignment required for field #F of template type TYPE. */
6718 field_alignment (struct type
*type
, int f
)
6720 const char *name
= TYPE_FIELD_NAME (type
, f
);
6724 /* The field name should never be null, unless the debugging information
6725 is somehow malformed. In this case, we assume the field does not
6726 require any alignment. */
6730 len
= strlen (name
);
6732 if (!isdigit (name
[len
- 1]))
6735 if (isdigit (name
[len
- 2]))
6736 align_offset
= len
- 2;
6738 align_offset
= len
- 1;
6740 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6741 return TARGET_CHAR_BIT
;
6743 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6746 /* Find a symbol named NAME. Ignores ambiguity. */
6749 ada_find_any_symbol (const char *name
)
6753 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6754 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6757 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6761 /* Find a type named NAME. Ignores ambiguity. This routine will look
6762 solely for types defined by debug info, it will not search the GDB
6766 ada_find_any_type (const char *name
)
6768 struct symbol
*sym
= ada_find_any_symbol (name
);
6771 return SYMBOL_TYPE (sym
);
6776 /* Given NAME and an associated BLOCK, search all symbols for
6777 NAME suffixed with "___XR", which is the ``renaming'' symbol
6778 associated to NAME. Return this symbol if found, return
6782 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6786 sym
= find_old_style_renaming_symbol (name
, block
);
6791 /* Not right yet. FIXME pnh 7/20/2007. */
6792 sym
= ada_find_any_symbol (name
);
6793 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6799 static struct symbol
*
6800 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6802 const struct symbol
*function_sym
= block_linkage_function (block
);
6805 if (function_sym
!= NULL
)
6807 /* If the symbol is defined inside a function, NAME is not fully
6808 qualified. This means we need to prepend the function name
6809 as well as adding the ``___XR'' suffix to build the name of
6810 the associated renaming symbol. */
6811 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6812 /* Function names sometimes contain suffixes used
6813 for instance to qualify nested subprograms. When building
6814 the XR type name, we need to make sure that this suffix is
6815 not included. So do not include any suffix in the function
6816 name length below. */
6817 int function_name_len
= ada_name_prefix_len (function_name
);
6818 const int rename_len
= function_name_len
+ 2 /* "__" */
6819 + strlen (name
) + 6 /* "___XR\0" */ ;
6821 /* Strip the suffix if necessary. */
6822 ada_remove_trailing_digits (function_name
, &function_name_len
);
6823 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
6824 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
6826 /* Library-level functions are a special case, as GNAT adds
6827 a ``_ada_'' prefix to the function name to avoid namespace
6828 pollution. However, the renaming symbols themselves do not
6829 have this prefix, so we need to skip this prefix if present. */
6830 if (function_name_len
> 5 /* "_ada_" */
6831 && strstr (function_name
, "_ada_") == function_name
)
6834 function_name_len
-= 5;
6837 rename
= (char *) alloca (rename_len
* sizeof (char));
6838 strncpy (rename
, function_name
, function_name_len
);
6839 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
6844 const int rename_len
= strlen (name
) + 6;
6846 rename
= (char *) alloca (rename_len
* sizeof (char));
6847 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6850 return ada_find_any_symbol (rename
);
6853 /* Because of GNAT encoding conventions, several GDB symbols may match a
6854 given type name. If the type denoted by TYPE0 is to be preferred to
6855 that of TYPE1 for purposes of type printing, return non-zero;
6856 otherwise return 0. */
6859 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6863 else if (type0
== NULL
)
6865 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6867 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6869 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6871 else if (ada_is_constrained_packed_array_type (type0
))
6873 else if (ada_is_array_descriptor_type (type0
)
6874 && !ada_is_array_descriptor_type (type1
))
6878 const char *type0_name
= type_name_no_tag (type0
);
6879 const char *type1_name
= type_name_no_tag (type1
);
6881 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6882 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6888 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6889 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6892 ada_type_name (struct type
*type
)
6896 else if (TYPE_NAME (type
) != NULL
)
6897 return TYPE_NAME (type
);
6899 return TYPE_TAG_NAME (type
);
6902 /* Search the list of "descriptive" types associated to TYPE for a type
6903 whose name is NAME. */
6905 static struct type
*
6906 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
6908 struct type
*result
;
6910 /* If there no descriptive-type info, then there is no parallel type
6912 if (!HAVE_GNAT_AUX_INFO (type
))
6915 result
= TYPE_DESCRIPTIVE_TYPE (type
);
6916 while (result
!= NULL
)
6918 char *result_name
= ada_type_name (result
);
6920 if (result_name
== NULL
)
6922 warning (_("unexpected null name on descriptive type"));
6926 /* If the names match, stop. */
6927 if (strcmp (result_name
, name
) == 0)
6930 /* Otherwise, look at the next item on the list, if any. */
6931 if (HAVE_GNAT_AUX_INFO (result
))
6932 result
= TYPE_DESCRIPTIVE_TYPE (result
);
6937 /* If we didn't find a match, see whether this is a packed array. With
6938 older compilers, the descriptive type information is either absent or
6939 irrelevant when it comes to packed arrays so the above lookup fails.
6940 Fall back to using a parallel lookup by name in this case. */
6941 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
6942 return ada_find_any_type (name
);
6947 /* Find a parallel type to TYPE with the specified NAME, using the
6948 descriptive type taken from the debugging information, if available,
6949 and otherwise using the (slower) name-based method. */
6951 static struct type
*
6952 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
6954 struct type
*result
= NULL
;
6956 if (HAVE_GNAT_AUX_INFO (type
))
6957 result
= find_parallel_type_by_descriptive_type (type
, name
);
6959 result
= ada_find_any_type (name
);
6964 /* Same as above, but specify the name of the parallel type by appending
6965 SUFFIX to the name of TYPE. */
6968 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6970 char *name
, *typename
= ada_type_name (type
);
6973 if (typename
== NULL
)
6976 len
= strlen (typename
);
6978 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
6980 strcpy (name
, typename
);
6981 strcpy (name
+ len
, suffix
);
6983 return ada_find_parallel_type_with_name (type
, name
);
6986 /* If TYPE is a variable-size record type, return the corresponding template
6987 type describing its fields. Otherwise, return NULL. */
6989 static struct type
*
6990 dynamic_template_type (struct type
*type
)
6992 type
= ada_check_typedef (type
);
6994 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6995 || ada_type_name (type
) == NULL
)
6999 int len
= strlen (ada_type_name (type
));
7001 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7004 return ada_find_parallel_type (type
, "___XVE");
7008 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7009 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7012 is_dynamic_field (struct type
*templ_type
, int field_num
)
7014 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7017 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7018 && strstr (name
, "___XVL") != NULL
;
7021 /* The index of the variant field of TYPE, or -1 if TYPE does not
7022 represent a variant record type. */
7025 variant_field_index (struct type
*type
)
7029 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7032 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7034 if (ada_is_variant_part (type
, f
))
7040 /* A record type with no fields. */
7042 static struct type
*
7043 empty_record (struct type
*template)
7045 struct type
*type
= alloc_type_copy (template);
7047 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7048 TYPE_NFIELDS (type
) = 0;
7049 TYPE_FIELDS (type
) = NULL
;
7050 INIT_CPLUS_SPECIFIC (type
);
7051 TYPE_NAME (type
) = "<empty>";
7052 TYPE_TAG_NAME (type
) = NULL
;
7053 TYPE_LENGTH (type
) = 0;
7057 /* An ordinary record type (with fixed-length fields) that describes
7058 the value of type TYPE at VALADDR or ADDRESS (see comments at
7059 the beginning of this section) VAL according to GNAT conventions.
7060 DVAL0 should describe the (portion of a) record that contains any
7061 necessary discriminants. It should be NULL if value_type (VAL) is
7062 an outer-level type (i.e., as opposed to a branch of a variant.) A
7063 variant field (unless unchecked) is replaced by a particular branch
7066 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7067 length are not statically known are discarded. As a consequence,
7068 VALADDR, ADDRESS and DVAL0 are ignored.
7070 NOTE: Limitations: For now, we assume that dynamic fields and
7071 variants occupy whole numbers of bytes. However, they need not be
7075 ada_template_to_fixed_record_type_1 (struct type
*type
,
7076 const gdb_byte
*valaddr
,
7077 CORE_ADDR address
, struct value
*dval0
,
7078 int keep_dynamic_fields
)
7080 struct value
*mark
= value_mark ();
7083 int nfields
, bit_len
;
7089 /* Compute the number of fields in this record type that are going
7090 to be processed: unless keep_dynamic_fields, this includes only
7091 fields whose position and length are static will be processed. */
7092 if (keep_dynamic_fields
)
7093 nfields
= TYPE_NFIELDS (type
);
7097 while (nfields
< TYPE_NFIELDS (type
)
7098 && !ada_is_variant_part (type
, nfields
)
7099 && !is_dynamic_field (type
, nfields
))
7103 rtype
= alloc_type_copy (type
);
7104 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7105 INIT_CPLUS_SPECIFIC (rtype
);
7106 TYPE_NFIELDS (rtype
) = nfields
;
7107 TYPE_FIELDS (rtype
) = (struct field
*)
7108 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7109 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7110 TYPE_NAME (rtype
) = ada_type_name (type
);
7111 TYPE_TAG_NAME (rtype
) = NULL
;
7112 TYPE_FIXED_INSTANCE (rtype
) = 1;
7118 for (f
= 0; f
< nfields
; f
+= 1)
7120 off
= align_value (off
, field_alignment (type
, f
))
7121 + TYPE_FIELD_BITPOS (type
, f
);
7122 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
7123 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7125 if (ada_is_variant_part (type
, f
))
7130 else if (is_dynamic_field (type
, f
))
7132 const gdb_byte
*field_valaddr
= valaddr
;
7133 CORE_ADDR field_address
= address
;
7134 struct type
*field_type
=
7135 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7139 /* rtype's length is computed based on the run-time
7140 value of discriminants. If the discriminants are not
7141 initialized, the type size may be completely bogus and
7142 GDB may fail to allocate a value for it. So check the
7143 size first before creating the value. */
7145 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7150 /* If the type referenced by this field is an aligner type, we need
7151 to unwrap that aligner type, because its size might not be set.
7152 Keeping the aligner type would cause us to compute the wrong
7153 size for this field, impacting the offset of the all the fields
7154 that follow this one. */
7155 if (ada_is_aligner_type (field_type
))
7157 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7159 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7160 field_address
= cond_offset_target (field_address
, field_offset
);
7161 field_type
= ada_aligned_type (field_type
);
7164 field_valaddr
= cond_offset_host (field_valaddr
,
7165 off
/ TARGET_CHAR_BIT
);
7166 field_address
= cond_offset_target (field_address
,
7167 off
/ TARGET_CHAR_BIT
);
7169 /* Get the fixed type of the field. Note that, in this case,
7170 we do not want to get the real type out of the tag: if
7171 the current field is the parent part of a tagged record,
7172 we will get the tag of the object. Clearly wrong: the real
7173 type of the parent is not the real type of the child. We
7174 would end up in an infinite loop. */
7175 field_type
= ada_get_base_type (field_type
);
7176 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7177 field_address
, dval
, 0);
7178 /* If the field size is already larger than the maximum
7179 object size, then the record itself will necessarily
7180 be larger than the maximum object size. We need to make
7181 this check now, because the size might be so ridiculously
7182 large (due to an uninitialized variable in the inferior)
7183 that it would cause an overflow when adding it to the
7185 check_size (field_type
);
7187 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7188 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7189 /* The multiplication can potentially overflow. But because
7190 the field length has been size-checked just above, and
7191 assuming that the maximum size is a reasonable value,
7192 an overflow should not happen in practice. So rather than
7193 adding overflow recovery code to this already complex code,
7194 we just assume that it's not going to happen. */
7196 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7200 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7202 /* If our field is a typedef type (most likely a typedef of
7203 a fat pointer, encoding an array access), then we need to
7204 look at its target type to determine its characteristics.
7205 In particular, we would miscompute the field size if we took
7206 the size of the typedef (zero), instead of the size of
7208 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7209 field_type
= ada_typedef_target_type (field_type
);
7211 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7212 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7213 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7215 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7218 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7220 if (off
+ fld_bit_len
> bit_len
)
7221 bit_len
= off
+ fld_bit_len
;
7223 TYPE_LENGTH (rtype
) =
7224 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7227 /* We handle the variant part, if any, at the end because of certain
7228 odd cases in which it is re-ordered so as NOT to be the last field of
7229 the record. This can happen in the presence of representation
7231 if (variant_field
>= 0)
7233 struct type
*branch_type
;
7235 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7238 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7243 to_fixed_variant_branch_type
7244 (TYPE_FIELD_TYPE (type
, variant_field
),
7245 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7246 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7247 if (branch_type
== NULL
)
7249 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7250 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7251 TYPE_NFIELDS (rtype
) -= 1;
7255 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7256 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7258 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7260 if (off
+ fld_bit_len
> bit_len
)
7261 bit_len
= off
+ fld_bit_len
;
7262 TYPE_LENGTH (rtype
) =
7263 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7267 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7268 should contain the alignment of that record, which should be a strictly
7269 positive value. If null or negative, then something is wrong, most
7270 probably in the debug info. In that case, we don't round up the size
7271 of the resulting type. If this record is not part of another structure,
7272 the current RTYPE length might be good enough for our purposes. */
7273 if (TYPE_LENGTH (type
) <= 0)
7275 if (TYPE_NAME (rtype
))
7276 warning (_("Invalid type size for `%s' detected: %d."),
7277 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7279 warning (_("Invalid type size for <unnamed> detected: %d."),
7280 TYPE_LENGTH (type
));
7284 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7285 TYPE_LENGTH (type
));
7288 value_free_to_mark (mark
);
7289 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7290 error (_("record type with dynamic size is larger than varsize-limit"));
7294 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7297 static struct type
*
7298 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7299 CORE_ADDR address
, struct value
*dval0
)
7301 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7305 /* An ordinary record type in which ___XVL-convention fields and
7306 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7307 static approximations, containing all possible fields. Uses
7308 no runtime values. Useless for use in values, but that's OK,
7309 since the results are used only for type determinations. Works on both
7310 structs and unions. Representation note: to save space, we memorize
7311 the result of this function in the TYPE_TARGET_TYPE of the
7314 static struct type
*
7315 template_to_static_fixed_type (struct type
*type0
)
7321 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7322 return TYPE_TARGET_TYPE (type0
);
7324 nfields
= TYPE_NFIELDS (type0
);
7327 for (f
= 0; f
< nfields
; f
+= 1)
7329 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7330 struct type
*new_type
;
7332 if (is_dynamic_field (type0
, f
))
7333 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7335 new_type
= static_unwrap_type (field_type
);
7336 if (type
== type0
&& new_type
!= field_type
)
7338 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7339 TYPE_CODE (type
) = TYPE_CODE (type0
);
7340 INIT_CPLUS_SPECIFIC (type
);
7341 TYPE_NFIELDS (type
) = nfields
;
7342 TYPE_FIELDS (type
) = (struct field
*)
7343 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7344 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7345 sizeof (struct field
) * nfields
);
7346 TYPE_NAME (type
) = ada_type_name (type0
);
7347 TYPE_TAG_NAME (type
) = NULL
;
7348 TYPE_FIXED_INSTANCE (type
) = 1;
7349 TYPE_LENGTH (type
) = 0;
7351 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7352 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7357 /* Given an object of type TYPE whose contents are at VALADDR and
7358 whose address in memory is ADDRESS, returns a revision of TYPE,
7359 which should be a non-dynamic-sized record, in which the variant
7360 part, if any, is replaced with the appropriate branch. Looks
7361 for discriminant values in DVAL0, which can be NULL if the record
7362 contains the necessary discriminant values. */
7364 static struct type
*
7365 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7366 CORE_ADDR address
, struct value
*dval0
)
7368 struct value
*mark
= value_mark ();
7371 struct type
*branch_type
;
7372 int nfields
= TYPE_NFIELDS (type
);
7373 int variant_field
= variant_field_index (type
);
7375 if (variant_field
== -1)
7379 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7383 rtype
= alloc_type_copy (type
);
7384 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7385 INIT_CPLUS_SPECIFIC (rtype
);
7386 TYPE_NFIELDS (rtype
) = nfields
;
7387 TYPE_FIELDS (rtype
) =
7388 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7389 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7390 sizeof (struct field
) * nfields
);
7391 TYPE_NAME (rtype
) = ada_type_name (type
);
7392 TYPE_TAG_NAME (rtype
) = NULL
;
7393 TYPE_FIXED_INSTANCE (rtype
) = 1;
7394 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7396 branch_type
= to_fixed_variant_branch_type
7397 (TYPE_FIELD_TYPE (type
, variant_field
),
7398 cond_offset_host (valaddr
,
7399 TYPE_FIELD_BITPOS (type
, variant_field
)
7401 cond_offset_target (address
,
7402 TYPE_FIELD_BITPOS (type
, variant_field
)
7403 / TARGET_CHAR_BIT
), dval
);
7404 if (branch_type
== NULL
)
7408 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7409 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7410 TYPE_NFIELDS (rtype
) -= 1;
7414 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7415 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7416 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7417 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7419 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7421 value_free_to_mark (mark
);
7425 /* An ordinary record type (with fixed-length fields) that describes
7426 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7427 beginning of this section]. Any necessary discriminants' values
7428 should be in DVAL, a record value; it may be NULL if the object
7429 at ADDR itself contains any necessary discriminant values.
7430 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7431 values from the record are needed. Except in the case that DVAL,
7432 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7433 unchecked) is replaced by a particular branch of the variant.
7435 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7436 is questionable and may be removed. It can arise during the
7437 processing of an unconstrained-array-of-record type where all the
7438 variant branches have exactly the same size. This is because in
7439 such cases, the compiler does not bother to use the XVS convention
7440 when encoding the record. I am currently dubious of this
7441 shortcut and suspect the compiler should be altered. FIXME. */
7443 static struct type
*
7444 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7445 CORE_ADDR address
, struct value
*dval
)
7447 struct type
*templ_type
;
7449 if (TYPE_FIXED_INSTANCE (type0
))
7452 templ_type
= dynamic_template_type (type0
);
7454 if (templ_type
!= NULL
)
7455 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7456 else if (variant_field_index (type0
) >= 0)
7458 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7460 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7465 TYPE_FIXED_INSTANCE (type0
) = 1;
7471 /* An ordinary record type (with fixed-length fields) that describes
7472 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7473 union type. Any necessary discriminants' values should be in DVAL,
7474 a record value. That is, this routine selects the appropriate
7475 branch of the union at ADDR according to the discriminant value
7476 indicated in the union's type name. Returns VAR_TYPE0 itself if
7477 it represents a variant subject to a pragma Unchecked_Union. */
7479 static struct type
*
7480 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7481 CORE_ADDR address
, struct value
*dval
)
7484 struct type
*templ_type
;
7485 struct type
*var_type
;
7487 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7488 var_type
= TYPE_TARGET_TYPE (var_type0
);
7490 var_type
= var_type0
;
7492 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7494 if (templ_type
!= NULL
)
7495 var_type
= templ_type
;
7497 if (is_unchecked_variant (var_type
, value_type (dval
)))
7500 ada_which_variant_applies (var_type
,
7501 value_type (dval
), value_contents (dval
));
7504 return empty_record (var_type
);
7505 else if (is_dynamic_field (var_type
, which
))
7506 return to_fixed_record_type
7507 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7508 valaddr
, address
, dval
);
7509 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7511 to_fixed_record_type
7512 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7514 return TYPE_FIELD_TYPE (var_type
, which
);
7517 /* Assuming that TYPE0 is an array type describing the type of a value
7518 at ADDR, and that DVAL describes a record containing any
7519 discriminants used in TYPE0, returns a type for the value that
7520 contains no dynamic components (that is, no components whose sizes
7521 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7522 true, gives an error message if the resulting type's size is over
7525 static struct type
*
7526 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7529 struct type
*index_type_desc
;
7530 struct type
*result
;
7531 int constrained_packed_array_p
;
7533 if (TYPE_FIXED_INSTANCE (type0
))
7536 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7537 if (constrained_packed_array_p
)
7538 type0
= decode_constrained_packed_array_type (type0
);
7540 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7541 ada_fixup_array_indexes_type (index_type_desc
);
7542 if (index_type_desc
== NULL
)
7544 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7546 /* NOTE: elt_type---the fixed version of elt_type0---should never
7547 depend on the contents of the array in properly constructed
7549 /* Create a fixed version of the array element type.
7550 We're not providing the address of an element here,
7551 and thus the actual object value cannot be inspected to do
7552 the conversion. This should not be a problem, since arrays of
7553 unconstrained objects are not allowed. In particular, all
7554 the elements of an array of a tagged type should all be of
7555 the same type specified in the debugging info. No need to
7556 consult the object tag. */
7557 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7559 /* Make sure we always create a new array type when dealing with
7560 packed array types, since we're going to fix-up the array
7561 type length and element bitsize a little further down. */
7562 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7565 result
= create_array_type (alloc_type_copy (type0
),
7566 elt_type
, TYPE_INDEX_TYPE (type0
));
7571 struct type
*elt_type0
;
7574 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7575 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7577 /* NOTE: result---the fixed version of elt_type0---should never
7578 depend on the contents of the array in properly constructed
7580 /* Create a fixed version of the array element type.
7581 We're not providing the address of an element here,
7582 and thus the actual object value cannot be inspected to do
7583 the conversion. This should not be a problem, since arrays of
7584 unconstrained objects are not allowed. In particular, all
7585 the elements of an array of a tagged type should all be of
7586 the same type specified in the debugging info. No need to
7587 consult the object tag. */
7589 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7592 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7594 struct type
*range_type
=
7595 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
7597 result
= create_array_type (alloc_type_copy (elt_type0
),
7598 result
, range_type
);
7599 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7601 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7602 error (_("array type with dynamic size is larger than varsize-limit"));
7605 if (constrained_packed_array_p
)
7607 /* So far, the resulting type has been created as if the original
7608 type was a regular (non-packed) array type. As a result, the
7609 bitsize of the array elements needs to be set again, and the array
7610 length needs to be recomputed based on that bitsize. */
7611 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7612 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7614 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7615 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7616 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7617 TYPE_LENGTH (result
)++;
7620 TYPE_FIXED_INSTANCE (result
) = 1;
7625 /* A standard type (containing no dynamically sized components)
7626 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7627 DVAL describes a record containing any discriminants used in TYPE0,
7628 and may be NULL if there are none, or if the object of type TYPE at
7629 ADDRESS or in VALADDR contains these discriminants.
7631 If CHECK_TAG is not null, in the case of tagged types, this function
7632 attempts to locate the object's tag and use it to compute the actual
7633 type. However, when ADDRESS is null, we cannot use it to determine the
7634 location of the tag, and therefore compute the tagged type's actual type.
7635 So we return the tagged type without consulting the tag. */
7637 static struct type
*
7638 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7639 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7641 type
= ada_check_typedef (type
);
7642 switch (TYPE_CODE (type
))
7646 case TYPE_CODE_STRUCT
:
7648 struct type
*static_type
= to_static_fixed_type (type
);
7649 struct type
*fixed_record_type
=
7650 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7652 /* If STATIC_TYPE is a tagged type and we know the object's address,
7653 then we can determine its tag, and compute the object's actual
7654 type from there. Note that we have to use the fixed record
7655 type (the parent part of the record may have dynamic fields
7656 and the way the location of _tag is expressed may depend on
7659 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7661 struct type
*real_type
=
7662 type_from_tag (value_tag_from_contents_and_address
7667 if (real_type
!= NULL
)
7668 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7671 /* Check to see if there is a parallel ___XVZ variable.
7672 If there is, then it provides the actual size of our type. */
7673 else if (ada_type_name (fixed_record_type
) != NULL
)
7675 char *name
= ada_type_name (fixed_record_type
);
7676 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7680 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7681 size
= get_int_var_value (xvz_name
, &xvz_found
);
7682 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7684 fixed_record_type
= copy_type (fixed_record_type
);
7685 TYPE_LENGTH (fixed_record_type
) = size
;
7687 /* The FIXED_RECORD_TYPE may have be a stub. We have
7688 observed this when the debugging info is STABS, and
7689 apparently it is something that is hard to fix.
7691 In practice, we don't need the actual type definition
7692 at all, because the presence of the XVZ variable allows us
7693 to assume that there must be a XVS type as well, which we
7694 should be able to use later, when we need the actual type
7697 In the meantime, pretend that the "fixed" type we are
7698 returning is NOT a stub, because this can cause trouble
7699 when using this type to create new types targeting it.
7700 Indeed, the associated creation routines often check
7701 whether the target type is a stub and will try to replace
7702 it, thus using a type with the wrong size. This, in turn,
7703 might cause the new type to have the wrong size too.
7704 Consider the case of an array, for instance, where the size
7705 of the array is computed from the number of elements in
7706 our array multiplied by the size of its element. */
7707 TYPE_STUB (fixed_record_type
) = 0;
7710 return fixed_record_type
;
7712 case TYPE_CODE_ARRAY
:
7713 return to_fixed_array_type (type
, dval
, 1);
7714 case TYPE_CODE_UNION
:
7718 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7722 /* The same as ada_to_fixed_type_1, except that it preserves the type
7723 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7725 The typedef layer needs be preserved in order to differentiate between
7726 arrays and array pointers when both types are implemented using the same
7727 fat pointer. In the array pointer case, the pointer is encoded as
7728 a typedef of the pointer type. For instance, considering:
7730 type String_Access is access String;
7731 S1 : String_Access := null;
7733 To the debugger, S1 is defined as a typedef of type String. But
7734 to the user, it is a pointer. So if the user tries to print S1,
7735 we should not dereference the array, but print the array address
7738 If we didn't preserve the typedef layer, we would lose the fact that
7739 the type is to be presented as a pointer (needs de-reference before
7740 being printed). And we would also use the source-level type name. */
7743 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7744 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7747 struct type
*fixed_type
=
7748 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7750 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
7751 then preserve the typedef layer.
7753 Implementation note: We can only check the main-type portion of
7754 the TYPE and FIXED_TYPE, because eliminating the typedef layer
7755 from TYPE now returns a type that has the same instance flags
7756 as TYPE. For instance, if TYPE is a "typedef const", and its
7757 target type is a "struct", then the typedef elimination will return
7758 a "const" version of the target type. See check_typedef for more
7759 details about how the typedef layer elimination is done.
7761 brobecker/2010-11-19: It seems to me that the only case where it is
7762 useful to preserve the typedef layer is when dealing with fat pointers.
7763 Perhaps, we could add a check for that and preserve the typedef layer
7764 only in that situation. But this seems unecessary so far, probably
7765 because we call check_typedef/ada_check_typedef pretty much everywhere.
7767 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7768 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
7769 == TYPE_MAIN_TYPE (fixed_type
)))
7775 /* A standard (static-sized) type corresponding as well as possible to
7776 TYPE0, but based on no runtime data. */
7778 static struct type
*
7779 to_static_fixed_type (struct type
*type0
)
7786 if (TYPE_FIXED_INSTANCE (type0
))
7789 type0
= ada_check_typedef (type0
);
7791 switch (TYPE_CODE (type0
))
7795 case TYPE_CODE_STRUCT
:
7796 type
= dynamic_template_type (type0
);
7798 return template_to_static_fixed_type (type
);
7800 return template_to_static_fixed_type (type0
);
7801 case TYPE_CODE_UNION
:
7802 type
= ada_find_parallel_type (type0
, "___XVU");
7804 return template_to_static_fixed_type (type
);
7806 return template_to_static_fixed_type (type0
);
7810 /* A static approximation of TYPE with all type wrappers removed. */
7812 static struct type
*
7813 static_unwrap_type (struct type
*type
)
7815 if (ada_is_aligner_type (type
))
7817 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7818 if (ada_type_name (type1
) == NULL
)
7819 TYPE_NAME (type1
) = ada_type_name (type
);
7821 return static_unwrap_type (type1
);
7825 struct type
*raw_real_type
= ada_get_base_type (type
);
7827 if (raw_real_type
== type
)
7830 return to_static_fixed_type (raw_real_type
);
7834 /* In some cases, incomplete and private types require
7835 cross-references that are not resolved as records (for example,
7837 type FooP is access Foo;
7839 type Foo is array ...;
7840 ). In these cases, since there is no mechanism for producing
7841 cross-references to such types, we instead substitute for FooP a
7842 stub enumeration type that is nowhere resolved, and whose tag is
7843 the name of the actual type. Call these types "non-record stubs". */
7845 /* A type equivalent to TYPE that is not a non-record stub, if one
7846 exists, otherwise TYPE. */
7849 ada_check_typedef (struct type
*type
)
7854 /* If our type is a typedef type of a fat pointer, then we're done.
7855 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
7856 what allows us to distinguish between fat pointers that represent
7857 array types, and fat pointers that represent array access types
7858 (in both cases, the compiler implements them as fat pointers). */
7859 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7860 && is_thick_pntr (ada_typedef_target_type (type
)))
7863 CHECK_TYPEDEF (type
);
7864 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7865 || !TYPE_STUB (type
)
7866 || TYPE_TAG_NAME (type
) == NULL
)
7870 char *name
= TYPE_TAG_NAME (type
);
7871 struct type
*type1
= ada_find_any_type (name
);
7876 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
7877 stubs pointing to arrays, as we don't create symbols for array
7878 types, only for the typedef-to-array types). If that's the case,
7879 strip the typedef layer. */
7880 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
7881 type1
= ada_check_typedef (type1
);
7887 /* A value representing the data at VALADDR/ADDRESS as described by
7888 type TYPE0, but with a standard (static-sized) type that correctly
7889 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7890 type, then return VAL0 [this feature is simply to avoid redundant
7891 creation of struct values]. */
7893 static struct value
*
7894 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7897 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7899 if (type
== type0
&& val0
!= NULL
)
7902 return value_from_contents_and_address (type
, 0, address
);
7905 /* A value representing VAL, but with a standard (static-sized) type
7906 that correctly describes it. Does not necessarily create a new
7910 ada_to_fixed_value (struct value
*val
)
7912 return ada_to_fixed_value_create (value_type (val
),
7913 value_address (val
),
7920 /* Table mapping attribute numbers to names.
7921 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7923 static const char *attribute_names
[] = {
7941 ada_attribute_name (enum exp_opcode n
)
7943 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7944 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7946 return attribute_names
[0];
7949 /* Evaluate the 'POS attribute applied to ARG. */
7952 pos_atr (struct value
*arg
)
7954 struct value
*val
= coerce_ref (arg
);
7955 struct type
*type
= value_type (val
);
7957 if (!discrete_type_p (type
))
7958 error (_("'POS only defined on discrete types"));
7960 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7963 LONGEST v
= value_as_long (val
);
7965 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7967 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7970 error (_("enumeration value is invalid: can't find 'POS"));
7973 return value_as_long (val
);
7976 static struct value
*
7977 value_pos_atr (struct type
*type
, struct value
*arg
)
7979 return value_from_longest (type
, pos_atr (arg
));
7982 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7984 static struct value
*
7985 value_val_atr (struct type
*type
, struct value
*arg
)
7987 if (!discrete_type_p (type
))
7988 error (_("'VAL only defined on discrete types"));
7989 if (!integer_type_p (value_type (arg
)))
7990 error (_("'VAL requires integral argument"));
7992 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7994 long pos
= value_as_long (arg
);
7996 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7997 error (_("argument to 'VAL out of range"));
7998 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
8001 return value_from_longest (type
, value_as_long (arg
));
8007 /* True if TYPE appears to be an Ada character type.
8008 [At the moment, this is true only for Character and Wide_Character;
8009 It is a heuristic test that could stand improvement]. */
8012 ada_is_character_type (struct type
*type
)
8016 /* If the type code says it's a character, then assume it really is,
8017 and don't check any further. */
8018 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8021 /* Otherwise, assume it's a character type iff it is a discrete type
8022 with a known character type name. */
8023 name
= ada_type_name (type
);
8024 return (name
!= NULL
8025 && (TYPE_CODE (type
) == TYPE_CODE_INT
8026 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8027 && (strcmp (name
, "character") == 0
8028 || strcmp (name
, "wide_character") == 0
8029 || strcmp (name
, "wide_wide_character") == 0
8030 || strcmp (name
, "unsigned char") == 0));
8033 /* True if TYPE appears to be an Ada string type. */
8036 ada_is_string_type (struct type
*type
)
8038 type
= ada_check_typedef (type
);
8040 && TYPE_CODE (type
) != TYPE_CODE_PTR
8041 && (ada_is_simple_array_type (type
)
8042 || ada_is_array_descriptor_type (type
))
8043 && ada_array_arity (type
) == 1)
8045 struct type
*elttype
= ada_array_element_type (type
, 1);
8047 return ada_is_character_type (elttype
);
8053 /* The compiler sometimes provides a parallel XVS type for a given
8054 PAD type. Normally, it is safe to follow the PAD type directly,
8055 but older versions of the compiler have a bug that causes the offset
8056 of its "F" field to be wrong. Following that field in that case
8057 would lead to incorrect results, but this can be worked around
8058 by ignoring the PAD type and using the associated XVS type instead.
8060 Set to True if the debugger should trust the contents of PAD types.
8061 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8062 static int trust_pad_over_xvs
= 1;
8064 /* True if TYPE is a struct type introduced by the compiler to force the
8065 alignment of a value. Such types have a single field with a
8066 distinctive name. */
8069 ada_is_aligner_type (struct type
*type
)
8071 type
= ada_check_typedef (type
);
8073 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8076 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8077 && TYPE_NFIELDS (type
) == 1
8078 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8081 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8082 the parallel type. */
8085 ada_get_base_type (struct type
*raw_type
)
8087 struct type
*real_type_namer
;
8088 struct type
*raw_real_type
;
8090 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8093 if (ada_is_aligner_type (raw_type
))
8094 /* The encoding specifies that we should always use the aligner type.
8095 So, even if this aligner type has an associated XVS type, we should
8098 According to the compiler gurus, an XVS type parallel to an aligner
8099 type may exist because of a stabs limitation. In stabs, aligner
8100 types are empty because the field has a variable-sized type, and
8101 thus cannot actually be used as an aligner type. As a result,
8102 we need the associated parallel XVS type to decode the type.
8103 Since the policy in the compiler is to not change the internal
8104 representation based on the debugging info format, we sometimes
8105 end up having a redundant XVS type parallel to the aligner type. */
8108 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8109 if (real_type_namer
== NULL
8110 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8111 || TYPE_NFIELDS (real_type_namer
) != 1)
8114 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8116 /* This is an older encoding form where the base type needs to be
8117 looked up by name. We prefer the newer enconding because it is
8119 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8120 if (raw_real_type
== NULL
)
8123 return raw_real_type
;
8126 /* The field in our XVS type is a reference to the base type. */
8127 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8130 /* The type of value designated by TYPE, with all aligners removed. */
8133 ada_aligned_type (struct type
*type
)
8135 if (ada_is_aligner_type (type
))
8136 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8138 return ada_get_base_type (type
);
8142 /* The address of the aligned value in an object at address VALADDR
8143 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8146 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8148 if (ada_is_aligner_type (type
))
8149 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8151 TYPE_FIELD_BITPOS (type
,
8152 0) / TARGET_CHAR_BIT
);
8159 /* The printed representation of an enumeration literal with encoded
8160 name NAME. The value is good to the next call of ada_enum_name. */
8162 ada_enum_name (const char *name
)
8164 static char *result
;
8165 static size_t result_len
= 0;
8168 /* First, unqualify the enumeration name:
8169 1. Search for the last '.' character. If we find one, then skip
8170 all the preceeding characters, the unqualified name starts
8171 right after that dot.
8172 2. Otherwise, we may be debugging on a target where the compiler
8173 translates dots into "__". Search forward for double underscores,
8174 but stop searching when we hit an overloading suffix, which is
8175 of the form "__" followed by digits. */
8177 tmp
= strrchr (name
, '.');
8182 while ((tmp
= strstr (name
, "__")) != NULL
)
8184 if (isdigit (tmp
[2]))
8195 if (name
[1] == 'U' || name
[1] == 'W')
8197 if (sscanf (name
+ 2, "%x", &v
) != 1)
8203 GROW_VECT (result
, result_len
, 16);
8204 if (isascii (v
) && isprint (v
))
8205 xsnprintf (result
, result_len
, "'%c'", v
);
8206 else if (name
[1] == 'U')
8207 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8209 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
8215 tmp
= strstr (name
, "__");
8217 tmp
= strstr (name
, "$");
8220 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8221 strncpy (result
, name
, tmp
- name
);
8222 result
[tmp
- name
] = '\0';
8230 /* Evaluate the subexpression of EXP starting at *POS as for
8231 evaluate_type, updating *POS to point just past the evaluated
8234 static struct value
*
8235 evaluate_subexp_type (struct expression
*exp
, int *pos
)
8237 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8240 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8243 static struct value
*
8244 unwrap_value (struct value
*val
)
8246 struct type
*type
= ada_check_typedef (value_type (val
));
8248 if (ada_is_aligner_type (type
))
8250 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
8251 struct type
*val_type
= ada_check_typedef (value_type (v
));
8253 if (ada_type_name (val_type
) == NULL
)
8254 TYPE_NAME (val_type
) = ada_type_name (type
);
8256 return unwrap_value (v
);
8260 struct type
*raw_real_type
=
8261 ada_check_typedef (ada_get_base_type (type
));
8263 /* If there is no parallel XVS or XVE type, then the value is
8264 already unwrapped. Return it without further modification. */
8265 if ((type
== raw_real_type
)
8266 && ada_find_parallel_type (type
, "___XVE") == NULL
)
8270 coerce_unspec_val_to_type
8271 (val
, ada_to_fixed_type (raw_real_type
, 0,
8272 value_address (val
),
8277 static struct value
*
8278 cast_to_fixed (struct type
*type
, struct value
*arg
)
8282 if (type
== value_type (arg
))
8284 else if (ada_is_fixed_point_type (value_type (arg
)))
8285 val
= ada_float_to_fixed (type
,
8286 ada_fixed_to_float (value_type (arg
),
8287 value_as_long (arg
)));
8290 DOUBLEST argd
= value_as_double (arg
);
8292 val
= ada_float_to_fixed (type
, argd
);
8295 return value_from_longest (type
, val
);
8298 static struct value
*
8299 cast_from_fixed (struct type
*type
, struct value
*arg
)
8301 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
8302 value_as_long (arg
));
8304 return value_from_double (type
, val
);
8307 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8308 return the converted value. */
8310 static struct value
*
8311 coerce_for_assign (struct type
*type
, struct value
*val
)
8313 struct type
*type2
= value_type (val
);
8318 type2
= ada_check_typedef (type2
);
8319 type
= ada_check_typedef (type
);
8321 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8322 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8324 val
= ada_value_ind (val
);
8325 type2
= value_type (val
);
8328 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8329 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8331 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8332 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8333 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8334 error (_("Incompatible types in assignment"));
8335 deprecated_set_value_type (val
, type
);
8340 static struct value
*
8341 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8344 struct type
*type1
, *type2
;
8347 arg1
= coerce_ref (arg1
);
8348 arg2
= coerce_ref (arg2
);
8349 type1
= base_type (ada_check_typedef (value_type (arg1
)));
8350 type2
= base_type (ada_check_typedef (value_type (arg2
)));
8352 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8353 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8354 return value_binop (arg1
, arg2
, op
);
8363 return value_binop (arg1
, arg2
, op
);
8366 v2
= value_as_long (arg2
);
8368 error (_("second operand of %s must not be zero."), op_string (op
));
8370 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8371 return value_binop (arg1
, arg2
, op
);
8373 v1
= value_as_long (arg1
);
8378 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8379 v
+= v
> 0 ? -1 : 1;
8387 /* Should not reach this point. */
8391 val
= allocate_value (type1
);
8392 store_unsigned_integer (value_contents_raw (val
),
8393 TYPE_LENGTH (value_type (val
)),
8394 gdbarch_byte_order (get_type_arch (type1
)), v
);
8399 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8401 if (ada_is_direct_array_type (value_type (arg1
))
8402 || ada_is_direct_array_type (value_type (arg2
)))
8404 /* Automatically dereference any array reference before
8405 we attempt to perform the comparison. */
8406 arg1
= ada_coerce_ref (arg1
);
8407 arg2
= ada_coerce_ref (arg2
);
8409 arg1
= ada_coerce_to_simple_array (arg1
);
8410 arg2
= ada_coerce_to_simple_array (arg2
);
8411 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8412 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8413 error (_("Attempt to compare array with non-array"));
8414 /* FIXME: The following works only for types whose
8415 representations use all bits (no padding or undefined bits)
8416 and do not have user-defined equality. */
8418 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8419 && memcmp (value_contents (arg1
), value_contents (arg2
),
8420 TYPE_LENGTH (value_type (arg1
))) == 0;
8422 return value_equal (arg1
, arg2
);
8425 /* Total number of component associations in the aggregate starting at
8426 index PC in EXP. Assumes that index PC is the start of an
8430 num_component_specs (struct expression
*exp
, int pc
)
8434 m
= exp
->elts
[pc
+ 1].longconst
;
8437 for (i
= 0; i
< m
; i
+= 1)
8439 switch (exp
->elts
[pc
].opcode
)
8445 n
+= exp
->elts
[pc
+ 1].longconst
;
8448 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8453 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8454 component of LHS (a simple array or a record), updating *POS past
8455 the expression, assuming that LHS is contained in CONTAINER. Does
8456 not modify the inferior's memory, nor does it modify LHS (unless
8457 LHS == CONTAINER). */
8460 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8461 struct expression
*exp
, int *pos
)
8463 struct value
*mark
= value_mark ();
8466 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8468 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8469 struct value
*index_val
= value_from_longest (index_type
, index
);
8471 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8475 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8476 elt
= ada_to_fixed_value (unwrap_value (elt
));
8479 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8480 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8482 value_assign_to_component (container
, elt
,
8483 ada_evaluate_subexp (NULL
, exp
, pos
,
8486 value_free_to_mark (mark
);
8489 /* Assuming that LHS represents an lvalue having a record or array
8490 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8491 of that aggregate's value to LHS, advancing *POS past the
8492 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8493 lvalue containing LHS (possibly LHS itself). Does not modify
8494 the inferior's memory, nor does it modify the contents of
8495 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8497 static struct value
*
8498 assign_aggregate (struct value
*container
,
8499 struct value
*lhs
, struct expression
*exp
,
8500 int *pos
, enum noside noside
)
8502 struct type
*lhs_type
;
8503 int n
= exp
->elts
[*pos
+1].longconst
;
8504 LONGEST low_index
, high_index
;
8507 int max_indices
, num_indices
;
8508 int is_array_aggregate
;
8512 if (noside
!= EVAL_NORMAL
)
8516 for (i
= 0; i
< n
; i
+= 1)
8517 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8521 container
= ada_coerce_ref (container
);
8522 if (ada_is_direct_array_type (value_type (container
)))
8523 container
= ada_coerce_to_simple_array (container
);
8524 lhs
= ada_coerce_ref (lhs
);
8525 if (!deprecated_value_modifiable (lhs
))
8526 error (_("Left operand of assignment is not a modifiable lvalue."));
8528 lhs_type
= value_type (lhs
);
8529 if (ada_is_direct_array_type (lhs_type
))
8531 lhs
= ada_coerce_to_simple_array (lhs
);
8532 lhs_type
= value_type (lhs
);
8533 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8534 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8535 is_array_aggregate
= 1;
8537 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8540 high_index
= num_visible_fields (lhs_type
) - 1;
8541 is_array_aggregate
= 0;
8544 error (_("Left-hand side must be array or record."));
8546 num_specs
= num_component_specs (exp
, *pos
- 3);
8547 max_indices
= 4 * num_specs
+ 4;
8548 indices
= alloca (max_indices
* sizeof (indices
[0]));
8549 indices
[0] = indices
[1] = low_index
- 1;
8550 indices
[2] = indices
[3] = high_index
+ 1;
8553 for (i
= 0; i
< n
; i
+= 1)
8555 switch (exp
->elts
[*pos
].opcode
)
8558 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8559 &num_indices
, max_indices
,
8560 low_index
, high_index
);
8563 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8564 &num_indices
, max_indices
,
8565 low_index
, high_index
);
8569 error (_("Misplaced 'others' clause"));
8570 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8571 num_indices
, low_index
, high_index
);
8574 error (_("Internal error: bad aggregate clause"));
8581 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8582 construct at *POS, updating *POS past the construct, given that
8583 the positions are relative to lower bound LOW, where HIGH is the
8584 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8585 updating *NUM_INDICES as needed. CONTAINER is as for
8586 assign_aggregate. */
8588 aggregate_assign_positional (struct value
*container
,
8589 struct value
*lhs
, struct expression
*exp
,
8590 int *pos
, LONGEST
*indices
, int *num_indices
,
8591 int max_indices
, LONGEST low
, LONGEST high
)
8593 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8595 if (ind
- 1 == high
)
8596 warning (_("Extra components in aggregate ignored."));
8599 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8601 assign_component (container
, lhs
, ind
, exp
, pos
);
8604 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8607 /* Assign into the components of LHS indexed by the OP_CHOICES
8608 construct at *POS, updating *POS past the construct, given that
8609 the allowable indices are LOW..HIGH. Record the indices assigned
8610 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8611 needed. CONTAINER is as for assign_aggregate. */
8613 aggregate_assign_from_choices (struct value
*container
,
8614 struct value
*lhs
, struct expression
*exp
,
8615 int *pos
, LONGEST
*indices
, int *num_indices
,
8616 int max_indices
, LONGEST low
, LONGEST high
)
8619 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8620 int choice_pos
, expr_pc
;
8621 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8623 choice_pos
= *pos
+= 3;
8625 for (j
= 0; j
< n_choices
; j
+= 1)
8626 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8628 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8630 for (j
= 0; j
< n_choices
; j
+= 1)
8632 LONGEST lower
, upper
;
8633 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8635 if (op
== OP_DISCRETE_RANGE
)
8638 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8640 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8645 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8657 name
= &exp
->elts
[choice_pos
+ 2].string
;
8660 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8663 error (_("Invalid record component association."));
8665 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8667 if (! find_struct_field (name
, value_type (lhs
), 0,
8668 NULL
, NULL
, NULL
, NULL
, &ind
))
8669 error (_("Unknown component name: %s."), name
);
8670 lower
= upper
= ind
;
8673 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8674 error (_("Index in component association out of bounds."));
8676 add_component_interval (lower
, upper
, indices
, num_indices
,
8678 while (lower
<= upper
)
8683 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8689 /* Assign the value of the expression in the OP_OTHERS construct in
8690 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8691 have not been previously assigned. The index intervals already assigned
8692 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8693 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
8695 aggregate_assign_others (struct value
*container
,
8696 struct value
*lhs
, struct expression
*exp
,
8697 int *pos
, LONGEST
*indices
, int num_indices
,
8698 LONGEST low
, LONGEST high
)
8701 int expr_pc
= *pos
+1;
8703 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8707 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8712 assign_component (container
, lhs
, ind
, exp
, &pos
);
8715 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8718 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8719 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8720 modifying *SIZE as needed. It is an error if *SIZE exceeds
8721 MAX_SIZE. The resulting intervals do not overlap. */
8723 add_component_interval (LONGEST low
, LONGEST high
,
8724 LONGEST
* indices
, int *size
, int max_size
)
8728 for (i
= 0; i
< *size
; i
+= 2) {
8729 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8733 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8734 if (high
< indices
[kh
])
8736 if (low
< indices
[i
])
8738 indices
[i
+ 1] = indices
[kh
- 1];
8739 if (high
> indices
[i
+ 1])
8740 indices
[i
+ 1] = high
;
8741 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8742 *size
-= kh
- i
- 2;
8745 else if (high
< indices
[i
])
8749 if (*size
== max_size
)
8750 error (_("Internal error: miscounted aggregate components."));
8752 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8753 indices
[j
] = indices
[j
- 2];
8755 indices
[i
+ 1] = high
;
8758 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8761 static struct value
*
8762 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8764 if (type
== ada_check_typedef (value_type (arg2
)))
8767 if (ada_is_fixed_point_type (type
))
8768 return (cast_to_fixed (type
, arg2
));
8770 if (ada_is_fixed_point_type (value_type (arg2
)))
8771 return cast_from_fixed (type
, arg2
);
8773 return value_cast (type
, arg2
);
8776 /* Evaluating Ada expressions, and printing their result.
8777 ------------------------------------------------------
8782 We usually evaluate an Ada expression in order to print its value.
8783 We also evaluate an expression in order to print its type, which
8784 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8785 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8786 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8787 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8790 Evaluating expressions is a little more complicated for Ada entities
8791 than it is for entities in languages such as C. The main reason for
8792 this is that Ada provides types whose definition might be dynamic.
8793 One example of such types is variant records. Or another example
8794 would be an array whose bounds can only be known at run time.
8796 The following description is a general guide as to what should be
8797 done (and what should NOT be done) in order to evaluate an expression
8798 involving such types, and when. This does not cover how the semantic
8799 information is encoded by GNAT as this is covered separatly. For the
8800 document used as the reference for the GNAT encoding, see exp_dbug.ads
8801 in the GNAT sources.
8803 Ideally, we should embed each part of this description next to its
8804 associated code. Unfortunately, the amount of code is so vast right
8805 now that it's hard to see whether the code handling a particular
8806 situation might be duplicated or not. One day, when the code is
8807 cleaned up, this guide might become redundant with the comments
8808 inserted in the code, and we might want to remove it.
8810 2. ``Fixing'' an Entity, the Simple Case:
8811 -----------------------------------------
8813 When evaluating Ada expressions, the tricky issue is that they may
8814 reference entities whose type contents and size are not statically
8815 known. Consider for instance a variant record:
8817 type Rec (Empty : Boolean := True) is record
8820 when False => Value : Integer;
8823 Yes : Rec := (Empty => False, Value => 1);
8824 No : Rec := (empty => True);
8826 The size and contents of that record depends on the value of the
8827 descriminant (Rec.Empty). At this point, neither the debugging
8828 information nor the associated type structure in GDB are able to
8829 express such dynamic types. So what the debugger does is to create
8830 "fixed" versions of the type that applies to the specific object.
8831 We also informally refer to this opperation as "fixing" an object,
8832 which means creating its associated fixed type.
8834 Example: when printing the value of variable "Yes" above, its fixed
8835 type would look like this:
8842 On the other hand, if we printed the value of "No", its fixed type
8849 Things become a little more complicated when trying to fix an entity
8850 with a dynamic type that directly contains another dynamic type,
8851 such as an array of variant records, for instance. There are
8852 two possible cases: Arrays, and records.
8854 3. ``Fixing'' Arrays:
8855 ---------------------
8857 The type structure in GDB describes an array in terms of its bounds,
8858 and the type of its elements. By design, all elements in the array
8859 have the same type and we cannot represent an array of variant elements
8860 using the current type structure in GDB. When fixing an array,
8861 we cannot fix the array element, as we would potentially need one
8862 fixed type per element of the array. As a result, the best we can do
8863 when fixing an array is to produce an array whose bounds and size
8864 are correct (allowing us to read it from memory), but without having
8865 touched its element type. Fixing each element will be done later,
8866 when (if) necessary.
8868 Arrays are a little simpler to handle than records, because the same
8869 amount of memory is allocated for each element of the array, even if
8870 the amount of space actually used by each element differs from element
8871 to element. Consider for instance the following array of type Rec:
8873 type Rec_Array is array (1 .. 2) of Rec;
8875 The actual amount of memory occupied by each element might be different
8876 from element to element, depending on the value of their discriminant.
8877 But the amount of space reserved for each element in the array remains
8878 fixed regardless. So we simply need to compute that size using
8879 the debugging information available, from which we can then determine
8880 the array size (we multiply the number of elements of the array by
8881 the size of each element).
8883 The simplest case is when we have an array of a constrained element
8884 type. For instance, consider the following type declarations:
8886 type Bounded_String (Max_Size : Integer) is
8888 Buffer : String (1 .. Max_Size);
8890 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
8892 In this case, the compiler describes the array as an array of
8893 variable-size elements (identified by its XVS suffix) for which
8894 the size can be read in the parallel XVZ variable.
8896 In the case of an array of an unconstrained element type, the compiler
8897 wraps the array element inside a private PAD type. This type should not
8898 be shown to the user, and must be "unwrap"'ed before printing. Note
8899 that we also use the adjective "aligner" in our code to designate
8900 these wrapper types.
8902 In some cases, the size allocated for each element is statically
8903 known. In that case, the PAD type already has the correct size,
8904 and the array element should remain unfixed.
8906 But there are cases when this size is not statically known.
8907 For instance, assuming that "Five" is an integer variable:
8909 type Dynamic is array (1 .. Five) of Integer;
8910 type Wrapper (Has_Length : Boolean := False) is record
8913 when True => Length : Integer;
8917 type Wrapper_Array is array (1 .. 2) of Wrapper;
8919 Hello : Wrapper_Array := (others => (Has_Length => True,
8920 Data => (others => 17),
8924 The debugging info would describe variable Hello as being an
8925 array of a PAD type. The size of that PAD type is not statically
8926 known, but can be determined using a parallel XVZ variable.
8927 In that case, a copy of the PAD type with the correct size should
8928 be used for the fixed array.
8930 3. ``Fixing'' record type objects:
8931 ----------------------------------
8933 Things are slightly different from arrays in the case of dynamic
8934 record types. In this case, in order to compute the associated
8935 fixed type, we need to determine the size and offset of each of
8936 its components. This, in turn, requires us to compute the fixed
8937 type of each of these components.
8939 Consider for instance the example:
8941 type Bounded_String (Max_Size : Natural) is record
8942 Str : String (1 .. Max_Size);
8945 My_String : Bounded_String (Max_Size => 10);
8947 In that case, the position of field "Length" depends on the size
8948 of field Str, which itself depends on the value of the Max_Size
8949 discriminant. In order to fix the type of variable My_String,
8950 we need to fix the type of field Str. Therefore, fixing a variant
8951 record requires us to fix each of its components.
8953 However, if a component does not have a dynamic size, the component
8954 should not be fixed. In particular, fields that use a PAD type
8955 should not fixed. Here is an example where this might happen
8956 (assuming type Rec above):
8958 type Container (Big : Boolean) is record
8962 when True => Another : Integer;
8966 My_Container : Container := (Big => False,
8967 First => (Empty => True),
8970 In that example, the compiler creates a PAD type for component First,
8971 whose size is constant, and then positions the component After just
8972 right after it. The offset of component After is therefore constant
8975 The debugger computes the position of each field based on an algorithm
8976 that uses, among other things, the actual position and size of the field
8977 preceding it. Let's now imagine that the user is trying to print
8978 the value of My_Container. If the type fixing was recursive, we would
8979 end up computing the offset of field After based on the size of the
8980 fixed version of field First. And since in our example First has
8981 only one actual field, the size of the fixed type is actually smaller
8982 than the amount of space allocated to that field, and thus we would
8983 compute the wrong offset of field After.
8985 To make things more complicated, we need to watch out for dynamic
8986 components of variant records (identified by the ___XVL suffix in
8987 the component name). Even if the target type is a PAD type, the size
8988 of that type might not be statically known. So the PAD type needs
8989 to be unwrapped and the resulting type needs to be fixed. Otherwise,
8990 we might end up with the wrong size for our component. This can be
8991 observed with the following type declarations:
8993 type Octal is new Integer range 0 .. 7;
8994 type Octal_Array is array (Positive range <>) of Octal;
8995 pragma Pack (Octal_Array);
8997 type Octal_Buffer (Size : Positive) is record
8998 Buffer : Octal_Array (1 .. Size);
9002 In that case, Buffer is a PAD type whose size is unset and needs
9003 to be computed by fixing the unwrapped type.
9005 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9006 ----------------------------------------------------------
9008 Lastly, when should the sub-elements of an entity that remained unfixed
9009 thus far, be actually fixed?
9011 The answer is: Only when referencing that element. For instance
9012 when selecting one component of a record, this specific component
9013 should be fixed at that point in time. Or when printing the value
9014 of a record, each component should be fixed before its value gets
9015 printed. Similarly for arrays, the element of the array should be
9016 fixed when printing each element of the array, or when extracting
9017 one element out of that array. On the other hand, fixing should
9018 not be performed on the elements when taking a slice of an array!
9020 Note that one of the side-effects of miscomputing the offset and
9021 size of each field is that we end up also miscomputing the size
9022 of the containing type. This can have adverse results when computing
9023 the value of an entity. GDB fetches the value of an entity based
9024 on the size of its type, and thus a wrong size causes GDB to fetch
9025 the wrong amount of memory. In the case where the computed size is
9026 too small, GDB fetches too little data to print the value of our
9027 entiry. Results in this case as unpredicatble, as we usually read
9028 past the buffer containing the data =:-o. */
9030 /* Implement the evaluate_exp routine in the exp_descriptor structure
9031 for the Ada language. */
9033 static struct value
*
9034 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9035 int *pos
, enum noside noside
)
9040 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9043 struct value
**argvec
;
9047 op
= exp
->elts
[pc
].opcode
;
9053 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9054 arg1
= unwrap_value (arg1
);
9056 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9057 then we need to perform the conversion manually, because
9058 evaluate_subexp_standard doesn't do it. This conversion is
9059 necessary in Ada because the different kinds of float/fixed
9060 types in Ada have different representations.
9062 Similarly, we need to perform the conversion from OP_LONG
9064 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9065 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9071 struct value
*result
;
9074 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9075 /* The result type will have code OP_STRING, bashed there from
9076 OP_ARRAY. Bash it back. */
9077 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9078 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9084 type
= exp
->elts
[pc
+ 1].type
;
9085 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9086 if (noside
== EVAL_SKIP
)
9088 arg1
= ada_value_cast (type
, arg1
, noside
);
9093 type
= exp
->elts
[pc
+ 1].type
;
9094 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9097 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9098 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9100 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9101 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9103 return ada_value_assign (arg1
, arg1
);
9105 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9106 except if the lhs of our assignment is a convenience variable.
9107 In the case of assigning to a convenience variable, the lhs
9108 should be exactly the result of the evaluation of the rhs. */
9109 type
= value_type (arg1
);
9110 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9112 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9113 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9115 if (ada_is_fixed_point_type (value_type (arg1
)))
9116 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9117 else if (ada_is_fixed_point_type (value_type (arg2
)))
9119 (_("Fixed-point values must be assigned to fixed-point variables"));
9121 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9122 return ada_value_assign (arg1
, arg2
);
9125 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9126 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9127 if (noside
== EVAL_SKIP
)
9129 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9130 return (value_from_longest
9132 value_as_long (arg1
) + value_as_long (arg2
)));
9133 if ((ada_is_fixed_point_type (value_type (arg1
))
9134 || ada_is_fixed_point_type (value_type (arg2
)))
9135 && value_type (arg1
) != value_type (arg2
))
9136 error (_("Operands of fixed-point addition must have the same type"));
9137 /* Do the addition, and cast the result to the type of the first
9138 argument. We cannot cast the result to a reference type, so if
9139 ARG1 is a reference type, find its underlying type. */
9140 type
= value_type (arg1
);
9141 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9142 type
= TYPE_TARGET_TYPE (type
);
9143 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9144 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
9147 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9148 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9149 if (noside
== EVAL_SKIP
)
9151 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9152 return (value_from_longest
9154 value_as_long (arg1
) - value_as_long (arg2
)));
9155 if ((ada_is_fixed_point_type (value_type (arg1
))
9156 || ada_is_fixed_point_type (value_type (arg2
)))
9157 && value_type (arg1
) != value_type (arg2
))
9158 error (_("Operands of fixed-point subtraction "
9159 "must have the same type"));
9160 /* Do the substraction, and cast the result to the type of the first
9161 argument. We cannot cast the result to a reference type, so if
9162 ARG1 is a reference type, find its underlying type. */
9163 type
= value_type (arg1
);
9164 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9165 type
= TYPE_TARGET_TYPE (type
);
9166 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9167 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
9173 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9174 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9175 if (noside
== EVAL_SKIP
)
9177 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9179 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9180 return value_zero (value_type (arg1
), not_lval
);
9184 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
9185 if (ada_is_fixed_point_type (value_type (arg1
)))
9186 arg1
= cast_from_fixed (type
, arg1
);
9187 if (ada_is_fixed_point_type (value_type (arg2
)))
9188 arg2
= cast_from_fixed (type
, arg2
);
9189 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9190 return ada_value_binop (arg1
, arg2
, op
);
9194 case BINOP_NOTEQUAL
:
9195 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9196 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
9197 if (noside
== EVAL_SKIP
)
9199 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9203 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9204 tem
= ada_value_equal (arg1
, arg2
);
9206 if (op
== BINOP_NOTEQUAL
)
9208 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9209 return value_from_longest (type
, (LONGEST
) tem
);
9212 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9213 if (noside
== EVAL_SKIP
)
9215 else if (ada_is_fixed_point_type (value_type (arg1
)))
9216 return value_cast (value_type (arg1
), value_neg (arg1
));
9219 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9220 return value_neg (arg1
);
9223 case BINOP_LOGICAL_AND
:
9224 case BINOP_LOGICAL_OR
:
9225 case UNOP_LOGICAL_NOT
:
9230 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9231 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9232 return value_cast (type
, val
);
9235 case BINOP_BITWISE_AND
:
9236 case BINOP_BITWISE_IOR
:
9237 case BINOP_BITWISE_XOR
:
9241 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9243 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9245 return value_cast (value_type (arg1
), val
);
9251 if (noside
== EVAL_SKIP
)
9256 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
9257 /* Only encountered when an unresolved symbol occurs in a
9258 context other than a function call, in which case, it is
9260 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9261 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
9262 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9264 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
9265 /* Check to see if this is a tagged type. We also need to handle
9266 the case where the type is a reference to a tagged type, but
9267 we have to be careful to exclude pointers to tagged types.
9268 The latter should be shown as usual (as a pointer), whereas
9269 a reference should mostly be transparent to the user. */
9270 if (ada_is_tagged_type (type
, 0)
9271 || (TYPE_CODE(type
) == TYPE_CODE_REF
9272 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
9274 /* Tagged types are a little special in the fact that the real
9275 type is dynamic and can only be determined by inspecting the
9276 object's tag. This means that we need to get the object's
9277 value first (EVAL_NORMAL) and then extract the actual object
9280 Note that we cannot skip the final step where we extract
9281 the object type from its tag, because the EVAL_NORMAL phase
9282 results in dynamic components being resolved into fixed ones.
9283 This can cause problems when trying to print the type
9284 description of tagged types whose parent has a dynamic size:
9285 We use the type name of the "_parent" component in order
9286 to print the name of the ancestor type in the type description.
9287 If that component had a dynamic size, the resolution into
9288 a fixed type would result in the loss of that type name,
9289 thus preventing us from printing the name of the ancestor
9290 type in the type description. */
9291 struct type
*actual_type
;
9293 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
9294 actual_type
= type_from_tag (ada_value_tag (arg1
));
9295 if (actual_type
== NULL
)
9296 /* If, for some reason, we were unable to determine
9297 the actual type from the tag, then use the static
9298 approximation that we just computed as a fallback.
9299 This can happen if the debugging information is
9300 incomplete, for instance. */
9303 return value_zero (actual_type
, not_lval
);
9308 (to_static_fixed_type
9309 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
9314 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9315 arg1
= unwrap_value (arg1
);
9316 return ada_to_fixed_value (arg1
);
9322 /* Allocate arg vector, including space for the function to be
9323 called in argvec[0] and a terminating NULL. */
9324 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9326 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
9328 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
9329 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
9330 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9331 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
9334 for (tem
= 0; tem
<= nargs
; tem
+= 1)
9335 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9338 if (noside
== EVAL_SKIP
)
9342 if (ada_is_constrained_packed_array_type
9343 (desc_base_type (value_type (argvec
[0]))))
9344 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
9345 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9346 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
9347 /* This is a packed array that has already been fixed, and
9348 therefore already coerced to a simple array. Nothing further
9351 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
9352 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9353 && VALUE_LVAL (argvec
[0]) == lval_memory
))
9354 argvec
[0] = value_addr (argvec
[0]);
9356 type
= ada_check_typedef (value_type (argvec
[0]));
9358 /* Ada allows us to implicitly dereference arrays when subscripting
9359 them. So, if this is an typedef (encoding use for array access
9360 types encoded as fat pointers), strip it now. */
9361 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
9362 type
= ada_typedef_target_type (type
);
9364 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
9366 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
9368 case TYPE_CODE_FUNC
:
9369 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9371 case TYPE_CODE_ARRAY
:
9373 case TYPE_CODE_STRUCT
:
9374 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
9375 argvec
[0] = ada_value_ind (argvec
[0]);
9376 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9379 error (_("cannot subscript or call something of type `%s'"),
9380 ada_type_name (value_type (argvec
[0])));
9385 switch (TYPE_CODE (type
))
9387 case TYPE_CODE_FUNC
:
9388 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9389 return allocate_value (TYPE_TARGET_TYPE (type
));
9390 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
9391 case TYPE_CODE_STRUCT
:
9395 arity
= ada_array_arity (type
);
9396 type
= ada_array_element_type (type
, nargs
);
9398 error (_("cannot subscript or call a record"));
9400 error (_("wrong number of subscripts; expecting %d"), arity
);
9401 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9402 return value_zero (ada_aligned_type (type
), lval_memory
);
9404 unwrap_value (ada_value_subscript
9405 (argvec
[0], nargs
, argvec
+ 1));
9407 case TYPE_CODE_ARRAY
:
9408 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9410 type
= ada_array_element_type (type
, nargs
);
9412 error (_("element type of array unknown"));
9414 return value_zero (ada_aligned_type (type
), lval_memory
);
9417 unwrap_value (ada_value_subscript
9418 (ada_coerce_to_simple_array (argvec
[0]),
9419 nargs
, argvec
+ 1));
9420 case TYPE_CODE_PTR
: /* Pointer to array */
9421 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9422 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9424 type
= ada_array_element_type (type
, nargs
);
9426 error (_("element type of array unknown"));
9428 return value_zero (ada_aligned_type (type
), lval_memory
);
9431 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9432 nargs
, argvec
+ 1));
9435 error (_("Attempt to index or call something other than an "
9436 "array or function"));
9441 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9442 struct value
*low_bound_val
=
9443 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9444 struct value
*high_bound_val
=
9445 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9449 low_bound_val
= coerce_ref (low_bound_val
);
9450 high_bound_val
= coerce_ref (high_bound_val
);
9451 low_bound
= pos_atr (low_bound_val
);
9452 high_bound
= pos_atr (high_bound_val
);
9454 if (noside
== EVAL_SKIP
)
9457 /* If this is a reference to an aligner type, then remove all
9459 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9460 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9461 TYPE_TARGET_TYPE (value_type (array
)) =
9462 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9464 if (ada_is_constrained_packed_array_type (value_type (array
)))
9465 error (_("cannot slice a packed array"));
9467 /* If this is a reference to an array or an array lvalue,
9468 convert to a pointer. */
9469 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9470 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9471 && VALUE_LVAL (array
) == lval_memory
))
9472 array
= value_addr (array
);
9474 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9475 && ada_is_array_descriptor_type (ada_check_typedef
9476 (value_type (array
))))
9477 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9479 array
= ada_coerce_to_simple_array_ptr (array
);
9481 /* If we have more than one level of pointer indirection,
9482 dereference the value until we get only one level. */
9483 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9484 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9486 array
= value_ind (array
);
9488 /* Make sure we really do have an array type before going further,
9489 to avoid a SEGV when trying to get the index type or the target
9490 type later down the road if the debug info generated by
9491 the compiler is incorrect or incomplete. */
9492 if (!ada_is_simple_array_type (value_type (array
)))
9493 error (_("cannot take slice of non-array"));
9495 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
9497 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9498 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
9502 struct type
*arr_type0
=
9503 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
9506 return ada_value_slice_from_ptr (array
, arr_type0
,
9507 longest_to_int (low_bound
),
9508 longest_to_int (high_bound
));
9511 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9513 else if (high_bound
< low_bound
)
9514 return empty_array (value_type (array
), low_bound
);
9516 return ada_value_slice (array
, longest_to_int (low_bound
),
9517 longest_to_int (high_bound
));
9522 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9523 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9525 if (noside
== EVAL_SKIP
)
9528 switch (TYPE_CODE (type
))
9531 lim_warning (_("Membership test incompletely implemented; "
9532 "always returns true"));
9533 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9534 return value_from_longest (type
, (LONGEST
) 1);
9536 case TYPE_CODE_RANGE
:
9537 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9538 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9539 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9540 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9541 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9543 value_from_longest (type
,
9544 (value_less (arg1
, arg3
)
9545 || value_equal (arg1
, arg3
))
9546 && (value_less (arg2
, arg1
)
9547 || value_equal (arg2
, arg1
)));
9550 case BINOP_IN_BOUNDS
:
9552 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9553 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9555 if (noside
== EVAL_SKIP
)
9558 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9560 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9561 return value_zero (type
, not_lval
);
9564 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9566 type
= ada_index_type (value_type (arg2
), tem
, "range");
9568 type
= value_type (arg1
);
9570 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9571 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9573 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9574 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9575 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9577 value_from_longest (type
,
9578 (value_less (arg1
, arg3
)
9579 || value_equal (arg1
, arg3
))
9580 && (value_less (arg2
, arg1
)
9581 || value_equal (arg2
, arg1
)));
9583 case TERNOP_IN_RANGE
:
9584 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9585 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9586 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9588 if (noside
== EVAL_SKIP
)
9591 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9592 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9593 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9595 value_from_longest (type
,
9596 (value_less (arg1
, arg3
)
9597 || value_equal (arg1
, arg3
))
9598 && (value_less (arg2
, arg1
)
9599 || value_equal (arg2
, arg1
)));
9605 struct type
*type_arg
;
9607 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9609 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9611 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9615 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9619 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9620 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9621 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9624 if (noside
== EVAL_SKIP
)
9627 if (type_arg
== NULL
)
9629 arg1
= ada_coerce_ref (arg1
);
9631 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9632 arg1
= ada_coerce_to_simple_array (arg1
);
9634 type
= ada_index_type (value_type (arg1
), tem
,
9635 ada_attribute_name (op
));
9637 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9639 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9640 return allocate_value (type
);
9644 default: /* Should never happen. */
9645 error (_("unexpected attribute encountered"));
9647 return value_from_longest
9648 (type
, ada_array_bound (arg1
, tem
, 0));
9650 return value_from_longest
9651 (type
, ada_array_bound (arg1
, tem
, 1));
9653 return value_from_longest
9654 (type
, ada_array_length (arg1
, tem
));
9657 else if (discrete_type_p (type_arg
))
9659 struct type
*range_type
;
9660 char *name
= ada_type_name (type_arg
);
9663 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9664 range_type
= to_fixed_range_type (type_arg
, NULL
);
9665 if (range_type
== NULL
)
9666 range_type
= type_arg
;
9670 error (_("unexpected attribute encountered"));
9672 return value_from_longest
9673 (range_type
, ada_discrete_type_low_bound (range_type
));
9675 return value_from_longest
9676 (range_type
, ada_discrete_type_high_bound (range_type
));
9678 error (_("the 'length attribute applies only to array types"));
9681 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9682 error (_("unimplemented type attribute"));
9687 if (ada_is_constrained_packed_array_type (type_arg
))
9688 type_arg
= decode_constrained_packed_array_type (type_arg
);
9690 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
9692 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9694 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9695 return allocate_value (type
);
9700 error (_("unexpected attribute encountered"));
9702 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9703 return value_from_longest (type
, low
);
9705 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9706 return value_from_longest (type
, high
);
9708 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9709 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9710 return value_from_longest (type
, high
- low
+ 1);
9716 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9717 if (noside
== EVAL_SKIP
)
9720 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9721 return value_zero (ada_tag_type (arg1
), not_lval
);
9723 return ada_value_tag (arg1
);
9727 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9728 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9729 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9730 if (noside
== EVAL_SKIP
)
9732 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9733 return value_zero (value_type (arg1
), not_lval
);
9736 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9737 return value_binop (arg1
, arg2
,
9738 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9741 case OP_ATR_MODULUS
:
9743 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9745 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9746 if (noside
== EVAL_SKIP
)
9749 if (!ada_is_modular_type (type_arg
))
9750 error (_("'modulus must be applied to modular type"));
9752 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9753 ada_modulus (type_arg
));
9758 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9759 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9760 if (noside
== EVAL_SKIP
)
9762 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9763 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9764 return value_zero (type
, not_lval
);
9766 return value_pos_atr (type
, arg1
);
9769 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9770 type
= value_type (arg1
);
9772 /* If the argument is a reference, then dereference its type, since
9773 the user is really asking for the size of the actual object,
9774 not the size of the pointer. */
9775 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9776 type
= TYPE_TARGET_TYPE (type
);
9778 if (noside
== EVAL_SKIP
)
9780 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9781 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9783 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9784 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9787 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9788 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9789 type
= exp
->elts
[pc
+ 2].type
;
9790 if (noside
== EVAL_SKIP
)
9792 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9793 return value_zero (type
, not_lval
);
9795 return value_val_atr (type
, arg1
);
9798 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9799 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9800 if (noside
== EVAL_SKIP
)
9802 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9803 return value_zero (value_type (arg1
), not_lval
);
9806 /* For integer exponentiation operations,
9807 only promote the first argument. */
9808 if (is_integral_type (value_type (arg2
)))
9809 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9811 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9813 return value_binop (arg1
, arg2
, op
);
9817 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9818 if (noside
== EVAL_SKIP
)
9824 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9825 if (noside
== EVAL_SKIP
)
9827 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9828 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9829 return value_neg (arg1
);
9834 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9835 if (noside
== EVAL_SKIP
)
9837 type
= ada_check_typedef (value_type (arg1
));
9838 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9840 if (ada_is_array_descriptor_type (type
))
9841 /* GDB allows dereferencing GNAT array descriptors. */
9843 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9845 if (arrType
== NULL
)
9846 error (_("Attempt to dereference null array pointer."));
9847 return value_at_lazy (arrType
, 0);
9849 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9850 || TYPE_CODE (type
) == TYPE_CODE_REF
9851 /* In C you can dereference an array to get the 1st elt. */
9852 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9854 type
= to_static_fixed_type
9856 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9858 return value_zero (type
, lval_memory
);
9860 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9862 /* GDB allows dereferencing an int. */
9863 if (expect_type
== NULL
)
9864 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9869 to_static_fixed_type (ada_aligned_type (expect_type
));
9870 return value_zero (expect_type
, lval_memory
);
9874 error (_("Attempt to take contents of a non-pointer value."));
9876 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9877 type
= ada_check_typedef (value_type (arg1
));
9879 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9880 /* GDB allows dereferencing an int. If we were given
9881 the expect_type, then use that as the target type.
9882 Otherwise, assume that the target type is an int. */
9884 if (expect_type
!= NULL
)
9885 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9888 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9889 (CORE_ADDR
) value_as_address (arg1
));
9892 if (ada_is_array_descriptor_type (type
))
9893 /* GDB allows dereferencing GNAT array descriptors. */
9894 return ada_coerce_to_simple_array (arg1
);
9896 return ada_value_ind (arg1
);
9898 case STRUCTOP_STRUCT
:
9899 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9900 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9901 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9902 if (noside
== EVAL_SKIP
)
9904 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9906 struct type
*type1
= value_type (arg1
);
9908 if (ada_is_tagged_type (type1
, 1))
9910 type
= ada_lookup_struct_elt_type (type1
,
9911 &exp
->elts
[pc
+ 2].string
,
9914 /* In this case, we assume that the field COULD exist
9915 in some extension of the type. Return an object of
9916 "type" void, which will match any formal
9917 (see ada_type_match). */
9918 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
9923 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9926 return value_zero (ada_aligned_type (type
), lval_memory
);
9929 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
9930 arg1
= unwrap_value (arg1
);
9931 return ada_to_fixed_value (arg1
);
9934 /* The value is not supposed to be used. This is here to make it
9935 easier to accommodate expressions that contain types. */
9937 if (noside
== EVAL_SKIP
)
9939 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9940 return allocate_value (exp
->elts
[pc
+ 1].type
);
9942 error (_("Attempt to use a type name as an expression"));
9947 case OP_DISCRETE_RANGE
:
9950 if (noside
== EVAL_NORMAL
)
9954 error (_("Undefined name, ambiguous name, or renaming used in "
9955 "component association: %s."), &exp
->elts
[pc
+2].string
);
9957 error (_("Aggregates only allowed on the right of an assignment"));
9959 internal_error (__FILE__
, __LINE__
,
9960 _("aggregate apparently mangled"));
9963 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9965 for (tem
= 0; tem
< nargs
; tem
+= 1)
9966 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9971 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
9977 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9978 type name that encodes the 'small and 'delta information.
9979 Otherwise, return NULL. */
9982 fixed_type_info (struct type
*type
)
9984 const char *name
= ada_type_name (type
);
9985 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9987 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9989 const char *tail
= strstr (name
, "___XF_");
9996 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9997 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10002 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10005 ada_is_fixed_point_type (struct type
*type
)
10007 return fixed_type_info (type
) != NULL
;
10010 /* Return non-zero iff TYPE represents a System.Address type. */
10013 ada_is_system_address_type (struct type
*type
)
10015 return (TYPE_NAME (type
)
10016 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10019 /* Assuming that TYPE is the representation of an Ada fixed-point
10020 type, return its delta, or -1 if the type is malformed and the
10021 delta cannot be determined. */
10024 ada_delta (struct type
*type
)
10026 const char *encoding
= fixed_type_info (type
);
10029 /* Strictly speaking, num and den are encoded as integer. However,
10030 they may not fit into a long, and they will have to be converted
10031 to DOUBLEST anyway. So scan them as DOUBLEST. */
10032 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10039 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10040 factor ('SMALL value) associated with the type. */
10043 scaling_factor (struct type
*type
)
10045 const char *encoding
= fixed_type_info (type
);
10046 DOUBLEST num0
, den0
, num1
, den1
;
10049 /* Strictly speaking, num's and den's are encoded as integer. However,
10050 they may not fit into a long, and they will have to be converted
10051 to DOUBLEST anyway. So scan them as DOUBLEST. */
10052 n
= sscanf (encoding
,
10053 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10054 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10055 &num0
, &den0
, &num1
, &den1
);
10060 return num1
/ den1
;
10062 return num0
/ den0
;
10066 /* Assuming that X is the representation of a value of fixed-point
10067 type TYPE, return its floating-point equivalent. */
10070 ada_fixed_to_float (struct type
*type
, LONGEST x
)
10072 return (DOUBLEST
) x
*scaling_factor (type
);
10075 /* The representation of a fixed-point value of type TYPE
10076 corresponding to the value X. */
10079 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
10081 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
10088 /* Scan STR beginning at position K for a discriminant name, and
10089 return the value of that discriminant field of DVAL in *PX. If
10090 PNEW_K is not null, put the position of the character beyond the
10091 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10092 not alter *PX and *PNEW_K if unsuccessful. */
10095 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
10098 static char *bound_buffer
= NULL
;
10099 static size_t bound_buffer_len
= 0;
10102 struct value
*bound_val
;
10104 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
10107 pend
= strstr (str
+ k
, "__");
10111 k
+= strlen (bound
);
10115 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
10116 bound
= bound_buffer
;
10117 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
10118 bound
[pend
- (str
+ k
)] = '\0';
10122 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
10123 if (bound_val
== NULL
)
10126 *px
= value_as_long (bound_val
);
10127 if (pnew_k
!= NULL
)
10132 /* Value of variable named NAME in the current environment. If
10133 no such variable found, then if ERR_MSG is null, returns 0, and
10134 otherwise causes an error with message ERR_MSG. */
10136 static struct value
*
10137 get_var_value (char *name
, char *err_msg
)
10139 struct ada_symbol_info
*syms
;
10142 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
10147 if (err_msg
== NULL
)
10150 error (("%s"), err_msg
);
10153 return value_of_variable (syms
[0].sym
, syms
[0].block
);
10156 /* Value of integer variable named NAME in the current environment. If
10157 no such variable found, returns 0, and sets *FLAG to 0. If
10158 successful, sets *FLAG to 1. */
10161 get_int_var_value (char *name
, int *flag
)
10163 struct value
*var_val
= get_var_value (name
, 0);
10175 return value_as_long (var_val
);
10180 /* Return a range type whose base type is that of the range type named
10181 NAME in the current environment, and whose bounds are calculated
10182 from NAME according to the GNAT range encoding conventions.
10183 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10184 corresponding range type from debug information; fall back to using it
10185 if symbol lookup fails. If a new type must be created, allocate it
10186 like ORIG_TYPE was. The bounds information, in general, is encoded
10187 in NAME, the base type given in the named range type. */
10189 static struct type
*
10190 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
10193 struct type
*base_type
;
10194 char *subtype_info
;
10196 gdb_assert (raw_type
!= NULL
);
10197 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
10199 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
10200 base_type
= TYPE_TARGET_TYPE (raw_type
);
10202 base_type
= raw_type
;
10204 name
= TYPE_NAME (raw_type
);
10205 subtype_info
= strstr (name
, "___XD");
10206 if (subtype_info
== NULL
)
10208 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
10209 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
10211 if (L
< INT_MIN
|| U
> INT_MAX
)
10214 return create_range_type (alloc_type_copy (raw_type
), raw_type
,
10215 ada_discrete_type_low_bound (raw_type
),
10216 ada_discrete_type_high_bound (raw_type
));
10220 static char *name_buf
= NULL
;
10221 static size_t name_len
= 0;
10222 int prefix_len
= subtype_info
- name
;
10228 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
10229 strncpy (name_buf
, name
, prefix_len
);
10230 name_buf
[prefix_len
] = '\0';
10233 bounds_str
= strchr (subtype_info
, '_');
10236 if (*subtype_info
== 'L')
10238 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
10239 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
10241 if (bounds_str
[n
] == '_')
10243 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
10251 strcpy (name_buf
+ prefix_len
, "___L");
10252 L
= get_int_var_value (name_buf
, &ok
);
10255 lim_warning (_("Unknown lower bound, using 1."));
10260 if (*subtype_info
== 'U')
10262 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
10263 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
10270 strcpy (name_buf
+ prefix_len
, "___U");
10271 U
= get_int_var_value (name_buf
, &ok
);
10274 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
10279 type
= create_range_type (alloc_type_copy (raw_type
), base_type
, L
, U
);
10280 TYPE_NAME (type
) = name
;
10285 /* True iff NAME is the name of a range type. */
10288 ada_is_range_type_name (const char *name
)
10290 return (name
!= NULL
&& strstr (name
, "___XD"));
10294 /* Modular types */
10296 /* True iff TYPE is an Ada modular type. */
10299 ada_is_modular_type (struct type
*type
)
10301 struct type
*subranged_type
= base_type (type
);
10303 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
10304 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
10305 && TYPE_UNSIGNED (subranged_type
));
10308 /* Try to determine the lower and upper bounds of the given modular type
10309 using the type name only. Return non-zero and set L and U as the lower
10310 and upper bounds (respectively) if successful. */
10313 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
10315 char *name
= ada_type_name (type
);
10323 /* Discrete type bounds are encoded using an __XD suffix. In our case,
10324 we are looking for static bounds, which means an __XDLU suffix.
10325 Moreover, we know that the lower bound of modular types is always
10326 zero, so the actual suffix should start with "__XDLU_0__", and
10327 then be followed by the upper bound value. */
10328 suffix
= strstr (name
, "__XDLU_0__");
10329 if (suffix
== NULL
)
10332 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
10335 *modulus
= (ULONGEST
) U
+ 1;
10339 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10342 ada_modulus (struct type
*type
)
10344 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
10348 /* Ada exception catchpoint support:
10349 ---------------------------------
10351 We support 3 kinds of exception catchpoints:
10352 . catchpoints on Ada exceptions
10353 . catchpoints on unhandled Ada exceptions
10354 . catchpoints on failed assertions
10356 Exceptions raised during failed assertions, or unhandled exceptions
10357 could perfectly be caught with the general catchpoint on Ada exceptions.
10358 However, we can easily differentiate these two special cases, and having
10359 the option to distinguish these two cases from the rest can be useful
10360 to zero-in on certain situations.
10362 Exception catchpoints are a specialized form of breakpoint,
10363 since they rely on inserting breakpoints inside known routines
10364 of the GNAT runtime. The implementation therefore uses a standard
10365 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10368 Support in the runtime for exception catchpoints have been changed
10369 a few times already, and these changes affect the implementation
10370 of these catchpoints. In order to be able to support several
10371 variants of the runtime, we use a sniffer that will determine
10372 the runtime variant used by the program being debugged.
10374 At this time, we do not support the use of conditions on Ada exception
10375 catchpoints. The COND and COND_STRING fields are therefore set
10376 to NULL (most of the time, see below).
10378 Conditions where EXP_STRING, COND, and COND_STRING are used:
10380 When a user specifies the name of a specific exception in the case
10381 of catchpoints on Ada exceptions, we store the name of that exception
10382 in the EXP_STRING. We then translate this request into an actual
10383 condition stored in COND_STRING, and then parse it into an expression
10386 /* The different types of catchpoints that we introduced for catching
10389 enum exception_catchpoint_kind
10391 ex_catch_exception
,
10392 ex_catch_exception_unhandled
,
10396 /* Ada's standard exceptions. */
10398 static char *standard_exc
[] = {
10399 "constraint_error",
10405 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10407 /* A structure that describes how to support exception catchpoints
10408 for a given executable. */
10410 struct exception_support_info
10412 /* The name of the symbol to break on in order to insert
10413 a catchpoint on exceptions. */
10414 const char *catch_exception_sym
;
10416 /* The name of the symbol to break on in order to insert
10417 a catchpoint on unhandled exceptions. */
10418 const char *catch_exception_unhandled_sym
;
10420 /* The name of the symbol to break on in order to insert
10421 a catchpoint on failed assertions. */
10422 const char *catch_assert_sym
;
10424 /* Assuming that the inferior just triggered an unhandled exception
10425 catchpoint, this function is responsible for returning the address
10426 in inferior memory where the name of that exception is stored.
10427 Return zero if the address could not be computed. */
10428 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10431 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10432 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10434 /* The following exception support info structure describes how to
10435 implement exception catchpoints with the latest version of the
10436 Ada runtime (as of 2007-03-06). */
10438 static const struct exception_support_info default_exception_support_info
=
10440 "__gnat_debug_raise_exception", /* catch_exception_sym */
10441 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10442 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10443 ada_unhandled_exception_name_addr
10446 /* The following exception support info structure describes how to
10447 implement exception catchpoints with a slightly older version
10448 of the Ada runtime. */
10450 static const struct exception_support_info exception_support_info_fallback
=
10452 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10453 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10454 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10455 ada_unhandled_exception_name_addr_from_raise
10458 /* For each executable, we sniff which exception info structure to use
10459 and cache it in the following global variable. */
10461 static const struct exception_support_info
*exception_info
= NULL
;
10463 /* Inspect the Ada runtime and determine which exception info structure
10464 should be used to provide support for exception catchpoints.
10466 This function will always set exception_info, or raise an error. */
10469 ada_exception_support_info_sniffer (void)
10471 struct symbol
*sym
;
10473 /* If the exception info is already known, then no need to recompute it. */
10474 if (exception_info
!= NULL
)
10477 /* Check the latest (default) exception support info. */
10478 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
10482 exception_info
= &default_exception_support_info
;
10486 /* Try our fallback exception suport info. */
10487 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
10491 exception_info
= &exception_support_info_fallback
;
10495 /* Sometimes, it is normal for us to not be able to find the routine
10496 we are looking for. This happens when the program is linked with
10497 the shared version of the GNAT runtime, and the program has not been
10498 started yet. Inform the user of these two possible causes if
10501 if (ada_update_initial_language (language_unknown
) != language_ada
)
10502 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10504 /* If the symbol does not exist, then check that the program is
10505 already started, to make sure that shared libraries have been
10506 loaded. If it is not started, this may mean that the symbol is
10507 in a shared library. */
10509 if (ptid_get_pid (inferior_ptid
) == 0)
10510 error (_("Unable to insert catchpoint. Try to start the program first."));
10512 /* At this point, we know that we are debugging an Ada program and
10513 that the inferior has been started, but we still are not able to
10514 find the run-time symbols. That can mean that we are in
10515 configurable run time mode, or that a-except as been optimized
10516 out by the linker... In any case, at this point it is not worth
10517 supporting this feature. */
10519 error (_("Cannot insert catchpoints in this configuration."));
10522 /* An observer of "executable_changed" events.
10523 Its role is to clear certain cached values that need to be recomputed
10524 each time a new executable is loaded by GDB. */
10527 ada_executable_changed_observer (void)
10529 /* If the executable changed, then it is possible that the Ada runtime
10530 is different. So we need to invalidate the exception support info
10532 exception_info
= NULL
;
10535 /* True iff FRAME is very likely to be that of a function that is
10536 part of the runtime system. This is all very heuristic, but is
10537 intended to be used as advice as to what frames are uninteresting
10541 is_known_support_routine (struct frame_info
*frame
)
10543 struct symtab_and_line sal
;
10545 enum language func_lang
;
10548 /* If this code does not have any debugging information (no symtab),
10549 This cannot be any user code. */
10551 find_frame_sal (frame
, &sal
);
10552 if (sal
.symtab
== NULL
)
10555 /* If there is a symtab, but the associated source file cannot be
10556 located, then assume this is not user code: Selecting a frame
10557 for which we cannot display the code would not be very helpful
10558 for the user. This should also take care of case such as VxWorks
10559 where the kernel has some debugging info provided for a few units. */
10561 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10564 /* Check the unit filename againt the Ada runtime file naming.
10565 We also check the name of the objfile against the name of some
10566 known system libraries that sometimes come with debugging info
10569 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10571 re_comp (known_runtime_file_name_patterns
[i
]);
10572 if (re_exec (sal
.symtab
->filename
))
10574 if (sal
.symtab
->objfile
!= NULL
10575 && re_exec (sal
.symtab
->objfile
->name
))
10579 /* Check whether the function is a GNAT-generated entity. */
10581 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
10582 if (func_name
== NULL
)
10585 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10587 re_comp (known_auxiliary_function_name_patterns
[i
]);
10588 if (re_exec (func_name
))
10595 /* Find the first frame that contains debugging information and that is not
10596 part of the Ada run-time, starting from FI and moving upward. */
10599 ada_find_printable_frame (struct frame_info
*fi
)
10601 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10603 if (!is_known_support_routine (fi
))
10612 /* Assuming that the inferior just triggered an unhandled exception
10613 catchpoint, return the address in inferior memory where the name
10614 of the exception is stored.
10616 Return zero if the address could not be computed. */
10619 ada_unhandled_exception_name_addr (void)
10621 return parse_and_eval_address ("e.full_name");
10624 /* Same as ada_unhandled_exception_name_addr, except that this function
10625 should be used when the inferior uses an older version of the runtime,
10626 where the exception name needs to be extracted from a specific frame
10627 several frames up in the callstack. */
10630 ada_unhandled_exception_name_addr_from_raise (void)
10633 struct frame_info
*fi
;
10635 /* To determine the name of this exception, we need to select
10636 the frame corresponding to RAISE_SYM_NAME. This frame is
10637 at least 3 levels up, so we simply skip the first 3 frames
10638 without checking the name of their associated function. */
10639 fi
= get_current_frame ();
10640 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10642 fi
= get_prev_frame (fi
);
10647 enum language func_lang
;
10649 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
10650 if (func_name
!= NULL
10651 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10652 break; /* We found the frame we were looking for... */
10653 fi
= get_prev_frame (fi
);
10660 return parse_and_eval_address ("id.full_name");
10663 /* Assuming the inferior just triggered an Ada exception catchpoint
10664 (of any type), return the address in inferior memory where the name
10665 of the exception is stored, if applicable.
10667 Return zero if the address could not be computed, or if not relevant. */
10670 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10671 struct breakpoint
*b
)
10675 case ex_catch_exception
:
10676 return (parse_and_eval_address ("e.full_name"));
10679 case ex_catch_exception_unhandled
:
10680 return exception_info
->unhandled_exception_name_addr ();
10683 case ex_catch_assert
:
10684 return 0; /* Exception name is not relevant in this case. */
10688 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10692 return 0; /* Should never be reached. */
10695 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10696 any error that ada_exception_name_addr_1 might cause to be thrown.
10697 When an error is intercepted, a warning with the error message is printed,
10698 and zero is returned. */
10701 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10702 struct breakpoint
*b
)
10704 struct gdb_exception e
;
10705 CORE_ADDR result
= 0;
10707 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10709 result
= ada_exception_name_addr_1 (ex
, b
);
10714 warning (_("failed to get exception name: %s"), e
.message
);
10721 /* Implement the PRINT_IT method in the breakpoint_ops structure
10722 for all exception catchpoint kinds. */
10724 static enum print_stop_action
10725 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10727 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10728 char exception_name
[256];
10732 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10733 exception_name
[sizeof (exception_name
) - 1] = '\0';
10736 ada_find_printable_frame (get_current_frame ());
10738 annotate_catchpoint (b
->number
);
10741 case ex_catch_exception
:
10743 printf_filtered (_("\nCatchpoint %d, %s at "),
10744 b
->number
, exception_name
);
10746 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10748 case ex_catch_exception_unhandled
:
10750 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10751 b
->number
, exception_name
);
10753 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10756 case ex_catch_assert
:
10757 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10762 return PRINT_SRC_AND_LOC
;
10765 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10766 for all exception catchpoint kinds. */
10769 print_one_exception (enum exception_catchpoint_kind ex
,
10770 struct breakpoint
*b
, struct bp_location
**last_loc
)
10772 struct value_print_options opts
;
10774 get_user_print_options (&opts
);
10775 if (opts
.addressprint
)
10777 annotate_field (4);
10778 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
10781 annotate_field (5);
10782 *last_loc
= b
->loc
;
10785 case ex_catch_exception
:
10786 if (b
->exp_string
!= NULL
)
10788 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10790 ui_out_field_string (uiout
, "what", msg
);
10794 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10798 case ex_catch_exception_unhandled
:
10799 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10802 case ex_catch_assert
:
10803 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10807 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10812 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10813 for all exception catchpoint kinds. */
10816 print_mention_exception (enum exception_catchpoint_kind ex
,
10817 struct breakpoint
*b
)
10821 case ex_catch_exception
:
10822 if (b
->exp_string
!= NULL
)
10823 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10824 b
->number
, b
->exp_string
);
10826 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10830 case ex_catch_exception_unhandled
:
10831 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10835 case ex_catch_assert
:
10836 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10840 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10845 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
10846 for all exception catchpoint kinds. */
10849 print_recreate_exception (enum exception_catchpoint_kind ex
,
10850 struct breakpoint
*b
, struct ui_file
*fp
)
10854 case ex_catch_exception
:
10855 fprintf_filtered (fp
, "catch exception");
10856 if (b
->exp_string
!= NULL
)
10857 fprintf_filtered (fp
, " %s", b
->exp_string
);
10860 case ex_catch_exception_unhandled
:
10861 fprintf_filtered (fp
, "catch exception unhandled");
10864 case ex_catch_assert
:
10865 fprintf_filtered (fp
, "catch assert");
10869 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10873 /* Virtual table for "catch exception" breakpoints. */
10875 static enum print_stop_action
10876 print_it_catch_exception (struct breakpoint
*b
)
10878 return print_it_exception (ex_catch_exception
, b
);
10882 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
10884 print_one_exception (ex_catch_exception
, b
, last_loc
);
10888 print_mention_catch_exception (struct breakpoint
*b
)
10890 print_mention_exception (ex_catch_exception
, b
);
10894 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
10896 print_recreate_exception (ex_catch_exception
, b
, fp
);
10899 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10903 NULL
, /* breakpoint_hit */
10904 print_it_catch_exception
,
10905 print_one_catch_exception
,
10906 print_mention_catch_exception
,
10907 print_recreate_catch_exception
10910 /* Virtual table for "catch exception unhandled" breakpoints. */
10912 static enum print_stop_action
10913 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10915 return print_it_exception (ex_catch_exception_unhandled
, b
);
10919 print_one_catch_exception_unhandled (struct breakpoint
*b
,
10920 struct bp_location
**last_loc
)
10922 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
10926 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10928 print_mention_exception (ex_catch_exception_unhandled
, b
);
10932 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
10933 struct ui_file
*fp
)
10935 print_recreate_exception (ex_catch_exception_unhandled
, b
, fp
);
10938 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10941 NULL
, /* breakpoint_hit */
10942 print_it_catch_exception_unhandled
,
10943 print_one_catch_exception_unhandled
,
10944 print_mention_catch_exception_unhandled
,
10945 print_recreate_catch_exception_unhandled
10948 /* Virtual table for "catch assert" breakpoints. */
10950 static enum print_stop_action
10951 print_it_catch_assert (struct breakpoint
*b
)
10953 return print_it_exception (ex_catch_assert
, b
);
10957 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
10959 print_one_exception (ex_catch_assert
, b
, last_loc
);
10963 print_mention_catch_assert (struct breakpoint
*b
)
10965 print_mention_exception (ex_catch_assert
, b
);
10969 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
10971 print_recreate_exception (ex_catch_assert
, b
, fp
);
10974 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10977 NULL
, /* breakpoint_hit */
10978 print_it_catch_assert
,
10979 print_one_catch_assert
,
10980 print_mention_catch_assert
,
10981 print_recreate_catch_assert
10984 /* Return non-zero if B is an Ada exception catchpoint. */
10987 ada_exception_catchpoint_p (struct breakpoint
*b
)
10989 return (b
->ops
== &catch_exception_breakpoint_ops
10990 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10991 || b
->ops
== &catch_assert_breakpoint_ops
);
10994 /* Return a newly allocated copy of the first space-separated token
10995 in ARGSP, and then adjust ARGSP to point immediately after that
10998 Return NULL if ARGPS does not contain any more tokens. */
11001 ada_get_next_arg (char **argsp
)
11003 char *args
= *argsp
;
11007 /* Skip any leading white space. */
11009 while (isspace (*args
))
11012 if (args
[0] == '\0')
11013 return NULL
; /* No more arguments. */
11015 /* Find the end of the current argument. */
11018 while (*end
!= '\0' && !isspace (*end
))
11021 /* Adjust ARGSP to point to the start of the next argument. */
11025 /* Make a copy of the current argument and return it. */
11027 result
= xmalloc (end
- args
+ 1);
11028 strncpy (result
, args
, end
- args
);
11029 result
[end
- args
] = '\0';
11034 /* Split the arguments specified in a "catch exception" command.
11035 Set EX to the appropriate catchpoint type.
11036 Set EXP_STRING to the name of the specific exception if
11037 specified by the user. */
11040 catch_ada_exception_command_split (char *args
,
11041 enum exception_catchpoint_kind
*ex
,
11044 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
11045 char *exception_name
;
11047 exception_name
= ada_get_next_arg (&args
);
11048 make_cleanup (xfree
, exception_name
);
11050 /* Check that we do not have any more arguments. Anything else
11053 while (isspace (*args
))
11056 if (args
[0] != '\0')
11057 error (_("Junk at end of expression"));
11059 discard_cleanups (old_chain
);
11061 if (exception_name
== NULL
)
11063 /* Catch all exceptions. */
11064 *ex
= ex_catch_exception
;
11065 *exp_string
= NULL
;
11067 else if (strcmp (exception_name
, "unhandled") == 0)
11069 /* Catch unhandled exceptions. */
11070 *ex
= ex_catch_exception_unhandled
;
11071 *exp_string
= NULL
;
11075 /* Catch a specific exception. */
11076 *ex
= ex_catch_exception
;
11077 *exp_string
= exception_name
;
11081 /* Return the name of the symbol on which we should break in order to
11082 implement a catchpoint of the EX kind. */
11084 static const char *
11085 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
11087 gdb_assert (exception_info
!= NULL
);
11091 case ex_catch_exception
:
11092 return (exception_info
->catch_exception_sym
);
11094 case ex_catch_exception_unhandled
:
11095 return (exception_info
->catch_exception_unhandled_sym
);
11097 case ex_catch_assert
:
11098 return (exception_info
->catch_assert_sym
);
11101 internal_error (__FILE__
, __LINE__
,
11102 _("unexpected catchpoint kind (%d)"), ex
);
11106 /* Return the breakpoint ops "virtual table" used for catchpoints
11109 static struct breakpoint_ops
*
11110 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
11114 case ex_catch_exception
:
11115 return (&catch_exception_breakpoint_ops
);
11117 case ex_catch_exception_unhandled
:
11118 return (&catch_exception_unhandled_breakpoint_ops
);
11120 case ex_catch_assert
:
11121 return (&catch_assert_breakpoint_ops
);
11124 internal_error (__FILE__
, __LINE__
,
11125 _("unexpected catchpoint kind (%d)"), ex
);
11129 /* Return the condition that will be used to match the current exception
11130 being raised with the exception that the user wants to catch. This
11131 assumes that this condition is used when the inferior just triggered
11132 an exception catchpoint.
11134 The string returned is a newly allocated string that needs to be
11135 deallocated later. */
11138 ada_exception_catchpoint_cond_string (const char *exp_string
)
11142 /* The standard exceptions are a special case. They are defined in
11143 runtime units that have been compiled without debugging info; if
11144 EXP_STRING is the not-fully-qualified name of a standard
11145 exception (e.g. "constraint_error") then, during the evaluation
11146 of the condition expression, the symbol lookup on this name would
11147 *not* return this standard exception. The catchpoint condition
11148 may then be set only on user-defined exceptions which have the
11149 same not-fully-qualified name (e.g. my_package.constraint_error).
11151 To avoid this unexcepted behavior, these standard exceptions are
11152 systematically prefixed by "standard". This means that "catch
11153 exception constraint_error" is rewritten into "catch exception
11154 standard.constraint_error".
11156 If an exception named contraint_error is defined in another package of
11157 the inferior program, then the only way to specify this exception as a
11158 breakpoint condition is to use its fully-qualified named:
11159 e.g. my_package.constraint_error. */
11161 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
11163 if (strcmp (standard_exc
[i
], exp_string
) == 0)
11165 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11169 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
11172 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
11174 static struct expression
*
11175 ada_parse_catchpoint_condition (char *cond_string
,
11176 struct symtab_and_line sal
)
11178 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
11181 /* Return the symtab_and_line that should be used to insert an exception
11182 catchpoint of the TYPE kind.
11184 EX_STRING should contain the name of a specific exception
11185 that the catchpoint should catch, or NULL otherwise.
11187 The idea behind all the remaining parameters is that their names match
11188 the name of certain fields in the breakpoint structure that are used to
11189 handle exception catchpoints. This function returns the value to which
11190 these fields should be set, depending on the type of catchpoint we need
11193 If COND and COND_STRING are both non-NULL, any value they might
11194 hold will be free'ed, and then replaced by newly allocated ones.
11195 These parameters are left untouched otherwise. */
11197 static struct symtab_and_line
11198 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
11199 char **addr_string
, char **cond_string
,
11200 struct expression
**cond
, struct breakpoint_ops
**ops
)
11202 const char *sym_name
;
11203 struct symbol
*sym
;
11204 struct symtab_and_line sal
;
11206 /* First, find out which exception support info to use. */
11207 ada_exception_support_info_sniffer ();
11209 /* Then lookup the function on which we will break in order to catch
11210 the Ada exceptions requested by the user. */
11212 sym_name
= ada_exception_sym_name (ex
);
11213 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
11215 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11216 that should be compiled with debugging information. As a result, we
11217 expect to find that symbol in the symtabs. If we don't find it, then
11218 the target most likely does not support Ada exceptions, or we cannot
11219 insert exception breakpoints yet, because the GNAT runtime hasn't been
11222 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
11223 in such a way that no debugging information is produced for the symbol
11224 we are looking for. In this case, we could search the minimal symbols
11225 as a fall-back mechanism. This would still be operating in degraded
11226 mode, however, as we would still be missing the debugging information
11227 that is needed in order to extract the name of the exception being
11228 raised (this name is printed in the catchpoint message, and is also
11229 used when trying to catch a specific exception). We do not handle
11230 this case for now. */
11233 error (_("Unable to break on '%s' in this configuration."), sym_name
);
11235 /* Make sure that the symbol we found corresponds to a function. */
11236 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11237 error (_("Symbol \"%s\" is not a function (class = %d)"),
11238 sym_name
, SYMBOL_CLASS (sym
));
11240 sal
= find_function_start_sal (sym
, 1);
11242 /* Set ADDR_STRING. */
11244 *addr_string
= xstrdup (sym_name
);
11246 /* Set the COND and COND_STRING (if not NULL). */
11248 if (cond_string
!= NULL
&& cond
!= NULL
)
11250 if (*cond_string
!= NULL
)
11252 xfree (*cond_string
);
11253 *cond_string
= NULL
;
11260 if (exp_string
!= NULL
)
11262 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
11263 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
11268 *ops
= ada_exception_breakpoint_ops (ex
);
11273 /* Parse the arguments (ARGS) of the "catch exception" command.
11275 Set TYPE to the appropriate exception catchpoint type.
11276 If the user asked the catchpoint to catch only a specific
11277 exception, then save the exception name in ADDR_STRING.
11279 See ada_exception_sal for a description of all the remaining
11280 function arguments of this function. */
11282 struct symtab_and_line
11283 ada_decode_exception_location (char *args
, char **addr_string
,
11284 char **exp_string
, char **cond_string
,
11285 struct expression
**cond
,
11286 struct breakpoint_ops
**ops
)
11288 enum exception_catchpoint_kind ex
;
11290 catch_ada_exception_command_split (args
, &ex
, exp_string
);
11291 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
11295 struct symtab_and_line
11296 ada_decode_assert_location (char *args
, char **addr_string
,
11297 struct breakpoint_ops
**ops
)
11299 /* Check that no argument where provided at the end of the command. */
11303 while (isspace (*args
))
11306 error (_("Junk at end of arguments."));
11309 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
11314 /* Information about operators given special treatment in functions
11316 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
11318 #define ADA_OPERATORS \
11319 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
11320 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
11321 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
11322 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
11323 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
11324 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
11325 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
11326 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
11327 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
11328 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
11329 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
11330 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
11331 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
11332 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
11333 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
11334 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
11335 OP_DEFN (OP_OTHERS, 1, 1, 0) \
11336 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
11337 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
11340 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
11343 switch (exp
->elts
[pc
- 1].opcode
)
11346 operator_length_standard (exp
, pc
, oplenp
, argsp
);
11349 #define OP_DEFN(op, len, args, binop) \
11350 case op: *oplenp = len; *argsp = args; break;
11356 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
11361 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
11366 /* Implementation of the exp_descriptor method operator_check. */
11369 ada_operator_check (struct expression
*exp
, int pos
,
11370 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
11373 const union exp_element
*const elts
= exp
->elts
;
11374 struct type
*type
= NULL
;
11376 switch (elts
[pos
].opcode
)
11378 case UNOP_IN_RANGE
:
11380 type
= elts
[pos
+ 1].type
;
11384 return operator_check_standard (exp
, pos
, objfile_func
, data
);
11387 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
11389 if (type
&& TYPE_OBJFILE (type
)
11390 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
11397 ada_op_name (enum exp_opcode opcode
)
11402 return op_name_standard (opcode
);
11404 #define OP_DEFN(op, len, args, binop) case op: return #op;
11409 return "OP_AGGREGATE";
11411 return "OP_CHOICES";
11417 /* As for operator_length, but assumes PC is pointing at the first
11418 element of the operator, and gives meaningful results only for the
11419 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
11422 ada_forward_operator_length (struct expression
*exp
, int pc
,
11423 int *oplenp
, int *argsp
)
11425 switch (exp
->elts
[pc
].opcode
)
11428 *oplenp
= *argsp
= 0;
11431 #define OP_DEFN(op, len, args, binop) \
11432 case op: *oplenp = len; *argsp = args; break;
11438 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11443 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
11449 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11451 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
11459 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
11461 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
11466 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
11470 /* Ada attributes ('Foo). */
11473 case OP_ATR_LENGTH
:
11477 case OP_ATR_MODULUS
:
11484 case UNOP_IN_RANGE
:
11486 /* XXX: gdb_sprint_host_address, type_sprint */
11487 fprintf_filtered (stream
, _("Type @"));
11488 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
11489 fprintf_filtered (stream
, " (");
11490 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
11491 fprintf_filtered (stream
, ")");
11493 case BINOP_IN_BOUNDS
:
11494 fprintf_filtered (stream
, " (%d)",
11495 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
11497 case TERNOP_IN_RANGE
:
11502 case OP_DISCRETE_RANGE
:
11503 case OP_POSITIONAL
:
11510 char *name
= &exp
->elts
[elt
+ 2].string
;
11511 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
11513 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
11518 return dump_subexp_body_standard (exp
, stream
, elt
);
11522 for (i
= 0; i
< nargs
; i
+= 1)
11523 elt
= dump_subexp (exp
, stream
, elt
);
11528 /* The Ada extension of print_subexp (q.v.). */
11531 ada_print_subexp (struct expression
*exp
, int *pos
,
11532 struct ui_file
*stream
, enum precedence prec
)
11534 int oplen
, nargs
, i
;
11536 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
11538 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11545 print_subexp_standard (exp
, pos
, stream
, prec
);
11549 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
11552 case BINOP_IN_BOUNDS
:
11553 /* XXX: sprint_subexp */
11554 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11555 fputs_filtered (" in ", stream
);
11556 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11557 fputs_filtered ("'range", stream
);
11558 if (exp
->elts
[pc
+ 1].longconst
> 1)
11559 fprintf_filtered (stream
, "(%ld)",
11560 (long) exp
->elts
[pc
+ 1].longconst
);
11563 case TERNOP_IN_RANGE
:
11564 if (prec
>= PREC_EQUAL
)
11565 fputs_filtered ("(", stream
);
11566 /* XXX: sprint_subexp */
11567 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11568 fputs_filtered (" in ", stream
);
11569 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11570 fputs_filtered (" .. ", stream
);
11571 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11572 if (prec
>= PREC_EQUAL
)
11573 fputs_filtered (")", stream
);
11578 case OP_ATR_LENGTH
:
11582 case OP_ATR_MODULUS
:
11587 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11589 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
11590 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
11594 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11595 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
11600 for (tem
= 1; tem
< nargs
; tem
+= 1)
11602 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
11603 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
11605 fputs_filtered (")", stream
);
11610 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
11611 fputs_filtered ("'(", stream
);
11612 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
11613 fputs_filtered (")", stream
);
11616 case UNOP_IN_RANGE
:
11617 /* XXX: sprint_subexp */
11618 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11619 fputs_filtered (" in ", stream
);
11620 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
11623 case OP_DISCRETE_RANGE
:
11624 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11625 fputs_filtered ("..", stream
);
11626 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11630 fputs_filtered ("others => ", stream
);
11631 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11635 for (i
= 0; i
< nargs
-1; i
+= 1)
11638 fputs_filtered ("|", stream
);
11639 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11641 fputs_filtered (" => ", stream
);
11642 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11645 case OP_POSITIONAL
:
11646 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11650 fputs_filtered ("(", stream
);
11651 for (i
= 0; i
< nargs
; i
+= 1)
11654 fputs_filtered (", ", stream
);
11655 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11657 fputs_filtered (")", stream
);
11662 /* Table mapping opcodes into strings for printing operators
11663 and precedences of the operators. */
11665 static const struct op_print ada_op_print_tab
[] = {
11666 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
11667 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
11668 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
11669 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
11670 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
11671 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
11672 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
11673 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
11674 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
11675 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
11676 {">", BINOP_GTR
, PREC_ORDER
, 0},
11677 {"<", BINOP_LESS
, PREC_ORDER
, 0},
11678 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
11679 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
11680 {"+", BINOP_ADD
, PREC_ADD
, 0},
11681 {"-", BINOP_SUB
, PREC_ADD
, 0},
11682 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
11683 {"*", BINOP_MUL
, PREC_MUL
, 0},
11684 {"/", BINOP_DIV
, PREC_MUL
, 0},
11685 {"rem", BINOP_REM
, PREC_MUL
, 0},
11686 {"mod", BINOP_MOD
, PREC_MUL
, 0},
11687 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
11688 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
11689 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
11690 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
11691 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
11692 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
11693 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
11694 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
11695 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
11696 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
11700 enum ada_primitive_types
{
11701 ada_primitive_type_int
,
11702 ada_primitive_type_long
,
11703 ada_primitive_type_short
,
11704 ada_primitive_type_char
,
11705 ada_primitive_type_float
,
11706 ada_primitive_type_double
,
11707 ada_primitive_type_void
,
11708 ada_primitive_type_long_long
,
11709 ada_primitive_type_long_double
,
11710 ada_primitive_type_natural
,
11711 ada_primitive_type_positive
,
11712 ada_primitive_type_system_address
,
11713 nr_ada_primitive_types
11717 ada_language_arch_info (struct gdbarch
*gdbarch
,
11718 struct language_arch_info
*lai
)
11720 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
11722 lai
->primitive_type_vector
11723 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
11726 lai
->primitive_type_vector
[ada_primitive_type_int
]
11727 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11729 lai
->primitive_type_vector
[ada_primitive_type_long
]
11730 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
11731 0, "long_integer");
11732 lai
->primitive_type_vector
[ada_primitive_type_short
]
11733 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
11734 0, "short_integer");
11735 lai
->string_char_type
11736 = lai
->primitive_type_vector
[ada_primitive_type_char
]
11737 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
11738 lai
->primitive_type_vector
[ada_primitive_type_float
]
11739 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
11741 lai
->primitive_type_vector
[ada_primitive_type_double
]
11742 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11743 "long_float", NULL
);
11744 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
11745 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
11746 0, "long_long_integer");
11747 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
11748 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11749 "long_long_float", NULL
);
11750 lai
->primitive_type_vector
[ada_primitive_type_natural
]
11751 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11753 lai
->primitive_type_vector
[ada_primitive_type_positive
]
11754 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11756 lai
->primitive_type_vector
[ada_primitive_type_void
]
11757 = builtin
->builtin_void
;
11759 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
11760 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
11761 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11762 = "system__address";
11764 lai
->bool_type_symbol
= NULL
;
11765 lai
->bool_type_default
= builtin
->builtin_bool
;
11768 /* Language vector */
11770 /* Not really used, but needed in the ada_language_defn. */
11773 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
11775 ada_emit_char (c
, type
, stream
, quoter
, 1);
11781 warnings_issued
= 0;
11782 return ada_parse ();
11785 static const struct exp_descriptor ada_exp_descriptor
= {
11787 ada_operator_length
,
11788 ada_operator_check
,
11790 ada_dump_subexp_body
,
11791 ada_evaluate_subexp
11794 const struct language_defn ada_language_defn
= {
11795 "ada", /* Language name */
11799 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11800 that's not quite what this means. */
11802 macro_expansion_no
,
11803 &ada_exp_descriptor
,
11807 ada_printchar
, /* Print a character constant */
11808 ada_printstr
, /* Function to print string constant */
11809 emit_char
, /* Function to print single char (not used) */
11810 ada_print_type
, /* Print a type using appropriate syntax */
11811 ada_print_typedef
, /* Print a typedef using appropriate syntax */
11812 ada_val_print
, /* Print a value using appropriate syntax */
11813 ada_value_print
, /* Print a top-level value */
11814 NULL
, /* Language specific skip_trampoline */
11815 NULL
, /* name_of_this */
11816 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11817 basic_lookup_transparent_type
, /* lookup_transparent_type */
11818 ada_la_decode
, /* Language specific symbol demangler */
11819 NULL
, /* Language specific
11820 class_name_from_physname */
11821 ada_op_print_tab
, /* expression operators for printing */
11822 0, /* c-style arrays */
11823 1, /* String lower bound */
11824 ada_get_gdb_completer_word_break_characters
,
11825 ada_make_symbol_completion_list
,
11826 ada_language_arch_info
,
11827 ada_print_array_index
,
11828 default_pass_by_reference
,
11833 /* Provide a prototype to silence -Wmissing-prototypes. */
11834 extern initialize_file_ftype _initialize_ada_language
;
11836 /* Command-list for the "set/show ada" prefix command. */
11837 static struct cmd_list_element
*set_ada_list
;
11838 static struct cmd_list_element
*show_ada_list
;
11840 /* Implement the "set ada" prefix command. */
11843 set_ada_command (char *arg
, int from_tty
)
11845 printf_unfiltered (_(\
11846 "\"set ada\" must be followed by the name of a setting.\n"));
11847 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
11850 /* Implement the "show ada" prefix command. */
11853 show_ada_command (char *args
, int from_tty
)
11855 cmd_show_list (show_ada_list
, from_tty
, "");
11859 _initialize_ada_language (void)
11861 add_language (&ada_language_defn
);
11863 add_prefix_cmd ("ada", no_class
, set_ada_command
,
11864 _("Prefix command for changing Ada-specfic settings"),
11865 &set_ada_list
, "set ada ", 0, &setlist
);
11867 add_prefix_cmd ("ada", no_class
, show_ada_command
,
11868 _("Generic command for showing Ada-specific settings."),
11869 &show_ada_list
, "show ada ", 0, &showlist
);
11871 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
11872 &trust_pad_over_xvs
, _("\
11873 Enable or disable an optimization trusting PAD types over XVS types"), _("\
11874 Show whether an optimization trusting PAD types over XVS types is activated"),
11876 This is related to the encoding used by the GNAT compiler. The debugger\n\
11877 should normally trust the contents of PAD types, but certain older versions\n\
11878 of GNAT have a bug that sometimes causes the information in the PAD type\n\
11879 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
11880 work around this bug. It is always safe to turn this option \"off\", but\n\
11881 this incurs a slight performance penalty, so it is recommended to NOT change\n\
11882 this option to \"off\" unless necessary."),
11883 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
11885 varsize_limit
= 65536;
11887 obstack_init (&symbol_list_obstack
);
11889 decoded_names_store
= htab_create_alloc
11890 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11891 NULL
, xcalloc
, xfree
);
11893 observer_attach_executable_changed (ada_executable_changed_observer
);
11895 /* Setup per-inferior data. */
11896 observer_attach_inferior_exit (ada_inferior_exit
);
11898 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup
);