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 ada_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 ada_discrete_type_high_bound."));
619 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
621 ada_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 ada_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 observer_notify_memory_changed (to_addr
, len
, buffer
);
2294 val
= value_copy (toval
);
2295 memcpy (value_contents_raw (val
), value_contents (fromval
),
2296 TYPE_LENGTH (type
));
2297 deprecated_set_value_type (val
, type
);
2302 return value_assign (toval
, fromval
);
2306 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2307 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2308 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2309 * COMPONENT, and not the inferior's memory. The current contents
2310 * of COMPONENT are ignored. */
2312 value_assign_to_component (struct value
*container
, struct value
*component
,
2315 LONGEST offset_in_container
=
2316 (LONGEST
) (value_address (component
) - value_address (container
));
2317 int bit_offset_in_container
=
2318 value_bitpos (component
) - value_bitpos (container
);
2321 val
= value_cast (value_type (component
), val
);
2323 if (value_bitsize (component
) == 0)
2324 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2326 bits
= value_bitsize (component
);
2328 if (gdbarch_bits_big_endian (get_type_arch (value_type (container
))))
2329 move_bits (value_contents_writeable (container
) + offset_in_container
,
2330 value_bitpos (container
) + bit_offset_in_container
,
2331 value_contents (val
),
2332 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2335 move_bits (value_contents_writeable (container
) + offset_in_container
,
2336 value_bitpos (container
) + bit_offset_in_container
,
2337 value_contents (val
), 0, bits
, 0);
2340 /* The value of the element of array ARR at the ARITY indices given in IND.
2341 ARR may be either a simple array, GNAT array descriptor, or pointer
2345 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2349 struct type
*elt_type
;
2351 elt
= ada_coerce_to_simple_array (arr
);
2353 elt_type
= ada_check_typedef (value_type (elt
));
2354 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2355 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2356 return value_subscript_packed (elt
, arity
, ind
);
2358 for (k
= 0; k
< arity
; k
+= 1)
2360 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2361 error (_("too many subscripts (%d expected)"), k
);
2362 elt
= value_subscript (elt
, pos_atr (ind
[k
]));
2367 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2368 value of the element of *ARR at the ARITY indices given in
2369 IND. Does not read the entire array into memory. */
2371 static struct value
*
2372 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2377 for (k
= 0; k
< arity
; k
+= 1)
2381 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2382 error (_("too many subscripts (%d expected)"), k
);
2383 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2385 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2386 arr
= value_ptradd (arr
, pos_atr (ind
[k
]) - lwb
);
2387 type
= TYPE_TARGET_TYPE (type
);
2390 return value_ind (arr
);
2393 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2394 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2395 elements starting at index LOW. The lower bound of this array is LOW, as
2397 static struct value
*
2398 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2401 CORE_ADDR base
= value_as_address (array_ptr
)
2402 + ((low
- ada_discrete_type_low_bound (TYPE_INDEX_TYPE (type
)))
2403 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2404 struct type
*index_type
=
2405 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2407 struct type
*slice_type
=
2408 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2409 return value_at_lazy (slice_type
, base
);
2413 static struct value
*
2414 ada_value_slice (struct value
*array
, int low
, int high
)
2416 struct type
*type
= value_type (array
);
2417 struct type
*index_type
=
2418 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2419 struct type
*slice_type
=
2420 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2421 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2424 /* If type is a record type in the form of a standard GNAT array
2425 descriptor, returns the number of dimensions for type. If arr is a
2426 simple array, returns the number of "array of"s that prefix its
2427 type designation. Otherwise, returns 0. */
2430 ada_array_arity (struct type
*type
)
2437 type
= desc_base_type (type
);
2440 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2441 return desc_arity (desc_bounds_type (type
));
2443 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2446 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2452 /* If TYPE is a record type in the form of a standard GNAT array
2453 descriptor or a simple array type, returns the element type for
2454 TYPE after indexing by NINDICES indices, or by all indices if
2455 NINDICES is -1. Otherwise, returns NULL. */
2458 ada_array_element_type (struct type
*type
, int nindices
)
2460 type
= desc_base_type (type
);
2462 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2465 struct type
*p_array_type
;
2467 p_array_type
= desc_data_target_type (type
);
2469 k
= ada_array_arity (type
);
2473 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2474 if (nindices
>= 0 && k
> nindices
)
2476 while (k
> 0 && p_array_type
!= NULL
)
2478 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2481 return p_array_type
;
2483 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2485 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2487 type
= TYPE_TARGET_TYPE (type
);
2496 /* The type of nth index in arrays of given type (n numbering from 1).
2497 Does not examine memory. Throws an error if N is invalid or TYPE
2498 is not an array type. NAME is the name of the Ada attribute being
2499 evaluated ('range, 'first, 'last, or 'length); it is used in building
2500 the error message. */
2502 static struct type
*
2503 ada_index_type (struct type
*type
, int n
, const char *name
)
2505 struct type
*result_type
;
2507 type
= desc_base_type (type
);
2509 if (n
< 0 || n
> ada_array_arity (type
))
2510 error (_("invalid dimension number to '%s"), name
);
2512 if (ada_is_simple_array_type (type
))
2516 for (i
= 1; i
< n
; i
+= 1)
2517 type
= TYPE_TARGET_TYPE (type
);
2518 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2519 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2520 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2521 perhaps stabsread.c would make more sense. */
2522 if (result_type
&& TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2527 result_type
= desc_index_type (desc_bounds_type (type
), n
);
2528 if (result_type
== NULL
)
2529 error (_("attempt to take bound of something that is not an array"));
2535 /* Given that arr is an array type, returns the lower bound of the
2536 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2537 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2538 array-descriptor type. It works for other arrays with bounds supplied
2539 by run-time quantities other than discriminants. */
2542 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
)
2544 struct type
*type
, *elt_type
, *index_type_desc
, *index_type
;
2547 gdb_assert (which
== 0 || which
== 1);
2549 if (ada_is_constrained_packed_array_type (arr_type
))
2550 arr_type
= decode_constrained_packed_array_type (arr_type
);
2552 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2553 return (LONGEST
) - which
;
2555 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2556 type
= TYPE_TARGET_TYPE (arr_type
);
2561 for (i
= n
; i
> 1; i
--)
2562 elt_type
= TYPE_TARGET_TYPE (type
);
2564 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2565 if (index_type_desc
!= NULL
)
2566 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2567 NULL
, TYPE_INDEX_TYPE (elt_type
));
2569 index_type
= TYPE_INDEX_TYPE (elt_type
);
2572 (LONGEST
) (which
== 0
2573 ? ada_discrete_type_low_bound (index_type
)
2574 : ada_discrete_type_high_bound (index_type
));
2577 /* Given that arr is an array value, returns the lower bound of the
2578 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2579 WHICH is 1. This routine will also work for arrays with bounds
2580 supplied by run-time quantities other than discriminants. */
2583 ada_array_bound (struct value
*arr
, int n
, int which
)
2585 struct type
*arr_type
= value_type (arr
);
2587 if (ada_is_constrained_packed_array_type (arr_type
))
2588 return ada_array_bound (decode_constrained_packed_array (arr
), n
, which
);
2589 else if (ada_is_simple_array_type (arr_type
))
2590 return ada_array_bound_from_type (arr_type
, n
, which
);
2592 return value_as_long (desc_one_bound (desc_bounds (arr
), n
, which
));
2595 /* Given that arr is an array value, returns the length of the
2596 nth index. This routine will also work for arrays with bounds
2597 supplied by run-time quantities other than discriminants.
2598 Does not work for arrays indexed by enumeration types with representation
2599 clauses at the moment. */
2602 ada_array_length (struct value
*arr
, int n
)
2604 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2606 if (ada_is_constrained_packed_array_type (arr_type
))
2607 return ada_array_length (decode_constrained_packed_array (arr
), n
);
2609 if (ada_is_simple_array_type (arr_type
))
2610 return (ada_array_bound_from_type (arr_type
, n
, 1)
2611 - ada_array_bound_from_type (arr_type
, n
, 0) + 1);
2613 return (value_as_long (desc_one_bound (desc_bounds (arr
), n
, 1))
2614 - value_as_long (desc_one_bound (desc_bounds (arr
), n
, 0)) + 1);
2617 /* An empty array whose type is that of ARR_TYPE (an array type),
2618 with bounds LOW to LOW-1. */
2620 static struct value
*
2621 empty_array (struct type
*arr_type
, int low
)
2623 struct type
*index_type
=
2624 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2626 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2627 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2631 /* Name resolution */
2633 /* The "decoded" name for the user-definable Ada operator corresponding
2637 ada_decoded_op_name (enum exp_opcode op
)
2641 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2643 if (ada_opname_table
[i
].op
== op
)
2644 return ada_opname_table
[i
].decoded
;
2646 error (_("Could not find operator name for opcode"));
2650 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2651 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2652 undefined namespace) and converts operators that are
2653 user-defined into appropriate function calls. If CONTEXT_TYPE is
2654 non-null, it provides a preferred result type [at the moment, only
2655 type void has any effect---causing procedures to be preferred over
2656 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2657 return type is preferred. May change (expand) *EXP. */
2660 resolve (struct expression
**expp
, int void_context_p
)
2662 struct type
*context_type
= NULL
;
2666 context_type
= builtin_type ((*expp
)->gdbarch
)->builtin_void
;
2668 resolve_subexp (expp
, &pc
, 1, context_type
);
2671 /* Resolve the operator of the subexpression beginning at
2672 position *POS of *EXPP. "Resolving" consists of replacing
2673 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2674 with their resolutions, replacing built-in operators with
2675 function calls to user-defined operators, where appropriate, and,
2676 when DEPROCEDURE_P is non-zero, converting function-valued variables
2677 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2678 are as in ada_resolve, above. */
2680 static struct value
*
2681 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2682 struct type
*context_type
)
2686 struct expression
*exp
; /* Convenience: == *expp. */
2687 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2688 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2689 int nargs
; /* Number of operands. */
2696 /* Pass one: resolve operands, saving their types and updating *pos,
2701 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2702 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2707 resolve_subexp (expp
, pos
, 0, NULL
);
2709 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2714 resolve_subexp (expp
, pos
, 0, NULL
);
2719 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2722 case OP_ATR_MODULUS
:
2732 case TERNOP_IN_RANGE
:
2733 case BINOP_IN_BOUNDS
:
2739 case OP_DISCRETE_RANGE
:
2741 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2750 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2752 resolve_subexp (expp
, pos
, 1, NULL
);
2754 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2771 case BINOP_LOGICAL_AND
:
2772 case BINOP_LOGICAL_OR
:
2773 case BINOP_BITWISE_AND
:
2774 case BINOP_BITWISE_IOR
:
2775 case BINOP_BITWISE_XOR
:
2778 case BINOP_NOTEQUAL
:
2785 case BINOP_SUBSCRIPT
:
2793 case UNOP_LOGICAL_NOT
:
2809 case OP_INTERNALVAR
:
2819 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2822 case STRUCTOP_STRUCT
:
2823 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2836 error (_("Unexpected operator during name resolution"));
2839 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2840 for (i
= 0; i
< nargs
; i
+= 1)
2841 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2845 /* Pass two: perform any resolution on principal operator. */
2852 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2854 struct ada_symbol_info
*candidates
;
2858 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2859 (exp
->elts
[pc
+ 2].symbol
),
2860 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2863 if (n_candidates
> 1)
2865 /* Types tend to get re-introduced locally, so if there
2866 are any local symbols that are not types, first filter
2869 for (j
= 0; j
< n_candidates
; j
+= 1)
2870 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2875 case LOC_REGPARM_ADDR
:
2883 if (j
< n_candidates
)
2886 while (j
< n_candidates
)
2888 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2890 candidates
[j
] = candidates
[n_candidates
- 1];
2899 if (n_candidates
== 0)
2900 error (_("No definition found for %s"),
2901 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2902 else if (n_candidates
== 1)
2904 else if (deprocedure_p
2905 && !is_nonfunction (candidates
, n_candidates
))
2907 i
= ada_resolve_function
2908 (candidates
, n_candidates
, NULL
, 0,
2909 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2912 error (_("Could not find a match for %s"),
2913 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2917 printf_filtered (_("Multiple matches for %s\n"),
2918 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2919 user_select_syms (candidates
, n_candidates
, 1);
2923 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2924 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2925 if (innermost_block
== NULL
2926 || contained_in (candidates
[i
].block
, innermost_block
))
2927 innermost_block
= candidates
[i
].block
;
2931 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2934 replace_operator_with_call (expp
, pc
, 0, 0,
2935 exp
->elts
[pc
+ 2].symbol
,
2936 exp
->elts
[pc
+ 1].block
);
2943 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2944 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2946 struct ada_symbol_info
*candidates
;
2950 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2951 (exp
->elts
[pc
+ 5].symbol
),
2952 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2954 if (n_candidates
== 1)
2958 i
= ada_resolve_function
2959 (candidates
, n_candidates
,
2961 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2964 error (_("Could not find a match for %s"),
2965 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2968 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2969 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2970 if (innermost_block
== NULL
2971 || contained_in (candidates
[i
].block
, innermost_block
))
2972 innermost_block
= candidates
[i
].block
;
2983 case BINOP_BITWISE_AND
:
2984 case BINOP_BITWISE_IOR
:
2985 case BINOP_BITWISE_XOR
:
2987 case BINOP_NOTEQUAL
:
2995 case UNOP_LOGICAL_NOT
:
2997 if (possible_user_operator_p (op
, argvec
))
2999 struct ada_symbol_info
*candidates
;
3003 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3004 (struct block
*) NULL
, VAR_DOMAIN
,
3006 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3007 ada_decoded_op_name (op
), NULL
);
3011 replace_operator_with_call (expp
, pc
, nargs
, 1,
3012 candidates
[i
].sym
, candidates
[i
].block
);
3023 return evaluate_subexp_type (exp
, pos
);
3026 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3027 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3029 /* The term "match" here is rather loose. The match is heuristic and
3033 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3035 ftype
= ada_check_typedef (ftype
);
3036 atype
= ada_check_typedef (atype
);
3038 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3039 ftype
= TYPE_TARGET_TYPE (ftype
);
3040 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3041 atype
= TYPE_TARGET_TYPE (atype
);
3043 switch (TYPE_CODE (ftype
))
3046 return TYPE_CODE (ftype
) == TYPE_CODE (atype
);
3048 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3049 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3050 TYPE_TARGET_TYPE (atype
), 0);
3053 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3055 case TYPE_CODE_ENUM
:
3056 case TYPE_CODE_RANGE
:
3057 switch (TYPE_CODE (atype
))
3060 case TYPE_CODE_ENUM
:
3061 case TYPE_CODE_RANGE
:
3067 case TYPE_CODE_ARRAY
:
3068 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3069 || ada_is_array_descriptor_type (atype
));
3071 case TYPE_CODE_STRUCT
:
3072 if (ada_is_array_descriptor_type (ftype
))
3073 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3074 || ada_is_array_descriptor_type (atype
));
3076 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3077 && !ada_is_array_descriptor_type (atype
));
3079 case TYPE_CODE_UNION
:
3081 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3085 /* Return non-zero if the formals of FUNC "sufficiently match" the
3086 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3087 may also be an enumeral, in which case it is treated as a 0-
3088 argument function. */
3091 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3094 struct type
*func_type
= SYMBOL_TYPE (func
);
3096 if (SYMBOL_CLASS (func
) == LOC_CONST
3097 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3098 return (n_actuals
== 0);
3099 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3102 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3105 for (i
= 0; i
< n_actuals
; i
+= 1)
3107 if (actuals
[i
] == NULL
)
3111 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3112 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3114 if (!ada_type_match (ftype
, atype
, 1))
3121 /* False iff function type FUNC_TYPE definitely does not produce a value
3122 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3123 FUNC_TYPE is not a valid function type with a non-null return type
3124 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3127 return_match (struct type
*func_type
, struct type
*context_type
)
3129 struct type
*return_type
;
3131 if (func_type
== NULL
)
3134 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3135 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3137 return_type
= base_type (func_type
);
3138 if (return_type
== NULL
)
3141 context_type
= base_type (context_type
);
3143 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3144 return context_type
== NULL
|| return_type
== context_type
;
3145 else if (context_type
== NULL
)
3146 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3148 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3152 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3153 function (if any) that matches the types of the NARGS arguments in
3154 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3155 that returns that type, then eliminate matches that don't. If
3156 CONTEXT_TYPE is void and there is at least one match that does not
3157 return void, eliminate all matches that do.
3159 Asks the user if there is more than one match remaining. Returns -1
3160 if there is no such symbol or none is selected. NAME is used
3161 solely for messages. May re-arrange and modify SYMS in
3162 the process; the index returned is for the modified vector. */
3165 ada_resolve_function (struct ada_symbol_info syms
[],
3166 int nsyms
, struct value
**args
, int nargs
,
3167 const char *name
, struct type
*context_type
)
3171 int m
; /* Number of hits */
3174 /* In the first pass of the loop, we only accept functions matching
3175 context_type. If none are found, we add a second pass of the loop
3176 where every function is accepted. */
3177 for (fallback
= 0; m
== 0 && fallback
< 2; fallback
++)
3179 for (k
= 0; k
< nsyms
; k
+= 1)
3181 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3183 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3184 && (fallback
|| return_match (type
, context_type
)))
3196 printf_filtered (_("Multiple matches for %s\n"), name
);
3197 user_select_syms (syms
, m
, 1);
3203 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3204 in a listing of choices during disambiguation (see sort_choices, below).
3205 The idea is that overloadings of a subprogram name from the
3206 same package should sort in their source order. We settle for ordering
3207 such symbols by their trailing number (__N or $N). */
3210 encoded_ordered_before (char *N0
, char *N1
)
3214 else if (N0
== NULL
)
3219 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3221 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3223 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3224 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3228 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3231 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3233 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3234 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3236 return (strcmp (N0
, N1
) < 0);
3240 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3244 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3247 for (i
= 1; i
< nsyms
; i
+= 1)
3249 struct ada_symbol_info sym
= syms
[i
];
3252 for (j
= i
- 1; j
>= 0; j
-= 1)
3254 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3255 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3257 syms
[j
+ 1] = syms
[j
];
3263 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3264 by asking the user (if necessary), returning the number selected,
3265 and setting the first elements of SYMS items. Error if no symbols
3268 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3269 to be re-integrated one of these days. */
3272 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3275 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3277 int first_choice
= (max_results
== 1) ? 1 : 2;
3278 const char *select_mode
= multiple_symbols_select_mode ();
3280 if (max_results
< 1)
3281 error (_("Request to select 0 symbols!"));
3285 if (select_mode
== multiple_symbols_cancel
)
3287 canceled because the command is ambiguous\n\
3288 See set/show multiple-symbol."));
3290 /* If select_mode is "all", then return all possible symbols.
3291 Only do that if more than one symbol can be selected, of course.
3292 Otherwise, display the menu as usual. */
3293 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3296 printf_unfiltered (_("[0] cancel\n"));
3297 if (max_results
> 1)
3298 printf_unfiltered (_("[1] all\n"));
3300 sort_choices (syms
, nsyms
);
3302 for (i
= 0; i
< nsyms
; i
+= 1)
3304 if (syms
[i
].sym
== NULL
)
3307 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3309 struct symtab_and_line sal
=
3310 find_function_start_sal (syms
[i
].sym
, 1);
3311 if (sal
.symtab
== NULL
)
3312 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3314 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3317 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3318 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3319 sal
.symtab
->filename
, sal
.line
);
3325 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3326 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3327 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3328 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3330 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3331 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3333 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3334 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3335 else if (is_enumeral
3336 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3338 printf_unfiltered (("[%d] "), i
+ first_choice
);
3339 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3341 printf_unfiltered (_("'(%s) (enumeral)\n"),
3342 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3344 else if (symtab
!= NULL
)
3345 printf_unfiltered (is_enumeral
3346 ? _("[%d] %s in %s (enumeral)\n")
3347 : _("[%d] %s at %s:?\n"),
3349 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3352 printf_unfiltered (is_enumeral
3353 ? _("[%d] %s (enumeral)\n")
3354 : _("[%d] %s at ?\n"),
3356 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3360 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3363 for (i
= 0; i
< n_chosen
; i
+= 1)
3364 syms
[i
] = syms
[chosen
[i
]];
3369 /* Read and validate a set of numeric choices from the user in the
3370 range 0 .. N_CHOICES-1. Place the results in increasing
3371 order in CHOICES[0 .. N-1], and return N.
3373 The user types choices as a sequence of numbers on one line
3374 separated by blanks, encoding them as follows:
3376 + A choice of 0 means to cancel the selection, throwing an error.
3377 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3378 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3380 The user is not allowed to choose more than MAX_RESULTS values.
3382 ANNOTATION_SUFFIX, if present, is used to annotate the input
3383 prompts (for use with the -f switch). */
3386 get_selections (int *choices
, int n_choices
, int max_results
,
3387 int is_all_choice
, char *annotation_suffix
)
3392 int first_choice
= is_all_choice
? 2 : 1;
3394 prompt
= getenv ("PS2");
3398 args
= command_line_input (prompt
, 0, annotation_suffix
);
3401 error_no_arg (_("one or more choice numbers"));
3405 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3406 order, as given in args. Choices are validated. */
3412 while (isspace (*args
))
3414 if (*args
== '\0' && n_chosen
== 0)
3415 error_no_arg (_("one or more choice numbers"));
3416 else if (*args
== '\0')
3419 choice
= strtol (args
, &args2
, 10);
3420 if (args
== args2
|| choice
< 0
3421 || choice
> n_choices
+ first_choice
- 1)
3422 error (_("Argument must be choice number"));
3426 error (_("cancelled"));
3428 if (choice
< first_choice
)
3430 n_chosen
= n_choices
;
3431 for (j
= 0; j
< n_choices
; j
+= 1)
3435 choice
-= first_choice
;
3437 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3441 if (j
< 0 || choice
!= choices
[j
])
3444 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3445 choices
[k
+ 1] = choices
[k
];
3446 choices
[j
+ 1] = choice
;
3451 if (n_chosen
> max_results
)
3452 error (_("Select no more than %d of the above"), max_results
);
3457 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3458 on the function identified by SYM and BLOCK, and taking NARGS
3459 arguments. Update *EXPP as needed to hold more space. */
3462 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3463 int oplen
, struct symbol
*sym
,
3464 struct block
*block
)
3466 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3467 symbol, -oplen for operator being replaced). */
3468 struct expression
*newexp
= (struct expression
*)
3469 xmalloc (sizeof (struct expression
)
3470 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3471 struct expression
*exp
= *expp
;
3473 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3474 newexp
->language_defn
= exp
->language_defn
;
3475 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3476 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3477 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3479 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3480 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3482 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3483 newexp
->elts
[pc
+ 4].block
= block
;
3484 newexp
->elts
[pc
+ 5].symbol
= sym
;
3490 /* Type-class predicates */
3492 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3496 numeric_type_p (struct type
*type
)
3502 switch (TYPE_CODE (type
))
3507 case TYPE_CODE_RANGE
:
3508 return (type
== TYPE_TARGET_TYPE (type
)
3509 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3516 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3519 integer_type_p (struct type
*type
)
3525 switch (TYPE_CODE (type
))
3529 case TYPE_CODE_RANGE
:
3530 return (type
== TYPE_TARGET_TYPE (type
)
3531 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3538 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3541 scalar_type_p (struct type
*type
)
3547 switch (TYPE_CODE (type
))
3550 case TYPE_CODE_RANGE
:
3551 case TYPE_CODE_ENUM
:
3560 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3563 discrete_type_p (struct type
*type
)
3569 switch (TYPE_CODE (type
))
3572 case TYPE_CODE_RANGE
:
3573 case TYPE_CODE_ENUM
:
3574 case TYPE_CODE_BOOL
:
3582 /* Returns non-zero if OP with operands in the vector ARGS could be
3583 a user-defined function. Errs on the side of pre-defined operators
3584 (i.e., result 0). */
3587 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3589 struct type
*type0
=
3590 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3591 struct type
*type1
=
3592 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3606 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3610 case BINOP_BITWISE_AND
:
3611 case BINOP_BITWISE_IOR
:
3612 case BINOP_BITWISE_XOR
:
3613 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3616 case BINOP_NOTEQUAL
:
3621 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3624 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3627 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3631 case UNOP_LOGICAL_NOT
:
3633 return (!numeric_type_p (type0
));
3642 1. In the following, we assume that a renaming type's name may
3643 have an ___XD suffix. It would be nice if this went away at some
3645 2. We handle both the (old) purely type-based representation of
3646 renamings and the (new) variable-based encoding. At some point,
3647 it is devoutly to be hoped that the former goes away
3648 (FIXME: hilfinger-2007-07-09).
3649 3. Subprogram renamings are not implemented, although the XRS
3650 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3652 /* If SYM encodes a renaming,
3654 <renaming> renames <renamed entity>,
3656 sets *LEN to the length of the renamed entity's name,
3657 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3658 the string describing the subcomponent selected from the renamed
3659 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3660 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3661 are undefined). Otherwise, returns a value indicating the category
3662 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3663 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3664 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3665 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3666 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3667 may be NULL, in which case they are not assigned.
3669 [Currently, however, GCC does not generate subprogram renamings.] */
3671 enum ada_renaming_category
3672 ada_parse_renaming (struct symbol
*sym
,
3673 const char **renamed_entity
, int *len
,
3674 const char **renaming_expr
)
3676 enum ada_renaming_category kind
;
3681 return ADA_NOT_RENAMING
;
3682 switch (SYMBOL_CLASS (sym
))
3685 return ADA_NOT_RENAMING
;
3687 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3688 renamed_entity
, len
, renaming_expr
);
3692 case LOC_OPTIMIZED_OUT
:
3693 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3695 return ADA_NOT_RENAMING
;
3699 kind
= ADA_OBJECT_RENAMING
;
3703 kind
= ADA_EXCEPTION_RENAMING
;
3707 kind
= ADA_PACKAGE_RENAMING
;
3711 kind
= ADA_SUBPROGRAM_RENAMING
;
3715 return ADA_NOT_RENAMING
;
3719 if (renamed_entity
!= NULL
)
3720 *renamed_entity
= info
;
3721 suffix
= strstr (info
, "___XE");
3722 if (suffix
== NULL
|| suffix
== info
)
3723 return ADA_NOT_RENAMING
;
3725 *len
= strlen (info
) - strlen (suffix
);
3727 if (renaming_expr
!= NULL
)
3728 *renaming_expr
= suffix
;
3732 /* Assuming TYPE encodes a renaming according to the old encoding in
3733 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3734 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3735 ADA_NOT_RENAMING otherwise. */
3736 static enum ada_renaming_category
3737 parse_old_style_renaming (struct type
*type
,
3738 const char **renamed_entity
, int *len
,
3739 const char **renaming_expr
)
3741 enum ada_renaming_category kind
;
3746 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3747 || TYPE_NFIELDS (type
) != 1)
3748 return ADA_NOT_RENAMING
;
3750 name
= type_name_no_tag (type
);
3752 return ADA_NOT_RENAMING
;
3754 name
= strstr (name
, "___XR");
3756 return ADA_NOT_RENAMING
;
3761 kind
= ADA_OBJECT_RENAMING
;
3764 kind
= ADA_EXCEPTION_RENAMING
;
3767 kind
= ADA_PACKAGE_RENAMING
;
3770 kind
= ADA_SUBPROGRAM_RENAMING
;
3773 return ADA_NOT_RENAMING
;
3776 info
= TYPE_FIELD_NAME (type
, 0);
3778 return ADA_NOT_RENAMING
;
3779 if (renamed_entity
!= NULL
)
3780 *renamed_entity
= info
;
3781 suffix
= strstr (info
, "___XE");
3782 if (renaming_expr
!= NULL
)
3783 *renaming_expr
= suffix
+ 5;
3784 if (suffix
== NULL
|| suffix
== info
)
3785 return ADA_NOT_RENAMING
;
3787 *len
= suffix
- info
;
3793 /* Evaluation: Function Calls */
3795 /* Return an lvalue containing the value VAL. This is the identity on
3796 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3797 on the stack, using and updating *SP as the stack pointer, and
3798 returning an lvalue whose value_address points to the copy. */
3800 static struct value
*
3801 ensure_lval (struct value
*val
, struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3803 if (! VALUE_LVAL (val
))
3805 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3807 /* The following is taken from the structure-return code in
3808 call_function_by_hand. FIXME: Therefore, some refactoring seems
3810 if (gdbarch_inner_than (gdbarch
, 1, 2))
3812 /* Stack grows downward. Align SP and value_address (val) after
3813 reserving sufficient space. */
3815 if (gdbarch_frame_align_p (gdbarch
))
3816 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3817 set_value_address (val
, *sp
);
3821 /* Stack grows upward. Align the frame, allocate space, and
3822 then again, re-align the frame. */
3823 if (gdbarch_frame_align_p (gdbarch
))
3824 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3825 set_value_address (val
, *sp
);
3827 if (gdbarch_frame_align_p (gdbarch
))
3828 *sp
= gdbarch_frame_align (gdbarch
, *sp
);
3830 VALUE_LVAL (val
) = lval_memory
;
3832 write_memory (value_address (val
), value_contents_raw (val
), len
);
3838 /* Return the value ACTUAL, converted to be an appropriate value for a
3839 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3840 allocating any necessary descriptors (fat pointers), or copies of
3841 values not residing in memory, updating it as needed. */
3844 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3845 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3847 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3848 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3849 struct type
*formal_target
=
3850 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3851 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3852 struct type
*actual_target
=
3853 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3854 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3856 if (ada_is_array_descriptor_type (formal_target
)
3857 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3858 return make_array_descriptor (formal_type
, actual
, gdbarch
, sp
);
3859 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3860 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3862 struct value
*result
;
3863 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3864 && ada_is_array_descriptor_type (actual_target
))
3865 result
= desc_data (actual
);
3866 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3868 if (VALUE_LVAL (actual
) != lval_memory
)
3871 actual_type
= ada_check_typedef (value_type (actual
));
3872 val
= allocate_value (actual_type
);
3873 memcpy ((char *) value_contents_raw (val
),
3874 (char *) value_contents (actual
),
3875 TYPE_LENGTH (actual_type
));
3876 actual
= ensure_lval (val
, gdbarch
, sp
);
3878 result
= value_addr (actual
);
3882 return value_cast_pointers (formal_type
, result
);
3884 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3885 return ada_value_ind (actual
);
3891 /* Push a descriptor of type TYPE for array value ARR on the stack at
3892 *SP, updating *SP to reflect the new descriptor. Return either
3893 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3894 to-descriptor type rather than a descriptor type), a struct value *
3895 representing a pointer to this descriptor. */
3897 static struct value
*
3898 make_array_descriptor (struct type
*type
, struct value
*arr
,
3899 struct gdbarch
*gdbarch
, CORE_ADDR
*sp
)
3901 struct type
*bounds_type
= desc_bounds_type (type
);
3902 struct type
*desc_type
= desc_base_type (type
);
3903 struct value
*descriptor
= allocate_value (desc_type
);
3904 struct value
*bounds
= allocate_value (bounds_type
);
3907 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3909 modify_general_field (value_type (bounds
),
3910 value_contents_writeable (bounds
),
3911 ada_array_bound (arr
, i
, 0),
3912 desc_bound_bitpos (bounds_type
, i
, 0),
3913 desc_bound_bitsize (bounds_type
, i
, 0));
3914 modify_general_field (value_type (bounds
),
3915 value_contents_writeable (bounds
),
3916 ada_array_bound (arr
, i
, 1),
3917 desc_bound_bitpos (bounds_type
, i
, 1),
3918 desc_bound_bitsize (bounds_type
, i
, 1));
3921 bounds
= ensure_lval (bounds
, gdbarch
, sp
);
3923 modify_general_field (value_type (descriptor
),
3924 value_contents_writeable (descriptor
),
3925 value_address (ensure_lval (arr
, gdbarch
, sp
)),
3926 fat_pntr_data_bitpos (desc_type
),
3927 fat_pntr_data_bitsize (desc_type
));
3929 modify_general_field (value_type (descriptor
),
3930 value_contents_writeable (descriptor
),
3931 value_address (bounds
),
3932 fat_pntr_bounds_bitpos (desc_type
),
3933 fat_pntr_bounds_bitsize (desc_type
));
3935 descriptor
= ensure_lval (descriptor
, gdbarch
, sp
);
3937 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3938 return value_addr (descriptor
);
3943 /* Dummy definitions for an experimental caching module that is not
3944 * used in the public sources. */
3947 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3948 struct symbol
**sym
, struct block
**block
)
3954 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3955 struct block
*block
)
3961 /* Return the result of a standard (literal, C-like) lookup of NAME in
3962 given DOMAIN, visible from lexical block BLOCK. */
3964 static struct symbol
*
3965 standard_lookup (const char *name
, const struct block
*block
,
3970 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3972 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3973 cache_symbol (name
, domain
, sym
, block_found
);
3978 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3979 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3980 since they contend in overloading in the same way. */
3982 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3986 for (i
= 0; i
< n
; i
+= 1)
3987 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3988 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3989 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3995 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3996 struct types. Otherwise, they may not. */
3999 equiv_types (struct type
*type0
, struct type
*type1
)
4003 if (type0
== NULL
|| type1
== NULL
4004 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4006 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4007 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4008 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4009 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4015 /* True iff SYM0 represents the same entity as SYM1, or one that is
4016 no more defined than that of SYM1. */
4019 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4023 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4024 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4027 switch (SYMBOL_CLASS (sym0
))
4033 struct type
*type0
= SYMBOL_TYPE (sym0
);
4034 struct type
*type1
= SYMBOL_TYPE (sym1
);
4035 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4036 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4037 int len0
= strlen (name0
);
4039 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4040 && (equiv_types (type0
, type1
)
4041 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4042 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4045 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4046 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4052 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4053 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4056 add_defn_to_vec (struct obstack
*obstackp
,
4058 struct block
*block
)
4062 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4064 /* Do not try to complete stub types, as the debugger is probably
4065 already scanning all symbols matching a certain name at the
4066 time when this function is called. Trying to replace the stub
4067 type by its associated full type will cause us to restart a scan
4068 which may lead to an infinite recursion. Instead, the client
4069 collecting the matching symbols will end up collecting several
4070 matches, with at least one of them complete. It can then filter
4071 out the stub ones if needed. */
4073 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4075 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4077 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4079 prevDefns
[i
].sym
= sym
;
4080 prevDefns
[i
].block
= block
;
4086 struct ada_symbol_info info
;
4090 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4094 /* Number of ada_symbol_info structures currently collected in
4095 current vector in *OBSTACKP. */
4098 num_defns_collected (struct obstack
*obstackp
)
4100 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4103 /* Vector of ada_symbol_info structures currently collected in current
4104 vector in *OBSTACKP. If FINISH, close off the vector and return
4105 its final address. */
4107 static struct ada_symbol_info
*
4108 defns_collected (struct obstack
*obstackp
, int finish
)
4111 return obstack_finish (obstackp
);
4113 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4116 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4117 Check the global symbols if GLOBAL, the static symbols if not.
4118 Do wild-card match if WILD. */
4120 static struct partial_symbol
*
4121 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4122 int global
, domain_enum
namespace, int wild
)
4124 struct partial_symbol
**start
;
4125 int name_len
= strlen (name
);
4126 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4135 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4136 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4140 for (i
= 0; i
< length
; i
+= 1)
4142 struct partial_symbol
*psym
= start
[i
];
4144 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4145 SYMBOL_DOMAIN (psym
), namespace)
4146 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4160 int M
= (U
+ i
) >> 1;
4161 struct partial_symbol
*psym
= start
[M
];
4162 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4164 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4166 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4177 struct partial_symbol
*psym
= start
[i
];
4179 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4180 SYMBOL_DOMAIN (psym
), namespace))
4182 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4190 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4204 int M
= (U
+ i
) >> 1;
4205 struct partial_symbol
*psym
= start
[M
];
4206 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4208 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4210 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4221 struct partial_symbol
*psym
= start
[i
];
4223 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4224 SYMBOL_DOMAIN (psym
), namespace))
4228 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4231 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4233 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4243 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4253 /* Return a minimal symbol matching NAME according to Ada decoding
4254 rules. Returns NULL if there is no such minimal symbol. Names
4255 prefixed with "standard__" are handled specially: "standard__" is
4256 first stripped off, and only static and global symbols are searched. */
4258 struct minimal_symbol
*
4259 ada_lookup_simple_minsym (const char *name
)
4261 struct objfile
*objfile
;
4262 struct minimal_symbol
*msymbol
;
4265 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4267 name
+= sizeof ("standard__") - 1;
4271 wild_match
= (strstr (name
, "__") == NULL
);
4273 ALL_MSYMBOLS (objfile
, msymbol
)
4275 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4276 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4283 /* For all subprograms that statically enclose the subprogram of the
4284 selected frame, add symbols matching identifier NAME in DOMAIN
4285 and their blocks to the list of data in OBSTACKP, as for
4286 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4290 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4291 const char *name
, domain_enum
namespace,
4296 /* True if TYPE is definitely an artificial type supplied to a symbol
4297 for which no debugging information was given in the symbol file. */
4300 is_nondebugging_type (struct type
*type
)
4302 char *name
= ada_type_name (type
);
4303 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4306 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4307 duplicate other symbols in the list (The only case I know of where
4308 this happens is when object files containing stabs-in-ecoff are
4309 linked with files containing ordinary ecoff debugging symbols (or no
4310 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4311 Returns the number of items in the modified list. */
4314 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4323 /* If two symbols have the same name and one of them is a stub type,
4324 the get rid of the stub. */
4326 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4327 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4329 for (j
= 0; j
< nsyms
; j
++)
4332 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4333 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4334 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4335 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4340 /* Two symbols with the same name, same class and same address
4341 should be identical. */
4343 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4344 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4345 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4347 for (j
= 0; j
< nsyms
; j
+= 1)
4350 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4351 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4352 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4353 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4354 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4355 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4362 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4363 syms
[j
- 1] = syms
[j
];
4372 /* Given a type that corresponds to a renaming entity, use the type name
4373 to extract the scope (package name or function name, fully qualified,
4374 and following the GNAT encoding convention) where this renaming has been
4375 defined. The string returned needs to be deallocated after use. */
4378 xget_renaming_scope (struct type
*renaming_type
)
4380 /* The renaming types adhere to the following convention:
4381 <scope>__<rename>___<XR extension>.
4382 So, to extract the scope, we search for the "___XR" extension,
4383 and then backtrack until we find the first "__". */
4385 const char *name
= type_name_no_tag (renaming_type
);
4386 char *suffix
= strstr (name
, "___XR");
4391 /* Now, backtrack a bit until we find the first "__". Start looking
4392 at suffix - 3, as the <rename> part is at least one character long. */
4394 for (last
= suffix
- 3; last
> name
; last
--)
4395 if (last
[0] == '_' && last
[1] == '_')
4398 /* Make a copy of scope and return it. */
4400 scope_len
= last
- name
;
4401 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4403 strncpy (scope
, name
, scope_len
);
4404 scope
[scope_len
] = '\0';
4409 /* Return nonzero if NAME corresponds to a package name. */
4412 is_package_name (const char *name
)
4414 /* Here, We take advantage of the fact that no symbols are generated
4415 for packages, while symbols are generated for each function.
4416 So the condition for NAME represent a package becomes equivalent
4417 to NAME not existing in our list of symbols. There is only one
4418 small complication with library-level functions (see below). */
4422 /* If it is a function that has not been defined at library level,
4423 then we should be able to look it up in the symbols. */
4424 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4427 /* Library-level function names start with "_ada_". See if function
4428 "_ada_" followed by NAME can be found. */
4430 /* Do a quick check that NAME does not contain "__", since library-level
4431 functions names cannot contain "__" in them. */
4432 if (strstr (name
, "__") != NULL
)
4435 fun_name
= xstrprintf ("_ada_%s", name
);
4437 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4440 /* Return nonzero if SYM corresponds to a renaming entity that is
4441 not visible from FUNCTION_NAME. */
4444 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4448 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4451 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4453 make_cleanup (xfree
, scope
);
4455 /* If the rename has been defined in a package, then it is visible. */
4456 if (is_package_name (scope
))
4459 /* Check that the rename is in the current function scope by checking
4460 that its name starts with SCOPE. */
4462 /* If the function name starts with "_ada_", it means that it is
4463 a library-level function. Strip this prefix before doing the
4464 comparison, as the encoding for the renaming does not contain
4466 if (strncmp (function_name
, "_ada_", 5) == 0)
4469 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4472 /* Remove entries from SYMS that corresponds to a renaming entity that
4473 is not visible from the function associated with CURRENT_BLOCK or
4474 that is superfluous due to the presence of more specific renaming
4475 information. Places surviving symbols in the initial entries of
4476 SYMS and returns the number of surviving symbols.
4479 First, in cases where an object renaming is implemented as a
4480 reference variable, GNAT may produce both the actual reference
4481 variable and the renaming encoding. In this case, we discard the
4484 Second, GNAT emits a type following a specified encoding for each renaming
4485 entity. Unfortunately, STABS currently does not support the definition
4486 of types that are local to a given lexical block, so all renamings types
4487 are emitted at library level. As a consequence, if an application
4488 contains two renaming entities using the same name, and a user tries to
4489 print the value of one of these entities, the result of the ada symbol
4490 lookup will also contain the wrong renaming type.
4492 This function partially covers for this limitation by attempting to
4493 remove from the SYMS list renaming symbols that should be visible
4494 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4495 method with the current information available. The implementation
4496 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4498 - When the user tries to print a rename in a function while there
4499 is another rename entity defined in a package: Normally, the
4500 rename in the function has precedence over the rename in the
4501 package, so the latter should be removed from the list. This is
4502 currently not the case.
4504 - This function will incorrectly remove valid renames if
4505 the CURRENT_BLOCK corresponds to a function which symbol name
4506 has been changed by an "Export" pragma. As a consequence,
4507 the user will be unable to print such rename entities. */
4510 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4511 int nsyms
, const struct block
*current_block
)
4513 struct symbol
*current_function
;
4514 char *current_function_name
;
4516 int is_new_style_renaming
;
4518 /* If there is both a renaming foo___XR... encoded as a variable and
4519 a simple variable foo in the same block, discard the latter.
4520 First, zero out such symbols, then compress. */
4521 is_new_style_renaming
= 0;
4522 for (i
= 0; i
< nsyms
; i
+= 1)
4524 struct symbol
*sym
= syms
[i
].sym
;
4525 struct block
*block
= syms
[i
].block
;
4529 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4531 name
= SYMBOL_LINKAGE_NAME (sym
);
4532 suffix
= strstr (name
, "___XR");
4536 int name_len
= suffix
- name
;
4538 is_new_style_renaming
= 1;
4539 for (j
= 0; j
< nsyms
; j
+= 1)
4540 if (i
!= j
&& syms
[j
].sym
!= NULL
4541 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4543 && block
== syms
[j
].block
)
4547 if (is_new_style_renaming
)
4551 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4552 if (syms
[j
].sym
!= NULL
)
4560 /* Extract the function name associated to CURRENT_BLOCK.
4561 Abort if unable to do so. */
4563 if (current_block
== NULL
)
4566 current_function
= block_linkage_function (current_block
);
4567 if (current_function
== NULL
)
4570 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4571 if (current_function_name
== NULL
)
4574 /* Check each of the symbols, and remove it from the list if it is
4575 a type corresponding to a renaming that is out of the scope of
4576 the current block. */
4581 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4582 == ADA_OBJECT_RENAMING
4583 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4586 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4587 syms
[j
- 1] = syms
[j
];
4597 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4598 whose name and domain match NAME and DOMAIN respectively.
4599 If no match was found, then extend the search to "enclosing"
4600 routines (in other words, if we're inside a nested function,
4601 search the symbols defined inside the enclosing functions).
4603 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4606 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4607 struct block
*block
, domain_enum domain
,
4610 int block_depth
= 0;
4612 while (block
!= NULL
)
4615 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4617 /* If we found a non-function match, assume that's the one. */
4618 if (is_nonfunction (defns_collected (obstackp
, 0),
4619 num_defns_collected (obstackp
)))
4622 block
= BLOCK_SUPERBLOCK (block
);
4625 /* If no luck so far, try to find NAME as a local symbol in some lexically
4626 enclosing subprogram. */
4627 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4628 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4631 /* Add to OBSTACKP all non-local symbols whose name and domain match
4632 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4633 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4636 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4637 domain_enum domain
, int global
,
4640 struct objfile
*objfile
;
4641 struct partial_symtab
*ps
;
4643 ALL_PSYMTABS (objfile
, ps
)
4647 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4649 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4650 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4652 if (s
== NULL
|| !s
->primary
)
4654 ada_add_block_symbols (obstackp
,
4655 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4656 name
, domain
, objfile
, wild_match
);
4661 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4662 scope and in global scopes, returning the number of matches. Sets
4663 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4664 indicating the symbols found and the blocks and symbol tables (if
4665 any) in which they were found. This vector are transient---good only to
4666 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4667 symbol match within the nest of blocks whose innermost member is BLOCK0,
4668 is the one match returned (no other matches in that or
4669 enclosing blocks is returned). If there are any matches in or
4670 surrounding BLOCK0, then these alone are returned. Otherwise, the
4671 search extends to global and file-scope (static) symbol tables.
4672 Names prefixed with "standard__" are handled specially: "standard__"
4673 is first stripped off, and only static and global symbols are searched. */
4676 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4677 domain_enum
namespace,
4678 struct ada_symbol_info
**results
)
4681 struct block
*block
;
4687 obstack_free (&symbol_list_obstack
, NULL
);
4688 obstack_init (&symbol_list_obstack
);
4692 /* Search specified block and its superiors. */
4694 wild_match
= (strstr (name0
, "__") == NULL
);
4696 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4697 needed, but adding const will
4698 have a cascade effect. */
4700 /* Special case: If the user specifies a symbol name inside package
4701 Standard, do a non-wild matching of the symbol name without
4702 the "standard__" prefix. This was primarily introduced in order
4703 to allow the user to specifically access the standard exceptions
4704 using, for instance, Standard.Constraint_Error when Constraint_Error
4705 is ambiguous (due to the user defining its own Constraint_Error
4706 entity inside its program). */
4707 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4711 name
= name0
+ sizeof ("standard__") - 1;
4714 /* Check the non-global symbols. If we have ANY match, then we're done. */
4716 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4718 if (num_defns_collected (&symbol_list_obstack
) > 0)
4721 /* No non-global symbols found. Check our cache to see if we have
4722 already performed this search before. If we have, then return
4726 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4729 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4733 /* Search symbols from all global blocks. */
4735 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4738 /* Now add symbols from all per-file blocks if we've gotten no hits
4739 (not strictly correct, but perhaps better than an error). */
4741 if (num_defns_collected (&symbol_list_obstack
) == 0)
4742 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4746 ndefns
= num_defns_collected (&symbol_list_obstack
);
4747 *results
= defns_collected (&symbol_list_obstack
, 1);
4749 ndefns
= remove_extra_symbols (*results
, ndefns
);
4752 cache_symbol (name0
, namespace, NULL
, NULL
);
4754 if (ndefns
== 1 && cacheIfUnique
)
4755 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4757 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4763 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4764 domain_enum
namespace, struct block
**block_found
)
4766 struct ada_symbol_info
*candidates
;
4769 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4771 if (n_candidates
== 0)
4774 if (block_found
!= NULL
)
4775 *block_found
= candidates
[0].block
;
4777 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4780 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4781 scope and in global scopes, or NULL if none. NAME is folded and
4782 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4783 choosing the first symbol if there are multiple choices.
4784 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4785 table in which the symbol was found (in both cases, these
4786 assignments occur only if the pointers are non-null). */
4788 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4789 domain_enum
namespace, int *is_a_field_of_this
)
4791 if (is_a_field_of_this
!= NULL
)
4792 *is_a_field_of_this
= 0;
4795 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4796 block0
, namespace, NULL
);
4799 static struct symbol
*
4800 ada_lookup_symbol_nonlocal (const char *name
,
4801 const char *linkage_name
,
4802 const struct block
*block
,
4803 const domain_enum domain
)
4805 if (linkage_name
== NULL
)
4806 linkage_name
= name
;
4807 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4812 /* True iff STR is a possible encoded suffix of a normal Ada name
4813 that is to be ignored for matching purposes. Suffixes of parallel
4814 names (e.g., XVE) are not included here. Currently, the possible suffixes
4815 are given by any of the regular expressions:
4817 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4818 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4819 _E[0-9]+[bs]$ [protected object entry suffixes]
4820 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4822 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4823 match is performed. This sequence is used to differentiate homonyms,
4824 is an optional part of a valid name suffix. */
4827 is_name_suffix (const char *str
)
4830 const char *matching
;
4831 const int len
= strlen (str
);
4833 /* Skip optional leading __[0-9]+. */
4835 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4838 while (isdigit (str
[0]))
4844 if (str
[0] == '.' || str
[0] == '$')
4847 while (isdigit (matching
[0]))
4849 if (matching
[0] == '\0')
4855 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4858 while (isdigit (matching
[0]))
4860 if (matching
[0] == '\0')
4865 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4866 with a N at the end. Unfortunately, the compiler uses the same
4867 convention for other internal types it creates. So treating
4868 all entity names that end with an "N" as a name suffix causes
4869 some regressions. For instance, consider the case of an enumerated
4870 type. To support the 'Image attribute, it creates an array whose
4872 Having a single character like this as a suffix carrying some
4873 information is a bit risky. Perhaps we should change the encoding
4874 to be something like "_N" instead. In the meantime, do not do
4875 the following check. */
4876 /* Protected Object Subprograms */
4877 if (len
== 1 && str
[0] == 'N')
4882 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4885 while (isdigit (matching
[0]))
4887 if ((matching
[0] == 'b' || matching
[0] == 's')
4888 && matching
[1] == '\0')
4892 /* ??? We should not modify STR directly, as we are doing below. This
4893 is fine in this case, but may become problematic later if we find
4894 that this alternative did not work, and want to try matching
4895 another one from the begining of STR. Since we modified it, we
4896 won't be able to find the begining of the string anymore! */
4900 while (str
[0] != '_' && str
[0] != '\0')
4902 if (str
[0] != 'n' && str
[0] != 'b')
4908 if (str
[0] == '\000')
4913 if (str
[1] != '_' || str
[2] == '\000')
4917 if (strcmp (str
+ 3, "JM") == 0)
4919 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4920 the LJM suffix in favor of the JM one. But we will
4921 still accept LJM as a valid suffix for a reasonable
4922 amount of time, just to allow ourselves to debug programs
4923 compiled using an older version of GNAT. */
4924 if (strcmp (str
+ 3, "LJM") == 0)
4928 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4929 || str
[4] == 'U' || str
[4] == 'P')
4931 if (str
[4] == 'R' && str
[5] != 'T')
4935 if (!isdigit (str
[2]))
4937 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4938 if (!isdigit (str
[k
]) && str
[k
] != '_')
4942 if (str
[0] == '$' && isdigit (str
[1]))
4944 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4945 if (!isdigit (str
[k
]) && str
[k
] != '_')
4952 /* Return non-zero if the string starting at NAME and ending before
4953 NAME_END contains no capital letters. */
4956 is_valid_name_for_wild_match (const char *name0
)
4958 const char *decoded_name
= ada_decode (name0
);
4961 /* If the decoded name starts with an angle bracket, it means that
4962 NAME0 does not follow the GNAT encoding format. It should then
4963 not be allowed as a possible wild match. */
4964 if (decoded_name
[0] == '<')
4967 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4968 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4974 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4975 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4976 informational suffixes of NAME (i.e., for which is_name_suffix is
4980 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4987 match
= strstr (start
, patn0
);
4992 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4993 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4994 && is_name_suffix (match
+ patn_len
))
4995 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
5000 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5001 vector *defn_symbols, updating the list of symbols in OBSTACKP
5002 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5003 OBJFILE is the section containing BLOCK.
5004 SYMTAB is recorded with each symbol added. */
5007 ada_add_block_symbols (struct obstack
*obstackp
,
5008 struct block
*block
, const char *name
,
5009 domain_enum domain
, struct objfile
*objfile
,
5012 struct dict_iterator iter
;
5013 int name_len
= strlen (name
);
5014 /* A matching argument symbol, if any. */
5015 struct symbol
*arg_sym
;
5016 /* Set true when we find a matching non-argument symbol. */
5025 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5027 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5028 SYMBOL_DOMAIN (sym
), domain
)
5029 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5031 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5033 else if (SYMBOL_IS_ARGUMENT (sym
))
5038 add_defn_to_vec (obstackp
,
5039 fixup_symbol_section (sym
, objfile
),
5047 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5049 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5050 SYMBOL_DOMAIN (sym
), domain
))
5052 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5054 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5056 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5058 if (SYMBOL_IS_ARGUMENT (sym
))
5063 add_defn_to_vec (obstackp
,
5064 fixup_symbol_section (sym
, objfile
),
5073 if (!found_sym
&& arg_sym
!= NULL
)
5075 add_defn_to_vec (obstackp
,
5076 fixup_symbol_section (arg_sym
, objfile
),
5085 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5087 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5088 SYMBOL_DOMAIN (sym
), domain
))
5092 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5095 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5097 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5102 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5104 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5106 if (SYMBOL_IS_ARGUMENT (sym
))
5111 add_defn_to_vec (obstackp
,
5112 fixup_symbol_section (sym
, objfile
),
5120 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5121 They aren't parameters, right? */
5122 if (!found_sym
&& arg_sym
!= NULL
)
5124 add_defn_to_vec (obstackp
,
5125 fixup_symbol_section (arg_sym
, objfile
),
5132 /* Symbol Completion */
5134 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5135 name in a form that's appropriate for the completion. The result
5136 does not need to be deallocated, but is only good until the next call.
5138 TEXT_LEN is equal to the length of TEXT.
5139 Perform a wild match if WILD_MATCH is set.
5140 ENCODED should be set if TEXT represents the start of a symbol name
5141 in its encoded form. */
5144 symbol_completion_match (const char *sym_name
,
5145 const char *text
, int text_len
,
5146 int wild_match
, int encoded
)
5149 const int verbatim_match
= (text
[0] == '<');
5154 /* Strip the leading angle bracket. */
5159 /* First, test against the fully qualified name of the symbol. */
5161 if (strncmp (sym_name
, text
, text_len
) == 0)
5164 if (match
&& !encoded
)
5166 /* One needed check before declaring a positive match is to verify
5167 that iff we are doing a verbatim match, the decoded version
5168 of the symbol name starts with '<'. Otherwise, this symbol name
5169 is not a suitable completion. */
5170 const char *sym_name_copy
= sym_name
;
5171 int has_angle_bracket
;
5173 sym_name
= ada_decode (sym_name
);
5174 has_angle_bracket
= (sym_name
[0] == '<');
5175 match
= (has_angle_bracket
== verbatim_match
);
5176 sym_name
= sym_name_copy
;
5179 if (match
&& !verbatim_match
)
5181 /* When doing non-verbatim match, another check that needs to
5182 be done is to verify that the potentially matching symbol name
5183 does not include capital letters, because the ada-mode would
5184 not be able to understand these symbol names without the
5185 angle bracket notation. */
5188 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5193 /* Second: Try wild matching... */
5195 if (!match
&& wild_match
)
5197 /* Since we are doing wild matching, this means that TEXT
5198 may represent an unqualified symbol name. We therefore must
5199 also compare TEXT against the unqualified name of the symbol. */
5200 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5202 if (strncmp (sym_name
, text
, text_len
) == 0)
5206 /* Finally: If we found a mach, prepare the result to return. */
5212 sym_name
= add_angle_brackets (sym_name
);
5215 sym_name
= ada_decode (sym_name
);
5220 typedef char *char_ptr
;
5221 DEF_VEC_P (char_ptr
);
5223 /* A companion function to ada_make_symbol_completion_list().
5224 Check if SYM_NAME represents a symbol which name would be suitable
5225 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5226 it is appended at the end of the given string vector SV.
5228 ORIG_TEXT is the string original string from the user command
5229 that needs to be completed. WORD is the entire command on which
5230 completion should be performed. These two parameters are used to
5231 determine which part of the symbol name should be added to the
5233 if WILD_MATCH is set, then wild matching is performed.
5234 ENCODED should be set if TEXT represents a symbol name in its
5235 encoded formed (in which case the completion should also be
5239 symbol_completion_add (VEC(char_ptr
) **sv
,
5240 const char *sym_name
,
5241 const char *text
, int text_len
,
5242 const char *orig_text
, const char *word
,
5243 int wild_match
, int encoded
)
5245 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5246 wild_match
, encoded
);
5252 /* We found a match, so add the appropriate completion to the given
5255 if (word
== orig_text
)
5257 completion
= xmalloc (strlen (match
) + 5);
5258 strcpy (completion
, match
);
5260 else if (word
> orig_text
)
5262 /* Return some portion of sym_name. */
5263 completion
= xmalloc (strlen (match
) + 5);
5264 strcpy (completion
, match
+ (word
- orig_text
));
5268 /* Return some of ORIG_TEXT plus sym_name. */
5269 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5270 strncpy (completion
, word
, orig_text
- word
);
5271 completion
[orig_text
- word
] = '\0';
5272 strcat (completion
, match
);
5275 VEC_safe_push (char_ptr
, *sv
, completion
);
5278 /* Return a list of possible symbol names completing TEXT0. The list
5279 is NULL terminated. WORD is the entire command on which completion
5283 ada_make_symbol_completion_list (char *text0
, char *word
)
5289 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5292 struct partial_symtab
*ps
;
5293 struct minimal_symbol
*msymbol
;
5294 struct objfile
*objfile
;
5295 struct block
*b
, *surrounding_static_block
= 0;
5297 struct dict_iterator iter
;
5299 if (text0
[0] == '<')
5301 text
= xstrdup (text0
);
5302 make_cleanup (xfree
, text
);
5303 text_len
= strlen (text
);
5309 text
= xstrdup (ada_encode (text0
));
5310 make_cleanup (xfree
, text
);
5311 text_len
= strlen (text
);
5312 for (i
= 0; i
< text_len
; i
++)
5313 text
[i
] = tolower (text
[i
]);
5315 encoded
= (strstr (text0
, "__") != NULL
);
5316 /* If the name contains a ".", then the user is entering a fully
5317 qualified entity name, and the match must not be done in wild
5318 mode. Similarly, if the user wants to complete what looks like
5319 an encoded name, the match must not be done in wild mode. */
5320 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5323 /* First, look at the partial symtab symbols. */
5324 ALL_PSYMTABS (objfile
, ps
)
5326 struct partial_symbol
**psym
;
5328 /* If the psymtab's been read in we'll get it when we search
5329 through the blockvector. */
5333 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5334 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5335 + ps
->n_global_syms
); psym
++)
5338 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5339 text
, text_len
, text0
, word
,
5340 wild_match
, encoded
);
5343 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5344 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5345 + ps
->n_static_syms
); psym
++)
5348 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5349 text
, text_len
, text0
, word
,
5350 wild_match
, encoded
);
5354 /* At this point scan through the misc symbol vectors and add each
5355 symbol you find to the list. Eventually we want to ignore
5356 anything that isn't a text symbol (everything else will be
5357 handled by the psymtab code above). */
5359 ALL_MSYMBOLS (objfile
, msymbol
)
5362 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5363 text
, text_len
, text0
, word
, wild_match
, encoded
);
5366 /* Search upwards from currently selected frame (so that we can
5367 complete on local vars. */
5369 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5371 if (!BLOCK_SUPERBLOCK (b
))
5372 surrounding_static_block
= b
; /* For elmin of dups */
5374 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5376 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5377 text
, text_len
, text0
, word
,
5378 wild_match
, encoded
);
5382 /* Go through the symtabs and check the externs and statics for
5383 symbols which match. */
5385 ALL_SYMTABS (objfile
, s
)
5388 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5389 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5391 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5392 text
, text_len
, text0
, word
,
5393 wild_match
, encoded
);
5397 ALL_SYMTABS (objfile
, s
)
5400 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5401 /* Don't do this block twice. */
5402 if (b
== surrounding_static_block
)
5404 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5406 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5407 text
, text_len
, text0
, word
,
5408 wild_match
, encoded
);
5412 /* Append the closing NULL entry. */
5413 VEC_safe_push (char_ptr
, completions
, NULL
);
5415 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5416 return the copy. It's unfortunate that we have to make a copy
5417 of an array that we're about to destroy, but there is nothing much
5418 we can do about it. Fortunately, it's typically not a very large
5421 const size_t completions_size
=
5422 VEC_length (char_ptr
, completions
) * sizeof (char *);
5423 char **result
= malloc (completions_size
);
5425 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5427 VEC_free (char_ptr
, completions
);
5434 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5435 for tagged types. */
5438 ada_is_dispatch_table_ptr_type (struct type
*type
)
5442 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5445 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5449 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5452 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5453 to be invisible to users. */
5456 ada_is_ignored_field (struct type
*type
, int field_num
)
5458 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5461 /* Check the name of that field. */
5463 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5465 /* Anonymous field names should not be printed.
5466 brobecker/2007-02-20: I don't think this can actually happen
5467 but we don't want to print the value of annonymous fields anyway. */
5471 /* A field named "_parent" is internally generated by GNAT for
5472 tagged types, and should not be printed either. */
5473 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5477 /* If this is the dispatch table of a tagged type, then ignore. */
5478 if (ada_is_tagged_type (type
, 1)
5479 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5482 /* Not a special field, so it should not be ignored. */
5486 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5487 pointer or reference type whose ultimate target has a tag field. */
5490 ada_is_tagged_type (struct type
*type
, int refok
)
5492 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5495 /* True iff TYPE represents the type of X'Tag */
5498 ada_is_tag_type (struct type
*type
)
5500 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5504 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5505 return (name
!= NULL
5506 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5510 /* The type of the tag on VAL. */
5513 ada_tag_type (struct value
*val
)
5515 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5518 /* The value of the tag on VAL. */
5521 ada_value_tag (struct value
*val
)
5523 return ada_value_struct_elt (val
, "_tag", 0);
5526 /* The value of the tag on the object of type TYPE whose contents are
5527 saved at VALADDR, if it is non-null, or is at memory address
5530 static struct value
*
5531 value_tag_from_contents_and_address (struct type
*type
,
5532 const gdb_byte
*valaddr
,
5535 int tag_byte_offset
, dummy1
, dummy2
;
5536 struct type
*tag_type
;
5537 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5540 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5542 : valaddr
+ tag_byte_offset
);
5543 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5545 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5550 static struct type
*
5551 type_from_tag (struct value
*tag
)
5553 const char *type_name
= ada_tag_name (tag
);
5554 if (type_name
!= NULL
)
5555 return ada_find_any_type (ada_encode (type_name
));
5566 static int ada_tag_name_1 (void *);
5567 static int ada_tag_name_2 (struct tag_args
*);
5569 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5570 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5571 The value stored in ARGS->name is valid until the next call to
5575 ada_tag_name_1 (void *args0
)
5577 struct tag_args
*args
= (struct tag_args
*) args0
;
5578 static char name
[1024];
5582 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5584 return ada_tag_name_2 (args
);
5585 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5588 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5589 for (p
= name
; *p
!= '\0'; p
+= 1)
5596 /* Utility function for ada_tag_name_1 that tries the second
5597 representation for the dispatch table (in which there is no
5598 explicit 'tsd' field in the referent of the tag pointer, and instead
5599 the tsd pointer is stored just before the dispatch table. */
5602 ada_tag_name_2 (struct tag_args
*args
)
5604 struct type
*info_type
;
5605 static char name
[1024];
5607 struct value
*val
, *valp
;
5610 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5611 if (info_type
== NULL
)
5613 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5614 valp
= value_cast (info_type
, args
->tag
);
5617 val
= value_ind (value_ptradd (valp
, -1));
5620 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5623 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5624 for (p
= name
; *p
!= '\0'; p
+= 1)
5631 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5635 ada_tag_name (struct value
*tag
)
5637 struct tag_args args
;
5638 if (!ada_is_tag_type (value_type (tag
)))
5642 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5646 /* The parent type of TYPE, or NULL if none. */
5649 ada_parent_type (struct type
*type
)
5653 type
= ada_check_typedef (type
);
5655 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5658 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5659 if (ada_is_parent_field (type
, i
))
5661 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5663 /* If the _parent field is a pointer, then dereference it. */
5664 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5665 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5666 /* If there is a parallel XVS type, get the actual base type. */
5667 parent_type
= ada_get_base_type (parent_type
);
5669 return ada_check_typedef (parent_type
);
5675 /* True iff field number FIELD_NUM of structure type TYPE contains the
5676 parent-type (inherited) fields of a derived type. Assumes TYPE is
5677 a structure type with at least FIELD_NUM+1 fields. */
5680 ada_is_parent_field (struct type
*type
, int field_num
)
5682 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5683 return (name
!= NULL
5684 && (strncmp (name
, "PARENT", 6) == 0
5685 || strncmp (name
, "_parent", 7) == 0));
5688 /* True iff field number FIELD_NUM of structure type TYPE is a
5689 transparent wrapper field (which should be silently traversed when doing
5690 field selection and flattened when printing). Assumes TYPE is a
5691 structure type with at least FIELD_NUM+1 fields. Such fields are always
5695 ada_is_wrapper_field (struct type
*type
, int field_num
)
5697 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5698 return (name
!= NULL
5699 && (strncmp (name
, "PARENT", 6) == 0
5700 || strcmp (name
, "REP") == 0
5701 || strncmp (name
, "_parent", 7) == 0
5702 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5705 /* True iff field number FIELD_NUM of structure or union type TYPE
5706 is a variant wrapper. Assumes TYPE is a structure type with at least
5707 FIELD_NUM+1 fields. */
5710 ada_is_variant_part (struct type
*type
, int field_num
)
5712 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5713 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5714 || (is_dynamic_field (type
, field_num
)
5715 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5716 == TYPE_CODE_UNION
)));
5719 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5720 whose discriminants are contained in the record type OUTER_TYPE,
5721 returns the type of the controlling discriminant for the variant.
5722 May return NULL if the type could not be found. */
5725 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5727 char *name
= ada_variant_discrim_name (var_type
);
5728 return ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5731 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5732 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5733 represents a 'when others' clause; otherwise 0. */
5736 ada_is_others_clause (struct type
*type
, int field_num
)
5738 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5739 return (name
!= NULL
&& name
[0] == 'O');
5742 /* Assuming that TYPE0 is the type of the variant part of a record,
5743 returns the name of the discriminant controlling the variant.
5744 The value is valid until the next call to ada_variant_discrim_name. */
5747 ada_variant_discrim_name (struct type
*type0
)
5749 static char *result
= NULL
;
5750 static size_t result_len
= 0;
5753 const char *discrim_end
;
5754 const char *discrim_start
;
5756 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5757 type
= TYPE_TARGET_TYPE (type0
);
5761 name
= ada_type_name (type
);
5763 if (name
== NULL
|| name
[0] == '\000')
5766 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5769 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5772 if (discrim_end
== name
)
5775 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5778 if (discrim_start
== name
+ 1)
5780 if ((discrim_start
> name
+ 3
5781 && strncmp (discrim_start
- 3, "___", 3) == 0)
5782 || discrim_start
[-1] == '.')
5786 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5787 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5788 result
[discrim_end
- discrim_start
] = '\0';
5792 /* Scan STR for a subtype-encoded number, beginning at position K.
5793 Put the position of the character just past the number scanned in
5794 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5795 Return 1 if there was a valid number at the given position, and 0
5796 otherwise. A "subtype-encoded" number consists of the absolute value
5797 in decimal, followed by the letter 'm' to indicate a negative number.
5798 Assumes 0m does not occur. */
5801 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5805 if (!isdigit (str
[k
]))
5808 /* Do it the hard way so as not to make any assumption about
5809 the relationship of unsigned long (%lu scan format code) and
5812 while (isdigit (str
[k
]))
5814 RU
= RU
* 10 + (str
[k
] - '0');
5821 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5827 /* NOTE on the above: Technically, C does not say what the results of
5828 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5829 number representable as a LONGEST (although either would probably work
5830 in most implementations). When RU>0, the locution in the then branch
5831 above is always equivalent to the negative of RU. */
5838 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5839 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5840 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5843 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5845 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5858 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5867 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5868 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5870 if (val
>= L
&& val
<= U
)
5882 /* FIXME: Lots of redundancy below. Try to consolidate. */
5884 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5885 ARG_TYPE, extract and return the value of one of its (non-static)
5886 fields. FIELDNO says which field. Differs from value_primitive_field
5887 only in that it can handle packed values of arbitrary type. */
5889 static struct value
*
5890 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5891 struct type
*arg_type
)
5895 arg_type
= ada_check_typedef (arg_type
);
5896 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5898 /* Handle packed fields. */
5900 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5902 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5903 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5905 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5906 offset
+ bit_pos
/ 8,
5907 bit_pos
% 8, bit_size
, type
);
5910 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5913 /* Find field with name NAME in object of type TYPE. If found,
5914 set the following for each argument that is non-null:
5915 - *FIELD_TYPE_P to the field's type;
5916 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5917 an object of that type;
5918 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5919 - *BIT_SIZE_P to its size in bits if the field is packed, and
5921 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5922 fields up to but not including the desired field, or by the total
5923 number of fields if not found. A NULL value of NAME never
5924 matches; the function just counts visible fields in this case.
5926 Returns 1 if found, 0 otherwise. */
5929 find_struct_field (char *name
, struct type
*type
, int offset
,
5930 struct type
**field_type_p
,
5931 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5936 type
= ada_check_typedef (type
);
5938 if (field_type_p
!= NULL
)
5939 *field_type_p
= NULL
;
5940 if (byte_offset_p
!= NULL
)
5942 if (bit_offset_p
!= NULL
)
5944 if (bit_size_p
!= NULL
)
5947 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5949 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5950 int fld_offset
= offset
+ bit_pos
/ 8;
5951 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5953 if (t_field_name
== NULL
)
5956 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5958 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5959 if (field_type_p
!= NULL
)
5960 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5961 if (byte_offset_p
!= NULL
)
5962 *byte_offset_p
= fld_offset
;
5963 if (bit_offset_p
!= NULL
)
5964 *bit_offset_p
= bit_pos
% 8;
5965 if (bit_size_p
!= NULL
)
5966 *bit_size_p
= bit_size
;
5969 else if (ada_is_wrapper_field (type
, i
))
5971 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5972 field_type_p
, byte_offset_p
, bit_offset_p
,
5973 bit_size_p
, index_p
))
5976 else if (ada_is_variant_part (type
, i
))
5978 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5981 struct type
*field_type
5982 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5984 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5986 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5988 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5989 field_type_p
, byte_offset_p
,
5990 bit_offset_p
, bit_size_p
, index_p
))
5994 else if (index_p
!= NULL
)
6000 /* Number of user-visible fields in record type TYPE. */
6003 num_visible_fields (struct type
*type
)
6007 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6011 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6012 and search in it assuming it has (class) type TYPE.
6013 If found, return value, else return NULL.
6015 Searches recursively through wrapper fields (e.g., '_parent'). */
6017 static struct value
*
6018 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6022 type
= ada_check_typedef (type
);
6024 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6026 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6028 if (t_field_name
== NULL
)
6031 else if (field_name_match (t_field_name
, name
))
6032 return ada_value_primitive_field (arg
, offset
, i
, type
);
6034 else if (ada_is_wrapper_field (type
, i
))
6036 struct value
*v
= /* Do not let indent join lines here. */
6037 ada_search_struct_field (name
, arg
,
6038 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6039 TYPE_FIELD_TYPE (type
, i
));
6044 else if (ada_is_variant_part (type
, i
))
6046 /* PNH: Do we ever get here? See find_struct_field. */
6048 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6049 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6051 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6053 struct value
*v
= ada_search_struct_field
/* Force line break. */
6055 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6056 TYPE_FIELD_TYPE (field_type
, j
));
6065 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6066 int, struct type
*);
6069 /* Return field #INDEX in ARG, where the index is that returned by
6070 * find_struct_field through its INDEX_P argument. Adjust the address
6071 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6072 * If found, return value, else return NULL. */
6074 static struct value
*
6075 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6078 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6082 /* Auxiliary function for ada_index_struct_field. Like
6083 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6086 static struct value
*
6087 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6091 type
= ada_check_typedef (type
);
6093 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6095 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6097 else if (ada_is_wrapper_field (type
, i
))
6099 struct value
*v
= /* Do not let indent join lines here. */
6100 ada_index_struct_field_1 (index_p
, arg
,
6101 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6102 TYPE_FIELD_TYPE (type
, i
));
6107 else if (ada_is_variant_part (type
, i
))
6109 /* PNH: Do we ever get here? See ada_search_struct_field,
6110 find_struct_field. */
6111 error (_("Cannot assign this kind of variant record"));
6113 else if (*index_p
== 0)
6114 return ada_value_primitive_field (arg
, offset
, i
, type
);
6121 /* Given ARG, a value of type (pointer or reference to a)*
6122 structure/union, extract the component named NAME from the ultimate
6123 target structure/union and return it as a value with its
6126 The routine searches for NAME among all members of the structure itself
6127 and (recursively) among all members of any wrapper members
6130 If NO_ERR, then simply return NULL in case of error, rather than
6134 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6136 struct type
*t
, *t1
;
6140 t1
= t
= ada_check_typedef (value_type (arg
));
6141 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6143 t1
= TYPE_TARGET_TYPE (t
);
6146 t1
= ada_check_typedef (t1
);
6147 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6149 arg
= coerce_ref (arg
);
6154 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6156 t1
= TYPE_TARGET_TYPE (t
);
6159 t1
= ada_check_typedef (t1
);
6160 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6162 arg
= value_ind (arg
);
6169 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6173 v
= ada_search_struct_field (name
, arg
, 0, t
);
6176 int bit_offset
, bit_size
, byte_offset
;
6177 struct type
*field_type
;
6180 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6181 address
= value_as_address (arg
);
6183 address
= unpack_pointer (t
, value_contents (arg
));
6185 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6186 if (find_struct_field (name
, t1
, 0,
6187 &field_type
, &byte_offset
, &bit_offset
,
6192 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6193 arg
= ada_coerce_ref (arg
);
6195 arg
= ada_value_ind (arg
);
6196 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6197 bit_offset
, bit_size
,
6201 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6205 if (v
!= NULL
|| no_err
)
6208 error (_("There is no member named %s."), name
);
6214 error (_("Attempt to extract a component of a value that is not a record."));
6217 /* Given a type TYPE, look up the type of the component of type named NAME.
6218 If DISPP is non-null, add its byte displacement from the beginning of a
6219 structure (pointed to by a value) of type TYPE to *DISPP (does not
6220 work for packed fields).
6222 Matches any field whose name has NAME as a prefix, possibly
6225 TYPE can be either a struct or union. If REFOK, TYPE may also
6226 be a (pointer or reference)+ to a struct or union, and the
6227 ultimate target type will be searched.
6229 Looks recursively into variant clauses and parent types.
6231 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6232 TYPE is not a type of the right kind. */
6234 static struct type
*
6235 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6236 int noerr
, int *dispp
)
6243 if (refok
&& type
!= NULL
)
6246 type
= ada_check_typedef (type
);
6247 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6248 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6250 type
= TYPE_TARGET_TYPE (type
);
6254 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6255 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6261 target_terminal_ours ();
6262 gdb_flush (gdb_stdout
);
6264 error (_("Type (null) is not a structure or union type"));
6267 /* XXX: type_sprint */
6268 fprintf_unfiltered (gdb_stderr
, _("Type "));
6269 type_print (type
, "", gdb_stderr
, -1);
6270 error (_(" is not a structure or union type"));
6275 type
= to_static_fixed_type (type
);
6277 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6279 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6283 if (t_field_name
== NULL
)
6286 else if (field_name_match (t_field_name
, name
))
6289 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6290 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6293 else if (ada_is_wrapper_field (type
, i
))
6296 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6301 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6306 else if (ada_is_variant_part (type
, i
))
6309 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6311 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6313 /* FIXME pnh 2008/01/26: We check for a field that is
6314 NOT wrapped in a struct, since the compiler sometimes
6315 generates these for unchecked variant types. Revisit
6316 if the compiler changes this practice. */
6317 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6319 if (v_field_name
!= NULL
6320 && field_name_match (v_field_name
, name
))
6321 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6323 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6329 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6340 target_terminal_ours ();
6341 gdb_flush (gdb_stdout
);
6344 /* XXX: type_sprint */
6345 fprintf_unfiltered (gdb_stderr
, _("Type "));
6346 type_print (type
, "", gdb_stderr
, -1);
6347 error (_(" has no component named <null>"));
6351 /* XXX: type_sprint */
6352 fprintf_unfiltered (gdb_stderr
, _("Type "));
6353 type_print (type
, "", gdb_stderr
, -1);
6354 error (_(" has no component named %s"), name
);
6361 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6362 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6363 represents an unchecked union (that is, the variant part of a
6364 record that is named in an Unchecked_Union pragma). */
6367 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6369 char *discrim_name
= ada_variant_discrim_name (var_type
);
6370 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
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 that is stored in GDB at
6377 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6378 numbering from 0) is applicable. Returns -1 if none are. */
6381 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6382 const gdb_byte
*outer_valaddr
)
6386 char *discrim_name
= ada_variant_discrim_name (var_type
);
6387 struct value
*outer
;
6388 struct value
*discrim
;
6389 LONGEST discrim_val
;
6391 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6392 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6393 if (discrim
== NULL
)
6395 discrim_val
= value_as_long (discrim
);
6398 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6400 if (ada_is_others_clause (var_type
, i
))
6402 else if (ada_in_variant (discrim_val
, var_type
, i
))
6406 return others_clause
;
6411 /* Dynamic-Sized Records */
6413 /* Strategy: The type ostensibly attached to a value with dynamic size
6414 (i.e., a size that is not statically recorded in the debugging
6415 data) does not accurately reflect the size or layout of the value.
6416 Our strategy is to convert these values to values with accurate,
6417 conventional types that are constructed on the fly. */
6419 /* There is a subtle and tricky problem here. In general, we cannot
6420 determine the size of dynamic records without its data. However,
6421 the 'struct value' data structure, which GDB uses to represent
6422 quantities in the inferior process (the target), requires the size
6423 of the type at the time of its allocation in order to reserve space
6424 for GDB's internal copy of the data. That's why the
6425 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6426 rather than struct value*s.
6428 However, GDB's internal history variables ($1, $2, etc.) are
6429 struct value*s containing internal copies of the data that are not, in
6430 general, the same as the data at their corresponding addresses in
6431 the target. Fortunately, the types we give to these values are all
6432 conventional, fixed-size types (as per the strategy described
6433 above), so that we don't usually have to perform the
6434 'to_fixed_xxx_type' conversions to look at their values.
6435 Unfortunately, there is one exception: if one of the internal
6436 history variables is an array whose elements are unconstrained
6437 records, then we will need to create distinct fixed types for each
6438 element selected. */
6440 /* The upshot of all of this is that many routines take a (type, host
6441 address, target address) triple as arguments to represent a value.
6442 The host address, if non-null, is supposed to contain an internal
6443 copy of the relevant data; otherwise, the program is to consult the
6444 target at the target address. */
6446 /* Assuming that VAL0 represents a pointer value, the result of
6447 dereferencing it. Differs from value_ind in its treatment of
6448 dynamic-sized types. */
6451 ada_value_ind (struct value
*val0
)
6453 struct value
*val
= unwrap_value (value_ind (val0
));
6454 return ada_to_fixed_value (val
);
6457 /* The value resulting from dereferencing any "reference to"
6458 qualifiers on VAL0. */
6460 static struct value
*
6461 ada_coerce_ref (struct value
*val0
)
6463 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6465 struct value
*val
= val0
;
6466 val
= coerce_ref (val
);
6467 val
= unwrap_value (val
);
6468 return ada_to_fixed_value (val
);
6474 /* Return OFF rounded upward if necessary to a multiple of
6475 ALIGNMENT (a power of 2). */
6478 align_value (unsigned int off
, unsigned int alignment
)
6480 return (off
+ alignment
- 1) & ~(alignment
- 1);
6483 /* Return the bit alignment required for field #F of template type TYPE. */
6486 field_alignment (struct type
*type
, int f
)
6488 const char *name
= TYPE_FIELD_NAME (type
, f
);
6492 /* The field name should never be null, unless the debugging information
6493 is somehow malformed. In this case, we assume the field does not
6494 require any alignment. */
6498 len
= strlen (name
);
6500 if (!isdigit (name
[len
- 1]))
6503 if (isdigit (name
[len
- 2]))
6504 align_offset
= len
- 2;
6506 align_offset
= len
- 1;
6508 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6509 return TARGET_CHAR_BIT
;
6511 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6514 /* Find a symbol named NAME. Ignores ambiguity. */
6517 ada_find_any_symbol (const char *name
)
6521 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6522 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6525 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6529 /* Find a type named NAME. Ignores ambiguity. This routine will look
6530 solely for types defined by debug info, it will not search the GDB
6534 ada_find_any_type (const char *name
)
6536 struct symbol
*sym
= ada_find_any_symbol (name
);
6539 return SYMBOL_TYPE (sym
);
6544 /* Given NAME and an associated BLOCK, search all symbols for
6545 NAME suffixed with "___XR", which is the ``renaming'' symbol
6546 associated to NAME. Return this symbol if found, return
6550 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6554 sym
= find_old_style_renaming_symbol (name
, block
);
6559 /* Not right yet. FIXME pnh 7/20/2007. */
6560 sym
= ada_find_any_symbol (name
);
6561 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6567 static struct symbol
*
6568 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6570 const struct symbol
*function_sym
= block_linkage_function (block
);
6573 if (function_sym
!= NULL
)
6575 /* If the symbol is defined inside a function, NAME is not fully
6576 qualified. This means we need to prepend the function name
6577 as well as adding the ``___XR'' suffix to build the name of
6578 the associated renaming symbol. */
6579 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6580 /* Function names sometimes contain suffixes used
6581 for instance to qualify nested subprograms. When building
6582 the XR type name, we need to make sure that this suffix is
6583 not included. So do not include any suffix in the function
6584 name length below. */
6585 int function_name_len
= ada_name_prefix_len (function_name
);
6586 const int rename_len
= function_name_len
+ 2 /* "__" */
6587 + strlen (name
) + 6 /* "___XR\0" */ ;
6589 /* Strip the suffix if necessary. */
6590 ada_remove_trailing_digits (function_name
, &function_name_len
);
6591 ada_remove_po_subprogram_suffix (function_name
, &function_name_len
);
6592 ada_remove_Xbn_suffix (function_name
, &function_name_len
);
6594 /* Library-level functions are a special case, as GNAT adds
6595 a ``_ada_'' prefix to the function name to avoid namespace
6596 pollution. However, the renaming symbols themselves do not
6597 have this prefix, so we need to skip this prefix if present. */
6598 if (function_name_len
> 5 /* "_ada_" */
6599 && strstr (function_name
, "_ada_") == function_name
)
6602 function_name_len
-= 5;
6605 rename
= (char *) alloca (rename_len
* sizeof (char));
6606 strncpy (rename
, function_name
, function_name_len
);
6607 xsnprintf (rename
+ function_name_len
, rename_len
- function_name_len
,
6612 const int rename_len
= strlen (name
) + 6;
6613 rename
= (char *) alloca (rename_len
* sizeof (char));
6614 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6617 return ada_find_any_symbol (rename
);
6620 /* Because of GNAT encoding conventions, several GDB symbols may match a
6621 given type name. If the type denoted by TYPE0 is to be preferred to
6622 that of TYPE1 for purposes of type printing, return non-zero;
6623 otherwise return 0. */
6626 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6630 else if (type0
== NULL
)
6632 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6634 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6636 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6638 else if (ada_is_constrained_packed_array_type (type0
))
6640 else if (ada_is_array_descriptor_type (type0
)
6641 && !ada_is_array_descriptor_type (type1
))
6645 const char *type0_name
= type_name_no_tag (type0
);
6646 const char *type1_name
= type_name_no_tag (type1
);
6648 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6649 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6655 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6656 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6659 ada_type_name (struct type
*type
)
6663 else if (TYPE_NAME (type
) != NULL
)
6664 return TYPE_NAME (type
);
6666 return TYPE_TAG_NAME (type
);
6669 /* Find a parallel type to TYPE whose name is formed by appending
6670 SUFFIX to the name of TYPE. */
6673 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6676 static size_t name_len
= 0;
6678 char *typename
= ada_type_name (type
);
6680 if (typename
== NULL
)
6683 len
= strlen (typename
);
6685 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6687 strcpy (name
, typename
);
6688 strcpy (name
+ len
, suffix
);
6690 return ada_find_any_type (name
);
6694 /* If TYPE is a variable-size record type, return the corresponding template
6695 type describing its fields. Otherwise, return NULL. */
6697 static struct type
*
6698 dynamic_template_type (struct type
*type
)
6700 type
= ada_check_typedef (type
);
6702 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6703 || ada_type_name (type
) == NULL
)
6707 int len
= strlen (ada_type_name (type
));
6708 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6711 return ada_find_parallel_type (type
, "___XVE");
6715 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6716 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6719 is_dynamic_field (struct type
*templ_type
, int field_num
)
6721 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6723 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6724 && strstr (name
, "___XVL") != NULL
;
6727 /* The index of the variant field of TYPE, or -1 if TYPE does not
6728 represent a variant record type. */
6731 variant_field_index (struct type
*type
)
6735 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6738 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6740 if (ada_is_variant_part (type
, f
))
6746 /* A record type with no fields. */
6748 static struct type
*
6749 empty_record (struct type
*template)
6751 struct type
*type
= alloc_type_copy (template);
6752 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6753 TYPE_NFIELDS (type
) = 0;
6754 TYPE_FIELDS (type
) = NULL
;
6755 INIT_CPLUS_SPECIFIC (type
);
6756 TYPE_NAME (type
) = "<empty>";
6757 TYPE_TAG_NAME (type
) = NULL
;
6758 TYPE_LENGTH (type
) = 0;
6762 /* An ordinary record type (with fixed-length fields) that describes
6763 the value of type TYPE at VALADDR or ADDRESS (see comments at
6764 the beginning of this section) VAL according to GNAT conventions.
6765 DVAL0 should describe the (portion of a) record that contains any
6766 necessary discriminants. It should be NULL if value_type (VAL) is
6767 an outer-level type (i.e., as opposed to a branch of a variant.) A
6768 variant field (unless unchecked) is replaced by a particular branch
6771 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6772 length are not statically known are discarded. As a consequence,
6773 VALADDR, ADDRESS and DVAL0 are ignored.
6775 NOTE: Limitations: For now, we assume that dynamic fields and
6776 variants occupy whole numbers of bytes. However, they need not be
6780 ada_template_to_fixed_record_type_1 (struct type
*type
,
6781 const gdb_byte
*valaddr
,
6782 CORE_ADDR address
, struct value
*dval0
,
6783 int keep_dynamic_fields
)
6785 struct value
*mark
= value_mark ();
6788 int nfields
, bit_len
;
6791 int fld_bit_len
, bit_incr
;
6794 /* Compute the number of fields in this record type that are going
6795 to be processed: unless keep_dynamic_fields, this includes only
6796 fields whose position and length are static will be processed. */
6797 if (keep_dynamic_fields
)
6798 nfields
= TYPE_NFIELDS (type
);
6802 while (nfields
< TYPE_NFIELDS (type
)
6803 && !ada_is_variant_part (type
, nfields
)
6804 && !is_dynamic_field (type
, nfields
))
6808 rtype
= alloc_type_copy (type
);
6809 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6810 INIT_CPLUS_SPECIFIC (rtype
);
6811 TYPE_NFIELDS (rtype
) = nfields
;
6812 TYPE_FIELDS (rtype
) = (struct field
*)
6813 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6814 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6815 TYPE_NAME (rtype
) = ada_type_name (type
);
6816 TYPE_TAG_NAME (rtype
) = NULL
;
6817 TYPE_FIXED_INSTANCE (rtype
) = 1;
6823 for (f
= 0; f
< nfields
; f
+= 1)
6825 off
= align_value (off
, field_alignment (type
, f
))
6826 + TYPE_FIELD_BITPOS (type
, f
);
6827 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6828 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6830 if (ada_is_variant_part (type
, f
))
6833 fld_bit_len
= bit_incr
= 0;
6835 else if (is_dynamic_field (type
, f
))
6837 const gdb_byte
*field_valaddr
= valaddr
;
6838 CORE_ADDR field_address
= address
;
6839 struct type
*field_type
=
6840 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
6844 /* rtype's length is computed based on the run-time
6845 value of discriminants. If the discriminants are not
6846 initialized, the type size may be completely bogus and
6847 GDB may fail to allocate a value for it. So check the
6848 size first before creating the value. */
6850 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6855 /* If the type referenced by this field is an aligner type, we need
6856 to unwrap that aligner type, because its size might not be set.
6857 Keeping the aligner type would cause us to compute the wrong
6858 size for this field, impacting the offset of the all the fields
6859 that follow this one. */
6860 if (ada_is_aligner_type (field_type
))
6862 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
6864 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
6865 field_address
= cond_offset_target (field_address
, field_offset
);
6866 field_type
= ada_aligned_type (field_type
);
6869 field_valaddr
= cond_offset_host (field_valaddr
,
6870 off
/ TARGET_CHAR_BIT
);
6871 field_address
= cond_offset_target (field_address
,
6872 off
/ TARGET_CHAR_BIT
);
6874 /* Get the fixed type of the field. Note that, in this case,
6875 we do not want to get the real type out of the tag: if
6876 the current field is the parent part of a tagged record,
6877 we will get the tag of the object. Clearly wrong: the real
6878 type of the parent is not the real type of the child. We
6879 would end up in an infinite loop. */
6880 field_type
= ada_get_base_type (field_type
);
6881 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
6882 field_address
, dval
, 0);
6884 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
6885 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6886 bit_incr
= fld_bit_len
=
6887 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6891 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6892 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6893 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6894 bit_incr
= fld_bit_len
=
6895 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6897 bit_incr
= fld_bit_len
=
6898 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6900 if (off
+ fld_bit_len
> bit_len
)
6901 bit_len
= off
+ fld_bit_len
;
6903 TYPE_LENGTH (rtype
) =
6904 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6907 /* We handle the variant part, if any, at the end because of certain
6908 odd cases in which it is re-ordered so as NOT to be the last field of
6909 the record. This can happen in the presence of representation
6911 if (variant_field
>= 0)
6913 struct type
*branch_type
;
6915 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6918 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6923 to_fixed_variant_branch_type
6924 (TYPE_FIELD_TYPE (type
, variant_field
),
6925 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6926 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6927 if (branch_type
== NULL
)
6929 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6930 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6931 TYPE_NFIELDS (rtype
) -= 1;
6935 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6936 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6938 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6940 if (off
+ fld_bit_len
> bit_len
)
6941 bit_len
= off
+ fld_bit_len
;
6942 TYPE_LENGTH (rtype
) =
6943 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6947 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6948 should contain the alignment of that record, which should be a strictly
6949 positive value. If null or negative, then something is wrong, most
6950 probably in the debug info. In that case, we don't round up the size
6951 of the resulting type. If this record is not part of another structure,
6952 the current RTYPE length might be good enough for our purposes. */
6953 if (TYPE_LENGTH (type
) <= 0)
6955 if (TYPE_NAME (rtype
))
6956 warning (_("Invalid type size for `%s' detected: %d."),
6957 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6959 warning (_("Invalid type size for <unnamed> detected: %d."),
6960 TYPE_LENGTH (type
));
6964 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6965 TYPE_LENGTH (type
));
6968 value_free_to_mark (mark
);
6969 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6970 error (_("record type with dynamic size is larger than varsize-limit"));
6974 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6977 static struct type
*
6978 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6979 CORE_ADDR address
, struct value
*dval0
)
6981 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6985 /* An ordinary record type in which ___XVL-convention fields and
6986 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6987 static approximations, containing all possible fields. Uses
6988 no runtime values. Useless for use in values, but that's OK,
6989 since the results are used only for type determinations. Works on both
6990 structs and unions. Representation note: to save space, we memorize
6991 the result of this function in the TYPE_TARGET_TYPE of the
6994 static struct type
*
6995 template_to_static_fixed_type (struct type
*type0
)
7001 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7002 return TYPE_TARGET_TYPE (type0
);
7004 nfields
= TYPE_NFIELDS (type0
);
7007 for (f
= 0; f
< nfields
; f
+= 1)
7009 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7010 struct type
*new_type
;
7012 if (is_dynamic_field (type0
, f
))
7013 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7015 new_type
= static_unwrap_type (field_type
);
7016 if (type
== type0
&& new_type
!= field_type
)
7018 TYPE_TARGET_TYPE (type0
) = type
= alloc_type_copy (type0
);
7019 TYPE_CODE (type
) = TYPE_CODE (type0
);
7020 INIT_CPLUS_SPECIFIC (type
);
7021 TYPE_NFIELDS (type
) = nfields
;
7022 TYPE_FIELDS (type
) = (struct field
*)
7023 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7024 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7025 sizeof (struct field
) * nfields
);
7026 TYPE_NAME (type
) = ada_type_name (type0
);
7027 TYPE_TAG_NAME (type
) = NULL
;
7028 TYPE_FIXED_INSTANCE (type
) = 1;
7029 TYPE_LENGTH (type
) = 0;
7031 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7032 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7037 /* Given an object of type TYPE whose contents are at VALADDR and
7038 whose address in memory is ADDRESS, returns a revision of TYPE,
7039 which should be a non-dynamic-sized record, in which the variant
7040 part, if any, is replaced with the appropriate branch. Looks
7041 for discriminant values in DVAL0, which can be NULL if the record
7042 contains the necessary discriminant values. */
7044 static struct type
*
7045 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7046 CORE_ADDR address
, struct value
*dval0
)
7048 struct value
*mark
= value_mark ();
7051 struct type
*branch_type
;
7052 int nfields
= TYPE_NFIELDS (type
);
7053 int variant_field
= variant_field_index (type
);
7055 if (variant_field
== -1)
7059 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7063 rtype
= alloc_type_copy (type
);
7064 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7065 INIT_CPLUS_SPECIFIC (rtype
);
7066 TYPE_NFIELDS (rtype
) = nfields
;
7067 TYPE_FIELDS (rtype
) =
7068 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7069 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7070 sizeof (struct field
) * nfields
);
7071 TYPE_NAME (rtype
) = ada_type_name (type
);
7072 TYPE_TAG_NAME (rtype
) = NULL
;
7073 TYPE_FIXED_INSTANCE (rtype
) = 1;
7074 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7076 branch_type
= to_fixed_variant_branch_type
7077 (TYPE_FIELD_TYPE (type
, variant_field
),
7078 cond_offset_host (valaddr
,
7079 TYPE_FIELD_BITPOS (type
, variant_field
)
7081 cond_offset_target (address
,
7082 TYPE_FIELD_BITPOS (type
, variant_field
)
7083 / TARGET_CHAR_BIT
), dval
);
7084 if (branch_type
== NULL
)
7087 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7088 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7089 TYPE_NFIELDS (rtype
) -= 1;
7093 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7094 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7095 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7096 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7098 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7100 value_free_to_mark (mark
);
7104 /* An ordinary record type (with fixed-length fields) that describes
7105 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7106 beginning of this section]. Any necessary discriminants' values
7107 should be in DVAL, a record value; it may be NULL if the object
7108 at ADDR itself contains any necessary discriminant values.
7109 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7110 values from the record are needed. Except in the case that DVAL,
7111 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7112 unchecked) is replaced by a particular branch of the variant.
7114 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7115 is questionable and may be removed. It can arise during the
7116 processing of an unconstrained-array-of-record type where all the
7117 variant branches have exactly the same size. This is because in
7118 such cases, the compiler does not bother to use the XVS convention
7119 when encoding the record. I am currently dubious of this
7120 shortcut and suspect the compiler should be altered. FIXME. */
7122 static struct type
*
7123 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7124 CORE_ADDR address
, struct value
*dval
)
7126 struct type
*templ_type
;
7128 if (TYPE_FIXED_INSTANCE (type0
))
7131 templ_type
= dynamic_template_type (type0
);
7133 if (templ_type
!= NULL
)
7134 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7135 else if (variant_field_index (type0
) >= 0)
7137 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7139 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7144 TYPE_FIXED_INSTANCE (type0
) = 1;
7150 /* An ordinary record type (with fixed-length fields) that describes
7151 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7152 union type. Any necessary discriminants' values should be in DVAL,
7153 a record value. That is, this routine selects the appropriate
7154 branch of the union at ADDR according to the discriminant value
7155 indicated in the union's type name. Returns VAR_TYPE0 itself if
7156 it represents a variant subject to a pragma Unchecked_Union. */
7158 static struct type
*
7159 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7160 CORE_ADDR address
, struct value
*dval
)
7163 struct type
*templ_type
;
7164 struct type
*var_type
;
7166 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7167 var_type
= TYPE_TARGET_TYPE (var_type0
);
7169 var_type
= var_type0
;
7171 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7173 if (templ_type
!= NULL
)
7174 var_type
= templ_type
;
7176 if (is_unchecked_variant (var_type
, value_type (dval
)))
7179 ada_which_variant_applies (var_type
,
7180 value_type (dval
), value_contents (dval
));
7183 return empty_record (var_type
);
7184 else if (is_dynamic_field (var_type
, which
))
7185 return to_fixed_record_type
7186 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7187 valaddr
, address
, dval
);
7188 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7190 to_fixed_record_type
7191 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7193 return TYPE_FIELD_TYPE (var_type
, which
);
7196 /* Assuming that TYPE0 is an array type describing the type of a value
7197 at ADDR, and that DVAL describes a record containing any
7198 discriminants used in TYPE0, returns a type for the value that
7199 contains no dynamic components (that is, no components whose sizes
7200 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7201 true, gives an error message if the resulting type's size is over
7204 static struct type
*
7205 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7208 struct type
*index_type_desc
;
7209 struct type
*result
;
7210 int constrained_packed_array_p
;
7212 if (TYPE_FIXED_INSTANCE (type0
))
7215 constrained_packed_array_p
= ada_is_constrained_packed_array_type (type0
);
7216 if (constrained_packed_array_p
)
7217 type0
= decode_constrained_packed_array_type (type0
);
7219 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7220 if (index_type_desc
== NULL
)
7222 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7223 /* NOTE: elt_type---the fixed version of elt_type0---should never
7224 depend on the contents of the array in properly constructed
7226 /* Create a fixed version of the array element type.
7227 We're not providing the address of an element here,
7228 and thus the actual object value cannot be inspected to do
7229 the conversion. This should not be a problem, since arrays of
7230 unconstrained objects are not allowed. In particular, all
7231 the elements of an array of a tagged type should all be of
7232 the same type specified in the debugging info. No need to
7233 consult the object tag. */
7234 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7236 /* Make sure we always create a new array type when dealing with
7237 packed array types, since we're going to fix-up the array
7238 type length and element bitsize a little further down. */
7239 if (elt_type0
== elt_type
&& !constrained_packed_array_p
)
7242 result
= create_array_type (alloc_type_copy (type0
),
7243 elt_type
, TYPE_INDEX_TYPE (type0
));
7248 struct type
*elt_type0
;
7251 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7252 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7254 /* NOTE: result---the fixed version of elt_type0---should never
7255 depend on the contents of the array in properly constructed
7257 /* Create a fixed version of the array element type.
7258 We're not providing the address of an element here,
7259 and thus the actual object value cannot be inspected to do
7260 the conversion. This should not be a problem, since arrays of
7261 unconstrained objects are not allowed. In particular, all
7262 the elements of an array of a tagged type should all be of
7263 the same type specified in the debugging info. No need to
7264 consult the object tag. */
7266 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7269 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7271 struct type
*range_type
=
7272 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7273 dval
, TYPE_INDEX_TYPE (elt_type0
));
7274 result
= create_array_type (alloc_type_copy (elt_type0
),
7275 result
, range_type
);
7276 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7278 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7279 error (_("array type with dynamic size is larger than varsize-limit"));
7282 if (constrained_packed_array_p
)
7284 /* So far, the resulting type has been created as if the original
7285 type was a regular (non-packed) array type. As a result, the
7286 bitsize of the array elements needs to be set again, and the array
7287 length needs to be recomputed based on that bitsize. */
7288 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7289 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7291 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7292 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7293 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7294 TYPE_LENGTH (result
)++;
7297 TYPE_FIXED_INSTANCE (result
) = 1;
7302 /* A standard type (containing no dynamically sized components)
7303 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7304 DVAL describes a record containing any discriminants used in TYPE0,
7305 and may be NULL if there are none, or if the object of type TYPE at
7306 ADDRESS or in VALADDR contains these discriminants.
7308 If CHECK_TAG is not null, in the case of tagged types, this function
7309 attempts to locate the object's tag and use it to compute the actual
7310 type. However, when ADDRESS is null, we cannot use it to determine the
7311 location of the tag, and therefore compute the tagged type's actual type.
7312 So we return the tagged type without consulting the tag. */
7314 static struct type
*
7315 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7316 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7318 type
= ada_check_typedef (type
);
7319 switch (TYPE_CODE (type
))
7323 case TYPE_CODE_STRUCT
:
7325 struct type
*static_type
= to_static_fixed_type (type
);
7326 struct type
*fixed_record_type
=
7327 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7328 /* If STATIC_TYPE is a tagged type and we know the object's address,
7329 then we can determine its tag, and compute the object's actual
7330 type from there. Note that we have to use the fixed record
7331 type (the parent part of the record may have dynamic fields
7332 and the way the location of _tag is expressed may depend on
7335 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7337 struct type
*real_type
=
7338 type_from_tag (value_tag_from_contents_and_address
7342 if (real_type
!= NULL
)
7343 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7346 /* Check to see if there is a parallel ___XVZ variable.
7347 If there is, then it provides the actual size of our type. */
7348 else if (ada_type_name (fixed_record_type
) != NULL
)
7350 char *name
= ada_type_name (fixed_record_type
);
7351 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7355 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7356 size
= get_int_var_value (xvz_name
, &xvz_found
);
7357 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7359 fixed_record_type
= copy_type (fixed_record_type
);
7360 TYPE_LENGTH (fixed_record_type
) = size
;
7362 /* The FIXED_RECORD_TYPE may have be a stub. We have
7363 observed this when the debugging info is STABS, and
7364 apparently it is something that is hard to fix.
7366 In practice, we don't need the actual type definition
7367 at all, because the presence of the XVZ variable allows us
7368 to assume that there must be a XVS type as well, which we
7369 should be able to use later, when we need the actual type
7372 In the meantime, pretend that the "fixed" type we are
7373 returning is NOT a stub, because this can cause trouble
7374 when using this type to create new types targeting it.
7375 Indeed, the associated creation routines often check
7376 whether the target type is a stub and will try to replace
7377 it, thus using a type with the wrong size. This, in turn,
7378 might cause the new type to have the wrong size too.
7379 Consider the case of an array, for instance, where the size
7380 of the array is computed from the number of elements in
7381 our array multiplied by the size of its element. */
7382 TYPE_STUB (fixed_record_type
) = 0;
7385 return fixed_record_type
;
7387 case TYPE_CODE_ARRAY
:
7388 return to_fixed_array_type (type
, dval
, 1);
7389 case TYPE_CODE_UNION
:
7393 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7397 /* The same as ada_to_fixed_type_1, except that it preserves the type
7398 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7399 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7402 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7403 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7406 struct type
*fixed_type
=
7407 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7409 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7410 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7416 /* A standard (static-sized) type corresponding as well as possible to
7417 TYPE0, but based on no runtime data. */
7419 static struct type
*
7420 to_static_fixed_type (struct type
*type0
)
7427 if (TYPE_FIXED_INSTANCE (type0
))
7430 type0
= ada_check_typedef (type0
);
7432 switch (TYPE_CODE (type0
))
7436 case TYPE_CODE_STRUCT
:
7437 type
= dynamic_template_type (type0
);
7439 return template_to_static_fixed_type (type
);
7441 return template_to_static_fixed_type (type0
);
7442 case TYPE_CODE_UNION
:
7443 type
= ada_find_parallel_type (type0
, "___XVU");
7445 return template_to_static_fixed_type (type
);
7447 return template_to_static_fixed_type (type0
);
7451 /* A static approximation of TYPE with all type wrappers removed. */
7453 static struct type
*
7454 static_unwrap_type (struct type
*type
)
7456 if (ada_is_aligner_type (type
))
7458 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7459 if (ada_type_name (type1
) == NULL
)
7460 TYPE_NAME (type1
) = ada_type_name (type
);
7462 return static_unwrap_type (type1
);
7466 struct type
*raw_real_type
= ada_get_base_type (type
);
7467 if (raw_real_type
== type
)
7470 return to_static_fixed_type (raw_real_type
);
7474 /* In some cases, incomplete and private types require
7475 cross-references that are not resolved as records (for example,
7477 type FooP is access Foo;
7479 type Foo is array ...;
7480 ). In these cases, since there is no mechanism for producing
7481 cross-references to such types, we instead substitute for FooP a
7482 stub enumeration type that is nowhere resolved, and whose tag is
7483 the name of the actual type. Call these types "non-record stubs". */
7485 /* A type equivalent to TYPE that is not a non-record stub, if one
7486 exists, otherwise TYPE. */
7489 ada_check_typedef (struct type
*type
)
7494 CHECK_TYPEDEF (type
);
7495 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7496 || !TYPE_STUB (type
)
7497 || TYPE_TAG_NAME (type
) == NULL
)
7501 char *name
= TYPE_TAG_NAME (type
);
7502 struct type
*type1
= ada_find_any_type (name
);
7503 return (type1
== NULL
) ? type
: type1
;
7507 /* A value representing the data at VALADDR/ADDRESS as described by
7508 type TYPE0, but with a standard (static-sized) type that correctly
7509 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7510 type, then return VAL0 [this feature is simply to avoid redundant
7511 creation of struct values]. */
7513 static struct value
*
7514 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7517 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7518 if (type
== type0
&& val0
!= NULL
)
7521 return value_from_contents_and_address (type
, 0, address
);
7524 /* A value representing VAL, but with a standard (static-sized) type
7525 that correctly describes it. Does not necessarily create a new
7528 static struct value
*
7529 ada_to_fixed_value (struct value
*val
)
7531 return ada_to_fixed_value_create (value_type (val
),
7532 value_address (val
),
7536 /* A value representing VAL, but with a standard (static-sized) type
7537 chosen to approximate the real type of VAL as well as possible, but
7538 without consulting any runtime values. For Ada dynamic-sized
7539 types, therefore, the type of the result is likely to be inaccurate. */
7541 static struct value
*
7542 ada_to_static_fixed_value (struct value
*val
)
7545 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7546 if (type
== value_type (val
))
7549 return coerce_unspec_val_to_type (val
, type
);
7555 /* Table mapping attribute numbers to names.
7556 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7558 static const char *attribute_names
[] = {
7576 ada_attribute_name (enum exp_opcode n
)
7578 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7579 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7581 return attribute_names
[0];
7584 /* Evaluate the 'POS attribute applied to ARG. */
7587 pos_atr (struct value
*arg
)
7589 struct value
*val
= coerce_ref (arg
);
7590 struct type
*type
= value_type (val
);
7592 if (!discrete_type_p (type
))
7593 error (_("'POS only defined on discrete types"));
7595 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7598 LONGEST v
= value_as_long (val
);
7600 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7602 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7605 error (_("enumeration value is invalid: can't find 'POS"));
7608 return value_as_long (val
);
7611 static struct value
*
7612 value_pos_atr (struct type
*type
, struct value
*arg
)
7614 return value_from_longest (type
, pos_atr (arg
));
7617 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7619 static struct value
*
7620 value_val_atr (struct type
*type
, struct value
*arg
)
7622 if (!discrete_type_p (type
))
7623 error (_("'VAL only defined on discrete types"));
7624 if (!integer_type_p (value_type (arg
)))
7625 error (_("'VAL requires integral argument"));
7627 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7629 long pos
= value_as_long (arg
);
7630 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7631 error (_("argument to 'VAL out of range"));
7632 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7635 return value_from_longest (type
, value_as_long (arg
));
7641 /* True if TYPE appears to be an Ada character type.
7642 [At the moment, this is true only for Character and Wide_Character;
7643 It is a heuristic test that could stand improvement]. */
7646 ada_is_character_type (struct type
*type
)
7650 /* If the type code says it's a character, then assume it really is,
7651 and don't check any further. */
7652 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7655 /* Otherwise, assume it's a character type iff it is a discrete type
7656 with a known character type name. */
7657 name
= ada_type_name (type
);
7658 return (name
!= NULL
7659 && (TYPE_CODE (type
) == TYPE_CODE_INT
7660 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7661 && (strcmp (name
, "character") == 0
7662 || strcmp (name
, "wide_character") == 0
7663 || strcmp (name
, "wide_wide_character") == 0
7664 || strcmp (name
, "unsigned char") == 0));
7667 /* True if TYPE appears to be an Ada string type. */
7670 ada_is_string_type (struct type
*type
)
7672 type
= ada_check_typedef (type
);
7674 && TYPE_CODE (type
) != TYPE_CODE_PTR
7675 && (ada_is_simple_array_type (type
)
7676 || ada_is_array_descriptor_type (type
))
7677 && ada_array_arity (type
) == 1)
7679 struct type
*elttype
= ada_array_element_type (type
, 1);
7681 return ada_is_character_type (elttype
);
7688 /* True if TYPE is a struct type introduced by the compiler to force the
7689 alignment of a value. Such types have a single field with a
7690 distinctive name. */
7693 ada_is_aligner_type (struct type
*type
)
7695 type
= ada_check_typedef (type
);
7697 /* If we can find a parallel XVS type, then the XVS type should
7698 be used instead of this type. And hence, this is not an aligner
7700 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7703 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7704 && TYPE_NFIELDS (type
) == 1
7705 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7708 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7709 the parallel type. */
7712 ada_get_base_type (struct type
*raw_type
)
7714 struct type
*real_type_namer
;
7715 struct type
*raw_real_type
;
7717 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7720 if (ada_is_aligner_type (raw_type
))
7721 /* The encoding specifies that we should always use the aligner type.
7722 So, even if this aligner type has an associated XVS type, we should
7725 According to the compiler gurus, an XVS type parallel to an aligner
7726 type may exist because of a stabs limitation. In stabs, aligner
7727 types are empty because the field has a variable-sized type, and
7728 thus cannot actually be used as an aligner type. As a result,
7729 we need the associated parallel XVS type to decode the type.
7730 Since the policy in the compiler is to not change the internal
7731 representation based on the debugging info format, we sometimes
7732 end up having a redundant XVS type parallel to the aligner type. */
7735 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7736 if (real_type_namer
== NULL
7737 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7738 || TYPE_NFIELDS (real_type_namer
) != 1)
7741 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7742 if (raw_real_type
== NULL
)
7745 return raw_real_type
;
7748 /* The type of value designated by TYPE, with all aligners removed. */
7751 ada_aligned_type (struct type
*type
)
7753 if (ada_is_aligner_type (type
))
7754 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7756 return ada_get_base_type (type
);
7760 /* The address of the aligned value in an object at address VALADDR
7761 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7764 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7766 if (ada_is_aligner_type (type
))
7767 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7769 TYPE_FIELD_BITPOS (type
,
7770 0) / TARGET_CHAR_BIT
);
7777 /* The printed representation of an enumeration literal with encoded
7778 name NAME. The value is good to the next call of ada_enum_name. */
7780 ada_enum_name (const char *name
)
7782 static char *result
;
7783 static size_t result_len
= 0;
7786 /* First, unqualify the enumeration name:
7787 1. Search for the last '.' character. If we find one, then skip
7788 all the preceeding characters, the unqualified name starts
7789 right after that dot.
7790 2. Otherwise, we may be debugging on a target where the compiler
7791 translates dots into "__". Search forward for double underscores,
7792 but stop searching when we hit an overloading suffix, which is
7793 of the form "__" followed by digits. */
7795 tmp
= strrchr (name
, '.');
7800 while ((tmp
= strstr (name
, "__")) != NULL
)
7802 if (isdigit (tmp
[2]))
7812 if (name
[1] == 'U' || name
[1] == 'W')
7814 if (sscanf (name
+ 2, "%x", &v
) != 1)
7820 GROW_VECT (result
, result_len
, 16);
7821 if (isascii (v
) && isprint (v
))
7822 xsnprintf (result
, result_len
, "'%c'", v
);
7823 else if (name
[1] == 'U')
7824 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7826 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7832 tmp
= strstr (name
, "__");
7834 tmp
= strstr (name
, "$");
7837 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7838 strncpy (result
, name
, tmp
- name
);
7839 result
[tmp
- name
] = '\0';
7847 /* Evaluate the subexpression of EXP starting at *POS as for
7848 evaluate_type, updating *POS to point just past the evaluated
7851 static struct value
*
7852 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7854 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7857 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7860 static struct value
*
7861 unwrap_value (struct value
*val
)
7863 struct type
*type
= ada_check_typedef (value_type (val
));
7864 if (ada_is_aligner_type (type
))
7866 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7867 struct type
*val_type
= ada_check_typedef (value_type (v
));
7868 if (ada_type_name (val_type
) == NULL
)
7869 TYPE_NAME (val_type
) = ada_type_name (type
);
7871 return unwrap_value (v
);
7875 struct type
*raw_real_type
=
7876 ada_check_typedef (ada_get_base_type (type
));
7878 if (type
== raw_real_type
)
7882 coerce_unspec_val_to_type
7883 (val
, ada_to_fixed_type (raw_real_type
, 0,
7884 value_address (val
),
7889 static struct value
*
7890 cast_to_fixed (struct type
*type
, struct value
*arg
)
7894 if (type
== value_type (arg
))
7896 else if (ada_is_fixed_point_type (value_type (arg
)))
7897 val
= ada_float_to_fixed (type
,
7898 ada_fixed_to_float (value_type (arg
),
7899 value_as_long (arg
)));
7902 DOUBLEST argd
= value_as_double (arg
);
7903 val
= ada_float_to_fixed (type
, argd
);
7906 return value_from_longest (type
, val
);
7909 static struct value
*
7910 cast_from_fixed (struct type
*type
, struct value
*arg
)
7912 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7913 value_as_long (arg
));
7914 return value_from_double (type
, val
);
7917 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7918 return the converted value. */
7920 static struct value
*
7921 coerce_for_assign (struct type
*type
, struct value
*val
)
7923 struct type
*type2
= value_type (val
);
7927 type2
= ada_check_typedef (type2
);
7928 type
= ada_check_typedef (type
);
7930 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7931 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7933 val
= ada_value_ind (val
);
7934 type2
= value_type (val
);
7937 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7938 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7940 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7941 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7942 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7943 error (_("Incompatible types in assignment"));
7944 deprecated_set_value_type (val
, type
);
7949 static struct value
*
7950 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7953 struct type
*type1
, *type2
;
7956 arg1
= coerce_ref (arg1
);
7957 arg2
= coerce_ref (arg2
);
7958 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7959 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7961 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7962 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7963 return value_binop (arg1
, arg2
, op
);
7972 return value_binop (arg1
, arg2
, op
);
7975 v2
= value_as_long (arg2
);
7977 error (_("second operand of %s must not be zero."), op_string (op
));
7979 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7980 return value_binop (arg1
, arg2
, op
);
7982 v1
= value_as_long (arg1
);
7987 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7988 v
+= v
> 0 ? -1 : 1;
7996 /* Should not reach this point. */
8000 val
= allocate_value (type1
);
8001 store_unsigned_integer (value_contents_raw (val
),
8002 TYPE_LENGTH (value_type (val
)),
8003 gdbarch_byte_order (get_type_arch (type1
)), v
);
8008 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8010 if (ada_is_direct_array_type (value_type (arg1
))
8011 || ada_is_direct_array_type (value_type (arg2
)))
8013 /* Automatically dereference any array reference before
8014 we attempt to perform the comparison. */
8015 arg1
= ada_coerce_ref (arg1
);
8016 arg2
= ada_coerce_ref (arg2
);
8018 arg1
= ada_coerce_to_simple_array (arg1
);
8019 arg2
= ada_coerce_to_simple_array (arg2
);
8020 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8021 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8022 error (_("Attempt to compare array with non-array"));
8023 /* FIXME: The following works only for types whose
8024 representations use all bits (no padding or undefined bits)
8025 and do not have user-defined equality. */
8027 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8028 && memcmp (value_contents (arg1
), value_contents (arg2
),
8029 TYPE_LENGTH (value_type (arg1
))) == 0;
8031 return value_equal (arg1
, arg2
);
8034 /* Total number of component associations in the aggregate starting at
8035 index PC in EXP. Assumes that index PC is the start of an
8039 num_component_specs (struct expression
*exp
, int pc
)
8042 m
= exp
->elts
[pc
+ 1].longconst
;
8045 for (i
= 0; i
< m
; i
+= 1)
8047 switch (exp
->elts
[pc
].opcode
)
8053 n
+= exp
->elts
[pc
+ 1].longconst
;
8056 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8061 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8062 component of LHS (a simple array or a record), updating *POS past
8063 the expression, assuming that LHS is contained in CONTAINER. Does
8064 not modify the inferior's memory, nor does it modify LHS (unless
8065 LHS == CONTAINER). */
8068 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8069 struct expression
*exp
, int *pos
)
8071 struct value
*mark
= value_mark ();
8073 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8075 struct type
*index_type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8076 struct value
*index_val
= value_from_longest (index_type
, index
);
8077 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8081 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8082 elt
= ada_to_fixed_value (unwrap_value (elt
));
8085 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8086 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8088 value_assign_to_component (container
, elt
,
8089 ada_evaluate_subexp (NULL
, exp
, pos
,
8092 value_free_to_mark (mark
);
8095 /* Assuming that LHS represents an lvalue having a record or array
8096 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8097 of that aggregate's value to LHS, advancing *POS past the
8098 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8099 lvalue containing LHS (possibly LHS itself). Does not modify
8100 the inferior's memory, nor does it modify the contents of
8101 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8103 static struct value
*
8104 assign_aggregate (struct value
*container
,
8105 struct value
*lhs
, struct expression
*exp
,
8106 int *pos
, enum noside noside
)
8108 struct type
*lhs_type
;
8109 int n
= exp
->elts
[*pos
+1].longconst
;
8110 LONGEST low_index
, high_index
;
8113 int max_indices
, num_indices
;
8114 int is_array_aggregate
;
8116 struct value
*mark
= value_mark ();
8119 if (noside
!= EVAL_NORMAL
)
8122 for (i
= 0; i
< n
; i
+= 1)
8123 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8127 container
= ada_coerce_ref (container
);
8128 if (ada_is_direct_array_type (value_type (container
)))
8129 container
= ada_coerce_to_simple_array (container
);
8130 lhs
= ada_coerce_ref (lhs
);
8131 if (!deprecated_value_modifiable (lhs
))
8132 error (_("Left operand of assignment is not a modifiable lvalue."));
8134 lhs_type
= value_type (lhs
);
8135 if (ada_is_direct_array_type (lhs_type
))
8137 lhs
= ada_coerce_to_simple_array (lhs
);
8138 lhs_type
= value_type (lhs
);
8139 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8140 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8141 is_array_aggregate
= 1;
8143 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8146 high_index
= num_visible_fields (lhs_type
) - 1;
8147 is_array_aggregate
= 0;
8150 error (_("Left-hand side must be array or record."));
8152 num_specs
= num_component_specs (exp
, *pos
- 3);
8153 max_indices
= 4 * num_specs
+ 4;
8154 indices
= alloca (max_indices
* sizeof (indices
[0]));
8155 indices
[0] = indices
[1] = low_index
- 1;
8156 indices
[2] = indices
[3] = high_index
+ 1;
8159 for (i
= 0; i
< n
; i
+= 1)
8161 switch (exp
->elts
[*pos
].opcode
)
8164 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8165 &num_indices
, max_indices
,
8166 low_index
, high_index
);
8169 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8170 &num_indices
, max_indices
,
8171 low_index
, high_index
);
8175 error (_("Misplaced 'others' clause"));
8176 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8177 num_indices
, low_index
, high_index
);
8180 error (_("Internal error: bad aggregate clause"));
8187 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8188 construct at *POS, updating *POS past the construct, given that
8189 the positions are relative to lower bound LOW, where HIGH is the
8190 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8191 updating *NUM_INDICES as needed. CONTAINER is as for
8192 assign_aggregate. */
8194 aggregate_assign_positional (struct value
*container
,
8195 struct value
*lhs
, struct expression
*exp
,
8196 int *pos
, LONGEST
*indices
, int *num_indices
,
8197 int max_indices
, LONGEST low
, LONGEST high
)
8199 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8201 if (ind
- 1 == high
)
8202 warning (_("Extra components in aggregate ignored."));
8205 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8207 assign_component (container
, lhs
, ind
, exp
, pos
);
8210 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8213 /* Assign into the components of LHS indexed by the OP_CHOICES
8214 construct at *POS, updating *POS past the construct, given that
8215 the allowable indices are LOW..HIGH. Record the indices assigned
8216 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8217 needed. CONTAINER is as for assign_aggregate. */
8219 aggregate_assign_from_choices (struct value
*container
,
8220 struct value
*lhs
, struct expression
*exp
,
8221 int *pos
, LONGEST
*indices
, int *num_indices
,
8222 int max_indices
, LONGEST low
, LONGEST high
)
8225 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8226 int choice_pos
, expr_pc
;
8227 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8229 choice_pos
= *pos
+= 3;
8231 for (j
= 0; j
< n_choices
; j
+= 1)
8232 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8234 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8236 for (j
= 0; j
< n_choices
; j
+= 1)
8238 LONGEST lower
, upper
;
8239 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8240 if (op
== OP_DISCRETE_RANGE
)
8243 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8245 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8250 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8261 name
= &exp
->elts
[choice_pos
+ 2].string
;
8264 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8267 error (_("Invalid record component association."));
8269 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8271 if (! find_struct_field (name
, value_type (lhs
), 0,
8272 NULL
, NULL
, NULL
, NULL
, &ind
))
8273 error (_("Unknown component name: %s."), name
);
8274 lower
= upper
= ind
;
8277 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8278 error (_("Index in component association out of bounds."));
8280 add_component_interval (lower
, upper
, indices
, num_indices
,
8282 while (lower
<= upper
)
8286 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8292 /* Assign the value of the expression in the OP_OTHERS construct in
8293 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8294 have not been previously assigned. The index intervals already assigned
8295 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8296 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8298 aggregate_assign_others (struct value
*container
,
8299 struct value
*lhs
, struct expression
*exp
,
8300 int *pos
, LONGEST
*indices
, int num_indices
,
8301 LONGEST low
, LONGEST high
)
8304 int expr_pc
= *pos
+1;
8306 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8309 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8313 assign_component (container
, lhs
, ind
, exp
, &pos
);
8316 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8319 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8320 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8321 modifying *SIZE as needed. It is an error if *SIZE exceeds
8322 MAX_SIZE. The resulting intervals do not overlap. */
8324 add_component_interval (LONGEST low
, LONGEST high
,
8325 LONGEST
* indices
, int *size
, int max_size
)
8328 for (i
= 0; i
< *size
; i
+= 2) {
8329 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8332 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8333 if (high
< indices
[kh
])
8335 if (low
< indices
[i
])
8337 indices
[i
+ 1] = indices
[kh
- 1];
8338 if (high
> indices
[i
+ 1])
8339 indices
[i
+ 1] = high
;
8340 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8341 *size
-= kh
- i
- 2;
8344 else if (high
< indices
[i
])
8348 if (*size
== max_size
)
8349 error (_("Internal error: miscounted aggregate components."));
8351 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8352 indices
[j
] = indices
[j
- 2];
8354 indices
[i
+ 1] = high
;
8357 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8360 static struct value
*
8361 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8363 if (type
== ada_check_typedef (value_type (arg2
)))
8366 if (ada_is_fixed_point_type (type
))
8367 return (cast_to_fixed (type
, arg2
));
8369 if (ada_is_fixed_point_type (value_type (arg2
)))
8370 return cast_from_fixed (type
, arg2
);
8372 return value_cast (type
, arg2
);
8375 /* Evaluating Ada expressions, and printing their result.
8376 ------------------------------------------------------
8381 We usually evaluate an Ada expression in order to print its value.
8382 We also evaluate an expression in order to print its type, which
8383 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8384 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8385 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8386 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8389 Evaluating expressions is a little more complicated for Ada entities
8390 than it is for entities in languages such as C. The main reason for
8391 this is that Ada provides types whose definition might be dynamic.
8392 One example of such types is variant records. Or another example
8393 would be an array whose bounds can only be known at run time.
8395 The following description is a general guide as to what should be
8396 done (and what should NOT be done) in order to evaluate an expression
8397 involving such types, and when. This does not cover how the semantic
8398 information is encoded by GNAT as this is covered separatly. For the
8399 document used as the reference for the GNAT encoding, see exp_dbug.ads
8400 in the GNAT sources.
8402 Ideally, we should embed each part of this description next to its
8403 associated code. Unfortunately, the amount of code is so vast right
8404 now that it's hard to see whether the code handling a particular
8405 situation might be duplicated or not. One day, when the code is
8406 cleaned up, this guide might become redundant with the comments
8407 inserted in the code, and we might want to remove it.
8409 2. ``Fixing'' an Entity, the Simple Case:
8410 -----------------------------------------
8412 When evaluating Ada expressions, the tricky issue is that they may
8413 reference entities whose type contents and size are not statically
8414 known. Consider for instance a variant record:
8416 type Rec (Empty : Boolean := True) is record
8419 when False => Value : Integer;
8422 Yes : Rec := (Empty => False, Value => 1);
8423 No : Rec := (empty => True);
8425 The size and contents of that record depends on the value of the
8426 descriminant (Rec.Empty). At this point, neither the debugging
8427 information nor the associated type structure in GDB are able to
8428 express such dynamic types. So what the debugger does is to create
8429 "fixed" versions of the type that applies to the specific object.
8430 We also informally refer to this opperation as "fixing" an object,
8431 which means creating its associated fixed type.
8433 Example: when printing the value of variable "Yes" above, its fixed
8434 type would look like this:
8441 On the other hand, if we printed the value of "No", its fixed type
8448 Things become a little more complicated when trying to fix an entity
8449 with a dynamic type that directly contains another dynamic type,
8450 such as an array of variant records, for instance. There are
8451 two possible cases: Arrays, and records.
8453 3. ``Fixing'' Arrays:
8454 ---------------------
8456 The type structure in GDB describes an array in terms of its bounds,
8457 and the type of its elements. By design, all elements in the array
8458 have the same type and we cannot represent an array of variant elements
8459 using the current type structure in GDB. When fixing an array,
8460 we cannot fix the array element, as we would potentially need one
8461 fixed type per element of the array. As a result, the best we can do
8462 when fixing an array is to produce an array whose bounds and size
8463 are correct (allowing us to read it from memory), but without having
8464 touched its element type. Fixing each element will be done later,
8465 when (if) necessary.
8467 Arrays are a little simpler to handle than records, because the same
8468 amount of memory is allocated for each element of the array, even if
8469 the amount of space actually used by each element differs from element
8470 to element. Consider for instance the following array of type Rec:
8472 type Rec_Array is array (1 .. 2) of Rec;
8474 The actual amount of memory occupied by each element might be different
8475 from element to element, depending on the value of their discriminant.
8476 But the amount of space reserved for each element in the array remains
8477 fixed regardless. So we simply need to compute that size using
8478 the debugging information available, from which we can then determine
8479 the array size (we multiply the number of elements of the array by
8480 the size of each element).
8482 The simplest case is when we have an array of a constrained element
8483 type. For instance, consider the following type declarations:
8485 type Bounded_String (Max_Size : Integer) is
8487 Buffer : String (1 .. Max_Size);
8489 type Bounded_String_Array is array (1 ..2) of Bounded_String (80);
8491 In this case, the compiler describes the array as an array of
8492 variable-size elements (identified by its XVS suffix) for which
8493 the size can be read in the parallel XVZ variable.
8495 In the case of an array of an unconstrained element type, the compiler
8496 wraps the array element inside a private PAD type. This type should not
8497 be shown to the user, and must be "unwrap"'ed before printing. Note
8498 that we also use the adjective "aligner" in our code to designate
8499 these wrapper types.
8501 In some cases, the size allocated for each element is statically
8502 known. In that case, the PAD type already has the correct size,
8503 and the array element should remain unfixed.
8505 But there are cases when this size is not statically known.
8506 For instance, assuming that "Five" is an integer variable:
8508 type Dynamic is array (1 .. Five) of Integer;
8509 type Wrapper (Has_Length : Boolean := False) is record
8512 when True => Length : Integer;
8516 type Wrapper_Array is array (1 .. 2) of Wrapper;
8518 Hello : Wrapper_Array := (others => (Has_Length => True,
8519 Data => (others => 17),
8523 The debugging info would describe variable Hello as being an
8524 array of a PAD type. The size of that PAD type is not statically
8525 known, but can be determined using a parallel XVZ variable.
8526 In that case, a copy of the PAD type with the correct size should
8527 be used for the fixed array.
8529 3. ``Fixing'' record type objects:
8530 ----------------------------------
8532 Things are slightly different from arrays in the case of dynamic
8533 record types. In this case, in order to compute the associated
8534 fixed type, we need to determine the size and offset of each of
8535 its components. This, in turn, requires us to compute the fixed
8536 type of each of these components.
8538 Consider for instance the example:
8540 type Bounded_String (Max_Size : Natural) is record
8541 Str : String (1 .. Max_Size);
8544 My_String : Bounded_String (Max_Size => 10);
8546 In that case, the position of field "Length" depends on the size
8547 of field Str, which itself depends on the value of the Max_Size
8548 discriminant. In order to fix the type of variable My_String,
8549 we need to fix the type of field Str. Therefore, fixing a variant
8550 record requires us to fix each of its components.
8552 However, if a component does not have a dynamic size, the component
8553 should not be fixed. In particular, fields that use a PAD type
8554 should not fixed. Here is an example where this might happen
8555 (assuming type Rec above):
8557 type Container (Big : Boolean) is record
8561 when True => Another : Integer;
8565 My_Container : Container := (Big => False,
8566 First => (Empty => True),
8569 In that example, the compiler creates a PAD type for component First,
8570 whose size is constant, and then positions the component After just
8571 right after it. The offset of component After is therefore constant
8574 The debugger computes the position of each field based on an algorithm
8575 that uses, among other things, the actual position and size of the field
8576 preceding it. Let's now imagine that the user is trying to print
8577 the value of My_Container. If the type fixing was recursive, we would
8578 end up computing the offset of field After based on the size of the
8579 fixed version of field First. And since in our example First has
8580 only one actual field, the size of the fixed type is actually smaller
8581 than the amount of space allocated to that field, and thus we would
8582 compute the wrong offset of field After.
8584 To make things more complicated, we need to watch out for dynamic
8585 components of variant records (identified by the ___XVL suffix in
8586 the component name). Even if the target type is a PAD type, the size
8587 of that type might not be statically known. So the PAD type needs
8588 to be unwrapped and the resulting type needs to be fixed. Otherwise,
8589 we might end up with the wrong size for our component. This can be
8590 observed with the following type declarations:
8592 type Octal is new Integer range 0 .. 7;
8593 type Octal_Array is array (Positive range <>) of Octal;
8594 pragma Pack (Octal_Array);
8596 type Octal_Buffer (Size : Positive) is record
8597 Buffer : Octal_Array (1 .. Size);
8601 In that case, Buffer is a PAD type whose size is unset and needs
8602 to be computed by fixing the unwrapped type.
8604 4. When to ``Fix'' un-``Fixed'' sub-elements of an entity:
8605 ----------------------------------------------------------
8607 Lastly, when should the sub-elements of an entity that remained unfixed
8608 thus far, be actually fixed?
8610 The answer is: Only when referencing that element. For instance
8611 when selecting one component of a record, this specific component
8612 should be fixed at that point in time. Or when printing the value
8613 of a record, each component should be fixed before its value gets
8614 printed. Similarly for arrays, the element of the array should be
8615 fixed when printing each element of the array, or when extracting
8616 one element out of that array. On the other hand, fixing should
8617 not be performed on the elements when taking a slice of an array!
8619 Note that one of the side-effects of miscomputing the offset and
8620 size of each field is that we end up also miscomputing the size
8621 of the containing type. This can have adverse results when computing
8622 the value of an entity. GDB fetches the value of an entity based
8623 on the size of its type, and thus a wrong size causes GDB to fetch
8624 the wrong amount of memory. In the case where the computed size is
8625 too small, GDB fetches too little data to print the value of our
8626 entiry. Results in this case as unpredicatble, as we usually read
8627 past the buffer containing the data =:-o. */
8629 /* Implement the evaluate_exp routine in the exp_descriptor structure
8630 for the Ada language. */
8632 static struct value
*
8633 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8634 int *pos
, enum noside noside
)
8637 int tem
, tem2
, tem3
;
8639 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8642 struct value
**argvec
;
8646 op
= exp
->elts
[pc
].opcode
;
8652 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8653 arg1
= unwrap_value (arg1
);
8655 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8656 then we need to perform the conversion manually, because
8657 evaluate_subexp_standard doesn't do it. This conversion is
8658 necessary in Ada because the different kinds of float/fixed
8659 types in Ada have different representations.
8661 Similarly, we need to perform the conversion from OP_LONG
8663 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8664 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8670 struct value
*result
;
8672 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8673 /* The result type will have code OP_STRING, bashed there from
8674 OP_ARRAY. Bash it back. */
8675 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8676 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8682 type
= exp
->elts
[pc
+ 1].type
;
8683 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8684 if (noside
== EVAL_SKIP
)
8686 arg1
= ada_value_cast (type
, arg1
, noside
);
8691 type
= exp
->elts
[pc
+ 1].type
;
8692 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8695 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8696 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8698 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8699 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8701 return ada_value_assign (arg1
, arg1
);
8703 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8704 except if the lhs of our assignment is a convenience variable.
8705 In the case of assigning to a convenience variable, the lhs
8706 should be exactly the result of the evaluation of the rhs. */
8707 type
= value_type (arg1
);
8708 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8710 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8711 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8713 if (ada_is_fixed_point_type (value_type (arg1
)))
8714 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8715 else if (ada_is_fixed_point_type (value_type (arg2
)))
8717 (_("Fixed-point values must be assigned to fixed-point variables"));
8719 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8720 return ada_value_assign (arg1
, arg2
);
8723 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8724 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8725 if (noside
== EVAL_SKIP
)
8727 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8728 return (value_from_longest
8730 value_as_long (arg1
) + value_as_long (arg2
)));
8731 if ((ada_is_fixed_point_type (value_type (arg1
))
8732 || ada_is_fixed_point_type (value_type (arg2
)))
8733 && value_type (arg1
) != value_type (arg2
))
8734 error (_("Operands of fixed-point addition must have the same type"));
8735 /* Do the addition, and cast the result to the type of the first
8736 argument. We cannot cast the result to a reference type, so if
8737 ARG1 is a reference type, find its underlying type. */
8738 type
= value_type (arg1
);
8739 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8740 type
= TYPE_TARGET_TYPE (type
);
8741 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8742 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8745 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8746 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8747 if (noside
== EVAL_SKIP
)
8749 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8750 return (value_from_longest
8752 value_as_long (arg1
) - value_as_long (arg2
)));
8753 if ((ada_is_fixed_point_type (value_type (arg1
))
8754 || ada_is_fixed_point_type (value_type (arg2
)))
8755 && value_type (arg1
) != value_type (arg2
))
8756 error (_("Operands of fixed-point subtraction must have the same type"));
8757 /* Do the substraction, and cast the result to the type of the first
8758 argument. We cannot cast the result to a reference type, so if
8759 ARG1 is a reference type, find its underlying type. */
8760 type
= value_type (arg1
);
8761 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8762 type
= TYPE_TARGET_TYPE (type
);
8763 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8764 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8770 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8771 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8772 if (noside
== EVAL_SKIP
)
8774 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8776 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8777 return value_zero (value_type (arg1
), not_lval
);
8781 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8782 if (ada_is_fixed_point_type (value_type (arg1
)))
8783 arg1
= cast_from_fixed (type
, arg1
);
8784 if (ada_is_fixed_point_type (value_type (arg2
)))
8785 arg2
= cast_from_fixed (type
, arg2
);
8786 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8787 return ada_value_binop (arg1
, arg2
, op
);
8791 case BINOP_NOTEQUAL
:
8792 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8793 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8794 if (noside
== EVAL_SKIP
)
8796 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8800 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8801 tem
= ada_value_equal (arg1
, arg2
);
8803 if (op
== BINOP_NOTEQUAL
)
8805 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8806 return value_from_longest (type
, (LONGEST
) tem
);
8809 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8810 if (noside
== EVAL_SKIP
)
8812 else if (ada_is_fixed_point_type (value_type (arg1
)))
8813 return value_cast (value_type (arg1
), value_neg (arg1
));
8816 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8817 return value_neg (arg1
);
8820 case BINOP_LOGICAL_AND
:
8821 case BINOP_LOGICAL_OR
:
8822 case UNOP_LOGICAL_NOT
:
8827 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8828 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8829 return value_cast (type
, val
);
8832 case BINOP_BITWISE_AND
:
8833 case BINOP_BITWISE_IOR
:
8834 case BINOP_BITWISE_XOR
:
8838 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8840 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8842 return value_cast (value_type (arg1
), val
);
8848 if (noside
== EVAL_SKIP
)
8853 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8854 /* Only encountered when an unresolved symbol occurs in a
8855 context other than a function call, in which case, it is
8857 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8858 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8859 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8861 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8862 if (ada_is_tagged_type (type
, 0))
8864 /* Tagged types are a little special in the fact that the real
8865 type is dynamic and can only be determined by inspecting the
8866 object's tag. This means that we need to get the object's
8867 value first (EVAL_NORMAL) and then extract the actual object
8870 Note that we cannot skip the final step where we extract
8871 the object type from its tag, because the EVAL_NORMAL phase
8872 results in dynamic components being resolved into fixed ones.
8873 This can cause problems when trying to print the type
8874 description of tagged types whose parent has a dynamic size:
8875 We use the type name of the "_parent" component in order
8876 to print the name of the ancestor type in the type description.
8877 If that component had a dynamic size, the resolution into
8878 a fixed type would result in the loss of that type name,
8879 thus preventing us from printing the name of the ancestor
8880 type in the type description. */
8881 struct type
*actual_type
;
8883 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8884 actual_type
= type_from_tag (ada_value_tag (arg1
));
8885 if (actual_type
== NULL
)
8886 /* If, for some reason, we were unable to determine
8887 the actual type from the tag, then use the static
8888 approximation that we just computed as a fallback.
8889 This can happen if the debugging information is
8890 incomplete, for instance. */
8893 return value_zero (actual_type
, not_lval
);
8898 (to_static_fixed_type
8899 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8904 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8905 arg1
= unwrap_value (arg1
);
8906 return ada_to_fixed_value (arg1
);
8912 /* Allocate arg vector, including space for the function to be
8913 called in argvec[0] and a terminating NULL. */
8914 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8916 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8918 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8919 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8920 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8921 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8924 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8925 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8928 if (noside
== EVAL_SKIP
)
8932 if (ada_is_constrained_packed_array_type
8933 (desc_base_type (value_type (argvec
[0]))))
8934 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8935 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8936 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
8937 /* This is a packed array that has already been fixed, and
8938 therefore already coerced to a simple array. Nothing further
8941 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8942 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8943 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8944 argvec
[0] = value_addr (argvec
[0]);
8946 type
= ada_check_typedef (value_type (argvec
[0]));
8947 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8949 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8951 case TYPE_CODE_FUNC
:
8952 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8954 case TYPE_CODE_ARRAY
:
8956 case TYPE_CODE_STRUCT
:
8957 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8958 argvec
[0] = ada_value_ind (argvec
[0]);
8959 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8962 error (_("cannot subscript or call something of type `%s'"),
8963 ada_type_name (value_type (argvec
[0])));
8968 switch (TYPE_CODE (type
))
8970 case TYPE_CODE_FUNC
:
8971 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8972 return allocate_value (TYPE_TARGET_TYPE (type
));
8973 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8974 case TYPE_CODE_STRUCT
:
8978 arity
= ada_array_arity (type
);
8979 type
= ada_array_element_type (type
, nargs
);
8981 error (_("cannot subscript or call a record"));
8983 error (_("wrong number of subscripts; expecting %d"), arity
);
8984 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8985 return value_zero (ada_aligned_type (type
), lval_memory
);
8987 unwrap_value (ada_value_subscript
8988 (argvec
[0], nargs
, argvec
+ 1));
8990 case TYPE_CODE_ARRAY
:
8991 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8993 type
= ada_array_element_type (type
, nargs
);
8995 error (_("element type of array unknown"));
8997 return value_zero (ada_aligned_type (type
), lval_memory
);
9000 unwrap_value (ada_value_subscript
9001 (ada_coerce_to_simple_array (argvec
[0]),
9002 nargs
, argvec
+ 1));
9003 case TYPE_CODE_PTR
: /* Pointer to array */
9004 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
9005 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9007 type
= ada_array_element_type (type
, nargs
);
9009 error (_("element type of array unknown"));
9011 return value_zero (ada_aligned_type (type
), lval_memory
);
9014 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
9015 nargs
, argvec
+ 1));
9018 error (_("Attempt to index or call something other than an "
9019 "array or function"));
9024 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9025 struct value
*low_bound_val
=
9026 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9027 struct value
*high_bound_val
=
9028 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9031 low_bound_val
= coerce_ref (low_bound_val
);
9032 high_bound_val
= coerce_ref (high_bound_val
);
9033 low_bound
= pos_atr (low_bound_val
);
9034 high_bound
= pos_atr (high_bound_val
);
9036 if (noside
== EVAL_SKIP
)
9039 /* If this is a reference to an aligner type, then remove all
9041 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9042 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
9043 TYPE_TARGET_TYPE (value_type (array
)) =
9044 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
9046 if (ada_is_constrained_packed_array_type (value_type (array
)))
9047 error (_("cannot slice a packed array"));
9049 /* If this is a reference to an array or an array lvalue,
9050 convert to a pointer. */
9051 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
9052 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
9053 && VALUE_LVAL (array
) == lval_memory
))
9054 array
= value_addr (array
);
9056 if (noside
== EVAL_AVOID_SIDE_EFFECTS
9057 && ada_is_array_descriptor_type (ada_check_typedef
9058 (value_type (array
))))
9059 return empty_array (ada_type_of_array (array
, 0), low_bound
);
9061 array
= ada_coerce_to_simple_array_ptr (array
);
9063 /* If we have more than one level of pointer indirection,
9064 dereference the value until we get only one level. */
9065 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
9066 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
9068 array
= value_ind (array
);
9070 /* Make sure we really do have an array type before going further,
9071 to avoid a SEGV when trying to get the index type or the target
9072 type later down the road if the debug info generated by
9073 the compiler is incorrect or incomplete. */
9074 if (!ada_is_simple_array_type (value_type (array
)))
9075 error (_("cannot take slice of non-array"));
9077 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
9079 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
9080 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
9084 struct type
*arr_type0
=
9085 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
9087 return ada_value_slice_from_ptr (array
, arr_type0
,
9088 longest_to_int (low_bound
),
9089 longest_to_int (high_bound
));
9092 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9094 else if (high_bound
< low_bound
)
9095 return empty_array (value_type (array
), low_bound
);
9097 return ada_value_slice (array
, longest_to_int (low_bound
),
9098 longest_to_int (high_bound
));
9103 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9104 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9106 if (noside
== EVAL_SKIP
)
9109 switch (TYPE_CODE (type
))
9112 lim_warning (_("Membership test incompletely implemented; "
9113 "always returns true"));
9114 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9115 return value_from_longest (type
, (LONGEST
) 1);
9117 case TYPE_CODE_RANGE
:
9118 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9119 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9120 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9121 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9122 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9124 value_from_longest (type
,
9125 (value_less (arg1
, arg3
)
9126 || value_equal (arg1
, arg3
))
9127 && (value_less (arg2
, arg1
)
9128 || value_equal (arg2
, arg1
)));
9131 case BINOP_IN_BOUNDS
:
9133 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9134 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9136 if (noside
== EVAL_SKIP
)
9139 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9141 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9142 return value_zero (type
, not_lval
);
9145 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9147 type
= ada_index_type (value_type (arg2
), tem
, "range");
9149 type
= value_type (arg1
);
9151 arg3
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 1));
9152 arg2
= value_from_longest (type
, ada_array_bound (arg2
, tem
, 0));
9154 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9155 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9156 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9158 value_from_longest (type
,
9159 (value_less (arg1
, arg3
)
9160 || value_equal (arg1
, arg3
))
9161 && (value_less (arg2
, arg1
)
9162 || value_equal (arg2
, arg1
)));
9164 case TERNOP_IN_RANGE
:
9165 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9166 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9167 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9169 if (noside
== EVAL_SKIP
)
9172 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9173 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9174 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9176 value_from_longest (type
,
9177 (value_less (arg1
, arg3
)
9178 || value_equal (arg1
, arg3
))
9179 && (value_less (arg2
, arg1
)
9180 || value_equal (arg2
, arg1
)));
9186 struct type
*type_arg
;
9187 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9189 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9191 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9195 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9199 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9200 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9201 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9204 if (noside
== EVAL_SKIP
)
9207 if (type_arg
== NULL
)
9209 arg1
= ada_coerce_ref (arg1
);
9211 if (ada_is_constrained_packed_array_type (value_type (arg1
)))
9212 arg1
= ada_coerce_to_simple_array (arg1
);
9214 type
= ada_index_type (value_type (arg1
), tem
,
9215 ada_attribute_name (op
));
9217 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9219 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9220 return allocate_value (type
);
9224 default: /* Should never happen. */
9225 error (_("unexpected attribute encountered"));
9227 return value_from_longest
9228 (type
, ada_array_bound (arg1
, tem
, 0));
9230 return value_from_longest
9231 (type
, ada_array_bound (arg1
, tem
, 1));
9233 return value_from_longest
9234 (type
, ada_array_length (arg1
, tem
));
9237 else if (discrete_type_p (type_arg
))
9239 struct type
*range_type
;
9240 char *name
= ada_type_name (type_arg
);
9242 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9243 range_type
= to_fixed_range_type (name
, NULL
, type_arg
);
9244 if (range_type
== NULL
)
9245 range_type
= type_arg
;
9249 error (_("unexpected attribute encountered"));
9251 return value_from_longest
9252 (range_type
, ada_discrete_type_low_bound (range_type
));
9254 return value_from_longest
9255 (range_type
, ada_discrete_type_high_bound (range_type
));
9257 error (_("the 'length attribute applies only to array types"));
9260 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9261 error (_("unimplemented type attribute"));
9266 if (ada_is_constrained_packed_array_type (type_arg
))
9267 type_arg
= decode_constrained_packed_array_type (type_arg
);
9269 type
= ada_index_type (type_arg
, tem
, ada_attribute_name (op
));
9271 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9273 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9274 return allocate_value (type
);
9279 error (_("unexpected attribute encountered"));
9281 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9282 return value_from_longest (type
, low
);
9284 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9285 return value_from_longest (type
, high
);
9287 low
= ada_array_bound_from_type (type_arg
, tem
, 0);
9288 high
= ada_array_bound_from_type (type_arg
, tem
, 1);
9289 return value_from_longest (type
, high
- low
+ 1);
9295 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9296 if (noside
== EVAL_SKIP
)
9299 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9300 return value_zero (ada_tag_type (arg1
), not_lval
);
9302 return ada_value_tag (arg1
);
9306 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9307 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9308 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9309 if (noside
== EVAL_SKIP
)
9311 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9312 return value_zero (value_type (arg1
), not_lval
);
9315 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9316 return value_binop (arg1
, arg2
,
9317 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9320 case OP_ATR_MODULUS
:
9322 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9323 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9325 if (noside
== EVAL_SKIP
)
9328 if (!ada_is_modular_type (type_arg
))
9329 error (_("'modulus must be applied to modular type"));
9331 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9332 ada_modulus (type_arg
));
9337 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9338 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9339 if (noside
== EVAL_SKIP
)
9341 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9342 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9343 return value_zero (type
, not_lval
);
9345 return value_pos_atr (type
, arg1
);
9348 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9349 type
= value_type (arg1
);
9351 /* If the argument is a reference, then dereference its type, since
9352 the user is really asking for the size of the actual object,
9353 not the size of the pointer. */
9354 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9355 type
= TYPE_TARGET_TYPE (type
);
9357 if (noside
== EVAL_SKIP
)
9359 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9360 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
, not_lval
);
9362 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
,
9363 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9366 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9367 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9368 type
= exp
->elts
[pc
+ 2].type
;
9369 if (noside
== EVAL_SKIP
)
9371 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9372 return value_zero (type
, not_lval
);
9374 return value_val_atr (type
, arg1
);
9377 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9378 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9379 if (noside
== EVAL_SKIP
)
9381 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9382 return value_zero (value_type (arg1
), not_lval
);
9385 /* For integer exponentiation operations,
9386 only promote the first argument. */
9387 if (is_integral_type (value_type (arg2
)))
9388 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9390 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9392 return value_binop (arg1
, arg2
, op
);
9396 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9397 if (noside
== EVAL_SKIP
)
9403 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9404 if (noside
== EVAL_SKIP
)
9406 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9407 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9408 return value_neg (arg1
);
9413 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9414 if (noside
== EVAL_SKIP
)
9416 type
= ada_check_typedef (value_type (arg1
));
9417 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9419 if (ada_is_array_descriptor_type (type
))
9420 /* GDB allows dereferencing GNAT array descriptors. */
9422 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9423 if (arrType
== NULL
)
9424 error (_("Attempt to dereference null array pointer."));
9425 return value_at_lazy (arrType
, 0);
9427 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9428 || TYPE_CODE (type
) == TYPE_CODE_REF
9429 /* In C you can dereference an array to get the 1st elt. */
9430 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9432 type
= to_static_fixed_type
9434 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9436 return value_zero (type
, lval_memory
);
9438 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9440 /* GDB allows dereferencing an int. */
9441 if (expect_type
== NULL
)
9442 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9447 to_static_fixed_type (ada_aligned_type (expect_type
));
9448 return value_zero (expect_type
, lval_memory
);
9452 error (_("Attempt to take contents of a non-pointer value."));
9454 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9455 type
= ada_check_typedef (value_type (arg1
));
9457 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9458 /* GDB allows dereferencing an int. If we were given
9459 the expect_type, then use that as the target type.
9460 Otherwise, assume that the target type is an int. */
9462 if (expect_type
!= NULL
)
9463 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9466 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9467 (CORE_ADDR
) value_as_address (arg1
));
9470 if (ada_is_array_descriptor_type (type
))
9471 /* GDB allows dereferencing GNAT array descriptors. */
9472 return ada_coerce_to_simple_array (arg1
);
9474 return ada_value_ind (arg1
);
9476 case STRUCTOP_STRUCT
:
9477 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9478 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9479 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9480 if (noside
== EVAL_SKIP
)
9482 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9484 struct type
*type1
= value_type (arg1
);
9485 if (ada_is_tagged_type (type1
, 1))
9487 type
= ada_lookup_struct_elt_type (type1
,
9488 &exp
->elts
[pc
+ 2].string
,
9491 /* In this case, we assume that the field COULD exist
9492 in some extension of the type. Return an object of
9493 "type" void, which will match any formal
9494 (see ada_type_match). */
9495 return value_zero (builtin_type (exp
->gdbarch
)->builtin_void
,
9500 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9503 return value_zero (ada_aligned_type (type
), lval_memory
);
9506 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
9507 arg1
= unwrap_value (arg1
);
9508 return ada_to_fixed_value (arg1
);
9511 /* The value is not supposed to be used. This is here to make it
9512 easier to accommodate expressions that contain types. */
9514 if (noside
== EVAL_SKIP
)
9516 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9517 return allocate_value (exp
->elts
[pc
+ 1].type
);
9519 error (_("Attempt to use a type name as an expression"));
9524 case OP_DISCRETE_RANGE
:
9527 if (noside
== EVAL_NORMAL
)
9531 error (_("Undefined name, ambiguous name, or renaming used in "
9532 "component association: %s."), &exp
->elts
[pc
+2].string
);
9534 error (_("Aggregates only allowed on the right of an assignment"));
9536 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9539 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9541 for (tem
= 0; tem
< nargs
; tem
+= 1)
9542 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9547 return value_from_longest (builtin_type (exp
->gdbarch
)->builtin_int
, 1);
9553 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9554 type name that encodes the 'small and 'delta information.
9555 Otherwise, return NULL. */
9558 fixed_type_info (struct type
*type
)
9560 const char *name
= ada_type_name (type
);
9561 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9563 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9565 const char *tail
= strstr (name
, "___XF_");
9571 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9572 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9577 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9580 ada_is_fixed_point_type (struct type
*type
)
9582 return fixed_type_info (type
) != NULL
;
9585 /* Return non-zero iff TYPE represents a System.Address type. */
9588 ada_is_system_address_type (struct type
*type
)
9590 return (TYPE_NAME (type
)
9591 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9594 /* Assuming that TYPE is the representation of an Ada fixed-point
9595 type, return its delta, or -1 if the type is malformed and the
9596 delta cannot be determined. */
9599 ada_delta (struct type
*type
)
9601 const char *encoding
= fixed_type_info (type
);
9604 /* Strictly speaking, num and den are encoded as integer. However,
9605 they may not fit into a long, and they will have to be converted
9606 to DOUBLEST anyway. So scan them as DOUBLEST. */
9607 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9614 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9615 factor ('SMALL value) associated with the type. */
9618 scaling_factor (struct type
*type
)
9620 const char *encoding
= fixed_type_info (type
);
9621 DOUBLEST num0
, den0
, num1
, den1
;
9624 /* Strictly speaking, num's and den's are encoded as integer. However,
9625 they may not fit into a long, and they will have to be converted
9626 to DOUBLEST anyway. So scan them as DOUBLEST. */
9627 n
= sscanf (encoding
,
9628 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9629 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9630 &num0
, &den0
, &num1
, &den1
);
9641 /* Assuming that X is the representation of a value of fixed-point
9642 type TYPE, return its floating-point equivalent. */
9645 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9647 return (DOUBLEST
) x
*scaling_factor (type
);
9650 /* The representation of a fixed-point value of type TYPE
9651 corresponding to the value X. */
9654 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9656 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9660 /* VAX floating formats */
9662 /* Non-zero iff TYPE represents one of the special VAX floating-point
9666 ada_is_vax_floating_type (struct type
*type
)
9669 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9672 && (TYPE_CODE (type
) == TYPE_CODE_INT
9673 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9674 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9677 /* The type of special VAX floating-point type this is, assuming
9678 ada_is_vax_floating_point. */
9681 ada_vax_float_type_suffix (struct type
*type
)
9683 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9686 /* A value representing the special debugging function that outputs
9687 VAX floating-point values of the type represented by TYPE. Assumes
9688 ada_is_vax_floating_type (TYPE). */
9691 ada_vax_float_print_function (struct type
*type
)
9693 switch (ada_vax_float_type_suffix (type
))
9696 return get_var_value ("DEBUG_STRING_F", 0);
9698 return get_var_value ("DEBUG_STRING_D", 0);
9700 return get_var_value ("DEBUG_STRING_G", 0);
9702 error (_("invalid VAX floating-point type"));
9709 /* Scan STR beginning at position K for a discriminant name, and
9710 return the value of that discriminant field of DVAL in *PX. If
9711 PNEW_K is not null, put the position of the character beyond the
9712 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9713 not alter *PX and *PNEW_K if unsuccessful. */
9716 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9719 static char *bound_buffer
= NULL
;
9720 static size_t bound_buffer_len
= 0;
9723 struct value
*bound_val
;
9725 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9728 pend
= strstr (str
+ k
, "__");
9732 k
+= strlen (bound
);
9736 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9737 bound
= bound_buffer
;
9738 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9739 bound
[pend
- (str
+ k
)] = '\0';
9743 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9744 if (bound_val
== NULL
)
9747 *px
= value_as_long (bound_val
);
9753 /* Value of variable named NAME in the current environment. If
9754 no such variable found, then if ERR_MSG is null, returns 0, and
9755 otherwise causes an error with message ERR_MSG. */
9757 static struct value
*
9758 get_var_value (char *name
, char *err_msg
)
9760 struct ada_symbol_info
*syms
;
9763 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9768 if (err_msg
== NULL
)
9771 error (("%s"), err_msg
);
9774 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9777 /* Value of integer variable named NAME in the current environment. If
9778 no such variable found, returns 0, and sets *FLAG to 0. If
9779 successful, sets *FLAG to 1. */
9782 get_int_var_value (char *name
, int *flag
)
9784 struct value
*var_val
= get_var_value (name
, 0);
9796 return value_as_long (var_val
);
9801 /* Return a range type whose base type is that of the range type named
9802 NAME in the current environment, and whose bounds are calculated
9803 from NAME according to the GNAT range encoding conventions.
9804 Extract discriminant values, if needed, from DVAL. ORIG_TYPE is the
9805 corresponding range type from debug information; fall back to using it
9806 if symbol lookup fails. If a new type must be created, allocate it
9807 like ORIG_TYPE was. The bounds information, in general, is encoded
9808 in NAME, the base type given in the named range type. */
9810 static struct type
*
9811 to_fixed_range_type (char *name
, struct value
*dval
, struct type
*orig_type
)
9813 struct type
*raw_type
= ada_find_any_type (name
);
9814 struct type
*base_type
;
9817 /* Fall back to the original type if symbol lookup failed. */
9818 if (raw_type
== NULL
)
9819 raw_type
= orig_type
;
9821 if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9822 base_type
= TYPE_TARGET_TYPE (raw_type
);
9824 base_type
= raw_type
;
9826 subtype_info
= strstr (name
, "___XD");
9827 if (subtype_info
== NULL
)
9829 LONGEST L
= ada_discrete_type_low_bound (raw_type
);
9830 LONGEST U
= ada_discrete_type_high_bound (raw_type
);
9831 if (L
< INT_MIN
|| U
> INT_MAX
)
9834 return create_range_type (alloc_type_copy (orig_type
), raw_type
,
9835 ada_discrete_type_low_bound (raw_type
),
9836 ada_discrete_type_high_bound (raw_type
));
9840 static char *name_buf
= NULL
;
9841 static size_t name_len
= 0;
9842 int prefix_len
= subtype_info
- name
;
9848 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9849 strncpy (name_buf
, name
, prefix_len
);
9850 name_buf
[prefix_len
] = '\0';
9853 bounds_str
= strchr (subtype_info
, '_');
9856 if (*subtype_info
== 'L')
9858 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9859 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9861 if (bounds_str
[n
] == '_')
9863 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9870 strcpy (name_buf
+ prefix_len
, "___L");
9871 L
= get_int_var_value (name_buf
, &ok
);
9874 lim_warning (_("Unknown lower bound, using 1."));
9879 if (*subtype_info
== 'U')
9881 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9882 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9888 strcpy (name_buf
+ prefix_len
, "___U");
9889 U
= get_int_var_value (name_buf
, &ok
);
9892 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9897 type
= create_range_type (alloc_type_copy (orig_type
), base_type
, L
, U
);
9898 TYPE_NAME (type
) = name
;
9903 /* True iff NAME is the name of a range type. */
9906 ada_is_range_type_name (const char *name
)
9908 return (name
!= NULL
&& strstr (name
, "___XD"));
9914 /* True iff TYPE is an Ada modular type. */
9917 ada_is_modular_type (struct type
*type
)
9919 struct type
*subranged_type
= base_type (type
);
9921 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9922 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9923 && TYPE_UNSIGNED (subranged_type
));
9926 /* Try to determine the lower and upper bounds of the given modular type
9927 using the type name only. Return non-zero and set L and U as the lower
9928 and upper bounds (respectively) if successful. */
9931 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9933 char *name
= ada_type_name (type
);
9941 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9942 we are looking for static bounds, which means an __XDLU suffix.
9943 Moreover, we know that the lower bound of modular types is always
9944 zero, so the actual suffix should start with "__XDLU_0__", and
9945 then be followed by the upper bound value. */
9946 suffix
= strstr (name
, "__XDLU_0__");
9950 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9953 *modulus
= (ULONGEST
) U
+ 1;
9957 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9960 ada_modulus (struct type
*type
)
9962 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9966 /* Ada exception catchpoint support:
9967 ---------------------------------
9969 We support 3 kinds of exception catchpoints:
9970 . catchpoints on Ada exceptions
9971 . catchpoints on unhandled Ada exceptions
9972 . catchpoints on failed assertions
9974 Exceptions raised during failed assertions, or unhandled exceptions
9975 could perfectly be caught with the general catchpoint on Ada exceptions.
9976 However, we can easily differentiate these two special cases, and having
9977 the option to distinguish these two cases from the rest can be useful
9978 to zero-in on certain situations.
9980 Exception catchpoints are a specialized form of breakpoint,
9981 since they rely on inserting breakpoints inside known routines
9982 of the GNAT runtime. The implementation therefore uses a standard
9983 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9986 Support in the runtime for exception catchpoints have been changed
9987 a few times already, and these changes affect the implementation
9988 of these catchpoints. In order to be able to support several
9989 variants of the runtime, we use a sniffer that will determine
9990 the runtime variant used by the program being debugged.
9992 At this time, we do not support the use of conditions on Ada exception
9993 catchpoints. The COND and COND_STRING fields are therefore set
9994 to NULL (most of the time, see below).
9996 Conditions where EXP_STRING, COND, and COND_STRING are used:
9998 When a user specifies the name of a specific exception in the case
9999 of catchpoints on Ada exceptions, we store the name of that exception
10000 in the EXP_STRING. We then translate this request into an actual
10001 condition stored in COND_STRING, and then parse it into an expression
10004 /* The different types of catchpoints that we introduced for catching
10007 enum exception_catchpoint_kind
10009 ex_catch_exception
,
10010 ex_catch_exception_unhandled
,
10014 /* Ada's standard exceptions. */
10016 static char *standard_exc
[] = {
10017 "constraint_error",
10023 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
10025 /* A structure that describes how to support exception catchpoints
10026 for a given executable. */
10028 struct exception_support_info
10030 /* The name of the symbol to break on in order to insert
10031 a catchpoint on exceptions. */
10032 const char *catch_exception_sym
;
10034 /* The name of the symbol to break on in order to insert
10035 a catchpoint on unhandled exceptions. */
10036 const char *catch_exception_unhandled_sym
;
10038 /* The name of the symbol to break on in order to insert
10039 a catchpoint on failed assertions. */
10040 const char *catch_assert_sym
;
10042 /* Assuming that the inferior just triggered an unhandled exception
10043 catchpoint, this function is responsible for returning the address
10044 in inferior memory where the name of that exception is stored.
10045 Return zero if the address could not be computed. */
10046 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
10049 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
10050 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
10052 /* The following exception support info structure describes how to
10053 implement exception catchpoints with the latest version of the
10054 Ada runtime (as of 2007-03-06). */
10056 static const struct exception_support_info default_exception_support_info
=
10058 "__gnat_debug_raise_exception", /* catch_exception_sym */
10059 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10060 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
10061 ada_unhandled_exception_name_addr
10064 /* The following exception support info structure describes how to
10065 implement exception catchpoints with a slightly older version
10066 of the Ada runtime. */
10068 static const struct exception_support_info exception_support_info_fallback
=
10070 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10071 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10072 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10073 ada_unhandled_exception_name_addr_from_raise
10076 /* For each executable, we sniff which exception info structure to use
10077 and cache it in the following global variable. */
10079 static const struct exception_support_info
*exception_info
= NULL
;
10081 /* Inspect the Ada runtime and determine which exception info structure
10082 should be used to provide support for exception catchpoints.
10084 This function will always set exception_info, or raise an error. */
10087 ada_exception_support_info_sniffer (void)
10089 struct symbol
*sym
;
10091 /* If the exception info is already known, then no need to recompute it. */
10092 if (exception_info
!= NULL
)
10095 /* Check the latest (default) exception support info. */
10096 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
10100 exception_info
= &default_exception_support_info
;
10104 /* Try our fallback exception suport info. */
10105 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
10109 exception_info
= &exception_support_info_fallback
;
10113 /* Sometimes, it is normal for us to not be able to find the routine
10114 we are looking for. This happens when the program is linked with
10115 the shared version of the GNAT runtime, and the program has not been
10116 started yet. Inform the user of these two possible causes if
10119 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
10120 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10122 /* If the symbol does not exist, then check that the program is
10123 already started, to make sure that shared libraries have been
10124 loaded. If it is not started, this may mean that the symbol is
10125 in a shared library. */
10127 if (ptid_get_pid (inferior_ptid
) == 0)
10128 error (_("Unable to insert catchpoint. Try to start the program first."));
10130 /* At this point, we know that we are debugging an Ada program and
10131 that the inferior has been started, but we still are not able to
10132 find the run-time symbols. That can mean that we are in
10133 configurable run time mode, or that a-except as been optimized
10134 out by the linker... In any case, at this point it is not worth
10135 supporting this feature. */
10137 error (_("Cannot insert catchpoints in this configuration."));
10140 /* An observer of "executable_changed" events.
10141 Its role is to clear certain cached values that need to be recomputed
10142 each time a new executable is loaded by GDB. */
10145 ada_executable_changed_observer (void)
10147 /* If the executable changed, then it is possible that the Ada runtime
10148 is different. So we need to invalidate the exception support info
10150 exception_info
= NULL
;
10153 /* Return the name of the function at PC, NULL if could not find it.
10154 This function only checks the debugging information, not the symbol
10158 function_name_from_pc (CORE_ADDR pc
)
10162 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
10168 /* True iff FRAME is very likely to be that of a function that is
10169 part of the runtime system. This is all very heuristic, but is
10170 intended to be used as advice as to what frames are uninteresting
10174 is_known_support_routine (struct frame_info
*frame
)
10176 struct symtab_and_line sal
;
10180 /* If this code does not have any debugging information (no symtab),
10181 This cannot be any user code. */
10183 find_frame_sal (frame
, &sal
);
10184 if (sal
.symtab
== NULL
)
10187 /* If there is a symtab, but the associated source file cannot be
10188 located, then assume this is not user code: Selecting a frame
10189 for which we cannot display the code would not be very helpful
10190 for the user. This should also take care of case such as VxWorks
10191 where the kernel has some debugging info provided for a few units. */
10193 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10196 /* Check the unit filename againt the Ada runtime file naming.
10197 We also check the name of the objfile against the name of some
10198 known system libraries that sometimes come with debugging info
10201 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10203 re_comp (known_runtime_file_name_patterns
[i
]);
10204 if (re_exec (sal
.symtab
->filename
))
10206 if (sal
.symtab
->objfile
!= NULL
10207 && re_exec (sal
.symtab
->objfile
->name
))
10211 /* Check whether the function is a GNAT-generated entity. */
10213 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
10214 if (func_name
== NULL
)
10217 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10219 re_comp (known_auxiliary_function_name_patterns
[i
]);
10220 if (re_exec (func_name
))
10227 /* Find the first frame that contains debugging information and that is not
10228 part of the Ada run-time, starting from FI and moving upward. */
10231 ada_find_printable_frame (struct frame_info
*fi
)
10233 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10235 if (!is_known_support_routine (fi
))
10244 /* Assuming that the inferior just triggered an unhandled exception
10245 catchpoint, return the address in inferior memory where the name
10246 of the exception is stored.
10248 Return zero if the address could not be computed. */
10251 ada_unhandled_exception_name_addr (void)
10253 return parse_and_eval_address ("e.full_name");
10256 /* Same as ada_unhandled_exception_name_addr, except that this function
10257 should be used when the inferior uses an older version of the runtime,
10258 where the exception name needs to be extracted from a specific frame
10259 several frames up in the callstack. */
10262 ada_unhandled_exception_name_addr_from_raise (void)
10265 struct frame_info
*fi
;
10267 /* To determine the name of this exception, we need to select
10268 the frame corresponding to RAISE_SYM_NAME. This frame is
10269 at least 3 levels up, so we simply skip the first 3 frames
10270 without checking the name of their associated function. */
10271 fi
= get_current_frame ();
10272 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10274 fi
= get_prev_frame (fi
);
10278 const char *func_name
=
10279 function_name_from_pc (get_frame_address_in_block (fi
));
10280 if (func_name
!= NULL
10281 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10282 break; /* We found the frame we were looking for... */
10283 fi
= get_prev_frame (fi
);
10290 return parse_and_eval_address ("id.full_name");
10293 /* Assuming the inferior just triggered an Ada exception catchpoint
10294 (of any type), return the address in inferior memory where the name
10295 of the exception is stored, if applicable.
10297 Return zero if the address could not be computed, or if not relevant. */
10300 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10301 struct breakpoint
*b
)
10305 case ex_catch_exception
:
10306 return (parse_and_eval_address ("e.full_name"));
10309 case ex_catch_exception_unhandled
:
10310 return exception_info
->unhandled_exception_name_addr ();
10313 case ex_catch_assert
:
10314 return 0; /* Exception name is not relevant in this case. */
10318 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10322 return 0; /* Should never be reached. */
10325 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10326 any error that ada_exception_name_addr_1 might cause to be thrown.
10327 When an error is intercepted, a warning with the error message is printed,
10328 and zero is returned. */
10331 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10332 struct breakpoint
*b
)
10334 struct gdb_exception e
;
10335 CORE_ADDR result
= 0;
10337 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10339 result
= ada_exception_name_addr_1 (ex
, b
);
10344 warning (_("failed to get exception name: %s"), e
.message
);
10351 /* Implement the PRINT_IT method in the breakpoint_ops structure
10352 for all exception catchpoint kinds. */
10354 static enum print_stop_action
10355 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10357 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10358 char exception_name
[256];
10362 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10363 exception_name
[sizeof (exception_name
) - 1] = '\0';
10366 ada_find_printable_frame (get_current_frame ());
10368 annotate_catchpoint (b
->number
);
10371 case ex_catch_exception
:
10373 printf_filtered (_("\nCatchpoint %d, %s at "),
10374 b
->number
, exception_name
);
10376 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10378 case ex_catch_exception_unhandled
:
10380 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10381 b
->number
, exception_name
);
10383 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10386 case ex_catch_assert
:
10387 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10392 return PRINT_SRC_AND_LOC
;
10395 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10396 for all exception catchpoint kinds. */
10399 print_one_exception (enum exception_catchpoint_kind ex
,
10400 struct breakpoint
*b
, struct bp_location
**last_loc
)
10402 struct value_print_options opts
;
10404 get_user_print_options (&opts
);
10405 if (opts
.addressprint
)
10407 annotate_field (4);
10408 ui_out_field_core_addr (uiout
, "addr", b
->loc
->gdbarch
, b
->loc
->address
);
10411 annotate_field (5);
10412 *last_loc
= b
->loc
;
10415 case ex_catch_exception
:
10416 if (b
->exp_string
!= NULL
)
10418 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10420 ui_out_field_string (uiout
, "what", msg
);
10424 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10428 case ex_catch_exception_unhandled
:
10429 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10432 case ex_catch_assert
:
10433 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10437 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10442 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10443 for all exception catchpoint kinds. */
10446 print_mention_exception (enum exception_catchpoint_kind ex
,
10447 struct breakpoint
*b
)
10451 case ex_catch_exception
:
10452 if (b
->exp_string
!= NULL
)
10453 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10454 b
->number
, b
->exp_string
);
10456 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10460 case ex_catch_exception_unhandled
:
10461 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10465 case ex_catch_assert
:
10466 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10470 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10475 /* Virtual table for "catch exception" breakpoints. */
10477 static enum print_stop_action
10478 print_it_catch_exception (struct breakpoint
*b
)
10480 return print_it_exception (ex_catch_exception
, b
);
10484 print_one_catch_exception (struct breakpoint
*b
, struct bp_location
**last_loc
)
10486 print_one_exception (ex_catch_exception
, b
, last_loc
);
10490 print_mention_catch_exception (struct breakpoint
*b
)
10492 print_mention_exception (ex_catch_exception
, b
);
10495 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10499 NULL
, /* breakpoint_hit */
10500 print_it_catch_exception
,
10501 print_one_catch_exception
,
10502 print_mention_catch_exception
10505 /* Virtual table for "catch exception unhandled" breakpoints. */
10507 static enum print_stop_action
10508 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10510 return print_it_exception (ex_catch_exception_unhandled
, b
);
10514 print_one_catch_exception_unhandled (struct breakpoint
*b
,
10515 struct bp_location
**last_loc
)
10517 print_one_exception (ex_catch_exception_unhandled
, b
, last_loc
);
10521 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10523 print_mention_exception (ex_catch_exception_unhandled
, b
);
10526 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10529 NULL
, /* breakpoint_hit */
10530 print_it_catch_exception_unhandled
,
10531 print_one_catch_exception_unhandled
,
10532 print_mention_catch_exception_unhandled
10535 /* Virtual table for "catch assert" breakpoints. */
10537 static enum print_stop_action
10538 print_it_catch_assert (struct breakpoint
*b
)
10540 return print_it_exception (ex_catch_assert
, b
);
10544 print_one_catch_assert (struct breakpoint
*b
, struct bp_location
**last_loc
)
10546 print_one_exception (ex_catch_assert
, b
, last_loc
);
10550 print_mention_catch_assert (struct breakpoint
*b
)
10552 print_mention_exception (ex_catch_assert
, b
);
10555 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10558 NULL
, /* breakpoint_hit */
10559 print_it_catch_assert
,
10560 print_one_catch_assert
,
10561 print_mention_catch_assert
10564 /* Return non-zero if B is an Ada exception catchpoint. */
10567 ada_exception_catchpoint_p (struct breakpoint
*b
)
10569 return (b
->ops
== &catch_exception_breakpoint_ops
10570 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10571 || b
->ops
== &catch_assert_breakpoint_ops
);
10574 /* Return a newly allocated copy of the first space-separated token
10575 in ARGSP, and then adjust ARGSP to point immediately after that
10578 Return NULL if ARGPS does not contain any more tokens. */
10581 ada_get_next_arg (char **argsp
)
10583 char *args
= *argsp
;
10587 /* Skip any leading white space. */
10589 while (isspace (*args
))
10592 if (args
[0] == '\0')
10593 return NULL
; /* No more arguments. */
10595 /* Find the end of the current argument. */
10598 while (*end
!= '\0' && !isspace (*end
))
10601 /* Adjust ARGSP to point to the start of the next argument. */
10605 /* Make a copy of the current argument and return it. */
10607 result
= xmalloc (end
- args
+ 1);
10608 strncpy (result
, args
, end
- args
);
10609 result
[end
- args
] = '\0';
10614 /* Split the arguments specified in a "catch exception" command.
10615 Set EX to the appropriate catchpoint type.
10616 Set EXP_STRING to the name of the specific exception if
10617 specified by the user. */
10620 catch_ada_exception_command_split (char *args
,
10621 enum exception_catchpoint_kind
*ex
,
10624 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10625 char *exception_name
;
10627 exception_name
= ada_get_next_arg (&args
);
10628 make_cleanup (xfree
, exception_name
);
10630 /* Check that we do not have any more arguments. Anything else
10633 while (isspace (*args
))
10636 if (args
[0] != '\0')
10637 error (_("Junk at end of expression"));
10639 discard_cleanups (old_chain
);
10641 if (exception_name
== NULL
)
10643 /* Catch all exceptions. */
10644 *ex
= ex_catch_exception
;
10645 *exp_string
= NULL
;
10647 else if (strcmp (exception_name
, "unhandled") == 0)
10649 /* Catch unhandled exceptions. */
10650 *ex
= ex_catch_exception_unhandled
;
10651 *exp_string
= NULL
;
10655 /* Catch a specific exception. */
10656 *ex
= ex_catch_exception
;
10657 *exp_string
= exception_name
;
10661 /* Return the name of the symbol on which we should break in order to
10662 implement a catchpoint of the EX kind. */
10664 static const char *
10665 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10667 gdb_assert (exception_info
!= NULL
);
10671 case ex_catch_exception
:
10672 return (exception_info
->catch_exception_sym
);
10674 case ex_catch_exception_unhandled
:
10675 return (exception_info
->catch_exception_unhandled_sym
);
10677 case ex_catch_assert
:
10678 return (exception_info
->catch_assert_sym
);
10681 internal_error (__FILE__
, __LINE__
,
10682 _("unexpected catchpoint kind (%d)"), ex
);
10686 /* Return the breakpoint ops "virtual table" used for catchpoints
10689 static struct breakpoint_ops
*
10690 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10694 case ex_catch_exception
:
10695 return (&catch_exception_breakpoint_ops
);
10697 case ex_catch_exception_unhandled
:
10698 return (&catch_exception_unhandled_breakpoint_ops
);
10700 case ex_catch_assert
:
10701 return (&catch_assert_breakpoint_ops
);
10704 internal_error (__FILE__
, __LINE__
,
10705 _("unexpected catchpoint kind (%d)"), ex
);
10709 /* Return the condition that will be used to match the current exception
10710 being raised with the exception that the user wants to catch. This
10711 assumes that this condition is used when the inferior just triggered
10712 an exception catchpoint.
10714 The string returned is a newly allocated string that needs to be
10715 deallocated later. */
10718 ada_exception_catchpoint_cond_string (const char *exp_string
)
10722 /* The standard exceptions are a special case. They are defined in
10723 runtime units that have been compiled without debugging info; if
10724 EXP_STRING is the not-fully-qualified name of a standard
10725 exception (e.g. "constraint_error") then, during the evaluation
10726 of the condition expression, the symbol lookup on this name would
10727 *not* return this standard exception. The catchpoint condition
10728 may then be set only on user-defined exceptions which have the
10729 same not-fully-qualified name (e.g. my_package.constraint_error).
10731 To avoid this unexcepted behavior, these standard exceptions are
10732 systematically prefixed by "standard". This means that "catch
10733 exception constraint_error" is rewritten into "catch exception
10734 standard.constraint_error".
10736 If an exception named contraint_error is defined in another package of
10737 the inferior program, then the only way to specify this exception as a
10738 breakpoint condition is to use its fully-qualified named:
10739 e.g. my_package.constraint_error. */
10741 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10743 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10745 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10749 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10752 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10754 static struct expression
*
10755 ada_parse_catchpoint_condition (char *cond_string
,
10756 struct symtab_and_line sal
)
10758 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10761 /* Return the symtab_and_line that should be used to insert an exception
10762 catchpoint of the TYPE kind.
10764 EX_STRING should contain the name of a specific exception
10765 that the catchpoint should catch, or NULL otherwise.
10767 The idea behind all the remaining parameters is that their names match
10768 the name of certain fields in the breakpoint structure that are used to
10769 handle exception catchpoints. This function returns the value to which
10770 these fields should be set, depending on the type of catchpoint we need
10773 If COND and COND_STRING are both non-NULL, any value they might
10774 hold will be free'ed, and then replaced by newly allocated ones.
10775 These parameters are left untouched otherwise. */
10777 static struct symtab_and_line
10778 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10779 char **addr_string
, char **cond_string
,
10780 struct expression
**cond
, struct breakpoint_ops
**ops
)
10782 const char *sym_name
;
10783 struct symbol
*sym
;
10784 struct symtab_and_line sal
;
10786 /* First, find out which exception support info to use. */
10787 ada_exception_support_info_sniffer ();
10789 /* Then lookup the function on which we will break in order to catch
10790 the Ada exceptions requested by the user. */
10792 sym_name
= ada_exception_sym_name (ex
);
10793 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10795 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10796 that should be compiled with debugging information. As a result, we
10797 expect to find that symbol in the symtabs. If we don't find it, then
10798 the target most likely does not support Ada exceptions, or we cannot
10799 insert exception breakpoints yet, because the GNAT runtime hasn't been
10802 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10803 in such a way that no debugging information is produced for the symbol
10804 we are looking for. In this case, we could search the minimal symbols
10805 as a fall-back mechanism. This would still be operating in degraded
10806 mode, however, as we would still be missing the debugging information
10807 that is needed in order to extract the name of the exception being
10808 raised (this name is printed in the catchpoint message, and is also
10809 used when trying to catch a specific exception). We do not handle
10810 this case for now. */
10813 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10815 /* Make sure that the symbol we found corresponds to a function. */
10816 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10817 error (_("Symbol \"%s\" is not a function (class = %d)"),
10818 sym_name
, SYMBOL_CLASS (sym
));
10820 sal
= find_function_start_sal (sym
, 1);
10822 /* Set ADDR_STRING. */
10824 *addr_string
= xstrdup (sym_name
);
10826 /* Set the COND and COND_STRING (if not NULL). */
10828 if (cond_string
!= NULL
&& cond
!= NULL
)
10830 if (*cond_string
!= NULL
)
10832 xfree (*cond_string
);
10833 *cond_string
= NULL
;
10840 if (exp_string
!= NULL
)
10842 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10843 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10848 *ops
= ada_exception_breakpoint_ops (ex
);
10853 /* Parse the arguments (ARGS) of the "catch exception" command.
10855 Set TYPE to the appropriate exception catchpoint type.
10856 If the user asked the catchpoint to catch only a specific
10857 exception, then save the exception name in ADDR_STRING.
10859 See ada_exception_sal for a description of all the remaining
10860 function arguments of this function. */
10862 struct symtab_and_line
10863 ada_decode_exception_location (char *args
, char **addr_string
,
10864 char **exp_string
, char **cond_string
,
10865 struct expression
**cond
,
10866 struct breakpoint_ops
**ops
)
10868 enum exception_catchpoint_kind ex
;
10870 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10871 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10875 struct symtab_and_line
10876 ada_decode_assert_location (char *args
, char **addr_string
,
10877 struct breakpoint_ops
**ops
)
10879 /* Check that no argument where provided at the end of the command. */
10883 while (isspace (*args
))
10886 error (_("Junk at end of arguments."));
10889 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10894 /* Information about operators given special treatment in functions
10896 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10898 #define ADA_OPERATORS \
10899 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10900 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10901 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10902 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10903 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10904 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10905 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10906 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10907 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10908 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10909 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10910 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10911 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10912 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10913 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10914 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10915 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10916 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10917 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10920 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10922 switch (exp
->elts
[pc
- 1].opcode
)
10925 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10928 #define OP_DEFN(op, len, args, binop) \
10929 case op: *oplenp = len; *argsp = args; break;
10935 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10940 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10946 ada_op_name (enum exp_opcode opcode
)
10951 return op_name_standard (opcode
);
10953 #define OP_DEFN(op, len, args, binop) case op: return #op;
10958 return "OP_AGGREGATE";
10960 return "OP_CHOICES";
10966 /* As for operator_length, but assumes PC is pointing at the first
10967 element of the operator, and gives meaningful results only for the
10968 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10971 ada_forward_operator_length (struct expression
*exp
, int pc
,
10972 int *oplenp
, int *argsp
)
10974 switch (exp
->elts
[pc
].opcode
)
10977 *oplenp
= *argsp
= 0;
10980 #define OP_DEFN(op, len, args, binop) \
10981 case op: *oplenp = len; *argsp = args; break;
10987 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10992 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10998 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10999 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
11007 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
11009 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
11014 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
11018 /* Ada attributes ('Foo). */
11021 case OP_ATR_LENGTH
:
11025 case OP_ATR_MODULUS
:
11032 case UNOP_IN_RANGE
:
11034 /* XXX: gdb_sprint_host_address, type_sprint */
11035 fprintf_filtered (stream
, _("Type @"));
11036 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
11037 fprintf_filtered (stream
, " (");
11038 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
11039 fprintf_filtered (stream
, ")");
11041 case BINOP_IN_BOUNDS
:
11042 fprintf_filtered (stream
, " (%d)",
11043 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
11045 case TERNOP_IN_RANGE
:
11050 case OP_DISCRETE_RANGE
:
11051 case OP_POSITIONAL
:
11058 char *name
= &exp
->elts
[elt
+ 2].string
;
11059 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
11060 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
11065 return dump_subexp_body_standard (exp
, stream
, elt
);
11069 for (i
= 0; i
< nargs
; i
+= 1)
11070 elt
= dump_subexp (exp
, stream
, elt
);
11075 /* The Ada extension of print_subexp (q.v.). */
11078 ada_print_subexp (struct expression
*exp
, int *pos
,
11079 struct ui_file
*stream
, enum precedence prec
)
11081 int oplen
, nargs
, i
;
11083 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
11085 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11092 print_subexp_standard (exp
, pos
, stream
, prec
);
11096 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
11099 case BINOP_IN_BOUNDS
:
11100 /* XXX: sprint_subexp */
11101 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11102 fputs_filtered (" in ", stream
);
11103 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11104 fputs_filtered ("'range", stream
);
11105 if (exp
->elts
[pc
+ 1].longconst
> 1)
11106 fprintf_filtered (stream
, "(%ld)",
11107 (long) exp
->elts
[pc
+ 1].longconst
);
11110 case TERNOP_IN_RANGE
:
11111 if (prec
>= PREC_EQUAL
)
11112 fputs_filtered ("(", stream
);
11113 /* XXX: sprint_subexp */
11114 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11115 fputs_filtered (" in ", stream
);
11116 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11117 fputs_filtered (" .. ", stream
);
11118 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11119 if (prec
>= PREC_EQUAL
)
11120 fputs_filtered (")", stream
);
11125 case OP_ATR_LENGTH
:
11129 case OP_ATR_MODULUS
:
11134 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11136 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
11137 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
11141 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11142 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
11146 for (tem
= 1; tem
< nargs
; tem
+= 1)
11148 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
11149 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
11151 fputs_filtered (")", stream
);
11156 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
11157 fputs_filtered ("'(", stream
);
11158 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
11159 fputs_filtered (")", stream
);
11162 case UNOP_IN_RANGE
:
11163 /* XXX: sprint_subexp */
11164 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11165 fputs_filtered (" in ", stream
);
11166 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
11169 case OP_DISCRETE_RANGE
:
11170 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11171 fputs_filtered ("..", stream
);
11172 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11176 fputs_filtered ("others => ", stream
);
11177 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11181 for (i
= 0; i
< nargs
-1; i
+= 1)
11184 fputs_filtered ("|", stream
);
11185 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11187 fputs_filtered (" => ", stream
);
11188 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11191 case OP_POSITIONAL
:
11192 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11196 fputs_filtered ("(", stream
);
11197 for (i
= 0; i
< nargs
; i
+= 1)
11200 fputs_filtered (", ", stream
);
11201 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11203 fputs_filtered (")", stream
);
11208 /* Table mapping opcodes into strings for printing operators
11209 and precedences of the operators. */
11211 static const struct op_print ada_op_print_tab
[] = {
11212 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
11213 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
11214 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
11215 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
11216 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
11217 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
11218 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
11219 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
11220 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
11221 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
11222 {">", BINOP_GTR
, PREC_ORDER
, 0},
11223 {"<", BINOP_LESS
, PREC_ORDER
, 0},
11224 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
11225 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
11226 {"+", BINOP_ADD
, PREC_ADD
, 0},
11227 {"-", BINOP_SUB
, PREC_ADD
, 0},
11228 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
11229 {"*", BINOP_MUL
, PREC_MUL
, 0},
11230 {"/", BINOP_DIV
, PREC_MUL
, 0},
11231 {"rem", BINOP_REM
, PREC_MUL
, 0},
11232 {"mod", BINOP_MOD
, PREC_MUL
, 0},
11233 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
11234 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
11235 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
11236 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
11237 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
11238 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
11239 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
11240 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
11241 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
11242 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
11246 enum ada_primitive_types
{
11247 ada_primitive_type_int
,
11248 ada_primitive_type_long
,
11249 ada_primitive_type_short
,
11250 ada_primitive_type_char
,
11251 ada_primitive_type_float
,
11252 ada_primitive_type_double
,
11253 ada_primitive_type_void
,
11254 ada_primitive_type_long_long
,
11255 ada_primitive_type_long_double
,
11256 ada_primitive_type_natural
,
11257 ada_primitive_type_positive
,
11258 ada_primitive_type_system_address
,
11259 nr_ada_primitive_types
11263 ada_language_arch_info (struct gdbarch
*gdbarch
,
11264 struct language_arch_info
*lai
)
11266 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
11267 lai
->primitive_type_vector
11268 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
11271 lai
->primitive_type_vector
[ada_primitive_type_int
]
11272 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11274 lai
->primitive_type_vector
[ada_primitive_type_long
]
11275 = arch_integer_type (gdbarch
, gdbarch_long_bit (gdbarch
),
11276 0, "long_integer");
11277 lai
->primitive_type_vector
[ada_primitive_type_short
]
11278 = arch_integer_type (gdbarch
, gdbarch_short_bit (gdbarch
),
11279 0, "short_integer");
11280 lai
->string_char_type
11281 = lai
->primitive_type_vector
[ada_primitive_type_char
]
11282 = arch_integer_type (gdbarch
, TARGET_CHAR_BIT
, 0, "character");
11283 lai
->primitive_type_vector
[ada_primitive_type_float
]
11284 = arch_float_type (gdbarch
, gdbarch_float_bit (gdbarch
),
11286 lai
->primitive_type_vector
[ada_primitive_type_double
]
11287 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11288 "long_float", NULL
);
11289 lai
->primitive_type_vector
[ada_primitive_type_long_long
]
11290 = arch_integer_type (gdbarch
, gdbarch_long_long_bit (gdbarch
),
11291 0, "long_long_integer");
11292 lai
->primitive_type_vector
[ada_primitive_type_long_double
]
11293 = arch_float_type (gdbarch
, gdbarch_double_bit (gdbarch
),
11294 "long_long_float", NULL
);
11295 lai
->primitive_type_vector
[ada_primitive_type_natural
]
11296 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11298 lai
->primitive_type_vector
[ada_primitive_type_positive
]
11299 = arch_integer_type (gdbarch
, gdbarch_int_bit (gdbarch
),
11301 lai
->primitive_type_vector
[ada_primitive_type_void
]
11302 = builtin
->builtin_void
;
11304 lai
->primitive_type_vector
[ada_primitive_type_system_address
]
11305 = lookup_pointer_type (arch_type (gdbarch
, TYPE_CODE_VOID
, 1, "void"));
11306 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11307 = "system__address";
11309 lai
->bool_type_symbol
= NULL
;
11310 lai
->bool_type_default
= builtin
->builtin_bool
;
11313 /* Language vector */
11315 /* Not really used, but needed in the ada_language_defn. */
11318 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
11320 ada_emit_char (c
, type
, stream
, quoter
, 1);
11326 warnings_issued
= 0;
11327 return ada_parse ();
11330 static const struct exp_descriptor ada_exp_descriptor
= {
11332 ada_operator_length
,
11334 ada_dump_subexp_body
,
11335 ada_evaluate_subexp
11338 const struct language_defn ada_language_defn
= {
11339 "ada", /* Language name */
11343 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11344 that's not quite what this means. */
11346 macro_expansion_no
,
11347 &ada_exp_descriptor
,
11351 ada_printchar
, /* Print a character constant */
11352 ada_printstr
, /* Function to print string constant */
11353 emit_char
, /* Function to print single char (not used) */
11354 ada_print_type
, /* Print a type using appropriate syntax */
11355 default_print_typedef
, /* Print a typedef using appropriate syntax */
11356 ada_val_print
, /* Print a value using appropriate syntax */
11357 ada_value_print
, /* Print a top-level value */
11358 NULL
, /* Language specific skip_trampoline */
11359 NULL
, /* name_of_this */
11360 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11361 basic_lookup_transparent_type
, /* lookup_transparent_type */
11362 ada_la_decode
, /* Language specific symbol demangler */
11363 NULL
, /* Language specific class_name_from_physname */
11364 ada_op_print_tab
, /* expression operators for printing */
11365 0, /* c-style arrays */
11366 1, /* String lower bound */
11367 ada_get_gdb_completer_word_break_characters
,
11368 ada_make_symbol_completion_list
,
11369 ada_language_arch_info
,
11370 ada_print_array_index
,
11371 default_pass_by_reference
,
11376 /* Provide a prototype to silence -Wmissing-prototypes. */
11377 extern initialize_file_ftype _initialize_ada_language
;
11380 _initialize_ada_language (void)
11382 add_language (&ada_language_defn
);
11384 varsize_limit
= 65536;
11386 obstack_init (&symbol_list_obstack
);
11388 decoded_names_store
= htab_create_alloc
11389 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11390 NULL
, xcalloc
, xfree
);
11392 observer_attach_executable_changed (ada_executable_changed_observer
);