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"
60 /* Define whether or not the C operator '/' truncates towards zero for
61 differently signed operands (truncation direction is undefined in C).
62 Copied from valarith.c. */
64 #ifndef TRUNCATION_TOWARDS_ZERO
65 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
68 static void extract_string (CORE_ADDR addr
, char *buf
);
70 static void modify_general_field (struct type
*, char *, LONGEST
, int, int);
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_target_type (struct type
*);
84 static struct value
*desc_data (struct value
*);
86 static int fat_pntr_data_bitpos (struct type
*);
88 static int fat_pntr_data_bitsize (struct type
*);
90 static struct value
*desc_one_bound (struct value
*, int, int);
92 static int desc_bound_bitpos (struct type
*, int, int);
94 static int desc_bound_bitsize (struct type
*, int, int);
96 static struct type
*desc_index_type (struct type
*, int);
98 static int desc_arity (struct type
*);
100 static int ada_type_match (struct type
*, struct type
*, int);
102 static int ada_args_match (struct symbol
*, struct value
**, int);
104 static struct value
*ensure_lval (struct value
*,
105 struct gdbarch
*, CORE_ADDR
*);
107 static struct value
*make_array_descriptor (struct type
*, struct value
*,
108 struct gdbarch
*, CORE_ADDR
*);
110 static void ada_add_block_symbols (struct obstack
*,
111 struct block
*, const char *,
112 domain_enum
, struct objfile
*, int);
114 static int is_nonfunction (struct ada_symbol_info
*, int);
116 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
119 static int num_defns_collected (struct obstack
*);
121 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
123 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
124 *, const char *, int,
127 static struct value
*resolve_subexp (struct expression
**, int *, int,
130 static void replace_operator_with_call (struct expression
**, int, int, int,
131 struct symbol
*, struct block
*);
133 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
135 static char *ada_op_name (enum exp_opcode
);
137 static const char *ada_decoded_op_name (enum exp_opcode
);
139 static int numeric_type_p (struct type
*);
141 static int integer_type_p (struct type
*);
143 static int scalar_type_p (struct type
*);
145 static int discrete_type_p (struct type
*);
147 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
152 static struct symbol
*find_old_style_renaming_symbol (const char *,
155 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
158 static struct value
*evaluate_subexp_type (struct expression
*, int *);
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 (char *, struct value
*,
171 static struct type
*to_static_fixed_type (struct type
*);
172 static struct type
*static_unwrap_type (struct type
*type
);
174 static struct value
*unwrap_value (struct value
*);
176 static struct type
*constrained_packed_array_type (struct type
*, long *);
178 static struct type
*decode_constrained_packed_array_type (struct type
*);
180 static long decode_packed_array_bitsize (struct type
*);
182 static struct value
*decode_constrained_packed_array (struct value
*);
184 static int ada_is_packed_array_type (struct type
*);
186 static int ada_is_unconstrained_packed_array_type (struct type
*);
188 static struct value
*value_subscript_packed (struct value
*, int,
191 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int, int);
193 static struct value
*coerce_unspec_val_to_type (struct value
*,
196 static struct value
*get_var_value (char *, char *);
198 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
200 static int equiv_types (struct type
*, struct type
*);
202 static int is_name_suffix (const char *);
204 static int wild_match (const char *, int, const char *);
206 static struct value
*ada_coerce_ref (struct value
*);
208 static LONGEST
pos_atr (struct value
*);
210 static struct value
*value_pos_atr (struct type
*, struct value
*);
212 static struct value
*value_val_atr (struct type
*, struct value
*);
214 static struct symbol
*standard_lookup (const char *, const struct block
*,
217 static struct value
*ada_search_struct_field (char *, struct value
*, int,
220 static struct value
*ada_value_primitive_field (struct value
*, int, int,
223 static int find_struct_field (char *, struct type
*, int,
224 struct type
**, int *, int *, int *, int *);
226 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
229 static struct value
*ada_to_fixed_value (struct value
*);
231 static int ada_resolve_function (struct ada_symbol_info
*, int,
232 struct value
**, int, const char *,
235 static struct value
*ada_coerce_to_simple_array (struct value
*);
237 static int ada_is_direct_array_type (struct type
*);
239 static void ada_language_arch_info (struct gdbarch
*,
240 struct language_arch_info
*);
242 static void check_size (const struct type
*);
244 static struct value
*ada_index_struct_field (int, struct value
*, int,
247 static struct value
*assign_aggregate (struct value
*, struct value
*,
248 struct expression
*, int *, enum noside
);
250 static void aggregate_assign_from_choices (struct value
*, struct value
*,
252 int *, LONGEST
*, int *,
253 int, LONGEST
, LONGEST
);
255 static void aggregate_assign_positional (struct value
*, struct value
*,
257 int *, LONGEST
*, int *, int,
261 static void aggregate_assign_others (struct value
*, struct value
*,
263 int *, LONGEST
*, int, LONGEST
, LONGEST
);
266 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
269 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
272 static void ada_forward_operator_length (struct expression
*, int, int *,
277 /* Maximum-sized dynamic type. */
278 static unsigned int varsize_limit
;
280 /* FIXME: brobecker/2003-09-17: No longer a const because it is
281 returned by a function that does not return a const char *. */
282 static char *ada_completer_word_break_characters
=
284 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
286 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
289 /* The name of the symbol to use to get the name of the main subprogram. */
290 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
291 = "__gnat_ada_main_program_name";
293 /* Limit on the number of warnings to raise per expression evaluation. */
294 static int warning_limit
= 2;
296 /* Number of warning messages issued; reset to 0 by cleanups after
297 expression evaluation. */
298 static int warnings_issued
= 0;
300 static const char *known_runtime_file_name_patterns
[] = {
301 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
304 static const char *known_auxiliary_function_name_patterns
[] = {
305 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
308 /* Space for allocating results of ada_lookup_symbol_list. */
309 static struct obstack symbol_list_obstack
;
313 /* Given DECODED_NAME a string holding a symbol name in its
314 decoded form (ie using the Ada dotted notation), returns
315 its unqualified name. */
318 ada_unqualified_name (const char *decoded_name
)
320 const char *result
= strrchr (decoded_name
, '.');
323 result
++; /* Skip the dot... */
325 result
= decoded_name
;
330 /* Return a string starting with '<', followed by STR, and '>'.
331 The result is good until the next call. */
334 add_angle_brackets (const char *str
)
336 static char *result
= NULL
;
339 result
= xstrprintf ("<%s>", str
);
344 ada_get_gdb_completer_word_break_characters (void)
346 return ada_completer_word_break_characters
;
349 /* Print an array element index using the Ada syntax. */
352 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
353 const struct value_print_options
*options
)
355 LA_VALUE_PRINT (index_value
, stream
, options
);
356 fprintf_filtered (stream
, " => ");
359 /* Read the string located at ADDR from the inferior and store the
363 extract_string (CORE_ADDR addr
, char *buf
)
367 /* Loop, reading one byte at a time, until we reach the '\000'
368 end-of-string marker. */
371 target_read_memory (addr
+ char_index
* sizeof (char),
372 buf
+ char_index
* sizeof (char), sizeof (char));
375 while (buf
[char_index
- 1] != '\000');
378 /* Assuming VECT points to an array of *SIZE objects of size
379 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
380 updating *SIZE as necessary and returning the (new) array. */
383 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
385 if (*size
< min_size
)
388 if (*size
< min_size
)
390 vect
= xrealloc (vect
, *size
* element_size
);
395 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
396 suffix of FIELD_NAME beginning "___". */
399 field_name_match (const char *field_name
, const char *target
)
401 int len
= strlen (target
);
403 (strncmp (field_name
, target
, len
) == 0
404 && (field_name
[len
] == '\0'
405 || (strncmp (field_name
+ len
, "___", 3) == 0
406 && strcmp (field_name
+ strlen (field_name
) - 6,
411 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
412 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
413 and return its index. This function also handles fields whose name
414 have ___ suffixes because the compiler sometimes alters their name
415 by adding such a suffix to represent fields with certain constraints.
416 If the field could not be found, return a negative number if
417 MAYBE_MISSING is set. Otherwise raise an error. */
420 ada_get_field_index (const struct type
*type
, const char *field_name
,
424 struct type
*struct_type
= check_typedef ((struct type
*) type
);
426 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
427 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
431 error (_("Unable to find field %s in struct %s. Aborting"),
432 field_name
, TYPE_NAME (struct_type
));
437 /* The length of the prefix of NAME prior to any "___" suffix. */
440 ada_name_prefix_len (const char *name
)
446 const char *p
= strstr (name
, "___");
448 return strlen (name
);
454 /* Return non-zero if SUFFIX is a suffix of STR.
455 Return zero if STR is null. */
458 is_suffix (const char *str
, const char *suffix
)
464 len2
= strlen (suffix
);
465 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
468 /* The contents of value VAL, treated as a value of type TYPE. The
469 result is an lval in memory if VAL is. */
471 static struct value
*
472 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
474 type
= ada_check_typedef (type
);
475 if (value_type (val
) == type
)
479 struct value
*result
;
481 /* Make sure that the object size is not unreasonable before
482 trying to allocate some memory for it. */
485 result
= allocate_value (type
);
486 set_value_component_location (result
, val
);
487 set_value_bitsize (result
, value_bitsize (val
));
488 set_value_bitpos (result
, value_bitpos (val
));
489 set_value_address (result
, value_address (val
));
491 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
492 set_value_lazy (result
, 1);
494 memcpy (value_contents_raw (result
), value_contents (val
),
500 static const gdb_byte
*
501 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
506 return valaddr
+ offset
;
510 cond_offset_target (CORE_ADDR address
, long offset
)
515 return address
+ offset
;
518 /* Issue a warning (as for the definition of warning in utils.c, but
519 with exactly one argument rather than ...), unless the limit on the
520 number of warnings has passed during the evaluation of the current
523 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
524 provided by "complaint". */
525 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
528 lim_warning (const char *format
, ...)
531 va_start (args
, format
);
533 warnings_issued
+= 1;
534 if (warnings_issued
<= warning_limit
)
535 vwarning (format
, args
);
540 /* Issue an error if the size of an object of type T is unreasonable,
541 i.e. if it would be a bad idea to allocate a value of this type in
545 check_size (const struct type
*type
)
547 if (TYPE_LENGTH (type
) > varsize_limit
)
548 error (_("object size is larger than varsize-limit"));
552 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
553 gdbtypes.h, but some of the necessary definitions in that file
554 seem to have gone missing. */
556 /* Maximum value of a SIZE-byte signed integer type. */
558 max_of_size (int size
)
560 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
561 return top_bit
| (top_bit
- 1);
564 /* Minimum value of a SIZE-byte signed integer type. */
566 min_of_size (int size
)
568 return -max_of_size (size
) - 1;
571 /* Maximum value of a SIZE-byte unsigned integer type. */
573 umax_of_size (int size
)
575 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
576 return top_bit
| (top_bit
- 1);
579 /* Maximum value of integral type T, as a signed quantity. */
581 max_of_type (struct type
*t
)
583 if (TYPE_UNSIGNED (t
))
584 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
586 return max_of_size (TYPE_LENGTH (t
));
589 /* Minimum value of integral type T, as a signed quantity. */
591 min_of_type (struct type
*t
)
593 if (TYPE_UNSIGNED (t
))
596 return min_of_size (TYPE_LENGTH (t
));
599 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
601 discrete_type_high_bound (struct type
*type
)
603 switch (TYPE_CODE (type
))
605 case TYPE_CODE_RANGE
:
606 return TYPE_HIGH_BOUND (type
);
608 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
613 return max_of_type (type
);
615 error (_("Unexpected type in discrete_type_high_bound."));
619 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
621 discrete_type_low_bound (struct type
*type
)
623 switch (TYPE_CODE (type
))
625 case TYPE_CODE_RANGE
:
626 return TYPE_LOW_BOUND (type
);
628 return TYPE_FIELD_BITPOS (type
, 0);
633 return min_of_type (type
);
635 error (_("Unexpected type in discrete_type_low_bound."));
639 /* The identity on non-range types. For range types, the underlying
640 non-range scalar type. */
643 base_type (struct type
*type
)
645 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
647 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
649 type
= TYPE_TARGET_TYPE (type
);
655 /* Language Selection */
657 /* If the main program is in Ada, return language_ada, otherwise return LANG
658 (the main program is in Ada iif the adainit symbol is found).
660 MAIN_PST is not used. */
663 ada_update_initial_language (enum language lang
,
664 struct partial_symtab
*main_pst
)
666 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
667 (struct objfile
*) NULL
) != NULL
)
673 /* If the main procedure is written in Ada, then return its name.
674 The result is good until the next call. Return NULL if the main
675 procedure doesn't appear to be in Ada. */
680 struct minimal_symbol
*msym
;
681 static char *main_program_name
= NULL
;
683 /* For Ada, the name of the main procedure is stored in a specific
684 string constant, generated by the binder. Look for that symbol,
685 extract its address, and then read that string. If we didn't find
686 that string, then most probably the main procedure is not written
688 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
692 CORE_ADDR main_program_name_addr
;
695 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
696 if (main_program_name_addr
== 0)
697 error (_("Invalid address for Ada main program name."));
699 xfree (main_program_name
);
700 target_read_string (main_program_name_addr
, &main_program_name
,
705 return main_program_name
;
708 /* The main procedure doesn't seem to be in Ada. */
714 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
717 const struct ada_opname_map ada_opname_table
[] = {
718 {"Oadd", "\"+\"", BINOP_ADD
},
719 {"Osubtract", "\"-\"", BINOP_SUB
},
720 {"Omultiply", "\"*\"", BINOP_MUL
},
721 {"Odivide", "\"/\"", BINOP_DIV
},
722 {"Omod", "\"mod\"", BINOP_MOD
},
723 {"Orem", "\"rem\"", BINOP_REM
},
724 {"Oexpon", "\"**\"", BINOP_EXP
},
725 {"Olt", "\"<\"", BINOP_LESS
},
726 {"Ole", "\"<=\"", BINOP_LEQ
},
727 {"Ogt", "\">\"", BINOP_GTR
},
728 {"Oge", "\">=\"", BINOP_GEQ
},
729 {"Oeq", "\"=\"", BINOP_EQUAL
},
730 {"One", "\"/=\"", BINOP_NOTEQUAL
},
731 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
732 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
733 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
734 {"Oconcat", "\"&\"", BINOP_CONCAT
},
735 {"Oabs", "\"abs\"", UNOP_ABS
},
736 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
737 {"Oadd", "\"+\"", UNOP_PLUS
},
738 {"Osubtract", "\"-\"", UNOP_NEG
},
742 /* The "encoded" form of DECODED, according to GNAT conventions.
743 The result is valid until the next call to ada_encode. */
746 ada_encode (const char *decoded
)
748 static char *encoding_buffer
= NULL
;
749 static size_t encoding_buffer_size
= 0;
756 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
757 2 * strlen (decoded
) + 10);
760 for (p
= decoded
; *p
!= '\0'; p
+= 1)
764 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
769 const struct ada_opname_map
*mapping
;
771 for (mapping
= ada_opname_table
;
772 mapping
->encoded
!= NULL
773 && strncmp (mapping
->decoded
, p
,
774 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
776 if (mapping
->encoded
== NULL
)
777 error (_("invalid Ada operator name: %s"), p
);
778 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
779 k
+= strlen (mapping
->encoded
);
784 encoding_buffer
[k
] = *p
;
789 encoding_buffer
[k
] = '\0';
790 return encoding_buffer
;
793 /* Return NAME folded to lower case, or, if surrounded by single
794 quotes, unfolded, but with the quotes stripped away. Result good
798 ada_fold_name (const char *name
)
800 static char *fold_buffer
= NULL
;
801 static size_t fold_buffer_size
= 0;
803 int len
= strlen (name
);
804 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
808 strncpy (fold_buffer
, name
+ 1, len
- 2);
809 fold_buffer
[len
- 2] = '\000';
814 for (i
= 0; i
<= len
; i
+= 1)
815 fold_buffer
[i
] = tolower (name
[i
]);
821 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
824 is_lower_alphanum (const char c
)
826 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
829 /* Remove either of these suffixes:
834 These are suffixes introduced by the compiler for entities such as
835 nested subprogram for instance, in order to avoid name clashes.
836 They do not serve any purpose for the debugger. */
839 ada_remove_trailing_digits (const char *encoded
, int *len
)
841 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
844 while (i
> 0 && isdigit (encoded
[i
]))
846 if (i
>= 0 && encoded
[i
] == '.')
848 else if (i
>= 0 && encoded
[i
] == '$')
850 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
852 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
857 /* Remove the suffix introduced by the compiler for protected object
861 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
863 /* Remove trailing N. */
865 /* Protected entry subprograms are broken into two
866 separate subprograms: The first one is unprotected, and has
867 a 'N' suffix; the second is the protected version, and has
868 the 'P' suffix. The second calls the first one after handling
869 the protection. Since the P subprograms are internally generated,
870 we leave these names undecoded, giving the user a clue that this
871 entity is internal. */
874 && encoded
[*len
- 1] == 'N'
875 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
879 /* Remove trailing X[bn]* suffixes (indicating names in package bodies). */
882 ada_remove_Xbn_suffix (const char *encoded
, int *len
)
886 while (i
> 0 && (encoded
[i
] == 'b' || encoded
[i
] == 'n'))
889 if (encoded
[i
] != 'X')
895 if (isalnum (encoded
[i
-1]))
899 /* If ENCODED follows the GNAT entity encoding conventions, then return
900 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
903 The resulting string is valid until the next call of ada_decode.
904 If the string is unchanged by decoding, the original string pointer
908 ada_decode (const char *encoded
)
915 static char *decoding_buffer
= NULL
;
916 static size_t decoding_buffer_size
= 0;
918 /* The name of the Ada main procedure starts with "_ada_".
919 This prefix is not part of the decoded name, so skip this part
920 if we see this prefix. */
921 if (strncmp (encoded
, "_ada_", 5) == 0)
924 /* If the name starts with '_', then it is not a properly encoded
925 name, so do not attempt to decode it. Similarly, if the name
926 starts with '<', the name should not be decoded. */
927 if (encoded
[0] == '_' || encoded
[0] == '<')
930 len0
= strlen (encoded
);
932 ada_remove_trailing_digits (encoded
, &len0
);
933 ada_remove_po_subprogram_suffix (encoded
, &len0
);
935 /* Remove the ___X.* suffix if present. Do not forget to verify that
936 the suffix is located before the current "end" of ENCODED. We want
937 to avoid re-matching parts of ENCODED that have previously been
938 marked as discarded (by decrementing LEN0). */
939 p
= strstr (encoded
, "___");
940 if (p
!= NULL
&& p
- encoded
< len0
- 3)
948 /* Remove any trailing TKB suffix. It tells us that this symbol
949 is for the body of a task, but that information does not actually
950 appear in the decoded name. */
952 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
955 /* Remove any trailing TB suffix. The TB suffix is slightly different
956 from the TKB suffix because it is used for non-anonymous task
959 if (len0
> 2 && strncmp (encoded
+ len0
- 2, "TB", 2) == 0)
962 /* Remove trailing "B" suffixes. */
963 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
965 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
968 /* Make decoded big enough for possible expansion by operator name. */
970 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
971 decoded
= decoding_buffer
;
973 /* Remove trailing __{digit}+ or trailing ${digit}+. */
975 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
978 while ((i
>= 0 && isdigit (encoded
[i
]))
979 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
981 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
983 else if (encoded
[i
] == '$')
987 /* The first few characters that are not alphabetic are not part
988 of any encoding we use, so we can copy them over verbatim. */
990 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
991 decoded
[j
] = encoded
[i
];
996 /* Is this a symbol function? */
997 if (at_start_name
&& encoded
[i
] == 'O')
1000 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1002 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1003 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1005 && !isalnum (encoded
[i
+ op_len
]))
1007 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1010 j
+= strlen (ada_opname_table
[k
].decoded
);
1014 if (ada_opname_table
[k
].encoded
!= NULL
)
1019 /* Replace "TK__" with "__", which will eventually be translated
1020 into "." (just below). */
1022 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1025 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1026 be translated into "." (just below). These are internal names
1027 generated for anonymous blocks inside which our symbol is nested. */
1029 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1030 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1031 && isdigit (encoded
[i
+4]))
1035 while (k
< len0
&& isdigit (encoded
[k
]))
1036 k
++; /* Skip any extra digit. */
1038 /* Double-check that the "__B_{DIGITS}+" sequence we found
1039 is indeed followed by "__". */
1040 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1044 /* Remove _E{DIGITS}+[sb] */
1046 /* Just as for protected object subprograms, there are 2 categories
1047 of subprograms created by the compiler for each entry. The first
1048 one implements the actual entry code, and has a suffix following
1049 the convention above; the second one implements the barrier and
1050 uses the same convention as above, except that the 'E' is replaced
1053 Just as above, we do not decode the name of barrier functions
1054 to give the user a clue that the code he is debugging has been
1055 internally generated. */
1057 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1058 && isdigit (encoded
[i
+2]))
1062 while (k
< len0
&& isdigit (encoded
[k
]))
1066 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1069 /* Just as an extra precaution, make sure that if this
1070 suffix is followed by anything else, it is a '_'.
1071 Otherwise, we matched this sequence by accident. */
1073 || (k
< len0
&& encoded
[k
] == '_'))
1078 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1079 the GNAT front-end in protected object subprograms. */
1082 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1084 /* Backtrack a bit up until we reach either the begining of
1085 the encoded name, or "__". Make sure that we only find
1086 digits or lowercase characters. */
1087 const char *ptr
= encoded
+ i
- 1;
1089 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1092 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1096 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1098 /* This is a X[bn]* sequence not separated from the previous
1099 part of the name with a non-alpha-numeric character (in other
1100 words, immediately following an alpha-numeric character), then
1101 verify that it is placed at the end of the encoded name. If
1102 not, then the encoding is not valid and we should abort the
1103 decoding. Otherwise, just skip it, it is used in body-nested
1107 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1111 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1113 /* Replace '__' by '.'. */
1121 /* It's a character part of the decoded name, so just copy it
1123 decoded
[j
] = encoded
[i
];
1128 decoded
[j
] = '\000';
1130 /* Decoded names should never contain any uppercase character.
1131 Double-check this, and abort the decoding if we find one. */
1133 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1134 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1137 if (strcmp (decoded
, encoded
) == 0)
1143 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1144 decoded
= decoding_buffer
;
1145 if (encoded
[0] == '<')
1146 strcpy (decoded
, encoded
);
1148 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1153 /* Table for keeping permanent unique copies of decoded names. Once
1154 allocated, names in this table are never released. While this is a
1155 storage leak, it should not be significant unless there are massive
1156 changes in the set of decoded names in successive versions of a
1157 symbol table loaded during a single session. */
1158 static struct htab
*decoded_names_store
;
1160 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1161 in the language-specific part of GSYMBOL, if it has not been
1162 previously computed. Tries to save the decoded name in the same
1163 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1164 in any case, the decoded symbol has a lifetime at least that of
1166 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1167 const, but nevertheless modified to a semantically equivalent form
1168 when a decoded name is cached in it.
1172 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1175 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1176 if (*resultp
== NULL
)
1178 const char *decoded
= ada_decode (gsymbol
->name
);
1179 if (gsymbol
->obj_section
!= NULL
)
1181 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1182 *resultp
= obsavestring (decoded
, strlen (decoded
),
1183 &objf
->objfile_obstack
);
1185 /* Sometimes, we can't find a corresponding objfile, in which
1186 case, we put the result on the heap. Since we only decode
1187 when needed, we hope this usually does not cause a
1188 significant memory leak (FIXME). */
1189 if (*resultp
== NULL
)
1191 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1194 *slot
= xstrdup (decoded
);
1203 ada_la_decode (const char *encoded
, int options
)
1205 return xstrdup (ada_decode (encoded
));
1208 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1209 suffixes that encode debugging information or leading _ada_ on
1210 SYM_NAME (see is_name_suffix commentary for the debugging
1211 information that is ignored). If WILD, then NAME need only match a
1212 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1213 either argument is NULL. */
1216 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1218 if (sym_name
== NULL
|| name
== NULL
)
1221 return wild_match (name
, strlen (name
), sym_name
);
1224 int len_name
= strlen (name
);
1225 return (strncmp (sym_name
, name
, len_name
) == 0
1226 && is_name_suffix (sym_name
+ len_name
))
1227 || (strncmp (sym_name
, "_ada_", 5) == 0
1228 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1229 && is_name_suffix (sym_name
+ len_name
+ 5));
1236 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1238 static char *bound_name
[] = {
1239 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1240 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1243 /* Maximum number of array dimensions we are prepared to handle. */
1245 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1247 /* Like modify_field, but allows bitpos > wordlength. */
1250 modify_general_field (struct type
*type
, char *addr
,
1251 LONGEST fieldval
, int bitpos
, int bitsize
)
1253 modify_field (type
, addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1257 /* The desc_* routines return primitive portions of array descriptors
1260 /* The descriptor or array type, if any, indicated by TYPE; removes
1261 level of indirection, if needed. */
1263 static struct type
*
1264 desc_base_type (struct type
*type
)
1268 type
= ada_check_typedef (type
);
1270 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1271 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1272 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1277 /* True iff TYPE indicates a "thin" array pointer type. */
1280 is_thin_pntr (struct type
*type
)
1283 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1284 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1287 /* The descriptor type for thin pointer type TYPE. */
1289 static struct type
*
1290 thin_descriptor_type (struct type
*type
)
1292 struct type
*base_type
= desc_base_type (type
);
1293 if (base_type
== NULL
)
1295 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1299 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1300 if (alt_type
== NULL
)
1307 /* A pointer to the array data for thin-pointer value VAL. */
1309 static struct value
*
1310 thin_data_pntr (struct value
*val
)
1312 struct type
*type
= value_type (val
);
1313 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1314 data_type
= lookup_pointer_type (data_type
);
1316 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1317 return value_cast (data_type
, value_copy (val
));
1319 return value_from_longest (data_type
, value_address (val
));
1322 /* True iff TYPE indicates a "thick" array pointer type. */
1325 is_thick_pntr (struct type
*type
)
1327 type
= desc_base_type (type
);
1328 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1329 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1332 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1333 pointer to one, the type of its bounds data; otherwise, NULL. */
1335 static struct type
*
1336 desc_bounds_type (struct type
*type
)
1340 type
= desc_base_type (type
);
1344 else if (is_thin_pntr (type
))
1346 type
= thin_descriptor_type (type
);
1349 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1351 return ada_check_typedef (r
);
1353 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1355 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1357 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1362 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1363 one, a pointer to its bounds data. Otherwise NULL. */
1365 static struct value
*
1366 desc_bounds (struct value
*arr
)
1368 struct type
*type
= ada_check_typedef (value_type (arr
));
1369 if (is_thin_pntr (type
))
1371 struct type
*bounds_type
=
1372 desc_bounds_type (thin_descriptor_type (type
));
1375 if (bounds_type
== NULL
)
1376 error (_("Bad GNAT array descriptor"));
1378 /* NOTE: The following calculation is not really kosher, but
1379 since desc_type is an XVE-encoded type (and shouldn't be),
1380 the correct calculation is a real pain. FIXME (and fix GCC). */
1381 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1382 addr
= value_as_long (arr
);
1384 addr
= value_address (arr
);
1387 value_from_longest (lookup_pointer_type (bounds_type
),
1388 addr
- TYPE_LENGTH (bounds_type
));
1391 else if (is_thick_pntr (type
))
1392 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1393 _("Bad GNAT array descriptor"));
1398 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1399 position of the field containing the address of the bounds data. */
1402 fat_pntr_bounds_bitpos (struct type
*type
)
1404 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1407 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1408 size of the field containing the address of the bounds data. */
1411 fat_pntr_bounds_bitsize (struct type
*type
)
1413 type
= desc_base_type (type
);
1415 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1416 return TYPE_FIELD_BITSIZE (type
, 1);
1418 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1421 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1422 pointer to one, the type of its array data (a array-with-no-bounds type);
1423 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1426 static struct type
*
1427 desc_data_target_type (struct type
*type
)
1429 type
= desc_base_type (type
);
1431 /* NOTE: The following is bogus; see comment in desc_bounds. */
1432 if (is_thin_pntr (type
))
1433 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1434 else if (is_thick_pntr (type
))
1436 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1439 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1440 return TYPE_TARGET_TYPE (data_type
);
1446 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1449 static struct value
*
1450 desc_data (struct value
*arr
)
1452 struct type
*type
= value_type (arr
);
1453 if (is_thin_pntr (type
))
1454 return thin_data_pntr (arr
);
1455 else if (is_thick_pntr (type
))
1456 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1457 _("Bad GNAT array descriptor"));
1463 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1464 position of the field containing the address of the data. */
1467 fat_pntr_data_bitpos (struct type
*type
)
1469 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1472 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1473 size of the field containing the address of the data. */
1476 fat_pntr_data_bitsize (struct type
*type
)
1478 type
= desc_base_type (type
);
1480 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1481 return TYPE_FIELD_BITSIZE (type
, 0);
1483 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1486 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1487 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1488 bound, if WHICH is 1. The first bound is I=1. */
1490 static struct value
*
1491 desc_one_bound (struct value
*bounds
, int i
, int which
)
1493 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1494 _("Bad GNAT array descriptor bounds"));
1497 /* If BOUNDS is an array-bounds structure type, return the bit position
1498 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1499 bound, if WHICH is 1. The first bound is I=1. */
1502 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1504 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1507 /* If BOUNDS is an array-bounds structure type, return the bit field size
1508 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1509 bound, if WHICH is 1. The first bound is I=1. */
1512 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1514 type
= desc_base_type (type
);
1516 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1517 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1519 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1522 /* If TYPE is the type of an array-bounds structure, the type of its
1523 Ith bound (numbering from 1). Otherwise, NULL. */
1525 static struct type
*
1526 desc_index_type (struct type
*type
, int i
)
1528 type
= desc_base_type (type
);
1530 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1531 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1536 /* The number of index positions in the array-bounds type TYPE.
1537 Return 0 if TYPE is NULL. */
1540 desc_arity (struct type
*type
)
1542 type
= desc_base_type (type
);
1545 return TYPE_NFIELDS (type
) / 2;
1549 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1550 an array descriptor type (representing an unconstrained array
1554 ada_is_direct_array_type (struct type
*type
)
1558 type
= ada_check_typedef (type
);
1559 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1560 || ada_is_array_descriptor_type (type
));
1563 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1567 ada_is_array_type (struct type
*type
)
1570 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1571 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1572 type
= TYPE_TARGET_TYPE (type
);
1573 return ada_is_direct_array_type (type
);
1576 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1579 ada_is_simple_array_type (struct type
*type
)
1583 type
= ada_check_typedef (type
);
1584 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1585 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1586 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1589 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1592 ada_is_array_descriptor_type (struct type
*type
)
1594 struct type
*data_type
= desc_data_target_type (type
);
1598 type
= ada_check_typedef (type
);
1599 return (data_type
!= NULL
1600 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1601 && desc_arity (desc_bounds_type (type
)) > 0);
1604 /* Non-zero iff type is a partially mal-formed GNAT array
1605 descriptor. FIXME: This is to compensate for some problems with
1606 debugging output from GNAT. Re-examine periodically to see if it
1610 ada_is_bogus_array_descriptor (struct type
*type
)
1614 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1615 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1616 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1617 && !ada_is_array_descriptor_type (type
);
1621 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1622 (fat pointer) returns the type of the array data described---specifically,
1623 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1624 in from the descriptor; otherwise, they are left unspecified. If
1625 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1626 returns NULL. The result is simply the type of ARR if ARR is not
1629 ada_type_of_array (struct value
*arr
, int bounds
)
1631 if (ada_is_constrained_packed_array_type (value_type (arr
)))
1632 return decode_constrained_packed_array_type (value_type (arr
));
1634 if (!ada_is_array_descriptor_type (value_type (arr
)))
1635 return value_type (arr
);
1639 struct type
*array_type
=
1640 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1642 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1643 TYPE_FIELD_BITSIZE (array_type
, 0) =
1644 decode_packed_array_bitsize (value_type (arr
));
1650 struct type
*elt_type
;
1652 struct value
*descriptor
;
1654 elt_type
= ada_array_element_type (value_type (arr
), -1);
1655 arity
= ada_array_arity (value_type (arr
));
1657 if (elt_type
== NULL
|| arity
== 0)
1658 return ada_check_typedef (value_type (arr
));
1660 descriptor
= desc_bounds (arr
);
1661 if (value_as_long (descriptor
) == 0)
1665 struct type
*range_type
= alloc_type_copy (value_type (arr
));
1666 struct type
*array_type
= alloc_type_copy (value_type (arr
));
1667 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1668 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1671 create_range_type (range_type
, value_type (low
),
1672 longest_to_int (value_as_long (low
)),
1673 longest_to_int (value_as_long (high
)));
1674 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1676 if (ada_is_unconstrained_packed_array_type (value_type (arr
)))
1677 TYPE_FIELD_BITSIZE (elt_type
, 0) =
1678 decode_packed_array_bitsize (value_type (arr
));
1681 return lookup_pointer_type (elt_type
);
1685 /* If ARR does not represent an array, returns ARR unchanged.
1686 Otherwise, returns either a standard GDB array with bounds set
1687 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1688 GDB array. Returns NULL if ARR is a null fat pointer. */
1691 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1693 if (ada_is_array_descriptor_type (value_type (arr
)))
1695 struct type
*arrType
= ada_type_of_array (arr
, 1);
1696 if (arrType
== NULL
)
1698 return value_cast (arrType
, value_copy (desc_data (arr
)));
1700 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1701 return decode_constrained_packed_array (arr
);
1706 /* If ARR does not represent an array, returns ARR unchanged.
1707 Otherwise, returns a standard GDB array describing ARR (which may
1708 be ARR itself if it already is in the proper form). */
1710 static struct value
*
1711 ada_coerce_to_simple_array (struct value
*arr
)
1713 if (ada_is_array_descriptor_type (value_type (arr
)))
1715 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1717 error (_("Bounds unavailable for null array pointer."));
1718 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1719 return value_ind (arrVal
);
1721 else if (ada_is_constrained_packed_array_type (value_type (arr
)))
1722 return decode_constrained_packed_array (arr
);
1727 /* If TYPE represents a GNAT array type, return it translated to an
1728 ordinary GDB array type (possibly with BITSIZE fields indicating
1729 packing). For other types, is the identity. */
1732 ada_coerce_to_simple_array_type (struct type
*type
)
1734 if (ada_is_constrained_packed_array_type (type
))
1735 return decode_constrained_packed_array_type (type
);
1737 if (ada_is_array_descriptor_type (type
))
1738 return ada_check_typedef (desc_data_target_type (type
));
1743 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1746 ada_is_packed_array_type (struct type
*type
)
1750 type
= desc_base_type (type
);
1751 type
= ada_check_typedef (type
);
1753 ada_type_name (type
) != NULL
1754 && strstr (ada_type_name (type
), "___XP") != NULL
;
1757 /* Non-zero iff TYPE represents a standard GNAT constrained
1758 packed-array type. */
1761 ada_is_constrained_packed_array_type (struct type
*type
)
1763 return ada_is_packed_array_type (type
)
1764 && !ada_is_array_descriptor_type (type
);
1767 /* Non-zero iff TYPE represents an array descriptor for a
1768 unconstrained packed-array type. */
1771 ada_is_unconstrained_packed_array_type (struct type
*type
)
1773 return ada_is_packed_array_type (type
)
1774 && ada_is_array_descriptor_type (type
);
1777 /* Given that TYPE encodes a packed array type (constrained or unconstrained),
1778 return the size of its elements in bits. */
1781 decode_packed_array_bitsize (struct type
*type
)
1783 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1788 raw_name
= ada_type_name (desc_base_type (type
));
1793 tail
= strstr (raw_name
, "___XP");
1795 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1798 (_("could not understand bit size information on packed array"));
1805 /* Given that TYPE is a standard GDB array type with all bounds filled
1806 in, and that the element size of its ultimate scalar constituents
1807 (that is, either its elements, or, if it is an array of arrays, its
1808 elements' elements, etc.) is *ELT_BITS, return an identical type,
1809 but with the bit sizes of its elements (and those of any
1810 constituent arrays) recorded in the BITSIZE components of its
1811 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1814 static struct type
*
1815 constrained_packed_array_type (struct type
*type
, long *elt_bits
)
1817 struct type
*new_elt_type
;
1818 struct type
*new_type
;
1819 LONGEST low_bound
, high_bound
;
1821 type
= ada_check_typedef (type
);
1822 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1825 new_type
= alloc_type_copy (type
);
1827 constrained_packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1829 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1830 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1831 TYPE_NAME (new_type
) = ada_type_name (type
);
1833 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1834 &low_bound
, &high_bound
) < 0)
1835 low_bound
= high_bound
= 0;
1836 if (high_bound
< low_bound
)
1837 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1840 *elt_bits
*= (high_bound
- low_bound
+ 1);
1841 TYPE_LENGTH (new_type
) =
1842 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1845 TYPE_FIXED_INSTANCE (new_type
) = 1;
1849 /* The array type encoded by TYPE, where
1850 ada_is_constrained_packed_array_type (TYPE). */
1852 static struct type
*
1853 decode_constrained_packed_array_type (struct type
*type
)
1856 struct block
**blocks
;
1857 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1860 struct type
*shadow_type
;
1865 raw_name
= ada_type_name (desc_base_type (type
));
1870 name
= (char *) alloca (strlen (raw_name
) + 1);
1871 tail
= strstr (raw_name
, "___XP");
1872 type
= desc_base_type (type
);
1874 memcpy (name
, raw_name
, tail
- raw_name
);
1875 name
[tail
- raw_name
] = '\000';
1877 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1878 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1880 lim_warning (_("could not find bounds information on packed array"));
1883 shadow_type
= SYMBOL_TYPE (sym
);
1884 CHECK_TYPEDEF (shadow_type
);
1886 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1888 lim_warning (_("could not understand bounds information on packed array"));
1892 bits
= decode_packed_array_bitsize (type
);
1893 return constrained_packed_array_type (shadow_type
, &bits
);
1896 /* Given that ARR is a struct value *indicating a GNAT constrained packed
1897 array, returns a simple array that denotes that array. Its type is a
1898 standard GDB array type except that the BITSIZEs of the array
1899 target types are set to the number of bits in each element, and the
1900 type length is set appropriately. */
1902 static struct value
*
1903 decode_constrained_packed_array (struct value
*arr
)
1907 arr
= ada_coerce_ref (arr
);
1909 /* If our value is a pointer, then dererence it. Make sure that
1910 this operation does not cause the target type to be fixed, as
1911 this would indirectly cause this array to be decoded. The rest
1912 of the routine assumes that the array hasn't been decoded yet,
1913 so we use the basic "value_ind" routine to perform the dereferencing,
1914 as opposed to using "ada_value_ind". */
1915 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1916 arr
= value_ind (arr
);
1918 type
= decode_constrained_packed_array_type (value_type (arr
));
1921 error (_("can't unpack array"));
1925 if (gdbarch_bits_big_endian (get_type_arch (value_type (arr
)))
1926 && ada_is_modular_type (value_type (arr
)))
1928 /* This is a (right-justified) modular type representing a packed
1929 array with no wrapper. In order to interpret the value through
1930 the (left-justified) packed array type we just built, we must
1931 first left-justify it. */
1932 int bit_size
, bit_pos
;
1935 mod
= ada_modulus (value_type (arr
)) - 1;
1942 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1943 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1944 bit_pos
/ HOST_CHAR_BIT
,
1945 bit_pos
% HOST_CHAR_BIT
,
1950 return coerce_unspec_val_to_type (arr
, type
);
1954 /* The value of the element of packed array ARR at the ARITY indices
1955 given in IND. ARR must be a simple array. */
1957 static struct value
*
1958 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1961 int bits
, elt_off
, bit_off
;
1962 long elt_total_bit_offset
;
1963 struct type
*elt_type
;
1967 elt_total_bit_offset
= 0;
1968 elt_type
= ada_check_typedef (value_type (arr
));
1969 for (i
= 0; i
< arity
; i
+= 1)
1971 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1972 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1974 (_("attempt to do packed indexing of something other than a packed array"));
1977 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1978 LONGEST lowerbound
, upperbound
;
1981 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1983 lim_warning (_("don't know bounds of array"));
1984 lowerbound
= upperbound
= 0;
1987 idx
= pos_atr (ind
[i
]);
1988 if (idx
< lowerbound
|| idx
> upperbound
)
1989 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1990 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1991 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1992 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1995 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1996 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1998 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
2003 /* Non-zero iff TYPE includes negative integer values. */
2006 has_negatives (struct type
*type
)
2008 switch (TYPE_CODE (type
))
2013 return !TYPE_UNSIGNED (type
);
2014 case TYPE_CODE_RANGE
:
2015 return TYPE_LOW_BOUND (type
) < 0;
2020 /* Create a new value of type TYPE from the contents of OBJ starting
2021 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2022 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2023 assigning through the result will set the field fetched from.
2024 VALADDR is ignored unless OBJ is NULL, in which case,
2025 VALADDR+OFFSET must address the start of storage containing the
2026 packed value. The value returned in this case is never an lval.
2027 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2030 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2031 long offset
, int bit_offset
, int bit_size
,
2035 int src
, /* Index into the source area */
2036 targ
, /* Index into the target area */
2037 srcBitsLeft
, /* Number of source bits left to move */
2038 nsrc
, ntarg
, /* Number of source and target bytes */
2039 unusedLS
, /* Number of bits in next significant
2040 byte of source that are unused */
2041 accumSize
; /* Number of meaningful bits in accum */
2042 unsigned char *bytes
; /* First byte containing data to unpack */
2043 unsigned char *unpacked
;
2044 unsigned long accum
; /* Staging area for bits being transferred */
2046 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2047 /* Transmit bytes from least to most significant; delta is the direction
2048 the indices move. */
2049 int delta
= gdbarch_bits_big_endian (get_type_arch (type
)) ? -1 : 1;
2051 type
= ada_check_typedef (type
);
2055 v
= allocate_value (type
);
2056 bytes
= (unsigned char *) (valaddr
+ offset
);
2058 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2061 value_address (obj
) + offset
);
2062 bytes
= (unsigned char *) alloca (len
);
2063 read_memory (value_address (v
), bytes
, len
);
2067 v
= allocate_value (type
);
2068 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2074 set_value_component_location (v
, obj
);
2075 new_addr
= value_address (obj
) + offset
;
2076 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2077 set_value_bitsize (v
, bit_size
);
2078 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2081 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2083 set_value_address (v
, new_addr
);
2086 set_value_bitsize (v
, bit_size
);
2087 unpacked
= (unsigned char *) value_contents (v
);
2089 srcBitsLeft
= bit_size
;
2091 ntarg
= TYPE_LENGTH (type
);
2095 memset (unpacked
, 0, TYPE_LENGTH (type
));
2098 else if (gdbarch_bits_big_endian (get_type_arch (type
)))
2101 if (has_negatives (type
)
2102 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2106 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2109 switch (TYPE_CODE (type
))
2111 case TYPE_CODE_ARRAY
:
2112 case TYPE_CODE_UNION
:
2113 case TYPE_CODE_STRUCT
:
2114 /* Non-scalar values must be aligned at a byte boundary... */
2116 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2117 /* ... And are placed at the beginning (most-significant) bytes
2119 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2124 targ
= TYPE_LENGTH (type
) - 1;
2130 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2133 unusedLS
= bit_offset
;
2136 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2143 /* Mask for removing bits of the next source byte that are not
2144 part of the value. */
2145 unsigned int unusedMSMask
=
2146 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2148 /* Sign-extend bits for this byte. */
2149 unsigned int signMask
= sign
& ~unusedMSMask
;
2151 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2152 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2153 if (accumSize
>= HOST_CHAR_BIT
)
2155 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2156 accumSize
-= HOST_CHAR_BIT
;
2157 accum
>>= HOST_CHAR_BIT
;
2161 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2168 accum
|= sign
<< accumSize
;
2169 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2170 accumSize
-= HOST_CHAR_BIT
;
2171 accum
>>= HOST_CHAR_BIT
;
2179 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2180 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2183 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2184 int src_offset
, int n
, int bits_big_endian_p
)
2186 unsigned int accum
, mask
;
2187 int accum_bits
, chunk_size
;
2189 target
+= targ_offset
/ HOST_CHAR_BIT
;
2190 targ_offset
%= HOST_CHAR_BIT
;
2191 source
+= src_offset
/ HOST_CHAR_BIT
;
2192 src_offset
%= HOST_CHAR_BIT
;
2193 if (bits_big_endian_p
)
2195 accum
= (unsigned char) *source
;
2197 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2202 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2203 accum_bits
+= HOST_CHAR_BIT
;
2205 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2208 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2209 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2212 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2214 accum_bits
-= chunk_size
;
2221 accum
= (unsigned char) *source
>> src_offset
;
2223 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2227 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2228 accum_bits
+= HOST_CHAR_BIT
;
2230 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2233 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2234 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2236 accum_bits
-= chunk_size
;
2237 accum
>>= chunk_size
;
2244 /* Store the contents of FROMVAL into the location of TOVAL.
2245 Return a new value with the location of TOVAL and contents of
2246 FROMVAL. Handles assignment into packed fields that have
2247 floating-point or non-scalar types. */
2249 static struct value
*
2250 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2252 struct type
*type
= value_type (toval
);
2253 int bits
= value_bitsize (toval
);
2255 toval
= ada_coerce_ref (toval
);
2256 fromval
= ada_coerce_ref (fromval
);
2258 if (ada_is_direct_array_type (value_type (toval
)))
2259 toval
= ada_coerce_to_simple_array (toval
);
2260 if (ada_is_direct_array_type (value_type (fromval
)))
2261 fromval
= ada_coerce_to_simple_array (fromval
);
2263 if (!deprecated_value_modifiable (toval
))
2264 error (_("Left operand of assignment is not a modifiable lvalue."));
2266 if (VALUE_LVAL (toval
) == lval_memory
2268 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2269 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2271 int len
= (value_bitpos (toval
)
2272 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2274 char *buffer
= (char *) alloca (len
);
2276 CORE_ADDR to_addr
= value_address (toval
);
2278 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2279 fromval
= value_cast (type
, fromval
);
2281 read_memory (to_addr
, buffer
, len
);
2282 from_size
= value_bitsize (fromval
);
2284 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2285 if (gdbarch_bits_big_endian (get_type_arch (type
)))
2286 move_bits (buffer
, value_bitpos (toval
),
2287 value_contents (fromval
), from_size
- bits
, bits
, 1);
2289 move_bits (buffer
, value_bitpos (toval
),
2290 value_contents (fromval
), 0, bits
, 0);
2291 write_memory (to_addr
, buffer
, len
);
2292 if (deprecated_memory_changed_hook
)
2293 deprecated_memory_changed_hook (to_addr
, len
);
2295 val
= value_copy (toval
);
2296 memcpy (value_contents_raw (val
), value_contents (fromval
),
2297 TYPE_LENGTH (type
));
2298 deprecated_set_value_type (val
, type
);
2303 return value_assign (toval
, fromval
);
2307 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2308 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2309 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2310 * COMPONENT, and not the inferior's memory. The current contents
2311 * of COMPONENT are ignored. */
2313 value_assign_to_component (struct value
*container
, struct value
*component
,
2316 LONGEST offset_in_container
=
2317 (LONGEST
) (value_address (component
) - value_address (container
));
2318 int bit_offset_in_container
=
2319 value_bitpos (component
) - value_bitpos (container
);
2322 val
= value_cast (value_type (component
), val
);
2324 if (value_bitsize (component
) == 0)
2325 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2327 bits
= value_bitsize (component
);
2329 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2330 move_bits (value_contents_writeable (container
) + offset_in_container
,
2331 value_bitpos (container
) + bit_offset_in_container
,
2332 value_contents (val
),
2333 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2336 move_bits (value_contents_writeable (container
) + offset_in_container
,
2337 value_bitpos (container
) + bit_offset_in_container
,
2338 value_contents (val
), 0, bits
, 0);
2341 /* The value of the element of array ARR at the ARITY indices given in IND.
2342 ARR may be either a simple array, GNAT array descriptor, or pointer
2346 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2350 struct type
*elt_type
;
2352 elt
= ada_coerce_to_simple_array (arr
);
2354 elt_type
= ada_check_typedef (value_type (elt
));
2355 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2356 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2357 return value_subscript_packed (elt
, arity
, ind
);
2359 for (k
= 0; k
< arity
; k
+= 1)
2361 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2362 error (_("too many subscripts (%d expected)"), k
);
2363 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2368 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2369 value of the element of *ARR at the ARITY indices given in
2370 IND. Does not read the entire array into memory. */
2372 static struct value
*
2373 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2378 for (k
= 0; k
< arity
; k
+= 1)
2382 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2383 error (_("too many subscripts (%d expected)"), k
);
2384 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2386 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2387 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2388 type
= TYPE_TARGET_TYPE (type
);
2391 return value_ind (arr
);
2394 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2395 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2396 elements starting at index LOW. The lower bound of this array is LOW, as
2398 static struct value
*
2399 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2402 CORE_ADDR base
= value_as_address (array_ptr
)
2403 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2404 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2405 struct type
*index_type
=
2406 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2408 struct type
*slice_type
=
2409 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2410 return value_at_lazy (slice_type
, base
);
2414 static struct value
*
2415 ada_value_slice (struct value
*array
, int low
, int high
)
2417 struct type
*type
= value_type (array
);
2418 struct type
*index_type
=
2419 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2420 struct type
*slice_type
=
2421 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2422 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2425 /* If type is a record type in the form of a standard GNAT array
2426 descriptor, returns the number of dimensions for type. If arr is a
2427 simple array, returns the number of "array of"s that prefix its
2428 type designation. Otherwise, returns 0. */
2431 ada_array_arity (struct type
*type
)
2438 type
= desc_base_type (type
);
2441 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2442 return desc_arity (desc_bounds_type (type
));
2444 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2447 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2453 /* If TYPE is a record type in the form of a standard GNAT array
2454 descriptor or a simple array type, returns the element type for
2455 TYPE after indexing by NINDICES indices, or by all indices if
2456 NINDICES is -1. Otherwise, returns NULL. */
2459 ada_array_element_type (struct type
*type
, int nindices
)
2461 type
= desc_base_type (type
);
2463 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2466 struct type
*p_array_type
;
2468 p_array_type
= desc_data_target_type (type
);
2470 k
= ada_array_arity (type
);
2474 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2475 if (nindices
>= 0 && k
> nindices
)
2477 while (k
> 0 && p_array_type
!= NULL
)
2479 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2482 return p_array_type
;
2484 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2486 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2488 type
= TYPE_TARGET_TYPE (type
);
2497 /* The type of nth index in arrays of given type (n numbering from 1).
2498 Does not examine memory. Throws an error if N is invalid or TYPE
2499 is not an array type. NAME is the name of the Ada attribute being
2500 evaluated ('range, 'first, 'last, or 'length); it is used in building
2501 the error message. */
2503 static struct type
*
2504 ada_index_type (struct type
*type
, int n
, const char *name
)
2506 struct type
*result_type
;
2508 type
= desc_base_type (type
);
2510 if (n
< 0 || n
> ada_array_arity (type
))
2511 error (_("invalid dimension number to '%s"), name
);
2513 if (ada_is_simple_array_type (type
))
2517 for (i
= 1; i
< n
; i
+= 1)
2518 type
= TYPE_TARGET_TYPE (type
);
2519 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2520 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2521 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2522 perhaps stabsread.c would make more sense. */
2523 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2528 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2529 if (result_type
== NULL
)
2530 error (_("attempt to take bound of something that is not an array"));
2536 /* Given that arr is an array type, returns the lower bound of the
2537 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2538 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2539 array-descriptor type. It works for other arrays with bounds supplied
2540 by run-time quantities other than discriminants. */
2543 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2545 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2549 gdb_assert (which
== 0 || which
== 1);
2551 if (ada_is_constrained_packed_array_type (arr_type
))
2552 arr_type
= decode_constrained_packed_array_type (arr_type
);
2554 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2555 return (LONGEST
) - which
;
2557 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2558 type
= TYPE_TARGET_TYPE (arr_type
);
2563 for (i
= n
; i
> 1; i
--)
2564 elt_type
= TYPE_TARGET_TYPE (type
);
2566 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2567 if (index_type_desc
!= NULL
)
2568 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2569 NULL
, TYPE_INDEX_TYPE (elt_type
));
2571 index_type
= TYPE_INDEX_TYPE (elt_type
);
2573 switch (TYPE_CODE (index_type
))
2575 case TYPE_CODE_RANGE
:
2576 retval
= which
== 0 ? TYPE_LOW_BOUND (index_type
)
2577 : TYPE_HIGH_BOUND (index_type
);
2579 case TYPE_CODE_ENUM
:
2580 retval
= which
== 0 ? TYPE_FIELD_BITPOS (index_type
, 0)
2581 : TYPE_FIELD_BITPOS (index_type
,
2582 TYPE_NFIELDS (index_type
) - 1);
2585 internal_error (__FILE__
, __LINE__
, _("invalid type code of index type"));
2591 /* Given that arr is an array value, returns the lower bound of the
2592 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2593 WHICH is 1. This routine will also work for arrays with bounds
2594 supplied by run-time quantities other than discriminants. */
2597 ada_array_bound (struct value
*arr
, int n
, int which
)
2599 struct type
*arr_type
= value_type (arr
);
2601 if (ada_is_constrained_packed_array_type (arr_type
))
2602 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2603 else if (ada_is_simple_array_type (arr_type
))
2604 return ada_array_bound_from_type (arr_type
, n
, which
);
2606 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2609 /* Given that arr is an array value, returns the length of the
2610 nth index. This routine will also work for arrays with bounds
2611 supplied by run-time quantities other than discriminants.
2612 Does not work for arrays indexed by enumeration types with representation
2613 clauses at the moment. */
2616 ada_array_length (struct value
*arr
, int n
)
2618 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2620 if (ada_is_constrained_packed_array_type (arr_type
))
2621 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2623 if (ada_is_simple_array_type (arr_type
))
2624 return (ada_array_bound_from_type (arr_type
, n
, 1)
2625 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2627 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2628 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2631 /* An empty array whose type is that of ARR_TYPE (an array type),
2632 with bounds LOW to LOW-1. */
2634 static struct value
*
2635 empty_array (struct type
*arr_type
, int low
)
2637 struct type
*index_type
=
2638 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2640 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2641 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2645 /* Name resolution */
2647 /* The "decoded" name for the user-definable Ada operator corresponding
2651 ada_decoded_op_name (enum exp_opcode op
)
2655 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2657 if (ada_opname_table
[i
].op
== op
)
2658 return ada_opname_table
[i
].decoded
;
2660 error (_("Could not find operator name for opcode"));
2664 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2665 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2666 undefined namespace) and converts operators that are
2667 user-defined into appropriate function calls. If CONTEXT_TYPE is
2668 non-null, it provides a preferred result type [at the moment, only
2669 type void has any effect---causing procedures to be preferred over
2670 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2671 return type is preferred. May change (expand) *EXP. */
2674 resolve (struct expression
**expp
, int void_context_p
)
2676 struct type
*context_type
= NULL
;
2680 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2682 resolve_subexp (expp
, &pc
, 1, context_type
);
2685 /* Resolve the operator of the subexpression beginning at
2686 position *POS of *EXPP. "Resolving" consists of replacing
2687 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2688 with their resolutions, replacing built-in operators with
2689 function calls to user-defined operators, where appropriate, and,
2690 when DEPROCEDURE_P is non-zero, converting function-valued variables
2691 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2692 are as in ada_resolve, above. */
2694 static struct value
*
2695 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2696 struct type
*context_type
)
2700 struct expression
*exp
; /* Convenience: == *expp. */
2701 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2702 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2703 int nargs
; /* Number of operands. */
2710 /* Pass one: resolve operands, saving their types and updating *pos,
2715 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2716 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2721 resolve_subexp (expp
, pos
, 0, NULL
);
2723 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2728 resolve_subexp (expp
, pos
, 0, NULL
);
2733 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2736 case OP_ATR_MODULUS
:
2746 case TERNOP_IN_RANGE
:
2747 case BINOP_IN_BOUNDS
:
2753 case OP_DISCRETE_RANGE
:
2755 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2764 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2766 resolve_subexp (expp
, pos
, 1, NULL
);
2768 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2785 case BINOP_LOGICAL_AND
:
2786 case BINOP_LOGICAL_OR
:
2787 case BINOP_BITWISE_AND
:
2788 case BINOP_BITWISE_IOR
:
2789 case BINOP_BITWISE_XOR
:
2792 case BINOP_NOTEQUAL
:
2799 case BINOP_SUBSCRIPT
:
2807 case UNOP_LOGICAL_NOT
:
2823 case OP_INTERNALVAR
:
2833 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2836 case STRUCTOP_STRUCT
:
2837 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2850 error (_("Unexpected operator during name resolution"));
2853 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2854 for (i
= 0; i
< nargs
; i
+= 1)
2855 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2859 /* Pass two: perform any resolution on principal operator. */
2866 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2868 struct ada_symbol_info
*candidates
;
2872 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2873 (exp
->elts
[pc
+ 2].symbol
),
2874 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2877 if (n_candidates
> 1)
2879 /* Types tend to get re-introduced locally, so if there
2880 are any local symbols that are not types, first filter
2883 for (j
= 0; j
< n_candidates
; j
+= 1)
2884 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2889 case LOC_REGPARM_ADDR
:
2897 if (j
< n_candidates
)
2900 while (j
< n_candidates
)
2902 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2904 candidates
[j
] = candidates
[n_candidates
- 1];
2913 if (n_candidates
== 0)
2914 error (_("No definition found for %s"),
2915 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2916 else if (n_candidates
== 1)
2918 else if (deprocedure_p
2919 && !is_nonfunction (candidates
, n_candidates
))
2921 i
= ada_resolve_function
2922 (candidates
, n_candidates
, NULL
, 0,
2923 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2926 error (_("Could not find a match for %s"),
2927 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2931 printf_filtered (_("Multiple matches for %s\n"),
2932 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2933 user_select_syms (candidates
, n_candidates
, 1);
2937 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2938 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2939 if (innermost_block
== NULL
2940 || contained_in (candidates
[i
].block
, innermost_block
))
2941 innermost_block
= candidates
[i
].block
;
2945 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2948 replace_operator_with_call (expp
, pc
, 0, 0,
2949 exp
->elts
[pc
+ 2].symbol
,
2950 exp
->elts
[pc
+ 1].block
);
2957 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2958 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2960 struct ada_symbol_info
*candidates
;
2964 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2965 (exp
->elts
[pc
+ 5].symbol
),
2966 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2968 if (n_candidates
== 1)
2972 i
= ada_resolve_function
2973 (candidates
, n_candidates
,
2975 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2978 error (_("Could not find a match for %s"),
2979 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2982 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2983 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2984 if (innermost_block
== NULL
2985 || contained_in (candidates
[i
].block
, innermost_block
))
2986 innermost_block
= candidates
[i
].block
;
2997 case BINOP_BITWISE_AND
:
2998 case BINOP_BITWISE_IOR
:
2999 case BINOP_BITWISE_XOR
:
3001 case BINOP_NOTEQUAL
:
3009 case UNOP_LOGICAL_NOT
:
3011 if (possible_user_operator_p (op
, argvec
))
3013 struct ada_symbol_info
*candidates
;
3017 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3018 (struct block
*) NULL
, VAR_DOMAIN
,
3020 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3021 ada_decoded_op_name (op
), NULL
);
3025 replace_operator_with_call (expp
, pc
, nargs
, 1,
3026 candidates
[i
].sym
, candidates
[i
].block
);
3037 return evaluate_subexp_type (exp
, pos
);
3040 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3041 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3043 /* The term "match" here is rather loose. The match is heuristic and
3047 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3049 ftype
= ada_check_typedef (ftype
);
3050 atype
= ada_check_typedef (atype
);
3052 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3053 ftype
= TYPE_TARGET_TYPE (ftype
);
3054 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3055 atype
= TYPE_TARGET_TYPE (atype
);
3057 switch (TYPE_CODE (ftype
))
3060 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3062 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3063 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3064 TYPE_TARGET_TYPE (atype
), 0);
3067 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3069 case TYPE_CODE_ENUM
:
3070 case TYPE_CODE_RANGE
:
3071 switch (TYPE_CODE (atype
))
3074 case TYPE_CODE_ENUM
:
3075 case TYPE_CODE_RANGE
:
3081 case TYPE_CODE_ARRAY
:
3082 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3083 || ada_is_array_descriptor_type (atype
));
3085 case TYPE_CODE_STRUCT
:
3086 if (ada_is_array_descriptor_type (ftype
))
3087 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3088 || ada_is_array_descriptor_type (atype
));
3090 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3091 && !ada_is_array_descriptor_type (atype
));
3093 case TYPE_CODE_UNION
:
3095 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3099 /* Return non-zero if the formals of FUNC "sufficiently match" the
3100 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3101 may also be an enumeral, in which case it is treated as a 0-
3102 argument function. */
3105 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3108 struct type
*func_type
= SYMBOL_TYPE (func
);
3110 if (SYMBOL_CLASS (func
) == LOC_CONST
3111 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3112 return (n_actuals
== 0);
3113 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3116 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3119 for (i
= 0; i
< n_actuals
; i
+= 1)
3121 if (actuals
[i
] == NULL
)
3125 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3126 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3128 if (!ada_type_match (ftype
, atype
, 1))
3135 /* False iff function type FUNC_TYPE definitely does not produce a value
3136 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3137 FUNC_TYPE is not a valid function type with a non-null return type
3138 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3141 return_match (struct type
*func_type
, struct type
*context_type
)
3143 struct type
*return_type
;
3145 if (func_type
== NULL
)
3148 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3149 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3151 return_type
= base_type (func_type
);
3152 if (return_type
== NULL
)
3155 context_type
= base_type (context_type
);
3157 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3158 return context_type
== NULL
|| return_type
== context_type
;
3159 else if (context_type
== NULL
)
3160 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3162 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3166 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3167 function (if any) that matches the types of the NARGS arguments in
3168 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3169 that returns that type, then eliminate matches that don't. If
3170 CONTEXT_TYPE is void and there is at least one match that does not
3171 return void, eliminate all matches that do.
3173 Asks the user if there is more than one match remaining. Returns -1
3174 if there is no such symbol or none is selected. NAME is used
3175 solely for messages. May re-arrange and modify SYMS in
3176 the process; the index returned is for the modified vector. */
3179 ada_resolve_function (struct ada_symbol_info syms
[],
3180 int nsyms
, struct value
**args
, int nargs
,
3181 const char *name
, struct type
*context_type
)
3185 int m
; /* Number of hits */
3188 /* In the first pass of the loop, we only accept functions matching
3189 context_type. If none are found, we add a second pass of the loop
3190 where every function is accepted. */
3191 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3193 for (k
= 0; k
< nsyms
; k
+= 1)
3195 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3197 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3198 && (fallback
|| return_match (type
, context_type
)))
3210 printf_filtered (_("Multiple matches for %s\n"), name
);
3211 user_select_syms (syms
, m
, 1);
3217 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3218 in a listing of choices during disambiguation (see sort_choices, below).
3219 The idea is that overloadings of a subprogram name from the
3220 same package should sort in their source order. We settle for ordering
3221 such symbols by their trailing number (__N or $N). */
3224 encoded_ordered_before (char *N0
, char *N1
)
3228 else if (N0
== NULL
)
3233 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3235 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3237 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3238 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3242 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3245 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3247 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3248 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3250 return (strcmp (N0
, N1
) < 0);
3254 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3258 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3261 for (i
= 1; i
< nsyms
; i
+= 1)
3263 struct ada_symbol_info sym
= syms
[i
];
3266 for (j
= i
- 1; j
>= 0; j
-= 1)
3268 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3269 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3271 syms
[j
+ 1] = syms
[j
];
3277 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3278 by asking the user (if necessary), returning the number selected,
3279 and setting the first elements of SYMS items. Error if no symbols
3282 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3283 to be re-integrated one of these days. */
3286 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3289 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3291 int first_choice
= (max_results
== 1) ? 1 : 2;
3292 const char *select_mode
= multiple_symbols_select_mode ();
3294 if (max_results
< 1)
3295 error (_("Request to select 0 symbols!"));
3299 if (select_mode
== multiple_symbols_cancel
)
3301 canceled because the command is ambiguous\n\
3302 See set/show multiple-symbol."));
3304 /* If select_mode is "all", then return all possible symbols.
3305 Only do that if more than one symbol can be selected, of course.
3306 Otherwise, display the menu as usual. */
3307 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3310 printf_unfiltered (_("[0] cancel\n"));
3311 if (max_results
> 1)
3312 printf_unfiltered (_("[1] all\n"));
3314 sort_choices (syms
, nsyms
);
3316 for (i
= 0; i
< nsyms
; i
+= 1)
3318 if (syms
[i
].sym
== NULL
)
3321 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3323 struct symtab_and_line sal
=
3324 find_function_start_sal (syms
[i
].sym
, 1);
3325 if (sal
.symtab
== NULL
)
3326 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3328 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3331 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3332 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3333 sal
.symtab
->filename
, sal
.line
);
3339 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3340 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3341 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3342 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3344 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3345 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3347 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3348 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3349 else if (is_enumeral
3350 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3352 printf_unfiltered (("[%d] "), i
+ first_choice
);
3353 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3355 printf_unfiltered (_("'(%s) (enumeral)\n"),
3356 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3358 else if (symtab
!= NULL
)
3359 printf_unfiltered (is_enumeral
3360 ? _("[%d] %s in %s (enumeral)\n")
3361 : _("[%d] %s at %s:?\n"),
3363 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3366 printf_unfiltered (is_enumeral
3367 ? _("[%d] %s (enumeral)\n")
3368 : _("[%d] %s at ?\n"),
3370 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3374 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3377 for (i
= 0; i
< n_chosen
; i
+= 1)
3378 syms
[i
] = syms
[chosen
[i
]];
3383 /* Read and validate a set of numeric choices from the user in the
3384 range 0 .. N_CHOICES-1. Place the results in increasing
3385 order in CHOICES[0 .. N-1], and return N.
3387 The user types choices as a sequence of numbers on one line
3388 separated by blanks, encoding them as follows:
3390 + A choice of 0 means to cancel the selection, throwing an error.
3391 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3392 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3394 The user is not allowed to choose more than MAX_RESULTS values.
3396 ANNOTATION_SUFFIX, if present, is used to annotate the input
3397 prompts (for use with the -f switch). */
3400 get_selections (int *choices
, int n_choices
, int max_results
,
3401 int is_all_choice
, char *annotation_suffix
)
3406 int first_choice
= is_all_choice
? 2 : 1;
3408 prompt
= getenv ("PS2");
3412 args
= command_line_input (prompt
, 0, annotation_suffix
);
3415 error_no_arg (_("one or more choice numbers"));
3419 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3420 order, as given in args. Choices are validated. */
3426 while (isspace (*args
))
3428 if (*args
== '\0' && n_chosen
== 0)
3429 error_no_arg (_("one or more choice numbers"));
3430 else if (*args
== '\0')
3433 choice
= strtol (args
, &args2
, 10);
3434 if (args
== args2
|| choice
< 0
3435 || choice
> n_choices
+ first_choice
- 1)
3436 error (_("Argument must be choice number"));
3440 error (_("cancelled"));
3442 if (choice
< first_choice
)
3444 n_chosen
= n_choices
;
3445 for (j
= 0; j
< n_choices
; j
+= 1)
3449 choice
-= first_choice
;
3451 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3455 if (j
< 0 || choice
!= choices
[j
])
3458 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3459 choices
[k
+ 1] = choices
[k
];
3460 choices
[j
+ 1] = choice
;
3465 if (n_chosen
> max_results
)
3466 error (_("Select no more than %d of the above"), max_results
);
3471 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3472 on the function identified by SYM and BLOCK, and taking NARGS
3473 arguments. Update *EXPP as needed to hold more space. */
3476 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3477 int oplen
, struct symbol
*sym
,
3478 struct block
*block
)
3480 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3481 symbol, -oplen for operator being replaced). */
3482 struct expression
*newexp
= (struct expression
*)
3483 xmalloc (sizeof (struct expression
)
3484 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3485 struct expression
*exp
= *expp
;
3487 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3488 newexp
->language_defn
= exp
->language_defn
;
3489 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3490 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3491 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3493 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3494 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3496 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3497 newexp
->elts
[pc
+ 4].block
= block
;
3498 newexp
->elts
[pc
+ 5].symbol
= sym
;
3504 /* Type-class predicates */
3506 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3510 numeric_type_p (struct type
*type
)
3516 switch (TYPE_CODE (type
))
3521 case TYPE_CODE_RANGE
:
3522 return (type
== TYPE_TARGET_TYPE (type
)
3523 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3530 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3533 integer_type_p (struct type
*type
)
3539 switch (TYPE_CODE (type
))
3543 case TYPE_CODE_RANGE
:
3544 return (type
== TYPE_TARGET_TYPE (type
)
3545 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3552 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3555 scalar_type_p (struct type
*type
)
3561 switch (TYPE_CODE (type
))
3564 case TYPE_CODE_RANGE
:
3565 case TYPE_CODE_ENUM
:
3574 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3577 discrete_type_p (struct type
*type
)
3583 switch (TYPE_CODE (type
))
3586 case TYPE_CODE_RANGE
:
3587 case TYPE_CODE_ENUM
:
3588 case TYPE_CODE_BOOL
:
3596 /* Returns non-zero if OP with operands in the vector ARGS could be
3597 a user-defined function. Errs on the side of pre-defined operators
3598 (i.e., result 0). */
3601 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3603 struct type
*type0
=
3604 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3605 struct type
*type1
=
3606 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3620 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3624 case BINOP_BITWISE_AND
:
3625 case BINOP_BITWISE_IOR
:
3626 case BINOP_BITWISE_XOR
:
3627 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3630 case BINOP_NOTEQUAL
:
3635 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3638 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3641 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3645 case UNOP_LOGICAL_NOT
:
3647 return (!numeric_type_p (type0
));
3656 1. In the following, we assume that a renaming type's name may
3657 have an ___XD suffix. It would be nice if this went away at some
3659 2. We handle both the (old) purely type-based representation of
3660 renamings and the (new) variable-based encoding. At some point,
3661 it is devoutly to be hoped that the former goes away
3662 (FIXME: hilfinger-2007-07-09).
3663 3. Subprogram renamings are not implemented, although the XRS
3664 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3666 /* If SYM encodes a renaming,
3668 <renaming> renames <renamed entity>,
3670 sets *LEN to the length of the renamed entity's name,
3671 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3672 the string describing the subcomponent selected from the renamed
3673 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3674 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3675 are undefined). Otherwise, returns a value indicating the category
3676 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3677 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3678 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3679 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3680 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3681 may be NULL, in which case they are not assigned.
3683 [Currently, however, GCC does not generate subprogram renamings.] */
3685 enum ada_renaming_category
3686 ada_parse_renaming (struct symbol
*sym
,
3687 const char **renamed_entity
, int *len
,
3688 const char **renaming_expr
)
3690 enum ada_renaming_category kind
;
3695 return ADA_NOT_RENAMING
;
3696 switch (SYMBOL_CLASS (sym
))
3699 return ADA_NOT_RENAMING
;
3701 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3702 renamed_entity
, len
, renaming_expr
);
3706 case LOC_OPTIMIZED_OUT
:
3707 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3709 return ADA_NOT_RENAMING
;
3713 kind
= ADA_OBJECT_RENAMING
;
3717 kind
= ADA_EXCEPTION_RENAMING
;
3721 kind
= ADA_PACKAGE_RENAMING
;
3725 kind
= ADA_SUBPROGRAM_RENAMING
;
3729 return ADA_NOT_RENAMING
;
3733 if (renamed_entity
!= NULL
)
3734 *renamed_entity
= info
;
3735 suffix
= strstr (info
, "___XE");
3736 if (suffix
== NULL
|| suffix
== info
)
3737 return ADA_NOT_RENAMING
;
3739 *len
= strlen (info
) - strlen (suffix
);
3741 if (renaming_expr
!= NULL
)
3742 *renaming_expr
= suffix
;
3746 /* Assuming TYPE encodes a renaming according to the old encoding in
3747 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3748 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3749 ADA_NOT_RENAMING otherwise. */
3750 static enum ada_renaming_category
3751 parse_old_style_renaming (struct type
*type
,
3752 const char **renamed_entity
, int *len
,
3753 const char **renaming_expr
)
3755 enum ada_renaming_category kind
;
3760 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3761 || TYPE_NFIELDS (type
) != 1)
3762 return ADA_NOT_RENAMING
;
3764 name
= type_name_no_tag (type
);
3766 return ADA_NOT_RENAMING
;
3768 name
= strstr (name
, "___XR");
3770 return ADA_NOT_RENAMING
;
3775 kind
= ADA_OBJECT_RENAMING
;
3778 kind
= ADA_EXCEPTION_RENAMING
;
3781 kind
= ADA_PACKAGE_RENAMING
;
3784 kind
= ADA_SUBPROGRAM_RENAMING
;
3787 return ADA_NOT_RENAMING
;
3790 info
= TYPE_FIELD_NAME (type
, 0);
3792 return ADA_NOT_RENAMING
;
3793 if (renamed_entity
!= NULL
)
3794 *renamed_entity
= info
;
3795 suffix
= strstr (info
, "___XE");
3796 if (renaming_expr
!= NULL
)
3797 *renaming_expr
= suffix
+ 5;
3798 if (suffix
== NULL
|| suffix
== info
)
3799 return ADA_NOT_RENAMING
;
3801 *len
= suffix
- info
;
3807 /* Evaluation: Function Calls */
3809 /* Return an lvalue containing the value VAL. This is the identity on
3810 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3811 on the stack, using and updating *SP as the stack pointer, and
3812 returning an lvalue whose value_address points to the copy. */
3814 static struct value
*
3815 ensure_lval (struct value
*val
, struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3817 if (! VALUE_LVAL (val
))
3819 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3821 /* The following is taken from the structure-return code in
3822 call_function_by_hand. FIXME: Therefore, some refactoring seems
3824 if (gdbarch_inner_than (gdbarch
, 1, 2))
3826 /* Stack grows downward. Align SP and value_address (val) after
3827 reserving sufficient space. */
3829 if (gdbarch_frame_align_p (gdbarch
))
3830 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3831 set_value_address (val
, *sp
);
3835 /* Stack grows upward. Align the frame, allocate space, and
3836 then again, re-align the frame. */
3837 if (gdbarch_frame_align_p (gdbarch
))
3838 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3839 set_value_address (val
, *sp
);
3841 if (gdbarch_frame_align_p (gdbarch
))
3842 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3844 VALUE_LVAL (val
) = lval_memory
;
3846 write_memory (value_address (val
), value_contents_raw (val
), len
);
3852 /* Return the value ACTUAL, converted to be an appropriate value for a
3853 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3854 allocating any necessary descriptors (fat pointers), or copies of
3855 values not residing in memory, updating it as needed. */
3858 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3859 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3861 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3862 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3863 struct type
*formal_target
=
3864 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3865 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3866 struct type
*actual_target
=
3867 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3868 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3870 if (ada_is_array_descriptor_type (formal_target
)
3871 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3872 return make_array_descriptor (formal_type
, actual
, gdbarch
, sp
);
3873 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3874 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3876 struct value
*result
;
3877 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3878 && ada_is_array_descriptor_type (actual_target
))
3879 result
= desc_data (actual
);
3880 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3882 if (VALUE_LVAL (actual
) != lval_memory
)
3885 actual_type
= ada_check_typedef (value_type (actual
));
3886 val
= allocate_value (actual_type
);
3887 memcpy ((char *) value_contents_raw (val
),
3888 (char *) value_contents (actual
),
3889 TYPE_LENGTH (actual_type
));
3890 actual
= ensure_lval (val
, gdbarch
, sp
);
3892 result
= value_addr (actual
);
3896 return value_cast_pointers (formal_type
, result
);
3898 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3899 return ada_value_ind (actual
);
3905 /* Push a descriptor of type TYPE for array value ARR on the stack at
3906 *SP, updating *SP to reflect the new descriptor. Return either
3907 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3908 to-descriptor type rather than a descriptor type), a struct value *
3909 representing a pointer to this descriptor. */
3911 static struct value
*
3912 make_array_descriptor (struct type
*type
, struct value
*arr
,
3913 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3915 struct type
*bounds_type
= desc_bounds_type (type
);
3916 struct type
*desc_type
= desc_base_type (type
);
3917 struct value
*descriptor
= allocate_value (desc_type
);
3918 struct value
*bounds
= allocate_value (bounds_type
);
3921 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3923 modify_general_field (value_type (bounds
),
3924 value_contents_writeable (bounds
),
3925 ada_array_bound (arr
, i
, 0),
3926 desc_bound_bitpos (bounds_type
, i
, 0),
3927 desc_bound_bitsize (bounds_type
, i
, 0));
3928 modify_general_field (value_type (bounds
),
3929 value_contents_writeable (bounds
),
3930 ada_array_bound (arr
, i
, 1),
3931 desc_bound_bitpos (bounds_type
, i
, 1),
3932 desc_bound_bitsize (bounds_type
, i
, 1));
3935 bounds
= ensure_lval (bounds
, gdbarch
, sp
);
3937 modify_general_field (value_type (descriptor
),
3938 value_contents_writeable (descriptor
),
3939 value_address (ensure_lval (arr
, gdbarch
, sp
)),
3940 fat_pntr_data_bitpos (desc_type
),
3941 fat_pntr_data_bitsize (desc_type
));
3943 modify_general_field (value_type (descriptor
),
3944 value_contents_writeable (descriptor
),
3945 value_address (bounds
),
3946 fat_pntr_bounds_bitpos (desc_type
),
3947 fat_pntr_bounds_bitsize (desc_type
));
3949 descriptor
= ensure_lval (descriptor
, gdbarch
, sp
);
3951 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3952 return value_addr (descriptor
);
3957 /* Dummy definitions for an experimental caching module that is not
3958 * used in the public sources. */
3961 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3962 struct symbol
**sym
, struct block
**block
)
3968 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3969 struct block
*block
)
3975 /* Return the result of a standard (literal, C-like) lookup of NAME in
3976 given DOMAIN, visible from lexical block BLOCK. */
3978 static struct symbol
*
3979 standard_lookup (const char *name
, const struct block
*block
,
3984 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3986 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3987 cache_symbol (name
, domain
, sym
, block_found
);
3992 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3993 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3994 since they contend in overloading in the same way. */
3996 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4000 for (i
= 0; i
< n
; i
+= 1)
4001 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4002 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4003 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4009 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4010 struct types. Otherwise, they may not. */
4013 equiv_types (struct type
*type0
, struct type
*type1
)
4017 if (type0
== NULL
|| type1
== NULL
4018 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4020 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4021 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4022 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4023 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4029 /* True iff SYM0 represents the same entity as SYM1, or one that is
4030 no more defined than that of SYM1. */
4033 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4037 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4038 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4041 switch (SYMBOL_CLASS (sym0
))
4047 struct type
*type0
= SYMBOL_TYPE (sym0
);
4048 struct type
*type1
= SYMBOL_TYPE (sym1
);
4049 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4050 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4051 int len0
= strlen (name0
);
4053 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4054 && (equiv_types (type0
, type1
)
4055 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4056 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4059 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4060 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4066 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4067 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4070 add_defn_to_vec (struct obstack
*obstackp
,
4072 struct block
*block
)
4076 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4078 /* Do not try to complete stub types, as the debugger is probably
4079 already scanning all symbols matching a certain name at the
4080 time when this function is called. Trying to replace the stub
4081 type by its associated full type will cause us to restart a scan
4082 which may lead to an infinite recursion. Instead, the client
4083 collecting the matching symbols will end up collecting several
4084 matches, with at least one of them complete. It can then filter
4085 out the stub ones if needed. */
4087 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4089 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4091 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4093 prevDefns
[i
].sym
= sym
;
4094 prevDefns
[i
].block
= block
;
4100 struct ada_symbol_info info
;
4104 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4108 /* Number of ada_symbol_info structures currently collected in
4109 current vector in *OBSTACKP. */
4112 num_defns_collected (struct obstack
*obstackp
)
4114 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4117 /* Vector of ada_symbol_info structures currently collected in current
4118 vector in *OBSTACKP. If FINISH, close off the vector and return
4119 its final address. */
4121 static struct ada_symbol_info
*
4122 defns_collected (struct obstack
*obstackp
, int finish
)
4125 return obstack_finish (obstackp
);
4127 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4130 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4131 Check the global symbols if GLOBAL, the static symbols if not.
4132 Do wild-card match if WILD. */
4134 static struct partial_symbol
*
4135 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4136 int global
, domain_enum
namespace, int wild
)
4138 struct partial_symbol
**start
;
4139 int name_len
= strlen (name
);
4140 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4149 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4150 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4154 for (i
= 0; i
< length
; i
+= 1)
4156 struct partial_symbol
*psym
= start
[i
];
4158 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4159 SYMBOL_DOMAIN (psym
), namespace)
4160 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4174 int M
= (U
+ i
) >> 1;
4175 struct partial_symbol
*psym
= start
[M
];
4176 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4178 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4180 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4191 struct partial_symbol
*psym
= start
[i
];
4193 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4194 SYMBOL_DOMAIN (psym
), namespace))
4196 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4204 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4218 int M
= (U
+ i
) >> 1;
4219 struct partial_symbol
*psym
= start
[M
];
4220 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4222 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4224 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4235 struct partial_symbol
*psym
= start
[i
];
4237 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4238 SYMBOL_DOMAIN (psym
), namespace))
4242 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4245 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4247 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4257 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4267 /* Return a minimal symbol matching NAME according to Ada decoding
4268 rules. Returns NULL if there is no such minimal symbol. Names
4269 prefixed with "standard__" are handled specially: "standard__" is
4270 first stripped off, and only static and global symbols are searched. */
4272 struct minimal_symbol
*
4273 ada_lookup_simple_minsym (const char *name
)
4275 struct objfile
*objfile
;
4276 struct minimal_symbol
*msymbol
;
4279 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4281 name
+= sizeof ("standard__") - 1;
4285 wild_match
= (strstr (name
, "__") == NULL
);
4287 ALL_MSYMBOLS (objfile
, msymbol
)
4289 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4290 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4297 /* For all subprograms that statically enclose the subprogram of the
4298 selected frame, add symbols matching identifier NAME in DOMAIN
4299 and their blocks to the list of data in OBSTACKP, as for
4300 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4304 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4305 const char *name
, domain_enum
namespace,
4310 /* True if TYPE is definitely an artificial type supplied to a symbol
4311 for which no debugging information was given in the symbol file. */
4314 is_nondebugging_type (struct type
*type
)
4316 char *name
= ada_type_name (type
);
4317 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4320 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4321 duplicate other symbols in the list (The only case I know of where
4322 this happens is when object files containing stabs-in-ecoff are
4323 linked with files containing ordinary ecoff debugging symbols (or no
4324 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4325 Returns the number of items in the modified list. */
4328 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4337 /* If two symbols have the same name and one of them is a stub type,
4338 the get rid of the stub. */
4340 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4341 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4343 for (j
= 0; j
< nsyms
; j
++)
4346 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4347 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4348 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4349 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4354 /* Two symbols with the same name, same class and same address
4355 should be identical. */
4357 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4358 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4359 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4361 for (j
= 0; j
< nsyms
; j
+= 1)
4364 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4365 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4366 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4367 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4368 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4369 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4376 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4377 syms
[j
- 1] = syms
[j
];
4386 /* Given a type that corresponds to a renaming entity, use the type name
4387 to extract the scope (package name or function name, fully qualified,
4388 and following the GNAT encoding convention) where this renaming has been
4389 defined. The string returned needs to be deallocated after use. */
4392 xget_renaming_scope (struct type
*renaming_type
)
4394 /* The renaming types adhere to the following convention:
4395 <scope>__<rename>___<XR extension>.
4396 So, to extract the scope, we search for the "___XR" extension,
4397 and then backtrack until we find the first "__". */
4399 const char *name
= type_name_no_tag (renaming_type
);
4400 char *suffix
= strstr (name
, "___XR");
4405 /* Now, backtrack a bit until we find the first "__". Start looking
4406 at suffix - 3, as the <rename> part is at least one character long. */
4408 for (last
= suffix
- 3; last
> name
; last
--)
4409 if (last
[0] == '_' && last
[1] == '_')
4412 /* Make a copy of scope and return it. */
4414 scope_len
= last
- name
;
4415 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4417 strncpy (scope
, name
, scope_len
);
4418 scope
[scope_len
] = '\0';
4423 /* Return nonzero if NAME corresponds to a package name. */
4426 is_package_name (const char *name
)
4428 /* Here, We take advantage of the fact that no symbols are generated
4429 for packages, while symbols are generated for each function.
4430 So the condition for NAME represent a package becomes equivalent
4431 to NAME not existing in our list of symbols. There is only one
4432 small complication with library-level functions (see below). */
4436 /* If it is a function that has not been defined at library level,
4437 then we should be able to look it up in the symbols. */
4438 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4441 /* Library-level function names start with "_ada_". See if function
4442 "_ada_" followed by NAME can be found. */
4444 /* Do a quick check that NAME does not contain "__", since library-level
4445 functions names cannot contain "__" in them. */
4446 if (strstr (name
, "__") != NULL
)
4449 fun_name
= xstrprintf ("_ada_%s", name
);
4451 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4454 /* Return nonzero if SYM corresponds to a renaming entity that is
4455 not visible from FUNCTION_NAME. */
4458 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4462 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4465 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4467 make_cleanup (xfree
, scope
);
4469 /* If the rename has been defined in a package, then it is visible. */
4470 if (is_package_name (scope
))
4473 /* Check that the rename is in the current function scope by checking
4474 that its name starts with SCOPE. */
4476 /* If the function name starts with "_ada_", it means that it is
4477 a library-level function. Strip this prefix before doing the
4478 comparison, as the encoding for the renaming does not contain
4480 if (strncmp (function_name
, "_ada_", 5) == 0)
4483 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4486 /* Remove entries from SYMS that corresponds to a renaming entity that
4487 is not visible from the function associated with CURRENT_BLOCK or
4488 that is superfluous due to the presence of more specific renaming
4489 information. Places surviving symbols in the initial entries of
4490 SYMS and returns the number of surviving symbols.
4493 First, in cases where an object renaming is implemented as a
4494 reference variable, GNAT may produce both the actual reference
4495 variable and the renaming encoding. In this case, we discard the
4498 Second, GNAT emits a type following a specified encoding for each renaming
4499 entity. Unfortunately, STABS currently does not support the definition
4500 of types that are local to a given lexical block, so all renamings types
4501 are emitted at library level. As a consequence, if an application
4502 contains two renaming entities using the same name, and a user tries to
4503 print the value of one of these entities, the result of the ada symbol
4504 lookup will also contain the wrong renaming type.
4506 This function partially covers for this limitation by attempting to
4507 remove from the SYMS list renaming symbols that should be visible
4508 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4509 method with the current information available. The implementation
4510 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4512 - When the user tries to print a rename in a function while there
4513 is another rename entity defined in a package: Normally, the
4514 rename in the function has precedence over the rename in the
4515 package, so the latter should be removed from the list. This is
4516 currently not the case.
4518 - This function will incorrectly remove valid renames if
4519 the CURRENT_BLOCK corresponds to a function which symbol name
4520 has been changed by an "Export" pragma. As a consequence,
4521 the user will be unable to print such rename entities. */
4524 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4525 int nsyms
, const struct block
*current_block
)
4527 struct symbol
*current_function
;
4528 char *current_function_name
;
4530 int is_new_style_renaming
;
4532 /* If there is both a renaming foo___XR... encoded as a variable and
4533 a simple variable foo in the same block, discard the latter.
4534 First, zero out such symbols, then compress. */
4535 is_new_style_renaming
= 0;
4536 for (i
= 0; i
< nsyms
; i
+= 1)
4538 struct symbol
*sym
= syms
[i
].sym
;
4539 struct block
*block
= syms
[i
].block
;
4543 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4545 name
= SYMBOL_LINKAGE_NAME (sym
);
4546 suffix
= strstr (name
, "___XR");
4550 int name_len
= suffix
- name
;
4552 is_new_style_renaming
= 1;
4553 for (j
= 0; j
< nsyms
; j
+= 1)
4554 if (i
!= j
&& syms
[j
].sym
!= NULL
4555 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4557 && block
== syms
[j
].block
)
4561 if (is_new_style_renaming
)
4565 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4566 if (syms
[j
].sym
!= NULL
)
4574 /* Extract the function name associated to CURRENT_BLOCK.
4575 Abort if unable to do so. */
4577 if (current_block
== NULL
)
4580 current_function
= block_linkage_function (current_block
);
4581 if (current_function
== NULL
)
4584 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4585 if (current_function_name
== NULL
)
4588 /* Check each of the symbols, and remove it from the list if it is
4589 a type corresponding to a renaming that is out of the scope of
4590 the current block. */
4595 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4596 == ADA_OBJECT_RENAMING
4597 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4600 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4601 syms
[j
- 1] = syms
[j
];
4611 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4612 whose name and domain match NAME and DOMAIN respectively.
4613 If no match was found, then extend the search to "enclosing"
4614 routines (in other words, if we're inside a nested function,
4615 search the symbols defined inside the enclosing functions).
4617 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4620 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4621 struct block
*block
, domain_enum domain
,
4624 int block_depth
= 0;
4626 while (block
!= NULL
)
4629 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4631 /* If we found a non-function match, assume that's the one. */
4632 if (is_nonfunction (defns_collected (obstackp
, 0),
4633 num_defns_collected (obstackp
)))
4636 block
= BLOCK_SUPERBLOCK (block
);
4639 /* If no luck so far, try to find NAME as a local symbol in some lexically
4640 enclosing subprogram. */
4641 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4642 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4645 /* Add to OBSTACKP all non-local symbols whose name and domain match
4646 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4647 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4650 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4651 domain_enum domain
, int global
,
4654 struct objfile
*objfile
;
4655 struct partial_symtab
*ps
;
4657 ALL_PSYMTABS (objfile
, ps
)
4661 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4663 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4664 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4666 if (s
== NULL
|| !s
->primary
)
4668 ada_add_block_symbols (obstackp
,
4669 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4670 name
, domain
, objfile
, wild_match
);
4675 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4676 scope and in global scopes, returning the number of matches. Sets
4677 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4678 indicating the symbols found and the blocks and symbol tables (if
4679 any) in which they were found. This vector are transient---good only to
4680 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4681 symbol match within the nest of blocks whose innermost member is BLOCK0,
4682 is the one match returned (no other matches in that or
4683 enclosing blocks is returned). If there are any matches in or
4684 surrounding BLOCK0, then these alone are returned. Otherwise, the
4685 search extends to global and file-scope (static) symbol tables.
4686 Names prefixed with "standard__" are handled specially: "standard__"
4687 is first stripped off, and only static and global symbols are searched. */
4690 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4691 domain_enum
namespace,
4692 struct ada_symbol_info
**results
)
4695 struct block
*block
;
4701 obstack_free (&symbol_list_obstack
, NULL
);
4702 obstack_init (&symbol_list_obstack
);
4706 /* Search specified block and its superiors. */
4708 wild_match
= (strstr (name0
, "__") == NULL
);
4710 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4711 needed, but adding const will
4712 have a cascade effect. */
4714 /* Special case: If the user specifies a symbol name inside package
4715 Standard, do a non-wild matching of the symbol name without
4716 the "standard__" prefix. This was primarily introduced in order
4717 to allow the user to specifically access the standard exceptions
4718 using, for instance, Standard.Constraint_Error when Constraint_Error
4719 is ambiguous (due to the user defining its own Constraint_Error
4720 entity inside its program). */
4721 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4725 name
= name0
+ sizeof ("standard__") - 1;
4728 /* Check the non-global symbols. If we have ANY match, then we're done. */
4730 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4732 if (num_defns_collected (&symbol_list_obstack
) > 0)
4735 /* No non-global symbols found. Check our cache to see if we have
4736 already performed this search before. If we have, then return
4740 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4743 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4747 /* Search symbols from all global blocks. */
4749 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4752 /* Now add symbols from all per-file blocks if we've gotten no hits
4753 (not strictly correct, but perhaps better than an error). */
4755 if (num_defns_collected (&symbol_list_obstack
) == 0)
4756 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4760 ndefns
= num_defns_collected (&symbol_list_obstack
);
4761 *results
= defns_collected (&symbol_list_obstack
, 1);
4763 ndefns
= remove_extra_symbols (*results
, ndefns
);
4766 cache_symbol (name0
, namespace, NULL
, NULL
);
4768 if (ndefns
== 1 && cacheIfUnique
)
4769 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4771 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4777 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4778 domain_enum
namespace, struct block
**block_found
)
4780 struct ada_symbol_info
*candidates
;
4783 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4785 if (n_candidates
== 0)
4788 if (block_found
!= NULL
)
4789 *block_found
= candidates
[0].block
;
4791 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4794 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4795 scope and in global scopes, or NULL if none. NAME is folded and
4796 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4797 choosing the first symbol if there are multiple choices.
4798 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4799 table in which the symbol was found (in both cases, these
4800 assignments occur only if the pointers are non-null). */
4802 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4803 domain_enum
namespace, int *is_a_field_of_this
)
4805 if (is_a_field_of_this
!= NULL
)
4806 *is_a_field_of_this
= 0;
4809 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4810 block0
, namespace, NULL
);
4813 static struct symbol
*
4814 ada_lookup_symbol_nonlocal (const char *name
,
4815 const char *linkage_name
,
4816 const struct block
*block
,
4817 const domain_enum domain
)
4819 if (linkage_name
== NULL
)
4820 linkage_name
= name
;
4821 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4826 /* True iff STR is a possible encoded suffix of a normal Ada name
4827 that is to be ignored for matching purposes. Suffixes of parallel
4828 names (e.g., XVE) are not included here. Currently, the possible suffixes
4829 are given by any of the regular expressions:
4831 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4832 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4833 _E[0-9]+[bs]$ [protected object entry suffixes]
4834 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4836 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4837 match is performed. This sequence is used to differentiate homonyms,
4838 is an optional part of a valid name suffix. */
4841 is_name_suffix (const char *str
)
4844 const char *matching
;
4845 const int len
= strlen (str
);
4847 /* Skip optional leading __[0-9]+. */
4849 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4852 while (isdigit (str
[0]))
4858 if (str
[0] == '.' || str
[0] == '$')
4861 while (isdigit (matching
[0]))
4863 if (matching
[0] == '\0')
4869 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4872 while (isdigit (matching
[0]))
4874 if (matching
[0] == '\0')
4879 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4880 with a N at the end. Unfortunately, the compiler uses the same
4881 convention for other internal types it creates. So treating
4882 all entity names that end with an "N" as a name suffix causes
4883 some regressions. For instance, consider the case of an enumerated
4884 type. To support the 'Image attribute, it creates an array whose
4886 Having a single character like this as a suffix carrying some
4887 information is a bit risky. Perhaps we should change the encoding
4888 to be something like "_N" instead. In the meantime, do not do
4889 the following check. */
4890 /* Protected Object Subprograms */
4891 if (len
== 1 && str
[0] == 'N')
4896 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4899 while (isdigit (matching
[0]))
4901 if ((matching
[0] == 'b' || matching
[0] == 's')
4902 && matching
[1] == '\0')
4906 /* ??? We should not modify STR directly, as we are doing below. This
4907 is fine in this case, but may become problematic later if we find
4908 that this alternative did not work, and want to try matching
4909 another one from the begining of STR. Since we modified it, we
4910 won't be able to find the begining of the string anymore! */
4914 while (str
[0] != '_' && str
[0] != '\0')
4916 if (str
[0] != 'n' && str
[0] != 'b')
4922 if (str
[0] == '\000')
4927 if (str
[1] != '_' || str
[2] == '\000')
4931 if (strcmp (str
+ 3, "JM") == 0)
4933 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4934 the LJM suffix in favor of the JM one. But we will
4935 still accept LJM as a valid suffix for a reasonable
4936 amount of time, just to allow ourselves to debug programs
4937 compiled using an older version of GNAT. */
4938 if (strcmp (str
+ 3, "LJM") == 0)
4942 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4943 || str
[4] == 'U' || str
[4] == 'P')
4945 if (str
[4] == 'R' && str
[5] != 'T')
4949 if (!isdigit (str
[2]))
4951 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4952 if (!isdigit (str
[k
]) && str
[k
] != '_')
4956 if (str
[0] == '$' && isdigit (str
[1]))
4958 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4959 if (!isdigit (str
[k
]) && str
[k
] != '_')
4966 /* Return non-zero if the string starting at NAME and ending before
4967 NAME_END contains no capital letters. */
4970 is_valid_name_for_wild_match (const char *name0
)
4972 const char *decoded_name
= ada_decode (name0
);
4975 /* If the decoded name starts with an angle bracket, it means that
4976 NAME0 does not follow the GNAT encoding format. It should then
4977 not be allowed as a possible wild match. */
4978 if (decoded_name
[0] == '<')
4981 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4982 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4988 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4989 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4990 informational suffixes of NAME (i.e., for which is_name_suffix is
4994 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5001 match
= strstr (start
, patn0
);
5006 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
5007 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
5008 && is_name_suffix (match
+ patn_len
))
5009 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
5014 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5015 vector *defn_symbols, updating the list of symbols in OBSTACKP
5016 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5017 OBJFILE is the section containing BLOCK.
5018 SYMTAB is recorded with each symbol added. */
5021 ada_add_block_symbols (struct obstack
*obstackp
,
5022 struct block
*block
, const char *name
,
5023 domain_enum domain
, struct objfile
*objfile
,
5026 struct dict_iterator iter
;
5027 int name_len
= strlen (name
);
5028 /* A matching argument symbol, if any. */
5029 struct symbol
*arg_sym
;
5030 /* Set true when we find a matching non-argument symbol. */
5039 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5041 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5042 SYMBOL_DOMAIN (sym
), domain
)
5043 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5045 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5047 else if (SYMBOL_IS_ARGUMENT (sym
))
5052 add_defn_to_vec (obstackp
,
5053 fixup_symbol_section (sym
, objfile
),
5061 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5063 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5064 SYMBOL_DOMAIN (sym
), domain
))
5066 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5068 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5070 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5072 if (SYMBOL_IS_ARGUMENT (sym
))
5077 add_defn_to_vec (obstackp
,
5078 fixup_symbol_section (sym
, objfile
),
5087 if (!found_sym
&& arg_sym
!= NULL
)
5089 add_defn_to_vec (obstackp
,
5090 fixup_symbol_section (arg_sym
, objfile
),
5099 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5101 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5102 SYMBOL_DOMAIN (sym
), domain
))
5106 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5109 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5111 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5116 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5118 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5120 if (SYMBOL_IS_ARGUMENT (sym
))
5125 add_defn_to_vec (obstackp
,
5126 fixup_symbol_section (sym
, objfile
),
5134 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5135 They aren't parameters, right? */
5136 if (!found_sym
&& arg_sym
!= NULL
)
5138 add_defn_to_vec (obstackp
,
5139 fixup_symbol_section (arg_sym
, objfile
),
5146 /* Symbol Completion */
5148 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5149 name in a form that's appropriate for the completion. The result
5150 does not need to be deallocated, but is only good until the next call.
5152 TEXT_LEN is equal to the length of TEXT.
5153 Perform a wild match if WILD_MATCH is set.
5154 ENCODED should be set if TEXT represents the start of a symbol name
5155 in its encoded form. */
5158 symbol_completion_match (const char *sym_name
,
5159 const char *text
, int text_len
,
5160 int wild_match
, int encoded
)
5163 const int verbatim_match
= (text
[0] == '<');
5168 /* Strip the leading angle bracket. */
5173 /* First, test against the fully qualified name of the symbol. */
5175 if (strncmp (sym_name
, text
, text_len
) == 0)
5178 if (match
&& !encoded
)
5180 /* One needed check before declaring a positive match is to verify
5181 that iff we are doing a verbatim match, the decoded version
5182 of the symbol name starts with '<'. Otherwise, this symbol name
5183 is not a suitable completion. */
5184 const char *sym_name_copy
= sym_name
;
5185 int has_angle_bracket
;
5187 sym_name
= ada_decode (sym_name
);
5188 has_angle_bracket
= (sym_name
[0] == '<');
5189 match
= (has_angle_bracket
== verbatim_match
);
5190 sym_name
= sym_name_copy
;
5193 if (match
&& !verbatim_match
)
5195 /* When doing non-verbatim match, another check that needs to
5196 be done is to verify that the potentially matching symbol name
5197 does not include capital letters, because the ada-mode would
5198 not be able to understand these symbol names without the
5199 angle bracket notation. */
5202 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5207 /* Second: Try wild matching... */
5209 if (!match
&& wild_match
)
5211 /* Since we are doing wild matching, this means that TEXT
5212 may represent an unqualified symbol name. We therefore must
5213 also compare TEXT against the unqualified name of the symbol. */
5214 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5216 if (strncmp (sym_name
, text
, text_len
) == 0)
5220 /* Finally: If we found a mach, prepare the result to return. */
5226 sym_name
= add_angle_brackets (sym_name
);
5229 sym_name
= ada_decode (sym_name
);
5234 typedef char *char_ptr
;
5235 DEF_VEC_P (char_ptr
);
5237 /* A companion function to ada_make_symbol_completion_list().
5238 Check if SYM_NAME represents a symbol which name would be suitable
5239 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5240 it is appended at the end of the given string vector SV.
5242 ORIG_TEXT is the string original string from the user command
5243 that needs to be completed. WORD is the entire command on which
5244 completion should be performed. These two parameters are used to
5245 determine which part of the symbol name should be added to the
5247 if WILD_MATCH is set, then wild matching is performed.
5248 ENCODED should be set if TEXT represents a symbol name in its
5249 encoded formed (in which case the completion should also be
5253 symbol_completion_add (VEC(char_ptr
) **sv
,
5254 const char *sym_name
,
5255 const char *text
, int text_len
,
5256 const char *orig_text
, const char *word
,
5257 int wild_match
, int encoded
)
5259 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5260 wild_match
, encoded
);
5266 /* We found a match, so add the appropriate completion to the given
5269 if (word
== orig_text
)
5271 completion
= xmalloc (strlen (match
) + 5);
5272 strcpy (completion
, match
);
5274 else if (word
> orig_text
)
5276 /* Return some portion of sym_name. */
5277 completion
= xmalloc (strlen (match
) + 5);
5278 strcpy (completion
, match
+ (word
- orig_text
));
5282 /* Return some of ORIG_TEXT plus sym_name. */
5283 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5284 strncpy (completion
, word
, orig_text
- word
);
5285 completion
[orig_text
- word
] = '\0';
5286 strcat (completion
, match
);
5289 VEC_safe_push (char_ptr
, *sv
, completion
);
5292 /* Return a list of possible symbol names completing TEXT0. The list
5293 is NULL terminated. WORD is the entire command on which completion
5297 ada_make_symbol_completion_list (char *text0
, char *word
)
5303 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5306 struct partial_symtab
*ps
;
5307 struct minimal_symbol
*msymbol
;
5308 struct objfile
*objfile
;
5309 struct block
*b
, *surrounding_static_block
= 0;
5311 struct dict_iterator iter
;
5313 if (text0
[0] == '<')
5315 text
= xstrdup (text0
);
5316 make_cleanup (xfree
, text
);
5317 text_len
= strlen (text
);
5323 text
= xstrdup (ada_encode (text0
));
5324 make_cleanup (xfree
, text
);
5325 text_len
= strlen (text
);
5326 for (i
= 0; i
< text_len
; i
++)
5327 text
[i
] = tolower (text
[i
]);
5329 encoded
= (strstr (text0
, "__") != NULL
);
5330 /* If the name contains a ".", then the user is entering a fully
5331 qualified entity name, and the match must not be done in wild
5332 mode. Similarly, if the user wants to complete what looks like
5333 an encoded name, the match must not be done in wild mode. */
5334 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5337 /* First, look at the partial symtab symbols. */
5338 ALL_PSYMTABS (objfile
, ps
)
5340 struct partial_symbol
**psym
;
5342 /* If the psymtab's been read in we'll get it when we search
5343 through the blockvector. */
5347 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5348 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5349 + ps
->n_global_syms
); psym
++)
5352 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5353 text
, text_len
, text0
, word
,
5354 wild_match
, encoded
);
5357 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5358 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5359 + ps
->n_static_syms
); psym
++)
5362 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5363 text
, text_len
, text0
, word
,
5364 wild_match
, encoded
);
5368 /* At this point scan through the misc symbol vectors and add each
5369 symbol you find to the list. Eventually we want to ignore
5370 anything that isn't a text symbol (everything else will be
5371 handled by the psymtab code above). */
5373 ALL_MSYMBOLS (objfile
, msymbol
)
5376 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5377 text
, text_len
, text0
, word
, wild_match
, encoded
);
5380 /* Search upwards from currently selected frame (so that we can
5381 complete on local vars. */
5383 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5385 if (!BLOCK_SUPERBLOCK (b
))
5386 surrounding_static_block
= b
; /* For elmin of dups */
5388 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5390 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5391 text
, text_len
, text0
, word
,
5392 wild_match
, encoded
);
5396 /* Go through the symtabs and check the externs and statics for
5397 symbols which match. */
5399 ALL_SYMTABS (objfile
, s
)
5402 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5403 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5405 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5406 text
, text_len
, text0
, word
,
5407 wild_match
, encoded
);
5411 ALL_SYMTABS (objfile
, s
)
5414 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5415 /* Don't do this block twice. */
5416 if (b
== surrounding_static_block
)
5418 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5420 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5421 text
, text_len
, text0
, word
,
5422 wild_match
, encoded
);
5426 /* Append the closing NULL entry. */
5427 VEC_safe_push (char_ptr
, completions
, NULL
);
5429 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5430 return the copy. It's unfortunate that we have to make a copy
5431 of an array that we're about to destroy, but there is nothing much
5432 we can do about it. Fortunately, it's typically not a very large
5435 const size_t completions_size
=
5436 VEC_length (char_ptr
, completions
) * sizeof (char *);
5437 char **result
= malloc (completions_size
);
5439 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5441 VEC_free (char_ptr
, completions
);
5448 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5449 for tagged types. */
5452 ada_is_dispatch_table_ptr_type (struct type
*type
)
5456 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5459 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5463 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5466 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5467 to be invisible to users. */
5470 ada_is_ignored_field (struct type
*type
, int field_num
)
5472 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5475 /* Check the name of that field. */
5477 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5479 /* Anonymous field names should not be printed.
5480 brobecker/2007-02-20: I don't think this can actually happen
5481 but we don't want to print the value of annonymous fields anyway. */
5485 /* A field named "_parent" is internally generated by GNAT for
5486 tagged types, and should not be printed either. */
5487 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5491 /* If this is the dispatch table of a tagged type, then ignore. */
5492 if (ada_is_tagged_type (type
, 1)
5493 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5496 /* Not a special field, so it should not be ignored. */
5500 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5501 pointer or reference type whose ultimate target has a tag field. */
5504 ada_is_tagged_type (struct type
*type
, int refok
)
5506 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5509 /* True iff TYPE represents the type of X'Tag */
5512 ada_is_tag_type (struct type
*type
)
5514 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5518 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5519 return (name
!= NULL
5520 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5524 /* The type of the tag on VAL. */
5527 ada_tag_type (struct value
*val
)
5529 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5532 /* The value of the tag on VAL. */
5535 ada_value_tag (struct value
*val
)
5537 return ada_value_struct_elt (val
, "_tag", 0);
5540 /* The value of the tag on the object of type TYPE whose contents are
5541 saved at VALADDR, if it is non-null, or is at memory address
5544 static struct value
*
5545 value_tag_from_contents_and_address (struct type
*type
,
5546 const gdb_byte
*valaddr
,
5549 int tag_byte_offset
, dummy1
, dummy2
;
5550 struct type
*tag_type
;
5551 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5554 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5556 : valaddr
+ tag_byte_offset
);
5557 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5559 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5564 static struct type
*
5565 type_from_tag (struct value
*tag
)
5567 const char *type_name
= ada_tag_name (tag
);
5568 if (type_name
!= NULL
)
5569 return ada_find_any_type (ada_encode (type_name
));
5580 static int ada_tag_name_1 (void *);
5581 static int ada_tag_name_2 (struct tag_args
*);
5583 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5584 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5585 The value stored in ARGS->name is valid until the next call to
5589 ada_tag_name_1 (void *args0
)
5591 struct tag_args
*args
= (struct tag_args
*) args0
;
5592 static char name
[1024];
5596 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5598 return ada_tag_name_2 (args
);
5599 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5602 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5603 for (p
= name
; *p
!= '\0'; p
+= 1)
5610 /* Utility function for ada_tag_name_1 that tries the second
5611 representation for the dispatch table (in which there is no
5612 explicit 'tsd' field in the referent of the tag pointer, and instead
5613 the tsd pointer is stored just before the dispatch table. */
5616 ada_tag_name_2 (struct tag_args
*args
)
5618 struct type
*info_type
;
5619 static char name
[1024];
5621 struct value
*val
, *valp
;
5624 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5625 if (info_type
== NULL
)
5627 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5628 valp
= value_cast (info_type
, args
->tag
);
5631 val
= value_ind (value_ptradd (valp
, -1));
5634 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5637 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5638 for (p
= name
; *p
!= '\0'; p
+= 1)
5645 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5649 ada_tag_name (struct value
*tag
)
5651 struct tag_args args
;
5652 if (!ada_is_tag_type (value_type (tag
)))
5656 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5660 /* The parent type of TYPE, or NULL if none. */
5663 ada_parent_type (struct type
*type
)
5667 type
= ada_check_typedef (type
);
5669 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5672 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5673 if (ada_is_parent_field (type
, i
))
5675 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5677 /* If the _parent field is a pointer, then dereference it. */
5678 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5679 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5680 /* If there is a parallel XVS type, get the actual base type. */
5681 parent_type
= ada_get_base_type (parent_type
);
5683 return ada_check_typedef (parent_type
);
5689 /* True iff field number FIELD_NUM of structure type TYPE contains the
5690 parent-type (inherited) fields of a derived type. Assumes TYPE is
5691 a structure type with at least FIELD_NUM+1 fields. */
5694 ada_is_parent_field (struct type
*type
, int field_num
)
5696 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5697 return (name
!= NULL
5698 && (strncmp (name
, "PARENT", 6) == 0
5699 || strncmp (name
, "_parent", 7) == 0));
5702 /* True iff field number FIELD_NUM of structure type TYPE is a
5703 transparent wrapper field (which should be silently traversed when doing
5704 field selection and flattened when printing). Assumes TYPE is a
5705 structure type with at least FIELD_NUM+1 fields. Such fields are always
5709 ada_is_wrapper_field (struct type
*type
, int field_num
)
5711 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5712 return (name
!= NULL
5713 && (strncmp (name
, "PARENT", 6) == 0
5714 || strcmp (name
, "REP") == 0
5715 || strncmp (name
, "_parent", 7) == 0
5716 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5719 /* True iff field number FIELD_NUM of structure or union type TYPE
5720 is a variant wrapper. Assumes TYPE is a structure type with at least
5721 FIELD_NUM+1 fields. */
5724 ada_is_variant_part (struct type
*type
, int field_num
)
5726 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5727 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5728 || (is_dynamic_field (type
, field_num
)
5729 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5730 == TYPE_CODE_UNION
)));
5733 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5734 whose discriminants are contained in the record type OUTER_TYPE,
5735 returns the type of the controlling discriminant for the variant.
5736 May return NULL if the type could not be found. */
5739 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5741 char *name
= ada_variant_discrim_name (var_type
);
5742 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5745 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5746 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5747 represents a 'when others' clause; otherwise 0. */
5750 ada_is_others_clause (struct type
*type
, int field_num
)
5752 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5753 return (name
!= NULL
&& name
[0] == 'O');
5756 /* Assuming that TYPE0 is the type of the variant part of a record,
5757 returns the name of the discriminant controlling the variant.
5758 The value is valid until the next call to ada_variant_discrim_name. */
5761 ada_variant_discrim_name (struct type
*type0
)
5763 static char *result
= NULL
;
5764 static size_t result_len
= 0;
5767 const char *discrim_end
;
5768 const char *discrim_start
;
5770 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5771 type
= TYPE_TARGET_TYPE (type0
);
5775 name
= ada_type_name (type
);
5777 if (name
== NULL
|| name
[0] == '\000')
5780 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5783 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5786 if (discrim_end
== name
)
5789 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5792 if (discrim_start
== name
+ 1)
5794 if ((discrim_start
> name
+ 3
5795 && strncmp (discrim_start
- 3, "___", 3) == 0)
5796 || discrim_start
[-1] == '.')
5800 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5801 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5802 result
[discrim_end
- discrim_start
] = '\0';
5806 /* Scan STR for a subtype-encoded number, beginning at position K.
5807 Put the position of the character just past the number scanned in
5808 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5809 Return 1 if there was a valid number at the given position, and 0
5810 otherwise. A "subtype-encoded" number consists of the absolute value
5811 in decimal, followed by the letter 'm' to indicate a negative number.
5812 Assumes 0m does not occur. */
5815 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5819 if (!isdigit (str
[k
]))
5822 /* Do it the hard way so as not to make any assumption about
5823 the relationship of unsigned long (%lu scan format code) and
5826 while (isdigit (str
[k
]))
5828 RU
= RU
* 10 + (str
[k
] - '0');
5835 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5841 /* NOTE on the above: Technically, C does not say what the results of
5842 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5843 number representable as a LONGEST (although either would probably work
5844 in most implementations). When RU>0, the locution in the then branch
5845 above is always equivalent to the negative of RU. */
5852 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5853 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5854 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5857 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5859 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5872 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5881 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5882 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5884 if (val
>= L
&& val
<= U
)
5896 /* FIXME: Lots of redundancy below. Try to consolidate. */
5898 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5899 ARG_TYPE, extract and return the value of one of its (non-static)
5900 fields. FIELDNO says which field. Differs from value_primitive_field
5901 only in that it can handle packed values of arbitrary type. */
5903 static struct value
*
5904 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5905 struct type
*arg_type
)
5909 arg_type
= ada_check_typedef (arg_type
);
5910 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5912 /* Handle packed fields. */
5914 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5916 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5917 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5919 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5920 offset
+ bit_pos
/ 8,
5921 bit_pos
% 8, bit_size
, type
);
5924 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5927 /* Find field with name NAME in object of type TYPE. If found,
5928 set the following for each argument that is non-null:
5929 - *FIELD_TYPE_P to the field's type;
5930 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5931 an object of that type;
5932 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5933 - *BIT_SIZE_P to its size in bits if the field is packed, and
5935 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5936 fields up to but not including the desired field, or by the total
5937 number of fields if not found. A NULL value of NAME never
5938 matches; the function just counts visible fields in this case.
5940 Returns 1 if found, 0 otherwise. */
5943 find_struct_field (char *name
, struct type
*type
, int offset
,
5944 struct type
**field_type_p
,
5945 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5950 type
= ada_check_typedef (type
);
5952 if (field_type_p
!= NULL
)
5953 *field_type_p
= NULL
;
5954 if (byte_offset_p
!= NULL
)
5956 if (bit_offset_p
!= NULL
)
5958 if (bit_size_p
!= NULL
)
5961 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5963 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5964 int fld_offset
= offset
+ bit_pos
/ 8;
5965 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5967 if (t_field_name
== NULL
)
5970 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5972 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5973 if (field_type_p
!= NULL
)
5974 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5975 if (byte_offset_p
!= NULL
)
5976 *byte_offset_p
= fld_offset
;
5977 if (bit_offset_p
!= NULL
)
5978 *bit_offset_p
= bit_pos
% 8;
5979 if (bit_size_p
!= NULL
)
5980 *bit_size_p
= bit_size
;
5983 else if (ada_is_wrapper_field (type
, i
))
5985 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5986 field_type_p
, byte_offset_p
, bit_offset_p
,
5987 bit_size_p
, index_p
))
5990 else if (ada_is_variant_part (type
, i
))
5992 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5995 struct type
*field_type
5996 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5998 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6000 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6002 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6003 field_type_p
, byte_offset_p
,
6004 bit_offset_p
, bit_size_p
, index_p
))
6008 else if (index_p
!= NULL
)
6014 /* Number of user-visible fields in record type TYPE. */
6017 num_visible_fields (struct type
*type
)
6021 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6025 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6026 and search in it assuming it has (class) type TYPE.
6027 If found, return value, else return NULL.
6029 Searches recursively through wrapper fields (e.g., '_parent'). */
6031 static struct value
*
6032 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6036 type
= ada_check_typedef (type
);
6038 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6040 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6042 if (t_field_name
== NULL
)
6045 else if (field_name_match (t_field_name
, name
))
6046 return ada_value_primitive_field (arg
, offset
, i
, type
);
6048 else if (ada_is_wrapper_field (type
, i
))
6050 struct value
*v
= /* Do not let indent join lines here. */
6051 ada_search_struct_field (name
, arg
,
6052 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6053 TYPE_FIELD_TYPE (type
, i
));
6058 else if (ada_is_variant_part (type
, i
))
6060 /* PNH: Do we ever get here? See find_struct_field. */
6062 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6063 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6065 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6067 struct value
*v
= ada_search_struct_field
/* Force line break. */
6069 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6070 TYPE_FIELD_TYPE (field_type
, j
));
6079 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6080 int, struct type
*);
6083 /* Return field #INDEX in ARG, where the index is that returned by
6084 * find_struct_field through its INDEX_P argument. Adjust the address
6085 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6086 * If found, return value, else return NULL. */
6088 static struct value
*
6089 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6092 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6096 /* Auxiliary function for ada_index_struct_field. Like
6097 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6100 static struct value
*
6101 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6105 type
= ada_check_typedef (type
);
6107 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6109 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6111 else if (ada_is_wrapper_field (type
, i
))
6113 struct value
*v
= /* Do not let indent join lines here. */
6114 ada_index_struct_field_1 (index_p
, arg
,
6115 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6116 TYPE_FIELD_TYPE (type
, i
));
6121 else if (ada_is_variant_part (type
, i
))
6123 /* PNH: Do we ever get here? See ada_search_struct_field,
6124 find_struct_field. */
6125 error (_("Cannot assign this kind of variant record"));
6127 else if (*index_p
== 0)
6128 return ada_value_primitive_field (arg
, offset
, i
, type
);
6135 /* Given ARG, a value of type (pointer or reference to a)*
6136 structure/union, extract the component named NAME from the ultimate
6137 target structure/union and return it as a value with its
6140 The routine searches for NAME among all members of the structure itself
6141 and (recursively) among all members of any wrapper members
6144 If NO_ERR, then simply return NULL in case of error, rather than
6148 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6150 struct type
*t
, *t1
;
6154 t1
= t
= ada_check_typedef (value_type (arg
));
6155 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6157 t1
= TYPE_TARGET_TYPE (t
);
6160 t1
= ada_check_typedef (t1
);
6161 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6163 arg
= coerce_ref (arg
);
6168 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6170 t1
= TYPE_TARGET_TYPE (t
);
6173 t1
= ada_check_typedef (t1
);
6174 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6176 arg
= value_ind (arg
);
6183 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6187 v
= ada_search_struct_field (name
, arg
, 0, t
);
6190 int bit_offset
, bit_size
, byte_offset
;
6191 struct type
*field_type
;
6194 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6195 address
= value_as_address (arg
);
6197 address
= unpack_pointer (t
, value_contents (arg
));
6199 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6200 if (find_struct_field (name
, t1
, 0,
6201 &field_type
, &byte_offset
, &bit_offset
,
6206 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6207 arg
= ada_coerce_ref (arg
);
6209 arg
= ada_value_ind (arg
);
6210 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6211 bit_offset
, bit_size
,
6215 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6219 if (v
!= NULL
|| no_err
)
6222 error (_("There is no member named %s."), name
);
6228 error (_("Attempt to extract a component of a value that is not a record."));
6231 /* Given a type TYPE, look up the type of the component of type named NAME.
6232 If DISPP is non-null, add its byte displacement from the beginning of a
6233 structure (pointed to by a value) of type TYPE to *DISPP (does not
6234 work for packed fields).
6236 Matches any field whose name has NAME as a prefix, possibly
6239 TYPE can be either a struct or union. If REFOK, TYPE may also
6240 be a (pointer or reference)+ to a struct or union, and the
6241 ultimate target type will be searched.
6243 Looks recursively into variant clauses and parent types.
6245 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6246 TYPE is not a type of the right kind. */
6248 static struct type
*
6249 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6250 int noerr
, int *dispp
)
6257 if (refok
&& type
!= NULL
)
6260 type
= ada_check_typedef (type
);
6261 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6262 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6264 type
= TYPE_TARGET_TYPE (type
);
6268 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6269 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6275 target_terminal_ours ();
6276 gdb_flush (gdb_stdout
);
6278 error (_("Type (null) is not a structure or union type"));
6281 /* XXX: type_sprint */
6282 fprintf_unfiltered (gdb_stderr
, _("Type "));
6283 type_print (type
, "", gdb_stderr
, -1);
6284 error (_(" is not a structure or union type"));
6289 type
= to_static_fixed_type (type
);
6291 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6293 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6297 if (t_field_name
== NULL
)
6300 else if (field_name_match (t_field_name
, name
))
6303 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6304 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6307 else if (ada_is_wrapper_field (type
, i
))
6310 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6315 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6320 else if (ada_is_variant_part (type
, i
))
6323 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6325 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6327 /* FIXME pnh 2008/01/26: We check for a field that is
6328 NOT wrapped in a struct, since the compiler sometimes
6329 generates these for unchecked variant types. Revisit
6330 if the compiler changes this practice. */
6331 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6333 if (v_field_name
!= NULL
6334 && field_name_match (v_field_name
, name
))
6335 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6337 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6343 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6354 target_terminal_ours ();
6355 gdb_flush (gdb_stdout
);
6358 /* XXX: type_sprint */
6359 fprintf_unfiltered (gdb_stderr
, _("Type "));
6360 type_print (type
, "", gdb_stderr
, -1);
6361 error (_(" has no component named <null>"));
6365 /* XXX: type_sprint */
6366 fprintf_unfiltered (gdb_stderr
, _("Type "));
6367 type_print (type
, "", gdb_stderr
, -1);
6368 error (_(" has no component named %s"), name
);
6375 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6376 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6377 represents an unchecked union (that is, the variant part of a
6378 record that is named in an Unchecked_Union pragma). */
6381 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6383 char *discrim_name
= ada_variant_discrim_name (var_type
);
6384 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6389 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6390 within a value of type OUTER_TYPE that is stored in GDB at
6391 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6392 numbering from 0) is applicable. Returns -1 if none are. */
6395 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6396 const gdb_byte
*outer_valaddr
)
6400 char *discrim_name
= ada_variant_discrim_name (var_type
);
6401 struct value
*outer
;
6402 struct value
*discrim
;
6403 LONGEST discrim_val
;
6405 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6406 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6407 if (discrim
== NULL
)
6409 discrim_val
= value_as_long (discrim
);
6412 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6414 if (ada_is_others_clause (var_type
, i
))
6416 else if (ada_in_variant (discrim_val
, var_type
, i
))
6420 return others_clause
;
6425 /* Dynamic-Sized Records */
6427 /* Strategy: The type ostensibly attached to a value with dynamic size
6428 (i.e., a size that is not statically recorded in the debugging
6429 data) does not accurately reflect the size or layout of the value.
6430 Our strategy is to convert these values to values with accurate,
6431 conventional types that are constructed on the fly. */
6433 /* There is a subtle and tricky problem here. In general, we cannot
6434 determine the size of dynamic records without its data. However,
6435 the 'struct value' data structure, which GDB uses to represent
6436 quantities in the inferior process (the target), requires the size
6437 of the type at the time of its allocation in order to reserve space
6438 for GDB's internal copy of the data. That's why the
6439 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6440 rather than struct value*s.
6442 However, GDB's internal history variables ($1, $2, etc.) are
6443 struct value*s containing internal copies of the data that are not, in
6444 general, the same as the data at their corresponding addresses in
6445 the target. Fortunately, the types we give to these values are all
6446 conventional, fixed-size types (as per the strategy described
6447 above), so that we don't usually have to perform the
6448 'to_fixed_xxx_type' conversions to look at their values.
6449 Unfortunately, there is one exception: if one of the internal
6450 history variables is an array whose elements are unconstrained
6451 records, then we will need to create distinct fixed types for each
6452 element selected. */
6454 /* The upshot of all of this is that many routines take a (type, host
6455 address, target address) triple as arguments to represent a value.
6456 The host address, if non-null, is supposed to contain an internal
6457 copy of the relevant data; otherwise, the program is to consult the
6458 target at the target address. */
6460 /* Assuming that VAL0 represents a pointer value, the result of
6461 dereferencing it. Differs from value_ind in its treatment of
6462 dynamic-sized types. */
6465 ada_value_ind (struct value
*val0
)
6467 struct value
*val
= unwrap_value (value_ind (val0
));
6468 return ada_to_fixed_value (val
);
6471 /* The value resulting from dereferencing any "reference to"
6472 qualifiers on VAL0. */
6474 static struct value
*
6475 ada_coerce_ref (struct value
*val0
)
6477 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6479 struct value
*val
= val0
;
6480 val
= coerce_ref (val
);
6481 val
= unwrap_value (val
);
6482 return ada_to_fixed_value (val
);
6488 /* Return OFF rounded upward if necessary to a multiple of
6489 ALIGNMENT (a power of 2). */
6492 align_value (unsigned int off
, unsigned int alignment
)
6494 return (off
+ alignment
- 1) & ~(alignment
- 1);
6497 /* Return the bit alignment required for field #F of template type TYPE. */
6500 field_alignment (struct type
*type
, int f
)
6502 const char *name
= TYPE_FIELD_NAME (type
, f
);
6506 /* The field name should never be null, unless the debugging information
6507 is somehow malformed. In this case, we assume the field does not
6508 require any alignment. */
6512 len
= strlen (name
);
6514 if (!isdigit (name
[len
- 1]))
6517 if (isdigit (name
[len
- 2]))
6518 align_offset
= len
- 2;
6520 align_offset
= len
- 1;
6522 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6523 return TARGET_CHAR_BIT
;
6525 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6528 /* Find a symbol named NAME. Ignores ambiguity. */
6531 ada_find_any_symbol (const char *name
)
6535 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6536 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6539 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6543 /* Find a type named NAME. Ignores ambiguity. This routine will look
6544 solely for types defined by debug info, it will not search the GDB
6548 ada_find_any_type (const char *name
)
6550 struct symbol
*sym
= ada_find_any_symbol (name
);
6553 return SYMBOL_TYPE (sym
);
6558 /* Given NAME and an associated BLOCK, search all symbols for
6559 NAME suffixed with "___XR", which is the ``renaming'' symbol
6560 associated to NAME. Return this symbol if found, return
6564 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6568 sym
= find_old_style_renaming_symbol (name
, block
);
6573 /* Not right yet. FIXME pnh 7/20/2007. */
6574 sym
= ada_find_any_symbol (name
);
6575 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6581 static struct symbol
*
6582 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6584 const struct symbol
*function_sym
= block_linkage_function (block
);
6587 if (function_sym
!= NULL
)
6589 /* If the symbol is defined inside a function, NAME is not fully
6590 qualified. This means we need to prepend the function name
6591 as well as adding the ``___XR'' suffix to build the name of
6592 the associated renaming symbol. */
6593 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6594 /* Function names sometimes contain suffixes used
6595 for instance to qualify nested subprograms. When building
6596 the XR type name, we need to make sure that this suffix is
6597 not included. So do not include any suffix in the function
6598 name length below. */
6599 int function_name_len
= ada_name_prefix_len (function_name
);
6600 const int rename_len
= function_name_len
+ 2 /* "__" */
6601 + strlen (name
) + 6 /* "___XR\0" */ ;
6603 /* Strip the suffix if necessary. */
6604 ada_remove_trailing_digits (function_name
, &function_name_len
);
6605 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
6606 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
6608 /* Library-level functions are a special case, as GNAT adds
6609 a ``_ada_'' prefix to the function name to avoid namespace
6610 pollution. However, the renaming symbols themselves do not
6611 have this prefix, so we need to skip this prefix if present. */
6612 if (function_name_len
> 5 /* "_ada_" */
6613 && strstr (function_name
, "_ada_") == function_name
)
6616 function_name_len
-= 5;
6619 rename
= (char *) alloca (rename_len
* sizeof (char));
6620 strncpy (rename
, function_name
, function_name_len
);
6621 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
6626 const int rename_len
= strlen (name
) + 6;
6627 rename
= (char *) alloca (rename_len
* sizeof (char));
6628 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6631 return ada_find_any_symbol (rename
);
6634 /* Because of GNAT encoding conventions, several GDB symbols may match a
6635 given type name. If the type denoted by TYPE0 is to be preferred to
6636 that of TYPE1 for purposes of type printing, return non-zero;
6637 otherwise return 0. */
6640 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6644 else if (type0
== NULL
)
6646 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6648 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6650 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6652 else if (ada_is_constrained_packed_array_type (type0
))
6654 else if (ada_is_array_descriptor_type (type0
)
6655 && !ada_is_array_descriptor_type (type1
))
6659 const char *type0_name
= type_name_no_tag (type0
);
6660 const char *type1_name
= type_name_no_tag (type1
);
6662 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6663 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6669 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6670 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6673 ada_type_name (struct type
*type
)
6677 else if (TYPE_NAME (type
) != NULL
)
6678 return TYPE_NAME (type
);
6680 return TYPE_TAG_NAME (type
);
6683 /* Find a parallel type to TYPE whose name is formed by appending
6684 SUFFIX to the name of TYPE. */
6687 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6690 static size_t name_len
= 0;
6692 char *typename
= ada_type_name (type
);
6694 if (typename
== NULL
)
6697 len
= strlen (typename
);
6699 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6701 strcpy (name
, typename
);
6702 strcpy (name
+ len
, suffix
);
6704 return ada_find_any_type (name
);
6708 /* If TYPE is a variable-size record type, return the corresponding template
6709 type describing its fields. Otherwise, return NULL. */
6711 static struct type
*
6712 dynamic_template_type (struct type
*type
)
6714 type
= ada_check_typedef (type
);
6716 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6717 || ada_type_name (type
) == NULL
)
6721 int len
= strlen (ada_type_name (type
));
6722 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6725 return ada_find_parallel_type (type
, "___XVE");
6729 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6730 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6733 is_dynamic_field (struct type
*templ_type
, int field_num
)
6735 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6737 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6738 && strstr (name
, "___XVL") != NULL
;
6741 /* The index of the variant field of TYPE, or -1 if TYPE does not
6742 represent a variant record type. */
6745 variant_field_index (struct type
*type
)
6749 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6752 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6754 if (ada_is_variant_part (type
, f
))
6760 /* A record type with no fields. */
6762 static struct type
*
6763 empty_record (struct type
*template)
6765 struct type
*type
= alloc_type_copy (template);
6766 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6767 TYPE_NFIELDS (type
) = 0;
6768 TYPE_FIELDS (type
) = NULL
;
6769 INIT_CPLUS_SPECIFIC (type
);
6770 TYPE_NAME (type
) = "<empty>";
6771 TYPE_TAG_NAME (type
) = NULL
;
6772 TYPE_LENGTH (type
) = 0;
6776 /* An ordinary record type (with fixed-length fields) that describes
6777 the value of type TYPE at VALADDR or ADDRESS (see comments at
6778 the beginning of this section) VAL according to GNAT conventions.
6779 DVAL0 should describe the (portion of a) record that contains any
6780 necessary discriminants. It should be NULL if value_type (VAL) is
6781 an outer-level type (i.e., as opposed to a branch of a variant.) A
6782 variant field (unless unchecked) is replaced by a particular branch
6785 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6786 length are not statically known are discarded. As a consequence,
6787 VALADDR, ADDRESS and DVAL0 are ignored.
6789 NOTE: Limitations: For now, we assume that dynamic fields and
6790 variants occupy whole numbers of bytes. However, they need not be
6794 ada_template_to_fixed_record_type_1 (struct type
*type
,
6795 const gdb_byte
*valaddr
,
6796 CORE_ADDR address
, struct value
*dval0
,
6797 int keep_dynamic_fields
)
6799 struct value
*mark
= value_mark ();
6802 int nfields
, bit_len
;
6805 int fld_bit_len
, bit_incr
;
6808 /* Compute the number of fields in this record type that are going
6809 to be processed: unless keep_dynamic_fields, this includes only
6810 fields whose position and length are static will be processed. */
6811 if (keep_dynamic_fields
)
6812 nfields
= TYPE_NFIELDS (type
);
6816 while (nfields
< TYPE_NFIELDS (type
)
6817 && !ada_is_variant_part (type
, nfields
)
6818 && !is_dynamic_field (type
, nfields
))
6822 rtype
= alloc_type_copy (type
);
6823 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6824 INIT_CPLUS_SPECIFIC (rtype
);
6825 TYPE_NFIELDS (rtype
) = nfields
;
6826 TYPE_FIELDS (rtype
) = (struct field
*)
6827 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6828 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6829 TYPE_NAME (rtype
) = ada_type_name (type
);
6830 TYPE_TAG_NAME (rtype
) = NULL
;
6831 TYPE_FIXED_INSTANCE (rtype
) = 1;
6837 for (f
= 0; f
< nfields
; f
+= 1)
6839 off
= align_value (off
, field_alignment (type
, f
))
6840 + TYPE_FIELD_BITPOS (type
, f
);
6841 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6842 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6844 if (ada_is_variant_part (type
, f
))
6847 fld_bit_len
= bit_incr
= 0;
6849 else if (is_dynamic_field (type
, f
))
6851 const gdb_byte
*field_valaddr
= valaddr
;
6852 CORE_ADDR field_address
= address
;
6853 struct type
*field_type
=
6854 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
6858 /* rtype's length is computed based on the run-time
6859 value of discriminants. If the discriminants are not
6860 initialized, the type size may be completely bogus and
6861 GDB may fail to allocate a value for it. So check the
6862 size first before creating the value. */
6864 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6869 /* If the type referenced by this field is an aligner type, we need
6870 to unwrap that aligner type, because its size might not be set.
6871 Keeping the aligner type would cause us to compute the wrong
6872 size for this field, impacting the offset of the all the fields
6873 that follow this one. */
6874 if (ada_is_aligner_type (field_type
))
6876 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
6878 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
6879 field_address
= cond_offset_target (field_address
, field_offset
);
6880 field_type
= ada_aligned_type (field_type
);
6883 field_valaddr
= cond_offset_host (field_valaddr
,
6884 off
/ TARGET_CHAR_BIT
);
6885 field_address
= cond_offset_target (field_address
,
6886 off
/ TARGET_CHAR_BIT
);
6888 /* Get the fixed type of the field. Note that, in this case,
6889 we do not want to get the real type out of the tag: if
6890 the current field is the parent part of a tagged record,
6891 we will get the tag of the object. Clearly wrong: the real
6892 type of the parent is not the real type of the child. We
6893 would end up in an infinite loop. */
6894 field_type
= ada_get_base_type (field_type
);
6895 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
6896 field_address
, dval
, 0);
6898 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
6899 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6900 bit_incr
= fld_bit_len
=
6901 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6905 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6906 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6907 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6908 bit_incr
= fld_bit_len
=
6909 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6911 bit_incr
= fld_bit_len
=
6912 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6914 if (off
+ fld_bit_len
> bit_len
)
6915 bit_len
= off
+ fld_bit_len
;
6917 TYPE_LENGTH (rtype
) =
6918 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6921 /* We handle the variant part, if any, at the end because of certain
6922 odd cases in which it is re-ordered so as NOT to be the last field of
6923 the record. This can happen in the presence of representation
6925 if (variant_field
>= 0)
6927 struct type
*branch_type
;
6929 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6932 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6937 to_fixed_variant_branch_type
6938 (TYPE_FIELD_TYPE (type
, variant_field
),
6939 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6940 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6941 if (branch_type
== NULL
)
6943 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6944 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6945 TYPE_NFIELDS (rtype
) -= 1;
6949 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6950 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6952 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6954 if (off
+ fld_bit_len
> bit_len
)
6955 bit_len
= off
+ fld_bit_len
;
6956 TYPE_LENGTH (rtype
) =
6957 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6961 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6962 should contain the alignment of that record, which should be a strictly
6963 positive value. If null or negative, then something is wrong, most
6964 probably in the debug info. In that case, we don't round up the size
6965 of the resulting type. If this record is not part of another structure,
6966 the current RTYPE length might be good enough for our purposes. */
6967 if (TYPE_LENGTH (type
) <= 0)
6969 if (TYPE_NAME (rtype
))
6970 warning (_("Invalid type size for `%s' detected: %d."),
6971 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6973 warning (_("Invalid type size for <unnamed> detected: %d."),
6974 TYPE_LENGTH (type
));
6978 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6979 TYPE_LENGTH (type
));
6982 value_free_to_mark (mark
);
6983 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6984 error (_("record type with dynamic size is larger than varsize-limit"));
6988 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6991 static struct type
*
6992 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6993 CORE_ADDR address
, struct value
*dval0
)
6995 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6999 /* An ordinary record type in which ___XVL-convention fields and
7000 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7001 static approximations, containing all possible fields. Uses
7002 no runtime values. Useless for use in values, but that's OK,
7003 since the results are used only for type determinations. Works on both
7004 structs and unions. Representation note: to save space, we memorize
7005 the result of this function in the TYPE_TARGET_TYPE of the
7008 static struct type
*
7009 template_to_static_fixed_type (struct type
*type0
)
7015 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7016 return TYPE_TARGET_TYPE (type0
);
7018 nfields
= TYPE_NFIELDS (type0
);
7021 for (f
= 0; f
< nfields
; f
+= 1)
7023 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7024 struct type
*new_type
;
7026 if (is_dynamic_field (type0
, f
))
7027 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7029 new_type
= static_unwrap_type (field_type
);
7030 if (type
== type0
&& new_type
!= field_type
)
7032 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7033 TYPE_CODE (type
) = TYPE_CODE (type0
);
7034 INIT_CPLUS_SPECIFIC (type
);
7035 TYPE_NFIELDS (type
) = nfields
;
7036 TYPE_FIELDS (type
) = (struct field
*)
7037 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7038 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7039 sizeof (struct field
) * nfields
);
7040 TYPE_NAME (type
) = ada_type_name (type0
);
7041 TYPE_TAG_NAME (type
) = NULL
;
7042 TYPE_FIXED_INSTANCE (type
) = 1;
7043 TYPE_LENGTH (type
) = 0;
7045 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7046 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7051 /* Given an object of type TYPE whose contents are at VALADDR and
7052 whose address in memory is ADDRESS, returns a revision of TYPE,
7053 which should be a non-dynamic-sized record, in which the variant
7054 part, if any, is replaced with the appropriate branch. Looks
7055 for discriminant values in DVAL0, which can be NULL if the record
7056 contains the necessary discriminant values. */
7058 static struct type
*
7059 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7060 CORE_ADDR address
, struct value
*dval0
)
7062 struct value
*mark
= value_mark ();
7065 struct type
*branch_type
;
7066 int nfields
= TYPE_NFIELDS (type
);
7067 int variant_field
= variant_field_index (type
);
7069 if (variant_field
== -1)
7073 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7077 rtype
= alloc_type_copy (type
);
7078 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7079 INIT_CPLUS_SPECIFIC (rtype
);
7080 TYPE_NFIELDS (rtype
) = nfields
;
7081 TYPE_FIELDS (rtype
) =
7082 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7083 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7084 sizeof (struct field
) * nfields
);
7085 TYPE_NAME (rtype
) = ada_type_name (type
);
7086 TYPE_TAG_NAME (rtype
) = NULL
;
7087 TYPE_FIXED_INSTANCE (rtype
) = 1;
7088 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7090 branch_type
= to_fixed_variant_branch_type
7091 (TYPE_FIELD_TYPE (type
, variant_field
),
7092 cond_offset_host (valaddr
,
7093 TYPE_FIELD_BITPOS (type
, variant_field
)
7095 cond_offset_target (address
,
7096 TYPE_FIELD_BITPOS (type
, variant_field
)
7097 / TARGET_CHAR_BIT
), dval
);
7098 if (branch_type
== NULL
)
7101 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7102 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7103 TYPE_NFIELDS (rtype
) -= 1;
7107 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7108 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7109 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7110 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7112 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7114 value_free_to_mark (mark
);
7118 /* An ordinary record type (with fixed-length fields) that describes
7119 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7120 beginning of this section]. Any necessary discriminants' values
7121 should be in DVAL, a record value; it may be NULL if the object
7122 at ADDR itself contains any necessary discriminant values.
7123 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7124 values from the record are needed. Except in the case that DVAL,
7125 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7126 unchecked) is replaced by a particular branch of the variant.
7128 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7129 is questionable and may be removed. It can arise during the
7130 processing of an unconstrained-array-of-record type where all the
7131 variant branches have exactly the same size. This is because in
7132 such cases, the compiler does not bother to use the XVS convention
7133 when encoding the record. I am currently dubious of this
7134 shortcut and suspect the compiler should be altered. FIXME. */
7136 static struct type
*
7137 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7138 CORE_ADDR address
, struct value
*dval
)
7140 struct type
*templ_type
;
7142 if (TYPE_FIXED_INSTANCE (type0
))
7145 templ_type
= dynamic_template_type (type0
);
7147 if (templ_type
!= NULL
)
7148 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7149 else if (variant_field_index (type0
) >= 0)
7151 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7153 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7158 TYPE_FIXED_INSTANCE (type0
) = 1;
7164 /* An ordinary record type (with fixed-length fields) that describes
7165 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7166 union type. Any necessary discriminants' values should be in DVAL,
7167 a record value. That is, this routine selects the appropriate
7168 branch of the union at ADDR according to the discriminant value
7169 indicated in the union's type name. Returns VAR_TYPE0 itself if
7170 it represents a variant subject to a pragma Unchecked_Union. */
7172 static struct type
*
7173 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7174 CORE_ADDR address
, struct value
*dval
)
7177 struct type
*templ_type
;
7178 struct type
*var_type
;
7180 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7181 var_type
= TYPE_TARGET_TYPE (var_type0
);
7183 var_type
= var_type0
;
7185 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7187 if (templ_type
!= NULL
)
7188 var_type
= templ_type
;
7190 if (is_unchecked_variant (var_type
, value_type (dval
)))
7193 ada_which_variant_applies (var_type
,
7194 value_type (dval
), value_contents (dval
));
7197 return empty_record (var_type
);
7198 else if (is_dynamic_field (var_type
, which
))
7199 return to_fixed_record_type
7200 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7201 valaddr
, address
, dval
);
7202 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7204 to_fixed_record_type
7205 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7207 return TYPE_FIELD_TYPE (var_type
, which
);
7210 /* Assuming that TYPE0 is an array type describing the type of a value
7211 at ADDR, and that DVAL describes a record containing any
7212 discriminants used in TYPE0, returns a type for the value that
7213 contains no dynamic components (that is, no components whose sizes
7214 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7215 true, gives an error message if the resulting type's size is over
7218 static struct type
*
7219 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7222 struct type
*index_type_desc
;
7223 struct type
*result
;
7224 int constrained_packed_array_p
;
7226 if (TYPE_FIXED_INSTANCE (type0
))
7229 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7230 if (constrained_packed_array_p
)
7231 type0
= decode_constrained_packed_array_type (type0
);
7233 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7234 if (index_type_desc
== NULL
)
7236 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7237 /* NOTE: elt_type---the fixed version of elt_type0---should never
7238 depend on the contents of the array in properly constructed
7240 /* Create a fixed version of the array element type.
7241 We're not providing the address of an element here,
7242 and thus the actual object value cannot be inspected to do
7243 the conversion. This should not be a problem, since arrays of
7244 unconstrained objects are not allowed. In particular, all
7245 the elements of an array of a tagged type should all be of
7246 the same type specified in the debugging info. No need to
7247 consult the object tag. */
7248 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7250 /* Make sure we always create a new array type when dealing with
7251 packed array types, since we're going to fix-up the array
7252 type length and element bitsize a little further down. */
7253 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7256 result
= create_array_type (alloc_type_copy (type0
),
7257 elt_type
, TYPE_INDEX_TYPE (type0
));
7262 struct type
*elt_type0
;
7265 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7266 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7268 /* NOTE: result---the fixed version of elt_type0---should never
7269 depend on the contents of the array in properly constructed
7271 /* Create a fixed version of the array element type.
7272 We're not providing the address of an element here,
7273 and thus the actual object value cannot be inspected to do
7274 the conversion. This should not be a problem, since arrays of
7275 unconstrained objects are not allowed. In particular, all
7276 the elements of an array of a tagged type should all be of
7277 the same type specified in the debugging info. No need to
7278 consult the object tag. */
7280 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7283 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7285 struct type
*range_type
=
7286 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7287 dval
, TYPE_INDEX_TYPE (elt_type0
));
7288 result
= create_array_type (alloc_type_copy (elt_type0
),
7289 result
, range_type
);
7290 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7292 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7293 error (_("array type with dynamic size is larger than varsize-limit"));
7296 if (constrained_packed_array_p
)
7298 /* So far, the resulting type has been created as if the original
7299 type was a regular (non-packed) array type. As a result, the
7300 bitsize of the array elements needs to be set again, and the array
7301 length needs to be recomputed based on that bitsize. */
7302 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7303 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7305 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7306 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7307 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7308 TYPE_LENGTH (result
)++;
7311 TYPE_FIXED_INSTANCE (result
) = 1;
7316 /* A standard type (containing no dynamically sized components)
7317 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7318 DVAL describes a record containing any discriminants used in TYPE0,
7319 and may be NULL if there are none, or if the object of type TYPE at
7320 ADDRESS or in VALADDR contains these discriminants.
7322 If CHECK_TAG is not null, in the case of tagged types, this function
7323 attempts to locate the object's tag and use it to compute the actual
7324 type. However, when ADDRESS is null, we cannot use it to determine the
7325 location of the tag, and therefore compute the tagged type's actual type.
7326 So we return the tagged type without consulting the tag. */
7328 static struct type
*
7329 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7330 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7332 type
= ada_check_typedef (type
);
7333 switch (TYPE_CODE (type
))
7337 case TYPE_CODE_STRUCT
:
7339 struct type
*static_type
= to_static_fixed_type (type
);
7340 struct type
*fixed_record_type
=
7341 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7342 /* If STATIC_TYPE is a tagged type and we know the object's address,
7343 then we can determine its tag, and compute the object's actual
7344 type from there. Note that we have to use the fixed record
7345 type (the parent part of the record may have dynamic fields
7346 and the way the location of _tag is expressed may depend on
7349 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7351 struct type
*real_type
=
7352 type_from_tag (value_tag_from_contents_and_address
7356 if (real_type
!= NULL
)
7357 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7360 /* Check to see if there is a parallel ___XVZ variable.
7361 If there is, then it provides the actual size of our type. */
7362 else if (ada_type_name (fixed_record_type
) != NULL
)
7364 char *name
= ada_type_name (fixed_record_type
);
7365 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7369 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7370 size
= get_int_var_value (xvz_name
, &xvz_found
);
7371 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7373 fixed_record_type
= copy_type (fixed_record_type
);
7374 TYPE_LENGTH (fixed_record_type
) = size
;
7376 /* The FIXED_RECORD_TYPE may have be a stub. We have
7377 observed this when the debugging info is STABS, and
7378 apparently it is something that is hard to fix.
7380 In practice, we don't need the actual type definition
7381 at all, because the presence of the XVZ variable allows us
7382 to assume that there must be a XVS type as well, which we
7383 should be able to use later, when we need the actual type
7386 In the meantime, pretend that the "fixed" type we are
7387 returning is NOT a stub, because this can cause trouble
7388 when using this type to create new types targeting it.
7389 Indeed, the associated creation routines often check
7390 whether the target type is a stub and will try to replace
7391 it, thus using a type with the wrong size. This, in turn,
7392 might cause the new type to have the wrong size too.
7393 Consider the case of an array, for instance, where the size
7394 of the array is computed from the number of elements in
7395 our array multiplied by the size of its element. */
7396 TYPE_STUB (fixed_record_type
) = 0;
7399 return fixed_record_type
;
7401 case TYPE_CODE_ARRAY
:
7402 return to_fixed_array_type (type
, dval
, 1);
7403 case TYPE_CODE_UNION
:
7407 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7411 /* The same as ada_to_fixed_type_1, except that it preserves the type
7412 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7413 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7416 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7417 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7420 struct type
*fixed_type
=
7421 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7423 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7424 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7430 /* A standard (static-sized) type corresponding as well as possible to
7431 TYPE0, but based on no runtime data. */
7433 static struct type
*
7434 to_static_fixed_type (struct type
*type0
)
7441 if (TYPE_FIXED_INSTANCE (type0
))
7444 type0
= ada_check_typedef (type0
);
7446 switch (TYPE_CODE (type0
))
7450 case TYPE_CODE_STRUCT
:
7451 type
= dynamic_template_type (type0
);
7453 return template_to_static_fixed_type (type
);
7455 return template_to_static_fixed_type (type0
);
7456 case TYPE_CODE_UNION
:
7457 type
= ada_find_parallel_type (type0
, "___XVU");
7459 return template_to_static_fixed_type (type
);
7461 return template_to_static_fixed_type (type0
);
7465 /* A static approximation of TYPE with all type wrappers removed. */
7467 static struct type
*
7468 static_unwrap_type (struct type
*type
)
7470 if (ada_is_aligner_type (type
))
7472 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7473 if (ada_type_name (type1
) == NULL
)
7474 TYPE_NAME (type1
) = ada_type_name (type
);
7476 return static_unwrap_type (type1
);
7480 struct type
*raw_real_type
= ada_get_base_type (type
);
7481 if (raw_real_type
== type
)
7484 return to_static_fixed_type (raw_real_type
);
7488 /* In some cases, incomplete and private types require
7489 cross-references that are not resolved as records (for example,
7491 type FooP is access Foo;
7493 type Foo is array ...;
7494 ). In these cases, since there is no mechanism for producing
7495 cross-references to such types, we instead substitute for FooP a
7496 stub enumeration type that is nowhere resolved, and whose tag is
7497 the name of the actual type. Call these types "non-record stubs". */
7499 /* A type equivalent to TYPE that is not a non-record stub, if one
7500 exists, otherwise TYPE. */
7503 ada_check_typedef (struct type
*type
)
7508 CHECK_TYPEDEF (type
);
7509 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7510 || !TYPE_STUB (type
)
7511 || TYPE_TAG_NAME (type
) == NULL
)
7515 char *name
= TYPE_TAG_NAME (type
);
7516 struct type
*type1
= ada_find_any_type (name
);
7517 return (type1
== NULL
) ? type
: type1
;
7521 /* A value representing the data at VALADDR/ADDRESS as described by
7522 type TYPE0, but with a standard (static-sized) type that correctly
7523 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7524 type, then return VAL0 [this feature is simply to avoid redundant
7525 creation of struct values]. */
7527 static struct value
*
7528 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7531 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7532 if (type
== type0
&& val0
!= NULL
)
7535 return value_from_contents_and_address (type
, 0, address
);
7538 /* A value representing VAL, but with a standard (static-sized) type
7539 that correctly describes it. Does not necessarily create a new
7542 static struct value
*
7543 ada_to_fixed_value (struct value
*val
)
7545 return ada_to_fixed_value_create (value_type (val
),
7546 value_address (val
),
7550 /* A value representing VAL, but with a standard (static-sized) type
7551 chosen to approximate the real type of VAL as well as possible, but
7552 without consulting any runtime values. For Ada dynamic-sized
7553 types, therefore, the type of the result is likely to be inaccurate. */
7555 static struct value
*
7556 ada_to_static_fixed_value (struct value
*val
)
7559 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7560 if (type
== value_type (val
))
7563 return coerce_unspec_val_to_type (val
, type
);
7569 /* Table mapping attribute numbers to names.
7570 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7572 static const char *attribute_names
[] = {
7590 ada_attribute_name (enum exp_opcode n
)
7592 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7593 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7595 return attribute_names
[0];
7598 /* Evaluate the 'POS attribute applied to ARG. */
7601 pos_atr (struct value
*arg
)
7603 struct value
*val
= coerce_ref (arg
);
7604 struct type
*type
= value_type (val
);
7606 if (!discrete_type_p (type
))
7607 error (_("'POS only defined on discrete types"));
7609 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7612 LONGEST v
= value_as_long (val
);
7614 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7616 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7619 error (_("enumeration value is invalid: can't find 'POS"));
7622 return value_as_long (val
);
7625 static struct value
*
7626 value_pos_atr (struct type
*type
, struct value
*arg
)
7628 return value_from_longest (type
, pos_atr (arg
));
7631 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7633 static struct value
*
7634 value_val_atr (struct type
*type
, struct value
*arg
)
7636 if (!discrete_type_p (type
))
7637 error (_("'VAL only defined on discrete types"));
7638 if (!integer_type_p (value_type (arg
)))
7639 error (_("'VAL requires integral argument"));
7641 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7643 long pos
= value_as_long (arg
);
7644 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7645 error (_("argument to 'VAL out of range"));
7646 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7649 return value_from_longest (type
, value_as_long (arg
));
7655 /* True if TYPE appears to be an Ada character type.
7656 [At the moment, this is true only for Character and Wide_Character;
7657 It is a heuristic test that could stand improvement]. */
7660 ada_is_character_type (struct type
*type
)
7664 /* If the type code says it's a character, then assume it really is,
7665 and don't check any further. */
7666 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7669 /* Otherwise, assume it's a character type iff it is a discrete type
7670 with a known character type name. */
7671 name
= ada_type_name (type
);
7672 return (name
!= NULL
7673 && (TYPE_CODE (type
) == TYPE_CODE_INT
7674 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7675 && (strcmp (name
, "character") == 0
7676 || strcmp (name
, "wide_character") == 0
7677 || strcmp (name
, "wide_wide_character") == 0
7678 || strcmp (name
, "unsigned char") == 0));
7681 /* True if TYPE appears to be an Ada string type. */
7684 ada_is_string_type (struct type
*type
)
7686 type
= ada_check_typedef (type
);
7688 && TYPE_CODE (type
) != TYPE_CODE_PTR
7689 && (ada_is_simple_array_type (type
)
7690 || ada_is_array_descriptor_type (type
))
7691 && ada_array_arity (type
) == 1)
7693 struct type
*elttype
= ada_array_element_type (type
, 1);
7695 return ada_is_character_type (elttype
);
7702 /* True if TYPE is a struct type introduced by the compiler to force the
7703 alignment of a value. Such types have a single field with a
7704 distinctive name. */
7707 ada_is_aligner_type (struct type
*type
)
7709 type
= ada_check_typedef (type
);
7711 /* If we can find a parallel XVS type, then the XVS type should
7712 be used instead of this type. And hence, this is not an aligner
7714 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7717 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7718 && TYPE_NFIELDS (type
) == 1
7719 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7722 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7723 the parallel type. */
7726 ada_get_base_type (struct type
*raw_type
)
7728 struct type
*real_type_namer
;
7729 struct type
*raw_real_type
;
7731 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7734 if (ada_is_aligner_type (raw_type
))
7735 /* The encoding specifies that we should always use the aligner type.
7736 So, even if this aligner type has an associated XVS type, we should
7739 According to the compiler gurus, an XVS type parallel to an aligner
7740 type may exist because of a stabs limitation. In stabs, aligner
7741 types are empty because the field has a variable-sized type, and
7742 thus cannot actually be used as an aligner type. As a result,
7743 we need the associated parallel XVS type to decode the type.
7744 Since the policy in the compiler is to not change the internal
7745 representation based on the debugging info format, we sometimes
7746 end up having a redundant XVS type parallel to the aligner type. */
7749 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7750 if (real_type_namer
== NULL
7751 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7752 || TYPE_NFIELDS (real_type_namer
) != 1)
7755 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7756 if (raw_real_type
== NULL
)
7759 return raw_real_type
;
7762 /* The type of value designated by TYPE, with all aligners removed. */
7765 ada_aligned_type (struct type
*type
)
7767 if (ada_is_aligner_type (type
))
7768 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7770 return ada_get_base_type (type
);
7774 /* The address of the aligned value in an object at address VALADDR
7775 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7778 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7780 if (ada_is_aligner_type (type
))
7781 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7783 TYPE_FIELD_BITPOS (type
,
7784 0) / TARGET_CHAR_BIT
);
7791 /* The printed representation of an enumeration literal with encoded
7792 name NAME. The value is good to the next call of ada_enum_name. */
7794 ada_enum_name (const char *name
)
7796 static char *result
;
7797 static size_t result_len
= 0;
7800 /* First, unqualify the enumeration name:
7801 1. Search for the last '.' character. If we find one, then skip
7802 all the preceeding characters, the unqualified name starts
7803 right after that dot.
7804 2. Otherwise, we may be debugging on a target where the compiler
7805 translates dots into "__". Search forward for double underscores,
7806 but stop searching when we hit an overloading suffix, which is
7807 of the form "__" followed by digits. */
7809 tmp
= strrchr (name
, '.');
7814 while ((tmp
= strstr (name
, "__")) != NULL
)
7816 if (isdigit (tmp
[2]))
7826 if (name
[1] == 'U' || name
[1] == 'W')
7828 if (sscanf (name
+ 2, "%x", &v
) != 1)
7834 GROW_VECT (result
, result_len
, 16);
7835 if (isascii (v
) && isprint (v
))
7836 xsnprintf (result
, result_len
, "'%c'", v
);
7837 else if (name
[1] == 'U')
7838 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7840 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7846 tmp
= strstr (name
, "__");
7848 tmp
= strstr (name
, "$");
7851 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7852 strncpy (result
, name
, tmp
- name
);
7853 result
[tmp
- name
] = '\0';
7861 /* Evaluate the subexpression of EXP starting at *POS as for
7862 evaluate_type, updating *POS to point just past the evaluated
7865 static struct value
*
7866 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7868 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7871 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7874 static struct value
*
7875 unwrap_value (struct value
*val
)
7877 struct type
*type
= ada_check_typedef (value_type (val
));
7878 if (ada_is_aligner_type (type
))
7880 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7881 struct type
*val_type
= ada_check_typedef (value_type (v
));
7882 if (ada_type_name (val_type
) == NULL
)
7883 TYPE_NAME (val_type
) = ada_type_name (type
);
7885 return unwrap_value (v
);
7889 struct type
*raw_real_type
=
7890 ada_check_typedef (ada_get_base_type (type
));
7892 if (type
== raw_real_type
)
7896 coerce_unspec_val_to_type
7897 (val
, ada_to_fixed_type (raw_real_type
, 0,
7898 value_address (val
),
7903 static struct value
*
7904 cast_to_fixed (struct type
*type
, struct value
*arg
)
7908 if (type
== value_type (arg
))
7910 else if (ada_is_fixed_point_type (value_type (arg
)))
7911 val
= ada_float_to_fixed (type
,
7912 ada_fixed_to_float (value_type (arg
),
7913 value_as_long (arg
)));
7916 DOUBLEST argd
= value_as_double (arg
);
7917 val
= ada_float_to_fixed (type
, argd
);
7920 return value_from_longest (type
, val
);
7923 static struct value
*
7924 cast_from_fixed (struct type
*type
, struct value
*arg
)
7926 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7927 value_as_long (arg
));
7928 return value_from_double (type
, val
);
7931 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7932 return the converted value. */
7934 static struct value
*
7935 coerce_for_assign (struct type
*type
, struct value
*val
)
7937 struct type
*type2
= value_type (val
);
7941 type2
= ada_check_typedef (type2
);
7942 type
= ada_check_typedef (type
);
7944 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7945 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7947 val
= ada_value_ind (val
);
7948 type2
= value_type (val
);
7951 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7952 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7954 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7955 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7956 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7957 error (_("Incompatible types in assignment"));
7958 deprecated_set_value_type (val
, type
);
7963 static struct value
*
7964 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7967 struct type
*type1
, *type2
;
7970 arg1
= coerce_ref (arg1
);
7971 arg2
= coerce_ref (arg2
);
7972 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7973 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7975 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7976 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7977 return value_binop (arg1
, arg2
, op
);
7986 return value_binop (arg1
, arg2
, op
);
7989 v2
= value_as_long (arg2
);
7991 error (_("second operand of %s must not be zero."), op_string (op
));
7993 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7994 return value_binop (arg1
, arg2
, op
);
7996 v1
= value_as_long (arg1
);
8001 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8002 v
+= v
> 0 ? -1 : 1;
8010 /* Should not reach this point. */
8014 val
= allocate_value (type1
);
8015 store_unsigned_integer (value_contents_raw (val
),
8016 TYPE_LENGTH (value_type (val
)),
8017 gdbarch_byte_order (get_type_arch (type1
)), v
);
8022 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8024 if (ada_is_direct_array_type (value_type (arg1
))
8025 || ada_is_direct_array_type (value_type (arg2
)))
8027 /* Automatically dereference any array reference before
8028 we attempt to perform the comparison. */
8029 arg1
= ada_coerce_ref (arg1
);
8030 arg2
= ada_coerce_ref (arg2
);
8032 arg1
= ada_coerce_to_simple_array (arg1
);
8033 arg2
= ada_coerce_to_simple_array (arg2
);
8034 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8035 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8036 error (_("Attempt to compare array with non-array"));
8037 /* FIXME: The following works only for types whose
8038 representations use all bits (no padding or undefined bits)
8039 and do not have user-defined equality. */
8041 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8042 && memcmp (value_contents (arg1
), value_contents (arg2
),
8043 TYPE_LENGTH (value_type (arg1
))) == 0;
8045 return value_equal (arg1
, arg2
);
8048 /* Total number of component associations in the aggregate starting at
8049 index PC in EXP. Assumes that index PC is the start of an
8053 num_component_specs (struct expression
*exp
, int pc
)
8056 m
= exp
->elts
[pc
+ 1].longconst
;
8059 for (i
= 0; i
< m
; i
+= 1)
8061 switch (exp
->elts
[pc
].opcode
)
8067 n
+= exp
->elts
[pc
+ 1].longconst
;
8070 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8075 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8076 component of LHS (a simple array or a record), updating *POS past
8077 the expression, assuming that LHS is contained in CONTAINER. Does
8078 not modify the inferior's memory, nor does it modify LHS (unless
8079 LHS == CONTAINER). */
8082 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8083 struct expression
*exp
, int *pos
)
8085 struct value
*mark
= value_mark ();
8087 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8089 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8090 struct value
*index_val
= value_from_longest (index_type
, index
);
8091 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8095 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8096 elt
= ada_to_fixed_value (unwrap_value (elt
));
8099 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8100 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8102 value_assign_to_component (container
, elt
,
8103 ada_evaluate_subexp (NULL
, exp
, pos
,
8106 value_free_to_mark (mark
);
8109 /* Assuming that LHS represents an lvalue having a record or array
8110 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8111 of that aggregate's value to LHS, advancing *POS past the
8112 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8113 lvalue containing LHS (possibly LHS itself). Does not modify
8114 the inferior's memory, nor does it modify the contents of
8115 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8117 static struct value
*
8118 assign_aggregate (struct value
*container
,
8119 struct value
*lhs
, struct expression
*exp
,
8120 int *pos
, enum noside noside
)
8122 struct type
*lhs_type
;
8123 int n
= exp
->elts
[*pos
+1].longconst
;
8124 LONGEST low_index
, high_index
;
8127 int max_indices
, num_indices
;
8128 int is_array_aggregate
;
8130 struct value
*mark
= value_mark ();
8133 if (noside
!= EVAL_NORMAL
)
8136 for (i
= 0; i
< n
; i
+= 1)
8137 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8141 container
= ada_coerce_ref (container
);
8142 if (ada_is_direct_array_type (value_type (container
)))
8143 container
= ada_coerce_to_simple_array (container
);
8144 lhs
= ada_coerce_ref (lhs
);
8145 if (!deprecated_value_modifiable (lhs
))
8146 error (_("Left operand of assignment is not a modifiable lvalue."));
8148 lhs_type
= value_type (lhs
);
8149 if (ada_is_direct_array_type (lhs_type
))
8151 lhs
= ada_coerce_to_simple_array (lhs
);
8152 lhs_type
= value_type (lhs
);
8153 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8154 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8155 is_array_aggregate
= 1;
8157 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8160 high_index
= num_visible_fields (lhs_type
) - 1;
8161 is_array_aggregate
= 0;
8164 error (_("Left-hand side must be array or record."));
8166 num_specs
= num_component_specs (exp
, *pos
- 3);
8167 max_indices
= 4 * num_specs
+ 4;
8168 indices
= alloca (max_indices
* sizeof (indices
[0]));
8169 indices
[0] = indices
[1] = low_index
- 1;
8170 indices
[2] = indices
[3] = high_index
+ 1;
8173 for (i
= 0; i
< n
; i
+= 1)
8175 switch (exp
->elts
[*pos
].opcode
)
8178 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8179 &num_indices
, max_indices
,
8180 low_index
, high_index
);
8183 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8184 &num_indices
, max_indices
,
8185 low_index
, high_index
);
8189 error (_("Misplaced 'others' clause"));
8190 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8191 num_indices
, low_index
, high_index
);
8194 error (_("Internal error: bad aggregate clause"));
8201 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8202 construct at *POS, updating *POS past the construct, given that
8203 the positions are relative to lower bound LOW, where HIGH is the
8204 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8205 updating *NUM_INDICES as needed. CONTAINER is as for
8206 assign_aggregate. */
8208 aggregate_assign_positional (struct value
*container
,
8209 struct value
*lhs
, struct expression
*exp
,
8210 int *pos
, LONGEST
*indices
, int *num_indices
,
8211 int max_indices
, LONGEST low
, LONGEST high
)
8213 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8215 if (ind
- 1 == high
)
8216 warning (_("Extra components in aggregate ignored."));
8219 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8221 assign_component (container
, lhs
, ind
, exp
, pos
);
8224 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8227 /* Assign into the components of LHS indexed by the OP_CHOICES
8228 construct at *POS, updating *POS past the construct, given that
8229 the allowable indices are LOW..HIGH. Record the indices assigned
8230 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8231 needed. CONTAINER is as for assign_aggregate. */
8233 aggregate_assign_from_choices (struct value
*container
,
8234 struct value
*lhs
, struct expression
*exp
,
8235 int *pos
, LONGEST
*indices
, int *num_indices
,
8236 int max_indices
, LONGEST low
, LONGEST high
)
8239 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8240 int choice_pos
, expr_pc
;
8241 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8243 choice_pos
= *pos
+= 3;
8245 for (j
= 0; j
< n_choices
; j
+= 1)
8246 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8248 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8250 for (j
= 0; j
< n_choices
; j
+= 1)
8252 LONGEST lower
, upper
;
8253 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8254 if (op
== OP_DISCRETE_RANGE
)
8257 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8259 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8264 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8275 name
= &exp
->elts
[choice_pos
+ 2].string
;
8278 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8281 error (_("Invalid record component association."));
8283 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8285 if (! find_struct_field (name
, value_type (lhs
), 0,
8286 NULL
, NULL
, NULL
, NULL
, &ind
))
8287 error (_("Unknown component name: %s."), name
);
8288 lower
= upper
= ind
;
8291 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8292 error (_("Index in component association out of bounds."));
8294 add_component_interval (lower
, upper
, indices
, num_indices
,
8296 while (lower
<= upper
)
8300 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8306 /* Assign the value of the expression in the OP_OTHERS construct in
8307 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8308 have not been previously assigned. The index intervals already assigned
8309 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8310 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8312 aggregate_assign_others (struct value
*container
,
8313 struct value
*lhs
, struct expression
*exp
,
8314 int *pos
, LONGEST
*indices
, int num_indices
,
8315 LONGEST low
, LONGEST high
)
8318 int expr_pc
= *pos
+1;
8320 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8323 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8327 assign_component (container
, lhs
, ind
, exp
, &pos
);
8330 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8333 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8334 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8335 modifying *SIZE as needed. It is an error if *SIZE exceeds
8336 MAX_SIZE. The resulting intervals do not overlap. */
8338 add_component_interval (LONGEST low
, LONGEST high
,
8339 LONGEST
* indices
, int *size
, int max_size
)
8342 for (i
= 0; i
< *size
; i
+= 2) {
8343 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8346 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8347 if (high
< indices
[kh
])
8349 if (low
< indices
[i
])
8351 indices
[i
+ 1] = indices
[kh
- 1];
8352 if (high
> indices
[i
+ 1])
8353 indices
[i
+ 1] = high
;
8354 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8355 *size
-= kh
- i
- 2;
8358 else if (high
< indices
[i
])
8362 if (*size
== max_size
)
8363 error (_("Internal error: miscounted aggregate components."));
8365 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8366 indices
[j
] = indices
[j
- 2];
8368 indices
[i
+ 1] = high
;
8371 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8374 static struct value
*
8375 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8377 if (type
== ada_check_typedef (value_type (arg2
)))
8380 if (ada_is_fixed_point_type (type
))
8381 return (cast_to_fixed (type
, arg2
));
8383 if (ada_is_fixed_point_type (value_type (arg2
)))
8384 return cast_from_fixed (type
, arg2
);
8386 return value_cast (type
, arg2
);
8389 /* Evaluating Ada expressions, and printing their result.
8390 ------------------------------------------------------
8392 We usually evaluate an Ada expression in order to print its value.
8393 We also evaluate an expression in order to print its type, which
8394 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8395 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8396 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8397 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8400 Evaluating expressions is a little more complicated for Ada entities
8401 than it is for entities in languages such as C. The main reason for
8402 this is that Ada provides types whose definition might be dynamic.
8403 One example of such types is variant records. Or another example
8404 would be an array whose bounds can only be known at run time.
8406 The following description is a general guide as to what should be
8407 done (and what should NOT be done) in order to evaluate an expression
8408 involving such types, and when. This does not cover how the semantic
8409 information is encoded by GNAT as this is covered separatly. For the
8410 document used as the reference for the GNAT encoding, see exp_dbug.ads
8411 in the GNAT sources.
8413 Ideally, we should embed each part of this description next to its
8414 associated code. Unfortunately, the amount of code is so vast right
8415 now that it's hard to see whether the code handling a particular
8416 situation might be duplicated or not. One day, when the code is
8417 cleaned up, this guide might become redundant with the comments
8418 inserted in the code, and we might want to remove it.
8420 When evaluating Ada expressions, the tricky issue is that they may
8421 reference entities whose type contents and size are not statically
8422 known. Consider for instance a variant record:
8424 type Rec (Empty : Boolean := True) is record
8427 when False => Value : Integer;
8430 Yes : Rec := (Empty => False, Value => 1);
8431 No : Rec := (empty => True);
8433 The size and contents of that record depends on the value of the
8434 descriminant (Rec.Empty). At this point, neither the debugging
8435 information nor the associated type structure in GDB are able to
8436 express such dynamic types. So what the debugger does is to create
8437 "fixed" versions of the type that applies to the specific object.
8438 We also informally refer to this opperation as "fixing" an object,
8439 which means creating its associated fixed type.
8441 Example: when printing the value of variable "Yes" above, its fixed
8442 type would look like this:
8449 On the other hand, if we printed the value of "No", its fixed type
8456 Things become a little more complicated when trying to fix an entity
8457 with a dynamic type that directly contains another dynamic type,
8458 such as an array of variant records, for instance. There are
8459 two possible cases: Arrays, and records.
8461 Arrays are a little simpler to handle, because the same amount of
8462 memory is allocated for each element of the array, even if the amount
8463 of space used by each element changes from element to element.
8464 Consider for instance the following array of type Rec:
8466 type Rec_Array is array (1 .. 2) of Rec;
8468 The type structure in GDB describes an array in terms of its
8469 bounds, and the type of its elements. By design, all elements
8470 in the array have the same type. So we cannot use a fixed type
8471 for the array elements in this case, since the fixed type depends
8472 on the actual value of each element.
8474 Fortunately, what happens in practice is that each element of
8475 the array has the same size, which is the maximum size that
8476 might be needed in order to hold an object of the element type.
8477 And the compiler shows it in the debugging information by wrapping
8478 the array element inside a private PAD type. This type should not
8479 be shown to the user, and must be "unwrap"'ed before printing. Note
8480 that we also use the adjective "aligner" in our code to designate
8481 these wrapper types.
8483 These wrapper types should have a constant size, which is the size
8484 of each element of the array. In the case when the size is statically
8485 known, the PAD type will already have the right size, and the array
8486 element type should remain unfixed. But there are cases when
8487 this size is not statically known. For instance, assuming that
8488 "Five" is an integer variable:
8490 type Dynamic is array (1 .. Five) of Integer;
8491 type Wrapper (Has_Length : Boolean := False) is record
8494 when True => Length : Integer;
8498 type Wrapper_Array is array (1 .. 2) of Wrapper;
8500 Hello : Wrapper_Array := (others => (Has_Length => True,
8501 Data => (others => 17),
8505 The debugging info would describe variable Hello as being an
8506 array of a PAD type. The size of that PAD type is not statically
8507 known, but can be determined using a parallel XVZ variable.
8508 In that case, a copy of the PAD type with the correct size should
8509 be used for the fixed array.
8511 However, things are slightly different in the case of dynamic
8512 record types. In this case, in order to compute the associated
8513 fixed type, we need to determine the size and offset of each of
8514 its components. This, in turn, requires us to compute the fixed
8515 type of each of these components.
8517 Consider for instance the example:
8519 type Bounded_String (Max_Size : Natural) is record
8520 Str : String (1 .. Max_Size);
8523 My_String : Bounded_String (Max_Size => 10);
8525 In that case, the position of field "Length" depends on the size
8526 of field Str, which itself depends on the value of the Max_Size
8527 discriminant. In order to fix the type of variable My_String,
8528 we need to fix the type of field Str. Therefore, fixing a variant
8529 record requires us to fix each of its components.
8531 However, if a component does not have a dynamic size, the component
8532 should not be fixed. In particular, fields that use a PAD type
8533 should not fixed. Here is an example where this might happen
8534 (assuming type Rec above):
8536 type Container (Big : Boolean) is record
8540 when True => Another : Integer;
8544 My_Container : Container := (Big => False,
8545 First => (Empty => True),
8548 In that example, the compiler creates a PAD type for component First,
8549 whose size is constant, and then positions the component After just
8550 right after it. The offset of component After is therefore constant
8553 The debugger computes the position of each field based on an algorithm
8554 that uses, among other things, the actual position and size of the field
8555 preceding it. Let's now imagine that the user is trying to print the
8556 value of My_Container. If the type fixing was recursive, we would
8557 end up computing the offset of field After based on the size of the
8558 fixed version of field First. And since in our example First has
8559 only one actual field, the size of the fixed type is actually smaller
8560 than the amount of space allocated to that field, and thus we would
8561 compute the wrong offset of field After.
8563 Unfortunately, we need to watch out for dynamic components of variant
8564 records (identified by the ___XVL suffix in the component name).
8565 Even if the target type is a PAD type, the size of that type might
8566 not be statically known. So the PAD type needs to be unwrapped and
8567 the resulting type needs to be fixed. Otherwise, we might end up
8568 with the wrong size for our component. This can be observed with
8569 the following type declarations:
8571 type Octal is new Integer range 0 .. 7;
8572 type Octal_Array is array (Positive range <>) of Octal;
8573 pragma Pack (Octal_Array);
8575 type Octal_Buffer (Size : Positive) is record
8576 Buffer : Octal_Array (1 .. Size);
8580 In that case, Buffer is a PAD type whose size is unset and needs
8581 to be computed by fixing the unwrapped type.
8583 Lastly, when should the sub-elements of a type that remained unfixed
8584 thus far, be actually fixed?
8586 The answer is: Only when referencing that element. For instance
8587 when selecting one component of a record, this specific component
8588 should be fixed at that point in time. Or when printing the value
8589 of a record, each component should be fixed before its value gets
8590 printed. Similarly for arrays, the element of the array should be
8591 fixed when printing each element of the array, or when extracting
8592 one element out of that array. On the other hand, fixing should
8593 not be performed on the elements when taking a slice of an array!
8595 Note that one of the side-effects of miscomputing the offset and
8596 size of each field is that we end up also miscomputing the size
8597 of the containing type. This can have adverse results when computing
8598 the value of an entity. GDB fetches the value of an entity based
8599 on the size of its type, and thus a wrong size causes GDB to fetch
8600 the wrong amount of memory. In the case where the computed size is
8601 too small, GDB fetches too little data to print the value of our
8602 entiry. Results in this case as unpredicatble, as we usually read
8603 past the buffer containing the data =:-o. */
8605 /* Implement the evaluate_exp routine in the exp_descriptor structure
8606 for the Ada language. */
8608 static struct value
*
8609 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8610 int *pos
, enum noside noside
)
8613 int tem
, tem2
, tem3
;
8615 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8618 struct value
**argvec
;
8622 op
= exp
->elts
[pc
].opcode
;
8628 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8629 arg1
= unwrap_value (arg1
);
8631 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8632 then we need to perform the conversion manually, because
8633 evaluate_subexp_standard doesn't do it. This conversion is
8634 necessary in Ada because the different kinds of float/fixed
8635 types in Ada have different representations.
8637 Similarly, we need to perform the conversion from OP_LONG
8639 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8640 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8646 struct value
*result
;
8648 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8649 /* The result type will have code OP_STRING, bashed there from
8650 OP_ARRAY. Bash it back. */
8651 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8652 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8658 type
= exp
->elts
[pc
+ 1].type
;
8659 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8660 if (noside
== EVAL_SKIP
)
8662 arg1
= ada_value_cast (type
, arg1
, noside
);
8667 type
= exp
->elts
[pc
+ 1].type
;
8668 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8671 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8672 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8674 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8675 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8677 return ada_value_assign (arg1
, arg1
);
8679 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8680 except if the lhs of our assignment is a convenience variable.
8681 In the case of assigning to a convenience variable, the lhs
8682 should be exactly the result of the evaluation of the rhs. */
8683 type
= value_type (arg1
);
8684 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8686 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8687 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8689 if (ada_is_fixed_point_type (value_type (arg1
)))
8690 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8691 else if (ada_is_fixed_point_type (value_type (arg2
)))
8693 (_("Fixed-point values must be assigned to fixed-point variables"));
8695 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8696 return ada_value_assign (arg1
, arg2
);
8699 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8700 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8701 if (noside
== EVAL_SKIP
)
8703 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8704 return (value_from_longest
8706 value_as_long (arg1
) + value_as_long (arg2
)));
8707 if ((ada_is_fixed_point_type (value_type (arg1
))
8708 || ada_is_fixed_point_type (value_type (arg2
)))
8709 && value_type (arg1
) != value_type (arg2
))
8710 error (_("Operands of fixed-point addition must have the same type"));
8711 /* Do the addition, and cast the result to the type of the first
8712 argument. We cannot cast the result to a reference type, so if
8713 ARG1 is a reference type, find its underlying type. */
8714 type
= value_type (arg1
);
8715 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8716 type
= TYPE_TARGET_TYPE (type
);
8717 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8718 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8721 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8722 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8723 if (noside
== EVAL_SKIP
)
8725 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8726 return (value_from_longest
8728 value_as_long (arg1
) - value_as_long (arg2
)));
8729 if ((ada_is_fixed_point_type (value_type (arg1
))
8730 || ada_is_fixed_point_type (value_type (arg2
)))
8731 && value_type (arg1
) != value_type (arg2
))
8732 error (_("Operands of fixed-point subtraction must have the same type"));
8733 /* Do the substraction, and cast the result to the type of the first
8734 argument. We cannot cast the result to a reference type, so if
8735 ARG1 is a reference type, find its underlying type. */
8736 type
= value_type (arg1
);
8737 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8738 type
= TYPE_TARGET_TYPE (type
);
8739 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8740 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8746 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8747 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8748 if (noside
== EVAL_SKIP
)
8750 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8752 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8753 return value_zero (value_type (arg1
), not_lval
);
8757 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8758 if (ada_is_fixed_point_type (value_type (arg1
)))
8759 arg1
= cast_from_fixed (type
, arg1
);
8760 if (ada_is_fixed_point_type (value_type (arg2
)))
8761 arg2
= cast_from_fixed (type
, arg2
);
8762 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8763 return ada_value_binop (arg1
, arg2
, op
);
8767 case BINOP_NOTEQUAL
:
8768 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8769 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8770 if (noside
== EVAL_SKIP
)
8772 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8776 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8777 tem
= ada_value_equal (arg1
, arg2
);
8779 if (op
== BINOP_NOTEQUAL
)
8781 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8782 return value_from_longest (type
, (LONGEST
) tem
);
8785 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8786 if (noside
== EVAL_SKIP
)
8788 else if (ada_is_fixed_point_type (value_type (arg1
)))
8789 return value_cast (value_type (arg1
), value_neg (arg1
));
8792 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8793 return value_neg (arg1
);
8796 case BINOP_LOGICAL_AND
:
8797 case BINOP_LOGICAL_OR
:
8798 case UNOP_LOGICAL_NOT
:
8803 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8804 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8805 return value_cast (type
, val
);
8808 case BINOP_BITWISE_AND
:
8809 case BINOP_BITWISE_IOR
:
8810 case BINOP_BITWISE_XOR
:
8814 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8816 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8818 return value_cast (value_type (arg1
), val
);
8824 if (noside
== EVAL_SKIP
)
8829 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8830 /* Only encountered when an unresolved symbol occurs in a
8831 context other than a function call, in which case, it is
8833 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8834 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8835 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8837 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8838 if (ada_is_tagged_type (type
, 0))
8840 /* Tagged types are a little special in the fact that the real
8841 type is dynamic and can only be determined by inspecting the
8842 object's tag. This means that we need to get the object's
8843 value first (EVAL_NORMAL) and then extract the actual object
8846 Note that we cannot skip the final step where we extract
8847 the object type from its tag, because the EVAL_NORMAL phase
8848 results in dynamic components being resolved into fixed ones.
8849 This can cause problems when trying to print the type
8850 description of tagged types whose parent has a dynamic size:
8851 We use the type name of the "_parent" component in order
8852 to print the name of the ancestor type in the type description.
8853 If that component had a dynamic size, the resolution into
8854 a fixed type would result in the loss of that type name,
8855 thus preventing us from printing the name of the ancestor
8856 type in the type description. */
8857 struct type
*actual_type
;
8859 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8860 actual_type
= type_from_tag (ada_value_tag (arg1
));
8861 if (actual_type
== NULL
)
8862 /* If, for some reason, we were unable to determine
8863 the actual type from the tag, then use the static
8864 approximation that we just computed as a fallback.
8865 This can happen if the debugging information is
8866 incomplete, for instance. */
8869 return value_zero (actual_type
, not_lval
);
8874 (to_static_fixed_type
8875 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8880 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8881 arg1
= unwrap_value (arg1
);
8882 return ada_to_fixed_value (arg1
);
8888 /* Allocate arg vector, including space for the function to be
8889 called in argvec[0] and a terminating NULL. */
8890 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8892 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8894 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8895 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8896 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8897 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8900 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8901 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8904 if (noside
== EVAL_SKIP
)
8908 if (ada_is_constrained_packed_array_type
8909 (desc_base_type (value_type (argvec
[0]))))
8910 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8911 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8912 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
8913 /* This is a packed array that has already been fixed, and
8914 therefore already coerced to a simple array. Nothing further
8917 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8918 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8919 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8920 argvec
[0] = value_addr (argvec
[0]);
8922 type
= ada_check_typedef (value_type (argvec
[0]));
8923 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8925 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8927 case TYPE_CODE_FUNC
:
8928 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8930 case TYPE_CODE_ARRAY
:
8932 case TYPE_CODE_STRUCT
:
8933 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8934 argvec
[0] = ada_value_ind (argvec
[0]);
8935 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8938 error (_("cannot subscript or call something of type `%s'"),
8939 ada_type_name (value_type (argvec
[0])));
8944 switch (TYPE_CODE (type
))
8946 case TYPE_CODE_FUNC
:
8947 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8948 return allocate_value (TYPE_TARGET_TYPE (type
));
8949 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8950 case TYPE_CODE_STRUCT
:
8954 arity
= ada_array_arity (type
);
8955 type
= ada_array_element_type (type
, nargs
);
8957 error (_("cannot subscript or call a record"));
8959 error (_("wrong number of subscripts; expecting %d"), arity
);
8960 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8961 return value_zero (ada_aligned_type (type
), lval_memory
);
8963 unwrap_value (ada_value_subscript
8964 (argvec
[0], nargs
, argvec
+ 1));
8966 case TYPE_CODE_ARRAY
:
8967 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8969 type
= ada_array_element_type (type
, nargs
);
8971 error (_("element type of array unknown"));
8973 return value_zero (ada_aligned_type (type
), lval_memory
);
8976 unwrap_value (ada_value_subscript
8977 (ada_coerce_to_simple_array (argvec
[0]),
8978 nargs
, argvec
+ 1));
8979 case TYPE_CODE_PTR
: /* Pointer to array */
8980 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8981 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8983 type
= ada_array_element_type (type
, nargs
);
8985 error (_("element type of array unknown"));
8987 return value_zero (ada_aligned_type (type
), lval_memory
);
8990 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8991 nargs
, argvec
+ 1));
8994 error (_("Attempt to index or call something other than an "
8995 "array or function"));
9000 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9001 struct value
*low_bound_val
=
9002 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9003 struct value
*high_bound_val
=
9004 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9007 low_bound_val
= coerce_ref (low_bound_val
);
9008 high_bound_val
= coerce_ref (high_bound_val
);
9009 low_bound
= pos_atr (low_bound_val
);
9010 high_bound
= pos_atr (high_bound_val
);
9012 if (noside
== EVAL_SKIP
)
9015 /* If this is a reference to an aligner type, then remove all
9017 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9018 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9019 TYPE_TARGET_TYPE (value_type (array
)) =
9020 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9022 if (ada_is_constrained_packed_array_type (value_type (array
)))
9023 error (_("cannot slice a packed array"));
9025 /* If this is a reference to an array or an array lvalue,
9026 convert to a pointer. */
9027 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9028 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9029 && VALUE_LVAL (array
) == lval_memory
))
9030 array
= value_addr (array
);
9032 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9033 && ada_is_array_descriptor_type (ada_check_typedef
9034 (value_type (array
))))
9035 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9037 array
= ada_coerce_to_simple_array_ptr (array
);
9039 /* If we have more than one level of pointer indirection,
9040 dereference the value until we get only one level. */
9041 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9042 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9044 array
= value_ind (array
);
9046 /* Make sure we really do have an array type before going further,
9047 to avoid a SEGV when trying to get the index type or the target
9048 type later down the road if the debug info generated by
9049 the compiler is incorrect or incomplete. */
9050 if (!ada_is_simple_array_type (value_type (array
)))
9051 error (_("cannot take slice of non-array"));
9053 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
9055 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9056 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
9060 struct type
*arr_type0
=
9061 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
9063 return ada_value_slice_from_ptr (array
, arr_type0
,
9064 longest_to_int (low_bound
),
9065 longest_to_int (high_bound
));
9068 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9070 else if (high_bound
< low_bound
)
9071 return empty_array (value_type (array
), low_bound
);
9073 return ada_value_slice (array
, longest_to_int (low_bound
),
9074 longest_to_int (high_bound
));
9079 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9080 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9082 if (noside
== EVAL_SKIP
)
9085 switch (TYPE_CODE (type
))
9088 lim_warning (_("Membership test incompletely implemented; "
9089 "always returns true"));
9090 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9091 return value_from_longest (type
, (LONGEST
) 1);
9093 case TYPE_CODE_RANGE
:
9094 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9095 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9096 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9097 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9098 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9100 value_from_longest (type
,
9101 (value_less (arg1
, arg3
)
9102 || value_equal (arg1
, arg3
))
9103 && (value_less (arg2
, arg1
)
9104 || value_equal (arg2
, arg1
)));
9107 case BINOP_IN_BOUNDS
:
9109 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9110 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9112 if (noside
== EVAL_SKIP
)
9115 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9117 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9118 return value_zero (type
, not_lval
);
9121 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9123 type
= ada_index_type (value_type (arg2
), tem
, "range");
9125 type
= value_type (arg1
);
9127 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9128 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9130 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9131 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9132 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9134 value_from_longest (type
,
9135 (value_less (arg1
, arg3
)
9136 || value_equal (arg1
, arg3
))
9137 && (value_less (arg2
, arg1
)
9138 || value_equal (arg2
, arg1
)));
9140 case TERNOP_IN_RANGE
:
9141 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9142 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9143 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9145 if (noside
== EVAL_SKIP
)
9148 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9149 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9150 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9152 value_from_longest (type
,
9153 (value_less (arg1
, arg3
)
9154 || value_equal (arg1
, arg3
))
9155 && (value_less (arg2
, arg1
)
9156 || value_equal (arg2
, arg1
)));
9162 struct type
*type_arg
;
9163 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9165 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9167 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9171 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9175 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9176 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9177 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9180 if (noside
== EVAL_SKIP
)
9183 if (type_arg
== NULL
)
9185 arg1
= ada_coerce_ref (arg1
);
9187 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9188 arg1
= ada_coerce_to_simple_array (arg1
);
9190 type
= ada_index_type (value_type (arg1
), tem
,
9191 ada_attribute_name (op
));
9193 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9195 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9196 return allocate_value (type
);
9200 default: /* Should never happen. */
9201 error (_("unexpected attribute encountered"));
9203 return value_from_longest
9204 (type
, ada_array_bound (arg1
, tem
, 0));
9206 return value_from_longest
9207 (type
, ada_array_bound (arg1
, tem
, 1));
9209 return value_from_longest
9210 (type
, ada_array_length (arg1
, tem
));
9213 else if (discrete_type_p (type_arg
))
9215 struct type
*range_type
;
9216 char *name
= ada_type_name (type_arg
);
9218 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9219 range_type
= to_fixed_range_type (name
, NULL
, type_arg
);
9220 if (range_type
== NULL
)
9221 range_type
= type_arg
;
9225 error (_("unexpected attribute encountered"));
9227 return value_from_longest
9228 (range_type
, discrete_type_low_bound (range_type
));
9230 return value_from_longest
9231 (range_type
, discrete_type_high_bound (range_type
));
9233 error (_("the 'length attribute applies only to array types"));
9236 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9237 error (_("unimplemented type attribute"));
9242 if (ada_is_constrained_packed_array_type (type_arg
))
9243 type_arg
= decode_constrained_packed_array_type (type_arg
);
9245 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
9247 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9249 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9250 return allocate_value (type
);
9255 error (_("unexpected attribute encountered"));
9257 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9258 return value_from_longest (type
, low
);
9260 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9261 return value_from_longest (type
, high
);
9263 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9264 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9265 return value_from_longest (type
, high
- low
+ 1);
9271 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9272 if (noside
== EVAL_SKIP
)
9275 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9276 return value_zero (ada_tag_type (arg1
), not_lval
);
9278 return ada_value_tag (arg1
);
9282 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9283 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9284 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9285 if (noside
== EVAL_SKIP
)
9287 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9288 return value_zero (value_type (arg1
), not_lval
);
9291 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9292 return value_binop (arg1
, arg2
,
9293 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9296 case OP_ATR_MODULUS
:
9298 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9299 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9301 if (noside
== EVAL_SKIP
)
9304 if (!ada_is_modular_type (type_arg
))
9305 error (_("'modulus must be applied to modular type"));
9307 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9308 ada_modulus (type_arg
));
9313 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9314 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9315 if (noside
== EVAL_SKIP
)
9317 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9318 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9319 return value_zero (type
, not_lval
);
9321 return value_pos_atr (type
, arg1
);
9324 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9325 type
= value_type (arg1
);
9327 /* If the argument is a reference, then dereference its type, since
9328 the user is really asking for the size of the actual object,
9329 not the size of the pointer. */
9330 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9331 type
= TYPE_TARGET_TYPE (type
);
9333 if (noside
== EVAL_SKIP
)
9335 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9336 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9338 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9339 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9342 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9343 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9344 type
= exp
->elts
[pc
+ 2].type
;
9345 if (noside
== EVAL_SKIP
)
9347 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9348 return value_zero (type
, not_lval
);
9350 return value_val_atr (type
, arg1
);
9353 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9354 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9355 if (noside
== EVAL_SKIP
)
9357 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9358 return value_zero (value_type (arg1
), not_lval
);
9361 /* For integer exponentiation operations,
9362 only promote the first argument. */
9363 if (is_integral_type (value_type (arg2
)))
9364 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9366 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9368 return value_binop (arg1
, arg2
, op
);
9372 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9373 if (noside
== EVAL_SKIP
)
9379 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9380 if (noside
== EVAL_SKIP
)
9382 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9383 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9384 return value_neg (arg1
);
9389 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9390 if (noside
== EVAL_SKIP
)
9392 type
= ada_check_typedef (value_type (arg1
));
9393 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9395 if (ada_is_array_descriptor_type (type
))
9396 /* GDB allows dereferencing GNAT array descriptors. */
9398 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9399 if (arrType
== NULL
)
9400 error (_("Attempt to dereference null array pointer."));
9401 return value_at_lazy (arrType
, 0);
9403 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9404 || TYPE_CODE (type
) == TYPE_CODE_REF
9405 /* In C you can dereference an array to get the 1st elt. */
9406 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9408 type
= to_static_fixed_type
9410 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9412 return value_zero (type
, lval_memory
);
9414 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9416 /* GDB allows dereferencing an int. */
9417 if (expect_type
== NULL
)
9418 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9423 to_static_fixed_type (ada_aligned_type (expect_type
));
9424 return value_zero (expect_type
, lval_memory
);
9428 error (_("Attempt to take contents of a non-pointer value."));
9430 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9431 type
= ada_check_typedef (value_type (arg1
));
9433 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9434 /* GDB allows dereferencing an int. If we were given
9435 the expect_type, then use that as the target type.
9436 Otherwise, assume that the target type is an int. */
9438 if (expect_type
!= NULL
)
9439 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9442 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9443 (CORE_ADDR
) value_as_address (arg1
));
9446 if (ada_is_array_descriptor_type (type
))
9447 /* GDB allows dereferencing GNAT array descriptors. */
9448 return ada_coerce_to_simple_array (arg1
);
9450 return ada_value_ind (arg1
);
9452 case STRUCTOP_STRUCT
:
9453 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9454 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9455 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9456 if (noside
== EVAL_SKIP
)
9458 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9460 struct type
*type1
= value_type (arg1
);
9461 if (ada_is_tagged_type (type1
, 1))
9463 type
= ada_lookup_struct_elt_type (type1
,
9464 &exp
->elts
[pc
+ 2].string
,
9467 /* In this case, we assume that the field COULD exist
9468 in some extension of the type. Return an object of
9469 "type" void, which will match any formal
9470 (see ada_type_match). */
9471 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
9476 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9479 return value_zero (ada_aligned_type (type
), lval_memory
);
9482 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
9483 arg1
= unwrap_value (arg1
);
9484 return ada_to_fixed_value (arg1
);
9487 /* The value is not supposed to be used. This is here to make it
9488 easier to accommodate expressions that contain types. */
9490 if (noside
== EVAL_SKIP
)
9492 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9493 return allocate_value (exp
->elts
[pc
+ 1].type
);
9495 error (_("Attempt to use a type name as an expression"));
9500 case OP_DISCRETE_RANGE
:
9503 if (noside
== EVAL_NORMAL
)
9507 error (_("Undefined name, ambiguous name, or renaming used in "
9508 "component association: %s."), &exp
->elts
[pc
+2].string
);
9510 error (_("Aggregates only allowed on the right of an assignment"));
9512 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9515 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9517 for (tem
= 0; tem
< nargs
; tem
+= 1)
9518 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9523 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
9529 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9530 type name that encodes the 'small and 'delta information.
9531 Otherwise, return NULL. */
9534 fixed_type_info (struct type
*type
)
9536 const char *name
= ada_type_name (type
);
9537 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9539 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9541 const char *tail
= strstr (name
, "___XF_");
9547 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9548 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9553 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9556 ada_is_fixed_point_type (struct type
*type
)
9558 return fixed_type_info (type
) != NULL
;
9561 /* Return non-zero iff TYPE represents a System.Address type. */
9564 ada_is_system_address_type (struct type
*type
)
9566 return (TYPE_NAME (type
)
9567 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9570 /* Assuming that TYPE is the representation of an Ada fixed-point
9571 type, return its delta, or -1 if the type is malformed and the
9572 delta cannot be determined. */
9575 ada_delta (struct type
*type
)
9577 const char *encoding
= fixed_type_info (type
);
9580 /* Strictly speaking, num and den are encoded as integer. However,
9581 they may not fit into a long, and they will have to be converted
9582 to DOUBLEST anyway. So scan them as DOUBLEST. */
9583 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9590 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9591 factor ('SMALL value) associated with the type. */
9594 scaling_factor (struct type
*type
)
9596 const char *encoding
= fixed_type_info (type
);
9597 DOUBLEST num0
, den0
, num1
, den1
;
9600 /* Strictly speaking, num's and den's are encoded as integer. However,
9601 they may not fit into a long, and they will have to be converted
9602 to DOUBLEST anyway. So scan them as DOUBLEST. */
9603 n
= sscanf (encoding
,
9604 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9605 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9606 &num0
, &den0
, &num1
, &den1
);
9617 /* Assuming that X is the representation of a value of fixed-point
9618 type TYPE, return its floating-point equivalent. */
9621 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9623 return (DOUBLEST
) x
*scaling_factor (type
);
9626 /* The representation of a fixed-point value of type TYPE
9627 corresponding to the value X. */
9630 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9632 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9636 /* VAX floating formats */
9638 /* Non-zero iff TYPE represents one of the special VAX floating-point
9642 ada_is_vax_floating_type (struct type
*type
)
9645 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9648 && (TYPE_CODE (type
) == TYPE_CODE_INT
9649 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9650 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9653 /* The type of special VAX floating-point type this is, assuming
9654 ada_is_vax_floating_point. */
9657 ada_vax_float_type_suffix (struct type
*type
)
9659 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9662 /* A value representing the special debugging function that outputs
9663 VAX floating-point values of the type represented by TYPE. Assumes
9664 ada_is_vax_floating_type (TYPE). */
9667 ada_vax_float_print_function (struct type
*type
)
9669 switch (ada_vax_float_type_suffix (type
))
9672 return get_var_value ("DEBUG_STRING_F", 0);
9674 return get_var_value ("DEBUG_STRING_D", 0);
9676 return get_var_value ("DEBUG_STRING_G", 0);
9678 error (_("invalid VAX floating-point type"));
9685 /* Scan STR beginning at position K for a discriminant name, and
9686 return the value of that discriminant field of DVAL in *PX. If
9687 PNEW_K is not null, put the position of the character beyond the
9688 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9689 not alter *PX and *PNEW_K if unsuccessful. */
9692 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9695 static char *bound_buffer
= NULL
;
9696 static size_t bound_buffer_len
= 0;
9699 struct value
*bound_val
;
9701 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9704 pend
= strstr (str
+ k
, "__");
9708 k
+= strlen (bound
);
9712 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9713 bound
= bound_buffer
;
9714 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9715 bound
[pend
- (str
+ k
)] = '\0';
9719 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9720 if (bound_val
== NULL
)
9723 *px
= value_as_long (bound_val
);
9729 /* Value of variable named NAME in the current environment. If
9730 no such variable found, then if ERR_MSG is null, returns 0, and
9731 otherwise causes an error with message ERR_MSG. */
9733 static struct value
*
9734 get_var_value (char *name
, char *err_msg
)
9736 struct ada_symbol_info
*syms
;
9739 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9744 if (err_msg
== NULL
)
9747 error (("%s"), err_msg
);
9750 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9753 /* Value of integer variable named NAME in the current environment. If
9754 no such variable found, returns 0, and sets *FLAG to 0. If
9755 successful, sets *FLAG to 1. */
9758 get_int_var_value (char *name
, int *flag
)
9760 struct value
*var_val
= get_var_value (name
, 0);
9772 return value_as_long (var_val
);
9777 /* Return a range type whose base type is that of the range type named
9778 NAME in the current environment, and whose bounds are calculated
9779 from NAME according to the GNAT range encoding conventions.
9780 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
9781 corresponding range type from debug information; fall back to using it
9782 if symbol lookup fails. If a new type must be created, allocate it
9783 like ORIG_TYPE was. The bounds information, in general, is encoded
9784 in NAME, the base type given in the named range type. */
9786 static struct type
*
9787 to_fixed_range_type (char *name
, struct value
*dval
, struct type
*orig_type
)
9789 struct type
*raw_type
= ada_find_any_type (name
);
9790 struct type
*base_type
;
9793 /* Fall back to the original type if symbol lookup failed. */
9794 if (raw_type
== NULL
)
9795 raw_type
= orig_type
;
9797 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9798 base_type
= TYPE_TARGET_TYPE (raw_type
);
9800 base_type
= raw_type
;
9802 subtype_info
= strstr (name
, "___XD");
9803 if (subtype_info
== NULL
)
9805 LONGEST L
= discrete_type_low_bound (raw_type
);
9806 LONGEST U
= discrete_type_high_bound (raw_type
);
9807 if (L
< INT_MIN
|| U
> INT_MAX
)
9810 return create_range_type (alloc_type_copy (orig_type
), raw_type
,
9811 discrete_type_low_bound (raw_type
),
9812 discrete_type_high_bound (raw_type
));
9816 static char *name_buf
= NULL
;
9817 static size_t name_len
= 0;
9818 int prefix_len
= subtype_info
- name
;
9824 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9825 strncpy (name_buf
, name
, prefix_len
);
9826 name_buf
[prefix_len
] = '\0';
9829 bounds_str
= strchr (subtype_info
, '_');
9832 if (*subtype_info
== 'L')
9834 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9835 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9837 if (bounds_str
[n
] == '_')
9839 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9846 strcpy (name_buf
+ prefix_len
, "___L");
9847 L
= get_int_var_value (name_buf
, &ok
);
9850 lim_warning (_("Unknown lower bound, using 1."));
9855 if (*subtype_info
== 'U')
9857 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9858 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9864 strcpy (name_buf
+ prefix_len
, "___U");
9865 U
= get_int_var_value (name_buf
, &ok
);
9868 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9873 type
= create_range_type (alloc_type_copy (orig_type
), base_type
, L
, U
);
9874 TYPE_NAME (type
) = name
;
9879 /* True iff NAME is the name of a range type. */
9882 ada_is_range_type_name (const char *name
)
9884 return (name
!= NULL
&& strstr (name
, "___XD"));
9890 /* True iff TYPE is an Ada modular type. */
9893 ada_is_modular_type (struct type
*type
)
9895 struct type
*subranged_type
= base_type (type
);
9897 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9898 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9899 && TYPE_UNSIGNED (subranged_type
));
9902 /* Try to determine the lower and upper bounds of the given modular type
9903 using the type name only. Return non-zero and set L and U as the lower
9904 and upper bounds (respectively) if successful. */
9907 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9909 char *name
= ada_type_name (type
);
9917 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9918 we are looking for static bounds, which means an __XDLU suffix.
9919 Moreover, we know that the lower bound of modular types is always
9920 zero, so the actual suffix should start with "__XDLU_0__", and
9921 then be followed by the upper bound value. */
9922 suffix
= strstr (name
, "__XDLU_0__");
9926 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9929 *modulus
= (ULONGEST
) U
+ 1;
9933 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9936 ada_modulus (struct type
*type
)
9940 /* Normally, the modulus of a modular type is equal to the value of
9941 its upper bound + 1. However, the upper bound is currently stored
9942 as an int, which is not always big enough to hold the actual bound
9943 value. To workaround this, try to take advantage of the encoding
9944 that GNAT uses with with discrete types. To avoid some unnecessary
9945 parsing, we do this only when the size of TYPE is greater than
9946 the size of the field holding the bound. */
9947 if (TYPE_LENGTH (type
) > sizeof (TYPE_HIGH_BOUND (type
))
9948 && ada_modulus_from_name (type
, &modulus
))
9951 return (ULONGEST
) (unsigned int) TYPE_HIGH_BOUND (type
) + 1;
9955 /* Ada exception catchpoint support:
9956 ---------------------------------
9958 We support 3 kinds of exception catchpoints:
9959 . catchpoints on Ada exceptions
9960 . catchpoints on unhandled Ada exceptions
9961 . catchpoints on failed assertions
9963 Exceptions raised during failed assertions, or unhandled exceptions
9964 could perfectly be caught with the general catchpoint on Ada exceptions.
9965 However, we can easily differentiate these two special cases, and having
9966 the option to distinguish these two cases from the rest can be useful
9967 to zero-in on certain situations.
9969 Exception catchpoints are a specialized form of breakpoint,
9970 since they rely on inserting breakpoints inside known routines
9971 of the GNAT runtime. The implementation therefore uses a standard
9972 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9975 Support in the runtime for exception catchpoints have been changed
9976 a few times already, and these changes affect the implementation
9977 of these catchpoints. In order to be able to support several
9978 variants of the runtime, we use a sniffer that will determine
9979 the runtime variant used by the program being debugged.
9981 At this time, we do not support the use of conditions on Ada exception
9982 catchpoints. The COND and COND_STRING fields are therefore set
9983 to NULL (most of the time, see below).
9985 Conditions where EXP_STRING, COND, and COND_STRING are used:
9987 When a user specifies the name of a specific exception in the case
9988 of catchpoints on Ada exceptions, we store the name of that exception
9989 in the EXP_STRING. We then translate this request into an actual
9990 condition stored in COND_STRING, and then parse it into an expression
9993 /* The different types of catchpoints that we introduced for catching
9996 enum exception_catchpoint_kind
9999 ex_catch_exception_unhandled
,
10003 /* Ada's standard exceptions. */
10005 static char *standard_exc
[] = {
10006 "constraint_error",
10012 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10014 /* A structure that describes how to support exception catchpoints
10015 for a given executable. */
10017 struct exception_support_info
10019 /* The name of the symbol to break on in order to insert
10020 a catchpoint on exceptions. */
10021 const char *catch_exception_sym
;
10023 /* The name of the symbol to break on in order to insert
10024 a catchpoint on unhandled exceptions. */
10025 const char *catch_exception_unhandled_sym
;
10027 /* The name of the symbol to break on in order to insert
10028 a catchpoint on failed assertions. */
10029 const char *catch_assert_sym
;
10031 /* Assuming that the inferior just triggered an unhandled exception
10032 catchpoint, this function is responsible for returning the address
10033 in inferior memory where the name of that exception is stored.
10034 Return zero if the address could not be computed. */
10035 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10038 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10039 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10041 /* The following exception support info structure describes how to
10042 implement exception catchpoints with the latest version of the
10043 Ada runtime (as of 2007-03-06). */
10045 static const struct exception_support_info default_exception_support_info
=
10047 "__gnat_debug_raise_exception", /* catch_exception_sym */
10048 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10049 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10050 ada_unhandled_exception_name_addr
10053 /* The following exception support info structure describes how to
10054 implement exception catchpoints with a slightly older version
10055 of the Ada runtime. */
10057 static const struct exception_support_info exception_support_info_fallback
=
10059 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10060 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10061 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10062 ada_unhandled_exception_name_addr_from_raise
10065 /* For each executable, we sniff which exception info structure to use
10066 and cache it in the following global variable. */
10068 static const struct exception_support_info
*exception_info
= NULL
;
10070 /* Inspect the Ada runtime and determine which exception info structure
10071 should be used to provide support for exception catchpoints.
10073 This function will always set exception_info, or raise an error. */
10076 ada_exception_support_info_sniffer (void)
10078 struct symbol
*sym
;
10080 /* If the exception info is already known, then no need to recompute it. */
10081 if (exception_info
!= NULL
)
10084 /* Check the latest (default) exception support info. */
10085 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
10089 exception_info
= &default_exception_support_info
;
10093 /* Try our fallback exception suport info. */
10094 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
10098 exception_info
= &exception_support_info_fallback
;
10102 /* Sometimes, it is normal for us to not be able to find the routine
10103 we are looking for. This happens when the program is linked with
10104 the shared version of the GNAT runtime, and the program has not been
10105 started yet. Inform the user of these two possible causes if
10108 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
10109 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10111 /* If the symbol does not exist, then check that the program is
10112 already started, to make sure that shared libraries have been
10113 loaded. If it is not started, this may mean that the symbol is
10114 in a shared library. */
10116 if (ptid_get_pid (inferior_ptid
) == 0)
10117 error (_("Unable to insert catchpoint. Try to start the program first."));
10119 /* At this point, we know that we are debugging an Ada program and
10120 that the inferior has been started, but we still are not able to
10121 find the run-time symbols. That can mean that we are in
10122 configurable run time mode, or that a-except as been optimized
10123 out by the linker... In any case, at this point it is not worth
10124 supporting this feature. */
10126 error (_("Cannot insert catchpoints in this configuration."));
10129 /* An observer of "executable_changed" events.
10130 Its role is to clear certain cached values that need to be recomputed
10131 each time a new executable is loaded by GDB. */
10134 ada_executable_changed_observer (void)
10136 /* If the executable changed, then it is possible that the Ada runtime
10137 is different. So we need to invalidate the exception support info
10139 exception_info
= NULL
;
10142 /* Return the name of the function at PC, NULL if could not find it.
10143 This function only checks the debugging information, not the symbol
10147 function_name_from_pc (CORE_ADDR pc
)
10151 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
10157 /* True iff FRAME is very likely to be that of a function that is
10158 part of the runtime system. This is all very heuristic, but is
10159 intended to be used as advice as to what frames are uninteresting
10163 is_known_support_routine (struct frame_info
*frame
)
10165 struct symtab_and_line sal
;
10169 /* If this code does not have any debugging information (no symtab),
10170 This cannot be any user code. */
10172 find_frame_sal (frame
, &sal
);
10173 if (sal
.symtab
== NULL
)
10176 /* If there is a symtab, but the associated source file cannot be
10177 located, then assume this is not user code: Selecting a frame
10178 for which we cannot display the code would not be very helpful
10179 for the user. This should also take care of case such as VxWorks
10180 where the kernel has some debugging info provided for a few units. */
10182 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10185 /* Check the unit filename againt the Ada runtime file naming.
10186 We also check the name of the objfile against the name of some
10187 known system libraries that sometimes come with debugging info
10190 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10192 re_comp (known_runtime_file_name_patterns
[i
]);
10193 if (re_exec (sal
.symtab
->filename
))
10195 if (sal
.symtab
->objfile
!= NULL
10196 && re_exec (sal
.symtab
->objfile
->name
))
10200 /* Check whether the function is a GNAT-generated entity. */
10202 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
10203 if (func_name
== NULL
)
10206 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10208 re_comp (known_auxiliary_function_name_patterns
[i
]);
10209 if (re_exec (func_name
))
10216 /* Find the first frame that contains debugging information and that is not
10217 part of the Ada run-time, starting from FI and moving upward. */
10220 ada_find_printable_frame (struct frame_info
*fi
)
10222 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10224 if (!is_known_support_routine (fi
))
10233 /* Assuming that the inferior just triggered an unhandled exception
10234 catchpoint, return the address in inferior memory where the name
10235 of the exception is stored.
10237 Return zero if the address could not be computed. */
10240 ada_unhandled_exception_name_addr (void)
10242 return parse_and_eval_address ("e.full_name");
10245 /* Same as ada_unhandled_exception_name_addr, except that this function
10246 should be used when the inferior uses an older version of the runtime,
10247 where the exception name needs to be extracted from a specific frame
10248 several frames up in the callstack. */
10251 ada_unhandled_exception_name_addr_from_raise (void)
10254 struct frame_info
*fi
;
10256 /* To determine the name of this exception, we need to select
10257 the frame corresponding to RAISE_SYM_NAME. This frame is
10258 at least 3 levels up, so we simply skip the first 3 frames
10259 without checking the name of their associated function. */
10260 fi
= get_current_frame ();
10261 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10263 fi
= get_prev_frame (fi
);
10267 const char *func_name
=
10268 function_name_from_pc (get_frame_address_in_block (fi
));
10269 if (func_name
!= NULL
10270 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10271 break; /* We found the frame we were looking for... */
10272 fi
= get_prev_frame (fi
);
10279 return parse_and_eval_address ("id.full_name");
10282 /* Assuming the inferior just triggered an Ada exception catchpoint
10283 (of any type), return the address in inferior memory where the name
10284 of the exception is stored, if applicable.
10286 Return zero if the address could not be computed, or if not relevant. */
10289 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10290 struct breakpoint
*b
)
10294 case ex_catch_exception
:
10295 return (parse_and_eval_address ("e.full_name"));
10298 case ex_catch_exception_unhandled
:
10299 return exception_info
->unhandled_exception_name_addr ();
10302 case ex_catch_assert
:
10303 return 0; /* Exception name is not relevant in this case. */
10307 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10311 return 0; /* Should never be reached. */
10314 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10315 any error that ada_exception_name_addr_1 might cause to be thrown.
10316 When an error is intercepted, a warning with the error message is printed,
10317 and zero is returned. */
10320 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10321 struct breakpoint
*b
)
10323 struct gdb_exception e
;
10324 CORE_ADDR result
= 0;
10326 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10328 result
= ada_exception_name_addr_1 (ex
, b
);
10333 warning (_("failed to get exception name: %s"), e
.message
);
10340 /* Implement the PRINT_IT method in the breakpoint_ops structure
10341 for all exception catchpoint kinds. */
10343 static enum print_stop_action
10344 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10346 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10347 char exception_name
[256];
10351 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10352 exception_name
[sizeof (exception_name
) - 1] = '\0';
10355 ada_find_printable_frame (get_current_frame ());
10357 annotate_catchpoint (b
->number
);
10360 case ex_catch_exception
:
10362 printf_filtered (_("\nCatchpoint %d, %s at "),
10363 b
->number
, exception_name
);
10365 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10367 case ex_catch_exception_unhandled
:
10369 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10370 b
->number
, exception_name
);
10372 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10375 case ex_catch_assert
:
10376 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10381 return PRINT_SRC_AND_LOC
;
10384 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10385 for all exception catchpoint kinds. */
10388 print_one_exception (enum exception_catchpoint_kind ex
,
10389 struct breakpoint
*b
, struct bp_location
**last_loc
)
10391 struct value_print_options opts
;
10393 get_user_print_options (&opts
);
10394 if (opts
.addressprint
)
10396 annotate_field (4);
10397 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
10400 annotate_field (5);
10401 *last_loc
= b
->loc
;
10404 case ex_catch_exception
:
10405 if (b
->exp_string
!= NULL
)
10407 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10409 ui_out_field_string (uiout
, "what", msg
);
10413 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10417 case ex_catch_exception_unhandled
:
10418 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10421 case ex_catch_assert
:
10422 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10426 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10431 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10432 for all exception catchpoint kinds. */
10435 print_mention_exception (enum exception_catchpoint_kind ex
,
10436 struct breakpoint
*b
)
10440 case ex_catch_exception
:
10441 if (b
->exp_string
!= NULL
)
10442 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10443 b
->number
, b
->exp_string
);
10445 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10449 case ex_catch_exception_unhandled
:
10450 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10454 case ex_catch_assert
:
10455 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10459 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10464 /* Virtual table for "catch exception" breakpoints. */
10466 static enum print_stop_action
10467 print_it_catch_exception (struct breakpoint
*b
)
10469 return print_it_exception (ex_catch_exception
, b
);
10473 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
10475 print_one_exception (ex_catch_exception
, b
, last_loc
);
10479 print_mention_catch_exception (struct breakpoint
*b
)
10481 print_mention_exception (ex_catch_exception
, b
);
10484 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10488 NULL
, /* breakpoint_hit */
10489 print_it_catch_exception
,
10490 print_one_catch_exception
,
10491 print_mention_catch_exception
10494 /* Virtual table for "catch exception unhandled" breakpoints. */
10496 static enum print_stop_action
10497 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10499 return print_it_exception (ex_catch_exception_unhandled
, b
);
10503 print_one_catch_exception_unhandled (struct breakpoint
*b
,
10504 struct bp_location
**last_loc
)
10506 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
10510 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10512 print_mention_exception (ex_catch_exception_unhandled
, b
);
10515 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10518 NULL
, /* breakpoint_hit */
10519 print_it_catch_exception_unhandled
,
10520 print_one_catch_exception_unhandled
,
10521 print_mention_catch_exception_unhandled
10524 /* Virtual table for "catch assert" breakpoints. */
10526 static enum print_stop_action
10527 print_it_catch_assert (struct breakpoint
*b
)
10529 return print_it_exception (ex_catch_assert
, b
);
10533 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
10535 print_one_exception (ex_catch_assert
, b
, last_loc
);
10539 print_mention_catch_assert (struct breakpoint
*b
)
10541 print_mention_exception (ex_catch_assert
, b
);
10544 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10547 NULL
, /* breakpoint_hit */
10548 print_it_catch_assert
,
10549 print_one_catch_assert
,
10550 print_mention_catch_assert
10553 /* Return non-zero if B is an Ada exception catchpoint. */
10556 ada_exception_catchpoint_p (struct breakpoint
*b
)
10558 return (b
->ops
== &catch_exception_breakpoint_ops
10559 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10560 || b
->ops
== &catch_assert_breakpoint_ops
);
10563 /* Return a newly allocated copy of the first space-separated token
10564 in ARGSP, and then adjust ARGSP to point immediately after that
10567 Return NULL if ARGPS does not contain any more tokens. */
10570 ada_get_next_arg (char **argsp
)
10572 char *args
= *argsp
;
10576 /* Skip any leading white space. */
10578 while (isspace (*args
))
10581 if (args
[0] == '\0')
10582 return NULL
; /* No more arguments. */
10584 /* Find the end of the current argument. */
10587 while (*end
!= '\0' && !isspace (*end
))
10590 /* Adjust ARGSP to point to the start of the next argument. */
10594 /* Make a copy of the current argument and return it. */
10596 result
= xmalloc (end
- args
+ 1);
10597 strncpy (result
, args
, end
- args
);
10598 result
[end
- args
] = '\0';
10603 /* Split the arguments specified in a "catch exception" command.
10604 Set EX to the appropriate catchpoint type.
10605 Set EXP_STRING to the name of the specific exception if
10606 specified by the user. */
10609 catch_ada_exception_command_split (char *args
,
10610 enum exception_catchpoint_kind
*ex
,
10613 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10614 char *exception_name
;
10616 exception_name
= ada_get_next_arg (&args
);
10617 make_cleanup (xfree
, exception_name
);
10619 /* Check that we do not have any more arguments. Anything else
10622 while (isspace (*args
))
10625 if (args
[0] != '\0')
10626 error (_("Junk at end of expression"));
10628 discard_cleanups (old_chain
);
10630 if (exception_name
== NULL
)
10632 /* Catch all exceptions. */
10633 *ex
= ex_catch_exception
;
10634 *exp_string
= NULL
;
10636 else if (strcmp (exception_name
, "unhandled") == 0)
10638 /* Catch unhandled exceptions. */
10639 *ex
= ex_catch_exception_unhandled
;
10640 *exp_string
= NULL
;
10644 /* Catch a specific exception. */
10645 *ex
= ex_catch_exception
;
10646 *exp_string
= exception_name
;
10650 /* Return the name of the symbol on which we should break in order to
10651 implement a catchpoint of the EX kind. */
10653 static const char *
10654 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10656 gdb_assert (exception_info
!= NULL
);
10660 case ex_catch_exception
:
10661 return (exception_info
->catch_exception_sym
);
10663 case ex_catch_exception_unhandled
:
10664 return (exception_info
->catch_exception_unhandled_sym
);
10666 case ex_catch_assert
:
10667 return (exception_info
->catch_assert_sym
);
10670 internal_error (__FILE__
, __LINE__
,
10671 _("unexpected catchpoint kind (%d)"), ex
);
10675 /* Return the breakpoint ops "virtual table" used for catchpoints
10678 static struct breakpoint_ops
*
10679 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10683 case ex_catch_exception
:
10684 return (&catch_exception_breakpoint_ops
);
10686 case ex_catch_exception_unhandled
:
10687 return (&catch_exception_unhandled_breakpoint_ops
);
10689 case ex_catch_assert
:
10690 return (&catch_assert_breakpoint_ops
);
10693 internal_error (__FILE__
, __LINE__
,
10694 _("unexpected catchpoint kind (%d)"), ex
);
10698 /* Return the condition that will be used to match the current exception
10699 being raised with the exception that the user wants to catch. This
10700 assumes that this condition is used when the inferior just triggered
10701 an exception catchpoint.
10703 The string returned is a newly allocated string that needs to be
10704 deallocated later. */
10707 ada_exception_catchpoint_cond_string (const char *exp_string
)
10711 /* The standard exceptions are a special case. They are defined in
10712 runtime units that have been compiled without debugging info; if
10713 EXP_STRING is the not-fully-qualified name of a standard
10714 exception (e.g. "constraint_error") then, during the evaluation
10715 of the condition expression, the symbol lookup on this name would
10716 *not* return this standard exception. The catchpoint condition
10717 may then be set only on user-defined exceptions which have the
10718 same not-fully-qualified name (e.g. my_package.constraint_error).
10720 To avoid this unexcepted behavior, these standard exceptions are
10721 systematically prefixed by "standard". This means that "catch
10722 exception constraint_error" is rewritten into "catch exception
10723 standard.constraint_error".
10725 If an exception named contraint_error is defined in another package of
10726 the inferior program, then the only way to specify this exception as a
10727 breakpoint condition is to use its fully-qualified named:
10728 e.g. my_package.constraint_error. */
10730 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10732 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10734 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10738 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10741 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10743 static struct expression
*
10744 ada_parse_catchpoint_condition (char *cond_string
,
10745 struct symtab_and_line sal
)
10747 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10750 /* Return the symtab_and_line that should be used to insert an exception
10751 catchpoint of the TYPE kind.
10753 EX_STRING should contain the name of a specific exception
10754 that the catchpoint should catch, or NULL otherwise.
10756 The idea behind all the remaining parameters is that their names match
10757 the name of certain fields in the breakpoint structure that are used to
10758 handle exception catchpoints. This function returns the value to which
10759 these fields should be set, depending on the type of catchpoint we need
10762 If COND and COND_STRING are both non-NULL, any value they might
10763 hold will be free'ed, and then replaced by newly allocated ones.
10764 These parameters are left untouched otherwise. */
10766 static struct symtab_and_line
10767 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10768 char **addr_string
, char **cond_string
,
10769 struct expression
**cond
, struct breakpoint_ops
**ops
)
10771 const char *sym_name
;
10772 struct symbol
*sym
;
10773 struct symtab_and_line sal
;
10775 /* First, find out which exception support info to use. */
10776 ada_exception_support_info_sniffer ();
10778 /* Then lookup the function on which we will break in order to catch
10779 the Ada exceptions requested by the user. */
10781 sym_name
= ada_exception_sym_name (ex
);
10782 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10784 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10785 that should be compiled with debugging information. As a result, we
10786 expect to find that symbol in the symtabs. If we don't find it, then
10787 the target most likely does not support Ada exceptions, or we cannot
10788 insert exception breakpoints yet, because the GNAT runtime hasn't been
10791 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10792 in such a way that no debugging information is produced for the symbol
10793 we are looking for. In this case, we could search the minimal symbols
10794 as a fall-back mechanism. This would still be operating in degraded
10795 mode, however, as we would still be missing the debugging information
10796 that is needed in order to extract the name of the exception being
10797 raised (this name is printed in the catchpoint message, and is also
10798 used when trying to catch a specific exception). We do not handle
10799 this case for now. */
10802 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10804 /* Make sure that the symbol we found corresponds to a function. */
10805 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10806 error (_("Symbol \"%s\" is not a function (class = %d)"),
10807 sym_name
, SYMBOL_CLASS (sym
));
10809 sal
= find_function_start_sal (sym
, 1);
10811 /* Set ADDR_STRING. */
10813 *addr_string
= xstrdup (sym_name
);
10815 /* Set the COND and COND_STRING (if not NULL). */
10817 if (cond_string
!= NULL
&& cond
!= NULL
)
10819 if (*cond_string
!= NULL
)
10821 xfree (*cond_string
);
10822 *cond_string
= NULL
;
10829 if (exp_string
!= NULL
)
10831 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10832 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10837 *ops
= ada_exception_breakpoint_ops (ex
);
10842 /* Parse the arguments (ARGS) of the "catch exception" command.
10844 Set TYPE to the appropriate exception catchpoint type.
10845 If the user asked the catchpoint to catch only a specific
10846 exception, then save the exception name in ADDR_STRING.
10848 See ada_exception_sal for a description of all the remaining
10849 function arguments of this function. */
10851 struct symtab_and_line
10852 ada_decode_exception_location (char *args
, char **addr_string
,
10853 char **exp_string
, char **cond_string
,
10854 struct expression
**cond
,
10855 struct breakpoint_ops
**ops
)
10857 enum exception_catchpoint_kind ex
;
10859 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10860 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10864 struct symtab_and_line
10865 ada_decode_assert_location (char *args
, char **addr_string
,
10866 struct breakpoint_ops
**ops
)
10868 /* Check that no argument where provided at the end of the command. */
10872 while (isspace (*args
))
10875 error (_("Junk at end of arguments."));
10878 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10883 /* Information about operators given special treatment in functions
10885 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10887 #define ADA_OPERATORS \
10888 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10889 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10890 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10891 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10892 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10893 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10894 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10895 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10896 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10897 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10898 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10899 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10900 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10901 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10902 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10903 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10904 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10905 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10906 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10909 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10911 switch (exp
->elts
[pc
- 1].opcode
)
10914 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10917 #define OP_DEFN(op, len, args, binop) \
10918 case op: *oplenp = len; *argsp = args; break;
10924 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10929 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10935 ada_op_name (enum exp_opcode opcode
)
10940 return op_name_standard (opcode
);
10942 #define OP_DEFN(op, len, args, binop) case op: return #op;
10947 return "OP_AGGREGATE";
10949 return "OP_CHOICES";
10955 /* As for operator_length, but assumes PC is pointing at the first
10956 element of the operator, and gives meaningful results only for the
10957 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10960 ada_forward_operator_length (struct expression
*exp
, int pc
,
10961 int *oplenp
, int *argsp
)
10963 switch (exp
->elts
[pc
].opcode
)
10966 *oplenp
= *argsp
= 0;
10969 #define OP_DEFN(op, len, args, binop) \
10970 case op: *oplenp = len; *argsp = args; break;
10976 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10981 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10987 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10988 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10996 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10998 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
11003 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
11007 /* Ada attributes ('Foo). */
11010 case OP_ATR_LENGTH
:
11014 case OP_ATR_MODULUS
:
11021 case UNOP_IN_RANGE
:
11023 /* XXX: gdb_sprint_host_address, type_sprint */
11024 fprintf_filtered (stream
, _("Type @"));
11025 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
11026 fprintf_filtered (stream
, " (");
11027 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
11028 fprintf_filtered (stream
, ")");
11030 case BINOP_IN_BOUNDS
:
11031 fprintf_filtered (stream
, " (%d)",
11032 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
11034 case TERNOP_IN_RANGE
:
11039 case OP_DISCRETE_RANGE
:
11040 case OP_POSITIONAL
:
11047 char *name
= &exp
->elts
[elt
+ 2].string
;
11048 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
11049 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
11054 return dump_subexp_body_standard (exp
, stream
, elt
);
11058 for (i
= 0; i
< nargs
; i
+= 1)
11059 elt
= dump_subexp (exp
, stream
, elt
);
11064 /* The Ada extension of print_subexp (q.v.). */
11067 ada_print_subexp (struct expression
*exp
, int *pos
,
11068 struct ui_file
*stream
, enum precedence prec
)
11070 int oplen
, nargs
, i
;
11072 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
11074 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11081 print_subexp_standard (exp
, pos
, stream
, prec
);
11085 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
11088 case BINOP_IN_BOUNDS
:
11089 /* XXX: sprint_subexp */
11090 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11091 fputs_filtered (" in ", stream
);
11092 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11093 fputs_filtered ("'range", stream
);
11094 if (exp
->elts
[pc
+ 1].longconst
> 1)
11095 fprintf_filtered (stream
, "(%ld)",
11096 (long) exp
->elts
[pc
+ 1].longconst
);
11099 case TERNOP_IN_RANGE
:
11100 if (prec
>= PREC_EQUAL
)
11101 fputs_filtered ("(", stream
);
11102 /* XXX: sprint_subexp */
11103 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11104 fputs_filtered (" in ", stream
);
11105 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11106 fputs_filtered (" .. ", stream
);
11107 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11108 if (prec
>= PREC_EQUAL
)
11109 fputs_filtered (")", stream
);
11114 case OP_ATR_LENGTH
:
11118 case OP_ATR_MODULUS
:
11123 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11125 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
11126 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
11130 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11131 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
11135 for (tem
= 1; tem
< nargs
; tem
+= 1)
11137 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
11138 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
11140 fputs_filtered (")", stream
);
11145 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
11146 fputs_filtered ("'(", stream
);
11147 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
11148 fputs_filtered (")", stream
);
11151 case UNOP_IN_RANGE
:
11152 /* XXX: sprint_subexp */
11153 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11154 fputs_filtered (" in ", stream
);
11155 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
11158 case OP_DISCRETE_RANGE
:
11159 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11160 fputs_filtered ("..", stream
);
11161 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11165 fputs_filtered ("others => ", stream
);
11166 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11170 for (i
= 0; i
< nargs
-1; i
+= 1)
11173 fputs_filtered ("|", stream
);
11174 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11176 fputs_filtered (" => ", stream
);
11177 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11180 case OP_POSITIONAL
:
11181 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11185 fputs_filtered ("(", stream
);
11186 for (i
= 0; i
< nargs
; i
+= 1)
11189 fputs_filtered (", ", stream
);
11190 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11192 fputs_filtered (")", stream
);
11197 /* Table mapping opcodes into strings for printing operators
11198 and precedences of the operators. */
11200 static const struct op_print ada_op_print_tab
[] = {
11201 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
11202 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
11203 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
11204 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
11205 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
11206 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
11207 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
11208 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
11209 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
11210 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
11211 {">", BINOP_GTR
, PREC_ORDER
, 0},
11212 {"<", BINOP_LESS
, PREC_ORDER
, 0},
11213 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
11214 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
11215 {"+", BINOP_ADD
, PREC_ADD
, 0},
11216 {"-", BINOP_SUB
, PREC_ADD
, 0},
11217 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
11218 {"*", BINOP_MUL
, PREC_MUL
, 0},
11219 {"/", BINOP_DIV
, PREC_MUL
, 0},
11220 {"rem", BINOP_REM
, PREC_MUL
, 0},
11221 {"mod", BINOP_MOD
, PREC_MUL
, 0},
11222 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
11223 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
11224 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
11225 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
11226 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
11227 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
11228 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
11229 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
11230 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
11231 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
11235 enum ada_primitive_types
{
11236 ada_primitive_type_int
,
11237 ada_primitive_type_long
,
11238 ada_primitive_type_short
,
11239 ada_primitive_type_char
,
11240 ada_primitive_type_float
,
11241 ada_primitive_type_double
,
11242 ada_primitive_type_void
,
11243 ada_primitive_type_long_long
,
11244 ada_primitive_type_long_double
,
11245 ada_primitive_type_natural
,
11246 ada_primitive_type_positive
,
11247 ada_primitive_type_system_address
,
11248 nr_ada_primitive_types
11252 ada_language_arch_info (struct gdbarch
*gdbarch
,
11253 struct language_arch_info
*lai
)
11255 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
11256 lai
->primitive_type_vector
11257 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
11260 lai
->primitive_type_vector
[ada_primitive_type_int
]
11261 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11263 lai
->primitive_type_vector
[ada_primitive_type_long
]
11264 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
11265 0, "long_integer");
11266 lai
->primitive_type_vector
[ada_primitive_type_short
]
11267 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
11268 0, "short_integer");
11269 lai
->string_char_type
11270 = lai
->primitive_type_vector
[ada_primitive_type_char
]
11271 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
11272 lai
->primitive_type_vector
[ada_primitive_type_float
]
11273 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
11275 lai
->primitive_type_vector
[ada_primitive_type_double
]
11276 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11277 "long_float", NULL
);
11278 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
11279 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
11280 0, "long_long_integer");
11281 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
11282 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11283 "long_long_float", NULL
);
11284 lai
->primitive_type_vector
[ada_primitive_type_natural
]
11285 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11287 lai
->primitive_type_vector
[ada_primitive_type_positive
]
11288 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11290 lai
->primitive_type_vector
[ada_primitive_type_void
]
11291 = builtin
->builtin_void
;
11293 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
11294 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
11295 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11296 = "system__address";
11298 lai
->bool_type_symbol
= NULL
;
11299 lai
->bool_type_default
= builtin
->builtin_bool
;
11302 /* Language vector */
11304 /* Not really used, but needed in the ada_language_defn. */
11307 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
11309 ada_emit_char (c
, type
, stream
, quoter
, 1);
11315 warnings_issued
= 0;
11316 return ada_parse ();
11319 static const struct exp_descriptor ada_exp_descriptor
= {
11321 ada_operator_length
,
11323 ada_dump_subexp_body
,
11324 ada_evaluate_subexp
11327 const struct language_defn ada_language_defn
= {
11328 "ada", /* Language name */
11332 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11333 that's not quite what this means. */
11335 macro_expansion_no
,
11336 &ada_exp_descriptor
,
11340 ada_printchar
, /* Print a character constant */
11341 ada_printstr
, /* Function to print string constant */
11342 emit_char
, /* Function to print single char (not used) */
11343 ada_print_type
, /* Print a type using appropriate syntax */
11344 default_print_typedef
, /* Print a typedef using appropriate syntax */
11345 ada_val_print
, /* Print a value using appropriate syntax */
11346 ada_value_print
, /* Print a top-level value */
11347 NULL
, /* Language specific skip_trampoline */
11348 NULL
, /* name_of_this */
11349 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11350 basic_lookup_transparent_type
, /* lookup_transparent_type */
11351 ada_la_decode
, /* Language specific symbol demangler */
11352 NULL
, /* Language specific class_name_from_physname */
11353 ada_op_print_tab
, /* expression operators for printing */
11354 0, /* c-style arrays */
11355 1, /* String lower bound */
11356 ada_get_gdb_completer_word_break_characters
,
11357 ada_make_symbol_completion_list
,
11358 ada_language_arch_info
,
11359 ada_print_array_index
,
11360 default_pass_by_reference
,
11365 /* Provide a prototype to silence -Wmissing-prototypes. */
11366 extern initialize_file_ftype _initialize_ada_language
;
11369 _initialize_ada_language (void)
11371 add_language (&ada_language_defn
);
11373 varsize_limit
= 65536;
11375 obstack_init (&symbol_list_obstack
);
11377 decoded_names_store
= htab_create_alloc
11378 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11379 NULL
, xcalloc
, xfree
);
11381 observer_attach_executable_changed (ada_executable_changed_observer
);