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"
63 #include "mi/mi-common.h"
64 #include "arch-utils.h"
65 #include "exceptions.h"
67 /* Define whether or not the C operator '/' truncates towards zero for
68 differently signed operands (truncation direction is undefined in C).
69 Copied from valarith.c. */
71 #ifndef TRUNCATION_TOWARDS_ZERO
72 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
75 static struct type
*desc_base_type (struct type
*);
77 static struct type
*desc_bounds_type (struct type
*);
79 static struct value
*desc_bounds (struct value
*);
81 static int fat_pntr_bounds_bitpos (struct type
*);
83 static int fat_pntr_bounds_bitsize (struct type
*);
85 static struct type
*desc_data_target_type (struct type
*);
87 static struct value
*desc_data (struct value
*);
89 static int fat_pntr_data_bitpos (struct type
*);
91 static int fat_pntr_data_bitsize (struct type
*);
93 static struct value
*desc_one_bound (struct value
*, int, int);
95 static int desc_bound_bitpos (struct type
*, int, int);
97 static int desc_bound_bitsize (struct type
*, int, int);
99 static struct type
*desc_index_type (struct type
*, int);
101 static int desc_arity (struct type
*);
103 static int ada_type_match (struct type
*, struct type
*, int);
105 static int ada_args_match (struct symbol
*, struct value
**, int);
107 static int full_match (const char *, const char *);
109 static struct value
*make_array_descriptor (struct type
*, struct value
*);
111 static void ada_add_block_symbols (struct obstack
*,
112 struct block
*, const char *,
113 domain_enum
, struct objfile
*, int);
115 static int is_nonfunction (struct ada_symbol_info
*, int);
117 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
120 static int num_defns_collected (struct obstack
*);
122 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
124 static struct value
*resolve_subexp (struct expression
**, int *, int,
127 static void replace_operator_with_call (struct expression
**, int, int, int,
128 struct symbol
*, struct block
*);
130 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
132 static char *ada_op_name (enum exp_opcode
);
134 static const char *ada_decoded_op_name (enum exp_opcode
);
136 static int numeric_type_p (struct type
*);
138 static int integer_type_p (struct type
*);
140 static int scalar_type_p (struct type
*);
142 static int discrete_type_p (struct type
*);
144 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
149 static struct symbol
*find_old_style_renaming_symbol (const char *,
152 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
155 static struct value
*evaluate_subexp_type (struct expression
*, int *);
157 static struct type
*ada_find_parallel_type_with_name (struct type
*,
160 static int is_dynamic_field (struct type
*, int);
162 static struct type
*to_fixed_variant_branch_type (struct type
*,
164 CORE_ADDR
, struct value
*);
166 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
168 static struct type
*to_fixed_range_type (struct type
*, struct value
*);
170 static struct type
*to_static_fixed_type (struct type
*);
171 static struct type
*static_unwrap_type (struct type
*type
);
173 static struct value
*unwrap_value (struct value
*);
175 static struct type
*constrained_packed_array_type (struct type
*, long *);
177 static struct type
*decode_constrained_packed_array_type (struct type
*);
179 static long decode_packed_array_bitsize (struct type
*);
181 static struct value
*decode_constrained_packed_array (struct value
*);
183 static int ada_is_packed_array_type (struct type
*);
185 static int ada_is_unconstrained_packed_array_type (struct type
*);
187 static struct value
*value_subscript_packed (struct value
*, int,
190 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
192 static struct value
*coerce_unspec_val_to_type (struct value
*,
195 static struct value
*get_var_value (char *, char *);
197 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
199 static int equiv_types (struct type
*, struct type
*);
201 static int is_name_suffix (const char *);
203 static int advance_wild_match (const char **, const char *, int);
205 static int wild_match (const char *, const char *);
207 static struct value
*ada_coerce_ref (struct value
*);
209 static LONGEST
pos_atr (struct value
*);
211 static struct value
*value_pos_atr (struct type
*, struct value
*);
213 static struct value
*value_val_atr (struct type
*, struct value
*);
215 static struct symbol
*standard_lookup (const char *, const struct block
*,
218 static struct value
*ada_search_struct_field (char *, struct value
*, int,
221 static struct value
*ada_value_primitive_field (struct value
*, int, int,
224 static int find_struct_field (char *, struct type
*, int,
225 struct type
**, int *, int *, int *, int *);
227 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
230 static int ada_resolve_function (struct ada_symbol_info
*, int,
231 struct value
**, int, const char *,
234 static int ada_is_direct_array_type (struct type
*);
236 static void ada_language_arch_info (struct gdbarch
*,
237 struct language_arch_info
*);
239 static void check_size (const struct type
*);
241 static struct value
*ada_index_struct_field (int, struct value
*, int,
244 static struct value
*assign_aggregate (struct value
*, struct value
*,
248 static void aggregate_assign_from_choices (struct value
*, struct value
*,
250 int *, LONGEST
*, int *,
251 int, LONGEST
, LONGEST
);
253 static void aggregate_assign_positional (struct value
*, struct value
*,
255 int *, LONGEST
*, int *, int,
259 static void aggregate_assign_others (struct value
*, struct value
*,
261 int *, LONGEST
*, int, LONGEST
, LONGEST
);
264 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
267 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
270 static void ada_forward_operator_length (struct expression
*, int, int *,
275 /* Maximum-sized dynamic type. */
276 static unsigned int varsize_limit
;
278 /* FIXME: brobecker/2003-09-17: No longer a const because it is
279 returned by a function that does not return a const char *. */
280 static char *ada_completer_word_break_characters
=
282 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
284 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
287 /* The name of the symbol to use to get the name of the main subprogram. */
288 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
289 = "__gnat_ada_main_program_name";
291 /* Limit on the number of warnings to raise per expression evaluation. */
292 static int warning_limit
= 2;
294 /* Number of warning messages issued; reset to 0 by cleanups after
295 expression evaluation. */
296 static int warnings_issued
= 0;
298 static const char *known_runtime_file_name_patterns
[] = {
299 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
302 static const char *known_auxiliary_function_name_patterns
[] = {
303 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
306 /* Space for allocating results of ada_lookup_symbol_list. */
307 static struct obstack symbol_list_obstack
;
309 /* Inferior-specific data. */
311 /* Per-inferior data for this module. */
313 struct ada_inferior_data
315 /* The ada__tags__type_specific_data type, which is used when decoding
316 tagged types. With older versions of GNAT, this type was directly
317 accessible through a component ("tsd") in the object tag. But this
318 is no longer the case, so we cache it for each inferior. */
319 struct type
*tsd_type
;
322 /* Our key to this module's inferior data. */
323 static const struct inferior_data
*ada_inferior_data
;
325 /* A cleanup routine for our inferior data. */
327 ada_inferior_data_cleanup (struct inferior
*inf
, void *arg
)
329 struct ada_inferior_data
*data
;
331 data
= inferior_data (inf
, ada_inferior_data
);
336 /* Return our inferior data for the given inferior (INF).
338 This function always returns a valid pointer to an allocated
339 ada_inferior_data structure. If INF's inferior data has not
340 been previously set, this functions creates a new one with all
341 fields set to zero, sets INF's inferior to it, and then returns
342 a pointer to that newly allocated ada_inferior_data. */
344 static struct ada_inferior_data
*
345 get_ada_inferior_data (struct inferior
*inf
)
347 struct ada_inferior_data
*data
;
349 data
= inferior_data (inf
, ada_inferior_data
);
352 data
= XZALLOC (struct ada_inferior_data
);
353 set_inferior_data (inf
, ada_inferior_data
, data
);
359 /* Perform all necessary cleanups regarding our module's inferior data
360 that is required after the inferior INF just exited. */
363 ada_inferior_exit (struct inferior
*inf
)
365 ada_inferior_data_cleanup (inf
, NULL
);
366 set_inferior_data (inf
, ada_inferior_data
, NULL
);
371 /* If TYPE is a TYPE_CODE_TYPEDEF type, return the target type after
372 all typedef layers have been peeled. Otherwise, return TYPE.
374 Normally, we really expect a typedef type to only have 1 typedef layer.
375 In other words, we really expect the target type of a typedef type to be
376 a non-typedef type. This is particularly true for Ada units, because
377 the language does not have a typedef vs not-typedef distinction.
378 In that respect, the Ada compiler has been trying to eliminate as many
379 typedef definitions in the debugging information, since they generally
380 do not bring any extra information (we still use typedef under certain
381 circumstances related mostly to the GNAT encoding).
383 Unfortunately, we have seen situations where the debugging information
384 generated by the compiler leads to such multiple typedef layers. For
385 instance, consider the following example with stabs:
387 .stabs "pck__float_array___XUP:Tt(0,46)=s16P_ARRAY:(0,47)=[...]"[...]
388 .stabs "pck__float_array___XUP:t(0,36)=(0,46)",128,0,6,0
390 This is an error in the debugging information which causes type
391 pck__float_array___XUP to be defined twice, and the second time,
392 it is defined as a typedef of a typedef.
394 This is on the fringe of legality as far as debugging information is
395 concerned, and certainly unexpected. But it is easy to handle these
396 situations correctly, so we can afford to be lenient in this case. */
399 ada_typedef_target_type (struct type
*type
)
401 while (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
402 type
= TYPE_TARGET_TYPE (type
);
406 /* Given DECODED_NAME a string holding a symbol name in its
407 decoded form (ie using the Ada dotted notation), returns
408 its unqualified name. */
411 ada_unqualified_name (const char *decoded_name
)
413 const char *result
= strrchr (decoded_name
, '.');
416 result
++; /* Skip the dot... */
418 result
= decoded_name
;
423 /* Return a string starting with '<', followed by STR, and '>'.
424 The result is good until the next call. */
427 add_angle_brackets (const char *str
)
429 static char *result
= NULL
;
432 result
= xstrprintf ("<%s>", str
);
437 ada_get_gdb_completer_word_break_characters (void)
439 return ada_completer_word_break_characters
;
442 /* Print an array element index using the Ada syntax. */
445 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
446 const struct value_print_options
*options
)
448 LA_VALUE_PRINT (index_value
, stream
, options
);
449 fprintf_filtered (stream
, " => ");
452 /* Assuming VECT points to an array of *SIZE objects of size
453 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
454 updating *SIZE as necessary and returning the (new) array. */
457 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
459 if (*size
< min_size
)
462 if (*size
< min_size
)
464 vect
= xrealloc (vect
, *size
* element_size
);
469 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
470 suffix of FIELD_NAME beginning "___". */
473 field_name_match (const char *field_name
, const char *target
)
475 int len
= strlen (target
);
478 (strncmp (field_name
, target
, len
) == 0
479 && (field_name
[len
] == '\0'
480 || (strncmp (field_name
+ len
, "___", 3) == 0
481 && strcmp (field_name
+ strlen (field_name
) - 6,
486 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
487 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
488 and return its index. This function also handles fields whose name
489 have ___ suffixes because the compiler sometimes alters their name
490 by adding such a suffix to represent fields with certain constraints.
491 If the field could not be found, return a negative number if
492 MAYBE_MISSING is set. Otherwise raise an error. */
495 ada_get_field_index (const struct type
*type
, const char *field_name
,
499 struct type
*struct_type
= check_typedef ((struct type
*) type
);
501 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
502 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
506 error (_("Unable to find field %s in struct %s. Aborting"),
507 field_name
, TYPE_NAME (struct_type
));
512 /* The length of the prefix of NAME prior to any "___" suffix. */
515 ada_name_prefix_len (const char *name
)
521 const char *p
= strstr (name
, "___");
524 return strlen (name
);
530 /* Return non-zero if SUFFIX is a suffix of STR.
531 Return zero if STR is null. */
534 is_suffix (const char *str
, const char *suffix
)
541 len2
= strlen (suffix
);
542 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
545 /* The contents of value VAL, treated as a value of type TYPE. The
546 result is an lval in memory if VAL is. */
548 static struct value
*
549 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
551 type
= ada_check_typedef (type
);
552 if (value_type (val
) == type
)
556 struct value
*result
;
558 /* Make sure that the object size is not unreasonable before
559 trying to allocate some memory for it. */
563 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
564 result
= allocate_value_lazy (type
);
567 result
= allocate_value (type
);
568 memcpy (value_contents_raw (result
), value_contents (val
),
571 set_value_component_location (result
, val
);
572 set_value_bitsize (result
, value_bitsize (val
));
573 set_value_bitpos (result
, value_bitpos (val
));
574 set_value_address (result
, value_address (val
));
579 static const gdb_byte
*
580 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
585 return valaddr
+ offset
;
589 cond_offset_target (CORE_ADDR address
, long offset
)
594 return address
+ offset
;
597 /* Issue a warning (as for the definition of warning in utils.c, but
598 with exactly one argument rather than ...), unless the limit on the
599 number of warnings has passed during the evaluation of the current
602 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
603 provided by "complaint". */
604 static void lim_warning (const char *format
, ...) ATTRIBUTE_PRINTF (1, 2);
607 lim_warning (const char *format
, ...)
611 va_start (args
, format
);
612 warnings_issued
+= 1;
613 if (warnings_issued
<= warning_limit
)
614 vwarning (format
, args
);
619 /* Issue an error if the size of an object of type T is unreasonable,
620 i.e. if it would be a bad idea to allocate a value of this type in
624 check_size (const struct type
*type
)
626 if (TYPE_LENGTH (type
) > varsize_limit
)
627 error (_("object size is larger than varsize-limit"));
630 /* Maximum value of a SIZE-byte signed integer type. */
632 max_of_size (int size
)
634 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
636 return top_bit
| (top_bit
- 1);
639 /* Minimum value of a SIZE-byte signed integer type. */
641 min_of_size (int size
)
643 return -max_of_size (size
) - 1;
646 /* Maximum value of a SIZE-byte unsigned integer type. */
648 umax_of_size (int size
)
650 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
652 return top_bit
| (top_bit
- 1);
655 /* Maximum value of integral type T, as a signed quantity. */
657 max_of_type (struct type
*t
)
659 if (TYPE_UNSIGNED (t
))
660 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
662 return max_of_size (TYPE_LENGTH (t
));
665 /* Minimum value of integral type T, as a signed quantity. */
667 min_of_type (struct type
*t
)
669 if (TYPE_UNSIGNED (t
))
672 return min_of_size (TYPE_LENGTH (t
));
675 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
677 ada_discrete_type_high_bound (struct type
*type
)
679 switch (TYPE_CODE (type
))
681 case TYPE_CODE_RANGE
:
682 return TYPE_HIGH_BOUND (type
);
684 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
689 return max_of_type (type
);
691 error (_("Unexpected type in ada_discrete_type_high_bound."));
695 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
697 ada_discrete_type_low_bound (struct type
*type
)
699 switch (TYPE_CODE (type
))
701 case TYPE_CODE_RANGE
:
702 return TYPE_LOW_BOUND (type
);
704 return TYPE_FIELD_BITPOS (type
, 0);
709 return min_of_type (type
);
711 error (_("Unexpected type in ada_discrete_type_low_bound."));
715 /* The identity on non-range types. For range types, the underlying
716 non-range scalar type. */
719 get_base_type (struct type
*type
)
721 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
723 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
725 type
= TYPE_TARGET_TYPE (type
);
731 /* Language Selection */
733 /* If the main program is in Ada, return language_ada, otherwise return LANG
734 (the main program is in Ada iif the adainit symbol is found). */
737 ada_update_initial_language (enum language lang
)
739 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
740 (struct objfile
*) NULL
) != NULL
)
746 /* If the main procedure is written in Ada, then return its name.
747 The result is good until the next call. Return NULL if the main
748 procedure doesn't appear to be in Ada. */
753 struct minimal_symbol
*msym
;
754 static char *main_program_name
= NULL
;
756 /* For Ada, the name of the main procedure is stored in a specific
757 string constant, generated by the binder. Look for that symbol,
758 extract its address, and then read that string. If we didn't find
759 that string, then most probably the main procedure is not written
761 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
765 CORE_ADDR main_program_name_addr
;
768 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
769 if (main_program_name_addr
== 0)
770 error (_("Invalid address for Ada main program name."));
772 xfree (main_program_name
);
773 target_read_string (main_program_name_addr
, &main_program_name
,
778 return main_program_name
;
781 /* The main procedure doesn't seem to be in Ada. */
787 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
790 const struct ada_opname_map ada_opname_table
[] = {
791 {"Oadd", "\"+\"", BINOP_ADD
},
792 {"Osubtract", "\"-\"", BINOP_SUB
},
793 {"Omultiply", "\"*\"", BINOP_MUL
},
794 {"Odivide", "\"/\"", BINOP_DIV
},
795 {"Omod", "\"mod\"", BINOP_MOD
},
796 {"Orem", "\"rem\"", BINOP_REM
},
797 {"Oexpon", "\"**\"", BINOP_EXP
},
798 {"Olt", "\"<\"", BINOP_LESS
},
799 {"Ole", "\"<=\"", BINOP_LEQ
},
800 {"Ogt", "\">\"", BINOP_GTR
},
801 {"Oge", "\">=\"", BINOP_GEQ
},
802 {"Oeq", "\"=\"", BINOP_EQUAL
},
803 {"One", "\"/=\"", BINOP_NOTEQUAL
},
804 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
805 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
806 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
807 {"Oconcat", "\"&\"", BINOP_CONCAT
},
808 {"Oabs", "\"abs\"", UNOP_ABS
},
809 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
810 {"Oadd", "\"+\"", UNOP_PLUS
},
811 {"Osubtract", "\"-\"", UNOP_NEG
},
815 /* The "encoded" form of DECODED, according to GNAT conventions.
816 The result is valid until the next call to ada_encode. */
819 ada_encode (const char *decoded
)
821 static char *encoding_buffer
= NULL
;
822 static size_t encoding_buffer_size
= 0;
829 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
830 2 * strlen (decoded
) + 10);
833 for (p
= decoded
; *p
!= '\0'; p
+= 1)
837 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
842 const struct ada_opname_map
*mapping
;
844 for (mapping
= ada_opname_table
;
845 mapping
->encoded
!= NULL
846 && strncmp (mapping
->decoded
, p
,
847 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
849 if (mapping
->encoded
== NULL
)
850 error (_("invalid Ada operator name: %s"), p
);
851 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
852 k
+= strlen (mapping
->encoded
);
857 encoding_buffer
[k
] = *p
;
862 encoding_buffer
[k
] = '\0';
863 return encoding_buffer
;
866 /* Return NAME folded to lower case, or, if surrounded by single
867 quotes, unfolded, but with the quotes stripped away. Result good
871 ada_fold_name (const char *name
)
873 static char *fold_buffer
= NULL
;
874 static size_t fold_buffer_size
= 0;
876 int len
= strlen (name
);
877 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
881 strncpy (fold_buffer
, name
+ 1, len
- 2);
882 fold_buffer
[len
- 2] = '\000';
888 for (i
= 0; i
<= len
; i
+= 1)
889 fold_buffer
[i
] = tolower (name
[i
]);
895 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
898 is_lower_alphanum (const char c
)
900 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
903 /* ENCODED is the linkage name of a symbol and LEN contains its length.
904 This function saves in LEN the length of that same symbol name but
905 without either of these suffixes:
911 These are suffixes introduced by the compiler for entities such as
912 nested subprogram for instance, in order to avoid name clashes.
913 They do not serve any purpose for the debugger. */
916 ada_remove_trailing_digits (const char *encoded
, int *len
)
918 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
922 while (i
> 0 && isdigit (encoded
[i
]))
924 if (i
>= 0 && encoded
[i
] == '.')
926 else if (i
>= 0 && encoded
[i
] == '$')
928 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
930 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
935 /* Remove the suffix introduced by the compiler for protected object
939 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
941 /* Remove trailing N. */
943 /* Protected entry subprograms are broken into two
944 separate subprograms: The first one is unprotected, and has
945 a 'N' suffix; the second is the protected version, and has
946 the 'P' suffix. The second calls the first one after handling
947 the protection. Since the P subprograms are internally generated,
948 we leave these names undecoded, giving the user a clue that this
949 entity is internal. */
952 && encoded
[*len
- 1] == 'N'
953 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
957 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
960 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
964 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
967 if (encoded
[i
] != 'X')
973 if (isalnum (encoded
[i
-1]))
977 /* If ENCODED follows the GNAT entity encoding conventions, then return
978 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
981 The resulting string is valid until the next call of ada_decode.
982 If the string is unchanged by decoding, the original string pointer
986 ada_decode (const char *encoded
)
993 static char *decoding_buffer
= NULL
;
994 static size_t decoding_buffer_size
= 0;
996 /* The name of the Ada main procedure starts with "_ada_".
997 This prefix is not part of the decoded name, so skip this part
998 if we see this prefix. */
999 if (strncmp (encoded
, "_ada_", 5) == 0)
1002 /* If the name starts with '_', then it is not a properly encoded
1003 name, so do not attempt to decode it. Similarly, if the name
1004 starts with '<', the name should not be decoded. */
1005 if (encoded
[0] == '_' || encoded
[0] == '<')
1008 len0
= strlen (encoded
);
1010 ada_remove_trailing_digits (encoded
, &len0
);
1011 ada_remove_po_subprogram_suffix (encoded
, &len0
);
1013 /* Remove the ___X.* suffix if present. Do not forget to verify that
1014 the suffix is located before the current "end" of ENCODED. We want
1015 to avoid re-matching parts of ENCODED that have previously been
1016 marked as discarded (by decrementing LEN0). */
1017 p
= strstr (encoded
, "___");
1018 if (p
!= NULL
&& p
- encoded
< len0
- 3)
1026 /* Remove any trailing TKB suffix. It tells us that this symbol
1027 is for the body of a task, but that information does not actually
1028 appear in the decoded name. */
1030 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
1033 /* Remove any trailing TB suffix. The TB suffix is slightly different
1034 from the TKB suffix because it is used for non-anonymous task
1037 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
1040 /* Remove trailing "B" suffixes. */
1041 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
1043 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
1046 /* Make decoded big enough for possible expansion by operator name. */
1048 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
1049 decoded
= decoding_buffer
;
1051 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1053 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1056 while ((i
>= 0 && isdigit (encoded
[i
]))
1057 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1059 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1061 else if (encoded
[i
] == '$')
1065 /* The first few characters that are not alphabetic are not part
1066 of any encoding we use, so we can copy them over verbatim. */
1068 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1069 decoded
[j
] = encoded
[i
];
1074 /* Is this a symbol function? */
1075 if (at_start_name
&& encoded
[i
] == 'O')
1079 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1081 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1082 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1084 && !isalnum (encoded
[i
+ op_len
]))
1086 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1089 j
+= strlen (ada_opname_table
[k
].decoded
);
1093 if (ada_opname_table
[k
].encoded
!= NULL
)
1098 /* Replace "TK__" with "__", which will eventually be translated
1099 into "." (just below). */
1101 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1104 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1105 be translated into "." (just below). These are internal names
1106 generated for anonymous blocks inside which our symbol is nested. */
1108 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1109 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1110 && isdigit (encoded
[i
+4]))
1114 while (k
< len0
&& isdigit (encoded
[k
]))
1115 k
++; /* Skip any extra digit. */
1117 /* Double-check that the "__B_{DIGITS}+" sequence we found
1118 is indeed followed by "__". */
1119 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1123 /* Remove _E{DIGITS}+[sb] */
1125 /* Just as for protected object subprograms, there are 2 categories
1126 of subprograms created by the compiler for each entry. The first
1127 one implements the actual entry code, and has a suffix following
1128 the convention above; the second one implements the barrier and
1129 uses the same convention as above, except that the 'E' is replaced
1132 Just as above, we do not decode the name of barrier functions
1133 to give the user a clue that the code he is debugging has been
1134 internally generated. */
1136 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1137 && isdigit (encoded
[i
+2]))
1141 while (k
< len0
&& isdigit (encoded
[k
]))
1145 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1148 /* Just as an extra precaution, make sure that if this
1149 suffix is followed by anything else, it is a '_'.
1150 Otherwise, we matched this sequence by accident. */
1152 || (k
< len0
&& encoded
[k
] == '_'))
1157 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1158 the GNAT front-end in protected object subprograms. */
1161 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1163 /* Backtrack a bit up until we reach either the begining of
1164 the encoded name, or "__". Make sure that we only find
1165 digits or lowercase characters. */
1166 const char *ptr
= encoded
+ i
- 1;
1168 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1171 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1175 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1177 /* This is a X[bn]* sequence not separated from the previous
1178 part of the name with a non-alpha-numeric character (in other
1179 words, immediately following an alpha-numeric character), then
1180 verify that it is placed at the end of the encoded name. If
1181 not, then the encoding is not valid and we should abort the
1182 decoding. Otherwise, just skip it, it is used in body-nested
1186 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1190 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1192 /* Replace '__' by '.'. */
1200 /* It's a character part of the decoded name, so just copy it
1202 decoded
[j
] = encoded
[i
];
1207 decoded
[j
] = '\000';
1209 /* Decoded names should never contain any uppercase character.
1210 Double-check this, and abort the decoding if we find one. */
1212 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1213 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1216 if (strcmp (decoded
, encoded
) == 0)
1222 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1223 decoded
= decoding_buffer
;
1224 if (encoded
[0] == '<')
1225 strcpy (decoded
, encoded
);
1227 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1232 /* Table for keeping permanent unique copies of decoded names. Once
1233 allocated, names in this table are never released. While this is a
1234 storage leak, it should not be significant unless there are massive
1235 changes in the set of decoded names in successive versions of a
1236 symbol table loaded during a single session. */
1237 static struct htab
*decoded_names_store
;
1239 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1240 in the language-specific part of GSYMBOL, if it has not been
1241 previously computed. Tries to save the decoded name in the same
1242 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1243 in any case, the decoded symbol has a lifetime at least that of
1245 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1246 const, but nevertheless modified to a semantically equivalent form
1247 when a decoded name is cached in it. */
1250 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1253 (char **) &gsymbol
->language_specific
.mangled_lang
.demangled_name
;
1255 if (*resultp
== NULL
)
1257 const char *decoded
= ada_decode (gsymbol
->name
);
1259 if (gsymbol
->obj_section
!= NULL
)
1261 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1263 *resultp
= obsavestring (decoded
, strlen (decoded
),
1264 &objf
->objfile_obstack
);
1266 /* Sometimes, we can't find a corresponding objfile, in which
1267 case, we put the result on the heap. Since we only decode
1268 when needed, we hope this usually does not cause a
1269 significant memory leak (FIXME). */
1270 if (*resultp
== NULL
)
1272 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1276 *slot
= xstrdup (decoded
);
1285 ada_la_decode (const char *encoded
, int options
)
1287 return xstrdup (ada_decode (encoded
));
1290 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1291 suffixes that encode debugging information or leading _ada_ on
1292 SYM_NAME (see is_name_suffix commentary for the debugging
1293 information that is ignored). If WILD, then NAME need only match a
1294 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1295 either argument is NULL. */
1298 match_name (const char *sym_name
, const char *name
, int wild
)
1300 if (sym_name
== NULL
|| name
== NULL
)
1303 return wild_match (sym_name
, name
) == 0;
1306 int len_name
= strlen (name
);
1308 return (strncmp (sym_name
, name
, len_name
) == 0
1309 && is_name_suffix (sym_name
+ len_name
))
1310 || (strncmp (sym_name
, "_ada_", 5) == 0
1311 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1312 && is_name_suffix (sym_name
+ len_name
+ 5));
1319 /* Assuming that INDEX_DESC_TYPE is an ___XA structure, a structure
1320 generated by the GNAT compiler to describe the index type used
1321 for each dimension of an array, check whether it follows the latest
1322 known encoding. If not, fix it up to conform to the latest encoding.
1323 Otherwise, do nothing. This function also does nothing if
1324 INDEX_DESC_TYPE is NULL.
1326 The GNAT encoding used to describle the array index type evolved a bit.
1327 Initially, the information would be provided through the name of each
1328 field of the structure type only, while the type of these fields was
1329 described as unspecified and irrelevant. The debugger was then expected
1330 to perform a global type lookup using the name of that field in order
1331 to get access to the full index type description. Because these global
1332 lookups can be very expensive, the encoding was later enhanced to make
1333 the global lookup unnecessary by defining the field type as being
1334 the full index type description.
1336 The purpose of this routine is to allow us to support older versions
1337 of the compiler by detecting the use of the older encoding, and by
1338 fixing up the INDEX_DESC_TYPE to follow the new one (at this point,
1339 we essentially replace each field's meaningless type by the associated
1343 ada_fixup_array_indexes_type (struct type
*index_desc_type
)
1347 if (index_desc_type
== NULL
)
1349 gdb_assert (TYPE_NFIELDS (index_desc_type
) > 0);
1351 /* Check if INDEX_DESC_TYPE follows the older encoding (it is sufficient
1352 to check one field only, no need to check them all). If not, return
1355 If our INDEX_DESC_TYPE was generated using the older encoding,
1356 the field type should be a meaningless integer type whose name
1357 is not equal to the field name. */
1358 if (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)) != NULL
1359 && strcmp (TYPE_NAME (TYPE_FIELD_TYPE (index_desc_type
, 0)),
1360 TYPE_FIELD_NAME (index_desc_type
, 0)) == 0)
1363 /* Fixup each field of INDEX_DESC_TYPE. */
1364 for (i
= 0; i
< TYPE_NFIELDS (index_desc_type
); i
++)
1366 char *name
= TYPE_FIELD_NAME (index_desc_type
, i
);
1367 struct type
*raw_type
= ada_check_typedef (ada_find_any_type (name
));
1370 TYPE_FIELD_TYPE (index_desc_type
, i
) = raw_type
;
1374 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1376 static char *bound_name
[] = {
1377 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1378 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1381 /* Maximum number of array dimensions we are prepared to handle. */
1383 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1386 /* The desc_* routines return primitive portions of array descriptors
1389 /* The descriptor or array type, if any, indicated by TYPE; removes
1390 level of indirection, if needed. */
1392 static struct type
*
1393 desc_base_type (struct type
*type
)
1397 type
= ada_check_typedef (type
);
1398 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1399 type
= ada_typedef_target_type (type
);
1402 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1403 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1404 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1409 /* True iff TYPE indicates a "thin" array pointer type. */
1412 is_thin_pntr (struct type
*type
)
1415 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1416 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1419 /* The descriptor type for thin pointer type TYPE. */
1421 static struct type
*
1422 thin_descriptor_type (struct type
*type
)
1424 struct type
*base_type
= desc_base_type (type
);
1426 if (base_type
== NULL
)
1428 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1432 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1434 if (alt_type
== NULL
)
1441 /* A pointer to the array data for thin-pointer value VAL. */
1443 static struct value
*
1444 thin_data_pntr (struct value
*val
)
1446 struct type
*type
= ada_check_typedef (value_type (val
));
1447 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1449 data_type
= lookup_pointer_type (data_type
);
1451 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1452 return value_cast (data_type
, value_copy (val
));
1454 return value_from_longest (data_type
, value_address (val
));
1457 /* True iff TYPE indicates a "thick" array pointer type. */
1460 is_thick_pntr (struct type
*type
)
1462 type
= desc_base_type (type
);
1463 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1464 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1467 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1468 pointer to one, the type of its bounds data; otherwise, NULL. */
1470 static struct type
*
1471 desc_bounds_type (struct type
*type
)
1475 type
= desc_base_type (type
);
1479 else if (is_thin_pntr (type
))
1481 type
= thin_descriptor_type (type
);
1484 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1486 return ada_check_typedef (r
);
1488 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1490 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1492 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1497 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1498 one, a pointer to its bounds data. Otherwise NULL. */
1500 static struct value
*
1501 desc_bounds (struct value
*arr
)
1503 struct type
*type
= ada_check_typedef (value_type (arr
));
1505 if (is_thin_pntr (type
))
1507 struct type
*bounds_type
=
1508 desc_bounds_type (thin_descriptor_type (type
));
1511 if (bounds_type
== NULL
)
1512 error (_("Bad GNAT array descriptor"));
1514 /* NOTE: The following calculation is not really kosher, but
1515 since desc_type is an XVE-encoded type (and shouldn't be),
1516 the correct calculation is a real pain. FIXME (and fix GCC). */
1517 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1518 addr
= value_as_long (arr
);
1520 addr
= value_address (arr
);
1523 value_from_longest (lookup_pointer_type (bounds_type
),
1524 addr
- TYPE_LENGTH (bounds_type
));
1527 else if (is_thick_pntr (type
))
1529 struct value
*p_bounds
= value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1530 _("Bad GNAT array descriptor"));
1531 struct type
*p_bounds_type
= value_type (p_bounds
);
1534 && TYPE_CODE (p_bounds_type
) == TYPE_CODE_PTR
)
1536 struct type
*target_type
= TYPE_TARGET_TYPE (p_bounds_type
);
1538 if (TYPE_STUB (target_type
))
1539 p_bounds
= value_cast (lookup_pointer_type
1540 (ada_check_typedef (target_type
)),
1544 error (_("Bad GNAT array descriptor"));
1552 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1553 position of the field containing the address of the bounds data. */
1556 fat_pntr_bounds_bitpos (struct type
*type
)
1558 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1561 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1562 size of the field containing the address of the bounds data. */
1565 fat_pntr_bounds_bitsize (struct type
*type
)
1567 type
= desc_base_type (type
);
1569 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1570 return TYPE_FIELD_BITSIZE (type
, 1);
1572 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1575 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1576 pointer to one, the type of its array data (a array-with-no-bounds type);
1577 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1580 static struct type
*
1581 desc_data_target_type (struct type
*type
)
1583 type
= desc_base_type (type
);
1585 /* NOTE: The following is bogus; see comment in desc_bounds. */
1586 if (is_thin_pntr (type
))
1587 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1588 else if (is_thick_pntr (type
))
1590 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1593 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1594 return ada_check_typedef (TYPE_TARGET_TYPE (data_type
));
1600 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1603 static struct value
*
1604 desc_data (struct value
*arr
)
1606 struct type
*type
= value_type (arr
);
1608 if (is_thin_pntr (type
))
1609 return thin_data_pntr (arr
);
1610 else if (is_thick_pntr (type
))
1611 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1612 _("Bad GNAT array descriptor"));
1618 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1619 position of the field containing the address of the data. */
1622 fat_pntr_data_bitpos (struct type
*type
)
1624 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1627 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1628 size of the field containing the address of the data. */
1631 fat_pntr_data_bitsize (struct type
*type
)
1633 type
= desc_base_type (type
);
1635 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1636 return TYPE_FIELD_BITSIZE (type
, 0);
1638 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1641 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1642 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1643 bound, if WHICH is 1. The first bound is I=1. */
1645 static struct value
*
1646 desc_one_bound (struct value
*bounds
, int i
, int which
)
1648 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1649 _("Bad GNAT array descriptor bounds"));
1652 /* If BOUNDS is an array-bounds structure type, return the bit position
1653 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1654 bound, if WHICH is 1. The first bound is I=1. */
1657 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1659 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1662 /* If BOUNDS is an array-bounds structure type, return the bit field size
1663 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1664 bound, if WHICH is 1. The first bound is I=1. */
1667 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1669 type
= desc_base_type (type
);
1671 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1672 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1674 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1677 /* If TYPE is the type of an array-bounds structure, the type of its
1678 Ith bound (numbering from 1). Otherwise, NULL. */
1680 static struct type
*
1681 desc_index_type (struct type
*type
, int i
)
1683 type
= desc_base_type (type
);
1685 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1686 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1691 /* The number of index positions in the array-bounds type TYPE.
1692 Return 0 if TYPE is NULL. */
1695 desc_arity (struct type
*type
)
1697 type
= desc_base_type (type
);
1700 return TYPE_NFIELDS (type
) / 2;
1704 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1705 an array descriptor type (representing an unconstrained array
1709 ada_is_direct_array_type (struct type
*type
)
1713 type
= ada_check_typedef (type
);
1714 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1715 || ada_is_array_descriptor_type (type
));
1718 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1722 ada_is_array_type (struct type
*type
)
1725 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1726 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1727 type
= TYPE_TARGET_TYPE (type
);
1728 return ada_is_direct_array_type (type
);
1731 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1734 ada_is_simple_array_type (struct type
*type
)
1738 type
= ada_check_typedef (type
);
1739 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1740 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1741 && TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
)))
1742 == TYPE_CODE_ARRAY
));
1745 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1748 ada_is_array_descriptor_type (struct type
*type
)
1750 struct type
*data_type
= desc_data_target_type (type
);
1754 type
= ada_check_typedef (type
);
1755 return (data_type
!= NULL
1756 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1757 && desc_arity (desc_bounds_type (type
)) > 0);
1760 /* Non-zero iff type is a partially mal-formed GNAT array
1761 descriptor. FIXME: This is to compensate for some problems with
1762 debugging output from GNAT. Re-examine periodically to see if it
1766 ada_is_bogus_array_descriptor (struct type
*type
)
1770 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1771 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1772 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1773 && !ada_is_array_descriptor_type (type
);
1777 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1778 (fat pointer) returns the type of the array data described---specifically,
1779 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1780 in from the descriptor; otherwise, they are left unspecified. If
1781 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1782 returns NULL. The result is simply the type of ARR if ARR is not
1785 ada_type_of_array (struct value
*arr
, int bounds
)
1787 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1788 return decode_constrained_packed_array_type (value_type (arr
));
1790 if (!ada_is_array_descriptor_type (value_type (arr
)))
1791 return value_type (arr
);
1795 struct type
*array_type
=
1796 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1798 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1799 TYPE_FIELD_BITSIZE (array_type
, 0) =
1800 decode_packed_array_bitsize (value_type (arr
));
1806 struct type
*elt_type
;
1808 struct value
*descriptor
;
1810 elt_type
= ada_array_element_type (value_type (arr
), -1);
1811 arity
= ada_array_arity (value_type (arr
));
1813 if (elt_type
== NULL
|| arity
== 0)
1814 return ada_check_typedef (value_type (arr
));
1816 descriptor
= desc_bounds (arr
);
1817 if (value_as_long (descriptor
) == 0)
1821 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1822 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1823 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1824 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1827 create_range_type (range_type
, value_type (low
),
1828 longest_to_int (value_as_long (low
)),
1829 longest_to_int (value_as_long (high
)));
1830 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1832 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1834 /* We need to store the element packed bitsize, as well as
1835 recompute the array size, because it was previously
1836 computed based on the unpacked element size. */
1837 LONGEST lo
= value_as_long (low
);
1838 LONGEST hi
= value_as_long (high
);
1840 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1841 decode_packed_array_bitsize (value_type (arr
));
1842 /* If the array has no element, then the size is already
1843 zero, and does not need to be recomputed. */
1847 (hi
- lo
+ 1) * TYPE_FIELD_BITSIZE (elt_type
, 0);
1849 TYPE_LENGTH (array_type
) = (array_bitsize
+ 7) / 8;
1854 return lookup_pointer_type (elt_type
);
1858 /* If ARR does not represent an array, returns ARR unchanged.
1859 Otherwise, returns either a standard GDB array with bounds set
1860 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1861 GDB array. Returns NULL if ARR is a null fat pointer. */
1864 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1866 if (ada_is_array_descriptor_type (value_type (arr
)))
1868 struct type
*arrType
= ada_type_of_array (arr
, 1);
1870 if (arrType
== NULL
)
1872 return value_cast (arrType
, value_copy (desc_data (arr
)));
1874 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1875 return decode_constrained_packed_array (arr
);
1880 /* If ARR does not represent an array, returns ARR unchanged.
1881 Otherwise, returns a standard GDB array describing ARR (which may
1882 be ARR itself if it already is in the proper form). */
1885 ada_coerce_to_simple_array (struct value
*arr
)
1887 if (ada_is_array_descriptor_type (value_type (arr
)))
1889 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1892 error (_("Bounds unavailable for null array pointer."));
1893 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1894 return value_ind (arrVal
);
1896 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1897 return decode_constrained_packed_array (arr
);
1902 /* If TYPE represents a GNAT array type, return it translated to an
1903 ordinary GDB array type (possibly with BITSIZE fields indicating
1904 packing). For other types, is the identity. */
1907 ada_coerce_to_simple_array_type (struct type
*type
)
1909 if (ada_is_constrained_packed_array_type (type
))
1910 return decode_constrained_packed_array_type (type
);
1912 if (ada_is_array_descriptor_type (type
))
1913 return ada_check_typedef (desc_data_target_type (type
));
1918 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1921 ada_is_packed_array_type (struct type
*type
)
1925 type
= desc_base_type (type
);
1926 type
= ada_check_typedef (type
);
1928 ada_type_name (type
) != NULL
1929 && strstr (ada_type_name (type
), "___XP") != NULL
;
1932 /* Non-zero iff TYPE represents a standard GNAT constrained
1933 packed-array type. */
1936 ada_is_constrained_packed_array_type (struct type
*type
)
1938 return ada_is_packed_array_type (type
)
1939 && !ada_is_array_descriptor_type (type
);
1942 /* Non-zero iff TYPE represents an array descriptor for a
1943 unconstrained packed-array type. */
1946 ada_is_unconstrained_packed_array_type (struct type
*type
)
1948 return ada_is_packed_array_type (type
)
1949 && ada_is_array_descriptor_type (type
);
1952 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1953 return the size of its elements in bits. */
1956 decode_packed_array_bitsize (struct type
*type
)
1962 /* Access to arrays implemented as fat pointers are encoded as a typedef
1963 of the fat pointer type. We need the name of the fat pointer type
1964 to do the decoding, so strip the typedef layer. */
1965 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
1966 type
= ada_typedef_target_type (type
);
1968 raw_name
= ada_type_name (ada_check_typedef (type
));
1970 raw_name
= ada_type_name (desc_base_type (type
));
1975 tail
= strstr (raw_name
, "___XP");
1976 gdb_assert (tail
!= NULL
);
1978 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1981 (_("could not understand bit size information on packed array"));
1988 /* Given that TYPE is a standard GDB array type with all bounds filled
1989 in, and that the element size of its ultimate scalar constituents
1990 (that is, either its elements, or, if it is an array of arrays, its
1991 elements' elements, etc.) is *ELT_BITS, return an identical type,
1992 but with the bit sizes of its elements (and those of any
1993 constituent arrays) recorded in the BITSIZE components of its
1994 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1997 static struct type
*
1998 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
2000 struct type
*new_elt_type
;
2001 struct type
*new_type
;
2002 LONGEST low_bound
, high_bound
;
2004 type
= ada_check_typedef (type
);
2005 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2008 new_type
= alloc_type_copy (type
);
2010 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
2012 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
2013 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
2014 TYPE_NAME (new_type
) = ada_type_name (type
);
2016 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
2017 &low_bound
, &high_bound
) < 0)
2018 low_bound
= high_bound
= 0;
2019 if (high_bound
< low_bound
)
2020 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
2023 *elt_bits
*= (high_bound
- low_bound
+ 1);
2024 TYPE_LENGTH (new_type
) =
2025 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2028 TYPE_FIXED_INSTANCE (new_type
) = 1;
2032 /* The array type encoded by TYPE, where
2033 ada_is_constrained_packed_array_type (TYPE). */
2035 static struct type
*
2036 decode_constrained_packed_array_type (struct type
*type
)
2038 char *raw_name
= ada_type_name (ada_check_typedef (type
));
2041 struct type
*shadow_type
;
2045 raw_name
= ada_type_name (desc_base_type (type
));
2050 name
= (char *) alloca (strlen (raw_name
) + 1);
2051 tail
= strstr (raw_name
, "___XP");
2052 type
= desc_base_type (type
);
2054 memcpy (name
, raw_name
, tail
- raw_name
);
2055 name
[tail
- raw_name
] = '\000';
2057 shadow_type
= ada_find_parallel_type_with_name (type
, name
);
2059 if (shadow_type
== NULL
)
2061 lim_warning (_("could not find bounds information on packed array"));
2064 CHECK_TYPEDEF (shadow_type
);
2066 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
2068 lim_warning (_("could not understand bounds "
2069 "information on packed array"));
2073 bits
= decode_packed_array_bitsize (type
);
2074 return constrained_packed_array_type (shadow_type
, &bits
);
2077 /* Given that ARR is a struct value *indicating a GNAT constrained packed
2078 array, returns a simple array that denotes that array. Its type is a
2079 standard GDB array type except that the BITSIZEs of the array
2080 target types are set to the number of bits in each element, and the
2081 type length is set appropriately. */
2083 static struct value
*
2084 decode_constrained_packed_array (struct value
*arr
)
2088 arr
= ada_coerce_ref (arr
);
2090 /* If our value is a pointer, then dererence it. Make sure that
2091 this operation does not cause the target type to be fixed, as
2092 this would indirectly cause this array to be decoded. The rest
2093 of the routine assumes that the array hasn't been decoded yet,
2094 so we use the basic "value_ind" routine to perform the dereferencing,
2095 as opposed to using "ada_value_ind". */
2096 if (TYPE_CODE (ada_check_typedef (value_type (arr
))) == TYPE_CODE_PTR
)
2097 arr
= value_ind (arr
);
2099 type
= decode_constrained_packed_array_type (value_type (arr
));
2102 error (_("can't unpack array"));
2106 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
2107 && ada_is_modular_type (value_type (arr
)))
2109 /* This is a (right-justified) modular type representing a packed
2110 array with no wrapper. In order to interpret the value through
2111 the (left-justified) packed array type we just built, we must
2112 first left-justify it. */
2113 int bit_size
, bit_pos
;
2116 mod
= ada_modulus (value_type (arr
)) - 1;
2123 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
2124 arr
= ada_value_primitive_packed_val (arr
, NULL
,
2125 bit_pos
/ HOST_CHAR_BIT
,
2126 bit_pos
% HOST_CHAR_BIT
,
2131 return coerce_unspec_val_to_type (arr
, type
);
2135 /* The value of the element of packed array ARR at the ARITY indices
2136 given in IND. ARR must be a simple array. */
2138 static struct value
*
2139 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
2142 int bits
, elt_off
, bit_off
;
2143 long elt_total_bit_offset
;
2144 struct type
*elt_type
;
2148 elt_total_bit_offset
= 0;
2149 elt_type
= ada_check_typedef (value_type (arr
));
2150 for (i
= 0; i
< arity
; i
+= 1)
2152 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
2153 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
2155 (_("attempt to do packed indexing of "
2156 "something other than a packed array"));
2159 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
2160 LONGEST lowerbound
, upperbound
;
2163 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
2165 lim_warning (_("don't know bounds of array"));
2166 lowerbound
= upperbound
= 0;
2169 idx
= pos_atr (ind
[i
]);
2170 if (idx
< lowerbound
|| idx
> upperbound
)
2171 lim_warning (_("packed array index %ld out of bounds"),
2173 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
2174 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
2175 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
2178 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
2179 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
2181 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2186 /* Non-zero iff TYPE includes negative integer values. */
2189 has_negatives (struct type
*type
)
2191 switch (TYPE_CODE (type
))
2196 return !TYPE_UNSIGNED (type
);
2197 case TYPE_CODE_RANGE
:
2198 return TYPE_LOW_BOUND (type
) < 0;
2203 /* Create a new value of type TYPE from the contents of OBJ starting
2204 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2205 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2206 assigning through the result will set the field fetched from.
2207 VALADDR is ignored unless OBJ is NULL, in which case,
2208 VALADDR+OFFSET must address the start of storage containing the
2209 packed value. The value returned in this case is never an lval.
2210 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2213 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2214 long offset
, int bit_offset
, int bit_size
,
2218 int src
, /* Index into the source area */
2219 targ
, /* Index into the target area */
2220 srcBitsLeft
, /* Number of source bits left to move */
2221 nsrc
, ntarg
, /* Number of source and target bytes */
2222 unusedLS
, /* Number of bits in next significant
2223 byte of source that are unused */
2224 accumSize
; /* Number of meaningful bits in accum */
2225 unsigned char *bytes
; /* First byte containing data to unpack */
2226 unsigned char *unpacked
;
2227 unsigned long accum
; /* Staging area for bits being transferred */
2229 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2230 /* Transmit bytes from least to most significant; delta is the direction
2231 the indices move. */
2232 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2234 type
= ada_check_typedef (type
);
2238 v
= allocate_value (type
);
2239 bytes
= (unsigned char *) (valaddr
+ offset
);
2241 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2244 value_address (obj
) + offset
);
2245 bytes
= (unsigned char *) alloca (len
);
2246 read_memory (value_address (v
), bytes
, len
);
2250 v
= allocate_value (type
);
2251 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2258 set_value_component_location (v
, obj
);
2259 new_addr
= value_address (obj
) + offset
;
2260 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2261 set_value_bitsize (v
, bit_size
);
2262 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2265 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2267 set_value_address (v
, new_addr
);
2270 set_value_bitsize (v
, bit_size
);
2271 unpacked
= (unsigned char *) value_contents (v
);
2273 srcBitsLeft
= bit_size
;
2275 ntarg
= TYPE_LENGTH (type
);
2279 memset (unpacked
, 0, TYPE_LENGTH (type
));
2282 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2285 if (has_negatives (type
)
2286 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2290 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2293 switch (TYPE_CODE (type
))
2295 case TYPE_CODE_ARRAY
:
2296 case TYPE_CODE_UNION
:
2297 case TYPE_CODE_STRUCT
:
2298 /* Non-scalar values must be aligned at a byte boundary... */
2300 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2301 /* ... And are placed at the beginning (most-significant) bytes
2303 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2308 targ
= TYPE_LENGTH (type
) - 1;
2314 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2317 unusedLS
= bit_offset
;
2320 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2327 /* Mask for removing bits of the next source byte that are not
2328 part of the value. */
2329 unsigned int unusedMSMask
=
2330 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2332 /* Sign-extend bits for this byte. */
2333 unsigned int signMask
= sign
& ~unusedMSMask
;
2336 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2337 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2338 if (accumSize
>= HOST_CHAR_BIT
)
2340 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2341 accumSize
-= HOST_CHAR_BIT
;
2342 accum
>>= HOST_CHAR_BIT
;
2346 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2353 accum
|= sign
<< accumSize
;
2354 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2355 accumSize
-= HOST_CHAR_BIT
;
2356 accum
>>= HOST_CHAR_BIT
;
2364 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2365 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2368 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2369 int src_offset
, int n
, int bits_big_endian_p
)
2371 unsigned int accum
, mask
;
2372 int accum_bits
, chunk_size
;
2374 target
+= targ_offset
/ HOST_CHAR_BIT
;
2375 targ_offset
%= HOST_CHAR_BIT
;
2376 source
+= src_offset
/ HOST_CHAR_BIT
;
2377 src_offset
%= HOST_CHAR_BIT
;
2378 if (bits_big_endian_p
)
2380 accum
= (unsigned char) *source
;
2382 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2388 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2389 accum_bits
+= HOST_CHAR_BIT
;
2391 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2394 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2395 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2398 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2400 accum_bits
-= chunk_size
;
2407 accum
= (unsigned char) *source
>> src_offset
;
2409 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2413 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2414 accum_bits
+= HOST_CHAR_BIT
;
2416 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2419 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2420 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2422 accum_bits
-= chunk_size
;
2423 accum
>>= chunk_size
;
2430 /* Store the contents of FROMVAL into the location of TOVAL.
2431 Return a new value with the location of TOVAL and contents of
2432 FROMVAL. Handles assignment into packed fields that have
2433 floating-point or non-scalar types. */
2435 static struct value
*
2436 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2438 struct type
*type
= value_type (toval
);
2439 int bits
= value_bitsize (toval
);
2441 toval
= ada_coerce_ref (toval
);
2442 fromval
= ada_coerce_ref (fromval
);
2444 if (ada_is_direct_array_type (value_type (toval
)))
2445 toval
= ada_coerce_to_simple_array (toval
);
2446 if (ada_is_direct_array_type (value_type (fromval
)))
2447 fromval
= ada_coerce_to_simple_array (fromval
);
2449 if (!deprecated_value_modifiable (toval
))
2450 error (_("Left operand of assignment is not a modifiable lvalue."));
2452 if (VALUE_LVAL (toval
) == lval_memory
2454 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2455 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2457 int len
= (value_bitpos (toval
)
2458 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2460 char *buffer
= (char *) alloca (len
);
2462 CORE_ADDR to_addr
= value_address (toval
);
2464 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2465 fromval
= value_cast (type
, fromval
);
2467 read_memory (to_addr
, buffer
, len
);
2468 from_size
= value_bitsize (fromval
);
2470 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2471 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2472 move_bits (buffer
, value_bitpos (toval
),
2473 value_contents (fromval
), from_size
- bits
, bits
, 1);
2475 move_bits (buffer
, value_bitpos (toval
),
2476 value_contents (fromval
), 0, bits
, 0);
2477 write_memory (to_addr
, buffer
, len
);
2478 observer_notify_memory_changed (to_addr
, len
, buffer
);
2480 val
= value_copy (toval
);
2481 memcpy (value_contents_raw (val
), value_contents (fromval
),
2482 TYPE_LENGTH (type
));
2483 deprecated_set_value_type (val
, type
);
2488 return value_assign (toval
, fromval
);
2492 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2493 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2494 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2495 * COMPONENT, and not the inferior's memory. The current contents
2496 * of COMPONENT are ignored. */
2498 value_assign_to_component (struct value
*container
, struct value
*component
,
2501 LONGEST offset_in_container
=
2502 (LONGEST
) (value_address (component
) - value_address (container
));
2503 int bit_offset_in_container
=
2504 value_bitpos (component
) - value_bitpos (container
);
2507 val
= value_cast (value_type (component
), val
);
2509 if (value_bitsize (component
) == 0)
2510 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2512 bits
= value_bitsize (component
);
2514 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2515 move_bits (value_contents_writeable (container
) + offset_in_container
,
2516 value_bitpos (container
) + bit_offset_in_container
,
2517 value_contents (val
),
2518 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2521 move_bits (value_contents_writeable (container
) + offset_in_container
,
2522 value_bitpos (container
) + bit_offset_in_container
,
2523 value_contents (val
), 0, bits
, 0);
2526 /* The value of the element of array ARR at the ARITY indices given in IND.
2527 ARR may be either a simple array, GNAT array descriptor, or pointer
2531 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2535 struct type
*elt_type
;
2537 elt
= ada_coerce_to_simple_array (arr
);
2539 elt_type
= ada_check_typedef (value_type (elt
));
2540 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2541 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2542 return value_subscript_packed (elt
, arity
, ind
);
2544 for (k
= 0; k
< arity
; k
+= 1)
2546 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2547 error (_("too many subscripts (%d expected)"), k
);
2548 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2553 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2554 value of the element of *ARR at the ARITY indices given in
2555 IND. Does not read the entire array into memory. */
2557 static struct value
*
2558 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2563 for (k
= 0; k
< arity
; k
+= 1)
2567 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2568 error (_("too many subscripts (%d expected)"), k
);
2569 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2571 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2572 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2573 type
= TYPE_TARGET_TYPE (type
);
2576 return value_ind (arr
);
2579 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2580 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2581 elements starting at index LOW. The lower bound of this array is LOW, as
2583 static struct value
*
2584 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2587 struct type
*type0
= ada_check_typedef (type
);
2588 CORE_ADDR base
= value_as_address (array_ptr
)
2589 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type0
)))
2590 * TYPE_LENGTH (TYPE_TARGET_TYPE (type0
)));
2591 struct type
*index_type
=
2592 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type0
)),
2594 struct type
*slice_type
=
2595 create_array_type (NULL
, TYPE_TARGET_TYPE (type0
), index_type
);
2597 return value_at_lazy (slice_type
, base
);
2601 static struct value
*
2602 ada_value_slice (struct value
*array
, int low
, int high
)
2604 struct type
*type
= ada_check_typedef (value_type (array
));
2605 struct type
*index_type
=
2606 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2607 struct type
*slice_type
=
2608 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2610 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2613 /* If type is a record type in the form of a standard GNAT array
2614 descriptor, returns the number of dimensions for type. If arr is a
2615 simple array, returns the number of "array of"s that prefix its
2616 type designation. Otherwise, returns 0. */
2619 ada_array_arity (struct type
*type
)
2626 type
= desc_base_type (type
);
2629 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2630 return desc_arity (desc_bounds_type (type
));
2632 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2635 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2641 /* If TYPE is a record type in the form of a standard GNAT array
2642 descriptor or a simple array type, returns the element type for
2643 TYPE after indexing by NINDICES indices, or by all indices if
2644 NINDICES is -1. Otherwise, returns NULL. */
2647 ada_array_element_type (struct type
*type
, int nindices
)
2649 type
= desc_base_type (type
);
2651 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2654 struct type
*p_array_type
;
2656 p_array_type
= desc_data_target_type (type
);
2658 k
= ada_array_arity (type
);
2662 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2663 if (nindices
>= 0 && k
> nindices
)
2665 while (k
> 0 && p_array_type
!= NULL
)
2667 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2670 return p_array_type
;
2672 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2674 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2676 type
= TYPE_TARGET_TYPE (type
);
2685 /* The type of nth index in arrays of given type (n numbering from 1).
2686 Does not examine memory. Throws an error if N is invalid or TYPE
2687 is not an array type. NAME is the name of the Ada attribute being
2688 evaluated ('range, 'first, 'last, or 'length); it is used in building
2689 the error message. */
2691 static struct type
*
2692 ada_index_type (struct type
*type
, int n
, const char *name
)
2694 struct type
*result_type
;
2696 type
= desc_base_type (type
);
2698 if (n
< 0 || n
> ada_array_arity (type
))
2699 error (_("invalid dimension number to '%s"), name
);
2701 if (ada_is_simple_array_type (type
))
2705 for (i
= 1; i
< n
; i
+= 1)
2706 type
= TYPE_TARGET_TYPE (type
);
2707 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2708 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2709 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2710 perhaps stabsread.c would make more sense. */
2711 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2716 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2717 if (result_type
== NULL
)
2718 error (_("attempt to take bound of something that is not an array"));
2724 /* Given that arr is an array type, returns the lower bound of the
2725 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2726 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2727 array-descriptor type. It works for other arrays with bounds supplied
2728 by run-time quantities other than discriminants. */
2731 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2733 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2736 gdb_assert (which
== 0 || which
== 1);
2738 if (ada_is_constrained_packed_array_type (arr_type
))
2739 arr_type
= decode_constrained_packed_array_type (arr_type
);
2741 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2742 return (LONGEST
) - which
;
2744 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2745 type
= TYPE_TARGET_TYPE (arr_type
);
2750 for (i
= n
; i
> 1; i
--)
2751 elt_type
= TYPE_TARGET_TYPE (type
);
2753 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2754 ada_fixup_array_indexes_type (index_type_desc
);
2755 if (index_type_desc
!= NULL
)
2756 index_type
= to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, n
- 1),
2759 index_type
= TYPE_INDEX_TYPE (elt_type
);
2762 (LONGEST
) (which
== 0
2763 ? ada_discrete_type_low_bound (index_type
)
2764 : ada_discrete_type_high_bound (index_type
));
2767 /* Given that arr is an array value, returns the lower bound of the
2768 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2769 WHICH is 1. This routine will also work for arrays with bounds
2770 supplied by run-time quantities other than discriminants. */
2773 ada_array_bound (struct value
*arr
, int n
, int which
)
2775 struct type
*arr_type
= value_type (arr
);
2777 if (ada_is_constrained_packed_array_type (arr_type
))
2778 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2779 else if (ada_is_simple_array_type (arr_type
))
2780 return ada_array_bound_from_type (arr_type
, n
, which
);
2782 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2785 /* Given that arr is an array value, returns the length of the
2786 nth index. This routine will also work for arrays with bounds
2787 supplied by run-time quantities other than discriminants.
2788 Does not work for arrays indexed by enumeration types with representation
2789 clauses at the moment. */
2792 ada_array_length (struct value
*arr
, int n
)
2794 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2796 if (ada_is_constrained_packed_array_type (arr_type
))
2797 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2799 if (ada_is_simple_array_type (arr_type
))
2800 return (ada_array_bound_from_type (arr_type
, n
, 1)
2801 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2803 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2804 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2807 /* An empty array whose type is that of ARR_TYPE (an array type),
2808 with bounds LOW to LOW-1. */
2810 static struct value
*
2811 empty_array (struct type
*arr_type
, int low
)
2813 struct type
*arr_type0
= ada_check_typedef (arr_type
);
2814 struct type
*index_type
=
2815 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type0
)),
2817 struct type
*elt_type
= ada_array_element_type (arr_type0
, 1);
2819 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2823 /* Name resolution */
2825 /* The "decoded" name for the user-definable Ada operator corresponding
2829 ada_decoded_op_name (enum exp_opcode op
)
2833 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2835 if (ada_opname_table
[i
].op
== op
)
2836 return ada_opname_table
[i
].decoded
;
2838 error (_("Could not find operator name for opcode"));
2842 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2843 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2844 undefined namespace) and converts operators that are
2845 user-defined into appropriate function calls. If CONTEXT_TYPE is
2846 non-null, it provides a preferred result type [at the moment, only
2847 type void has any effect---causing procedures to be preferred over
2848 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2849 return type is preferred. May change (expand) *EXP. */
2852 resolve (struct expression
**expp
, int void_context_p
)
2854 struct type
*context_type
= NULL
;
2858 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2860 resolve_subexp (expp
, &pc
, 1, context_type
);
2863 /* Resolve the operator of the subexpression beginning at
2864 position *POS of *EXPP. "Resolving" consists of replacing
2865 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2866 with their resolutions, replacing built-in operators with
2867 function calls to user-defined operators, where appropriate, and,
2868 when DEPROCEDURE_P is non-zero, converting function-valued variables
2869 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2870 are as in ada_resolve, above. */
2872 static struct value
*
2873 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2874 struct type
*context_type
)
2878 struct expression
*exp
; /* Convenience: == *expp. */
2879 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2880 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2881 int nargs
; /* Number of operands. */
2888 /* Pass one: resolve operands, saving their types and updating *pos,
2893 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2894 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2899 resolve_subexp (expp
, pos
, 0, NULL
);
2901 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2906 resolve_subexp (expp
, pos
, 0, NULL
);
2911 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2914 case OP_ATR_MODULUS
:
2924 case TERNOP_IN_RANGE
:
2925 case BINOP_IN_BOUNDS
:
2931 case OP_DISCRETE_RANGE
:
2933 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2942 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2944 resolve_subexp (expp
, pos
, 1, NULL
);
2946 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2963 case BINOP_LOGICAL_AND
:
2964 case BINOP_LOGICAL_OR
:
2965 case BINOP_BITWISE_AND
:
2966 case BINOP_BITWISE_IOR
:
2967 case BINOP_BITWISE_XOR
:
2970 case BINOP_NOTEQUAL
:
2977 case BINOP_SUBSCRIPT
:
2985 case UNOP_LOGICAL_NOT
:
3001 case OP_INTERNALVAR
:
3011 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3014 case STRUCTOP_STRUCT
:
3015 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
3028 error (_("Unexpected operator during name resolution"));
3031 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
3032 for (i
= 0; i
< nargs
; i
+= 1)
3033 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
3037 /* Pass two: perform any resolution on principal operator. */
3044 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
3046 struct ada_symbol_info
*candidates
;
3050 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3051 (exp
->elts
[pc
+ 2].symbol
),
3052 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
3055 if (n_candidates
> 1)
3057 /* Types tend to get re-introduced locally, so if there
3058 are any local symbols that are not types, first filter
3061 for (j
= 0; j
< n_candidates
; j
+= 1)
3062 switch (SYMBOL_CLASS (candidates
[j
].sym
))
3067 case LOC_REGPARM_ADDR
:
3075 if (j
< n_candidates
)
3078 while (j
< n_candidates
)
3080 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
3082 candidates
[j
] = candidates
[n_candidates
- 1];
3091 if (n_candidates
== 0)
3092 error (_("No definition found for %s"),
3093 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3094 else if (n_candidates
== 1)
3096 else if (deprocedure_p
3097 && !is_nonfunction (candidates
, n_candidates
))
3099 i
= ada_resolve_function
3100 (candidates
, n_candidates
, NULL
, 0,
3101 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
3104 error (_("Could not find a match for %s"),
3105 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3109 printf_filtered (_("Multiple matches for %s\n"),
3110 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
3111 user_select_syms (candidates
, n_candidates
, 1);
3115 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
3116 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
3117 if (innermost_block
== NULL
3118 || contained_in (candidates
[i
].block
, innermost_block
))
3119 innermost_block
= candidates
[i
].block
;
3123 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
3126 replace_operator_with_call (expp
, pc
, 0, 0,
3127 exp
->elts
[pc
+ 2].symbol
,
3128 exp
->elts
[pc
+ 1].block
);
3135 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
3136 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
3138 struct ada_symbol_info
*candidates
;
3142 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
3143 (exp
->elts
[pc
+ 5].symbol
),
3144 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
3146 if (n_candidates
== 1)
3150 i
= ada_resolve_function
3151 (candidates
, n_candidates
,
3153 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
3156 error (_("Could not find a match for %s"),
3157 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
3160 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
3161 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
3162 if (innermost_block
== NULL
3163 || contained_in (candidates
[i
].block
, innermost_block
))
3164 innermost_block
= candidates
[i
].block
;
3175 case BINOP_BITWISE_AND
:
3176 case BINOP_BITWISE_IOR
:
3177 case BINOP_BITWISE_XOR
:
3179 case BINOP_NOTEQUAL
:
3187 case UNOP_LOGICAL_NOT
:
3189 if (possible_user_operator_p (op
, argvec
))
3191 struct ada_symbol_info
*candidates
;
3195 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3196 (struct block
*) NULL
, VAR_DOMAIN
,
3198 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3199 ada_decoded_op_name (op
), NULL
);
3203 replace_operator_with_call (expp
, pc
, nargs
, 1,
3204 candidates
[i
].sym
, candidates
[i
].block
);
3215 return evaluate_subexp_type (exp
, pos
);
3218 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3219 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3221 /* The term "match" here is rather loose. The match is heuristic and
3225 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3227 ftype
= ada_check_typedef (ftype
);
3228 atype
= ada_check_typedef (atype
);
3230 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3231 ftype
= TYPE_TARGET_TYPE (ftype
);
3232 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3233 atype
= TYPE_TARGET_TYPE (atype
);
3235 switch (TYPE_CODE (ftype
))
3238 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3240 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3241 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3242 TYPE_TARGET_TYPE (atype
), 0);
3245 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3247 case TYPE_CODE_ENUM
:
3248 case TYPE_CODE_RANGE
:
3249 switch (TYPE_CODE (atype
))
3252 case TYPE_CODE_ENUM
:
3253 case TYPE_CODE_RANGE
:
3259 case TYPE_CODE_ARRAY
:
3260 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3261 || ada_is_array_descriptor_type (atype
));
3263 case TYPE_CODE_STRUCT
:
3264 if (ada_is_array_descriptor_type (ftype
))
3265 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3266 || ada_is_array_descriptor_type (atype
));
3268 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3269 && !ada_is_array_descriptor_type (atype
));
3271 case TYPE_CODE_UNION
:
3273 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3277 /* Return non-zero if the formals of FUNC "sufficiently match" the
3278 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3279 may also be an enumeral, in which case it is treated as a 0-
3280 argument function. */
3283 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3286 struct type
*func_type
= SYMBOL_TYPE (func
);
3288 if (SYMBOL_CLASS (func
) == LOC_CONST
3289 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3290 return (n_actuals
== 0);
3291 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3294 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3297 for (i
= 0; i
< n_actuals
; i
+= 1)
3299 if (actuals
[i
] == NULL
)
3303 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
,
3305 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3307 if (!ada_type_match (ftype
, atype
, 1))
3314 /* False iff function type FUNC_TYPE definitely does not produce a value
3315 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3316 FUNC_TYPE is not a valid function type with a non-null return type
3317 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3320 return_match (struct type
*func_type
, struct type
*context_type
)
3322 struct type
*return_type
;
3324 if (func_type
== NULL
)
3327 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3328 return_type
= get_base_type (TYPE_TARGET_TYPE (func_type
));
3330 return_type
= get_base_type (func_type
);
3331 if (return_type
== NULL
)
3334 context_type
= get_base_type (context_type
);
3336 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3337 return context_type
== NULL
|| return_type
== context_type
;
3338 else if (context_type
== NULL
)
3339 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3341 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3345 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3346 function (if any) that matches the types of the NARGS arguments in
3347 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3348 that returns that type, then eliminate matches that don't. If
3349 CONTEXT_TYPE is void and there is at least one match that does not
3350 return void, eliminate all matches that do.
3352 Asks the user if there is more than one match remaining. Returns -1
3353 if there is no such symbol or none is selected. NAME is used
3354 solely for messages. May re-arrange and modify SYMS in
3355 the process; the index returned is for the modified vector. */
3358 ada_resolve_function (struct ada_symbol_info syms
[],
3359 int nsyms
, struct value
**args
, int nargs
,
3360 const char *name
, struct type
*context_type
)
3364 int m
; /* Number of hits */
3367 /* In the first pass of the loop, we only accept functions matching
3368 context_type. If none are found, we add a second pass of the loop
3369 where every function is accepted. */
3370 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3372 for (k
= 0; k
< nsyms
; k
+= 1)
3374 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3376 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3377 && (fallback
|| return_match (type
, context_type
)))
3389 printf_filtered (_("Multiple matches for %s\n"), name
);
3390 user_select_syms (syms
, m
, 1);
3396 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3397 in a listing of choices during disambiguation (see sort_choices, below).
3398 The idea is that overloadings of a subprogram name from the
3399 same package should sort in their source order. We settle for ordering
3400 such symbols by their trailing number (__N or $N). */
3403 encoded_ordered_before (char *N0
, char *N1
)
3407 else if (N0
== NULL
)
3413 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3415 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3417 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3418 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3423 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3426 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3428 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3429 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3431 return (strcmp (N0
, N1
) < 0);
3435 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3439 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3443 for (i
= 1; i
< nsyms
; i
+= 1)
3445 struct ada_symbol_info sym
= syms
[i
];
3448 for (j
= i
- 1; j
>= 0; j
-= 1)
3450 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3451 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3453 syms
[j
+ 1] = syms
[j
];
3459 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3460 by asking the user (if necessary), returning the number selected,
3461 and setting the first elements of SYMS items. Error if no symbols
3464 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3465 to be re-integrated one of these days. */
3468 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3471 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3473 int first_choice
= (max_results
== 1) ? 1 : 2;
3474 const char *select_mode
= multiple_symbols_select_mode ();
3476 if (max_results
< 1)
3477 error (_("Request to select 0 symbols!"));
3481 if (select_mode
== multiple_symbols_cancel
)
3483 canceled because the command is ambiguous\n\
3484 See set/show multiple-symbol."));
3486 /* If select_mode is "all", then return all possible symbols.
3487 Only do that if more than one symbol can be selected, of course.
3488 Otherwise, display the menu as usual. */
3489 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3492 printf_unfiltered (_("[0] cancel\n"));
3493 if (max_results
> 1)
3494 printf_unfiltered (_("[1] all\n"));
3496 sort_choices (syms
, nsyms
);
3498 for (i
= 0; i
< nsyms
; i
+= 1)
3500 if (syms
[i
].sym
== NULL
)
3503 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3505 struct symtab_and_line sal
=
3506 find_function_start_sal (syms
[i
].sym
, 1);
3508 if (sal
.symtab
== NULL
)
3509 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3511 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3514 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3515 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3516 sal
.symtab
->filename
, sal
.line
);
3522 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3523 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3524 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3525 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3527 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3528 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3530 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3531 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3532 else if (is_enumeral
3533 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3535 printf_unfiltered (("[%d] "), i
+ first_choice
);
3536 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3538 printf_unfiltered (_("'(%s) (enumeral)\n"),
3539 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3541 else if (symtab
!= NULL
)
3542 printf_unfiltered (is_enumeral
3543 ? _("[%d] %s in %s (enumeral)\n")
3544 : _("[%d] %s at %s:?\n"),
3546 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3549 printf_unfiltered (is_enumeral
3550 ? _("[%d] %s (enumeral)\n")
3551 : _("[%d] %s at ?\n"),
3553 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3557 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3560 for (i
= 0; i
< n_chosen
; i
+= 1)
3561 syms
[i
] = syms
[chosen
[i
]];
3566 /* Read and validate a set of numeric choices from the user in the
3567 range 0 .. N_CHOICES-1. Place the results in increasing
3568 order in CHOICES[0 .. N-1], and return N.
3570 The user types choices as a sequence of numbers on one line
3571 separated by blanks, encoding them as follows:
3573 + A choice of 0 means to cancel the selection, throwing an error.
3574 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3575 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3577 The user is not allowed to choose more than MAX_RESULTS values.
3579 ANNOTATION_SUFFIX, if present, is used to annotate the input
3580 prompts (for use with the -f switch). */
3583 get_selections (int *choices
, int n_choices
, int max_results
,
3584 int is_all_choice
, char *annotation_suffix
)
3589 int first_choice
= is_all_choice
? 2 : 1;
3591 prompt
= getenv ("PS2");
3595 args
= command_line_input (prompt
, 0, annotation_suffix
);
3598 error_no_arg (_("one or more choice numbers"));
3602 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3603 order, as given in args. Choices are validated. */
3609 while (isspace (*args
))
3611 if (*args
== '\0' && n_chosen
== 0)
3612 error_no_arg (_("one or more choice numbers"));
3613 else if (*args
== '\0')
3616 choice
= strtol (args
, &args2
, 10);
3617 if (args
== args2
|| choice
< 0
3618 || choice
> n_choices
+ first_choice
- 1)
3619 error (_("Argument must be choice number"));
3623 error (_("cancelled"));
3625 if (choice
< first_choice
)
3627 n_chosen
= n_choices
;
3628 for (j
= 0; j
< n_choices
; j
+= 1)
3632 choice
-= first_choice
;
3634 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3638 if (j
< 0 || choice
!= choices
[j
])
3642 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3643 choices
[k
+ 1] = choices
[k
];
3644 choices
[j
+ 1] = choice
;
3649 if (n_chosen
> max_results
)
3650 error (_("Select no more than %d of the above"), max_results
);
3655 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3656 on the function identified by SYM and BLOCK, and taking NARGS
3657 arguments. Update *EXPP as needed to hold more space. */
3660 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3661 int oplen
, struct symbol
*sym
,
3662 struct block
*block
)
3664 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3665 symbol, -oplen for operator being replaced). */
3666 struct expression
*newexp
= (struct expression
*)
3667 xzalloc (sizeof (struct expression
)
3668 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3669 struct expression
*exp
= *expp
;
3671 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3672 newexp
->language_defn
= exp
->language_defn
;
3673 newexp
->gdbarch
= exp
->gdbarch
;
3674 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3675 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3676 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3678 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3679 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3681 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3682 newexp
->elts
[pc
+ 4].block
= block
;
3683 newexp
->elts
[pc
+ 5].symbol
= sym
;
3689 /* Type-class predicates */
3691 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3695 numeric_type_p (struct type
*type
)
3701 switch (TYPE_CODE (type
))
3706 case TYPE_CODE_RANGE
:
3707 return (type
== TYPE_TARGET_TYPE (type
)
3708 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3715 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3718 integer_type_p (struct type
*type
)
3724 switch (TYPE_CODE (type
))
3728 case TYPE_CODE_RANGE
:
3729 return (type
== TYPE_TARGET_TYPE (type
)
3730 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3737 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3740 scalar_type_p (struct type
*type
)
3746 switch (TYPE_CODE (type
))
3749 case TYPE_CODE_RANGE
:
3750 case TYPE_CODE_ENUM
:
3759 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3762 discrete_type_p (struct type
*type
)
3768 switch (TYPE_CODE (type
))
3771 case TYPE_CODE_RANGE
:
3772 case TYPE_CODE_ENUM
:
3773 case TYPE_CODE_BOOL
:
3781 /* Returns non-zero if OP with operands in the vector ARGS could be
3782 a user-defined function. Errs on the side of pre-defined operators
3783 (i.e., result 0). */
3786 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3788 struct type
*type0
=
3789 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3790 struct type
*type1
=
3791 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3805 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3809 case BINOP_BITWISE_AND
:
3810 case BINOP_BITWISE_IOR
:
3811 case BINOP_BITWISE_XOR
:
3812 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3815 case BINOP_NOTEQUAL
:
3820 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3823 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3826 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3830 case UNOP_LOGICAL_NOT
:
3832 return (!numeric_type_p (type0
));
3841 1. In the following, we assume that a renaming type's name may
3842 have an ___XD suffix. It would be nice if this went away at some
3844 2. We handle both the (old) purely type-based representation of
3845 renamings and the (new) variable-based encoding. At some point,
3846 it is devoutly to be hoped that the former goes away
3847 (FIXME: hilfinger-2007-07-09).
3848 3. Subprogram renamings are not implemented, although the XRS
3849 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3851 /* If SYM encodes a renaming,
3853 <renaming> renames <renamed entity>,
3855 sets *LEN to the length of the renamed entity's name,
3856 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3857 the string describing the subcomponent selected from the renamed
3858 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3859 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3860 are undefined). Otherwise, returns a value indicating the category
3861 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3862 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3863 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3864 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3865 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3866 may be NULL, in which case they are not assigned.
3868 [Currently, however, GCC does not generate subprogram renamings.] */
3870 enum ada_renaming_category
3871 ada_parse_renaming (struct symbol
*sym
,
3872 const char **renamed_entity
, int *len
,
3873 const char **renaming_expr
)
3875 enum ada_renaming_category kind
;
3880 return ADA_NOT_RENAMING
;
3881 switch (SYMBOL_CLASS (sym
))
3884 return ADA_NOT_RENAMING
;
3886 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3887 renamed_entity
, len
, renaming_expr
);
3891 case LOC_OPTIMIZED_OUT
:
3892 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3894 return ADA_NOT_RENAMING
;
3898 kind
= ADA_OBJECT_RENAMING
;
3902 kind
= ADA_EXCEPTION_RENAMING
;
3906 kind
= ADA_PACKAGE_RENAMING
;
3910 kind
= ADA_SUBPROGRAM_RENAMING
;
3914 return ADA_NOT_RENAMING
;
3918 if (renamed_entity
!= NULL
)
3919 *renamed_entity
= info
;
3920 suffix
= strstr (info
, "___XE");
3921 if (suffix
== NULL
|| suffix
== info
)
3922 return ADA_NOT_RENAMING
;
3924 *len
= strlen (info
) - strlen (suffix
);
3926 if (renaming_expr
!= NULL
)
3927 *renaming_expr
= suffix
;
3931 /* Assuming TYPE encodes a renaming according to the old encoding in
3932 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3933 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3934 ADA_NOT_RENAMING otherwise. */
3935 static enum ada_renaming_category
3936 parse_old_style_renaming (struct type
*type
,
3937 const char **renamed_entity
, int *len
,
3938 const char **renaming_expr
)
3940 enum ada_renaming_category kind
;
3945 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3946 || TYPE_NFIELDS (type
) != 1)
3947 return ADA_NOT_RENAMING
;
3949 name
= type_name_no_tag (type
);
3951 return ADA_NOT_RENAMING
;
3953 name
= strstr (name
, "___XR");
3955 return ADA_NOT_RENAMING
;
3960 kind
= ADA_OBJECT_RENAMING
;
3963 kind
= ADA_EXCEPTION_RENAMING
;
3966 kind
= ADA_PACKAGE_RENAMING
;
3969 kind
= ADA_SUBPROGRAM_RENAMING
;
3972 return ADA_NOT_RENAMING
;
3975 info
= TYPE_FIELD_NAME (type
, 0);
3977 return ADA_NOT_RENAMING
;
3978 if (renamed_entity
!= NULL
)
3979 *renamed_entity
= info
;
3980 suffix
= strstr (info
, "___XE");
3981 if (renaming_expr
!= NULL
)
3982 *renaming_expr
= suffix
+ 5;
3983 if (suffix
== NULL
|| suffix
== info
)
3984 return ADA_NOT_RENAMING
;
3986 *len
= suffix
- info
;
3992 /* Evaluation: Function Calls */
3994 /* Return an lvalue containing the value VAL. This is the identity on
3995 lvalues, and otherwise has the side-effect of allocating memory
3996 in the inferior where a copy of the value contents is copied. */
3998 static struct value
*
3999 ensure_lval (struct value
*val
)
4001 if (VALUE_LVAL (val
) == not_lval
4002 || VALUE_LVAL (val
) == lval_internalvar
)
4004 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
4005 const CORE_ADDR addr
=
4006 value_as_long (value_allocate_space_in_inferior (len
));
4008 set_value_address (val
, addr
);
4009 VALUE_LVAL (val
) = lval_memory
;
4010 write_memory (addr
, value_contents (val
), len
);
4016 /* Return the value ACTUAL, converted to be an appropriate value for a
4017 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
4018 allocating any necessary descriptors (fat pointers), or copies of
4019 values not residing in memory, updating it as needed. */
4022 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
)
4024 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
4025 struct type
*formal_type
= ada_check_typedef (formal_type0
);
4026 struct type
*formal_target
=
4027 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4028 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
4029 struct type
*actual_target
=
4030 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
4031 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
4033 if (ada_is_array_descriptor_type (formal_target
)
4034 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
4035 return make_array_descriptor (formal_type
, actual
);
4036 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
4037 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
4039 struct value
*result
;
4041 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
4042 && ada_is_array_descriptor_type (actual_target
))
4043 result
= desc_data (actual
);
4044 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
4046 if (VALUE_LVAL (actual
) != lval_memory
)
4050 actual_type
= ada_check_typedef (value_type (actual
));
4051 val
= allocate_value (actual_type
);
4052 memcpy ((char *) value_contents_raw (val
),
4053 (char *) value_contents (actual
),
4054 TYPE_LENGTH (actual_type
));
4055 actual
= ensure_lval (val
);
4057 result
= value_addr (actual
);
4061 return value_cast_pointers (formal_type
, result
);
4063 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
4064 return ada_value_ind (actual
);
4069 /* Convert VALUE (which must be an address) to a CORE_ADDR that is a pointer of
4070 type TYPE. This is usually an inefficient no-op except on some targets
4071 (such as AVR) where the representation of a pointer and an address
4075 value_pointer (struct value
*value
, struct type
*type
)
4077 struct gdbarch
*gdbarch
= get_type_arch (type
);
4078 unsigned len
= TYPE_LENGTH (type
);
4079 gdb_byte
*buf
= alloca (len
);
4082 addr
= value_address (value
);
4083 gdbarch_address_to_pointer (gdbarch
, type
, buf
, addr
);
4084 addr
= extract_unsigned_integer (buf
, len
, gdbarch_byte_order (gdbarch
));
4089 /* Push a descriptor of type TYPE for array value ARR on the stack at
4090 *SP, updating *SP to reflect the new descriptor. Return either
4091 an lvalue representing the new descriptor, or (if TYPE is a pointer-
4092 to-descriptor type rather than a descriptor type), a struct value *
4093 representing a pointer to this descriptor. */
4095 static struct value
*
4096 make_array_descriptor (struct type
*type
, struct value
*arr
)
4098 struct type
*bounds_type
= desc_bounds_type (type
);
4099 struct type
*desc_type
= desc_base_type (type
);
4100 struct value
*descriptor
= allocate_value (desc_type
);
4101 struct value
*bounds
= allocate_value (bounds_type
);
4104 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
)));
4107 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4108 ada_array_bound (arr
, i
, 0),
4109 desc_bound_bitpos (bounds_type
, i
, 0),
4110 desc_bound_bitsize (bounds_type
, i
, 0));
4111 modify_field (value_type (bounds
), value_contents_writeable (bounds
),
4112 ada_array_bound (arr
, i
, 1),
4113 desc_bound_bitpos (bounds_type
, i
, 1),
4114 desc_bound_bitsize (bounds_type
, i
, 1));
4117 bounds
= ensure_lval (bounds
);
4119 modify_field (value_type (descriptor
),
4120 value_contents_writeable (descriptor
),
4121 value_pointer (ensure_lval (arr
),
4122 TYPE_FIELD_TYPE (desc_type
, 0)),
4123 fat_pntr_data_bitpos (desc_type
),
4124 fat_pntr_data_bitsize (desc_type
));
4126 modify_field (value_type (descriptor
),
4127 value_contents_writeable (descriptor
),
4128 value_pointer (bounds
,
4129 TYPE_FIELD_TYPE (desc_type
, 1)),
4130 fat_pntr_bounds_bitpos (desc_type
),
4131 fat_pntr_bounds_bitsize (desc_type
));
4133 descriptor
= ensure_lval (descriptor
);
4135 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
4136 return value_addr (descriptor
);
4141 /* Dummy definitions for an experimental caching module that is not
4142 * used in the public sources. */
4145 lookup_cached_symbol (const char *name
, domain_enum
namespace,
4146 struct symbol
**sym
, struct block
**block
)
4152 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
4153 struct block
*block
)
4159 /* Return the result of a standard (literal, C-like) lookup of NAME in
4160 given DOMAIN, visible from lexical block BLOCK. */
4162 static struct symbol
*
4163 standard_lookup (const char *name
, const struct block
*block
,
4168 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4170 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4171 cache_symbol (name
, domain
, sym
, block_found
);
4176 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4177 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4178 since they contend in overloading in the same way. */
4180 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4184 for (i
= 0; i
< n
; i
+= 1)
4185 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4186 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4187 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4193 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4194 struct types. Otherwise, they may not. */
4197 equiv_types (struct type
*type0
, struct type
*type1
)
4201 if (type0
== NULL
|| type1
== NULL
4202 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4204 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4205 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4206 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4207 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4213 /* True iff SYM0 represents the same entity as SYM1, or one that is
4214 no more defined than that of SYM1. */
4217 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4221 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4222 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4225 switch (SYMBOL_CLASS (sym0
))
4231 struct type
*type0
= SYMBOL_TYPE (sym0
);
4232 struct type
*type1
= SYMBOL_TYPE (sym1
);
4233 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4234 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4235 int len0
= strlen (name0
);
4238 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4239 && (equiv_types (type0
, type1
)
4240 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4241 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4244 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4245 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4251 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4252 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4255 add_defn_to_vec (struct obstack
*obstackp
,
4257 struct block
*block
)
4260 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4262 /* Do not try to complete stub types, as the debugger is probably
4263 already scanning all symbols matching a certain name at the
4264 time when this function is called. Trying to replace the stub
4265 type by its associated full type will cause us to restart a scan
4266 which may lead to an infinite recursion. Instead, the client
4267 collecting the matching symbols will end up collecting several
4268 matches, with at least one of them complete. It can then filter
4269 out the stub ones if needed. */
4271 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4273 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4275 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4277 prevDefns
[i
].sym
= sym
;
4278 prevDefns
[i
].block
= block
;
4284 struct ada_symbol_info info
;
4288 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4292 /* Number of ada_symbol_info structures currently collected in
4293 current vector in *OBSTACKP. */
4296 num_defns_collected (struct obstack
*obstackp
)
4298 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4301 /* Vector of ada_symbol_info structures currently collected in current
4302 vector in *OBSTACKP. If FINISH, close off the vector and return
4303 its final address. */
4305 static struct ada_symbol_info
*
4306 defns_collected (struct obstack
*obstackp
, int finish
)
4309 return obstack_finish (obstackp
);
4311 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4314 /* Return a minimal symbol matching NAME according to Ada decoding
4315 rules. Returns NULL if there is no such minimal symbol. Names
4316 prefixed with "standard__" are handled specially: "standard__" is
4317 first stripped off, and only static and global symbols are searched. */
4319 struct minimal_symbol
*
4320 ada_lookup_simple_minsym (const char *name
)
4322 struct objfile
*objfile
;
4323 struct minimal_symbol
*msymbol
;
4326 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4328 name
+= sizeof ("standard__") - 1;
4332 wild_match
= (strstr (name
, "__") == NULL
);
4334 ALL_MSYMBOLS (objfile
, msymbol
)
4336 if (match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4337 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4344 /* For all subprograms that statically enclose the subprogram of the
4345 selected frame, add symbols matching identifier NAME in DOMAIN
4346 and their blocks to the list of data in OBSTACKP, as for
4347 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4351 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4352 const char *name
, domain_enum
namespace,
4357 /* True if TYPE is definitely an artificial type supplied to a symbol
4358 for which no debugging information was given in the symbol file. */
4361 is_nondebugging_type (struct type
*type
)
4363 char *name
= ada_type_name (type
);
4365 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4368 /* Return nonzero if TYPE1 and TYPE2 are two enumeration types
4369 that are deemed "identical" for practical purposes.
4371 This function assumes that TYPE1 and TYPE2 are both TYPE_CODE_ENUM
4372 types and that their number of enumerals is identical (in other
4373 words, TYPE_NFIELDS (type1) == TYPE_NFIELDS (type2)). */
4376 ada_identical_enum_types_p (struct type
*type1
, struct type
*type2
)
4380 /* The heuristic we use here is fairly conservative. We consider
4381 that 2 enumerate types are identical if they have the same
4382 number of enumerals and that all enumerals have the same
4383 underlying value and name. */
4385 /* All enums in the type should have an identical underlying value. */
4386 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4387 if (TYPE_FIELD_BITPOS (type1
, i
) != TYPE_FIELD_BITPOS (type2
, i
))
4390 /* All enumerals should also have the same name (modulo any numerical
4392 for (i
= 0; i
< TYPE_NFIELDS (type1
); i
++)
4394 char *name_1
= TYPE_FIELD_NAME (type1
, i
);
4395 char *name_2
= TYPE_FIELD_NAME (type2
, i
);
4396 int len_1
= strlen (name_1
);
4397 int len_2
= strlen (name_2
);
4399 ada_remove_trailing_digits (TYPE_FIELD_NAME (type1
, i
), &len_1
);
4400 ada_remove_trailing_digits (TYPE_FIELD_NAME (type2
, i
), &len_2
);
4402 || strncmp (TYPE_FIELD_NAME (type1
, i
),
4403 TYPE_FIELD_NAME (type2
, i
),
4411 /* Return nonzero if all the symbols in SYMS are all enumeral symbols
4412 that are deemed "identical" for practical purposes. Sometimes,
4413 enumerals are not strictly identical, but their types are so similar
4414 that they can be considered identical.
4416 For instance, consider the following code:
4418 type Color is (Black, Red, Green, Blue, White);
4419 type RGB_Color is new Color range Red .. Blue;
4421 Type RGB_Color is a subrange of an implicit type which is a copy
4422 of type Color. If we call that implicit type RGB_ColorB ("B" is
4423 for "Base Type"), then type RGB_ColorB is a copy of type Color.
4424 As a result, when an expression references any of the enumeral
4425 by name (Eg. "print green"), the expression is technically
4426 ambiguous and the user should be asked to disambiguate. But
4427 doing so would only hinder the user, since it wouldn't matter
4428 what choice he makes, the outcome would always be the same.
4429 So, for practical purposes, we consider them as the same. */
4432 symbols_are_identical_enums (struct ada_symbol_info
*syms
, int nsyms
)
4436 /* Before performing a thorough comparison check of each type,
4437 we perform a series of inexpensive checks. We expect that these
4438 checks will quickly fail in the vast majority of cases, and thus
4439 help prevent the unnecessary use of a more expensive comparison.
4440 Said comparison also expects us to make some of these checks
4441 (see ada_identical_enum_types_p). */
4443 /* Quick check: All symbols should have an enum type. */
4444 for (i
= 0; i
< nsyms
; i
++)
4445 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
)
4448 /* Quick check: They should all have the same value. */
4449 for (i
= 1; i
< nsyms
; i
++)
4450 if (SYMBOL_VALUE (syms
[i
].sym
) != SYMBOL_VALUE (syms
[0].sym
))
4453 /* Quick check: They should all have the same number of enumerals. */
4454 for (i
= 1; i
< nsyms
; i
++)
4455 if (TYPE_NFIELDS (SYMBOL_TYPE (syms
[i
].sym
))
4456 != TYPE_NFIELDS (SYMBOL_TYPE (syms
[0].sym
)))
4459 /* All the sanity checks passed, so we might have a set of
4460 identical enumeration types. Perform a more complete
4461 comparison of the type of each symbol. */
4462 for (i
= 1; i
< nsyms
; i
++)
4463 if (!ada_identical_enum_types_p (SYMBOL_TYPE (syms
[i
].sym
),
4464 SYMBOL_TYPE (syms
[0].sym
)))
4470 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4471 duplicate other symbols in the list (The only case I know of where
4472 this happens is when object files containing stabs-in-ecoff are
4473 linked with files containing ordinary ecoff debugging symbols (or no
4474 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4475 Returns the number of items in the modified list. */
4478 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4482 /* We should never be called with less than 2 symbols, as there
4483 cannot be any extra symbol in that case. But it's easy to
4484 handle, since we have nothing to do in that case. */
4493 /* If two symbols have the same name and one of them is a stub type,
4494 the get rid of the stub. */
4496 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4497 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4499 for (j
= 0; j
< nsyms
; j
++)
4502 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4503 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4504 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4505 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4510 /* Two symbols with the same name, same class and same address
4511 should be identical. */
4513 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4514 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4515 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4517 for (j
= 0; j
< nsyms
; j
+= 1)
4520 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4521 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4522 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4523 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4524 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4525 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4532 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4533 syms
[j
- 1] = syms
[j
];
4540 /* If all the remaining symbols are identical enumerals, then
4541 just keep the first one and discard the rest.
4543 Unlike what we did previously, we do not discard any entry
4544 unless they are ALL identical. This is because the symbol
4545 comparison is not a strict comparison, but rather a practical
4546 comparison. If all symbols are considered identical, then
4547 we can just go ahead and use the first one and discard the rest.
4548 But if we cannot reduce the list to a single element, we have
4549 to ask the user to disambiguate anyways. And if we have to
4550 present a multiple-choice menu, it's less confusing if the list
4551 isn't missing some choices that were identical and yet distinct. */
4552 if (symbols_are_identical_enums (syms
, nsyms
))
4558 /* Given a type that corresponds to a renaming entity, use the type name
4559 to extract the scope (package name or function name, fully qualified,
4560 and following the GNAT encoding convention) where this renaming has been
4561 defined. The string returned needs to be deallocated after use. */
4564 xget_renaming_scope (struct type
*renaming_type
)
4566 /* The renaming types adhere to the following convention:
4567 <scope>__<rename>___<XR extension>.
4568 So, to extract the scope, we search for the "___XR" extension,
4569 and then backtrack until we find the first "__". */
4571 const char *name
= type_name_no_tag (renaming_type
);
4572 char *suffix
= strstr (name
, "___XR");
4577 /* Now, backtrack a bit until we find the first "__". Start looking
4578 at suffix - 3, as the <rename> part is at least one character long. */
4580 for (last
= suffix
- 3; last
> name
; last
--)
4581 if (last
[0] == '_' && last
[1] == '_')
4584 /* Make a copy of scope and return it. */
4586 scope_len
= last
- name
;
4587 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4589 strncpy (scope
, name
, scope_len
);
4590 scope
[scope_len
] = '\0';
4595 /* Return nonzero if NAME corresponds to a package name. */
4598 is_package_name (const char *name
)
4600 /* Here, We take advantage of the fact that no symbols are generated
4601 for packages, while symbols are generated for each function.
4602 So the condition for NAME represent a package becomes equivalent
4603 to NAME not existing in our list of symbols. There is only one
4604 small complication with library-level functions (see below). */
4608 /* If it is a function that has not been defined at library level,
4609 then we should be able to look it up in the symbols. */
4610 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4613 /* Library-level function names start with "_ada_". See if function
4614 "_ada_" followed by NAME can be found. */
4616 /* Do a quick check that NAME does not contain "__", since library-level
4617 functions names cannot contain "__" in them. */
4618 if (strstr (name
, "__") != NULL
)
4621 fun_name
= xstrprintf ("_ada_%s", name
);
4623 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4626 /* Return nonzero if SYM corresponds to a renaming entity that is
4627 not visible from FUNCTION_NAME. */
4630 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4634 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4637 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4639 make_cleanup (xfree
, scope
);
4641 /* If the rename has been defined in a package, then it is visible. */
4642 if (is_package_name (scope
))
4645 /* Check that the rename is in the current function scope by checking
4646 that its name starts with SCOPE. */
4648 /* If the function name starts with "_ada_", it means that it is
4649 a library-level function. Strip this prefix before doing the
4650 comparison, as the encoding for the renaming does not contain
4652 if (strncmp (function_name
, "_ada_", 5) == 0)
4655 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4658 /* Remove entries from SYMS that corresponds to a renaming entity that
4659 is not visible from the function associated with CURRENT_BLOCK or
4660 that is superfluous due to the presence of more specific renaming
4661 information. Places surviving symbols in the initial entries of
4662 SYMS and returns the number of surviving symbols.
4665 First, in cases where an object renaming is implemented as a
4666 reference variable, GNAT may produce both the actual reference
4667 variable and the renaming encoding. In this case, we discard the
4670 Second, GNAT emits a type following a specified encoding for each renaming
4671 entity. Unfortunately, STABS currently does not support the definition
4672 of types that are local to a given lexical block, so all renamings types
4673 are emitted at library level. As a consequence, if an application
4674 contains two renaming entities using the same name, and a user tries to
4675 print the value of one of these entities, the result of the ada symbol
4676 lookup will also contain the wrong renaming type.
4678 This function partially covers for this limitation by attempting to
4679 remove from the SYMS list renaming symbols that should be visible
4680 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4681 method with the current information available. The implementation
4682 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4684 - When the user tries to print a rename in a function while there
4685 is another rename entity defined in a package: Normally, the
4686 rename in the function has precedence over the rename in the
4687 package, so the latter should be removed from the list. This is
4688 currently not the case.
4690 - This function will incorrectly remove valid renames if
4691 the CURRENT_BLOCK corresponds to a function which symbol name
4692 has been changed by an "Export" pragma. As a consequence,
4693 the user will be unable to print such rename entities. */
4696 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4697 int nsyms
, const struct block
*current_block
)
4699 struct symbol
*current_function
;
4700 char *current_function_name
;
4702 int is_new_style_renaming
;
4704 /* If there is both a renaming foo___XR... encoded as a variable and
4705 a simple variable foo in the same block, discard the latter.
4706 First, zero out such symbols, then compress. */
4707 is_new_style_renaming
= 0;
4708 for (i
= 0; i
< nsyms
; i
+= 1)
4710 struct symbol
*sym
= syms
[i
].sym
;
4711 struct block
*block
= syms
[i
].block
;
4715 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4717 name
= SYMBOL_LINKAGE_NAME (sym
);
4718 suffix
= strstr (name
, "___XR");
4722 int name_len
= suffix
- name
;
4725 is_new_style_renaming
= 1;
4726 for (j
= 0; j
< nsyms
; j
+= 1)
4727 if (i
!= j
&& syms
[j
].sym
!= NULL
4728 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4730 && block
== syms
[j
].block
)
4734 if (is_new_style_renaming
)
4738 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4739 if (syms
[j
].sym
!= NULL
)
4747 /* Extract the function name associated to CURRENT_BLOCK.
4748 Abort if unable to do so. */
4750 if (current_block
== NULL
)
4753 current_function
= block_linkage_function (current_block
);
4754 if (current_function
== NULL
)
4757 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4758 if (current_function_name
== NULL
)
4761 /* Check each of the symbols, and remove it from the list if it is
4762 a type corresponding to a renaming that is out of the scope of
4763 the current block. */
4768 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4769 == ADA_OBJECT_RENAMING
4770 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4774 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4775 syms
[j
- 1] = syms
[j
];
4785 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4786 whose name and domain match NAME and DOMAIN respectively.
4787 If no match was found, then extend the search to "enclosing"
4788 routines (in other words, if we're inside a nested function,
4789 search the symbols defined inside the enclosing functions).
4791 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4794 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4795 struct block
*block
, domain_enum domain
,
4798 int block_depth
= 0;
4800 while (block
!= NULL
)
4803 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4805 /* If we found a non-function match, assume that's the one. */
4806 if (is_nonfunction (defns_collected (obstackp
, 0),
4807 num_defns_collected (obstackp
)))
4810 block
= BLOCK_SUPERBLOCK (block
);
4813 /* If no luck so far, try to find NAME as a local symbol in some lexically
4814 enclosing subprogram. */
4815 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4816 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4819 /* An object of this type is used as the user_data argument when
4820 calling the map_matching_symbols method. */
4824 struct objfile
*objfile
;
4825 struct obstack
*obstackp
;
4826 struct symbol
*arg_sym
;
4830 /* A callback for add_matching_symbols that adds SYM, found in BLOCK,
4831 to a list of symbols. DATA0 is a pointer to a struct match_data *
4832 containing the obstack that collects the symbol list, the file that SYM
4833 must come from, a flag indicating whether a non-argument symbol has
4834 been found in the current block, and the last argument symbol
4835 passed in SYM within the current block (if any). When SYM is null,
4836 marking the end of a block, the argument symbol is added if no
4837 other has been found. */
4840 aux_add_nonlocal_symbols (struct block
*block
, struct symbol
*sym
, void *data0
)
4842 struct match_data
*data
= (struct match_data
*) data0
;
4846 if (!data
->found_sym
&& data
->arg_sym
!= NULL
)
4847 add_defn_to_vec (data
->obstackp
,
4848 fixup_symbol_section (data
->arg_sym
, data
->objfile
),
4850 data
->found_sym
= 0;
4851 data
->arg_sym
= NULL
;
4855 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4857 else if (SYMBOL_IS_ARGUMENT (sym
))
4858 data
->arg_sym
= sym
;
4861 data
->found_sym
= 1;
4862 add_defn_to_vec (data
->obstackp
,
4863 fixup_symbol_section (sym
, data
->objfile
),
4870 /* Compare STRING1 to STRING2, with results as for strcmp.
4871 Compatible with strcmp_iw in that strcmp_iw (STRING1, STRING2) <= 0
4872 implies compare_names (STRING1, STRING2) (they may differ as to
4873 what symbols compare equal). */
4876 compare_names (const char *string1
, const char *string2
)
4878 while (*string1
!= '\0' && *string2
!= '\0')
4880 if (isspace (*string1
) || isspace (*string2
))
4881 return strcmp_iw_ordered (string1
, string2
);
4882 if (*string1
!= *string2
)
4890 return strcmp_iw_ordered (string1
, string2
);
4892 if (*string2
== '\0')
4894 if (is_name_suffix (string1
))
4901 if (*string2
== '(')
4902 return strcmp_iw_ordered (string1
, string2
);
4904 return *string1
- *string2
;
4908 /* Add to OBSTACKP all non-local symbols whose name and domain match
4909 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4910 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4913 add_nonlocal_symbols (struct obstack
*obstackp
, const char *name
,
4914 domain_enum domain
, int global
,
4917 struct objfile
*objfile
;
4918 struct match_data data
;
4920 data
.obstackp
= obstackp
;
4921 data
.arg_sym
= NULL
;
4923 ALL_OBJFILES (objfile
)
4925 data
.objfile
= objfile
;
4928 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
4929 aux_add_nonlocal_symbols
, &data
,
4932 objfile
->sf
->qf
->map_matching_symbols (name
, domain
, objfile
, global
,
4933 aux_add_nonlocal_symbols
, &data
,
4934 full_match
, compare_names
);
4937 if (num_defns_collected (obstackp
) == 0 && global
&& !is_wild_match
)
4939 ALL_OBJFILES (objfile
)
4941 char *name1
= alloca (strlen (name
) + sizeof ("_ada_"));
4942 strcpy (name1
, "_ada_");
4943 strcpy (name1
+ sizeof ("_ada_") - 1, name
);
4944 data
.objfile
= objfile
;
4945 objfile
->sf
->qf
->map_matching_symbols (name1
, domain
,
4947 aux_add_nonlocal_symbols
,
4949 full_match
, compare_names
);
4954 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4955 scope and in global scopes, returning the number of matches. Sets
4956 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4957 indicating the symbols found and the blocks and symbol tables (if
4958 any) in which they were found. This vector are transient---good only to
4959 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4960 symbol match within the nest of blocks whose innermost member is BLOCK0,
4961 is the one match returned (no other matches in that or
4962 enclosing blocks is returned). If there are any matches in or
4963 surrounding BLOCK0, then these alone are returned. Otherwise, the
4964 search extends to global and file-scope (static) symbol tables.
4965 Names prefixed with "standard__" are handled specially: "standard__"
4966 is first stripped off, and only static and global symbols are searched. */
4969 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4970 domain_enum
namespace,
4971 struct ada_symbol_info
**results
)
4974 struct block
*block
;
4980 obstack_free (&symbol_list_obstack
, NULL
);
4981 obstack_init (&symbol_list_obstack
);
4985 /* Search specified block and its superiors. */
4987 wild_match
= (strstr (name0
, "__") == NULL
);
4989 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4990 needed, but adding const will
4991 have a cascade effect. */
4993 /* Special case: If the user specifies a symbol name inside package
4994 Standard, do a non-wild matching of the symbol name without
4995 the "standard__" prefix. This was primarily introduced in order
4996 to allow the user to specifically access the standard exceptions
4997 using, for instance, Standard.Constraint_Error when Constraint_Error
4998 is ambiguous (due to the user defining its own Constraint_Error
4999 entity inside its program). */
5000 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
5004 name
= name0
+ sizeof ("standard__") - 1;
5007 /* Check the non-global symbols. If we have ANY match, then we're done. */
5009 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
5011 if (num_defns_collected (&symbol_list_obstack
) > 0)
5014 /* No non-global symbols found. Check our cache to see if we have
5015 already performed this search before. If we have, then return
5019 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
5022 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
5026 /* Search symbols from all global blocks. */
5028 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 1,
5031 /* Now add symbols from all per-file blocks if we've gotten no hits
5032 (not strictly correct, but perhaps better than an error). */
5034 if (num_defns_collected (&symbol_list_obstack
) == 0)
5035 add_nonlocal_symbols (&symbol_list_obstack
, name
, namespace, 0,
5039 ndefns
= num_defns_collected (&symbol_list_obstack
);
5040 *results
= defns_collected (&symbol_list_obstack
, 1);
5042 ndefns
= remove_extra_symbols (*results
, ndefns
);
5045 cache_symbol (name0
, namespace, NULL
, NULL
);
5047 if (ndefns
== 1 && cacheIfUnique
)
5048 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
5050 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
5055 /* If NAME is the name of an entity, return a string that should
5056 be used to look that entity up in Ada units. This string should
5057 be deallocated after use using xfree.
5059 NAME can have any form that the "break" or "print" commands might
5060 recognize. In other words, it does not have to be the "natural"
5061 name, or the "encoded" name. */
5064 ada_name_for_lookup (const char *name
)
5067 int nlen
= strlen (name
);
5069 if (name
[0] == '<' && name
[nlen
- 1] == '>')
5071 canon
= xmalloc (nlen
- 1);
5072 memcpy (canon
, name
+ 1, nlen
- 2);
5073 canon
[nlen
- 2] = '\0';
5076 canon
= xstrdup (ada_encode (ada_fold_name (name
)));
5080 /* Implementation of the la_iterate_over_symbols method. */
5083 ada_iterate_over_symbols (const struct block
*block
,
5084 const char *name
, domain_enum domain
,
5085 int (*callback
) (struct symbol
*, void *),
5089 struct ada_symbol_info
*results
;
5091 ndefs
= ada_lookup_symbol_list (name
, block
, domain
, &results
);
5092 for (i
= 0; i
< ndefs
; ++i
)
5094 if (! (*callback
) (results
[i
].sym
, data
))
5100 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
5101 domain_enum
namespace, struct block
**block_found
)
5103 struct ada_symbol_info
*candidates
;
5106 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
5108 if (n_candidates
== 0)
5111 if (block_found
!= NULL
)
5112 *block_found
= candidates
[0].block
;
5114 return fixup_symbol_section (candidates
[0].sym
, NULL
);
5117 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
5118 scope and in global scopes, or NULL if none. NAME is folded and
5119 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
5120 choosing the first symbol if there are multiple choices.
5121 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
5122 table in which the symbol was found (in both cases, these
5123 assignments occur only if the pointers are non-null). */
5125 ada_lookup_symbol (const char *name
, const struct block
*block0
,
5126 domain_enum
namespace, int *is_a_field_of_this
)
5128 if (is_a_field_of_this
!= NULL
)
5129 *is_a_field_of_this
= 0;
5132 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
5133 block0
, namespace, NULL
);
5136 static struct symbol
*
5137 ada_lookup_symbol_nonlocal (const char *name
,
5138 const struct block
*block
,
5139 const domain_enum domain
)
5141 return ada_lookup_symbol (name
, block_static_block (block
), domain
, NULL
);
5145 /* True iff STR is a possible encoded suffix of a normal Ada name
5146 that is to be ignored for matching purposes. Suffixes of parallel
5147 names (e.g., XVE) are not included here. Currently, the possible suffixes
5148 are given by any of the regular expressions:
5150 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
5151 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
5152 _E[0-9]+[bs]$ [protected object entry suffixes]
5153 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
5155 Also, any leading "__[0-9]+" sequence is skipped before the suffix
5156 match is performed. This sequence is used to differentiate homonyms,
5157 is an optional part of a valid name suffix. */
5160 is_name_suffix (const char *str
)
5163 const char *matching
;
5164 const int len
= strlen (str
);
5166 /* Skip optional leading __[0-9]+. */
5168 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
5171 while (isdigit (str
[0]))
5177 if (str
[0] == '.' || str
[0] == '$')
5180 while (isdigit (matching
[0]))
5182 if (matching
[0] == '\0')
5188 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
5191 while (isdigit (matching
[0]))
5193 if (matching
[0] == '\0')
5198 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
5199 with a N at the end. Unfortunately, the compiler uses the same
5200 convention for other internal types it creates. So treating
5201 all entity names that end with an "N" as a name suffix causes
5202 some regressions. For instance, consider the case of an enumerated
5203 type. To support the 'Image attribute, it creates an array whose
5205 Having a single character like this as a suffix carrying some
5206 information is a bit risky. Perhaps we should change the encoding
5207 to be something like "_N" instead. In the meantime, do not do
5208 the following check. */
5209 /* Protected Object Subprograms */
5210 if (len
== 1 && str
[0] == 'N')
5215 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5218 while (isdigit (matching
[0]))
5220 if ((matching
[0] == 'b' || matching
[0] == 's')
5221 && matching
[1] == '\0')
5225 /* ??? We should not modify STR directly, as we are doing below. This
5226 is fine in this case, but may become problematic later if we find
5227 that this alternative did not work, and want to try matching
5228 another one from the begining of STR. Since we modified it, we
5229 won't be able to find the begining of the string anymore! */
5233 while (str
[0] != '_' && str
[0] != '\0')
5235 if (str
[0] != 'n' && str
[0] != 'b')
5241 if (str
[0] == '\000')
5246 if (str
[1] != '_' || str
[2] == '\000')
5250 if (strcmp (str
+ 3, "JM") == 0)
5252 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5253 the LJM suffix in favor of the JM one. But we will
5254 still accept LJM as a valid suffix for a reasonable
5255 amount of time, just to allow ourselves to debug programs
5256 compiled using an older version of GNAT. */
5257 if (strcmp (str
+ 3, "LJM") == 0)
5261 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5262 || str
[4] == 'U' || str
[4] == 'P')
5264 if (str
[4] == 'R' && str
[5] != 'T')
5268 if (!isdigit (str
[2]))
5270 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5271 if (!isdigit (str
[k
]) && str
[k
] != '_')
5275 if (str
[0] == '$' && isdigit (str
[1]))
5277 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5278 if (!isdigit (str
[k
]) && str
[k
] != '_')
5285 /* Return non-zero if the string starting at NAME and ending before
5286 NAME_END contains no capital letters. */
5289 is_valid_name_for_wild_match (const char *name0
)
5291 const char *decoded_name
= ada_decode (name0
);
5294 /* If the decoded name starts with an angle bracket, it means that
5295 NAME0 does not follow the GNAT encoding format. It should then
5296 not be allowed as a possible wild match. */
5297 if (decoded_name
[0] == '<')
5300 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5301 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5307 /* Advance *NAMEP to next occurrence of TARGET0 in the string NAME0
5308 that could start a simple name. Assumes that *NAMEP points into
5309 the string beginning at NAME0. */
5312 advance_wild_match (const char **namep
, const char *name0
, int target0
)
5314 const char *name
= *namep
;
5324 if ((t1
>= 'a' && t1
<= 'z') || (t1
>= '0' && t1
<= '9'))
5327 if (name
== name0
+ 5 && strncmp (name0
, "_ada", 4) == 0)
5332 else if (t1
== '_' && ((name
[2] >= 'a' && name
[2] <= 'z')
5333 || name
[2] == target0
))
5341 else if ((t0
>= 'a' && t0
<= 'z') || (t0
>= '0' && t0
<= '9'))
5351 /* Return 0 iff NAME encodes a name of the form prefix.PATN. Ignores any
5352 informational suffixes of NAME (i.e., for which is_name_suffix is
5353 true). Assumes that PATN is a lower-cased Ada simple name. */
5356 wild_match (const char *name
, const char *patn
)
5359 const char *name0
= name
;
5363 const char *match
= name
;
5367 for (name
+= 1, p
= patn
+ 1; *p
!= '\0'; name
+= 1, p
+= 1)
5370 if (*p
== '\0' && is_name_suffix (name
))
5371 return match
!= name0
&& !is_valid_name_for_wild_match (name0
);
5373 if (name
[-1] == '_')
5376 if (!advance_wild_match (&name
, name0
, *patn
))
5381 /* Returns 0 iff symbol name SYM_NAME matches SEARCH_NAME, apart from
5382 informational suffix. */
5385 full_match (const char *sym_name
, const char *search_name
)
5387 return !match_name (sym_name
, search_name
, 0);
5391 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5392 vector *defn_symbols, updating the list of symbols in OBSTACKP
5393 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5394 OBJFILE is the section containing BLOCK.
5395 SYMTAB is recorded with each symbol added. */
5398 ada_add_block_symbols (struct obstack
*obstackp
,
5399 struct block
*block
, const char *name
,
5400 domain_enum domain
, struct objfile
*objfile
,
5403 struct dict_iterator iter
;
5404 int name_len
= strlen (name
);
5405 /* A matching argument symbol, if any. */
5406 struct symbol
*arg_sym
;
5407 /* Set true when we find a matching non-argument symbol. */
5415 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5417 sym
!= NULL
; sym
= dict_iter_match_next (name
, wild_match
, &iter
))
5419 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5420 SYMBOL_DOMAIN (sym
), domain
)
5421 && wild_match (SYMBOL_LINKAGE_NAME (sym
), name
) == 0)
5423 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5425 else if (SYMBOL_IS_ARGUMENT (sym
))
5430 add_defn_to_vec (obstackp
,
5431 fixup_symbol_section (sym
, objfile
),
5439 for (sym
= dict_iter_match_first (BLOCK_DICT (block
), name
,
5441 sym
!= NULL
; sym
= dict_iter_match_next (name
, full_match
, &iter
))
5443 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5444 SYMBOL_DOMAIN (sym
), domain
))
5446 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5448 if (SYMBOL_IS_ARGUMENT (sym
))
5453 add_defn_to_vec (obstackp
,
5454 fixup_symbol_section (sym
, objfile
),
5462 if (!found_sym
&& arg_sym
!= NULL
)
5464 add_defn_to_vec (obstackp
,
5465 fixup_symbol_section (arg_sym
, objfile
),
5474 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5476 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5477 SYMBOL_DOMAIN (sym
), domain
))
5481 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5484 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5486 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5491 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5493 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5495 if (SYMBOL_IS_ARGUMENT (sym
))
5500 add_defn_to_vec (obstackp
,
5501 fixup_symbol_section (sym
, objfile
),
5509 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5510 They aren't parameters, right? */
5511 if (!found_sym
&& arg_sym
!= NULL
)
5513 add_defn_to_vec (obstackp
,
5514 fixup_symbol_section (arg_sym
, objfile
),
5521 /* Symbol Completion */
5523 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5524 name in a form that's appropriate for the completion. The result
5525 does not need to be deallocated, but is only good until the next call.
5527 TEXT_LEN is equal to the length of TEXT.
5528 Perform a wild match if WILD_MATCH is set.
5529 ENCODED should be set if TEXT represents the start of a symbol name
5530 in its encoded form. */
5533 symbol_completion_match (const char *sym_name
,
5534 const char *text
, int text_len
,
5535 int wild_match
, int encoded
)
5537 const int verbatim_match
= (text
[0] == '<');
5542 /* Strip the leading angle bracket. */
5547 /* First, test against the fully qualified name of the symbol. */
5549 if (strncmp (sym_name
, text
, text_len
) == 0)
5552 if (match
&& !encoded
)
5554 /* One needed check before declaring a positive match is to verify
5555 that iff we are doing a verbatim match, the decoded version
5556 of the symbol name starts with '<'. Otherwise, this symbol name
5557 is not a suitable completion. */
5558 const char *sym_name_copy
= sym_name
;
5559 int has_angle_bracket
;
5561 sym_name
= ada_decode (sym_name
);
5562 has_angle_bracket
= (sym_name
[0] == '<');
5563 match
= (has_angle_bracket
== verbatim_match
);
5564 sym_name
= sym_name_copy
;
5567 if (match
&& !verbatim_match
)
5569 /* When doing non-verbatim match, another check that needs to
5570 be done is to verify that the potentially matching symbol name
5571 does not include capital letters, because the ada-mode would
5572 not be able to understand these symbol names without the
5573 angle bracket notation. */
5576 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5581 /* Second: Try wild matching... */
5583 if (!match
&& wild_match
)
5585 /* Since we are doing wild matching, this means that TEXT
5586 may represent an unqualified symbol name. We therefore must
5587 also compare TEXT against the unqualified name of the symbol. */
5588 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5590 if (strncmp (sym_name
, text
, text_len
) == 0)
5594 /* Finally: If we found a mach, prepare the result to return. */
5600 sym_name
= add_angle_brackets (sym_name
);
5603 sym_name
= ada_decode (sym_name
);
5608 DEF_VEC_P (char_ptr
);
5610 /* A companion function to ada_make_symbol_completion_list().
5611 Check if SYM_NAME represents a symbol which name would be suitable
5612 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5613 it is appended at the end of the given string vector SV.
5615 ORIG_TEXT is the string original string from the user command
5616 that needs to be completed. WORD is the entire command on which
5617 completion should be performed. These two parameters are used to
5618 determine which part of the symbol name should be added to the
5620 if WILD_MATCH is set, then wild matching is performed.
5621 ENCODED should be set if TEXT represents a symbol name in its
5622 encoded formed (in which case the completion should also be
5626 symbol_completion_add (VEC(char_ptr
) **sv
,
5627 const char *sym_name
,
5628 const char *text
, int text_len
,
5629 const char *orig_text
, const char *word
,
5630 int wild_match
, int encoded
)
5632 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5633 wild_match
, encoded
);
5639 /* We found a match, so add the appropriate completion to the given
5642 if (word
== orig_text
)
5644 completion
= xmalloc (strlen (match
) + 5);
5645 strcpy (completion
, match
);
5647 else if (word
> orig_text
)
5649 /* Return some portion of sym_name. */
5650 completion
= xmalloc (strlen (match
) + 5);
5651 strcpy (completion
, match
+ (word
- orig_text
));
5655 /* Return some of ORIG_TEXT plus sym_name. */
5656 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5657 strncpy (completion
, word
, orig_text
- word
);
5658 completion
[orig_text
- word
] = '\0';
5659 strcat (completion
, match
);
5662 VEC_safe_push (char_ptr
, *sv
, completion
);
5665 /* An object of this type is passed as the user_data argument to the
5666 expand_partial_symbol_names method. */
5667 struct add_partial_datum
5669 VEC(char_ptr
) **completions
;
5678 /* A callback for expand_partial_symbol_names. */
5680 ada_expand_partial_symbol_name (const struct language_defn
*language
,
5681 const char *name
, void *user_data
)
5683 struct add_partial_datum
*data
= user_data
;
5685 return symbol_completion_match (name
, data
->text
, data
->text_len
,
5686 data
->wild_match
, data
->encoded
) != NULL
;
5689 /* Return a list of possible symbol names completing TEXT0. The list
5690 is NULL terminated. WORD is the entire command on which completion
5694 ada_make_symbol_completion_list (char *text0
, char *word
)
5700 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5703 struct minimal_symbol
*msymbol
;
5704 struct objfile
*objfile
;
5705 struct block
*b
, *surrounding_static_block
= 0;
5707 struct dict_iterator iter
;
5709 if (text0
[0] == '<')
5711 text
= xstrdup (text0
);
5712 make_cleanup (xfree
, text
);
5713 text_len
= strlen (text
);
5719 text
= xstrdup (ada_encode (text0
));
5720 make_cleanup (xfree
, text
);
5721 text_len
= strlen (text
);
5722 for (i
= 0; i
< text_len
; i
++)
5723 text
[i
] = tolower (text
[i
]);
5725 encoded
= (strstr (text0
, "__") != NULL
);
5726 /* If the name contains a ".", then the user is entering a fully
5727 qualified entity name, and the match must not be done in wild
5728 mode. Similarly, if the user wants to complete what looks like
5729 an encoded name, the match must not be done in wild mode. */
5730 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5733 /* First, look at the partial symtab symbols. */
5735 struct add_partial_datum data
;
5737 data
.completions
= &completions
;
5739 data
.text_len
= text_len
;
5742 data
.wild_match
= wild_match
;
5743 data
.encoded
= encoded
;
5744 expand_partial_symbol_names (ada_expand_partial_symbol_name
, &data
);
5747 /* At this point scan through the misc symbol vectors and add each
5748 symbol you find to the list. Eventually we want to ignore
5749 anything that isn't a text symbol (everything else will be
5750 handled by the psymtab code above). */
5752 ALL_MSYMBOLS (objfile
, msymbol
)
5755 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5756 text
, text_len
, text0
, word
, wild_match
, encoded
);
5759 /* Search upwards from currently selected frame (so that we can
5760 complete on local vars. */
5762 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5764 if (!BLOCK_SUPERBLOCK (b
))
5765 surrounding_static_block
= b
; /* For elmin of dups */
5767 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5769 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5770 text
, text_len
, text0
, word
,
5771 wild_match
, encoded
);
5775 /* Go through the symtabs and check the externs and statics for
5776 symbols which match. */
5778 ALL_SYMTABS (objfile
, s
)
5781 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5782 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5784 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5785 text
, text_len
, text0
, word
,
5786 wild_match
, encoded
);
5790 ALL_SYMTABS (objfile
, s
)
5793 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5794 /* Don't do this block twice. */
5795 if (b
== surrounding_static_block
)
5797 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5799 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5800 text
, text_len
, text0
, word
,
5801 wild_match
, encoded
);
5805 /* Append the closing NULL entry. */
5806 VEC_safe_push (char_ptr
, completions
, NULL
);
5808 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5809 return the copy. It's unfortunate that we have to make a copy
5810 of an array that we're about to destroy, but there is nothing much
5811 we can do about it. Fortunately, it's typically not a very large
5814 const size_t completions_size
=
5815 VEC_length (char_ptr
, completions
) * sizeof (char *);
5816 char **result
= xmalloc (completions_size
);
5818 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5820 VEC_free (char_ptr
, completions
);
5827 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5828 for tagged types. */
5831 ada_is_dispatch_table_ptr_type (struct type
*type
)
5835 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5838 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5842 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5845 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5846 to be invisible to users. */
5849 ada_is_ignored_field (struct type
*type
, int field_num
)
5851 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5854 /* Check the name of that field. */
5856 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5858 /* Anonymous field names should not be printed.
5859 brobecker/2007-02-20: I don't think this can actually happen
5860 but we don't want to print the value of annonymous fields anyway. */
5864 /* A field named "_parent" is internally generated by GNAT for
5865 tagged types, and should not be printed either. */
5866 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5870 /* If this is the dispatch table of a tagged type, then ignore. */
5871 if (ada_is_tagged_type (type
, 1)
5872 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5875 /* Not a special field, so it should not be ignored. */
5879 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5880 pointer or reference type whose ultimate target has a tag field. */
5883 ada_is_tagged_type (struct type
*type
, int refok
)
5885 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5888 /* True iff TYPE represents the type of X'Tag */
5891 ada_is_tag_type (struct type
*type
)
5893 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5897 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5899 return (name
!= NULL
5900 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5904 /* The type of the tag on VAL. */
5907 ada_tag_type (struct value
*val
)
5909 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5912 /* The value of the tag on VAL. */
5915 ada_value_tag (struct value
*val
)
5917 return ada_value_struct_elt (val
, "_tag", 0);
5920 /* The value of the tag on the object of type TYPE whose contents are
5921 saved at VALADDR, if it is non-null, or is at memory address
5924 static struct value
*
5925 value_tag_from_contents_and_address (struct type
*type
,
5926 const gdb_byte
*valaddr
,
5929 int tag_byte_offset
;
5930 struct type
*tag_type
;
5932 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5935 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5937 : valaddr
+ tag_byte_offset
);
5938 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5940 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5945 static struct type
*
5946 type_from_tag (struct value
*tag
)
5948 const char *type_name
= ada_tag_name (tag
);
5950 if (type_name
!= NULL
)
5951 return ada_find_any_type (ada_encode (type_name
));
5962 static int ada_tag_name_1 (void *);
5963 static int ada_tag_name_2 (struct tag_args
*);
5965 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5966 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5967 The value stored in ARGS->name is valid until the next call to
5971 ada_tag_name_1 (void *args0
)
5973 struct tag_args
*args
= (struct tag_args
*) args0
;
5974 static char name
[1024];
5979 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5981 return ada_tag_name_2 (args
);
5982 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5985 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5986 for (p
= name
; *p
!= '\0'; p
+= 1)
5993 /* Return the "ada__tags__type_specific_data" type. */
5995 static struct type
*
5996 ada_get_tsd_type (struct inferior
*inf
)
5998 struct ada_inferior_data
*data
= get_ada_inferior_data (inf
);
6000 if (data
->tsd_type
== 0)
6001 data
->tsd_type
= ada_find_any_type ("ada__tags__type_specific_data");
6002 return data
->tsd_type
;
6005 /* Utility function for ada_tag_name_1 that tries the second
6006 representation for the dispatch table (in which there is no
6007 explicit 'tsd' field in the referent of the tag pointer, and instead
6008 the tsd pointer is stored just before the dispatch table. */
6011 ada_tag_name_2 (struct tag_args
*args
)
6013 struct type
*info_type
;
6014 static char name
[1024];
6016 struct value
*val
, *valp
;
6019 info_type
= ada_get_tsd_type (current_inferior());
6020 if (info_type
== NULL
)
6022 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
6023 valp
= value_cast (info_type
, args
->tag
);
6026 val
= value_ind (value_ptradd (valp
, -1));
6029 val
= ada_value_struct_elt (val
, "expanded_name", 1);
6032 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
6033 for (p
= name
; *p
!= '\0'; p
+= 1)
6040 /* The type name of the dynamic type denoted by the 'tag value TAG, as
6044 ada_tag_name (struct value
*tag
)
6046 struct tag_args args
;
6048 if (!ada_is_tag_type (value_type (tag
)))
6052 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
6056 /* The parent type of TYPE, or NULL if none. */
6059 ada_parent_type (struct type
*type
)
6063 type
= ada_check_typedef (type
);
6065 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6068 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6069 if (ada_is_parent_field (type
, i
))
6071 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
6073 /* If the _parent field is a pointer, then dereference it. */
6074 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
6075 parent_type
= TYPE_TARGET_TYPE (parent_type
);
6076 /* If there is a parallel XVS type, get the actual base type. */
6077 parent_type
= ada_get_base_type (parent_type
);
6079 return ada_check_typedef (parent_type
);
6085 /* True iff field number FIELD_NUM of structure type TYPE contains the
6086 parent-type (inherited) fields of a derived type. Assumes TYPE is
6087 a structure type with at least FIELD_NUM+1 fields. */
6090 ada_is_parent_field (struct type
*type
, int field_num
)
6092 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
6094 return (name
!= NULL
6095 && (strncmp (name
, "PARENT", 6) == 0
6096 || strncmp (name
, "_parent", 7) == 0));
6099 /* True iff field number FIELD_NUM of structure type TYPE is a
6100 transparent wrapper field (which should be silently traversed when doing
6101 field selection and flattened when printing). Assumes TYPE is a
6102 structure type with at least FIELD_NUM+1 fields. Such fields are always
6106 ada_is_wrapper_field (struct type
*type
, int field_num
)
6108 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6110 return (name
!= NULL
6111 && (strncmp (name
, "PARENT", 6) == 0
6112 || strcmp (name
, "REP") == 0
6113 || strncmp (name
, "_parent", 7) == 0
6114 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
6117 /* True iff field number FIELD_NUM of structure or union type TYPE
6118 is a variant wrapper. Assumes TYPE is a structure type with at least
6119 FIELD_NUM+1 fields. */
6122 ada_is_variant_part (struct type
*type
, int field_num
)
6124 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
6126 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
6127 || (is_dynamic_field (type
, field_num
)
6128 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
6129 == TYPE_CODE_UNION
)));
6132 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
6133 whose discriminants are contained in the record type OUTER_TYPE,
6134 returns the type of the controlling discriminant for the variant.
6135 May return NULL if the type could not be found. */
6138 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
6140 char *name
= ada_variant_discrim_name (var_type
);
6142 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
6145 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
6146 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
6147 represents a 'when others' clause; otherwise 0. */
6150 ada_is_others_clause (struct type
*type
, int field_num
)
6152 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6154 return (name
!= NULL
&& name
[0] == 'O');
6157 /* Assuming that TYPE0 is the type of the variant part of a record,
6158 returns the name of the discriminant controlling the variant.
6159 The value is valid until the next call to ada_variant_discrim_name. */
6162 ada_variant_discrim_name (struct type
*type0
)
6164 static char *result
= NULL
;
6165 static size_t result_len
= 0;
6168 const char *discrim_end
;
6169 const char *discrim_start
;
6171 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
6172 type
= TYPE_TARGET_TYPE (type0
);
6176 name
= ada_type_name (type
);
6178 if (name
== NULL
|| name
[0] == '\000')
6181 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
6184 if (strncmp (discrim_end
, "___XVN", 6) == 0)
6187 if (discrim_end
== name
)
6190 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
6193 if (discrim_start
== name
+ 1)
6195 if ((discrim_start
> name
+ 3
6196 && strncmp (discrim_start
- 3, "___", 3) == 0)
6197 || discrim_start
[-1] == '.')
6201 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
6202 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
6203 result
[discrim_end
- discrim_start
] = '\0';
6207 /* Scan STR for a subtype-encoded number, beginning at position K.
6208 Put the position of the character just past the number scanned in
6209 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6210 Return 1 if there was a valid number at the given position, and 0
6211 otherwise. A "subtype-encoded" number consists of the absolute value
6212 in decimal, followed by the letter 'm' to indicate a negative number.
6213 Assumes 0m does not occur. */
6216 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6220 if (!isdigit (str
[k
]))
6223 /* Do it the hard way so as not to make any assumption about
6224 the relationship of unsigned long (%lu scan format code) and
6227 while (isdigit (str
[k
]))
6229 RU
= RU
* 10 + (str
[k
] - '0');
6236 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6242 /* NOTE on the above: Technically, C does not say what the results of
6243 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6244 number representable as a LONGEST (although either would probably work
6245 in most implementations). When RU>0, the locution in the then branch
6246 above is always equivalent to the negative of RU. */
6253 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6254 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6255 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6258 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6260 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6274 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6284 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6285 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6287 if (val
>= L
&& val
<= U
)
6299 /* FIXME: Lots of redundancy below. Try to consolidate. */
6301 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6302 ARG_TYPE, extract and return the value of one of its (non-static)
6303 fields. FIELDNO says which field. Differs from value_primitive_field
6304 only in that it can handle packed values of arbitrary type. */
6306 static struct value
*
6307 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6308 struct type
*arg_type
)
6312 arg_type
= ada_check_typedef (arg_type
);
6313 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6315 /* Handle packed fields. */
6317 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6319 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6320 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6322 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6323 offset
+ bit_pos
/ 8,
6324 bit_pos
% 8, bit_size
, type
);
6327 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6330 /* Find field with name NAME in object of type TYPE. If found,
6331 set the following for each argument that is non-null:
6332 - *FIELD_TYPE_P to the field's type;
6333 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6334 an object of that type;
6335 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6336 - *BIT_SIZE_P to its size in bits if the field is packed, and
6338 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6339 fields up to but not including the desired field, or by the total
6340 number of fields if not found. A NULL value of NAME never
6341 matches; the function just counts visible fields in this case.
6343 Returns 1 if found, 0 otherwise. */
6346 find_struct_field (char *name
, struct type
*type
, int offset
,
6347 struct type
**field_type_p
,
6348 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6353 type
= ada_check_typedef (type
);
6355 if (field_type_p
!= NULL
)
6356 *field_type_p
= NULL
;
6357 if (byte_offset_p
!= NULL
)
6359 if (bit_offset_p
!= NULL
)
6361 if (bit_size_p
!= NULL
)
6364 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6366 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6367 int fld_offset
= offset
+ bit_pos
/ 8;
6368 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6370 if (t_field_name
== NULL
)
6373 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6375 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6377 if (field_type_p
!= NULL
)
6378 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6379 if (byte_offset_p
!= NULL
)
6380 *byte_offset_p
= fld_offset
;
6381 if (bit_offset_p
!= NULL
)
6382 *bit_offset_p
= bit_pos
% 8;
6383 if (bit_size_p
!= NULL
)
6384 *bit_size_p
= bit_size
;
6387 else if (ada_is_wrapper_field (type
, i
))
6389 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6390 field_type_p
, byte_offset_p
, bit_offset_p
,
6391 bit_size_p
, index_p
))
6394 else if (ada_is_variant_part (type
, i
))
6396 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6399 struct type
*field_type
6400 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6402 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6404 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6406 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6407 field_type_p
, byte_offset_p
,
6408 bit_offset_p
, bit_size_p
, index_p
))
6412 else if (index_p
!= NULL
)
6418 /* Number of user-visible fields in record type TYPE. */
6421 num_visible_fields (struct type
*type
)
6426 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6430 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6431 and search in it assuming it has (class) type TYPE.
6432 If found, return value, else return NULL.
6434 Searches recursively through wrapper fields (e.g., '_parent'). */
6436 static struct value
*
6437 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6442 type
= ada_check_typedef (type
);
6443 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6445 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6447 if (t_field_name
== NULL
)
6450 else if (field_name_match (t_field_name
, name
))
6451 return ada_value_primitive_field (arg
, offset
, i
, type
);
6453 else if (ada_is_wrapper_field (type
, i
))
6455 struct value
*v
= /* Do not let indent join lines here. */
6456 ada_search_struct_field (name
, arg
,
6457 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6458 TYPE_FIELD_TYPE (type
, i
));
6464 else if (ada_is_variant_part (type
, i
))
6466 /* PNH: Do we ever get here? See find_struct_field. */
6468 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6470 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6472 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6474 struct value
*v
= ada_search_struct_field
/* Force line
6477 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6478 TYPE_FIELD_TYPE (field_type
, j
));
6488 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6489 int, struct type
*);
6492 /* Return field #INDEX in ARG, where the index is that returned by
6493 * find_struct_field through its INDEX_P argument. Adjust the address
6494 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6495 * If found, return value, else return NULL. */
6497 static struct value
*
6498 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6501 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6505 /* Auxiliary function for ada_index_struct_field. Like
6506 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6509 static struct value
*
6510 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6514 type
= ada_check_typedef (type
);
6516 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6518 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6520 else if (ada_is_wrapper_field (type
, i
))
6522 struct value
*v
= /* Do not let indent join lines here. */
6523 ada_index_struct_field_1 (index_p
, arg
,
6524 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6525 TYPE_FIELD_TYPE (type
, i
));
6531 else if (ada_is_variant_part (type
, i
))
6533 /* PNH: Do we ever get here? See ada_search_struct_field,
6534 find_struct_field. */
6535 error (_("Cannot assign this kind of variant record"));
6537 else if (*index_p
== 0)
6538 return ada_value_primitive_field (arg
, offset
, i
, type
);
6545 /* Given ARG, a value of type (pointer or reference to a)*
6546 structure/union, extract the component named NAME from the ultimate
6547 target structure/union and return it as a value with its
6550 The routine searches for NAME among all members of the structure itself
6551 and (recursively) among all members of any wrapper members
6554 If NO_ERR, then simply return NULL in case of error, rather than
6558 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6560 struct type
*t
, *t1
;
6564 t1
= t
= ada_check_typedef (value_type (arg
));
6565 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6567 t1
= TYPE_TARGET_TYPE (t
);
6570 t1
= ada_check_typedef (t1
);
6571 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6573 arg
= coerce_ref (arg
);
6578 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6580 t1
= TYPE_TARGET_TYPE (t
);
6583 t1
= ada_check_typedef (t1
);
6584 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6586 arg
= value_ind (arg
);
6593 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6597 v
= ada_search_struct_field (name
, arg
, 0, t
);
6600 int bit_offset
, bit_size
, byte_offset
;
6601 struct type
*field_type
;
6604 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6605 address
= value_as_address (arg
);
6607 address
= unpack_pointer (t
, value_contents (arg
));
6609 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6610 if (find_struct_field (name
, t1
, 0,
6611 &field_type
, &byte_offset
, &bit_offset
,
6616 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6617 arg
= ada_coerce_ref (arg
);
6619 arg
= ada_value_ind (arg
);
6620 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6621 bit_offset
, bit_size
,
6625 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6629 if (v
!= NULL
|| no_err
)
6632 error (_("There is no member named %s."), name
);
6638 error (_("Attempt to extract a component of "
6639 "a value that is not a record."));
6642 /* Given a type TYPE, look up the type of the component of type named NAME.
6643 If DISPP is non-null, add its byte displacement from the beginning of a
6644 structure (pointed to by a value) of type TYPE to *DISPP (does not
6645 work for packed fields).
6647 Matches any field whose name has NAME as a prefix, possibly
6650 TYPE can be either a struct or union. If REFOK, TYPE may also
6651 be a (pointer or reference)+ to a struct or union, and the
6652 ultimate target type will be searched.
6654 Looks recursively into variant clauses and parent types.
6656 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6657 TYPE is not a type of the right kind. */
6659 static struct type
*
6660 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6661 int noerr
, int *dispp
)
6668 if (refok
&& type
!= NULL
)
6671 type
= ada_check_typedef (type
);
6672 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6673 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6675 type
= TYPE_TARGET_TYPE (type
);
6679 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6680 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6686 target_terminal_ours ();
6687 gdb_flush (gdb_stdout
);
6689 error (_("Type (null) is not a structure or union type"));
6692 /* XXX: type_sprint */
6693 fprintf_unfiltered (gdb_stderr
, _("Type "));
6694 type_print (type
, "", gdb_stderr
, -1);
6695 error (_(" is not a structure or union type"));
6700 type
= to_static_fixed_type (type
);
6702 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6704 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6708 if (t_field_name
== NULL
)
6711 else if (field_name_match (t_field_name
, name
))
6714 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6715 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6718 else if (ada_is_wrapper_field (type
, i
))
6721 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6726 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6731 else if (ada_is_variant_part (type
, i
))
6734 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
,
6737 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6739 /* FIXME pnh 2008/01/26: We check for a field that is
6740 NOT wrapped in a struct, since the compiler sometimes
6741 generates these for unchecked variant types. Revisit
6742 if the compiler changes this practice. */
6743 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6745 if (v_field_name
!= NULL
6746 && field_name_match (v_field_name
, name
))
6747 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6749 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
,
6756 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6767 target_terminal_ours ();
6768 gdb_flush (gdb_stdout
);
6771 /* XXX: type_sprint */
6772 fprintf_unfiltered (gdb_stderr
, _("Type "));
6773 type_print (type
, "", gdb_stderr
, -1);
6774 error (_(" has no component named <null>"));
6778 /* XXX: type_sprint */
6779 fprintf_unfiltered (gdb_stderr
, _("Type "));
6780 type_print (type
, "", gdb_stderr
, -1);
6781 error (_(" has no component named %s"), name
);
6788 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6789 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6790 represents an unchecked union (that is, the variant part of a
6791 record that is named in an Unchecked_Union pragma). */
6794 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6796 char *discrim_name
= ada_variant_discrim_name (var_type
);
6798 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6803 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6804 within a value of type OUTER_TYPE that is stored in GDB at
6805 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6806 numbering from 0) is applicable. Returns -1 if none are. */
6809 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6810 const gdb_byte
*outer_valaddr
)
6814 char *discrim_name
= ada_variant_discrim_name (var_type
);
6815 struct value
*outer
;
6816 struct value
*discrim
;
6817 LONGEST discrim_val
;
6819 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6820 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6821 if (discrim
== NULL
)
6823 discrim_val
= value_as_long (discrim
);
6826 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6828 if (ada_is_others_clause (var_type
, i
))
6830 else if (ada_in_variant (discrim_val
, var_type
, i
))
6834 return others_clause
;
6839 /* Dynamic-Sized Records */
6841 /* Strategy: The type ostensibly attached to a value with dynamic size
6842 (i.e., a size that is not statically recorded in the debugging
6843 data) does not accurately reflect the size or layout of the value.
6844 Our strategy is to convert these values to values with accurate,
6845 conventional types that are constructed on the fly. */
6847 /* There is a subtle and tricky problem here. In general, we cannot
6848 determine the size of dynamic records without its data. However,
6849 the 'struct value' data structure, which GDB uses to represent
6850 quantities in the inferior process (the target), requires the size
6851 of the type at the time of its allocation in order to reserve space
6852 for GDB's internal copy of the data. That's why the
6853 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6854 rather than struct value*s.
6856 However, GDB's internal history variables ($1, $2, etc.) are
6857 struct value*s containing internal copies of the data that are not, in
6858 general, the same as the data at their corresponding addresses in
6859 the target. Fortunately, the types we give to these values are all
6860 conventional, fixed-size types (as per the strategy described
6861 above), so that we don't usually have to perform the
6862 'to_fixed_xxx_type' conversions to look at their values.
6863 Unfortunately, there is one exception: if one of the internal
6864 history variables is an array whose elements are unconstrained
6865 records, then we will need to create distinct fixed types for each
6866 element selected. */
6868 /* The upshot of all of this is that many routines take a (type, host
6869 address, target address) triple as arguments to represent a value.
6870 The host address, if non-null, is supposed to contain an internal
6871 copy of the relevant data; otherwise, the program is to consult the
6872 target at the target address. */
6874 /* Assuming that VAL0 represents a pointer value, the result of
6875 dereferencing it. Differs from value_ind in its treatment of
6876 dynamic-sized types. */
6879 ada_value_ind (struct value
*val0
)
6881 struct value
*val
= unwrap_value (value_ind (val0
));
6883 return ada_to_fixed_value (val
);
6886 /* The value resulting from dereferencing any "reference to"
6887 qualifiers on VAL0. */
6889 static struct value
*
6890 ada_coerce_ref (struct value
*val0
)
6892 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6894 struct value
*val
= val0
;
6896 val
= coerce_ref (val
);
6897 val
= unwrap_value (val
);
6898 return ada_to_fixed_value (val
);
6904 /* Return OFF rounded upward if necessary to a multiple of
6905 ALIGNMENT (a power of 2). */
6908 align_value (unsigned int off
, unsigned int alignment
)
6910 return (off
+ alignment
- 1) & ~(alignment
- 1);
6913 /* Return the bit alignment required for field #F of template type TYPE. */
6916 field_alignment (struct type
*type
, int f
)
6918 const char *name
= TYPE_FIELD_NAME (type
, f
);
6922 /* The field name should never be null, unless the debugging information
6923 is somehow malformed. In this case, we assume the field does not
6924 require any alignment. */
6928 len
= strlen (name
);
6930 if (!isdigit (name
[len
- 1]))
6933 if (isdigit (name
[len
- 2]))
6934 align_offset
= len
- 2;
6936 align_offset
= len
- 1;
6938 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6939 return TARGET_CHAR_BIT
;
6941 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6944 /* Find a symbol named NAME. Ignores ambiguity. */
6947 ada_find_any_symbol (const char *name
)
6951 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6952 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6955 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6959 /* Find a type named NAME. Ignores ambiguity. This routine will look
6960 solely for types defined by debug info, it will not search the GDB
6964 ada_find_any_type (const char *name
)
6966 struct symbol
*sym
= ada_find_any_symbol (name
);
6969 return SYMBOL_TYPE (sym
);
6974 /* Given NAME and an associated BLOCK, search all symbols for
6975 NAME suffixed with "___XR", which is the ``renaming'' symbol
6976 associated to NAME. Return this symbol if found, return
6980 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6984 sym
= find_old_style_renaming_symbol (name
, block
);
6989 /* Not right yet. FIXME pnh 7/20/2007. */
6990 sym
= ada_find_any_symbol (name
);
6991 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6997 static struct symbol
*
6998 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
7000 const struct symbol
*function_sym
= block_linkage_function (block
);
7003 if (function_sym
!= NULL
)
7005 /* If the symbol is defined inside a function, NAME is not fully
7006 qualified. This means we need to prepend the function name
7007 as well as adding the ``___XR'' suffix to build the name of
7008 the associated renaming symbol. */
7009 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
7010 /* Function names sometimes contain suffixes used
7011 for instance to qualify nested subprograms. When building
7012 the XR type name, we need to make sure that this suffix is
7013 not included. So do not include any suffix in the function
7014 name length below. */
7015 int function_name_len
= ada_name_prefix_len (function_name
);
7016 const int rename_len
= function_name_len
+ 2 /* "__" */
7017 + strlen (name
) + 6 /* "___XR\0" */ ;
7019 /* Strip the suffix if necessary. */
7020 ada_remove_trailing_digits (function_name
, &function_name_len
);
7021 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
7022 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
7024 /* Library-level functions are a special case, as GNAT adds
7025 a ``_ada_'' prefix to the function name to avoid namespace
7026 pollution. However, the renaming symbols themselves do not
7027 have this prefix, so we need to skip this prefix if present. */
7028 if (function_name_len
> 5 /* "_ada_" */
7029 && strstr (function_name
, "_ada_") == function_name
)
7032 function_name_len
-= 5;
7035 rename
= (char *) alloca (rename_len
* sizeof (char));
7036 strncpy (rename
, function_name
, function_name_len
);
7037 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
7042 const int rename_len
= strlen (name
) + 6;
7044 rename
= (char *) alloca (rename_len
* sizeof (char));
7045 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
7048 return ada_find_any_symbol (rename
);
7051 /* Because of GNAT encoding conventions, several GDB symbols may match a
7052 given type name. If the type denoted by TYPE0 is to be preferred to
7053 that of TYPE1 for purposes of type printing, return non-zero;
7054 otherwise return 0. */
7057 ada_prefer_type (struct type
*type0
, struct type
*type1
)
7061 else if (type0
== NULL
)
7063 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
7065 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
7067 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
7069 else if (ada_is_constrained_packed_array_type (type0
))
7071 else if (ada_is_array_descriptor_type (type0
)
7072 && !ada_is_array_descriptor_type (type1
))
7076 const char *type0_name
= type_name_no_tag (type0
);
7077 const char *type1_name
= type_name_no_tag (type1
);
7079 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
7080 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
7086 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
7087 null, its TYPE_TAG_NAME. Null if TYPE is null. */
7090 ada_type_name (struct type
*type
)
7094 else if (TYPE_NAME (type
) != NULL
)
7095 return TYPE_NAME (type
);
7097 return TYPE_TAG_NAME (type
);
7100 /* Search the list of "descriptive" types associated to TYPE for a type
7101 whose name is NAME. */
7103 static struct type
*
7104 find_parallel_type_by_descriptive_type (struct type
*type
, const char *name
)
7106 struct type
*result
;
7108 /* If there no descriptive-type info, then there is no parallel type
7110 if (!HAVE_GNAT_AUX_INFO (type
))
7113 result
= TYPE_DESCRIPTIVE_TYPE (type
);
7114 while (result
!= NULL
)
7116 char *result_name
= ada_type_name (result
);
7118 if (result_name
== NULL
)
7120 warning (_("unexpected null name on descriptive type"));
7124 /* If the names match, stop. */
7125 if (strcmp (result_name
, name
) == 0)
7128 /* Otherwise, look at the next item on the list, if any. */
7129 if (HAVE_GNAT_AUX_INFO (result
))
7130 result
= TYPE_DESCRIPTIVE_TYPE (result
);
7135 /* If we didn't find a match, see whether this is a packed array. With
7136 older compilers, the descriptive type information is either absent or
7137 irrelevant when it comes to packed arrays so the above lookup fails.
7138 Fall back to using a parallel lookup by name in this case. */
7139 if (result
== NULL
&& ada_is_constrained_packed_array_type (type
))
7140 return ada_find_any_type (name
);
7145 /* Find a parallel type to TYPE with the specified NAME, using the
7146 descriptive type taken from the debugging information, if available,
7147 and otherwise using the (slower) name-based method. */
7149 static struct type
*
7150 ada_find_parallel_type_with_name (struct type
*type
, const char *name
)
7152 struct type
*result
= NULL
;
7154 if (HAVE_GNAT_AUX_INFO (type
))
7155 result
= find_parallel_type_by_descriptive_type (type
, name
);
7157 result
= ada_find_any_type (name
);
7162 /* Same as above, but specify the name of the parallel type by appending
7163 SUFFIX to the name of TYPE. */
7166 ada_find_parallel_type (struct type
*type
, const char *suffix
)
7168 char *name
, *typename
= ada_type_name (type
);
7171 if (typename
== NULL
)
7174 len
= strlen (typename
);
7176 name
= (char *) alloca (len
+ strlen (suffix
) + 1);
7178 strcpy (name
, typename
);
7179 strcpy (name
+ len
, suffix
);
7181 return ada_find_parallel_type_with_name (type
, name
);
7184 /* If TYPE is a variable-size record type, return the corresponding template
7185 type describing its fields. Otherwise, return NULL. */
7187 static struct type
*
7188 dynamic_template_type (struct type
*type
)
7190 type
= ada_check_typedef (type
);
7192 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
7193 || ada_type_name (type
) == NULL
)
7197 int len
= strlen (ada_type_name (type
));
7199 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
7202 return ada_find_parallel_type (type
, "___XVE");
7206 /* Assuming that TEMPL_TYPE is a union or struct type, returns
7207 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
7210 is_dynamic_field (struct type
*templ_type
, int field_num
)
7212 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
7215 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
7216 && strstr (name
, "___XVL") != NULL
;
7219 /* The index of the variant field of TYPE, or -1 if TYPE does not
7220 represent a variant record type. */
7223 variant_field_index (struct type
*type
)
7227 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
7230 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
7232 if (ada_is_variant_part (type
, f
))
7238 /* A record type with no fields. */
7240 static struct type
*
7241 empty_record (struct type
*template)
7243 struct type
*type
= alloc_type_copy (template);
7245 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
7246 TYPE_NFIELDS (type
) = 0;
7247 TYPE_FIELDS (type
) = NULL
;
7248 INIT_CPLUS_SPECIFIC (type
);
7249 TYPE_NAME (type
) = "<empty>";
7250 TYPE_TAG_NAME (type
) = NULL
;
7251 TYPE_LENGTH (type
) = 0;
7255 /* An ordinary record type (with fixed-length fields) that describes
7256 the value of type TYPE at VALADDR or ADDRESS (see comments at
7257 the beginning of this section) VAL according to GNAT conventions.
7258 DVAL0 should describe the (portion of a) record that contains any
7259 necessary discriminants. It should be NULL if value_type (VAL) is
7260 an outer-level type (i.e., as opposed to a branch of a variant.) A
7261 variant field (unless unchecked) is replaced by a particular branch
7264 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
7265 length are not statically known are discarded. As a consequence,
7266 VALADDR, ADDRESS and DVAL0 are ignored.
7268 NOTE: Limitations: For now, we assume that dynamic fields and
7269 variants occupy whole numbers of bytes. However, they need not be
7273 ada_template_to_fixed_record_type_1 (struct type
*type
,
7274 const gdb_byte
*valaddr
,
7275 CORE_ADDR address
, struct value
*dval0
,
7276 int keep_dynamic_fields
)
7278 struct value
*mark
= value_mark ();
7281 int nfields
, bit_len
;
7287 /* Compute the number of fields in this record type that are going
7288 to be processed: unless keep_dynamic_fields, this includes only
7289 fields whose position and length are static will be processed. */
7290 if (keep_dynamic_fields
)
7291 nfields
= TYPE_NFIELDS (type
);
7295 while (nfields
< TYPE_NFIELDS (type
)
7296 && !ada_is_variant_part (type
, nfields
)
7297 && !is_dynamic_field (type
, nfields
))
7301 rtype
= alloc_type_copy (type
);
7302 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7303 INIT_CPLUS_SPECIFIC (rtype
);
7304 TYPE_NFIELDS (rtype
) = nfields
;
7305 TYPE_FIELDS (rtype
) = (struct field
*)
7306 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7307 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
7308 TYPE_NAME (rtype
) = ada_type_name (type
);
7309 TYPE_TAG_NAME (rtype
) = NULL
;
7310 TYPE_FIXED_INSTANCE (rtype
) = 1;
7316 for (f
= 0; f
< nfields
; f
+= 1)
7318 off
= align_value (off
, field_alignment (type
, f
))
7319 + TYPE_FIELD_BITPOS (type
, f
);
7320 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
7321 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7323 if (ada_is_variant_part (type
, f
))
7328 else if (is_dynamic_field (type
, f
))
7330 const gdb_byte
*field_valaddr
= valaddr
;
7331 CORE_ADDR field_address
= address
;
7332 struct type
*field_type
=
7333 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
7337 /* rtype's length is computed based on the run-time
7338 value of discriminants. If the discriminants are not
7339 initialized, the type size may be completely bogus and
7340 GDB may fail to allocate a value for it. So check the
7341 size first before creating the value. */
7343 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7348 /* If the type referenced by this field is an aligner type, we need
7349 to unwrap that aligner type, because its size might not be set.
7350 Keeping the aligner type would cause us to compute the wrong
7351 size for this field, impacting the offset of the all the fields
7352 that follow this one. */
7353 if (ada_is_aligner_type (field_type
))
7355 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
7357 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
7358 field_address
= cond_offset_target (field_address
, field_offset
);
7359 field_type
= ada_aligned_type (field_type
);
7362 field_valaddr
= cond_offset_host (field_valaddr
,
7363 off
/ TARGET_CHAR_BIT
);
7364 field_address
= cond_offset_target (field_address
,
7365 off
/ TARGET_CHAR_BIT
);
7367 /* Get the fixed type of the field. Note that, in this case,
7368 we do not want to get the real type out of the tag: if
7369 the current field is the parent part of a tagged record,
7370 we will get the tag of the object. Clearly wrong: the real
7371 type of the parent is not the real type of the child. We
7372 would end up in an infinite loop. */
7373 field_type
= ada_get_base_type (field_type
);
7374 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
7375 field_address
, dval
, 0);
7376 /* If the field size is already larger than the maximum
7377 object size, then the record itself will necessarily
7378 be larger than the maximum object size. We need to make
7379 this check now, because the size might be so ridiculously
7380 large (due to an uninitialized variable in the inferior)
7381 that it would cause an overflow when adding it to the
7383 check_size (field_type
);
7385 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7386 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7387 /* The multiplication can potentially overflow. But because
7388 the field length has been size-checked just above, and
7389 assuming that the maximum size is a reasonable value,
7390 an overflow should not happen in practice. So rather than
7391 adding overflow recovery code to this already complex code,
7392 we just assume that it's not going to happen. */
7394 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7398 struct type
*field_type
= TYPE_FIELD_TYPE (type
, f
);
7400 /* If our field is a typedef type (most likely a typedef of
7401 a fat pointer, encoding an array access), then we need to
7402 look at its target type to determine its characteristics.
7403 In particular, we would miscompute the field size if we took
7404 the size of the typedef (zero), instead of the size of
7406 if (TYPE_CODE (field_type
) == TYPE_CODE_TYPEDEF
)
7407 field_type
= ada_typedef_target_type (field_type
);
7409 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
7410 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7411 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7413 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7416 TYPE_LENGTH (ada_check_typedef (field_type
)) * TARGET_CHAR_BIT
;
7418 if (off
+ fld_bit_len
> bit_len
)
7419 bit_len
= off
+ fld_bit_len
;
7421 TYPE_LENGTH (rtype
) =
7422 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7425 /* We handle the variant part, if any, at the end because of certain
7426 odd cases in which it is re-ordered so as NOT to be the last field of
7427 the record. This can happen in the presence of representation
7429 if (variant_field
>= 0)
7431 struct type
*branch_type
;
7433 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7436 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7441 to_fixed_variant_branch_type
7442 (TYPE_FIELD_TYPE (type
, variant_field
),
7443 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7444 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7445 if (branch_type
== NULL
)
7447 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7448 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7449 TYPE_NFIELDS (rtype
) -= 1;
7453 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7454 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7456 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7458 if (off
+ fld_bit_len
> bit_len
)
7459 bit_len
= off
+ fld_bit_len
;
7460 TYPE_LENGTH (rtype
) =
7461 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7465 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7466 should contain the alignment of that record, which should be a strictly
7467 positive value. If null or negative, then something is wrong, most
7468 probably in the debug info. In that case, we don't round up the size
7469 of the resulting type. If this record is not part of another structure,
7470 the current RTYPE length might be good enough for our purposes. */
7471 if (TYPE_LENGTH (type
) <= 0)
7473 if (TYPE_NAME (rtype
))
7474 warning (_("Invalid type size for `%s' detected: %d."),
7475 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7477 warning (_("Invalid type size for <unnamed> detected: %d."),
7478 TYPE_LENGTH (type
));
7482 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7483 TYPE_LENGTH (type
));
7486 value_free_to_mark (mark
);
7487 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7488 error (_("record type with dynamic size is larger than varsize-limit"));
7492 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7495 static struct type
*
7496 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7497 CORE_ADDR address
, struct value
*dval0
)
7499 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7503 /* An ordinary record type in which ___XVL-convention fields and
7504 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7505 static approximations, containing all possible fields. Uses
7506 no runtime values. Useless for use in values, but that's OK,
7507 since the results are used only for type determinations. Works on both
7508 structs and unions. Representation note: to save space, we memorize
7509 the result of this function in the TYPE_TARGET_TYPE of the
7512 static struct type
*
7513 template_to_static_fixed_type (struct type
*type0
)
7519 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7520 return TYPE_TARGET_TYPE (type0
);
7522 nfields
= TYPE_NFIELDS (type0
);
7525 for (f
= 0; f
< nfields
; f
+= 1)
7527 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7528 struct type
*new_type
;
7530 if (is_dynamic_field (type0
, f
))
7531 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7533 new_type
= static_unwrap_type (field_type
);
7534 if (type
== type0
&& new_type
!= field_type
)
7536 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7537 TYPE_CODE (type
) = TYPE_CODE (type0
);
7538 INIT_CPLUS_SPECIFIC (type
);
7539 TYPE_NFIELDS (type
) = nfields
;
7540 TYPE_FIELDS (type
) = (struct field
*)
7541 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7542 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7543 sizeof (struct field
) * nfields
);
7544 TYPE_NAME (type
) = ada_type_name (type0
);
7545 TYPE_TAG_NAME (type
) = NULL
;
7546 TYPE_FIXED_INSTANCE (type
) = 1;
7547 TYPE_LENGTH (type
) = 0;
7549 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7550 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7555 /* Given an object of type TYPE whose contents are at VALADDR and
7556 whose address in memory is ADDRESS, returns a revision of TYPE,
7557 which should be a non-dynamic-sized record, in which the variant
7558 part, if any, is replaced with the appropriate branch. Looks
7559 for discriminant values in DVAL0, which can be NULL if the record
7560 contains the necessary discriminant values. */
7562 static struct type
*
7563 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7564 CORE_ADDR address
, struct value
*dval0
)
7566 struct value
*mark
= value_mark ();
7569 struct type
*branch_type
;
7570 int nfields
= TYPE_NFIELDS (type
);
7571 int variant_field
= variant_field_index (type
);
7573 if (variant_field
== -1)
7577 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7581 rtype
= alloc_type_copy (type
);
7582 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7583 INIT_CPLUS_SPECIFIC (rtype
);
7584 TYPE_NFIELDS (rtype
) = nfields
;
7585 TYPE_FIELDS (rtype
) =
7586 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7587 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7588 sizeof (struct field
) * nfields
);
7589 TYPE_NAME (rtype
) = ada_type_name (type
);
7590 TYPE_TAG_NAME (rtype
) = NULL
;
7591 TYPE_FIXED_INSTANCE (rtype
) = 1;
7592 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7594 branch_type
= to_fixed_variant_branch_type
7595 (TYPE_FIELD_TYPE (type
, variant_field
),
7596 cond_offset_host (valaddr
,
7597 TYPE_FIELD_BITPOS (type
, variant_field
)
7599 cond_offset_target (address
,
7600 TYPE_FIELD_BITPOS (type
, variant_field
)
7601 / TARGET_CHAR_BIT
), dval
);
7602 if (branch_type
== NULL
)
7606 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7607 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7608 TYPE_NFIELDS (rtype
) -= 1;
7612 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7613 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7614 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7615 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7617 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7619 value_free_to_mark (mark
);
7623 /* An ordinary record type (with fixed-length fields) that describes
7624 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7625 beginning of this section]. Any necessary discriminants' values
7626 should be in DVAL, a record value; it may be NULL if the object
7627 at ADDR itself contains any necessary discriminant values.
7628 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7629 values from the record are needed. Except in the case that DVAL,
7630 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7631 unchecked) is replaced by a particular branch of the variant.
7633 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7634 is questionable and may be removed. It can arise during the
7635 processing of an unconstrained-array-of-record type where all the
7636 variant branches have exactly the same size. This is because in
7637 such cases, the compiler does not bother to use the XVS convention
7638 when encoding the record. I am currently dubious of this
7639 shortcut and suspect the compiler should be altered. FIXME. */
7641 static struct type
*
7642 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7643 CORE_ADDR address
, struct value
*dval
)
7645 struct type
*templ_type
;
7647 if (TYPE_FIXED_INSTANCE (type0
))
7650 templ_type
= dynamic_template_type (type0
);
7652 if (templ_type
!= NULL
)
7653 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7654 else if (variant_field_index (type0
) >= 0)
7656 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7658 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7663 TYPE_FIXED_INSTANCE (type0
) = 1;
7669 /* An ordinary record type (with fixed-length fields) that describes
7670 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7671 union type. Any necessary discriminants' values should be in DVAL,
7672 a record value. That is, this routine selects the appropriate
7673 branch of the union at ADDR according to the discriminant value
7674 indicated in the union's type name. Returns VAR_TYPE0 itself if
7675 it represents a variant subject to a pragma Unchecked_Union. */
7677 static struct type
*
7678 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7679 CORE_ADDR address
, struct value
*dval
)
7682 struct type
*templ_type
;
7683 struct type
*var_type
;
7685 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7686 var_type
= TYPE_TARGET_TYPE (var_type0
);
7688 var_type
= var_type0
;
7690 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7692 if (templ_type
!= NULL
)
7693 var_type
= templ_type
;
7695 if (is_unchecked_variant (var_type
, value_type (dval
)))
7698 ada_which_variant_applies (var_type
,
7699 value_type (dval
), value_contents (dval
));
7702 return empty_record (var_type
);
7703 else if (is_dynamic_field (var_type
, which
))
7704 return to_fixed_record_type
7705 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7706 valaddr
, address
, dval
);
7707 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7709 to_fixed_record_type
7710 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7712 return TYPE_FIELD_TYPE (var_type
, which
);
7715 /* Assuming that TYPE0 is an array type describing the type of a value
7716 at ADDR, and that DVAL describes a record containing any
7717 discriminants used in TYPE0, returns a type for the value that
7718 contains no dynamic components (that is, no components whose sizes
7719 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7720 true, gives an error message if the resulting type's size is over
7723 static struct type
*
7724 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7727 struct type
*index_type_desc
;
7728 struct type
*result
;
7729 int constrained_packed_array_p
;
7731 type0
= ada_check_typedef (type0
);
7732 if (TYPE_FIXED_INSTANCE (type0
))
7735 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7736 if (constrained_packed_array_p
)
7737 type0
= decode_constrained_packed_array_type (type0
);
7739 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7740 ada_fixup_array_indexes_type (index_type_desc
);
7741 if (index_type_desc
== NULL
)
7743 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7745 /* NOTE: elt_type---the fixed version of elt_type0---should never
7746 depend on the contents of the array in properly constructed
7748 /* Create a fixed version of the array element type.
7749 We're not providing the address of an element here,
7750 and thus the actual object value cannot be inspected to do
7751 the conversion. This should not be a problem, since arrays of
7752 unconstrained objects are not allowed. In particular, all
7753 the elements of an array of a tagged type should all be of
7754 the same type specified in the debugging info. No need to
7755 consult the object tag. */
7756 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7758 /* Make sure we always create a new array type when dealing with
7759 packed array types, since we're going to fix-up the array
7760 type length and element bitsize a little further down. */
7761 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7764 result
= create_array_type (alloc_type_copy (type0
),
7765 elt_type
, TYPE_INDEX_TYPE (type0
));
7770 struct type
*elt_type0
;
7773 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7774 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7776 /* NOTE: result---the fixed version of elt_type0---should never
7777 depend on the contents of the array in properly constructed
7779 /* Create a fixed version of the array element type.
7780 We're not providing the address of an element here,
7781 and thus the actual object value cannot be inspected to do
7782 the conversion. This should not be a problem, since arrays of
7783 unconstrained objects are not allowed. In particular, all
7784 the elements of an array of a tagged type should all be of
7785 the same type specified in the debugging info. No need to
7786 consult the object tag. */
7788 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7791 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7793 struct type
*range_type
=
7794 to_fixed_range_type (TYPE_FIELD_TYPE (index_type_desc
, i
), dval
);
7796 result
= create_array_type (alloc_type_copy (elt_type0
),
7797 result
, range_type
);
7798 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7800 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7801 error (_("array type with dynamic size is larger than varsize-limit"));
7804 if (constrained_packed_array_p
)
7806 /* So far, the resulting type has been created as if the original
7807 type was a regular (non-packed) array type. As a result, the
7808 bitsize of the array elements needs to be set again, and the array
7809 length needs to be recomputed based on that bitsize. */
7810 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7811 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7813 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7814 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7815 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7816 TYPE_LENGTH (result
)++;
7819 TYPE_FIXED_INSTANCE (result
) = 1;
7824 /* A standard type (containing no dynamically sized components)
7825 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7826 DVAL describes a record containing any discriminants used in TYPE0,
7827 and may be NULL if there are none, or if the object of type TYPE at
7828 ADDRESS or in VALADDR contains these discriminants.
7830 If CHECK_TAG is not null, in the case of tagged types, this function
7831 attempts to locate the object's tag and use it to compute the actual
7832 type. However, when ADDRESS is null, we cannot use it to determine the
7833 location of the tag, and therefore compute the tagged type's actual type.
7834 So we return the tagged type without consulting the tag. */
7836 static struct type
*
7837 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7838 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7840 type
= ada_check_typedef (type
);
7841 switch (TYPE_CODE (type
))
7845 case TYPE_CODE_STRUCT
:
7847 struct type
*static_type
= to_static_fixed_type (type
);
7848 struct type
*fixed_record_type
=
7849 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7851 /* If STATIC_TYPE is a tagged type and we know the object's address,
7852 then we can determine its tag, and compute the object's actual
7853 type from there. Note that we have to use the fixed record
7854 type (the parent part of the record may have dynamic fields
7855 and the way the location of _tag is expressed may depend on
7858 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7860 struct type
*real_type
=
7861 type_from_tag (value_tag_from_contents_and_address
7866 if (real_type
!= NULL
)
7867 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7870 /* Check to see if there is a parallel ___XVZ variable.
7871 If there is, then it provides the actual size of our type. */
7872 else if (ada_type_name (fixed_record_type
) != NULL
)
7874 char *name
= ada_type_name (fixed_record_type
);
7875 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7879 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7880 size
= get_int_var_value (xvz_name
, &xvz_found
);
7881 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7883 fixed_record_type
= copy_type (fixed_record_type
);
7884 TYPE_LENGTH (fixed_record_type
) = size
;
7886 /* The FIXED_RECORD_TYPE may have be a stub. We have
7887 observed this when the debugging info is STABS, and
7888 apparently it is something that is hard to fix.
7890 In practice, we don't need the actual type definition
7891 at all, because the presence of the XVZ variable allows us
7892 to assume that there must be a XVS type as well, which we
7893 should be able to use later, when we need the actual type
7896 In the meantime, pretend that the "fixed" type we are
7897 returning is NOT a stub, because this can cause trouble
7898 when using this type to create new types targeting it.
7899 Indeed, the associated creation routines often check
7900 whether the target type is a stub and will try to replace
7901 it, thus using a type with the wrong size. This, in turn,
7902 might cause the new type to have the wrong size too.
7903 Consider the case of an array, for instance, where the size
7904 of the array is computed from the number of elements in
7905 our array multiplied by the size of its element. */
7906 TYPE_STUB (fixed_record_type
) = 0;
7909 return fixed_record_type
;
7911 case TYPE_CODE_ARRAY
:
7912 return to_fixed_array_type (type
, dval
, 1);
7913 case TYPE_CODE_UNION
:
7917 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7921 /* The same as ada_to_fixed_type_1, except that it preserves the type
7922 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7924 The typedef layer needs be preserved in order to differentiate between
7925 arrays and array pointers when both types are implemented using the same
7926 fat pointer. In the array pointer case, the pointer is encoded as
7927 a typedef of the pointer type. For instance, considering:
7929 type String_Access is access String;
7930 S1 : String_Access := null;
7932 To the debugger, S1 is defined as a typedef of type String. But
7933 to the user, it is a pointer. So if the user tries to print S1,
7934 we should not dereference the array, but print the array address
7937 If we didn't preserve the typedef layer, we would lose the fact that
7938 the type is to be presented as a pointer (needs de-reference before
7939 being printed). And we would also use the source-level type name. */
7942 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7943 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7946 struct type
*fixed_type
=
7947 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7949 /* If TYPE is a typedef and its target type is the same as the FIXED_TYPE,
7950 then preserve the typedef layer.
7952 Implementation note: We can only check the main-type portion of
7953 the TYPE and FIXED_TYPE, because eliminating the typedef layer
7954 from TYPE now returns a type that has the same instance flags
7955 as TYPE. For instance, if TYPE is a "typedef const", and its
7956 target type is a "struct", then the typedef elimination will return
7957 a "const" version of the target type. See check_typedef for more
7958 details about how the typedef layer elimination is done.
7960 brobecker/2010-11-19: It seems to me that the only case where it is
7961 useful to preserve the typedef layer is when dealing with fat pointers.
7962 Perhaps, we could add a check for that and preserve the typedef layer
7963 only in that situation. But this seems unecessary so far, probably
7964 because we call check_typedef/ada_check_typedef pretty much everywhere.
7966 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7967 && (TYPE_MAIN_TYPE (ada_typedef_target_type (type
))
7968 == TYPE_MAIN_TYPE (fixed_type
)))
7974 /* A standard (static-sized) type corresponding as well as possible to
7975 TYPE0, but based on no runtime data. */
7977 static struct type
*
7978 to_static_fixed_type (struct type
*type0
)
7985 if (TYPE_FIXED_INSTANCE (type0
))
7988 type0
= ada_check_typedef (type0
);
7990 switch (TYPE_CODE (type0
))
7994 case TYPE_CODE_STRUCT
:
7995 type
= dynamic_template_type (type0
);
7997 return template_to_static_fixed_type (type
);
7999 return template_to_static_fixed_type (type0
);
8000 case TYPE_CODE_UNION
:
8001 type
= ada_find_parallel_type (type0
, "___XVU");
8003 return template_to_static_fixed_type (type
);
8005 return template_to_static_fixed_type (type0
);
8009 /* A static approximation of TYPE with all type wrappers removed. */
8011 static struct type
*
8012 static_unwrap_type (struct type
*type
)
8014 if (ada_is_aligner_type (type
))
8016 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
8017 if (ada_type_name (type1
) == NULL
)
8018 TYPE_NAME (type1
) = ada_type_name (type
);
8020 return static_unwrap_type (type1
);
8024 struct type
*raw_real_type
= ada_get_base_type (type
);
8026 if (raw_real_type
== type
)
8029 return to_static_fixed_type (raw_real_type
);
8033 /* In some cases, incomplete and private types require
8034 cross-references that are not resolved as records (for example,
8036 type FooP is access Foo;
8038 type Foo is array ...;
8039 ). In these cases, since there is no mechanism for producing
8040 cross-references to such types, we instead substitute for FooP a
8041 stub enumeration type that is nowhere resolved, and whose tag is
8042 the name of the actual type. Call these types "non-record stubs". */
8044 /* A type equivalent to TYPE that is not a non-record stub, if one
8045 exists, otherwise TYPE. */
8048 ada_check_typedef (struct type
*type
)
8053 /* If our type is a typedef type of a fat pointer, then we're done.
8054 We don't want to strip the TYPE_CODE_TYPDEF layer, because this is
8055 what allows us to distinguish between fat pointers that represent
8056 array types, and fat pointers that represent array access types
8057 (in both cases, the compiler implements them as fat pointers). */
8058 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
8059 && is_thick_pntr (ada_typedef_target_type (type
)))
8062 CHECK_TYPEDEF (type
);
8063 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
8064 || !TYPE_STUB (type
)
8065 || TYPE_TAG_NAME (type
) == NULL
)
8069 char *name
= TYPE_TAG_NAME (type
);
8070 struct type
*type1
= ada_find_any_type (name
);
8075 /* TYPE1 might itself be a TYPE_CODE_TYPEDEF (this can happen with
8076 stubs pointing to arrays, as we don't create symbols for array
8077 types, only for the typedef-to-array types). If that's the case,
8078 strip the typedef layer. */
8079 if (TYPE_CODE (type1
) == TYPE_CODE_TYPEDEF
)
8080 type1
= ada_check_typedef (type1
);
8086 /* A value representing the data at VALADDR/ADDRESS as described by
8087 type TYPE0, but with a standard (static-sized) type that correctly
8088 describes it. If VAL0 is not NULL and TYPE0 already is a standard
8089 type, then return VAL0 [this feature is simply to avoid redundant
8090 creation of struct values]. */
8092 static struct value
*
8093 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
8096 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
8098 if (type
== type0
&& val0
!= NULL
)
8101 return value_from_contents_and_address (type
, 0, address
);
8104 /* A value representing VAL, but with a standard (static-sized) type
8105 that correctly describes it. Does not necessarily create a new
8109 ada_to_fixed_value (struct value
*val
)
8111 return ada_to_fixed_value_create (value_type (val
),
8112 value_address (val
),
8119 /* Table mapping attribute numbers to names.
8120 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
8122 static const char *attribute_names
[] = {
8140 ada_attribute_name (enum exp_opcode n
)
8142 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
8143 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
8145 return attribute_names
[0];
8148 /* Evaluate the 'POS attribute applied to ARG. */
8151 pos_atr (struct value
*arg
)
8153 struct value
*val
= coerce_ref (arg
);
8154 struct type
*type
= value_type (val
);
8156 if (!discrete_type_p (type
))
8157 error (_("'POS only defined on discrete types"));
8159 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8162 LONGEST v
= value_as_long (val
);
8164 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
8166 if (v
== TYPE_FIELD_BITPOS (type
, i
))
8169 error (_("enumeration value is invalid: can't find 'POS"));
8172 return value_as_long (val
);
8175 static struct value
*
8176 value_pos_atr (struct type
*type
, struct value
*arg
)
8178 return value_from_longest (type
, pos_atr (arg
));
8181 /* Evaluate the TYPE'VAL attribute applied to ARG. */
8183 static struct value
*
8184 value_val_atr (struct type
*type
, struct value
*arg
)
8186 if (!discrete_type_p (type
))
8187 error (_("'VAL only defined on discrete types"));
8188 if (!integer_type_p (value_type (arg
)))
8189 error (_("'VAL requires integral argument"));
8191 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
8193 long pos
= value_as_long (arg
);
8195 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
8196 error (_("argument to 'VAL out of range"));
8197 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
8200 return value_from_longest (type
, value_as_long (arg
));
8206 /* True if TYPE appears to be an Ada character type.
8207 [At the moment, this is true only for Character and Wide_Character;
8208 It is a heuristic test that could stand improvement]. */
8211 ada_is_character_type (struct type
*type
)
8215 /* If the type code says it's a character, then assume it really is,
8216 and don't check any further. */
8217 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
8220 /* Otherwise, assume it's a character type iff it is a discrete type
8221 with a known character type name. */
8222 name
= ada_type_name (type
);
8223 return (name
!= NULL
8224 && (TYPE_CODE (type
) == TYPE_CODE_INT
8225 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
8226 && (strcmp (name
, "character") == 0
8227 || strcmp (name
, "wide_character") == 0
8228 || strcmp (name
, "wide_wide_character") == 0
8229 || strcmp (name
, "unsigned char") == 0));
8232 /* True if TYPE appears to be an Ada string type. */
8235 ada_is_string_type (struct type
*type
)
8237 type
= ada_check_typedef (type
);
8239 && TYPE_CODE (type
) != TYPE_CODE_PTR
8240 && (ada_is_simple_array_type (type
)
8241 || ada_is_array_descriptor_type (type
))
8242 && ada_array_arity (type
) == 1)
8244 struct type
*elttype
= ada_array_element_type (type
, 1);
8246 return ada_is_character_type (elttype
);
8252 /* The compiler sometimes provides a parallel XVS type for a given
8253 PAD type. Normally, it is safe to follow the PAD type directly,
8254 but older versions of the compiler have a bug that causes the offset
8255 of its "F" field to be wrong. Following that field in that case
8256 would lead to incorrect results, but this can be worked around
8257 by ignoring the PAD type and using the associated XVS type instead.
8259 Set to True if the debugger should trust the contents of PAD types.
8260 Otherwise, ignore the PAD type if there is a parallel XVS type. */
8261 static int trust_pad_over_xvs
= 1;
8263 /* True if TYPE is a struct type introduced by the compiler to force the
8264 alignment of a value. Such types have a single field with a
8265 distinctive name. */
8268 ada_is_aligner_type (struct type
*type
)
8270 type
= ada_check_typedef (type
);
8272 if (!trust_pad_over_xvs
&& ada_find_parallel_type (type
, "___XVS") != NULL
)
8275 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
8276 && TYPE_NFIELDS (type
) == 1
8277 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
8280 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
8281 the parallel type. */
8284 ada_get_base_type (struct type
*raw_type
)
8286 struct type
*real_type_namer
;
8287 struct type
*raw_real_type
;
8289 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
8292 if (ada_is_aligner_type (raw_type
))
8293 /* The encoding specifies that we should always use the aligner type.
8294 So, even if this aligner type has an associated XVS type, we should
8297 According to the compiler gurus, an XVS type parallel to an aligner
8298 type may exist because of a stabs limitation. In stabs, aligner
8299 types are empty because the field has a variable-sized type, and
8300 thus cannot actually be used as an aligner type. As a result,
8301 we need the associated parallel XVS type to decode the type.
8302 Since the policy in the compiler is to not change the internal
8303 representation based on the debugging info format, we sometimes
8304 end up having a redundant XVS type parallel to the aligner type. */
8307 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
8308 if (real_type_namer
== NULL
8309 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
8310 || TYPE_NFIELDS (real_type_namer
) != 1)
8313 if (TYPE_CODE (TYPE_FIELD_TYPE (real_type_namer
, 0)) != TYPE_CODE_REF
)
8315 /* This is an older encoding form where the base type needs to be
8316 looked up by name. We prefer the newer enconding because it is
8318 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
8319 if (raw_real_type
== NULL
)
8322 return raw_real_type
;
8325 /* The field in our XVS type is a reference to the base type. */
8326 return TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (real_type_namer
, 0));
8329 /* The type of value designated by TYPE, with all aligners removed. */
8332 ada_aligned_type (struct type
*type
)
8334 if (ada_is_aligner_type (type
))
8335 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
8337 return ada_get_base_type (type
);
8341 /* The address of the aligned value in an object at address VALADDR
8342 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
8345 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
8347 if (ada_is_aligner_type (type
))
8348 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
8350 TYPE_FIELD_BITPOS (type
,
8351 0) / TARGET_CHAR_BIT
);
8358 /* The printed representation of an enumeration literal with encoded
8359 name NAME. The value is good to the next call of ada_enum_name. */
8361 ada_enum_name (const char *name
)
8363 static char *result
;
8364 static size_t result_len
= 0;
8367 /* First, unqualify the enumeration name:
8368 1. Search for the last '.' character. If we find one, then skip
8369 all the preceding characters, the unqualified name starts
8370 right after that dot.
8371 2. Otherwise, we may be debugging on a target where the compiler
8372 translates dots into "__". Search forward for double underscores,
8373 but stop searching when we hit an overloading suffix, which is
8374 of the form "__" followed by digits. */
8376 tmp
= strrchr (name
, '.');
8381 while ((tmp
= strstr (name
, "__")) != NULL
)
8383 if (isdigit (tmp
[2]))
8394 if (name
[1] == 'U' || name
[1] == 'W')
8396 if (sscanf (name
+ 2, "%x", &v
) != 1)
8402 GROW_VECT (result
, result_len
, 16);
8403 if (isascii (v
) && isprint (v
))
8404 xsnprintf (result
, result_len
, "'%c'", v
);
8405 else if (name
[1] == 'U')
8406 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
8408 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
8414 tmp
= strstr (name
, "__");
8416 tmp
= strstr (name
, "$");
8419 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
8420 strncpy (result
, name
, tmp
- name
);
8421 result
[tmp
- name
] = '\0';
8429 /* Evaluate the subexpression of EXP starting at *POS as for
8430 evaluate_type, updating *POS to point just past the evaluated
8433 static struct value
*
8434 evaluate_subexp_type (struct expression
*exp
, int *pos
)
8436 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8439 /* If VAL is wrapped in an aligner or subtype wrapper, return the
8442 static struct value
*
8443 unwrap_value (struct value
*val
)
8445 struct type
*type
= ada_check_typedef (value_type (val
));
8447 if (ada_is_aligner_type (type
))
8449 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
8450 struct type
*val_type
= ada_check_typedef (value_type (v
));
8452 if (ada_type_name (val_type
) == NULL
)
8453 TYPE_NAME (val_type
) = ada_type_name (type
);
8455 return unwrap_value (v
);
8459 struct type
*raw_real_type
=
8460 ada_check_typedef (ada_get_base_type (type
));
8462 /* If there is no parallel XVS or XVE type, then the value is
8463 already unwrapped. Return it without further modification. */
8464 if ((type
== raw_real_type
)
8465 && ada_find_parallel_type (type
, "___XVE") == NULL
)
8469 coerce_unspec_val_to_type
8470 (val
, ada_to_fixed_type (raw_real_type
, 0,
8471 value_address (val
),
8476 static struct value
*
8477 cast_to_fixed (struct type
*type
, struct value
*arg
)
8481 if (type
== value_type (arg
))
8483 else if (ada_is_fixed_point_type (value_type (arg
)))
8484 val
= ada_float_to_fixed (type
,
8485 ada_fixed_to_float (value_type (arg
),
8486 value_as_long (arg
)));
8489 DOUBLEST argd
= value_as_double (arg
);
8491 val
= ada_float_to_fixed (type
, argd
);
8494 return value_from_longest (type
, val
);
8497 static struct value
*
8498 cast_from_fixed (struct type
*type
, struct value
*arg
)
8500 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
8501 value_as_long (arg
));
8503 return value_from_double (type
, val
);
8506 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
8507 return the converted value. */
8509 static struct value
*
8510 coerce_for_assign (struct type
*type
, struct value
*val
)
8512 struct type
*type2
= value_type (val
);
8517 type2
= ada_check_typedef (type2
);
8518 type
= ada_check_typedef (type
);
8520 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8521 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8523 val
= ada_value_ind (val
);
8524 type2
= value_type (val
);
8527 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8528 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8530 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8531 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8532 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8533 error (_("Incompatible types in assignment"));
8534 deprecated_set_value_type (val
, type
);
8539 static struct value
*
8540 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8543 struct type
*type1
, *type2
;
8546 arg1
= coerce_ref (arg1
);
8547 arg2
= coerce_ref (arg2
);
8548 type1
= get_base_type (ada_check_typedef (value_type (arg1
)));
8549 type2
= get_base_type (ada_check_typedef (value_type (arg2
)));
8551 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8552 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8553 return value_binop (arg1
, arg2
, op
);
8562 return value_binop (arg1
, arg2
, op
);
8565 v2
= value_as_long (arg2
);
8567 error (_("second operand of %s must not be zero."), op_string (op
));
8569 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8570 return value_binop (arg1
, arg2
, op
);
8572 v1
= value_as_long (arg1
);
8577 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8578 v
+= v
> 0 ? -1 : 1;
8586 /* Should not reach this point. */
8590 val
= allocate_value (type1
);
8591 store_unsigned_integer (value_contents_raw (val
),
8592 TYPE_LENGTH (value_type (val
)),
8593 gdbarch_byte_order (get_type_arch (type1
)), v
);
8598 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8600 if (ada_is_direct_array_type (value_type (arg1
))
8601 || ada_is_direct_array_type (value_type (arg2
)))
8603 /* Automatically dereference any array reference before
8604 we attempt to perform the comparison. */
8605 arg1
= ada_coerce_ref (arg1
);
8606 arg2
= ada_coerce_ref (arg2
);
8608 arg1
= ada_coerce_to_simple_array (arg1
);
8609 arg2
= ada_coerce_to_simple_array (arg2
);
8610 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8611 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8612 error (_("Attempt to compare array with non-array"));
8613 /* FIXME: The following works only for types whose
8614 representations use all bits (no padding or undefined bits)
8615 and do not have user-defined equality. */
8617 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8618 && memcmp (value_contents (arg1
), value_contents (arg2
),
8619 TYPE_LENGTH (value_type (arg1
))) == 0;
8621 return value_equal (arg1
, arg2
);
8624 /* Total number of component associations in the aggregate starting at
8625 index PC in EXP. Assumes that index PC is the start of an
8629 num_component_specs (struct expression
*exp
, int pc
)
8633 m
= exp
->elts
[pc
+ 1].longconst
;
8636 for (i
= 0; i
< m
; i
+= 1)
8638 switch (exp
->elts
[pc
].opcode
)
8644 n
+= exp
->elts
[pc
+ 1].longconst
;
8647 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8652 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8653 component of LHS (a simple array or a record), updating *POS past
8654 the expression, assuming that LHS is contained in CONTAINER. Does
8655 not modify the inferior's memory, nor does it modify LHS (unless
8656 LHS == CONTAINER). */
8659 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8660 struct expression
*exp
, int *pos
)
8662 struct value
*mark
= value_mark ();
8665 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8667 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8668 struct value
*index_val
= value_from_longest (index_type
, index
);
8670 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8674 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8675 elt
= ada_to_fixed_value (unwrap_value (elt
));
8678 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8679 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8681 value_assign_to_component (container
, elt
,
8682 ada_evaluate_subexp (NULL
, exp
, pos
,
8685 value_free_to_mark (mark
);
8688 /* Assuming that LHS represents an lvalue having a record or array
8689 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8690 of that aggregate's value to LHS, advancing *POS past the
8691 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8692 lvalue containing LHS (possibly LHS itself). Does not modify
8693 the inferior's memory, nor does it modify the contents of
8694 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8696 static struct value
*
8697 assign_aggregate (struct value
*container
,
8698 struct value
*lhs
, struct expression
*exp
,
8699 int *pos
, enum noside noside
)
8701 struct type
*lhs_type
;
8702 int n
= exp
->elts
[*pos
+1].longconst
;
8703 LONGEST low_index
, high_index
;
8706 int max_indices
, num_indices
;
8707 int is_array_aggregate
;
8711 if (noside
!= EVAL_NORMAL
)
8713 for (i
= 0; i
< n
; i
+= 1)
8714 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8718 container
= ada_coerce_ref (container
);
8719 if (ada_is_direct_array_type (value_type (container
)))
8720 container
= ada_coerce_to_simple_array (container
);
8721 lhs
= ada_coerce_ref (lhs
);
8722 if (!deprecated_value_modifiable (lhs
))
8723 error (_("Left operand of assignment is not a modifiable lvalue."));
8725 lhs_type
= value_type (lhs
);
8726 if (ada_is_direct_array_type (lhs_type
))
8728 lhs
= ada_coerce_to_simple_array (lhs
);
8729 lhs_type
= value_type (lhs
);
8730 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8731 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8732 is_array_aggregate
= 1;
8734 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8737 high_index
= num_visible_fields (lhs_type
) - 1;
8738 is_array_aggregate
= 0;
8741 error (_("Left-hand side must be array or record."));
8743 num_specs
= num_component_specs (exp
, *pos
- 3);
8744 max_indices
= 4 * num_specs
+ 4;
8745 indices
= alloca (max_indices
* sizeof (indices
[0]));
8746 indices
[0] = indices
[1] = low_index
- 1;
8747 indices
[2] = indices
[3] = high_index
+ 1;
8750 for (i
= 0; i
< n
; i
+= 1)
8752 switch (exp
->elts
[*pos
].opcode
)
8755 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8756 &num_indices
, max_indices
,
8757 low_index
, high_index
);
8760 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8761 &num_indices
, max_indices
,
8762 low_index
, high_index
);
8766 error (_("Misplaced 'others' clause"));
8767 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8768 num_indices
, low_index
, high_index
);
8771 error (_("Internal error: bad aggregate clause"));
8778 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8779 construct at *POS, updating *POS past the construct, given that
8780 the positions are relative to lower bound LOW, where HIGH is the
8781 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8782 updating *NUM_INDICES as needed. CONTAINER is as for
8783 assign_aggregate. */
8785 aggregate_assign_positional (struct value
*container
,
8786 struct value
*lhs
, struct expression
*exp
,
8787 int *pos
, LONGEST
*indices
, int *num_indices
,
8788 int max_indices
, LONGEST low
, LONGEST high
)
8790 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8792 if (ind
- 1 == high
)
8793 warning (_("Extra components in aggregate ignored."));
8796 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8798 assign_component (container
, lhs
, ind
, exp
, pos
);
8801 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8804 /* Assign into the components of LHS indexed by the OP_CHOICES
8805 construct at *POS, updating *POS past the construct, given that
8806 the allowable indices are LOW..HIGH. Record the indices assigned
8807 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8808 needed. CONTAINER is as for assign_aggregate. */
8810 aggregate_assign_from_choices (struct value
*container
,
8811 struct value
*lhs
, struct expression
*exp
,
8812 int *pos
, LONGEST
*indices
, int *num_indices
,
8813 int max_indices
, LONGEST low
, LONGEST high
)
8816 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8817 int choice_pos
, expr_pc
;
8818 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8820 choice_pos
= *pos
+= 3;
8822 for (j
= 0; j
< n_choices
; j
+= 1)
8823 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8825 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8827 for (j
= 0; j
< n_choices
; j
+= 1)
8829 LONGEST lower
, upper
;
8830 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8832 if (op
== OP_DISCRETE_RANGE
)
8835 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8837 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8842 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8854 name
= &exp
->elts
[choice_pos
+ 2].string
;
8857 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8860 error (_("Invalid record component association."));
8862 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8864 if (! find_struct_field (name
, value_type (lhs
), 0,
8865 NULL
, NULL
, NULL
, NULL
, &ind
))
8866 error (_("Unknown component name: %s."), name
);
8867 lower
= upper
= ind
;
8870 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8871 error (_("Index in component association out of bounds."));
8873 add_component_interval (lower
, upper
, indices
, num_indices
,
8875 while (lower
<= upper
)
8880 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8886 /* Assign the value of the expression in the OP_OTHERS construct in
8887 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8888 have not been previously assigned. The index intervals already assigned
8889 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8890 OP_OTHERS clause. CONTAINER is as for assign_aggregate. */
8892 aggregate_assign_others (struct value
*container
,
8893 struct value
*lhs
, struct expression
*exp
,
8894 int *pos
, LONGEST
*indices
, int num_indices
,
8895 LONGEST low
, LONGEST high
)
8898 int expr_pc
= *pos
+ 1;
8900 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8904 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8909 assign_component (container
, lhs
, ind
, exp
, &localpos
);
8912 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8915 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8916 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8917 modifying *SIZE as needed. It is an error if *SIZE exceeds
8918 MAX_SIZE. The resulting intervals do not overlap. */
8920 add_component_interval (LONGEST low
, LONGEST high
,
8921 LONGEST
* indices
, int *size
, int max_size
)
8925 for (i
= 0; i
< *size
; i
+= 2) {
8926 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8930 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8931 if (high
< indices
[kh
])
8933 if (low
< indices
[i
])
8935 indices
[i
+ 1] = indices
[kh
- 1];
8936 if (high
> indices
[i
+ 1])
8937 indices
[i
+ 1] = high
;
8938 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8939 *size
-= kh
- i
- 2;
8942 else if (high
< indices
[i
])
8946 if (*size
== max_size
)
8947 error (_("Internal error: miscounted aggregate components."));
8949 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8950 indices
[j
] = indices
[j
- 2];
8952 indices
[i
+ 1] = high
;
8955 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8958 static struct value
*
8959 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8961 if (type
== ada_check_typedef (value_type (arg2
)))
8964 if (ada_is_fixed_point_type (type
))
8965 return (cast_to_fixed (type
, arg2
));
8967 if (ada_is_fixed_point_type (value_type (arg2
)))
8968 return cast_from_fixed (type
, arg2
);
8970 return value_cast (type
, arg2
);
8973 /* Evaluating Ada expressions, and printing their result.
8974 ------------------------------------------------------
8979 We usually evaluate an Ada expression in order to print its value.
8980 We also evaluate an expression in order to print its type, which
8981 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8982 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8983 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8984 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8987 Evaluating expressions is a little more complicated for Ada entities
8988 than it is for entities in languages such as C. The main reason for
8989 this is that Ada provides types whose definition might be dynamic.
8990 One example of such types is variant records. Or another example
8991 would be an array whose bounds can only be known at run time.
8993 The following description is a general guide as to what should be
8994 done (and what should NOT be done) in order to evaluate an expression
8995 involving such types, and when. This does not cover how the semantic
8996 information is encoded by GNAT as this is covered separatly. For the
8997 document used as the reference for the GNAT encoding, see exp_dbug.ads
8998 in the GNAT sources.
9000 Ideally, we should embed each part of this description next to its
9001 associated code. Unfortunately, the amount of code is so vast right
9002 now that it's hard to see whether the code handling a particular
9003 situation might be duplicated or not. One day, when the code is
9004 cleaned up, this guide might become redundant with the comments
9005 inserted in the code, and we might want to remove it.
9007 2. ``Fixing'' an Entity, the Simple Case:
9008 -----------------------------------------
9010 When evaluating Ada expressions, the tricky issue is that they may
9011 reference entities whose type contents and size are not statically
9012 known. Consider for instance a variant record:
9014 type Rec (Empty : Boolean := True) is record
9017 when False => Value : Integer;
9020 Yes : Rec := (Empty => False, Value => 1);
9021 No : Rec := (empty => True);
9023 The size and contents of that record depends on the value of the
9024 descriminant (Rec.Empty). At this point, neither the debugging
9025 information nor the associated type structure in GDB are able to
9026 express such dynamic types. So what the debugger does is to create
9027 "fixed" versions of the type that applies to the specific object.
9028 We also informally refer to this opperation as "fixing" an object,
9029 which means creating its associated fixed type.
9031 Example: when printing the value of variable "Yes" above, its fixed
9032 type would look like this:
9039 On the other hand, if we printed the value of "No", its fixed type
9046 Things become a little more complicated when trying to fix an entity
9047 with a dynamic type that directly contains another dynamic type,
9048 such as an array of variant records, for instance. There are
9049 two possible cases: Arrays, and records.
9051 3. ``Fixing'' Arrays:
9052 ---------------------
9054 The type structure in GDB describes an array in terms of its bounds,
9055 and the type of its elements. By design, all elements in the array
9056 have the same type and we cannot represent an array of variant elements
9057 using the current type structure in GDB. When fixing an array,
9058 we cannot fix the array element, as we would potentially need one
9059 fixed type per element of the array. As a result, the best we can do
9060 when fixing an array is to produce an array whose bounds and size
9061 are correct (allowing us to read it from memory), but without having
9062 touched its element type. Fixing each element will be done later,
9063 when (if) necessary.
9065 Arrays are a little simpler to handle than records, because the same
9066 amount of memory is allocated for each element of the array, even if
9067 the amount of space actually used by each element differs from element
9068 to element. Consider for instance the following array of type Rec:
9070 type Rec_Array is array (1 .. 2) of Rec;
9072 The actual amount of memory occupied by each element might be different
9073 from element to element, depending on the value of their discriminant.
9074 But the amount of space reserved for each element in the array remains
9075 fixed regardless. So we simply need to compute that size using
9076 the debugging information available, from which we can then determine
9077 the array size (we multiply the number of elements of the array by
9078 the size of each element).
9080 The simplest case is when we have an array of a constrained element
9081 type. For instance, consider the following type declarations:
9083 type Bounded_String (Max_Size : Integer) is
9085 Buffer : String (1 .. Max_Size);
9087 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
9089 In this case, the compiler describes the array as an array of
9090 variable-size elements (identified by its XVS suffix) for which
9091 the size can be read in the parallel XVZ variable.
9093 In the case of an array of an unconstrained element type, the compiler
9094 wraps the array element inside a private PAD type. This type should not
9095 be shown to the user, and must be "unwrap"'ed before printing. Note
9096 that we also use the adjective "aligner" in our code to designate
9097 these wrapper types.
9099 In some cases, the size allocated for each element is statically
9100 known. In that case, the PAD type already has the correct size,
9101 and the array element should remain unfixed.
9103 But there are cases when this size is not statically known.
9104 For instance, assuming that "Five" is an integer variable:
9106 type Dynamic is array (1 .. Five) of Integer;
9107 type Wrapper (Has_Length : Boolean := False) is record
9110 when True => Length : Integer;
9114 type Wrapper_Array is array (1 .. 2) of Wrapper;
9116 Hello : Wrapper_Array := (others => (Has_Length => True,
9117 Data => (others => 17),
9121 The debugging info would describe variable Hello as being an
9122 array of a PAD type. The size of that PAD type is not statically
9123 known, but can be determined using a parallel XVZ variable.
9124 In that case, a copy of the PAD type with the correct size should
9125 be used for the fixed array.
9127 3. ``Fixing'' record type objects:
9128 ----------------------------------
9130 Things are slightly different from arrays in the case of dynamic
9131 record types. In this case, in order to compute the associated
9132 fixed type, we need to determine the size and offset of each of
9133 its components. This, in turn, requires us to compute the fixed
9134 type of each of these components.
9136 Consider for instance the example:
9138 type Bounded_String (Max_Size : Natural) is record
9139 Str : String (1 .. Max_Size);
9142 My_String : Bounded_String (Max_Size => 10);
9144 In that case, the position of field "Length" depends on the size
9145 of field Str, which itself depends on the value of the Max_Size
9146 discriminant. In order to fix the type of variable My_String,
9147 we need to fix the type of field Str. Therefore, fixing a variant
9148 record requires us to fix each of its components.
9150 However, if a component does not have a dynamic size, the component
9151 should not be fixed. In particular, fields that use a PAD type
9152 should not fixed. Here is an example where this might happen
9153 (assuming type Rec above):
9155 type Container (Big : Boolean) is record
9159 when True => Another : Integer;
9163 My_Container : Container := (Big => False,
9164 First => (Empty => True),
9167 In that example, the compiler creates a PAD type for component First,
9168 whose size is constant, and then positions the component After just
9169 right after it. The offset of component After is therefore constant
9172 The debugger computes the position of each field based on an algorithm
9173 that uses, among other things, the actual position and size of the field
9174 preceding it. Let's now imagine that the user is trying to print
9175 the value of My_Container. If the type fixing was recursive, we would
9176 end up computing the offset of field After based on the size of the
9177 fixed version of field First. And since in our example First has
9178 only one actual field, the size of the fixed type is actually smaller
9179 than the amount of space allocated to that field, and thus we would
9180 compute the wrong offset of field After.
9182 To make things more complicated, we need to watch out for dynamic
9183 components of variant records (identified by the ___XVL suffix in
9184 the component name). Even if the target type is a PAD type, the size
9185 of that type might not be statically known. So the PAD type needs
9186 to be unwrapped and the resulting type needs to be fixed. Otherwise,
9187 we might end up with the wrong size for our component. This can be
9188 observed with the following type declarations:
9190 type Octal is new Integer range 0 .. 7;
9191 type Octal_Array is array (Positive range <>) of Octal;
9192 pragma Pack (Octal_Array);
9194 type Octal_Buffer (Size : Positive) is record
9195 Buffer : Octal_Array (1 .. Size);
9199 In that case, Buffer is a PAD type whose size is unset and needs
9200 to be computed by fixing the unwrapped type.
9202 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
9203 ----------------------------------------------------------
9205 Lastly, when should the sub-elements of an entity that remained unfixed
9206 thus far, be actually fixed?
9208 The answer is: Only when referencing that element. For instance
9209 when selecting one component of a record, this specific component
9210 should be fixed at that point in time. Or when printing the value
9211 of a record, each component should be fixed before its value gets
9212 printed. Similarly for arrays, the element of the array should be
9213 fixed when printing each element of the array, or when extracting
9214 one element out of that array. On the other hand, fixing should
9215 not be performed on the elements when taking a slice of an array!
9217 Note that one of the side-effects of miscomputing the offset and
9218 size of each field is that we end up also miscomputing the size
9219 of the containing type. This can have adverse results when computing
9220 the value of an entity. GDB fetches the value of an entity based
9221 on the size of its type, and thus a wrong size causes GDB to fetch
9222 the wrong amount of memory. In the case where the computed size is
9223 too small, GDB fetches too little data to print the value of our
9224 entiry. Results in this case as unpredicatble, as we usually read
9225 past the buffer containing the data =:-o. */
9227 /* Implement the evaluate_exp routine in the exp_descriptor structure
9228 for the Ada language. */
9230 static struct value
*
9231 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
9232 int *pos
, enum noside noside
)
9237 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
9240 struct value
**argvec
;
9244 op
= exp
->elts
[pc
].opcode
;
9250 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9251 arg1
= unwrap_value (arg1
);
9253 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
9254 then we need to perform the conversion manually, because
9255 evaluate_subexp_standard doesn't do it. This conversion is
9256 necessary in Ada because the different kinds of float/fixed
9257 types in Ada have different representations.
9259 Similarly, we need to perform the conversion from OP_LONG
9261 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
9262 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
9268 struct value
*result
;
9271 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9272 /* The result type will have code OP_STRING, bashed there from
9273 OP_ARRAY. Bash it back. */
9274 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
9275 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
9281 type
= exp
->elts
[pc
+ 1].type
;
9282 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
9283 if (noside
== EVAL_SKIP
)
9285 arg1
= ada_value_cast (type
, arg1
, noside
);
9290 type
= exp
->elts
[pc
+ 1].type
;
9291 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
9294 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9295 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
9297 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
9298 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9300 return ada_value_assign (arg1
, arg1
);
9302 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
9303 except if the lhs of our assignment is a convenience variable.
9304 In the case of assigning to a convenience variable, the lhs
9305 should be exactly the result of the evaluation of the rhs. */
9306 type
= value_type (arg1
);
9307 if (VALUE_LVAL (arg1
) == lval_internalvar
)
9309 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
9310 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9312 if (ada_is_fixed_point_type (value_type (arg1
)))
9313 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
9314 else if (ada_is_fixed_point_type (value_type (arg2
)))
9316 (_("Fixed-point values must be assigned to fixed-point variables"));
9318 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
9319 return ada_value_assign (arg1
, arg2
);
9322 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9323 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9324 if (noside
== EVAL_SKIP
)
9326 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9327 return (value_from_longest
9329 value_as_long (arg1
) + value_as_long (arg2
)));
9330 if ((ada_is_fixed_point_type (value_type (arg1
))
9331 || ada_is_fixed_point_type (value_type (arg2
)))
9332 && value_type (arg1
) != value_type (arg2
))
9333 error (_("Operands of fixed-point addition must have the same type"));
9334 /* Do the addition, and cast the result to the type of the first
9335 argument. We cannot cast the result to a reference type, so if
9336 ARG1 is a reference type, find its underlying type. */
9337 type
= value_type (arg1
);
9338 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9339 type
= TYPE_TARGET_TYPE (type
);
9340 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9341 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
9344 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9345 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
9346 if (noside
== EVAL_SKIP
)
9348 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
9349 return (value_from_longest
9351 value_as_long (arg1
) - value_as_long (arg2
)));
9352 if ((ada_is_fixed_point_type (value_type (arg1
))
9353 || ada_is_fixed_point_type (value_type (arg2
)))
9354 && value_type (arg1
) != value_type (arg2
))
9355 error (_("Operands of fixed-point subtraction "
9356 "must have the same type"));
9357 /* Do the substraction, and cast the result to the type of the first
9358 argument. We cannot cast the result to a reference type, so if
9359 ARG1 is a reference type, find its underlying type. */
9360 type
= value_type (arg1
);
9361 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
9362 type
= TYPE_TARGET_TYPE (type
);
9363 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9364 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
9370 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9371 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9372 if (noside
== EVAL_SKIP
)
9374 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9376 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9377 return value_zero (value_type (arg1
), not_lval
);
9381 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
9382 if (ada_is_fixed_point_type (value_type (arg1
)))
9383 arg1
= cast_from_fixed (type
, arg1
);
9384 if (ada_is_fixed_point_type (value_type (arg2
)))
9385 arg2
= cast_from_fixed (type
, arg2
);
9386 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9387 return ada_value_binop (arg1
, arg2
, op
);
9391 case BINOP_NOTEQUAL
:
9392 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9393 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
9394 if (noside
== EVAL_SKIP
)
9396 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9400 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9401 tem
= ada_value_equal (arg1
, arg2
);
9403 if (op
== BINOP_NOTEQUAL
)
9405 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9406 return value_from_longest (type
, (LONGEST
) tem
);
9409 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9410 if (noside
== EVAL_SKIP
)
9412 else if (ada_is_fixed_point_type (value_type (arg1
)))
9413 return value_cast (value_type (arg1
), value_neg (arg1
));
9416 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9417 return value_neg (arg1
);
9420 case BINOP_LOGICAL_AND
:
9421 case BINOP_LOGICAL_OR
:
9422 case UNOP_LOGICAL_NOT
:
9427 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9428 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9429 return value_cast (type
, val
);
9432 case BINOP_BITWISE_AND
:
9433 case BINOP_BITWISE_IOR
:
9434 case BINOP_BITWISE_XOR
:
9438 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
9440 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9442 return value_cast (value_type (arg1
), val
);
9448 if (noside
== EVAL_SKIP
)
9453 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
9454 /* Only encountered when an unresolved symbol occurs in a
9455 context other than a function call, in which case, it is
9457 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9458 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
9459 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9461 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
9462 /* Check to see if this is a tagged type. We also need to handle
9463 the case where the type is a reference to a tagged type, but
9464 we have to be careful to exclude pointers to tagged types.
9465 The latter should be shown as usual (as a pointer), whereas
9466 a reference should mostly be transparent to the user. */
9467 if (ada_is_tagged_type (type
, 0)
9468 || (TYPE_CODE(type
) == TYPE_CODE_REF
9469 && ada_is_tagged_type (TYPE_TARGET_TYPE (type
), 0)))
9471 /* Tagged types are a little special in the fact that the real
9472 type is dynamic and can only be determined by inspecting the
9473 object's tag. This means that we need to get the object's
9474 value first (EVAL_NORMAL) and then extract the actual object
9477 Note that we cannot skip the final step where we extract
9478 the object type from its tag, because the EVAL_NORMAL phase
9479 results in dynamic components being resolved into fixed ones.
9480 This can cause problems when trying to print the type
9481 description of tagged types whose parent has a dynamic size:
9482 We use the type name of the "_parent" component in order
9483 to print the name of the ancestor type in the type description.
9484 If that component had a dynamic size, the resolution into
9485 a fixed type would result in the loss of that type name,
9486 thus preventing us from printing the name of the ancestor
9487 type in the type description. */
9488 struct type
*actual_type
;
9490 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
9491 actual_type
= type_from_tag (ada_value_tag (arg1
));
9492 if (actual_type
== NULL
)
9493 /* If, for some reason, we were unable to determine
9494 the actual type from the tag, then use the static
9495 approximation that we just computed as a fallback.
9496 This can happen if the debugging information is
9497 incomplete, for instance. */
9500 return value_zero (actual_type
, not_lval
);
9505 (to_static_fixed_type
9506 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
9511 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
9512 arg1
= unwrap_value (arg1
);
9513 return ada_to_fixed_value (arg1
);
9519 /* Allocate arg vector, including space for the function to be
9520 called in argvec[0] and a terminating NULL. */
9521 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9523 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
9525 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
9526 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
9527 error (_("Unexpected unresolved symbol, %s, during evaluation"),
9528 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
9531 for (tem
= 0; tem
<= nargs
; tem
+= 1)
9532 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9535 if (noside
== EVAL_SKIP
)
9539 if (ada_is_constrained_packed_array_type
9540 (desc_base_type (value_type (argvec
[0]))))
9541 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
9542 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9543 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
9544 /* This is a packed array that has already been fixed, and
9545 therefore already coerced to a simple array. Nothing further
9548 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
9549 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
9550 && VALUE_LVAL (argvec
[0]) == lval_memory
))
9551 argvec
[0] = value_addr (argvec
[0]);
9553 type
= ada_check_typedef (value_type (argvec
[0]));
9555 /* Ada allows us to implicitly dereference arrays when subscripting
9556 them. So, if this is an array typedef (encoding use for array
9557 access types encoded as fat pointers), strip it now. */
9558 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
)
9559 type
= ada_typedef_target_type (type
);
9561 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
9563 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
9565 case TYPE_CODE_FUNC
:
9566 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9568 case TYPE_CODE_ARRAY
:
9570 case TYPE_CODE_STRUCT
:
9571 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
9572 argvec
[0] = ada_value_ind (argvec
[0]);
9573 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
9576 error (_("cannot subscript or call something of type `%s'"),
9577 ada_type_name (value_type (argvec
[0])));
9582 switch (TYPE_CODE (type
))
9584 case TYPE_CODE_FUNC
:
9585 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9586 return allocate_value (TYPE_TARGET_TYPE (type
));
9587 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
9588 case TYPE_CODE_STRUCT
:
9592 arity
= ada_array_arity (type
);
9593 type
= ada_array_element_type (type
, nargs
);
9595 error (_("cannot subscript or call a record"));
9597 error (_("wrong number of subscripts; expecting %d"), arity
);
9598 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9599 return value_zero (ada_aligned_type (type
), lval_memory
);
9601 unwrap_value (ada_value_subscript
9602 (argvec
[0], nargs
, argvec
+ 1));
9604 case TYPE_CODE_ARRAY
:
9605 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9607 type
= ada_array_element_type (type
, nargs
);
9609 error (_("element type of array unknown"));
9611 return value_zero (ada_aligned_type (type
), lval_memory
);
9614 unwrap_value (ada_value_subscript
9615 (ada_coerce_to_simple_array (argvec
[0]),
9616 nargs
, argvec
+ 1));
9617 case TYPE_CODE_PTR
: /* Pointer to array */
9618 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9619 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9621 type
= ada_array_element_type (type
, nargs
);
9623 error (_("element type of array unknown"));
9625 return value_zero (ada_aligned_type (type
), lval_memory
);
9628 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9629 nargs
, argvec
+ 1));
9632 error (_("Attempt to index or call something other than an "
9633 "array or function"));
9638 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9639 struct value
*low_bound_val
=
9640 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9641 struct value
*high_bound_val
=
9642 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9646 low_bound_val
= coerce_ref (low_bound_val
);
9647 high_bound_val
= coerce_ref (high_bound_val
);
9648 low_bound
= pos_atr (low_bound_val
);
9649 high_bound
= pos_atr (high_bound_val
);
9651 if (noside
== EVAL_SKIP
)
9654 /* If this is a reference to an aligner type, then remove all
9656 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9657 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9658 TYPE_TARGET_TYPE (value_type (array
)) =
9659 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9661 if (ada_is_constrained_packed_array_type (value_type (array
)))
9662 error (_("cannot slice a packed array"));
9664 /* If this is a reference to an array or an array lvalue,
9665 convert to a pointer. */
9666 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9667 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9668 && VALUE_LVAL (array
) == lval_memory
))
9669 array
= value_addr (array
);
9671 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9672 && ada_is_array_descriptor_type (ada_check_typedef
9673 (value_type (array
))))
9674 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9676 array
= ada_coerce_to_simple_array_ptr (array
);
9678 /* If we have more than one level of pointer indirection,
9679 dereference the value until we get only one level. */
9680 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9681 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9683 array
= value_ind (array
);
9685 /* Make sure we really do have an array type before going further,
9686 to avoid a SEGV when trying to get the index type or the target
9687 type later down the road if the debug info generated by
9688 the compiler is incorrect or incomplete. */
9689 if (!ada_is_simple_array_type (value_type (array
)))
9690 error (_("cannot take slice of non-array"));
9692 if (TYPE_CODE (ada_check_typedef (value_type (array
)))
9695 struct type
*type0
= ada_check_typedef (value_type (array
));
9697 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9698 return empty_array (TYPE_TARGET_TYPE (type0
), low_bound
);
9701 struct type
*arr_type0
=
9702 to_fixed_array_type (TYPE_TARGET_TYPE (type0
), NULL
, 1);
9704 return ada_value_slice_from_ptr (array
, arr_type0
,
9705 longest_to_int (low_bound
),
9706 longest_to_int (high_bound
));
9709 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9711 else if (high_bound
< low_bound
)
9712 return empty_array (value_type (array
), low_bound
);
9714 return ada_value_slice (array
, longest_to_int (low_bound
),
9715 longest_to_int (high_bound
));
9720 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9721 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9723 if (noside
== EVAL_SKIP
)
9726 switch (TYPE_CODE (type
))
9729 lim_warning (_("Membership test incompletely implemented; "
9730 "always returns true"));
9731 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9732 return value_from_longest (type
, (LONGEST
) 1);
9734 case TYPE_CODE_RANGE
:
9735 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9736 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9737 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9738 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9739 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9741 value_from_longest (type
,
9742 (value_less (arg1
, arg3
)
9743 || value_equal (arg1
, arg3
))
9744 && (value_less (arg2
, arg1
)
9745 || value_equal (arg2
, arg1
)));
9748 case BINOP_IN_BOUNDS
:
9750 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9751 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9753 if (noside
== EVAL_SKIP
)
9756 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9758 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9759 return value_zero (type
, not_lval
);
9762 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9764 type
= ada_index_type (value_type (arg2
), tem
, "range");
9766 type
= value_type (arg1
);
9768 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9769 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9771 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9772 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9773 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9775 value_from_longest (type
,
9776 (value_less (arg1
, arg3
)
9777 || value_equal (arg1
, arg3
))
9778 && (value_less (arg2
, arg1
)
9779 || value_equal (arg2
, arg1
)));
9781 case TERNOP_IN_RANGE
:
9782 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9783 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9784 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9786 if (noside
== EVAL_SKIP
)
9789 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9790 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9791 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9793 value_from_longest (type
,
9794 (value_less (arg1
, arg3
)
9795 || value_equal (arg1
, arg3
))
9796 && (value_less (arg2
, arg1
)
9797 || value_equal (arg2
, arg1
)));
9803 struct type
*type_arg
;
9805 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9807 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9809 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9813 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9817 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9818 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9819 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9822 if (noside
== EVAL_SKIP
)
9825 if (type_arg
== NULL
)
9827 arg1
= ada_coerce_ref (arg1
);
9829 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9830 arg1
= ada_coerce_to_simple_array (arg1
);
9832 type
= ada_index_type (value_type (arg1
), tem
,
9833 ada_attribute_name (op
));
9835 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9837 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9838 return allocate_value (type
);
9842 default: /* Should never happen. */
9843 error (_("unexpected attribute encountered"));
9845 return value_from_longest
9846 (type
, ada_array_bound (arg1
, tem
, 0));
9848 return value_from_longest
9849 (type
, ada_array_bound (arg1
, tem
, 1));
9851 return value_from_longest
9852 (type
, ada_array_length (arg1
, tem
));
9855 else if (discrete_type_p (type_arg
))
9857 struct type
*range_type
;
9858 char *name
= ada_type_name (type_arg
);
9861 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9862 range_type
= to_fixed_range_type (type_arg
, NULL
);
9863 if (range_type
== NULL
)
9864 range_type
= type_arg
;
9868 error (_("unexpected attribute encountered"));
9870 return value_from_longest
9871 (range_type
, ada_discrete_type_low_bound (range_type
));
9873 return value_from_longest
9874 (range_type
, ada_discrete_type_high_bound (range_type
));
9876 error (_("the 'length attribute applies only to array types"));
9879 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9880 error (_("unimplemented type attribute"));
9885 if (ada_is_constrained_packed_array_type (type_arg
))
9886 type_arg
= decode_constrained_packed_array_type (type_arg
);
9888 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
9890 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9892 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9893 return allocate_value (type
);
9898 error (_("unexpected attribute encountered"));
9900 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9901 return value_from_longest (type
, low
);
9903 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9904 return value_from_longest (type
, high
);
9906 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9907 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9908 return value_from_longest (type
, high
- low
+ 1);
9914 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9915 if (noside
== EVAL_SKIP
)
9918 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9919 return value_zero (ada_tag_type (arg1
), not_lval
);
9921 return ada_value_tag (arg1
);
9925 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9926 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9927 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9928 if (noside
== EVAL_SKIP
)
9930 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9931 return value_zero (value_type (arg1
), not_lval
);
9934 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9935 return value_binop (arg1
, arg2
,
9936 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9939 case OP_ATR_MODULUS
:
9941 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9943 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9944 if (noside
== EVAL_SKIP
)
9947 if (!ada_is_modular_type (type_arg
))
9948 error (_("'modulus must be applied to modular type"));
9950 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9951 ada_modulus (type_arg
));
9956 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9957 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9958 if (noside
== EVAL_SKIP
)
9960 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9961 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9962 return value_zero (type
, not_lval
);
9964 return value_pos_atr (type
, arg1
);
9967 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9968 type
= value_type (arg1
);
9970 /* If the argument is a reference, then dereference its type, since
9971 the user is really asking for the size of the actual object,
9972 not the size of the pointer. */
9973 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9974 type
= TYPE_TARGET_TYPE (type
);
9976 if (noside
== EVAL_SKIP
)
9978 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9979 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9981 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9982 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9985 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9986 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9987 type
= exp
->elts
[pc
+ 2].type
;
9988 if (noside
== EVAL_SKIP
)
9990 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9991 return value_zero (type
, not_lval
);
9993 return value_val_atr (type
, arg1
);
9996 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9997 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9998 if (noside
== EVAL_SKIP
)
10000 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10001 return value_zero (value_type (arg1
), not_lval
);
10004 /* For integer exponentiation operations,
10005 only promote the first argument. */
10006 if (is_integral_type (value_type (arg2
)))
10007 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10009 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
10011 return value_binop (arg1
, arg2
, op
);
10015 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10016 if (noside
== EVAL_SKIP
)
10022 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10023 if (noside
== EVAL_SKIP
)
10025 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
10026 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
10027 return value_neg (arg1
);
10032 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10033 if (noside
== EVAL_SKIP
)
10035 type
= ada_check_typedef (value_type (arg1
));
10036 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10038 if (ada_is_array_descriptor_type (type
))
10039 /* GDB allows dereferencing GNAT array descriptors. */
10041 struct type
*arrType
= ada_type_of_array (arg1
, 0);
10043 if (arrType
== NULL
)
10044 error (_("Attempt to dereference null array pointer."));
10045 return value_at_lazy (arrType
, 0);
10047 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
10048 || TYPE_CODE (type
) == TYPE_CODE_REF
10049 /* In C you can dereference an array to get the 1st elt. */
10050 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
10052 type
= to_static_fixed_type
10054 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
10056 return value_zero (type
, lval_memory
);
10058 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10060 /* GDB allows dereferencing an int. */
10061 if (expect_type
== NULL
)
10062 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
10067 to_static_fixed_type (ada_aligned_type (expect_type
));
10068 return value_zero (expect_type
, lval_memory
);
10072 error (_("Attempt to take contents of a non-pointer value."));
10074 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
10075 type
= ada_check_typedef (value_type (arg1
));
10077 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
10078 /* GDB allows dereferencing an int. If we were given
10079 the expect_type, then use that as the target type.
10080 Otherwise, assume that the target type is an int. */
10082 if (expect_type
!= NULL
)
10083 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
10086 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
10087 (CORE_ADDR
) value_as_address (arg1
));
10090 if (ada_is_array_descriptor_type (type
))
10091 /* GDB allows dereferencing GNAT array descriptors. */
10092 return ada_coerce_to_simple_array (arg1
);
10094 return ada_value_ind (arg1
);
10096 case STRUCTOP_STRUCT
:
10097 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10098 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
10099 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
10100 if (noside
== EVAL_SKIP
)
10102 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10104 struct type
*type1
= value_type (arg1
);
10106 if (ada_is_tagged_type (type1
, 1))
10108 type
= ada_lookup_struct_elt_type (type1
,
10109 &exp
->elts
[pc
+ 2].string
,
10112 /* In this case, we assume that the field COULD exist
10113 in some extension of the type. Return an object of
10114 "type" void, which will match any formal
10115 (see ada_type_match). */
10116 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
10121 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
10124 return value_zero (ada_aligned_type (type
), lval_memory
);
10127 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
10128 arg1
= unwrap_value (arg1
);
10129 return ada_to_fixed_value (arg1
);
10132 /* The value is not supposed to be used. This is here to make it
10133 easier to accommodate expressions that contain types. */
10135 if (noside
== EVAL_SKIP
)
10137 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
10138 return allocate_value (exp
->elts
[pc
+ 1].type
);
10140 error (_("Attempt to use a type name as an expression"));
10145 case OP_DISCRETE_RANGE
:
10146 case OP_POSITIONAL
:
10148 if (noside
== EVAL_NORMAL
)
10152 error (_("Undefined name, ambiguous name, or renaming used in "
10153 "component association: %s."), &exp
->elts
[pc
+2].string
);
10155 error (_("Aggregates only allowed on the right of an assignment"));
10157 internal_error (__FILE__
, __LINE__
,
10158 _("aggregate apparently mangled"));
10161 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10163 for (tem
= 0; tem
< nargs
; tem
+= 1)
10164 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
10169 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
10175 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
10176 type name that encodes the 'small and 'delta information.
10177 Otherwise, return NULL. */
10179 static const char *
10180 fixed_type_info (struct type
*type
)
10182 const char *name
= ada_type_name (type
);
10183 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
10185 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
10187 const char *tail
= strstr (name
, "___XF_");
10194 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
10195 return fixed_type_info (TYPE_TARGET_TYPE (type
));
10200 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
10203 ada_is_fixed_point_type (struct type
*type
)
10205 return fixed_type_info (type
) != NULL
;
10208 /* Return non-zero iff TYPE represents a System.Address type. */
10211 ada_is_system_address_type (struct type
*type
)
10213 return (TYPE_NAME (type
)
10214 && strcmp (TYPE_NAME (type
), "system__address") == 0);
10217 /* Assuming that TYPE is the representation of an Ada fixed-point
10218 type, return its delta, or -1 if the type is malformed and the
10219 delta cannot be determined. */
10222 ada_delta (struct type
*type
)
10224 const char *encoding
= fixed_type_info (type
);
10227 /* Strictly speaking, num and den are encoded as integer. However,
10228 they may not fit into a long, and they will have to be converted
10229 to DOUBLEST anyway. So scan them as DOUBLEST. */
10230 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10237 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
10238 factor ('SMALL value) associated with the type. */
10241 scaling_factor (struct type
*type
)
10243 const char *encoding
= fixed_type_info (type
);
10244 DOUBLEST num0
, den0
, num1
, den1
;
10247 /* Strictly speaking, num's and den's are encoded as integer. However,
10248 they may not fit into a long, and they will have to be converted
10249 to DOUBLEST anyway. So scan them as DOUBLEST. */
10250 n
= sscanf (encoding
,
10251 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
10252 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
10253 &num0
, &den0
, &num1
, &den1
);
10258 return num1
/ den1
;
10260 return num0
/ den0
;
10264 /* Assuming that X is the representation of a value of fixed-point
10265 type TYPE, return its floating-point equivalent. */
10268 ada_fixed_to_float (struct type
*type
, LONGEST x
)
10270 return (DOUBLEST
) x
*scaling_factor (type
);
10273 /* The representation of a fixed-point value of type TYPE
10274 corresponding to the value X. */
10277 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
10279 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
10286 /* Scan STR beginning at position K for a discriminant name, and
10287 return the value of that discriminant field of DVAL in *PX. If
10288 PNEW_K is not null, put the position of the character beyond the
10289 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
10290 not alter *PX and *PNEW_K if unsuccessful. */
10293 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
10296 static char *bound_buffer
= NULL
;
10297 static size_t bound_buffer_len
= 0;
10300 struct value
*bound_val
;
10302 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
10305 pend
= strstr (str
+ k
, "__");
10309 k
+= strlen (bound
);
10313 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
10314 bound
= bound_buffer
;
10315 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
10316 bound
[pend
- (str
+ k
)] = '\0';
10320 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
10321 if (bound_val
== NULL
)
10324 *px
= value_as_long (bound_val
);
10325 if (pnew_k
!= NULL
)
10330 /* Value of variable named NAME in the current environment. If
10331 no such variable found, then if ERR_MSG is null, returns 0, and
10332 otherwise causes an error with message ERR_MSG. */
10334 static struct value
*
10335 get_var_value (char *name
, char *err_msg
)
10337 struct ada_symbol_info
*syms
;
10340 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
10345 if (err_msg
== NULL
)
10348 error (("%s"), err_msg
);
10351 return value_of_variable (syms
[0].sym
, syms
[0].block
);
10354 /* Value of integer variable named NAME in the current environment. If
10355 no such variable found, returns 0, and sets *FLAG to 0. If
10356 successful, sets *FLAG to 1. */
10359 get_int_var_value (char *name
, int *flag
)
10361 struct value
*var_val
= get_var_value (name
, 0);
10373 return value_as_long (var_val
);
10378 /* Return a range type whose base type is that of the range type named
10379 NAME in the current environment, and whose bounds are calculated
10380 from NAME according to the GNAT range encoding conventions.
10381 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
10382 corresponding range type from debug information; fall back to using it
10383 if symbol lookup fails. If a new type must be created, allocate it
10384 like ORIG_TYPE was. The bounds information, in general, is encoded
10385 in NAME, the base type given in the named range type. */
10387 static struct type
*
10388 to_fixed_range_type (struct type
*raw_type
, struct value
*dval
)
10391 struct type
*base_type
;
10392 char *subtype_info
;
10394 gdb_assert (raw_type
!= NULL
);
10395 gdb_assert (TYPE_NAME (raw_type
) != NULL
);
10397 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
10398 base_type
= TYPE_TARGET_TYPE (raw_type
);
10400 base_type
= raw_type
;
10402 name
= TYPE_NAME (raw_type
);
10403 subtype_info
= strstr (name
, "___XD");
10404 if (subtype_info
== NULL
)
10406 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
10407 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
10409 if (L
< INT_MIN
|| U
> INT_MAX
)
10412 return create_range_type (alloc_type_copy (raw_type
), raw_type
,
10413 ada_discrete_type_low_bound (raw_type
),
10414 ada_discrete_type_high_bound (raw_type
));
10418 static char *name_buf
= NULL
;
10419 static size_t name_len
= 0;
10420 int prefix_len
= subtype_info
- name
;
10426 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
10427 strncpy (name_buf
, name
, prefix_len
);
10428 name_buf
[prefix_len
] = '\0';
10431 bounds_str
= strchr (subtype_info
, '_');
10434 if (*subtype_info
== 'L')
10436 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
10437 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
10439 if (bounds_str
[n
] == '_')
10441 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
10449 strcpy (name_buf
+ prefix_len
, "___L");
10450 L
= get_int_var_value (name_buf
, &ok
);
10453 lim_warning (_("Unknown lower bound, using 1."));
10458 if (*subtype_info
== 'U')
10460 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
10461 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
10468 strcpy (name_buf
+ prefix_len
, "___U");
10469 U
= get_int_var_value (name_buf
, &ok
);
10472 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
10477 type
= create_range_type (alloc_type_copy (raw_type
), base_type
, L
, U
);
10478 TYPE_NAME (type
) = name
;
10483 /* True iff NAME is the name of a range type. */
10486 ada_is_range_type_name (const char *name
)
10488 return (name
!= NULL
&& strstr (name
, "___XD"));
10492 /* Modular types */
10494 /* True iff TYPE is an Ada modular type. */
10497 ada_is_modular_type (struct type
*type
)
10499 struct type
*subranged_type
= get_base_type (type
);
10501 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
10502 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
10503 && TYPE_UNSIGNED (subranged_type
));
10506 /* Try to determine the lower and upper bounds of the given modular type
10507 using the type name only. Return non-zero and set L and U as the lower
10508 and upper bounds (respectively) if successful. */
10511 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
10513 char *name
= ada_type_name (type
);
10521 /* Discrete type bounds are encoded using an __XD suffix. In our case,
10522 we are looking for static bounds, which means an __XDLU suffix.
10523 Moreover, we know that the lower bound of modular types is always
10524 zero, so the actual suffix should start with "__XDLU_0__", and
10525 then be followed by the upper bound value. */
10526 suffix
= strstr (name
, "__XDLU_0__");
10527 if (suffix
== NULL
)
10530 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
10533 *modulus
= (ULONGEST
) U
+ 1;
10537 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
10540 ada_modulus (struct type
*type
)
10542 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
10546 /* Ada exception catchpoint support:
10547 ---------------------------------
10549 We support 3 kinds of exception catchpoints:
10550 . catchpoints on Ada exceptions
10551 . catchpoints on unhandled Ada exceptions
10552 . catchpoints on failed assertions
10554 Exceptions raised during failed assertions, or unhandled exceptions
10555 could perfectly be caught with the general catchpoint on Ada exceptions.
10556 However, we can easily differentiate these two special cases, and having
10557 the option to distinguish these two cases from the rest can be useful
10558 to zero-in on certain situations.
10560 Exception catchpoints are a specialized form of breakpoint,
10561 since they rely on inserting breakpoints inside known routines
10562 of the GNAT runtime. The implementation therefore uses a standard
10563 breakpoint structure of the BP_BREAKPOINT type, but with its own set
10566 Support in the runtime for exception catchpoints have been changed
10567 a few times already, and these changes affect the implementation
10568 of these catchpoints. In order to be able to support several
10569 variants of the runtime, we use a sniffer that will determine
10570 the runtime variant used by the program being debugged. */
10572 /* The different types of catchpoints that we introduced for catching
10575 enum exception_catchpoint_kind
10577 ex_catch_exception
,
10578 ex_catch_exception_unhandled
,
10582 /* Ada's standard exceptions. */
10584 static char *standard_exc
[] = {
10585 "constraint_error",
10591 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10593 /* A structure that describes how to support exception catchpoints
10594 for a given executable. */
10596 struct exception_support_info
10598 /* The name of the symbol to break on in order to insert
10599 a catchpoint on exceptions. */
10600 const char *catch_exception_sym
;
10602 /* The name of the symbol to break on in order to insert
10603 a catchpoint on unhandled exceptions. */
10604 const char *catch_exception_unhandled_sym
;
10606 /* The name of the symbol to break on in order to insert
10607 a catchpoint on failed assertions. */
10608 const char *catch_assert_sym
;
10610 /* Assuming that the inferior just triggered an unhandled exception
10611 catchpoint, this function is responsible for returning the address
10612 in inferior memory where the name of that exception is stored.
10613 Return zero if the address could not be computed. */
10614 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10617 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10618 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10620 /* The following exception support info structure describes how to
10621 implement exception catchpoints with the latest version of the
10622 Ada runtime (as of 2007-03-06). */
10624 static const struct exception_support_info default_exception_support_info
=
10626 "__gnat_debug_raise_exception", /* catch_exception_sym */
10627 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10628 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10629 ada_unhandled_exception_name_addr
10632 /* The following exception support info structure describes how to
10633 implement exception catchpoints with a slightly older version
10634 of the Ada runtime. */
10636 static const struct exception_support_info exception_support_info_fallback
=
10638 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10639 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10640 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10641 ada_unhandled_exception_name_addr_from_raise
10644 /* For each executable, we sniff which exception info structure to use
10645 and cache it in the following global variable. */
10647 static const struct exception_support_info
*exception_info
= NULL
;
10649 /* Inspect the Ada runtime and determine which exception info structure
10650 should be used to provide support for exception catchpoints.
10652 This function will always set exception_info, or raise an error. */
10655 ada_exception_support_info_sniffer (void)
10657 struct symbol
*sym
;
10659 /* If the exception info is already known, then no need to recompute it. */
10660 if (exception_info
!= NULL
)
10663 /* Check the latest (default) exception support info. */
10664 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
10668 exception_info
= &default_exception_support_info
;
10672 /* Try our fallback exception suport info. */
10673 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
10677 exception_info
= &exception_support_info_fallback
;
10681 /* Sometimes, it is normal for us to not be able to find the routine
10682 we are looking for. This happens when the program is linked with
10683 the shared version of the GNAT runtime, and the program has not been
10684 started yet. Inform the user of these two possible causes if
10687 if (ada_update_initial_language (language_unknown
) != language_ada
)
10688 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10690 /* If the symbol does not exist, then check that the program is
10691 already started, to make sure that shared libraries have been
10692 loaded. If it is not started, this may mean that the symbol is
10693 in a shared library. */
10695 if (ptid_get_pid (inferior_ptid
) == 0)
10696 error (_("Unable to insert catchpoint. Try to start the program first."));
10698 /* At this point, we know that we are debugging an Ada program and
10699 that the inferior has been started, but we still are not able to
10700 find the run-time symbols. That can mean that we are in
10701 configurable run time mode, or that a-except as been optimized
10702 out by the linker... In any case, at this point it is not worth
10703 supporting this feature. */
10705 error (_("Cannot insert catchpoints in this configuration."));
10708 /* An observer of "executable_changed" events.
10709 Its role is to clear certain cached values that need to be recomputed
10710 each time a new executable is loaded by GDB. */
10713 ada_executable_changed_observer (void)
10715 /* If the executable changed, then it is possible that the Ada runtime
10716 is different. So we need to invalidate the exception support info
10718 exception_info
= NULL
;
10721 /* True iff FRAME is very likely to be that of a function that is
10722 part of the runtime system. This is all very heuristic, but is
10723 intended to be used as advice as to what frames are uninteresting
10727 is_known_support_routine (struct frame_info
*frame
)
10729 struct symtab_and_line sal
;
10731 enum language func_lang
;
10734 /* If this code does not have any debugging information (no symtab),
10735 This cannot be any user code. */
10737 find_frame_sal (frame
, &sal
);
10738 if (sal
.symtab
== NULL
)
10741 /* If there is a symtab, but the associated source file cannot be
10742 located, then assume this is not user code: Selecting a frame
10743 for which we cannot display the code would not be very helpful
10744 for the user. This should also take care of case such as VxWorks
10745 where the kernel has some debugging info provided for a few units. */
10747 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10750 /* Check the unit filename againt the Ada runtime file naming.
10751 We also check the name of the objfile against the name of some
10752 known system libraries that sometimes come with debugging info
10755 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10757 re_comp (known_runtime_file_name_patterns
[i
]);
10758 if (re_exec (sal
.symtab
->filename
))
10760 if (sal
.symtab
->objfile
!= NULL
10761 && re_exec (sal
.symtab
->objfile
->name
))
10765 /* Check whether the function is a GNAT-generated entity. */
10767 find_frame_funname (frame
, &func_name
, &func_lang
, NULL
);
10768 if (func_name
== NULL
)
10771 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10773 re_comp (known_auxiliary_function_name_patterns
[i
]);
10774 if (re_exec (func_name
))
10781 /* Find the first frame that contains debugging information and that is not
10782 part of the Ada run-time, starting from FI and moving upward. */
10785 ada_find_printable_frame (struct frame_info
*fi
)
10787 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10789 if (!is_known_support_routine (fi
))
10798 /* Assuming that the inferior just triggered an unhandled exception
10799 catchpoint, return the address in inferior memory where the name
10800 of the exception is stored.
10802 Return zero if the address could not be computed. */
10805 ada_unhandled_exception_name_addr (void)
10807 return parse_and_eval_address ("e.full_name");
10810 /* Same as ada_unhandled_exception_name_addr, except that this function
10811 should be used when the inferior uses an older version of the runtime,
10812 where the exception name needs to be extracted from a specific frame
10813 several frames up in the callstack. */
10816 ada_unhandled_exception_name_addr_from_raise (void)
10819 struct frame_info
*fi
;
10821 /* To determine the name of this exception, we need to select
10822 the frame corresponding to RAISE_SYM_NAME. This frame is
10823 at least 3 levels up, so we simply skip the first 3 frames
10824 without checking the name of their associated function. */
10825 fi
= get_current_frame ();
10826 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10828 fi
= get_prev_frame (fi
);
10833 enum language func_lang
;
10835 find_frame_funname (fi
, &func_name
, &func_lang
, NULL
);
10836 if (func_name
!= NULL
10837 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10838 break; /* We found the frame we were looking for... */
10839 fi
= get_prev_frame (fi
);
10846 return parse_and_eval_address ("id.full_name");
10849 /* Assuming the inferior just triggered an Ada exception catchpoint
10850 (of any type), return the address in inferior memory where the name
10851 of the exception is stored, if applicable.
10853 Return zero if the address could not be computed, or if not relevant. */
10856 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10857 struct breakpoint
*b
)
10861 case ex_catch_exception
:
10862 return (parse_and_eval_address ("e.full_name"));
10865 case ex_catch_exception_unhandled
:
10866 return exception_info
->unhandled_exception_name_addr ();
10869 case ex_catch_assert
:
10870 return 0; /* Exception name is not relevant in this case. */
10874 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10878 return 0; /* Should never be reached. */
10881 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10882 any error that ada_exception_name_addr_1 might cause to be thrown.
10883 When an error is intercepted, a warning with the error message is printed,
10884 and zero is returned. */
10887 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10888 struct breakpoint
*b
)
10890 struct gdb_exception e
;
10891 CORE_ADDR result
= 0;
10893 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10895 result
= ada_exception_name_addr_1 (ex
, b
);
10900 warning (_("failed to get exception name: %s"), e
.message
);
10907 static struct symtab_and_line
ada_exception_sal (enum exception_catchpoint_kind
,
10909 const struct breakpoint_ops
**);
10910 static char *ada_exception_catchpoint_cond_string (const char *excep_string
);
10912 /* Ada catchpoints.
10914 In the case of catchpoints on Ada exceptions, the catchpoint will
10915 stop the target on every exception the program throws. When a user
10916 specifies the name of a specific exception, we translate this
10917 request into a condition expression (in text form), and then parse
10918 it into an expression stored in each of the catchpoint's locations.
10919 We then use this condition to check whether the exception that was
10920 raised is the one the user is interested in. If not, then the
10921 target is resumed again. We store the name of the requested
10922 exception, in order to be able to re-set the condition expression
10923 when symbols change. */
10925 /* An instance of this type is used to represent an Ada catchpoint
10926 breakpoint location. It includes a "struct bp_location" as a kind
10927 of base class; users downcast to "struct bp_location *" when
10930 struct ada_catchpoint_location
10932 /* The base class. */
10933 struct bp_location base
;
10935 /* The condition that checks whether the exception that was raised
10936 is the specific exception the user specified on catchpoint
10938 struct expression
*excep_cond_expr
;
10941 /* Implement the DTOR method in the bp_location_ops structure for all
10942 Ada exception catchpoint kinds. */
10945 ada_catchpoint_location_dtor (struct bp_location
*bl
)
10947 struct ada_catchpoint_location
*al
= (struct ada_catchpoint_location
*) bl
;
10949 xfree (al
->excep_cond_expr
);
10952 /* The vtable to be used in Ada catchpoint locations. */
10954 static const struct bp_location_ops ada_catchpoint_location_ops
=
10956 ada_catchpoint_location_dtor
10959 /* An instance of this type is used to represent an Ada catchpoint.
10960 It includes a "struct breakpoint" as a kind of base class; users
10961 downcast to "struct breakpoint *" when needed. */
10963 struct ada_catchpoint
10965 /* The base class. */
10966 struct breakpoint base
;
10968 /* The name of the specific exception the user specified. */
10969 char *excep_string
;
10972 /* Parse the exception condition string in the context of each of the
10973 catchpoint's locations, and store them for later evaluation. */
10976 create_excep_cond_exprs (struct ada_catchpoint
*c
)
10978 struct cleanup
*old_chain
;
10979 struct bp_location
*bl
;
10982 /* Nothing to do if there's no specific exception to catch. */
10983 if (c
->excep_string
== NULL
)
10986 /* Same if there are no locations... */
10987 if (c
->base
.loc
== NULL
)
10990 /* Compute the condition expression in text form, from the specific
10991 expection we want to catch. */
10992 cond_string
= ada_exception_catchpoint_cond_string (c
->excep_string
);
10993 old_chain
= make_cleanup (xfree
, cond_string
);
10995 /* Iterate over all the catchpoint's locations, and parse an
10996 expression for each. */
10997 for (bl
= c
->base
.loc
; bl
!= NULL
; bl
= bl
->next
)
10999 struct ada_catchpoint_location
*ada_loc
11000 = (struct ada_catchpoint_location
*) bl
;
11001 struct expression
*exp
= NULL
;
11003 if (!bl
->shlib_disabled
)
11005 volatile struct gdb_exception e
;
11009 TRY_CATCH (e
, RETURN_MASK_ERROR
)
11011 exp
= parse_exp_1 (&s
, block_for_pc (bl
->address
), 0);
11014 warning (_("failed to reevaluate internal exception condition "
11015 "for catchpoint %d: %s"),
11016 c
->base
.number
, e
.message
);
11019 ada_loc
->excep_cond_expr
= exp
;
11022 do_cleanups (old_chain
);
11025 /* Implement the DTOR method in the breakpoint_ops structure for all
11026 exception catchpoint kinds. */
11029 dtor_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
11031 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11033 xfree (c
->excep_string
);
11035 bkpt_breakpoint_ops
.dtor (b
);
11038 /* Implement the ALLOCATE_LOCATION method in the breakpoint_ops
11039 structure for all exception catchpoint kinds. */
11041 static struct bp_location
*
11042 allocate_location_exception (enum exception_catchpoint_kind ex
,
11043 struct breakpoint
*self
)
11045 struct ada_catchpoint_location
*loc
;
11047 loc
= XNEW (struct ada_catchpoint_location
);
11048 init_bp_location (&loc
->base
, &ada_catchpoint_location_ops
, self
);
11049 loc
->excep_cond_expr
= NULL
;
11053 /* Implement the RE_SET method in the breakpoint_ops structure for all
11054 exception catchpoint kinds. */
11057 re_set_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
11059 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11061 /* Call the base class's method. This updates the catchpoint's
11063 bkpt_breakpoint_ops
.re_set (b
);
11065 /* Reparse the exception conditional expressions. One for each
11067 create_excep_cond_exprs (c
);
11070 /* Returns true if we should stop for this breakpoint hit. If the
11071 user specified a specific exception, we only want to cause a stop
11072 if the program thrown that exception. */
11075 should_stop_exception (const struct bp_location
*bl
)
11077 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) bl
->owner
;
11078 const struct ada_catchpoint_location
*ada_loc
11079 = (const struct ada_catchpoint_location
*) bl
;
11080 volatile struct gdb_exception ex
;
11083 /* With no specific exception, should always stop. */
11084 if (c
->excep_string
== NULL
)
11087 if (ada_loc
->excep_cond_expr
== NULL
)
11089 /* We will have a NULL expression if back when we were creating
11090 the expressions, this location's had failed to parse. */
11095 TRY_CATCH (ex
, RETURN_MASK_ALL
)
11097 struct value
*mark
;
11099 mark
= value_mark ();
11100 stop
= value_true (evaluate_expression (ada_loc
->excep_cond_expr
));
11101 value_free_to_mark (mark
);
11104 exception_fprintf (gdb_stderr
, ex
,
11105 _("Error in testing exception condition:\n"));
11109 /* Implement the CHECK_STATUS method in the breakpoint_ops structure
11110 for all exception catchpoint kinds. */
11113 check_status_exception (enum exception_catchpoint_kind ex
, bpstat bs
)
11115 bs
->stop
= should_stop_exception (bs
->bp_location_at
);
11118 /* Implement the PRINT_IT method in the breakpoint_ops structure
11119 for all exception catchpoint kinds. */
11121 static enum print_stop_action
11122 print_it_exception (enum exception_catchpoint_kind ex
, bpstat bs
)
11124 struct ui_out
*uiout
= current_uiout
;
11125 struct breakpoint
*b
= bs
->breakpoint_at
;
11127 annotate_catchpoint (b
->number
);
11129 if (ui_out_is_mi_like_p (uiout
))
11131 ui_out_field_string (uiout
, "reason",
11132 async_reason_lookup (EXEC_ASYNC_BREAKPOINT_HIT
));
11133 ui_out_field_string (uiout
, "disp", bpdisp_text (b
->disposition
));
11136 ui_out_text (uiout
,
11137 b
->disposition
== disp_del
? "\nTemporary catchpoint "
11138 : "\nCatchpoint ");
11139 ui_out_field_int (uiout
, "bkptno", b
->number
);
11140 ui_out_text (uiout
, ", ");
11144 case ex_catch_exception
:
11145 case ex_catch_exception_unhandled
:
11147 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
11148 char exception_name
[256];
11152 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
11153 exception_name
[sizeof (exception_name
) - 1] = '\0';
11157 /* For some reason, we were unable to read the exception
11158 name. This could happen if the Runtime was compiled
11159 without debugging info, for instance. In that case,
11160 just replace the exception name by the generic string
11161 "exception" - it will read as "an exception" in the
11162 notification we are about to print. */
11163 memcpy (exception_name
, "exception", sizeof ("exception"));
11165 /* In the case of unhandled exception breakpoints, we print
11166 the exception name as "unhandled EXCEPTION_NAME", to make
11167 it clearer to the user which kind of catchpoint just got
11168 hit. We used ui_out_text to make sure that this extra
11169 info does not pollute the exception name in the MI case. */
11170 if (ex
== ex_catch_exception_unhandled
)
11171 ui_out_text (uiout
, "unhandled ");
11172 ui_out_field_string (uiout
, "exception-name", exception_name
);
11175 case ex_catch_assert
:
11176 /* In this case, the name of the exception is not really
11177 important. Just print "failed assertion" to make it clearer
11178 that his program just hit an assertion-failure catchpoint.
11179 We used ui_out_text because this info does not belong in
11181 ui_out_text (uiout
, "failed assertion");
11184 ui_out_text (uiout
, " at ");
11185 ada_find_printable_frame (get_current_frame ());
11187 return PRINT_SRC_AND_LOC
;
11190 /* Implement the PRINT_ONE method in the breakpoint_ops structure
11191 for all exception catchpoint kinds. */
11194 print_one_exception (enum exception_catchpoint_kind ex
,
11195 struct breakpoint
*b
, struct bp_location
**last_loc
)
11197 struct ui_out
*uiout
= current_uiout
;
11198 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11199 struct value_print_options opts
;
11201 get_user_print_options (&opts
);
11202 if (opts
.addressprint
)
11204 annotate_field (4);
11205 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
11208 annotate_field (5);
11209 *last_loc
= b
->loc
;
11212 case ex_catch_exception
:
11213 if (c
->excep_string
!= NULL
)
11215 char *msg
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11217 ui_out_field_string (uiout
, "what", msg
);
11221 ui_out_field_string (uiout
, "what", "all Ada exceptions");
11225 case ex_catch_exception_unhandled
:
11226 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
11229 case ex_catch_assert
:
11230 ui_out_field_string (uiout
, "what", "failed Ada assertions");
11234 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11239 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
11240 for all exception catchpoint kinds. */
11243 print_mention_exception (enum exception_catchpoint_kind ex
,
11244 struct breakpoint
*b
)
11246 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11247 struct ui_out
*uiout
= current_uiout
;
11249 ui_out_text (uiout
, b
->disposition
== disp_del
? _("Temporary catchpoint ")
11250 : _("Catchpoint "));
11251 ui_out_field_int (uiout
, "bkptno", b
->number
);
11252 ui_out_text (uiout
, ": ");
11256 case ex_catch_exception
:
11257 if (c
->excep_string
!= NULL
)
11259 char *info
= xstrprintf (_("`%s' Ada exception"), c
->excep_string
);
11260 struct cleanup
*old_chain
= make_cleanup (xfree
, info
);
11262 ui_out_text (uiout
, info
);
11263 do_cleanups (old_chain
);
11266 ui_out_text (uiout
, _("all Ada exceptions"));
11269 case ex_catch_exception_unhandled
:
11270 ui_out_text (uiout
, _("unhandled Ada exceptions"));
11273 case ex_catch_assert
:
11274 ui_out_text (uiout
, _("failed Ada assertions"));
11278 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11283 /* Implement the PRINT_RECREATE method in the breakpoint_ops structure
11284 for all exception catchpoint kinds. */
11287 print_recreate_exception (enum exception_catchpoint_kind ex
,
11288 struct breakpoint
*b
, struct ui_file
*fp
)
11290 struct ada_catchpoint
*c
= (struct ada_catchpoint
*) b
;
11294 case ex_catch_exception
:
11295 fprintf_filtered (fp
, "catch exception");
11296 if (c
->excep_string
!= NULL
)
11297 fprintf_filtered (fp
, " %s", c
->excep_string
);
11300 case ex_catch_exception_unhandled
:
11301 fprintf_filtered (fp
, "catch exception unhandled");
11304 case ex_catch_assert
:
11305 fprintf_filtered (fp
, "catch assert");
11309 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
11311 print_recreate_thread (b
, fp
);
11314 /* Virtual table for "catch exception" breakpoints. */
11317 dtor_catch_exception (struct breakpoint
*b
)
11319 dtor_exception (ex_catch_exception
, b
);
11322 static struct bp_location
*
11323 allocate_location_catch_exception (struct breakpoint
*self
)
11325 return allocate_location_exception (ex_catch_exception
, self
);
11329 re_set_catch_exception (struct breakpoint
*b
)
11331 re_set_exception (ex_catch_exception
, b
);
11335 check_status_catch_exception (bpstat bs
)
11337 check_status_exception (ex_catch_exception
, bs
);
11340 static enum print_stop_action
11341 print_it_catch_exception (bpstat bs
)
11343 return print_it_exception (ex_catch_exception
, bs
);
11347 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
11349 print_one_exception (ex_catch_exception
, b
, last_loc
);
11353 print_mention_catch_exception (struct breakpoint
*b
)
11355 print_mention_exception (ex_catch_exception
, b
);
11359 print_recreate_catch_exception (struct breakpoint
*b
, struct ui_file
*fp
)
11361 print_recreate_exception (ex_catch_exception
, b
, fp
);
11364 static struct breakpoint_ops catch_exception_breakpoint_ops
;
11366 /* Virtual table for "catch exception unhandled" breakpoints. */
11369 dtor_catch_exception_unhandled (struct breakpoint
*b
)
11371 dtor_exception (ex_catch_exception_unhandled
, b
);
11374 static struct bp_location
*
11375 allocate_location_catch_exception_unhandled (struct breakpoint
*self
)
11377 return allocate_location_exception (ex_catch_exception_unhandled
, self
);
11381 re_set_catch_exception_unhandled (struct breakpoint
*b
)
11383 re_set_exception (ex_catch_exception_unhandled
, b
);
11387 check_status_catch_exception_unhandled (bpstat bs
)
11389 check_status_exception (ex_catch_exception_unhandled
, bs
);
11392 static enum print_stop_action
11393 print_it_catch_exception_unhandled (bpstat bs
)
11395 return print_it_exception (ex_catch_exception_unhandled
, bs
);
11399 print_one_catch_exception_unhandled (struct breakpoint
*b
,
11400 struct bp_location
**last_loc
)
11402 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
11406 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
11408 print_mention_exception (ex_catch_exception_unhandled
, b
);
11412 print_recreate_catch_exception_unhandled (struct breakpoint
*b
,
11413 struct ui_file
*fp
)
11415 print_recreate_exception (ex_catch_exception_unhandled
, b
, fp
);
11418 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
;
11420 /* Virtual table for "catch assert" breakpoints. */
11423 dtor_catch_assert (struct breakpoint
*b
)
11425 dtor_exception (ex_catch_assert
, b
);
11428 static struct bp_location
*
11429 allocate_location_catch_assert (struct breakpoint
*self
)
11431 return allocate_location_exception (ex_catch_assert
, self
);
11435 re_set_catch_assert (struct breakpoint
*b
)
11437 return re_set_exception (ex_catch_assert
, b
);
11441 check_status_catch_assert (bpstat bs
)
11443 check_status_exception (ex_catch_assert
, bs
);
11446 static enum print_stop_action
11447 print_it_catch_assert (bpstat bs
)
11449 return print_it_exception (ex_catch_assert
, bs
);
11453 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
11455 print_one_exception (ex_catch_assert
, b
, last_loc
);
11459 print_mention_catch_assert (struct breakpoint
*b
)
11461 print_mention_exception (ex_catch_assert
, b
);
11465 print_recreate_catch_assert (struct breakpoint
*b
, struct ui_file
*fp
)
11467 print_recreate_exception (ex_catch_assert
, b
, fp
);
11470 static struct breakpoint_ops catch_assert_breakpoint_ops
;
11472 /* Return a newly allocated copy of the first space-separated token
11473 in ARGSP, and then adjust ARGSP to point immediately after that
11476 Return NULL if ARGPS does not contain any more tokens. */
11479 ada_get_next_arg (char **argsp
)
11481 char *args
= *argsp
;
11485 /* Skip any leading white space. */
11487 while (isspace (*args
))
11490 if (args
[0] == '\0')
11491 return NULL
; /* No more arguments. */
11493 /* Find the end of the current argument. */
11496 while (*end
!= '\0' && !isspace (*end
))
11499 /* Adjust ARGSP to point to the start of the next argument. */
11503 /* Make a copy of the current argument and return it. */
11505 result
= xmalloc (end
- args
+ 1);
11506 strncpy (result
, args
, end
- args
);
11507 result
[end
- args
] = '\0';
11512 /* Split the arguments specified in a "catch exception" command.
11513 Set EX to the appropriate catchpoint type.
11514 Set EXCEP_STRING to the name of the specific exception if
11515 specified by the user. */
11518 catch_ada_exception_command_split (char *args
,
11519 enum exception_catchpoint_kind
*ex
,
11520 char **excep_string
)
11522 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
11523 char *exception_name
;
11525 exception_name
= ada_get_next_arg (&args
);
11526 make_cleanup (xfree
, exception_name
);
11528 /* Check that we do not have any more arguments. Anything else
11531 while (isspace (*args
))
11534 if (args
[0] != '\0')
11535 error (_("Junk at end of expression"));
11537 discard_cleanups (old_chain
);
11539 if (exception_name
== NULL
)
11541 /* Catch all exceptions. */
11542 *ex
= ex_catch_exception
;
11543 *excep_string
= NULL
;
11545 else if (strcmp (exception_name
, "unhandled") == 0)
11547 /* Catch unhandled exceptions. */
11548 *ex
= ex_catch_exception_unhandled
;
11549 *excep_string
= NULL
;
11553 /* Catch a specific exception. */
11554 *ex
= ex_catch_exception
;
11555 *excep_string
= exception_name
;
11559 /* Return the name of the symbol on which we should break in order to
11560 implement a catchpoint of the EX kind. */
11562 static const char *
11563 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
11565 gdb_assert (exception_info
!= NULL
);
11569 case ex_catch_exception
:
11570 return (exception_info
->catch_exception_sym
);
11572 case ex_catch_exception_unhandled
:
11573 return (exception_info
->catch_exception_unhandled_sym
);
11575 case ex_catch_assert
:
11576 return (exception_info
->catch_assert_sym
);
11579 internal_error (__FILE__
, __LINE__
,
11580 _("unexpected catchpoint kind (%d)"), ex
);
11584 /* Return the breakpoint ops "virtual table" used for catchpoints
11587 static const struct breakpoint_ops
*
11588 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
11592 case ex_catch_exception
:
11593 return (&catch_exception_breakpoint_ops
);
11595 case ex_catch_exception_unhandled
:
11596 return (&catch_exception_unhandled_breakpoint_ops
);
11598 case ex_catch_assert
:
11599 return (&catch_assert_breakpoint_ops
);
11602 internal_error (__FILE__
, __LINE__
,
11603 _("unexpected catchpoint kind (%d)"), ex
);
11607 /* Return the condition that will be used to match the current exception
11608 being raised with the exception that the user wants to catch. This
11609 assumes that this condition is used when the inferior just triggered
11610 an exception catchpoint.
11612 The string returned is a newly allocated string that needs to be
11613 deallocated later. */
11616 ada_exception_catchpoint_cond_string (const char *excep_string
)
11620 /* The standard exceptions are a special case. They are defined in
11621 runtime units that have been compiled without debugging info; if
11622 EXCEP_STRING is the not-fully-qualified name of a standard
11623 exception (e.g. "constraint_error") then, during the evaluation
11624 of the condition expression, the symbol lookup on this name would
11625 *not* return this standard exception. The catchpoint condition
11626 may then be set only on user-defined exceptions which have the
11627 same not-fully-qualified name (e.g. my_package.constraint_error).
11629 To avoid this unexcepted behavior, these standard exceptions are
11630 systematically prefixed by "standard". This means that "catch
11631 exception constraint_error" is rewritten into "catch exception
11632 standard.constraint_error".
11634 If an exception named contraint_error is defined in another package of
11635 the inferior program, then the only way to specify this exception as a
11636 breakpoint condition is to use its fully-qualified named:
11637 e.g. my_package.constraint_error. */
11639 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
11641 if (strcmp (standard_exc
[i
], excep_string
) == 0)
11643 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
11647 return xstrprintf ("long_integer (e) = long_integer (&%s)", excep_string
);
11650 /* Return the symtab_and_line that should be used to insert an exception
11651 catchpoint of the TYPE kind.
11653 EXCEP_STRING should contain the name of a specific exception that
11654 the catchpoint should catch, or NULL otherwise.
11656 ADDR_STRING returns the name of the function where the real
11657 breakpoint that implements the catchpoints is set, depending on the
11658 type of catchpoint we need to create. */
11660 static struct symtab_and_line
11661 ada_exception_sal (enum exception_catchpoint_kind ex
, char *excep_string
,
11662 char **addr_string
, const struct breakpoint_ops
**ops
)
11664 const char *sym_name
;
11665 struct symbol
*sym
;
11666 struct symtab_and_line sal
;
11668 /* First, find out which exception support info to use. */
11669 ada_exception_support_info_sniffer ();
11671 /* Then lookup the function on which we will break in order to catch
11672 the Ada exceptions requested by the user. */
11674 sym_name
= ada_exception_sym_name (ex
);
11675 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
11677 /* The symbol we're looking up is provided by a unit in the GNAT runtime
11678 that should be compiled with debugging information. As a result, we
11679 expect to find that symbol in the symtabs. If we don't find it, then
11680 the target most likely does not support Ada exceptions, or we cannot
11681 insert exception breakpoints yet, because the GNAT runtime hasn't been
11684 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
11685 in such a way that no debugging information is produced for the symbol
11686 we are looking for. In this case, we could search the minimal symbols
11687 as a fall-back mechanism. This would still be operating in degraded
11688 mode, however, as we would still be missing the debugging information
11689 that is needed in order to extract the name of the exception being
11690 raised (this name is printed in the catchpoint message, and is also
11691 used when trying to catch a specific exception). We do not handle
11692 this case for now. */
11695 error (_("Unable to break on '%s' in this configuration."), sym_name
);
11697 /* Make sure that the symbol we found corresponds to a function. */
11698 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
11699 error (_("Symbol \"%s\" is not a function (class = %d)"),
11700 sym_name
, SYMBOL_CLASS (sym
));
11702 sal
= find_function_start_sal (sym
, 1);
11704 /* Set ADDR_STRING. */
11706 *addr_string
= xstrdup (sym_name
);
11709 *ops
= ada_exception_breakpoint_ops (ex
);
11714 /* Parse the arguments (ARGS) of the "catch exception" command.
11716 If the user asked the catchpoint to catch only a specific
11717 exception, then save the exception name in ADDR_STRING.
11719 See ada_exception_sal for a description of all the remaining
11720 function arguments of this function. */
11722 static struct symtab_and_line
11723 ada_decode_exception_location (char *args
, char **addr_string
,
11724 char **excep_string
,
11725 const struct breakpoint_ops
**ops
)
11727 enum exception_catchpoint_kind ex
;
11729 catch_ada_exception_command_split (args
, &ex
, excep_string
);
11730 return ada_exception_sal (ex
, *excep_string
, addr_string
, ops
);
11733 /* Create an Ada exception catchpoint. */
11736 create_ada_exception_catchpoint (struct gdbarch
*gdbarch
,
11737 struct symtab_and_line sal
,
11739 char *excep_string
,
11740 const struct breakpoint_ops
*ops
,
11744 struct ada_catchpoint
*c
;
11746 c
= XNEW (struct ada_catchpoint
);
11747 init_ada_exception_breakpoint (&c
->base
, gdbarch
, sal
, addr_string
,
11748 ops
, tempflag
, from_tty
);
11749 c
->excep_string
= excep_string
;
11750 create_excep_cond_exprs (c
);
11751 install_breakpoint (0, &c
->base
, 1);
11754 /* Implement the "catch exception" command. */
11757 catch_ada_exception_command (char *arg
, int from_tty
,
11758 struct cmd_list_element
*command
)
11760 struct gdbarch
*gdbarch
= get_current_arch ();
11762 struct symtab_and_line sal
;
11763 char *addr_string
= NULL
;
11764 char *excep_string
= NULL
;
11765 const struct breakpoint_ops
*ops
= NULL
;
11767 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
11771 sal
= ada_decode_exception_location (arg
, &addr_string
, &excep_string
, &ops
);
11772 create_ada_exception_catchpoint (gdbarch
, sal
, addr_string
,
11773 excep_string
, ops
, tempflag
, from_tty
);
11776 static struct symtab_and_line
11777 ada_decode_assert_location (char *args
, char **addr_string
,
11778 const struct breakpoint_ops
**ops
)
11780 /* Check that no argument where provided at the end of the command. */
11784 while (isspace (*args
))
11787 error (_("Junk at end of arguments."));
11790 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, ops
);
11793 /* Implement the "catch assert" command. */
11796 catch_assert_command (char *arg
, int from_tty
,
11797 struct cmd_list_element
*command
)
11799 struct gdbarch
*gdbarch
= get_current_arch ();
11801 struct symtab_and_line sal
;
11802 char *addr_string
= NULL
;
11803 const struct breakpoint_ops
*ops
= NULL
;
11805 tempflag
= get_cmd_context (command
) == CATCH_TEMPORARY
;
11809 sal
= ada_decode_assert_location (arg
, &addr_string
, &ops
);
11810 create_ada_exception_catchpoint (gdbarch
, sal
, addr_string
,
11811 NULL
, ops
, tempflag
, from_tty
);
11814 /* Information about operators given special treatment in functions
11816 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
11818 #define ADA_OPERATORS \
11819 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
11820 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
11821 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
11822 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
11823 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
11824 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
11825 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
11826 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
11827 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
11828 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
11829 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
11830 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
11831 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
11832 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
11833 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
11834 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
11835 OP_DEFN (OP_OTHERS, 1, 1, 0) \
11836 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
11837 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
11840 ada_operator_length (const struct expression
*exp
, int pc
, int *oplenp
,
11843 switch (exp
->elts
[pc
- 1].opcode
)
11846 operator_length_standard (exp
, pc
, oplenp
, argsp
);
11849 #define OP_DEFN(op, len, args, binop) \
11850 case op: *oplenp = len; *argsp = args; break;
11856 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
11861 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
11866 /* Implementation of the exp_descriptor method operator_check. */
11869 ada_operator_check (struct expression
*exp
, int pos
,
11870 int (*objfile_func
) (struct objfile
*objfile
, void *data
),
11873 const union exp_element
*const elts
= exp
->elts
;
11874 struct type
*type
= NULL
;
11876 switch (elts
[pos
].opcode
)
11878 case UNOP_IN_RANGE
:
11880 type
= elts
[pos
+ 1].type
;
11884 return operator_check_standard (exp
, pos
, objfile_func
, data
);
11887 /* Invoke callbacks for TYPE and OBJFILE if they were set as non-NULL. */
11889 if (type
&& TYPE_OBJFILE (type
)
11890 && (*objfile_func
) (TYPE_OBJFILE (type
), data
))
11897 ada_op_name (enum exp_opcode opcode
)
11902 return op_name_standard (opcode
);
11904 #define OP_DEFN(op, len, args, binop) case op: return #op;
11909 return "OP_AGGREGATE";
11911 return "OP_CHOICES";
11917 /* As for operator_length, but assumes PC is pointing at the first
11918 element of the operator, and gives meaningful results only for the
11919 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
11922 ada_forward_operator_length (struct expression
*exp
, int pc
,
11923 int *oplenp
, int *argsp
)
11925 switch (exp
->elts
[pc
].opcode
)
11928 *oplenp
= *argsp
= 0;
11931 #define OP_DEFN(op, len, args, binop) \
11932 case op: *oplenp = len; *argsp = args; break;
11938 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11943 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
11949 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
11951 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
11959 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
11961 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
11966 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
11970 /* Ada attributes ('Foo). */
11973 case OP_ATR_LENGTH
:
11977 case OP_ATR_MODULUS
:
11984 case UNOP_IN_RANGE
:
11986 /* XXX: gdb_sprint_host_address, type_sprint */
11987 fprintf_filtered (stream
, _("Type @"));
11988 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
11989 fprintf_filtered (stream
, " (");
11990 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
11991 fprintf_filtered (stream
, ")");
11993 case BINOP_IN_BOUNDS
:
11994 fprintf_filtered (stream
, " (%d)",
11995 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
11997 case TERNOP_IN_RANGE
:
12002 case OP_DISCRETE_RANGE
:
12003 case OP_POSITIONAL
:
12010 char *name
= &exp
->elts
[elt
+ 2].string
;
12011 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
12013 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
12018 return dump_subexp_body_standard (exp
, stream
, elt
);
12022 for (i
= 0; i
< nargs
; i
+= 1)
12023 elt
= dump_subexp (exp
, stream
, elt
);
12028 /* The Ada extension of print_subexp (q.v.). */
12031 ada_print_subexp (struct expression
*exp
, int *pos
,
12032 struct ui_file
*stream
, enum precedence prec
)
12034 int oplen
, nargs
, i
;
12036 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
12038 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
12045 print_subexp_standard (exp
, pos
, stream
, prec
);
12049 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
12052 case BINOP_IN_BOUNDS
:
12053 /* XXX: sprint_subexp */
12054 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12055 fputs_filtered (" in ", stream
);
12056 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12057 fputs_filtered ("'range", stream
);
12058 if (exp
->elts
[pc
+ 1].longconst
> 1)
12059 fprintf_filtered (stream
, "(%ld)",
12060 (long) exp
->elts
[pc
+ 1].longconst
);
12063 case TERNOP_IN_RANGE
:
12064 if (prec
>= PREC_EQUAL
)
12065 fputs_filtered ("(", stream
);
12066 /* XXX: sprint_subexp */
12067 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12068 fputs_filtered (" in ", stream
);
12069 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
12070 fputs_filtered (" .. ", stream
);
12071 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
12072 if (prec
>= PREC_EQUAL
)
12073 fputs_filtered (")", stream
);
12078 case OP_ATR_LENGTH
:
12082 case OP_ATR_MODULUS
:
12087 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
12089 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
12090 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
12094 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12095 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
12100 for (tem
= 1; tem
< nargs
; tem
+= 1)
12102 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
12103 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
12105 fputs_filtered (")", stream
);
12110 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
12111 fputs_filtered ("'(", stream
);
12112 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
12113 fputs_filtered (")", stream
);
12116 case UNOP_IN_RANGE
:
12117 /* XXX: sprint_subexp */
12118 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12119 fputs_filtered (" in ", stream
);
12120 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
12123 case OP_DISCRETE_RANGE
:
12124 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12125 fputs_filtered ("..", stream
);
12126 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12130 fputs_filtered ("others => ", stream
);
12131 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12135 for (i
= 0; i
< nargs
-1; i
+= 1)
12138 fputs_filtered ("|", stream
);
12139 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12141 fputs_filtered (" => ", stream
);
12142 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12145 case OP_POSITIONAL
:
12146 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12150 fputs_filtered ("(", stream
);
12151 for (i
= 0; i
< nargs
; i
+= 1)
12154 fputs_filtered (", ", stream
);
12155 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
12157 fputs_filtered (")", stream
);
12162 /* Table mapping opcodes into strings for printing operators
12163 and precedences of the operators. */
12165 static const struct op_print ada_op_print_tab
[] = {
12166 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
12167 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
12168 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
12169 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
12170 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
12171 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
12172 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
12173 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
12174 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
12175 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
12176 {">", BINOP_GTR
, PREC_ORDER
, 0},
12177 {"<", BINOP_LESS
, PREC_ORDER
, 0},
12178 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
12179 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
12180 {"+", BINOP_ADD
, PREC_ADD
, 0},
12181 {"-", BINOP_SUB
, PREC_ADD
, 0},
12182 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
12183 {"*", BINOP_MUL
, PREC_MUL
, 0},
12184 {"/", BINOP_DIV
, PREC_MUL
, 0},
12185 {"rem", BINOP_REM
, PREC_MUL
, 0},
12186 {"mod", BINOP_MOD
, PREC_MUL
, 0},
12187 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
12188 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
12189 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
12190 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
12191 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
12192 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
12193 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
12194 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
12195 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
12196 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
12200 enum ada_primitive_types
{
12201 ada_primitive_type_int
,
12202 ada_primitive_type_long
,
12203 ada_primitive_type_short
,
12204 ada_primitive_type_char
,
12205 ada_primitive_type_float
,
12206 ada_primitive_type_double
,
12207 ada_primitive_type_void
,
12208 ada_primitive_type_long_long
,
12209 ada_primitive_type_long_double
,
12210 ada_primitive_type_natural
,
12211 ada_primitive_type_positive
,
12212 ada_primitive_type_system_address
,
12213 nr_ada_primitive_types
12217 ada_language_arch_info (struct gdbarch
*gdbarch
,
12218 struct language_arch_info
*lai
)
12220 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
12222 lai
->primitive_type_vector
12223 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
12226 lai
->primitive_type_vector
[ada_primitive_type_int
]
12227 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12229 lai
->primitive_type_vector
[ada_primitive_type_long
]
12230 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
12231 0, "long_integer");
12232 lai
->primitive_type_vector
[ada_primitive_type_short
]
12233 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
12234 0, "short_integer");
12235 lai
->string_char_type
12236 = lai
->primitive_type_vector
[ada_primitive_type_char
]
12237 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
12238 lai
->primitive_type_vector
[ada_primitive_type_float
]
12239 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
12241 lai
->primitive_type_vector
[ada_primitive_type_double
]
12242 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12243 "long_float", NULL
);
12244 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
12245 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
12246 0, "long_long_integer");
12247 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
12248 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
12249 "long_long_float", NULL
);
12250 lai
->primitive_type_vector
[ada_primitive_type_natural
]
12251 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12253 lai
->primitive_type_vector
[ada_primitive_type_positive
]
12254 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
12256 lai
->primitive_type_vector
[ada_primitive_type_void
]
12257 = builtin
->builtin_void
;
12259 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
12260 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
12261 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
12262 = "system__address";
12264 lai
->bool_type_symbol
= NULL
;
12265 lai
->bool_type_default
= builtin
->builtin_bool
;
12268 /* Language vector */
12270 /* Not really used, but needed in the ada_language_defn. */
12273 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
12275 ada_emit_char (c
, type
, stream
, quoter
, 1);
12281 warnings_issued
= 0;
12282 return ada_parse ();
12285 static const struct exp_descriptor ada_exp_descriptor
= {
12287 ada_operator_length
,
12288 ada_operator_check
,
12290 ada_dump_subexp_body
,
12291 ada_evaluate_subexp
12294 const struct language_defn ada_language_defn
= {
12295 "ada", /* Language name */
12299 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
12300 that's not quite what this means. */
12302 macro_expansion_no
,
12303 &ada_exp_descriptor
,
12307 ada_printchar
, /* Print a character constant */
12308 ada_printstr
, /* Function to print string constant */
12309 emit_char
, /* Function to print single char (not used) */
12310 ada_print_type
, /* Print a type using appropriate syntax */
12311 ada_print_typedef
, /* Print a typedef using appropriate syntax */
12312 ada_val_print
, /* Print a value using appropriate syntax */
12313 ada_value_print
, /* Print a top-level value */
12314 NULL
, /* Language specific skip_trampoline */
12315 NULL
, /* name_of_this */
12316 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
12317 basic_lookup_transparent_type
, /* lookup_transparent_type */
12318 ada_la_decode
, /* Language specific symbol demangler */
12319 NULL
, /* Language specific
12320 class_name_from_physname */
12321 ada_op_print_tab
, /* expression operators for printing */
12322 0, /* c-style arrays */
12323 1, /* String lower bound */
12324 ada_get_gdb_completer_word_break_characters
,
12325 ada_make_symbol_completion_list
,
12326 ada_language_arch_info
,
12327 ada_print_array_index
,
12328 default_pass_by_reference
,
12331 ada_iterate_over_symbols
,
12335 /* Provide a prototype to silence -Wmissing-prototypes. */
12336 extern initialize_file_ftype _initialize_ada_language
;
12338 /* Command-list for the "set/show ada" prefix command. */
12339 static struct cmd_list_element
*set_ada_list
;
12340 static struct cmd_list_element
*show_ada_list
;
12342 /* Implement the "set ada" prefix command. */
12345 set_ada_command (char *arg
, int from_tty
)
12347 printf_unfiltered (_(\
12348 "\"set ada\" must be followed by the name of a setting.\n"));
12349 help_list (set_ada_list
, "set ada ", -1, gdb_stdout
);
12352 /* Implement the "show ada" prefix command. */
12355 show_ada_command (char *args
, int from_tty
)
12357 cmd_show_list (show_ada_list
, from_tty
, "");
12361 initialize_ada_catchpoint_ops (void)
12363 struct breakpoint_ops
*ops
;
12365 initialize_breakpoint_ops ();
12367 ops
= &catch_exception_breakpoint_ops
;
12368 *ops
= bkpt_breakpoint_ops
;
12369 ops
->dtor
= dtor_catch_exception
;
12370 ops
->allocate_location
= allocate_location_catch_exception
;
12371 ops
->re_set
= re_set_catch_exception
;
12372 ops
->check_status
= check_status_catch_exception
;
12373 ops
->print_it
= print_it_catch_exception
;
12374 ops
->print_one
= print_one_catch_exception
;
12375 ops
->print_mention
= print_mention_catch_exception
;
12376 ops
->print_recreate
= print_recreate_catch_exception
;
12378 ops
= &catch_exception_unhandled_breakpoint_ops
;
12379 *ops
= bkpt_breakpoint_ops
;
12380 ops
->dtor
= dtor_catch_exception_unhandled
;
12381 ops
->allocate_location
= allocate_location_catch_exception_unhandled
;
12382 ops
->re_set
= re_set_catch_exception_unhandled
;
12383 ops
->check_status
= check_status_catch_exception_unhandled
;
12384 ops
->print_it
= print_it_catch_exception_unhandled
;
12385 ops
->print_one
= print_one_catch_exception_unhandled
;
12386 ops
->print_mention
= print_mention_catch_exception_unhandled
;
12387 ops
->print_recreate
= print_recreate_catch_exception_unhandled
;
12389 ops
= &catch_assert_breakpoint_ops
;
12390 *ops
= bkpt_breakpoint_ops
;
12391 ops
->dtor
= dtor_catch_assert
;
12392 ops
->allocate_location
= allocate_location_catch_assert
;
12393 ops
->re_set
= re_set_catch_assert
;
12394 ops
->check_status
= check_status_catch_assert
;
12395 ops
->print_it
= print_it_catch_assert
;
12396 ops
->print_one
= print_one_catch_assert
;
12397 ops
->print_mention
= print_mention_catch_assert
;
12398 ops
->print_recreate
= print_recreate_catch_assert
;
12402 _initialize_ada_language (void)
12404 add_language (&ada_language_defn
);
12406 initialize_ada_catchpoint_ops ();
12408 add_prefix_cmd ("ada", no_class
, set_ada_command
,
12409 _("Prefix command for changing Ada-specfic settings"),
12410 &set_ada_list
, "set ada ", 0, &setlist
);
12412 add_prefix_cmd ("ada", no_class
, show_ada_command
,
12413 _("Generic command for showing Ada-specific settings."),
12414 &show_ada_list
, "show ada ", 0, &showlist
);
12416 add_setshow_boolean_cmd ("trust-PAD-over-XVS", class_obscure
,
12417 &trust_pad_over_xvs
, _("\
12418 Enable or disable an optimization trusting PAD types over XVS types"), _("\
12419 Show whether an optimization trusting PAD types over XVS types is activated"),
12421 This is related to the encoding used by the GNAT compiler. The debugger\n\
12422 should normally trust the contents of PAD types, but certain older versions\n\
12423 of GNAT have a bug that sometimes causes the information in the PAD type\n\
12424 to be incorrect. Turning this setting \"off\" allows the debugger to\n\
12425 work around this bug. It is always safe to turn this option \"off\", but\n\
12426 this incurs a slight performance penalty, so it is recommended to NOT change\n\
12427 this option to \"off\" unless necessary."),
12428 NULL
, NULL
, &set_ada_list
, &show_ada_list
);
12430 add_catch_command ("exception", _("\
12431 Catch Ada exceptions, when raised.\n\
12432 With an argument, catch only exceptions with the given name."),
12433 catch_ada_exception_command
,
12437 add_catch_command ("assert", _("\
12438 Catch failed Ada assertions, when raised.\n\
12439 With an argument, catch only exceptions with the given name."),
12440 catch_assert_command
,
12445 varsize_limit
= 65536;
12447 obstack_init (&symbol_list_obstack
);
12449 decoded_names_store
= htab_create_alloc
12450 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
12451 NULL
, xcalloc
, xfree
);
12453 observer_attach_executable_changed (ada_executable_changed_observer
);
12455 /* Setup per-inferior data. */
12456 observer_attach_inferior_exit (ada_inferior_exit
);
12458 = register_inferior_data_with_cleanup (ada_inferior_data_cleanup
);