1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007
4 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"
59 #ifndef ADA_RETAIN_DOTS
60 #define ADA_RETAIN_DOTS 0
63 /* Define whether or not the C operator '/' truncates towards zero for
64 differently signed operands (truncation direction is undefined in C).
65 Copied from valarith.c. */
67 #ifndef TRUNCATION_TOWARDS_ZERO
68 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
72 static void extract_string (CORE_ADDR addr
, char *buf
);
74 static void modify_general_field (char *, LONGEST
, int, int);
76 static struct type
*desc_base_type (struct type
*);
78 static struct type
*desc_bounds_type (struct type
*);
80 static struct value
*desc_bounds (struct value
*);
82 static int fat_pntr_bounds_bitpos (struct type
*);
84 static int fat_pntr_bounds_bitsize (struct type
*);
86 static struct type
*desc_data_type (struct type
*);
88 static struct value
*desc_data (struct value
*);
90 static int fat_pntr_data_bitpos (struct type
*);
92 static int fat_pntr_data_bitsize (struct type
*);
94 static struct value
*desc_one_bound (struct value
*, int, int);
96 static int desc_bound_bitpos (struct type
*, int, int);
98 static int desc_bound_bitsize (struct type
*, int, int);
100 static struct type
*desc_index_type (struct type
*, int);
102 static int desc_arity (struct type
*);
104 static int ada_type_match (struct type
*, struct type
*, int);
106 static int ada_args_match (struct symbol
*, struct value
**, int);
108 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
110 static struct value
*convert_actual (struct value
*, struct type
*,
113 static struct value
*make_array_descriptor (struct type
*, struct value
*,
116 static void ada_add_block_symbols (struct obstack
*,
117 struct block
*, const char *,
118 domain_enum
, struct objfile
*,
119 struct symtab
*, int);
121 static int is_nonfunction (struct ada_symbol_info
*, int);
123 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
124 struct block
*, struct symtab
*);
126 static int num_defns_collected (struct obstack
*);
128 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
130 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
131 *, const char *, int,
134 static struct symtab
*symtab_for_sym (struct symbol
*);
136 static struct value
*resolve_subexp (struct expression
**, int *, int,
139 static void replace_operator_with_call (struct expression
**, int, int, int,
140 struct symbol
*, struct block
*);
142 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
144 static char *ada_op_name (enum exp_opcode
);
146 static const char *ada_decoded_op_name (enum exp_opcode
);
148 static int numeric_type_p (struct type
*);
150 static int integer_type_p (struct type
*);
152 static int scalar_type_p (struct type
*);
154 static int discrete_type_p (struct type
*);
156 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
161 static struct symbol
*find_old_style_renaming_symbol (const char *,
164 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
167 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
170 static struct value
*evaluate_subexp_type (struct expression
*, int *);
172 static int is_dynamic_field (struct type
*, int);
174 static struct type
*to_fixed_variant_branch_type (struct type
*,
176 CORE_ADDR
, struct value
*);
178 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
180 static struct type
*to_fixed_range_type (char *, struct value
*,
183 static struct type
*to_static_fixed_type (struct type
*);
184 static struct type
*static_unwrap_type (struct type
*type
);
186 static struct value
*unwrap_value (struct value
*);
188 static struct type
*packed_array_type (struct type
*, long *);
190 static struct type
*decode_packed_array_type (struct type
*);
192 static struct value
*decode_packed_array (struct value
*);
194 static struct value
*value_subscript_packed (struct value
*, int,
197 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
199 static struct value
*coerce_unspec_val_to_type (struct value
*,
202 static struct value
*get_var_value (char *, char *);
204 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
206 static int equiv_types (struct type
*, struct type
*);
208 static int is_name_suffix (const char *);
210 static int wild_match (const char *, int, const char *);
212 static struct value
*ada_coerce_ref (struct value
*);
214 static LONGEST
pos_atr (struct value
*);
216 static struct value
*value_pos_atr (struct value
*);
218 static struct value
*value_val_atr (struct type
*, struct value
*);
220 static struct symbol
*standard_lookup (const char *, const struct block
*,
223 static struct value
*ada_search_struct_field (char *, struct value
*, int,
226 static struct value
*ada_value_primitive_field (struct value
*, int, int,
229 static int find_struct_field (char *, struct type
*, int,
230 struct type
**, int *, int *, int *, int *);
232 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
235 static struct value
*ada_to_fixed_value (struct value
*);
237 static int ada_resolve_function (struct ada_symbol_info
*, int,
238 struct value
**, int, const char *,
241 static struct value
*ada_coerce_to_simple_array (struct value
*);
243 static int ada_is_direct_array_type (struct type
*);
245 static void ada_language_arch_info (struct gdbarch
*,
246 struct language_arch_info
*);
248 static void check_size (const struct type
*);
250 static struct value
*ada_index_struct_field (int, struct value
*, int,
253 static struct value
*assign_aggregate (struct value
*, struct value
*,
254 struct expression
*, int *, enum noside
);
256 static void aggregate_assign_from_choices (struct value
*, struct value
*,
258 int *, LONGEST
*, int *,
259 int, LONGEST
, LONGEST
);
261 static void aggregate_assign_positional (struct value
*, struct value
*,
263 int *, LONGEST
*, int *, int,
267 static void aggregate_assign_others (struct value
*, struct value
*,
269 int *, LONGEST
*, int, LONGEST
, LONGEST
);
272 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
275 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
278 static void ada_forward_operator_length (struct expression
*, int, int *,
283 /* Maximum-sized dynamic type. */
284 static unsigned int varsize_limit
;
286 /* FIXME: brobecker/2003-09-17: No longer a const because it is
287 returned by a function that does not return a const char *. */
288 static char *ada_completer_word_break_characters
=
290 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
292 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
295 /* The name of the symbol to use to get the name of the main subprogram. */
296 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
297 = "__gnat_ada_main_program_name";
299 /* Limit on the number of warnings to raise per expression evaluation. */
300 static int warning_limit
= 2;
302 /* Number of warning messages issued; reset to 0 by cleanups after
303 expression evaluation. */
304 static int warnings_issued
= 0;
306 static const char *known_runtime_file_name_patterns
[] = {
307 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
310 static const char *known_auxiliary_function_name_patterns
[] = {
311 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
314 /* Space for allocating results of ada_lookup_symbol_list. */
315 static struct obstack symbol_list_obstack
;
321 ada_get_gdb_completer_word_break_characters (void)
323 return ada_completer_word_break_characters
;
326 /* Print an array element index using the Ada syntax. */
329 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
330 int format
, enum val_prettyprint pretty
)
332 LA_VALUE_PRINT (index_value
, stream
, format
, pretty
);
333 fprintf_filtered (stream
, " => ");
336 /* Read the string located at ADDR from the inferior and store the
340 extract_string (CORE_ADDR addr
, char *buf
)
344 /* Loop, reading one byte at a time, until we reach the '\000'
345 end-of-string marker. */
348 target_read_memory (addr
+ char_index
* sizeof (char),
349 buf
+ char_index
* sizeof (char), sizeof (char));
352 while (buf
[char_index
- 1] != '\000');
355 /* Assuming VECT points to an array of *SIZE objects of size
356 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
357 updating *SIZE as necessary and returning the (new) array. */
360 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
362 if (*size
< min_size
)
365 if (*size
< min_size
)
367 vect
= xrealloc (vect
, *size
* element_size
);
372 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
373 suffix of FIELD_NAME beginning "___". */
376 field_name_match (const char *field_name
, const char *target
)
378 int len
= strlen (target
);
380 (strncmp (field_name
, target
, len
) == 0
381 && (field_name
[len
] == '\0'
382 || (strncmp (field_name
+ len
, "___", 3) == 0
383 && strcmp (field_name
+ strlen (field_name
) - 6,
388 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
389 FIELD_NAME, and return its index. This function also handles fields
390 whose name have ___ suffixes because the compiler sometimes alters
391 their name by adding such a suffix to represent fields with certain
392 constraints. If the field could not be found, return a negative
393 number if MAYBE_MISSING is set. Otherwise raise an error. */
396 ada_get_field_index (const struct type
*type
, const char *field_name
,
400 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
401 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
405 error (_("Unable to find field %s in struct %s. Aborting"),
406 field_name
, TYPE_NAME (type
));
411 /* The length of the prefix of NAME prior to any "___" suffix. */
414 ada_name_prefix_len (const char *name
)
420 const char *p
= strstr (name
, "___");
422 return strlen (name
);
428 /* Return non-zero if SUFFIX is a suffix of STR.
429 Return zero if STR is null. */
432 is_suffix (const char *str
, const char *suffix
)
438 len2
= strlen (suffix
);
439 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
442 /* Create a value of type TYPE whose contents come from VALADDR, if it
443 is non-null, and whose memory address (in the inferior) is
447 value_from_contents_and_address (struct type
*type
,
448 const gdb_byte
*valaddr
,
451 struct value
*v
= allocate_value (type
);
453 set_value_lazy (v
, 1);
455 memcpy (value_contents_raw (v
), valaddr
, TYPE_LENGTH (type
));
456 VALUE_ADDRESS (v
) = address
;
458 VALUE_LVAL (v
) = lval_memory
;
462 /* The contents of value VAL, treated as a value of type TYPE. The
463 result is an lval in memory if VAL is. */
465 static struct value
*
466 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
468 type
= ada_check_typedef (type
);
469 if (value_type (val
) == type
)
473 struct value
*result
;
475 /* Make sure that the object size is not unreasonable before
476 trying to allocate some memory for it. */
479 result
= allocate_value (type
);
480 VALUE_LVAL (result
) = VALUE_LVAL (val
);
481 set_value_bitsize (result
, value_bitsize (val
));
482 set_value_bitpos (result
, value_bitpos (val
));
483 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + value_offset (val
);
485 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
486 set_value_lazy (result
, 1);
488 memcpy (value_contents_raw (result
), value_contents (val
),
494 static const gdb_byte
*
495 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
500 return valaddr
+ offset
;
504 cond_offset_target (CORE_ADDR address
, long offset
)
509 return address
+ offset
;
512 /* Issue a warning (as for the definition of warning in utils.c, but
513 with exactly one argument rather than ...), unless the limit on the
514 number of warnings has passed during the evaluation of the current
517 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
518 provided by "complaint". */
519 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
522 lim_warning (const char *format
, ...)
525 va_start (args
, format
);
527 warnings_issued
+= 1;
528 if (warnings_issued
<= warning_limit
)
529 vwarning (format
, args
);
534 /* Issue an error if the size of an object of type T is unreasonable,
535 i.e. if it would be a bad idea to allocate a value of this type in
539 check_size (const struct type
*type
)
541 if (TYPE_LENGTH (type
) > varsize_limit
)
542 error (_("object size is larger than varsize-limit"));
546 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
547 gdbtypes.h, but some of the necessary definitions in that file
548 seem to have gone missing. */
550 /* Maximum value of a SIZE-byte signed integer type. */
552 max_of_size (int size
)
554 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
555 return top_bit
| (top_bit
- 1);
558 /* Minimum value of a SIZE-byte signed integer type. */
560 min_of_size (int size
)
562 return -max_of_size (size
) - 1;
565 /* Maximum value of a SIZE-byte unsigned integer type. */
567 umax_of_size (int size
)
569 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
570 return top_bit
| (top_bit
- 1);
573 /* Maximum value of integral type T, as a signed quantity. */
575 max_of_type (struct type
*t
)
577 if (TYPE_UNSIGNED (t
))
578 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
580 return max_of_size (TYPE_LENGTH (t
));
583 /* Minimum value of integral type T, as a signed quantity. */
585 min_of_type (struct type
*t
)
587 if (TYPE_UNSIGNED (t
))
590 return min_of_size (TYPE_LENGTH (t
));
593 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
594 static struct value
*
595 discrete_type_high_bound (struct type
*type
)
597 switch (TYPE_CODE (type
))
599 case TYPE_CODE_RANGE
:
600 return value_from_longest (TYPE_TARGET_TYPE (type
),
601 TYPE_HIGH_BOUND (type
));
604 value_from_longest (type
,
605 TYPE_FIELD_BITPOS (type
,
606 TYPE_NFIELDS (type
) - 1));
608 return value_from_longest (type
, max_of_type (type
));
610 error (_("Unexpected type in discrete_type_high_bound."));
614 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
615 static struct value
*
616 discrete_type_low_bound (struct type
*type
)
618 switch (TYPE_CODE (type
))
620 case TYPE_CODE_RANGE
:
621 return value_from_longest (TYPE_TARGET_TYPE (type
),
622 TYPE_LOW_BOUND (type
));
624 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, 0));
626 return value_from_longest (type
, min_of_type (type
));
628 error (_("Unexpected type in discrete_type_low_bound."));
632 /* The identity on non-range types. For range types, the underlying
633 non-range scalar type. */
636 base_type (struct type
*type
)
638 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
640 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
642 type
= TYPE_TARGET_TYPE (type
);
648 /* Language Selection */
650 /* If the main program is in Ada, return language_ada, otherwise return LANG
651 (the main program is in Ada iif the adainit symbol is found).
653 MAIN_PST is not used. */
656 ada_update_initial_language (enum language lang
,
657 struct partial_symtab
*main_pst
)
659 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
660 (struct objfile
*) NULL
) != NULL
)
666 /* If the main procedure is written in Ada, then return its name.
667 The result is good until the next call. Return NULL if the main
668 procedure doesn't appear to be in Ada. */
673 struct minimal_symbol
*msym
;
674 CORE_ADDR main_program_name_addr
;
675 static char main_program_name
[1024];
677 /* For Ada, the name of the main procedure is stored in a specific
678 string constant, generated by the binder. Look for that symbol,
679 extract its address, and then read that string. If we didn't find
680 that string, then most probably the main procedure is not written
682 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
686 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
687 if (main_program_name_addr
== 0)
688 error (_("Invalid address for Ada main program name."));
690 extract_string (main_program_name_addr
, main_program_name
);
691 return main_program_name
;
694 /* The main procedure doesn't seem to be in Ada. */
700 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
703 const struct ada_opname_map ada_opname_table
[] = {
704 {"Oadd", "\"+\"", BINOP_ADD
},
705 {"Osubtract", "\"-\"", BINOP_SUB
},
706 {"Omultiply", "\"*\"", BINOP_MUL
},
707 {"Odivide", "\"/\"", BINOP_DIV
},
708 {"Omod", "\"mod\"", BINOP_MOD
},
709 {"Orem", "\"rem\"", BINOP_REM
},
710 {"Oexpon", "\"**\"", BINOP_EXP
},
711 {"Olt", "\"<\"", BINOP_LESS
},
712 {"Ole", "\"<=\"", BINOP_LEQ
},
713 {"Ogt", "\">\"", BINOP_GTR
},
714 {"Oge", "\">=\"", BINOP_GEQ
},
715 {"Oeq", "\"=\"", BINOP_EQUAL
},
716 {"One", "\"/=\"", BINOP_NOTEQUAL
},
717 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
718 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
719 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
720 {"Oconcat", "\"&\"", BINOP_CONCAT
},
721 {"Oabs", "\"abs\"", UNOP_ABS
},
722 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
723 {"Oadd", "\"+\"", UNOP_PLUS
},
724 {"Osubtract", "\"-\"", UNOP_NEG
},
728 /* Return non-zero if STR should be suppressed in info listings. */
731 is_suppressed_name (const char *str
)
733 if (strncmp (str
, "_ada_", 5) == 0)
735 if (str
[0] == '_' || str
[0] == '\000')
740 const char *suffix
= strstr (str
, "___");
741 if (suffix
!= NULL
&& suffix
[3] != 'X')
744 suffix
= str
+ strlen (str
);
745 for (p
= suffix
- 1; p
!= str
; p
-= 1)
749 if (p
[0] == 'X' && p
[-1] != '_')
753 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
754 if (strncmp (ada_opname_table
[i
].encoded
, p
,
755 strlen (ada_opname_table
[i
].encoded
)) == 0)
764 /* The "encoded" form of DECODED, according to GNAT conventions.
765 The result is valid until the next call to ada_encode. */
768 ada_encode (const char *decoded
)
770 static char *encoding_buffer
= NULL
;
771 static size_t encoding_buffer_size
= 0;
778 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
779 2 * strlen (decoded
) + 10);
782 for (p
= decoded
; *p
!= '\0'; p
+= 1)
784 if (!ADA_RETAIN_DOTS
&& *p
== '.')
786 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
791 const struct ada_opname_map
*mapping
;
793 for (mapping
= ada_opname_table
;
794 mapping
->encoded
!= NULL
795 && strncmp (mapping
->decoded
, p
,
796 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
798 if (mapping
->encoded
== NULL
)
799 error (_("invalid Ada operator name: %s"), p
);
800 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
801 k
+= strlen (mapping
->encoded
);
806 encoding_buffer
[k
] = *p
;
811 encoding_buffer
[k
] = '\0';
812 return encoding_buffer
;
815 /* Return NAME folded to lower case, or, if surrounded by single
816 quotes, unfolded, but with the quotes stripped away. Result good
820 ada_fold_name (const char *name
)
822 static char *fold_buffer
= NULL
;
823 static size_t fold_buffer_size
= 0;
825 int len
= strlen (name
);
826 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
830 strncpy (fold_buffer
, name
+ 1, len
- 2);
831 fold_buffer
[len
- 2] = '\000';
836 for (i
= 0; i
<= len
; i
+= 1)
837 fold_buffer
[i
] = tolower (name
[i
]);
843 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
846 is_lower_alphanum (const char c
)
848 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
851 /* Remove either of these suffixes:
856 These are suffixes introduced by the compiler for entities such as
857 nested subprogram for instance, in order to avoid name clashes.
858 They do not serve any purpose for the debugger. */
861 ada_remove_trailing_digits (const char *encoded
, int *len
)
863 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
866 while (i
> 0 && isdigit (encoded
[i
]))
868 if (i
>= 0 && encoded
[i
] == '.')
870 else if (i
>= 0 && encoded
[i
] == '$')
872 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
874 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
879 /* Remove the suffix introduced by the compiler for protected object
883 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
885 /* Remove trailing N. */
887 /* Protected entry subprograms are broken into two
888 separate subprograms: The first one is unprotected, and has
889 a 'N' suffix; the second is the protected version, and has
890 the 'P' suffix. The second calls the first one after handling
891 the protection. Since the P subprograms are internally generated,
892 we leave these names undecoded, giving the user a clue that this
893 entity is internal. */
896 && encoded
[*len
- 1] == 'N'
897 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
901 /* If ENCODED follows the GNAT entity encoding conventions, then return
902 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
905 The resulting string is valid until the next call of ada_decode.
906 If the string is unchanged by decoding, the original string pointer
910 ada_decode (const char *encoded
)
917 static char *decoding_buffer
= NULL
;
918 static size_t decoding_buffer_size
= 0;
920 /* The name of the Ada main procedure starts with "_ada_".
921 This prefix is not part of the decoded name, so skip this part
922 if we see this prefix. */
923 if (strncmp (encoded
, "_ada_", 5) == 0)
926 /* If the name starts with '_', then it is not a properly encoded
927 name, so do not attempt to decode it. Similarly, if the name
928 starts with '<', the name should not be decoded. */
929 if (encoded
[0] == '_' || encoded
[0] == '<')
932 len0
= strlen (encoded
);
934 ada_remove_trailing_digits (encoded
, &len0
);
935 ada_remove_po_subprogram_suffix (encoded
, &len0
);
937 /* Remove the ___X.* suffix if present. Do not forget to verify that
938 the suffix is located before the current "end" of ENCODED. We want
939 to avoid re-matching parts of ENCODED that have previously been
940 marked as discarded (by decrementing LEN0). */
941 p
= strstr (encoded
, "___");
942 if (p
!= NULL
&& p
- encoded
< len0
- 3)
950 /* Remove any trailing TKB suffix. It tells us that this symbol
951 is for the body of a task, but that information does not actually
952 appear in the decoded name. */
954 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
957 /* Remove trailing "B" suffixes. */
958 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
960 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
963 /* Make decoded big enough for possible expansion by operator name. */
965 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
966 decoded
= decoding_buffer
;
968 /* Remove trailing __{digit}+ or trailing ${digit}+. */
970 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
973 while ((i
>= 0 && isdigit (encoded
[i
]))
974 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
976 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
978 else if (encoded
[i
] == '$')
982 /* The first few characters that are not alphabetic are not part
983 of any encoding we use, so we can copy them over verbatim. */
985 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
986 decoded
[j
] = encoded
[i
];
991 /* Is this a symbol function? */
992 if (at_start_name
&& encoded
[i
] == 'O')
995 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
997 int op_len
= strlen (ada_opname_table
[k
].encoded
);
998 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1000 && !isalnum (encoded
[i
+ op_len
]))
1002 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1005 j
+= strlen (ada_opname_table
[k
].decoded
);
1009 if (ada_opname_table
[k
].encoded
!= NULL
)
1014 /* Replace "TK__" with "__", which will eventually be translated
1015 into "." (just below). */
1017 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1020 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1021 be translated into "." (just below). These are internal names
1022 generated for anonymous blocks inside which our symbol is nested. */
1024 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1025 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1026 && isdigit (encoded
[i
+4]))
1030 while (k
< len0
&& isdigit (encoded
[k
]))
1031 k
++; /* Skip any extra digit. */
1033 /* Double-check that the "__B_{DIGITS}+" sequence we found
1034 is indeed followed by "__". */
1035 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1039 /* Remove _E{DIGITS}+[sb] */
1041 /* Just as for protected object subprograms, there are 2 categories
1042 of subprograms created by the compiler for each entry. The first
1043 one implements the actual entry code, and has a suffix following
1044 the convention above; the second one implements the barrier and
1045 uses the same convention as above, except that the 'E' is replaced
1048 Just as above, we do not decode the name of barrier functions
1049 to give the user a clue that the code he is debugging has been
1050 internally generated. */
1052 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1053 && isdigit (encoded
[i
+2]))
1057 while (k
< len0
&& isdigit (encoded
[k
]))
1061 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1064 /* Just as an extra precaution, make sure that if this
1065 suffix is followed by anything else, it is a '_'.
1066 Otherwise, we matched this sequence by accident. */
1068 || (k
< len0
&& encoded
[k
] == '_'))
1073 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1074 the GNAT front-end in protected object subprograms. */
1077 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1079 /* Backtrack a bit up until we reach either the begining of
1080 the encoded name, or "__". Make sure that we only find
1081 digits or lowercase characters. */
1082 const char *ptr
= encoded
+ i
- 1;
1084 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1087 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1091 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1093 /* This is a X[bn]* sequence not separated from the previous
1094 part of the name with a non-alpha-numeric character (in other
1095 words, immediately following an alpha-numeric character), then
1096 verify that it is placed at the end of the encoded name. If
1097 not, then the encoding is not valid and we should abort the
1098 decoding. Otherwise, just skip it, it is used in body-nested
1102 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1106 else if (!ADA_RETAIN_DOTS
1107 && i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1109 /* Replace '__' by '.'. */
1117 /* It's a character part of the decoded name, so just copy it
1119 decoded
[j
] = encoded
[i
];
1124 decoded
[j
] = '\000';
1126 /* Decoded names should never contain any uppercase character.
1127 Double-check this, and abort the decoding if we find one. */
1129 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1130 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1133 if (strcmp (decoded
, encoded
) == 0)
1139 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1140 decoded
= decoding_buffer
;
1141 if (encoded
[0] == '<')
1142 strcpy (decoded
, encoded
);
1144 sprintf (decoded
, "<%s>", encoded
);
1149 /* Table for keeping permanent unique copies of decoded names. Once
1150 allocated, names in this table are never released. While this is a
1151 storage leak, it should not be significant unless there are massive
1152 changes in the set of decoded names in successive versions of a
1153 symbol table loaded during a single session. */
1154 static struct htab
*decoded_names_store
;
1156 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1157 in the language-specific part of GSYMBOL, if it has not been
1158 previously computed. Tries to save the decoded name in the same
1159 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1160 in any case, the decoded symbol has a lifetime at least that of
1162 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1163 const, but nevertheless modified to a semantically equivalent form
1164 when a decoded name is cached in it.
1168 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1171 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1172 if (*resultp
== NULL
)
1174 const char *decoded
= ada_decode (gsymbol
->name
);
1175 if (gsymbol
->bfd_section
!= NULL
)
1177 bfd
*obfd
= gsymbol
->bfd_section
->owner
;
1180 struct objfile
*objf
;
1183 if (obfd
== objf
->obfd
)
1185 *resultp
= obsavestring (decoded
, strlen (decoded
),
1186 &objf
->objfile_obstack
);
1192 /* Sometimes, we can't find a corresponding objfile, in which
1193 case, we put the result on the heap. Since we only decode
1194 when needed, we hope this usually does not cause a
1195 significant memory leak (FIXME). */
1196 if (*resultp
== NULL
)
1198 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1201 *slot
= xstrdup (decoded
);
1210 ada_la_decode (const char *encoded
, int options
)
1212 return xstrdup (ada_decode (encoded
));
1215 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1216 suffixes that encode debugging information or leading _ada_ on
1217 SYM_NAME (see is_name_suffix commentary for the debugging
1218 information that is ignored). If WILD, then NAME need only match a
1219 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1220 either argument is NULL. */
1223 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1225 if (sym_name
== NULL
|| name
== NULL
)
1228 return wild_match (name
, strlen (name
), sym_name
);
1231 int len_name
= strlen (name
);
1232 return (strncmp (sym_name
, name
, len_name
) == 0
1233 && is_name_suffix (sym_name
+ len_name
))
1234 || (strncmp (sym_name
, "_ada_", 5) == 0
1235 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1236 && is_name_suffix (sym_name
+ len_name
+ 5));
1240 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1241 suppressed in info listings. */
1244 ada_suppress_symbol_printing (struct symbol
*sym
)
1246 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1249 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1255 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1257 static char *bound_name
[] = {
1258 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1259 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1262 /* Maximum number of array dimensions we are prepared to handle. */
1264 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1266 /* Like modify_field, but allows bitpos > wordlength. */
1269 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1271 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1275 /* The desc_* routines return primitive portions of array descriptors
1278 /* The descriptor or array type, if any, indicated by TYPE; removes
1279 level of indirection, if needed. */
1281 static struct type
*
1282 desc_base_type (struct type
*type
)
1286 type
= ada_check_typedef (type
);
1288 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1289 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1290 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1295 /* True iff TYPE indicates a "thin" array pointer type. */
1298 is_thin_pntr (struct type
*type
)
1301 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1302 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1305 /* The descriptor type for thin pointer type TYPE. */
1307 static struct type
*
1308 thin_descriptor_type (struct type
*type
)
1310 struct type
*base_type
= desc_base_type (type
);
1311 if (base_type
== NULL
)
1313 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1317 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1318 if (alt_type
== NULL
)
1325 /* A pointer to the array data for thin-pointer value VAL. */
1327 static struct value
*
1328 thin_data_pntr (struct value
*val
)
1330 struct type
*type
= value_type (val
);
1331 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1332 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1335 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1336 VALUE_ADDRESS (val
) + value_offset (val
));
1339 /* True iff TYPE indicates a "thick" array pointer type. */
1342 is_thick_pntr (struct type
*type
)
1344 type
= desc_base_type (type
);
1345 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1346 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1349 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1350 pointer to one, the type of its bounds data; otherwise, NULL. */
1352 static struct type
*
1353 desc_bounds_type (struct type
*type
)
1357 type
= desc_base_type (type
);
1361 else if (is_thin_pntr (type
))
1363 type
= thin_descriptor_type (type
);
1366 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1368 return ada_check_typedef (r
);
1370 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1372 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1374 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1379 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1380 one, a pointer to its bounds data. Otherwise NULL. */
1382 static struct value
*
1383 desc_bounds (struct value
*arr
)
1385 struct type
*type
= ada_check_typedef (value_type (arr
));
1386 if (is_thin_pntr (type
))
1388 struct type
*bounds_type
=
1389 desc_bounds_type (thin_descriptor_type (type
));
1392 if (bounds_type
== NULL
)
1393 error (_("Bad GNAT array descriptor"));
1395 /* NOTE: The following calculation is not really kosher, but
1396 since desc_type is an XVE-encoded type (and shouldn't be),
1397 the correct calculation is a real pain. FIXME (and fix GCC). */
1398 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1399 addr
= value_as_long (arr
);
1401 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1404 value_from_longest (lookup_pointer_type (bounds_type
),
1405 addr
- TYPE_LENGTH (bounds_type
));
1408 else if (is_thick_pntr (type
))
1409 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1410 _("Bad GNAT array descriptor"));
1415 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1416 position of the field containing the address of the bounds data. */
1419 fat_pntr_bounds_bitpos (struct type
*type
)
1421 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1424 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1425 size of the field containing the address of the bounds data. */
1428 fat_pntr_bounds_bitsize (struct type
*type
)
1430 type
= desc_base_type (type
);
1432 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1433 return TYPE_FIELD_BITSIZE (type
, 1);
1435 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1438 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1439 pointer to one, the type of its array data (a
1440 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1441 ada_type_of_array to get an array type with bounds data. */
1443 static struct type
*
1444 desc_data_type (struct type
*type
)
1446 type
= desc_base_type (type
);
1448 /* NOTE: The following is bogus; see comment in desc_bounds. */
1449 if (is_thin_pntr (type
))
1450 return lookup_pointer_type
1451 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1452 else if (is_thick_pntr (type
))
1453 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1458 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1461 static struct value
*
1462 desc_data (struct value
*arr
)
1464 struct type
*type
= value_type (arr
);
1465 if (is_thin_pntr (type
))
1466 return thin_data_pntr (arr
);
1467 else if (is_thick_pntr (type
))
1468 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1469 _("Bad GNAT array descriptor"));
1475 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1476 position of the field containing the address of the data. */
1479 fat_pntr_data_bitpos (struct type
*type
)
1481 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1484 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1485 size of the field containing the address of the data. */
1488 fat_pntr_data_bitsize (struct type
*type
)
1490 type
= desc_base_type (type
);
1492 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1493 return TYPE_FIELD_BITSIZE (type
, 0);
1495 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1498 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1499 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1500 bound, if WHICH is 1. The first bound is I=1. */
1502 static struct value
*
1503 desc_one_bound (struct value
*bounds
, int i
, int which
)
1505 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1506 _("Bad GNAT array descriptor bounds"));
1509 /* If BOUNDS is an array-bounds structure type, return the bit position
1510 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1511 bound, if WHICH is 1. The first bound is I=1. */
1514 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1516 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1519 /* If BOUNDS is an array-bounds structure type, return the bit field size
1520 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1521 bound, if WHICH is 1. The first bound is I=1. */
1524 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1526 type
= desc_base_type (type
);
1528 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1529 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1531 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1534 /* If TYPE is the type of an array-bounds structure, the type of its
1535 Ith bound (numbering from 1). Otherwise, NULL. */
1537 static struct type
*
1538 desc_index_type (struct type
*type
, int i
)
1540 type
= desc_base_type (type
);
1542 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1543 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1548 /* The number of index positions in the array-bounds type TYPE.
1549 Return 0 if TYPE is NULL. */
1552 desc_arity (struct type
*type
)
1554 type
= desc_base_type (type
);
1557 return TYPE_NFIELDS (type
) / 2;
1561 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1562 an array descriptor type (representing an unconstrained array
1566 ada_is_direct_array_type (struct type
*type
)
1570 type
= ada_check_typedef (type
);
1571 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1572 || ada_is_array_descriptor_type (type
));
1575 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1579 ada_is_array_type (struct type
*type
)
1582 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1583 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1584 type
= TYPE_TARGET_TYPE (type
);
1585 return ada_is_direct_array_type (type
);
1588 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1591 ada_is_simple_array_type (struct type
*type
)
1595 type
= ada_check_typedef (type
);
1596 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1597 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1598 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1601 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1604 ada_is_array_descriptor_type (struct type
*type
)
1606 struct type
*data_type
= desc_data_type (type
);
1610 type
= ada_check_typedef (type
);
1613 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1614 && TYPE_TARGET_TYPE (data_type
) != NULL
1615 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1616 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1617 && desc_arity (desc_bounds_type (type
)) > 0;
1620 /* Non-zero iff type is a partially mal-formed GNAT array
1621 descriptor. FIXME: This is to compensate for some problems with
1622 debugging output from GNAT. Re-examine periodically to see if it
1626 ada_is_bogus_array_descriptor (struct type
*type
)
1630 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1631 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1632 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1633 && !ada_is_array_descriptor_type (type
);
1637 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1638 (fat pointer) returns the type of the array data described---specifically,
1639 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1640 in from the descriptor; otherwise, they are left unspecified. If
1641 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1642 returns NULL. The result is simply the type of ARR if ARR is not
1645 ada_type_of_array (struct value
*arr
, int bounds
)
1647 if (ada_is_packed_array_type (value_type (arr
)))
1648 return decode_packed_array_type (value_type (arr
));
1650 if (!ada_is_array_descriptor_type (value_type (arr
)))
1651 return value_type (arr
);
1655 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1658 struct type
*elt_type
;
1660 struct value
*descriptor
;
1661 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1663 elt_type
= ada_array_element_type (value_type (arr
), -1);
1664 arity
= ada_array_arity (value_type (arr
));
1666 if (elt_type
== NULL
|| arity
== 0)
1667 return ada_check_typedef (value_type (arr
));
1669 descriptor
= desc_bounds (arr
);
1670 if (value_as_long (descriptor
) == 0)
1674 struct type
*range_type
= alloc_type (objf
);
1675 struct type
*array_type
= alloc_type (objf
);
1676 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1677 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1680 create_range_type (range_type
, value_type (low
),
1681 longest_to_int (value_as_long (low
)),
1682 longest_to_int (value_as_long (high
)));
1683 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1686 return lookup_pointer_type (elt_type
);
1690 /* If ARR does not represent an array, returns ARR unchanged.
1691 Otherwise, returns either a standard GDB array with bounds set
1692 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1693 GDB array. Returns NULL if ARR is a null fat pointer. */
1696 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1698 if (ada_is_array_descriptor_type (value_type (arr
)))
1700 struct type
*arrType
= ada_type_of_array (arr
, 1);
1701 if (arrType
== NULL
)
1703 return value_cast (arrType
, value_copy (desc_data (arr
)));
1705 else if (ada_is_packed_array_type (value_type (arr
)))
1706 return decode_packed_array (arr
);
1711 /* If ARR does not represent an array, returns ARR unchanged.
1712 Otherwise, returns a standard GDB array describing ARR (which may
1713 be ARR itself if it already is in the proper form). */
1715 static struct value
*
1716 ada_coerce_to_simple_array (struct value
*arr
)
1718 if (ada_is_array_descriptor_type (value_type (arr
)))
1720 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1722 error (_("Bounds unavailable for null array pointer."));
1723 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1724 return value_ind (arrVal
);
1726 else if (ada_is_packed_array_type (value_type (arr
)))
1727 return decode_packed_array (arr
);
1732 /* If TYPE represents a GNAT array type, return it translated to an
1733 ordinary GDB array type (possibly with BITSIZE fields indicating
1734 packing). For other types, is the identity. */
1737 ada_coerce_to_simple_array_type (struct type
*type
)
1739 struct value
*mark
= value_mark ();
1740 struct value
*dummy
= value_from_longest (builtin_type_long
, 0);
1741 struct type
*result
;
1742 deprecated_set_value_type (dummy
, type
);
1743 result
= ada_type_of_array (dummy
, 0);
1744 value_free_to_mark (mark
);
1748 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1751 ada_is_packed_array_type (struct type
*type
)
1755 type
= desc_base_type (type
);
1756 type
= ada_check_typedef (type
);
1758 ada_type_name (type
) != NULL
1759 && strstr (ada_type_name (type
), "___XP") != NULL
;
1762 /* Given that TYPE is a standard GDB array type with all bounds filled
1763 in, and that the element size of its ultimate scalar constituents
1764 (that is, either its elements, or, if it is an array of arrays, its
1765 elements' elements, etc.) is *ELT_BITS, return an identical type,
1766 but with the bit sizes of its elements (and those of any
1767 constituent arrays) recorded in the BITSIZE components of its
1768 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1771 static struct type
*
1772 packed_array_type (struct type
*type
, long *elt_bits
)
1774 struct type
*new_elt_type
;
1775 struct type
*new_type
;
1776 LONGEST low_bound
, high_bound
;
1778 type
= ada_check_typedef (type
);
1779 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1782 new_type
= alloc_type (TYPE_OBJFILE (type
));
1783 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1785 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1786 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1787 TYPE_NAME (new_type
) = ada_type_name (type
);
1789 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1790 &low_bound
, &high_bound
) < 0)
1791 low_bound
= high_bound
= 0;
1792 if (high_bound
< low_bound
)
1793 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1796 *elt_bits
*= (high_bound
- low_bound
+ 1);
1797 TYPE_LENGTH (new_type
) =
1798 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1801 TYPE_FLAGS (new_type
) |= TYPE_FLAG_FIXED_INSTANCE
;
1805 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1807 static struct type
*
1808 decode_packed_array_type (struct type
*type
)
1811 struct block
**blocks
;
1812 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1815 struct type
*shadow_type
;
1820 raw_name
= ada_type_name (desc_base_type (type
));
1825 name
= (char *) alloca (strlen (raw_name
) + 1);
1826 tail
= strstr (raw_name
, "___XP");
1827 type
= desc_base_type (type
);
1829 memcpy (name
, raw_name
, tail
- raw_name
);
1830 name
[tail
- raw_name
] = '\000';
1832 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1833 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1835 lim_warning (_("could not find bounds information on packed array"));
1838 shadow_type
= SYMBOL_TYPE (sym
);
1840 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1842 lim_warning (_("could not understand bounds information on packed array"));
1846 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1849 (_("could not understand bit size information on packed array"));
1853 return packed_array_type (shadow_type
, &bits
);
1856 /* Given that ARR is a struct value *indicating a GNAT packed array,
1857 returns a simple array that denotes that array. Its type is a
1858 standard GDB array type except that the BITSIZEs of the array
1859 target types are set to the number of bits in each element, and the
1860 type length is set appropriately. */
1862 static struct value
*
1863 decode_packed_array (struct value
*arr
)
1867 arr
= ada_coerce_ref (arr
);
1868 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1869 arr
= ada_value_ind (arr
);
1871 type
= decode_packed_array_type (value_type (arr
));
1874 error (_("can't unpack array"));
1878 if (BITS_BIG_ENDIAN
&& ada_is_modular_type (value_type (arr
)))
1880 /* This is a (right-justified) modular type representing a packed
1881 array with no wrapper. In order to interpret the value through
1882 the (left-justified) packed array type we just built, we must
1883 first left-justify it. */
1884 int bit_size
, bit_pos
;
1887 mod
= ada_modulus (value_type (arr
)) - 1;
1894 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1895 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1896 bit_pos
/ HOST_CHAR_BIT
,
1897 bit_pos
% HOST_CHAR_BIT
,
1902 return coerce_unspec_val_to_type (arr
, type
);
1906 /* The value of the element of packed array ARR at the ARITY indices
1907 given in IND. ARR must be a simple array. */
1909 static struct value
*
1910 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1913 int bits
, elt_off
, bit_off
;
1914 long elt_total_bit_offset
;
1915 struct type
*elt_type
;
1919 elt_total_bit_offset
= 0;
1920 elt_type
= ada_check_typedef (value_type (arr
));
1921 for (i
= 0; i
< arity
; i
+= 1)
1923 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1924 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1926 (_("attempt to do packed indexing of something other than a packed array"));
1929 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1930 LONGEST lowerbound
, upperbound
;
1933 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1935 lim_warning (_("don't know bounds of array"));
1936 lowerbound
= upperbound
= 0;
1939 idx
= value_as_long (value_pos_atr (ind
[i
]));
1940 if (idx
< lowerbound
|| idx
> upperbound
)
1941 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1942 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1943 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1944 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1947 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1948 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1950 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1955 /* Non-zero iff TYPE includes negative integer values. */
1958 has_negatives (struct type
*type
)
1960 switch (TYPE_CODE (type
))
1965 return !TYPE_UNSIGNED (type
);
1966 case TYPE_CODE_RANGE
:
1967 return TYPE_LOW_BOUND (type
) < 0;
1972 /* Create a new value of type TYPE from the contents of OBJ starting
1973 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1974 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1975 assigning through the result will set the field fetched from.
1976 VALADDR is ignored unless OBJ is NULL, in which case,
1977 VALADDR+OFFSET must address the start of storage containing the
1978 packed value. The value returned in this case is never an lval.
1979 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1982 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1983 long offset
, int bit_offset
, int bit_size
,
1987 int src
, /* Index into the source area */
1988 targ
, /* Index into the target area */
1989 srcBitsLeft
, /* Number of source bits left to move */
1990 nsrc
, ntarg
, /* Number of source and target bytes */
1991 unusedLS
, /* Number of bits in next significant
1992 byte of source that are unused */
1993 accumSize
; /* Number of meaningful bits in accum */
1994 unsigned char *bytes
; /* First byte containing data to unpack */
1995 unsigned char *unpacked
;
1996 unsigned long accum
; /* Staging area for bits being transferred */
1998 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1999 /* Transmit bytes from least to most significant; delta is the direction
2000 the indices move. */
2001 int delta
= BITS_BIG_ENDIAN
? -1 : 1;
2003 type
= ada_check_typedef (type
);
2007 v
= allocate_value (type
);
2008 bytes
= (unsigned char *) (valaddr
+ offset
);
2010 else if (value_lazy (obj
))
2013 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
2014 bytes
= (unsigned char *) alloca (len
);
2015 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
2019 v
= allocate_value (type
);
2020 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2025 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
2026 if (VALUE_LVAL (obj
) == lval_internalvar
)
2027 VALUE_LVAL (v
) = lval_internalvar_component
;
2028 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
2029 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2030 set_value_bitsize (v
, bit_size
);
2031 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2033 VALUE_ADDRESS (v
) += 1;
2034 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2038 set_value_bitsize (v
, bit_size
);
2039 unpacked
= (unsigned char *) value_contents (v
);
2041 srcBitsLeft
= bit_size
;
2043 ntarg
= TYPE_LENGTH (type
);
2047 memset (unpacked
, 0, TYPE_LENGTH (type
));
2050 else if (BITS_BIG_ENDIAN
)
2053 if (has_negatives (type
)
2054 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2058 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2061 switch (TYPE_CODE (type
))
2063 case TYPE_CODE_ARRAY
:
2064 case TYPE_CODE_UNION
:
2065 case TYPE_CODE_STRUCT
:
2066 /* Non-scalar values must be aligned at a byte boundary... */
2068 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2069 /* ... And are placed at the beginning (most-significant) bytes
2071 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2075 targ
= TYPE_LENGTH (type
) - 1;
2081 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2084 unusedLS
= bit_offset
;
2087 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2094 /* Mask for removing bits of the next source byte that are not
2095 part of the value. */
2096 unsigned int unusedMSMask
=
2097 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2099 /* Sign-extend bits for this byte. */
2100 unsigned int signMask
= sign
& ~unusedMSMask
;
2102 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2103 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2104 if (accumSize
>= HOST_CHAR_BIT
)
2106 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2107 accumSize
-= HOST_CHAR_BIT
;
2108 accum
>>= HOST_CHAR_BIT
;
2112 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2119 accum
|= sign
<< accumSize
;
2120 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2121 accumSize
-= HOST_CHAR_BIT
;
2122 accum
>>= HOST_CHAR_BIT
;
2130 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2131 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2134 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2135 int src_offset
, int n
)
2137 unsigned int accum
, mask
;
2138 int accum_bits
, chunk_size
;
2140 target
+= targ_offset
/ HOST_CHAR_BIT
;
2141 targ_offset
%= HOST_CHAR_BIT
;
2142 source
+= src_offset
/ HOST_CHAR_BIT
;
2143 src_offset
%= HOST_CHAR_BIT
;
2144 if (BITS_BIG_ENDIAN
)
2146 accum
= (unsigned char) *source
;
2148 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2153 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2154 accum_bits
+= HOST_CHAR_BIT
;
2156 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2159 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2160 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2163 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2165 accum_bits
-= chunk_size
;
2172 accum
= (unsigned char) *source
>> src_offset
;
2174 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2178 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2179 accum_bits
+= HOST_CHAR_BIT
;
2181 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2184 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2185 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2187 accum_bits
-= chunk_size
;
2188 accum
>>= chunk_size
;
2195 /* Store the contents of FROMVAL into the location of TOVAL.
2196 Return a new value with the location of TOVAL and contents of
2197 FROMVAL. Handles assignment into packed fields that have
2198 floating-point or non-scalar types. */
2200 static struct value
*
2201 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2203 struct type
*type
= value_type (toval
);
2204 int bits
= value_bitsize (toval
);
2206 toval
= ada_coerce_ref (toval
);
2207 fromval
= ada_coerce_ref (fromval
);
2209 if (ada_is_direct_array_type (value_type (toval
)))
2210 toval
= ada_coerce_to_simple_array (toval
);
2211 if (ada_is_direct_array_type (value_type (fromval
)))
2212 fromval
= ada_coerce_to_simple_array (fromval
);
2214 if (!deprecated_value_modifiable (toval
))
2215 error (_("Left operand of assignment is not a modifiable lvalue."));
2217 if (VALUE_LVAL (toval
) == lval_memory
2219 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2220 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2222 int len
= (value_bitpos (toval
)
2223 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2224 char *buffer
= (char *) alloca (len
);
2226 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2228 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2229 fromval
= value_cast (type
, fromval
);
2231 read_memory (to_addr
, buffer
, len
);
2232 if (BITS_BIG_ENDIAN
)
2233 move_bits (buffer
, value_bitpos (toval
),
2234 value_contents (fromval
),
2235 TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
-
2238 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2240 write_memory (to_addr
, buffer
, len
);
2241 if (deprecated_memory_changed_hook
)
2242 deprecated_memory_changed_hook (to_addr
, len
);
2244 val
= value_copy (toval
);
2245 memcpy (value_contents_raw (val
), value_contents (fromval
),
2246 TYPE_LENGTH (type
));
2247 deprecated_set_value_type (val
, type
);
2252 return value_assign (toval
, fromval
);
2256 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2257 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2258 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2259 * COMPONENT, and not the inferior's memory. The current contents
2260 * of COMPONENT are ignored. */
2262 value_assign_to_component (struct value
*container
, struct value
*component
,
2265 LONGEST offset_in_container
=
2266 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2267 - VALUE_ADDRESS (container
) - value_offset (container
));
2268 int bit_offset_in_container
=
2269 value_bitpos (component
) - value_bitpos (container
);
2272 val
= value_cast (value_type (component
), val
);
2274 if (value_bitsize (component
) == 0)
2275 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2277 bits
= value_bitsize (component
);
2279 if (BITS_BIG_ENDIAN
)
2280 move_bits (value_contents_writeable (container
) + offset_in_container
,
2281 value_bitpos (container
) + bit_offset_in_container
,
2282 value_contents (val
),
2283 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2286 move_bits (value_contents_writeable (container
) + offset_in_container
,
2287 value_bitpos (container
) + bit_offset_in_container
,
2288 value_contents (val
), 0, bits
);
2291 /* The value of the element of array ARR at the ARITY indices given in IND.
2292 ARR may be either a simple array, GNAT array descriptor, or pointer
2296 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2300 struct type
*elt_type
;
2302 elt
= ada_coerce_to_simple_array (arr
);
2304 elt_type
= ada_check_typedef (value_type (elt
));
2305 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2306 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2307 return value_subscript_packed (elt
, arity
, ind
);
2309 for (k
= 0; k
< arity
; k
+= 1)
2311 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2312 error (_("too many subscripts (%d expected)"), k
);
2313 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2318 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2319 value of the element of *ARR at the ARITY indices given in
2320 IND. Does not read the entire array into memory. */
2323 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2328 for (k
= 0; k
< arity
; k
+= 1)
2333 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2334 error (_("too many subscripts (%d expected)"), k
);
2335 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2337 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2338 idx
= value_pos_atr (ind
[k
]);
2340 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2341 arr
= value_add (arr
, idx
);
2342 type
= TYPE_TARGET_TYPE (type
);
2345 return value_ind (arr
);
2348 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2349 actual type of ARRAY_PTR is ignored), returns a reference to
2350 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2351 bound of this array is LOW, as per Ada rules. */
2352 static struct value
*
2353 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2356 CORE_ADDR base
= value_as_address (array_ptr
)
2357 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2358 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2359 struct type
*index_type
=
2360 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2362 struct type
*slice_type
=
2363 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2364 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2368 static struct value
*
2369 ada_value_slice (struct value
*array
, int low
, int high
)
2371 struct type
*type
= value_type (array
);
2372 struct type
*index_type
=
2373 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2374 struct type
*slice_type
=
2375 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2376 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2379 /* If type is a record type in the form of a standard GNAT array
2380 descriptor, returns the number of dimensions for type. If arr is a
2381 simple array, returns the number of "array of"s that prefix its
2382 type designation. Otherwise, returns 0. */
2385 ada_array_arity (struct type
*type
)
2392 type
= desc_base_type (type
);
2395 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2396 return desc_arity (desc_bounds_type (type
));
2398 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2401 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2407 /* If TYPE is a record type in the form of a standard GNAT array
2408 descriptor or a simple array type, returns the element type for
2409 TYPE after indexing by NINDICES indices, or by all indices if
2410 NINDICES is -1. Otherwise, returns NULL. */
2413 ada_array_element_type (struct type
*type
, int nindices
)
2415 type
= desc_base_type (type
);
2417 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2420 struct type
*p_array_type
;
2422 p_array_type
= desc_data_type (type
);
2424 k
= ada_array_arity (type
);
2428 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2429 if (nindices
>= 0 && k
> nindices
)
2431 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2432 while (k
> 0 && p_array_type
!= NULL
)
2434 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2437 return p_array_type
;
2439 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2441 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2443 type
= TYPE_TARGET_TYPE (type
);
2452 /* The type of nth index in arrays of given type (n numbering from 1).
2453 Does not examine memory. */
2456 ada_index_type (struct type
*type
, int n
)
2458 struct type
*result_type
;
2460 type
= desc_base_type (type
);
2462 if (n
> ada_array_arity (type
))
2465 if (ada_is_simple_array_type (type
))
2469 for (i
= 1; i
< n
; i
+= 1)
2470 type
= TYPE_TARGET_TYPE (type
);
2471 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2472 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2473 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2474 perhaps stabsread.c would make more sense. */
2475 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2476 result_type
= builtin_type_int
;
2481 return desc_index_type (desc_bounds_type (type
), n
);
2484 /* Given that arr is an array type, returns the lower bound of the
2485 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2486 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2487 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2488 bounds type. It works for other arrays with bounds supplied by
2489 run-time quantities other than discriminants. */
2492 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2493 struct type
** typep
)
2496 struct type
*index_type_desc
;
2498 if (ada_is_packed_array_type (arr_type
))
2499 arr_type
= decode_packed_array_type (arr_type
);
2501 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2504 *typep
= builtin_type_int
;
2505 return (LONGEST
) - which
;
2508 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2509 type
= TYPE_TARGET_TYPE (arr_type
);
2513 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2514 if (index_type_desc
== NULL
)
2516 struct type
*index_type
;
2520 type
= TYPE_TARGET_TYPE (type
);
2524 index_type
= TYPE_INDEX_TYPE (type
);
2526 *typep
= index_type
;
2528 /* The index type is either a range type or an enumerated type.
2529 For the range type, we have some macros that allow us to
2530 extract the value of the low and high bounds. But they
2531 do now work for enumerated types. The expressions used
2532 below work for both range and enum types. */
2534 (LONGEST
) (which
== 0
2535 ? TYPE_FIELD_BITPOS (index_type
, 0)
2536 : TYPE_FIELD_BITPOS (index_type
,
2537 TYPE_NFIELDS (index_type
) - 1));
2541 struct type
*index_type
=
2542 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2543 NULL
, TYPE_OBJFILE (arr_type
));
2546 *typep
= index_type
;
2549 (LONGEST
) (which
== 0
2550 ? TYPE_LOW_BOUND (index_type
)
2551 : TYPE_HIGH_BOUND (index_type
));
2555 /* Given that arr is an array value, returns the lower bound of the
2556 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2557 WHICH is 1. This routine will also work for arrays with bounds
2558 supplied by run-time quantities other than discriminants. */
2561 ada_array_bound (struct value
*arr
, int n
, int which
)
2563 struct type
*arr_type
= value_type (arr
);
2565 if (ada_is_packed_array_type (arr_type
))
2566 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2567 else if (ada_is_simple_array_type (arr_type
))
2570 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2571 return value_from_longest (type
, v
);
2574 return desc_one_bound (desc_bounds (arr
), n
, which
);
2577 /* Given that arr is an array value, returns the length of the
2578 nth index. This routine will also work for arrays with bounds
2579 supplied by run-time quantities other than discriminants.
2580 Does not work for arrays indexed by enumeration types with representation
2581 clauses at the moment. */
2584 ada_array_length (struct value
*arr
, int n
)
2586 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2588 if (ada_is_packed_array_type (arr_type
))
2589 return ada_array_length (decode_packed_array (arr
), n
);
2591 if (ada_is_simple_array_type (arr_type
))
2595 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2596 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2597 return value_from_longest (type
, v
);
2601 value_from_longest (builtin_type_int
,
2602 value_as_long (desc_one_bound (desc_bounds (arr
),
2604 - value_as_long (desc_one_bound (desc_bounds (arr
),
2608 /* An empty array whose type is that of ARR_TYPE (an array type),
2609 with bounds LOW to LOW-1. */
2611 static struct value
*
2612 empty_array (struct type
*arr_type
, int low
)
2614 struct type
*index_type
=
2615 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2617 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2618 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2622 /* Name resolution */
2624 /* The "decoded" name for the user-definable Ada operator corresponding
2628 ada_decoded_op_name (enum exp_opcode op
)
2632 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2634 if (ada_opname_table
[i
].op
== op
)
2635 return ada_opname_table
[i
].decoded
;
2637 error (_("Could not find operator name for opcode"));
2641 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2642 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2643 undefined namespace) and converts operators that are
2644 user-defined into appropriate function calls. If CONTEXT_TYPE is
2645 non-null, it provides a preferred result type [at the moment, only
2646 type void has any effect---causing procedures to be preferred over
2647 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2648 return type is preferred. May change (expand) *EXP. */
2651 resolve (struct expression
**expp
, int void_context_p
)
2655 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2658 /* Resolve the operator of the subexpression beginning at
2659 position *POS of *EXPP. "Resolving" consists of replacing
2660 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2661 with their resolutions, replacing built-in operators with
2662 function calls to user-defined operators, where appropriate, and,
2663 when DEPROCEDURE_P is non-zero, converting function-valued variables
2664 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2665 are as in ada_resolve, above. */
2667 static struct value
*
2668 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2669 struct type
*context_type
)
2673 struct expression
*exp
; /* Convenience: == *expp. */
2674 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2675 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2676 int nargs
; /* Number of operands. */
2683 /* Pass one: resolve operands, saving their types and updating *pos,
2688 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2689 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2694 resolve_subexp (expp
, pos
, 0, NULL
);
2696 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2701 resolve_subexp (expp
, pos
, 0, NULL
);
2706 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2709 case OP_ATR_MODULUS
:
2719 case TERNOP_IN_RANGE
:
2720 case BINOP_IN_BOUNDS
:
2726 case OP_DISCRETE_RANGE
:
2728 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2737 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2739 resolve_subexp (expp
, pos
, 1, NULL
);
2741 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2758 case BINOP_LOGICAL_AND
:
2759 case BINOP_LOGICAL_OR
:
2760 case BINOP_BITWISE_AND
:
2761 case BINOP_BITWISE_IOR
:
2762 case BINOP_BITWISE_XOR
:
2765 case BINOP_NOTEQUAL
:
2772 case BINOP_SUBSCRIPT
:
2780 case UNOP_LOGICAL_NOT
:
2796 case OP_INTERNALVAR
:
2806 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2809 case STRUCTOP_STRUCT
:
2810 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2823 error (_("Unexpected operator during name resolution"));
2826 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2827 for (i
= 0; i
< nargs
; i
+= 1)
2828 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2832 /* Pass two: perform any resolution on principal operator. */
2839 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2841 struct ada_symbol_info
*candidates
;
2845 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2846 (exp
->elts
[pc
+ 2].symbol
),
2847 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2850 if (n_candidates
> 1)
2852 /* Types tend to get re-introduced locally, so if there
2853 are any local symbols that are not types, first filter
2856 for (j
= 0; j
< n_candidates
; j
+= 1)
2857 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2863 case LOC_REGPARM_ADDR
:
2867 case LOC_BASEREG_ARG
:
2869 case LOC_COMPUTED_ARG
:
2875 if (j
< n_candidates
)
2878 while (j
< n_candidates
)
2880 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2882 candidates
[j
] = candidates
[n_candidates
- 1];
2891 if (n_candidates
== 0)
2892 error (_("No definition found for %s"),
2893 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2894 else if (n_candidates
== 1)
2896 else if (deprocedure_p
2897 && !is_nonfunction (candidates
, n_candidates
))
2899 i
= ada_resolve_function
2900 (candidates
, n_candidates
, NULL
, 0,
2901 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2904 error (_("Could not find a match for %s"),
2905 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2909 printf_filtered (_("Multiple matches for %s\n"),
2910 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2911 user_select_syms (candidates
, n_candidates
, 1);
2915 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2916 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2917 if (innermost_block
== NULL
2918 || contained_in (candidates
[i
].block
, innermost_block
))
2919 innermost_block
= candidates
[i
].block
;
2923 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2926 replace_operator_with_call (expp
, pc
, 0, 0,
2927 exp
->elts
[pc
+ 2].symbol
,
2928 exp
->elts
[pc
+ 1].block
);
2935 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2936 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2938 struct ada_symbol_info
*candidates
;
2942 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2943 (exp
->elts
[pc
+ 5].symbol
),
2944 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2946 if (n_candidates
== 1)
2950 i
= ada_resolve_function
2951 (candidates
, n_candidates
,
2953 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2956 error (_("Could not find a match for %s"),
2957 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2960 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2961 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2962 if (innermost_block
== NULL
2963 || contained_in (candidates
[i
].block
, innermost_block
))
2964 innermost_block
= candidates
[i
].block
;
2975 case BINOP_BITWISE_AND
:
2976 case BINOP_BITWISE_IOR
:
2977 case BINOP_BITWISE_XOR
:
2979 case BINOP_NOTEQUAL
:
2987 case UNOP_LOGICAL_NOT
:
2989 if (possible_user_operator_p (op
, argvec
))
2991 struct ada_symbol_info
*candidates
;
2995 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2996 (struct block
*) NULL
, VAR_DOMAIN
,
2998 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2999 ada_decoded_op_name (op
), NULL
);
3003 replace_operator_with_call (expp
, pc
, nargs
, 1,
3004 candidates
[i
].sym
, candidates
[i
].block
);
3015 return evaluate_subexp_type (exp
, pos
);
3018 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3019 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3020 a non-pointer. A type of 'void' (which is never a valid expression type)
3021 by convention matches anything. */
3022 /* The term "match" here is rather loose. The match is heuristic and
3023 liberal. FIXME: TOO liberal, in fact. */
3026 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3028 ftype
= ada_check_typedef (ftype
);
3029 atype
= ada_check_typedef (atype
);
3031 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3032 ftype
= TYPE_TARGET_TYPE (ftype
);
3033 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3034 atype
= TYPE_TARGET_TYPE (atype
);
3036 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3037 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3040 switch (TYPE_CODE (ftype
))
3045 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3046 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3047 TYPE_TARGET_TYPE (atype
), 0);
3050 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3052 case TYPE_CODE_ENUM
:
3053 case TYPE_CODE_RANGE
:
3054 switch (TYPE_CODE (atype
))
3057 case TYPE_CODE_ENUM
:
3058 case TYPE_CODE_RANGE
:
3064 case TYPE_CODE_ARRAY
:
3065 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3066 || ada_is_array_descriptor_type (atype
));
3068 case TYPE_CODE_STRUCT
:
3069 if (ada_is_array_descriptor_type (ftype
))
3070 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3071 || ada_is_array_descriptor_type (atype
));
3073 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3074 && !ada_is_array_descriptor_type (atype
));
3076 case TYPE_CODE_UNION
:
3078 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3082 /* Return non-zero if the formals of FUNC "sufficiently match" the
3083 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3084 may also be an enumeral, in which case it is treated as a 0-
3085 argument function. */
3088 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3091 struct type
*func_type
= SYMBOL_TYPE (func
);
3093 if (SYMBOL_CLASS (func
) == LOC_CONST
3094 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3095 return (n_actuals
== 0);
3096 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3099 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3102 for (i
= 0; i
< n_actuals
; i
+= 1)
3104 if (actuals
[i
] == NULL
)
3108 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3109 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3111 if (!ada_type_match (ftype
, atype
, 1))
3118 /* False iff function type FUNC_TYPE definitely does not produce a value
3119 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3120 FUNC_TYPE is not a valid function type with a non-null return type
3121 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3124 return_match (struct type
*func_type
, struct type
*context_type
)
3126 struct type
*return_type
;
3128 if (func_type
== NULL
)
3131 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3132 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3134 return_type
= base_type (func_type
);
3135 if (return_type
== NULL
)
3138 context_type
= base_type (context_type
);
3140 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3141 return context_type
== NULL
|| return_type
== context_type
;
3142 else if (context_type
== NULL
)
3143 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3145 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3149 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3150 function (if any) that matches the types of the NARGS arguments in
3151 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3152 that returns that type, then eliminate matches that don't. If
3153 CONTEXT_TYPE is void and there is at least one match that does not
3154 return void, eliminate all matches that do.
3156 Asks the user if there is more than one match remaining. Returns -1
3157 if there is no such symbol or none is selected. NAME is used
3158 solely for messages. May re-arrange and modify SYMS in
3159 the process; the index returned is for the modified vector. */
3162 ada_resolve_function (struct ada_symbol_info syms
[],
3163 int nsyms
, struct value
**args
, int nargs
,
3164 const char *name
, struct type
*context_type
)
3167 int m
; /* Number of hits */
3168 struct type
*fallback
;
3169 struct type
*return_type
;
3171 return_type
= context_type
;
3172 if (context_type
== NULL
)
3173 fallback
= builtin_type_void
;
3180 for (k
= 0; k
< nsyms
; k
+= 1)
3182 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3184 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3185 && return_match (type
, return_type
))
3191 if (m
> 0 || return_type
== fallback
)
3194 return_type
= fallback
;
3201 printf_filtered (_("Multiple matches for %s\n"), name
);
3202 user_select_syms (syms
, m
, 1);
3208 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3209 in a listing of choices during disambiguation (see sort_choices, below).
3210 The idea is that overloadings of a subprogram name from the
3211 same package should sort in their source order. We settle for ordering
3212 such symbols by their trailing number (__N or $N). */
3215 encoded_ordered_before (char *N0
, char *N1
)
3219 else if (N0
== NULL
)
3224 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3226 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3228 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3229 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3233 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3236 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3238 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3239 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3241 return (strcmp (N0
, N1
) < 0);
3245 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3249 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3252 for (i
= 1; i
< nsyms
; i
+= 1)
3254 struct ada_symbol_info sym
= syms
[i
];
3257 for (j
= i
- 1; j
>= 0; j
-= 1)
3259 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3260 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3262 syms
[j
+ 1] = syms
[j
];
3268 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3269 by asking the user (if necessary), returning the number selected,
3270 and setting the first elements of SYMS items. Error if no symbols
3273 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3274 to be re-integrated one of these days. */
3277 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3280 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3282 int first_choice
= (max_results
== 1) ? 1 : 2;
3284 if (max_results
< 1)
3285 error (_("Request to select 0 symbols!"));
3289 printf_unfiltered (_("[0] cancel\n"));
3290 if (max_results
> 1)
3291 printf_unfiltered (_("[1] all\n"));
3293 sort_choices (syms
, nsyms
);
3295 for (i
= 0; i
< nsyms
; i
+= 1)
3297 if (syms
[i
].sym
== NULL
)
3300 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3302 struct symtab_and_line sal
=
3303 find_function_start_sal (syms
[i
].sym
, 1);
3304 if (sal
.symtab
== NULL
)
3305 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3307 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3310 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3311 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3312 sal
.symtab
->filename
, sal
.line
);
3318 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3319 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3320 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3321 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3323 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3324 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3326 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3327 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3328 else if (is_enumeral
3329 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3331 printf_unfiltered (("[%d] "), i
+ first_choice
);
3332 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3334 printf_unfiltered (_("'(%s) (enumeral)\n"),
3335 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3337 else if (symtab
!= NULL
)
3338 printf_unfiltered (is_enumeral
3339 ? _("[%d] %s in %s (enumeral)\n")
3340 : _("[%d] %s at %s:?\n"),
3342 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3345 printf_unfiltered (is_enumeral
3346 ? _("[%d] %s (enumeral)\n")
3347 : _("[%d] %s at ?\n"),
3349 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3353 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3356 for (i
= 0; i
< n_chosen
; i
+= 1)
3357 syms
[i
] = syms
[chosen
[i
]];
3362 /* Read and validate a set of numeric choices from the user in the
3363 range 0 .. N_CHOICES-1. Place the results in increasing
3364 order in CHOICES[0 .. N-1], and return N.
3366 The user types choices as a sequence of numbers on one line
3367 separated by blanks, encoding them as follows:
3369 + A choice of 0 means to cancel the selection, throwing an error.
3370 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3371 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3373 The user is not allowed to choose more than MAX_RESULTS values.
3375 ANNOTATION_SUFFIX, if present, is used to annotate the input
3376 prompts (for use with the -f switch). */
3379 get_selections (int *choices
, int n_choices
, int max_results
,
3380 int is_all_choice
, char *annotation_suffix
)
3385 int first_choice
= is_all_choice
? 2 : 1;
3387 prompt
= getenv ("PS2");
3391 printf_unfiltered (("%s "), prompt
);
3392 gdb_flush (gdb_stdout
);
3394 args
= command_line_input ((char *) NULL
, 0, annotation_suffix
);
3397 error_no_arg (_("one or more choice numbers"));
3401 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3402 order, as given in args. Choices are validated. */
3408 while (isspace (*args
))
3410 if (*args
== '\0' && n_chosen
== 0)
3411 error_no_arg (_("one or more choice numbers"));
3412 else if (*args
== '\0')
3415 choice
= strtol (args
, &args2
, 10);
3416 if (args
== args2
|| choice
< 0
3417 || choice
> n_choices
+ first_choice
- 1)
3418 error (_("Argument must be choice number"));
3422 error (_("cancelled"));
3424 if (choice
< first_choice
)
3426 n_chosen
= n_choices
;
3427 for (j
= 0; j
< n_choices
; j
+= 1)
3431 choice
-= first_choice
;
3433 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3437 if (j
< 0 || choice
!= choices
[j
])
3440 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3441 choices
[k
+ 1] = choices
[k
];
3442 choices
[j
+ 1] = choice
;
3447 if (n_chosen
> max_results
)
3448 error (_("Select no more than %d of the above"), max_results
);
3453 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3454 on the function identified by SYM and BLOCK, and taking NARGS
3455 arguments. Update *EXPP as needed to hold more space. */
3458 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3459 int oplen
, struct symbol
*sym
,
3460 struct block
*block
)
3462 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3463 symbol, -oplen for operator being replaced). */
3464 struct expression
*newexp
= (struct expression
*)
3465 xmalloc (sizeof (struct expression
)
3466 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3467 struct expression
*exp
= *expp
;
3469 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3470 newexp
->language_defn
= exp
->language_defn
;
3471 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3472 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3473 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3475 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3476 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3478 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3479 newexp
->elts
[pc
+ 4].block
= block
;
3480 newexp
->elts
[pc
+ 5].symbol
= sym
;
3486 /* Type-class predicates */
3488 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3492 numeric_type_p (struct type
*type
)
3498 switch (TYPE_CODE (type
))
3503 case TYPE_CODE_RANGE
:
3504 return (type
== TYPE_TARGET_TYPE (type
)
3505 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3512 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3515 integer_type_p (struct type
*type
)
3521 switch (TYPE_CODE (type
))
3525 case TYPE_CODE_RANGE
:
3526 return (type
== TYPE_TARGET_TYPE (type
)
3527 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3534 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3537 scalar_type_p (struct type
*type
)
3543 switch (TYPE_CODE (type
))
3546 case TYPE_CODE_RANGE
:
3547 case TYPE_CODE_ENUM
:
3556 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3559 discrete_type_p (struct type
*type
)
3565 switch (TYPE_CODE (type
))
3568 case TYPE_CODE_RANGE
:
3569 case TYPE_CODE_ENUM
:
3577 /* Returns non-zero if OP with operands in the vector ARGS could be
3578 a user-defined function. Errs on the side of pre-defined operators
3579 (i.e., result 0). */
3582 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3584 struct type
*type0
=
3585 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3586 struct type
*type1
=
3587 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3601 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3605 case BINOP_BITWISE_AND
:
3606 case BINOP_BITWISE_IOR
:
3607 case BINOP_BITWISE_XOR
:
3608 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3611 case BINOP_NOTEQUAL
:
3616 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3619 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3622 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3626 case UNOP_LOGICAL_NOT
:
3628 return (!numeric_type_p (type0
));
3637 1. In the following, we assume that a renaming type's name may
3638 have an ___XD suffix. It would be nice if this went away at some
3640 2. We handle both the (old) purely type-based representation of
3641 renamings and the (new) variable-based encoding. At some point,
3642 it is devoutly to be hoped that the former goes away
3643 (FIXME: hilfinger-2007-07-09).
3644 3. Subprogram renamings are not implemented, although the XRS
3645 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3647 /* If SYM encodes a renaming,
3649 <renaming> renames <renamed entity>,
3651 sets *LEN to the length of the renamed entity's name,
3652 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3653 the string describing the subcomponent selected from the renamed
3654 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3655 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3656 are undefined). Otherwise, returns a value indicating the category
3657 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3658 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3659 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3660 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3661 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3662 may be NULL, in which case they are not assigned.
3664 [Currently, however, GCC does not generate subprogram renamings.] */
3666 enum ada_renaming_category
3667 ada_parse_renaming (struct symbol
*sym
,
3668 const char **renamed_entity
, int *len
,
3669 const char **renaming_expr
)
3671 enum ada_renaming_category kind
;
3676 return ADA_NOT_RENAMING
;
3677 switch (SYMBOL_CLASS (sym
))
3680 return ADA_NOT_RENAMING
;
3682 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3683 renamed_entity
, len
, renaming_expr
);
3687 case LOC_OPTIMIZED_OUT
:
3688 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3690 return ADA_NOT_RENAMING
;
3694 kind
= ADA_OBJECT_RENAMING
;
3698 kind
= ADA_EXCEPTION_RENAMING
;
3702 kind
= ADA_PACKAGE_RENAMING
;
3706 kind
= ADA_SUBPROGRAM_RENAMING
;
3710 return ADA_NOT_RENAMING
;
3714 if (renamed_entity
!= NULL
)
3715 *renamed_entity
= info
;
3716 suffix
= strstr (info
, "___XE");
3717 if (suffix
== NULL
|| suffix
== info
)
3718 return ADA_NOT_RENAMING
;
3720 *len
= strlen (info
) - strlen (suffix
);
3722 if (renaming_expr
!= NULL
)
3723 *renaming_expr
= suffix
;
3727 /* Assuming TYPE encodes a renaming according to the old encoding in
3728 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3729 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3730 ADA_NOT_RENAMING otherwise. */
3731 static enum ada_renaming_category
3732 parse_old_style_renaming (struct type
*type
,
3733 const char **renamed_entity
, int *len
,
3734 const char **renaming_expr
)
3736 enum ada_renaming_category kind
;
3741 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3742 || TYPE_NFIELDS (type
) != 1)
3743 return ADA_NOT_RENAMING
;
3745 name
= type_name_no_tag (type
);
3747 return ADA_NOT_RENAMING
;
3749 name
= strstr (name
, "___XR");
3751 return ADA_NOT_RENAMING
;
3756 kind
= ADA_OBJECT_RENAMING
;
3759 kind
= ADA_EXCEPTION_RENAMING
;
3762 kind
= ADA_PACKAGE_RENAMING
;
3765 kind
= ADA_SUBPROGRAM_RENAMING
;
3768 return ADA_NOT_RENAMING
;
3771 info
= TYPE_FIELD_NAME (type
, 0);
3773 return ADA_NOT_RENAMING
;
3774 if (renamed_entity
!= NULL
)
3775 *renamed_entity
= info
;
3776 suffix
= strstr (info
, "___XE");
3777 if (renaming_expr
!= NULL
)
3778 *renaming_expr
= suffix
+ 5;
3779 if (suffix
== NULL
|| suffix
== info
)
3780 return ADA_NOT_RENAMING
;
3782 *len
= suffix
- info
;
3788 /* Evaluation: Function Calls */
3790 /* Return an lvalue containing the value VAL. This is the identity on
3791 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3792 on the stack, using and updating *SP as the stack pointer, and
3793 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3795 static struct value
*
3796 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3798 if (! VALUE_LVAL (val
))
3800 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3802 /* The following is taken from the structure-return code in
3803 call_function_by_hand. FIXME: Therefore, some refactoring seems
3805 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3807 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3808 reserving sufficient space. */
3810 if (gdbarch_frame_align_p (current_gdbarch
))
3811 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3812 VALUE_ADDRESS (val
) = *sp
;
3816 /* Stack grows upward. Align the frame, allocate space, and
3817 then again, re-align the frame. */
3818 if (gdbarch_frame_align_p (current_gdbarch
))
3819 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3820 VALUE_ADDRESS (val
) = *sp
;
3822 if (gdbarch_frame_align_p (current_gdbarch
))
3823 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3826 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3832 /* Return the value ACTUAL, converted to be an appropriate value for a
3833 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3834 allocating any necessary descriptors (fat pointers), or copies of
3835 values not residing in memory, updating it as needed. */
3837 static struct value
*
3838 convert_actual (struct value
*actual
, struct type
*formal_type0
,
3841 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3842 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3843 struct type
*formal_target
=
3844 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3845 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3846 struct type
*actual_target
=
3847 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3848 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3850 if (ada_is_array_descriptor_type (formal_target
)
3851 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3852 return make_array_descriptor (formal_type
, actual
, sp
);
3853 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
)
3855 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3856 && ada_is_array_descriptor_type (actual_target
))
3857 return desc_data (actual
);
3858 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3860 if (VALUE_LVAL (actual
) != lval_memory
)
3863 actual_type
= ada_check_typedef (value_type (actual
));
3864 val
= allocate_value (actual_type
);
3865 memcpy ((char *) value_contents_raw (val
),
3866 (char *) value_contents (actual
),
3867 TYPE_LENGTH (actual_type
));
3868 actual
= ensure_lval (val
, sp
);
3870 return value_addr (actual
);
3873 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3874 return ada_value_ind (actual
);
3880 /* Push a descriptor of type TYPE for array value ARR on the stack at
3881 *SP, updating *SP to reflect the new descriptor. Return either
3882 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3883 to-descriptor type rather than a descriptor type), a struct value *
3884 representing a pointer to this descriptor. */
3886 static struct value
*
3887 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3889 struct type
*bounds_type
= desc_bounds_type (type
);
3890 struct type
*desc_type
= desc_base_type (type
);
3891 struct value
*descriptor
= allocate_value (desc_type
);
3892 struct value
*bounds
= allocate_value (bounds_type
);
3895 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3897 modify_general_field (value_contents_writeable (bounds
),
3898 value_as_long (ada_array_bound (arr
, i
, 0)),
3899 desc_bound_bitpos (bounds_type
, i
, 0),
3900 desc_bound_bitsize (bounds_type
, i
, 0));
3901 modify_general_field (value_contents_writeable (bounds
),
3902 value_as_long (ada_array_bound (arr
, i
, 1)),
3903 desc_bound_bitpos (bounds_type
, i
, 1),
3904 desc_bound_bitsize (bounds_type
, i
, 1));
3907 bounds
= ensure_lval (bounds
, sp
);
3909 modify_general_field (value_contents_writeable (descriptor
),
3910 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3911 fat_pntr_data_bitpos (desc_type
),
3912 fat_pntr_data_bitsize (desc_type
));
3914 modify_general_field (value_contents_writeable (descriptor
),
3915 VALUE_ADDRESS (bounds
),
3916 fat_pntr_bounds_bitpos (desc_type
),
3917 fat_pntr_bounds_bitsize (desc_type
));
3919 descriptor
= ensure_lval (descriptor
, sp
);
3921 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3922 return value_addr (descriptor
);
3928 /* Assuming a dummy frame has been established on the target, perform any
3929 conversions needed for calling function FUNC on the NARGS actual
3930 parameters in ARGS, other than standard C conversions. Does
3931 nothing if FUNC does not have Ada-style prototype data, or if NARGS
3932 does not match the number of arguments expected. Use *SP as a
3933 stack pointer for additional data that must be pushed, updating its
3937 ada_convert_actuals (struct value
*func
, int nargs
, struct value
*args
[],
3942 if (TYPE_NFIELDS (value_type (func
)) == 0
3943 || nargs
!= TYPE_NFIELDS (value_type (func
)))
3946 for (i
= 0; i
< nargs
; i
+= 1)
3948 convert_actual (args
[i
], TYPE_FIELD_TYPE (value_type (func
), i
), sp
);
3951 /* Dummy definitions for an experimental caching module that is not
3952 * used in the public sources. */
3955 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3956 struct symbol
**sym
, struct block
**block
,
3957 struct symtab
**symtab
)
3963 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3964 struct block
*block
, struct symtab
*symtab
)
3970 /* Return the result of a standard (literal, C-like) lookup of NAME in
3971 given DOMAIN, visible from lexical block BLOCK. */
3973 static struct symbol
*
3974 standard_lookup (const char *name
, const struct block
*block
,
3978 struct symtab
*symtab
;
3980 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
, NULL
))
3983 lookup_symbol_in_language (name
, block
, domain
, language_c
, 0, &symtab
);
3984 cache_symbol (name
, domain
, sym
, block_found
, symtab
);
3989 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3990 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3991 since they contend in overloading in the same way. */
3993 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3997 for (i
= 0; i
< n
; i
+= 1)
3998 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3999 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4000 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4006 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4007 struct types. Otherwise, they may not. */
4010 equiv_types (struct type
*type0
, struct type
*type1
)
4014 if (type0
== NULL
|| type1
== NULL
4015 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4017 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4018 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4019 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4020 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4026 /* True iff SYM0 represents the same entity as SYM1, or one that is
4027 no more defined than that of SYM1. */
4030 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4034 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4035 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4038 switch (SYMBOL_CLASS (sym0
))
4044 struct type
*type0
= SYMBOL_TYPE (sym0
);
4045 struct type
*type1
= SYMBOL_TYPE (sym1
);
4046 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4047 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4048 int len0
= strlen (name0
);
4050 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4051 && (equiv_types (type0
, type1
)
4052 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4053 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4056 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4057 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4063 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4064 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4067 add_defn_to_vec (struct obstack
*obstackp
,
4069 struct block
*block
, struct symtab
*symtab
)
4073 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4075 /* Do not try to complete stub types, as the debugger is probably
4076 already scanning all symbols matching a certain name at the
4077 time when this function is called. Trying to replace the stub
4078 type by its associated full type will cause us to restart a scan
4079 which may lead to an infinite recursion. Instead, the client
4080 collecting the matching symbols will end up collecting several
4081 matches, with at least one of them complete. It can then filter
4082 out the stub ones if needed. */
4084 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4086 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4088 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4090 prevDefns
[i
].sym
= sym
;
4091 prevDefns
[i
].block
= block
;
4092 prevDefns
[i
].symtab
= symtab
;
4098 struct ada_symbol_info info
;
4102 info
.symtab
= symtab
;
4103 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4107 /* Number of ada_symbol_info structures currently collected in
4108 current vector in *OBSTACKP. */
4111 num_defns_collected (struct obstack
*obstackp
)
4113 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4116 /* Vector of ada_symbol_info structures currently collected in current
4117 vector in *OBSTACKP. If FINISH, close off the vector and return
4118 its final address. */
4120 static struct ada_symbol_info
*
4121 defns_collected (struct obstack
*obstackp
, int finish
)
4124 return obstack_finish (obstackp
);
4126 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4129 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4130 Check the global symbols if GLOBAL, the static symbols if not.
4131 Do wild-card match if WILD. */
4133 static struct partial_symbol
*
4134 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4135 int global
, domain_enum
namespace, int wild
)
4137 struct partial_symbol
**start
;
4138 int name_len
= strlen (name
);
4139 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4148 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4149 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4153 for (i
= 0; i
< length
; i
+= 1)
4155 struct partial_symbol
*psym
= start
[i
];
4157 if (SYMBOL_DOMAIN (psym
) == namespace
4158 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4172 int M
= (U
+ i
) >> 1;
4173 struct partial_symbol
*psym
= start
[M
];
4174 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4176 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4178 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4189 struct partial_symbol
*psym
= start
[i
];
4191 if (SYMBOL_DOMAIN (psym
) == namespace)
4193 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4201 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4215 int M
= (U
+ i
) >> 1;
4216 struct partial_symbol
*psym
= start
[M
];
4217 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4219 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4221 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4232 struct partial_symbol
*psym
= start
[i
];
4234 if (SYMBOL_DOMAIN (psym
) == namespace)
4238 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4241 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4243 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4253 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4263 /* Find a symbol table containing symbol SYM or NULL if none. */
4265 static struct symtab
*
4266 symtab_for_sym (struct symbol
*sym
)
4269 struct objfile
*objfile
;
4271 struct symbol
*tmp_sym
;
4272 struct dict_iterator iter
;
4275 ALL_PRIMARY_SYMTABS (objfile
, s
)
4277 switch (SYMBOL_CLASS (sym
))
4285 case LOC_CONST_BYTES
:
4286 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4287 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4289 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4290 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4296 switch (SYMBOL_CLASS (sym
))
4302 case LOC_REGPARM_ADDR
:
4307 case LOC_BASEREG_ARG
:
4309 case LOC_COMPUTED_ARG
:
4310 for (j
= FIRST_LOCAL_BLOCK
;
4311 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4313 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4314 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4325 /* Return a minimal symbol matching NAME according to Ada decoding
4326 rules. Returns NULL if there is no such minimal symbol. Names
4327 prefixed with "standard__" are handled specially: "standard__" is
4328 first stripped off, and only static and global symbols are searched. */
4330 struct minimal_symbol
*
4331 ada_lookup_simple_minsym (const char *name
)
4333 struct objfile
*objfile
;
4334 struct minimal_symbol
*msymbol
;
4337 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4339 name
+= sizeof ("standard__") - 1;
4343 wild_match
= (strstr (name
, "__") == NULL
);
4345 ALL_MSYMBOLS (objfile
, msymbol
)
4347 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4348 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4355 /* For all subprograms that statically enclose the subprogram of the
4356 selected frame, add symbols matching identifier NAME in DOMAIN
4357 and their blocks to the list of data in OBSTACKP, as for
4358 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4362 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4363 const char *name
, domain_enum
namespace,
4368 /* True if TYPE is definitely an artificial type supplied to a symbol
4369 for which no debugging information was given in the symbol file. */
4372 is_nondebugging_type (struct type
*type
)
4374 char *name
= ada_type_name (type
);
4375 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4378 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4379 duplicate other symbols in the list (The only case I know of where
4380 this happens is when object files containing stabs-in-ecoff are
4381 linked with files containing ordinary ecoff debugging symbols (or no
4382 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4383 Returns the number of items in the modified list. */
4386 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4393 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4394 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4395 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4397 for (j
= 0; j
< nsyms
; j
+= 1)
4400 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4401 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4402 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4403 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4404 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4405 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4408 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4409 syms
[k
- 1] = syms
[k
];
4422 /* Given a type that corresponds to a renaming entity, use the type name
4423 to extract the scope (package name or function name, fully qualified,
4424 and following the GNAT encoding convention) where this renaming has been
4425 defined. The string returned needs to be deallocated after use. */
4428 xget_renaming_scope (struct type
*renaming_type
)
4430 /* The renaming types adhere to the following convention:
4431 <scope>__<rename>___<XR extension>.
4432 So, to extract the scope, we search for the "___XR" extension,
4433 and then backtrack until we find the first "__". */
4435 const char *name
= type_name_no_tag (renaming_type
);
4436 char *suffix
= strstr (name
, "___XR");
4441 /* Now, backtrack a bit until we find the first "__". Start looking
4442 at suffix - 3, as the <rename> part is at least one character long. */
4444 for (last
= suffix
- 3; last
> name
; last
--)
4445 if (last
[0] == '_' && last
[1] == '_')
4448 /* Make a copy of scope and return it. */
4450 scope_len
= last
- name
;
4451 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4453 strncpy (scope
, name
, scope_len
);
4454 scope
[scope_len
] = '\0';
4459 /* Return nonzero if NAME corresponds to a package name. */
4462 is_package_name (const char *name
)
4464 /* Here, We take advantage of the fact that no symbols are generated
4465 for packages, while symbols are generated for each function.
4466 So the condition for NAME represent a package becomes equivalent
4467 to NAME not existing in our list of symbols. There is only one
4468 small complication with library-level functions (see below). */
4472 /* If it is a function that has not been defined at library level,
4473 then we should be able to look it up in the symbols. */
4474 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4477 /* Library-level function names start with "_ada_". See if function
4478 "_ada_" followed by NAME can be found. */
4480 /* Do a quick check that NAME does not contain "__", since library-level
4481 functions names cannot contain "__" in them. */
4482 if (strstr (name
, "__") != NULL
)
4485 fun_name
= xstrprintf ("_ada_%s", name
);
4487 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4490 /* Return nonzero if SYM corresponds to a renaming entity that is
4491 not visible from FUNCTION_NAME. */
4494 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4498 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4501 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4503 make_cleanup (xfree
, scope
);
4505 /* If the rename has been defined in a package, then it is visible. */
4506 if (is_package_name (scope
))
4509 /* Check that the rename is in the current function scope by checking
4510 that its name starts with SCOPE. */
4512 /* If the function name starts with "_ada_", it means that it is
4513 a library-level function. Strip this prefix before doing the
4514 comparison, as the encoding for the renaming does not contain
4516 if (strncmp (function_name
, "_ada_", 5) == 0)
4519 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4522 /* Remove entries from SYMS that corresponds to a renaming entity that
4523 is not visible from the function associated with CURRENT_BLOCK or
4524 that is superfluous due to the presence of more specific renaming
4525 information. Places surviving symbols in the initial entries of
4526 SYMS and returns the number of surviving symbols.
4529 First, in cases where an object renaming is implemented as a
4530 reference variable, GNAT may produce both the actual reference
4531 variable and the renaming encoding. In this case, we discard the
4534 Second, GNAT emits a type following a specified encoding for each renaming
4535 entity. Unfortunately, STABS currently does not support the definition
4536 of types that are local to a given lexical block, so all renamings types
4537 are emitted at library level. As a consequence, if an application
4538 contains two renaming entities using the same name, and a user tries to
4539 print the value of one of these entities, the result of the ada symbol
4540 lookup will also contain the wrong renaming type.
4542 This function partially covers for this limitation by attempting to
4543 remove from the SYMS list renaming symbols that should be visible
4544 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4545 method with the current information available. The implementation
4546 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4548 - When the user tries to print a rename in a function while there
4549 is another rename entity defined in a package: Normally, the
4550 rename in the function has precedence over the rename in the
4551 package, so the latter should be removed from the list. This is
4552 currently not the case.
4554 - This function will incorrectly remove valid renames if
4555 the CURRENT_BLOCK corresponds to a function which symbol name
4556 has been changed by an "Export" pragma. As a consequence,
4557 the user will be unable to print such rename entities. */
4560 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4561 int nsyms
, const struct block
*current_block
)
4563 struct symbol
*current_function
;
4564 char *current_function_name
;
4566 int is_new_style_renaming
;
4568 /* If there is both a renaming foo___XR... encoded as a variable and
4569 a simple variable foo in the same block, discard the latter.
4570 First, zero out such symbols, then compress. */
4571 is_new_style_renaming
= 0;
4572 for (i
= 0; i
< nsyms
; i
+= 1)
4574 struct symbol
*sym
= syms
[i
].sym
;
4575 struct block
*block
= syms
[i
].block
;
4579 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4581 name
= SYMBOL_LINKAGE_NAME (sym
);
4582 suffix
= strstr (name
, "___XR");
4586 int name_len
= suffix
- name
;
4588 is_new_style_renaming
= 1;
4589 for (j
= 0; j
< nsyms
; j
+= 1)
4590 if (i
!= j
&& syms
[j
].sym
!= NULL
4591 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4593 && block
== syms
[j
].block
)
4597 if (is_new_style_renaming
)
4601 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4602 if (syms
[j
].sym
!= NULL
)
4610 /* Extract the function name associated to CURRENT_BLOCK.
4611 Abort if unable to do so. */
4613 if (current_block
== NULL
)
4616 current_function
= block_function (current_block
);
4617 if (current_function
== NULL
)
4620 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4621 if (current_function_name
== NULL
)
4624 /* Check each of the symbols, and remove it from the list if it is
4625 a type corresponding to a renaming that is out of the scope of
4626 the current block. */
4631 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4632 == ADA_OBJECT_RENAMING
4633 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4636 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4637 syms
[j
- 1] = syms
[j
];
4647 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4648 scope and in global scopes, returning the number of matches. Sets
4649 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4650 indicating the symbols found and the blocks and symbol tables (if
4651 any) in which they were found. This vector are transient---good only to
4652 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4653 symbol match within the nest of blocks whose innermost member is BLOCK0,
4654 is the one match returned (no other matches in that or
4655 enclosing blocks is returned). If there are any matches in or
4656 surrounding BLOCK0, then these alone are returned. Otherwise, the
4657 search extends to global and file-scope (static) symbol tables.
4658 Names prefixed with "standard__" are handled specially: "standard__"
4659 is first stripped off, and only static and global symbols are searched. */
4662 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4663 domain_enum
namespace,
4664 struct ada_symbol_info
**results
)
4668 struct partial_symtab
*ps
;
4669 struct blockvector
*bv
;
4670 struct objfile
*objfile
;
4671 struct block
*block
;
4673 struct minimal_symbol
*msymbol
;
4679 obstack_free (&symbol_list_obstack
, NULL
);
4680 obstack_init (&symbol_list_obstack
);
4684 /* Search specified block and its superiors. */
4686 wild_match
= (strstr (name0
, "__") == NULL
);
4688 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4689 needed, but adding const will
4690 have a cascade effect. */
4691 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4695 name
= name0
+ sizeof ("standard__") - 1;
4699 while (block
!= NULL
)
4702 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4703 namespace, NULL
, NULL
, wild_match
);
4705 /* If we found a non-function match, assume that's the one. */
4706 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4707 num_defns_collected (&symbol_list_obstack
)))
4710 block
= BLOCK_SUPERBLOCK (block
);
4713 /* If no luck so far, try to find NAME as a local symbol in some lexically
4714 enclosing subprogram. */
4715 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4716 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4717 name
, namespace, wild_match
);
4719 /* If we found ANY matches among non-global symbols, we're done. */
4721 if (num_defns_collected (&symbol_list_obstack
) > 0)
4725 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
, &s
))
4728 add_defn_to_vec (&symbol_list_obstack
, sym
, block
, s
);
4732 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4733 tables, and psymtab's. */
4735 ALL_PRIMARY_SYMTABS (objfile
, s
)
4738 bv
= BLOCKVECTOR (s
);
4739 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4740 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4741 objfile
, s
, wild_match
);
4744 if (namespace == VAR_DOMAIN
)
4746 ALL_MSYMBOLS (objfile
, msymbol
)
4748 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4750 switch (MSYMBOL_TYPE (msymbol
))
4752 case mst_solib_trampoline
:
4755 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4758 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4760 bv
= BLOCKVECTOR (s
);
4761 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4762 ada_add_block_symbols (&symbol_list_obstack
, block
,
4763 SYMBOL_LINKAGE_NAME (msymbol
),
4764 namespace, objfile
, s
, wild_match
);
4766 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4768 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4769 ada_add_block_symbols (&symbol_list_obstack
, block
,
4770 SYMBOL_LINKAGE_NAME (msymbol
),
4771 namespace, objfile
, s
,
4780 ALL_PSYMTABS (objfile
, ps
)
4784 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4786 s
= PSYMTAB_TO_SYMTAB (ps
);
4789 bv
= BLOCKVECTOR (s
);
4790 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4791 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4792 namespace, objfile
, s
, wild_match
);
4796 /* Now add symbols from all per-file blocks if we've gotten no hits
4797 (Not strictly correct, but perhaps better than an error).
4798 Do the symtabs first, then check the psymtabs. */
4800 if (num_defns_collected (&symbol_list_obstack
) == 0)
4803 ALL_PRIMARY_SYMTABS (objfile
, s
)
4806 bv
= BLOCKVECTOR (s
);
4807 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4808 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4809 objfile
, s
, wild_match
);
4812 ALL_PSYMTABS (objfile
, ps
)
4816 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4818 s
= PSYMTAB_TO_SYMTAB (ps
);
4819 bv
= BLOCKVECTOR (s
);
4822 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4823 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4824 namespace, objfile
, s
, wild_match
);
4830 ndefns
= num_defns_collected (&symbol_list_obstack
);
4831 *results
= defns_collected (&symbol_list_obstack
, 1);
4833 ndefns
= remove_extra_symbols (*results
, ndefns
);
4836 cache_symbol (name0
, namespace, NULL
, NULL
, NULL
);
4838 if (ndefns
== 1 && cacheIfUnique
)
4839 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
,
4840 (*results
)[0].symtab
);
4842 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4848 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4849 domain_enum
namespace,
4850 struct block
**block_found
, struct symtab
**symtab
)
4852 struct ada_symbol_info
*candidates
;
4855 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4857 if (n_candidates
== 0)
4860 if (block_found
!= NULL
)
4861 *block_found
= candidates
[0].block
;
4865 *symtab
= candidates
[0].symtab
;
4866 if (*symtab
== NULL
&& candidates
[0].block
!= NULL
)
4868 struct objfile
*objfile
;
4871 struct blockvector
*bv
;
4873 /* Search the list of symtabs for one which contains the
4874 address of the start of this block. */
4875 ALL_PRIMARY_SYMTABS (objfile
, s
)
4877 bv
= BLOCKVECTOR (s
);
4878 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4879 if (BLOCK_START (b
) <= BLOCK_START (candidates
[0].block
)
4880 && BLOCK_END (b
) > BLOCK_START (candidates
[0].block
))
4883 return fixup_symbol_section (candidates
[0].sym
, objfile
);
4886 /* FIXME: brobecker/2004-11-12: I think that we should never
4887 reach this point. I don't see a reason why we would not
4888 find a symtab for a given block, so I suggest raising an
4889 internal_error exception here. Otherwise, we end up
4890 returning a symbol but no symtab, which certain parts of
4891 the code that rely (indirectly) on this function do not
4892 expect, eventually causing a SEGV. */
4893 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4896 return candidates
[0].sym
;
4899 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4900 scope and in global scopes, or NULL if none. NAME is folded and
4901 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4902 choosing the first symbol if there are multiple choices.
4903 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4904 table in which the symbol was found (in both cases, these
4905 assignments occur only if the pointers are non-null). */
4907 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4908 domain_enum
namespace, int *is_a_field_of_this
,
4909 struct symtab
**symtab
)
4911 if (is_a_field_of_this
!= NULL
)
4912 *is_a_field_of_this
= 0;
4915 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4916 block0
, namespace, NULL
, symtab
);
4919 static struct symbol
*
4920 ada_lookup_symbol_nonlocal (const char *name
,
4921 const char *linkage_name
,
4922 const struct block
*block
,
4923 const domain_enum domain
, struct symtab
**symtab
)
4925 if (linkage_name
== NULL
)
4926 linkage_name
= name
;
4927 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4932 /* True iff STR is a possible encoded suffix of a normal Ada name
4933 that is to be ignored for matching purposes. Suffixes of parallel
4934 names (e.g., XVE) are not included here. Currently, the possible suffixes
4935 are given by either of the regular expression:
4937 (__[0-9]+)?[.$][0-9]+ [nested subprogram suffix, on platforms such
4939 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4940 _E[0-9]+[bs]$ [protected object entry suffixes]
4941 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4945 is_name_suffix (const char *str
)
4948 const char *matching
;
4949 const int len
= strlen (str
);
4951 /* (__[0-9]+)?\.[0-9]+ */
4953 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4956 while (isdigit (matching
[0]))
4958 if (matching
[0] == '\0')
4962 if (matching
[0] == '.' || matching
[0] == '$')
4965 while (isdigit (matching
[0]))
4967 if (matching
[0] == '\0')
4972 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4975 while (isdigit (matching
[0]))
4977 if (matching
[0] == '\0')
4982 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4983 with a N at the end. Unfortunately, the compiler uses the same
4984 convention for other internal types it creates. So treating
4985 all entity names that end with an "N" as a name suffix causes
4986 some regressions. For instance, consider the case of an enumerated
4987 type. To support the 'Image attribute, it creates an array whose
4989 Having a single character like this as a suffix carrying some
4990 information is a bit risky. Perhaps we should change the encoding
4991 to be something like "_N" instead. In the meantime, do not do
4992 the following check. */
4993 /* Protected Object Subprograms */
4994 if (len
== 1 && str
[0] == 'N')
4999 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
5002 while (isdigit (matching
[0]))
5004 if ((matching
[0] == 'b' || matching
[0] == 's')
5005 && matching
[1] == '\0')
5009 /* ??? We should not modify STR directly, as we are doing below. This
5010 is fine in this case, but may become problematic later if we find
5011 that this alternative did not work, and want to try matching
5012 another one from the begining of STR. Since we modified it, we
5013 won't be able to find the begining of the string anymore! */
5017 while (str
[0] != '_' && str
[0] != '\0')
5019 if (str
[0] != 'n' && str
[0] != 'b')
5024 if (str
[0] == '\000')
5028 if (str
[1] != '_' || str
[2] == '\000')
5032 if (strcmp (str
+ 3, "JM") == 0)
5034 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5035 the LJM suffix in favor of the JM one. But we will
5036 still accept LJM as a valid suffix for a reasonable
5037 amount of time, just to allow ourselves to debug programs
5038 compiled using an older version of GNAT. */
5039 if (strcmp (str
+ 3, "LJM") == 0)
5043 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5044 || str
[4] == 'U' || str
[4] == 'P')
5046 if (str
[4] == 'R' && str
[5] != 'T')
5050 if (!isdigit (str
[2]))
5052 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5053 if (!isdigit (str
[k
]) && str
[k
] != '_')
5057 if (str
[0] == '$' && isdigit (str
[1]))
5059 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5060 if (!isdigit (str
[k
]) && str
[k
] != '_')
5067 /* Return nonzero if the given string starts with a dot ('.')
5068 followed by zero or more digits.
5070 Note: brobecker/2003-11-10: A forward declaration has not been
5071 added at the begining of this file yet, because this function
5072 is only used to work around a problem found during wild matching
5073 when trying to match minimal symbol names against symbol names
5074 obtained from dwarf-2 data. This function is therefore currently
5075 only used in wild_match() and is likely to be deleted when the
5076 problem in dwarf-2 is fixed. */
5079 is_dot_digits_suffix (const char *str
)
5085 while (isdigit (str
[0]))
5087 return (str
[0] == '\0');
5090 /* Return non-zero if the string starting at NAME and ending before
5091 NAME_END contains no capital letters. */
5094 is_valid_name_for_wild_match (const char *name0
)
5096 const char *decoded_name
= ada_decode (name0
);
5099 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5100 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5106 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5107 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5108 informational suffixes of NAME (i.e., for which is_name_suffix is
5112 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5119 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5120 stored in the symbol table for nested function names is sometimes
5121 different from the name of the associated entity stored in
5122 the dwarf-2 data: This is the case for nested subprograms, where
5123 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5124 while the symbol name from the dwarf-2 data does not.
5126 Although the DWARF-2 standard documents that entity names stored
5127 in the dwarf-2 data should be identical to the name as seen in
5128 the source code, GNAT takes a different approach as we already use
5129 a special encoding mechanism to convey the information so that
5130 a C debugger can still use the information generated to debug
5131 Ada programs. A corollary is that the symbol names in the dwarf-2
5132 data should match the names found in the symbol table. I therefore
5133 consider this issue as a compiler defect.
5135 Until the compiler is properly fixed, we work-around the problem
5136 by ignoring such suffixes during the match. We do so by making
5137 a copy of PATN0 and NAME0, and then by stripping such a suffix
5138 if present. We then perform the match on the resulting strings. */
5141 name_len
= strlen (name0
);
5143 name
= name_start
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5144 strcpy (name
, name0
);
5145 dot
= strrchr (name
, '.');
5146 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5149 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5150 strncpy (patn
, patn0
, patn_len
);
5151 patn
[patn_len
] = '\0';
5152 dot
= strrchr (patn
, '.');
5153 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5156 patn_len
= dot
- patn
;
5160 /* Now perform the wild match. */
5162 name_len
= strlen (name
);
5163 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5164 && strncmp (patn
, name
+ 5, patn_len
) == 0
5165 && is_name_suffix (name
+ patn_len
+ 5))
5168 while (name_len
>= patn_len
)
5170 if (strncmp (patn
, name
, patn_len
) == 0
5171 && is_name_suffix (name
+ patn_len
))
5172 return (name
== name_start
|| is_valid_name_for_wild_match (name0
));
5179 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5184 if (!islower (name
[2]))
5191 if (!islower (name
[1]))
5202 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5203 vector *defn_symbols, updating the list of symbols in OBSTACKP
5204 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5205 OBJFILE is the section containing BLOCK.
5206 SYMTAB is recorded with each symbol added. */
5209 ada_add_block_symbols (struct obstack
*obstackp
,
5210 struct block
*block
, const char *name
,
5211 domain_enum domain
, struct objfile
*objfile
,
5212 struct symtab
*symtab
, int wild
)
5214 struct dict_iterator iter
;
5215 int name_len
= strlen (name
);
5216 /* A matching argument symbol, if any. */
5217 struct symbol
*arg_sym
;
5218 /* Set true when we find a matching non-argument symbol. */
5227 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5229 if (SYMBOL_DOMAIN (sym
) == domain
5230 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5232 switch (SYMBOL_CLASS (sym
))
5238 case LOC_REGPARM_ADDR
:
5239 case LOC_BASEREG_ARG
:
5240 case LOC_COMPUTED_ARG
:
5243 case LOC_UNRESOLVED
:
5247 add_defn_to_vec (obstackp
,
5248 fixup_symbol_section (sym
, objfile
),
5257 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5259 if (SYMBOL_DOMAIN (sym
) == domain
)
5261 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5263 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5265 switch (SYMBOL_CLASS (sym
))
5271 case LOC_REGPARM_ADDR
:
5272 case LOC_BASEREG_ARG
:
5273 case LOC_COMPUTED_ARG
:
5276 case LOC_UNRESOLVED
:
5280 add_defn_to_vec (obstackp
,
5281 fixup_symbol_section (sym
, objfile
),
5290 if (!found_sym
&& arg_sym
!= NULL
)
5292 add_defn_to_vec (obstackp
,
5293 fixup_symbol_section (arg_sym
, objfile
),
5302 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5304 if (SYMBOL_DOMAIN (sym
) == domain
)
5308 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5311 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5313 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5318 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5320 switch (SYMBOL_CLASS (sym
))
5326 case LOC_REGPARM_ADDR
:
5327 case LOC_BASEREG_ARG
:
5328 case LOC_COMPUTED_ARG
:
5331 case LOC_UNRESOLVED
:
5335 add_defn_to_vec (obstackp
,
5336 fixup_symbol_section (sym
, objfile
),
5344 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5345 They aren't parameters, right? */
5346 if (!found_sym
&& arg_sym
!= NULL
)
5348 add_defn_to_vec (obstackp
,
5349 fixup_symbol_section (arg_sym
, objfile
),
5357 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5358 for tagged types. */
5361 ada_is_dispatch_table_ptr_type (struct type
*type
)
5365 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5368 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5372 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5375 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5376 to be invisible to users. */
5379 ada_is_ignored_field (struct type
*type
, int field_num
)
5381 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5384 /* Check the name of that field. */
5386 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5388 /* Anonymous field names should not be printed.
5389 brobecker/2007-02-20: I don't think this can actually happen
5390 but we don't want to print the value of annonymous fields anyway. */
5394 /* A field named "_parent" is internally generated by GNAT for
5395 tagged types, and should not be printed either. */
5396 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5400 /* If this is the dispatch table of a tagged type, then ignore. */
5401 if (ada_is_tagged_type (type
, 1)
5402 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5405 /* Not a special field, so it should not be ignored. */
5409 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5410 pointer or reference type whose ultimate target has a tag field. */
5413 ada_is_tagged_type (struct type
*type
, int refok
)
5415 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5418 /* True iff TYPE represents the type of X'Tag */
5421 ada_is_tag_type (struct type
*type
)
5423 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5427 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5428 return (name
!= NULL
5429 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5433 /* The type of the tag on VAL. */
5436 ada_tag_type (struct value
*val
)
5438 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5441 /* The value of the tag on VAL. */
5444 ada_value_tag (struct value
*val
)
5446 return ada_value_struct_elt (val
, "_tag", 0);
5449 /* The value of the tag on the object of type TYPE whose contents are
5450 saved at VALADDR, if it is non-null, or is at memory address
5453 static struct value
*
5454 value_tag_from_contents_and_address (struct type
*type
,
5455 const gdb_byte
*valaddr
,
5458 int tag_byte_offset
, dummy1
, dummy2
;
5459 struct type
*tag_type
;
5460 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5463 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5465 : valaddr
+ tag_byte_offset
);
5466 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5468 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5473 static struct type
*
5474 type_from_tag (struct value
*tag
)
5476 const char *type_name
= ada_tag_name (tag
);
5477 if (type_name
!= NULL
)
5478 return ada_find_any_type (ada_encode (type_name
));
5489 static int ada_tag_name_1 (void *);
5490 static int ada_tag_name_2 (struct tag_args
*);
5492 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5493 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5494 The value stored in ARGS->name is valid until the next call to
5498 ada_tag_name_1 (void *args0
)
5500 struct tag_args
*args
= (struct tag_args
*) args0
;
5501 static char name
[1024];
5505 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5507 return ada_tag_name_2 (args
);
5508 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5511 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5512 for (p
= name
; *p
!= '\0'; p
+= 1)
5519 /* Utility function for ada_tag_name_1 that tries the second
5520 representation for the dispatch table (in which there is no
5521 explicit 'tsd' field in the referent of the tag pointer, and instead
5522 the tsd pointer is stored just before the dispatch table. */
5525 ada_tag_name_2 (struct tag_args
*args
)
5527 struct type
*info_type
;
5528 static char name
[1024];
5530 struct value
*val
, *valp
;
5533 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5534 if (info_type
== NULL
)
5536 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5537 valp
= value_cast (info_type
, args
->tag
);
5540 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5543 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5546 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5547 for (p
= name
; *p
!= '\0'; p
+= 1)
5554 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5558 ada_tag_name (struct value
*tag
)
5560 struct tag_args args
;
5561 if (!ada_is_tag_type (value_type (tag
)))
5565 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5569 /* The parent type of TYPE, or NULL if none. */
5572 ada_parent_type (struct type
*type
)
5576 type
= ada_check_typedef (type
);
5578 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5581 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5582 if (ada_is_parent_field (type
, i
))
5583 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5588 /* True iff field number FIELD_NUM of structure type TYPE contains the
5589 parent-type (inherited) fields of a derived type. Assumes TYPE is
5590 a structure type with at least FIELD_NUM+1 fields. */
5593 ada_is_parent_field (struct type
*type
, int field_num
)
5595 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5596 return (name
!= NULL
5597 && (strncmp (name
, "PARENT", 6) == 0
5598 || strncmp (name
, "_parent", 7) == 0));
5601 /* True iff field number FIELD_NUM of structure type TYPE is a
5602 transparent wrapper field (which should be silently traversed when doing
5603 field selection and flattened when printing). Assumes TYPE is a
5604 structure type with at least FIELD_NUM+1 fields. Such fields are always
5608 ada_is_wrapper_field (struct type
*type
, int field_num
)
5610 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5611 return (name
!= NULL
5612 && (strncmp (name
, "PARENT", 6) == 0
5613 || strcmp (name
, "REP") == 0
5614 || strncmp (name
, "_parent", 7) == 0
5615 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5618 /* True iff field number FIELD_NUM of structure or union type TYPE
5619 is a variant wrapper. Assumes TYPE is a structure type with at least
5620 FIELD_NUM+1 fields. */
5623 ada_is_variant_part (struct type
*type
, int field_num
)
5625 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5626 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5627 || (is_dynamic_field (type
, field_num
)
5628 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5629 == TYPE_CODE_UNION
)));
5632 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5633 whose discriminants are contained in the record type OUTER_TYPE,
5634 returns the type of the controlling discriminant for the variant. */
5637 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5639 char *name
= ada_variant_discrim_name (var_type
);
5641 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5643 return builtin_type_int
;
5648 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5649 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5650 represents a 'when others' clause; otherwise 0. */
5653 ada_is_others_clause (struct type
*type
, int field_num
)
5655 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5656 return (name
!= NULL
&& name
[0] == 'O');
5659 /* Assuming that TYPE0 is the type of the variant part of a record,
5660 returns the name of the discriminant controlling the variant.
5661 The value is valid until the next call to ada_variant_discrim_name. */
5664 ada_variant_discrim_name (struct type
*type0
)
5666 static char *result
= NULL
;
5667 static size_t result_len
= 0;
5670 const char *discrim_end
;
5671 const char *discrim_start
;
5673 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5674 type
= TYPE_TARGET_TYPE (type0
);
5678 name
= ada_type_name (type
);
5680 if (name
== NULL
|| name
[0] == '\000')
5683 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5686 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5689 if (discrim_end
== name
)
5692 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5695 if (discrim_start
== name
+ 1)
5697 if ((discrim_start
> name
+ 3
5698 && strncmp (discrim_start
- 3, "___", 3) == 0)
5699 || discrim_start
[-1] == '.')
5703 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5704 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5705 result
[discrim_end
- discrim_start
] = '\0';
5709 /* Scan STR for a subtype-encoded number, beginning at position K.
5710 Put the position of the character just past the number scanned in
5711 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5712 Return 1 if there was a valid number at the given position, and 0
5713 otherwise. A "subtype-encoded" number consists of the absolute value
5714 in decimal, followed by the letter 'm' to indicate a negative number.
5715 Assumes 0m does not occur. */
5718 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5722 if (!isdigit (str
[k
]))
5725 /* Do it the hard way so as not to make any assumption about
5726 the relationship of unsigned long (%lu scan format code) and
5729 while (isdigit (str
[k
]))
5731 RU
= RU
* 10 + (str
[k
] - '0');
5738 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5744 /* NOTE on the above: Technically, C does not say what the results of
5745 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5746 number representable as a LONGEST (although either would probably work
5747 in most implementations). When RU>0, the locution in the then branch
5748 above is always equivalent to the negative of RU. */
5755 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5756 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5757 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5760 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5762 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5775 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5784 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5785 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5787 if (val
>= L
&& val
<= U
)
5799 /* FIXME: Lots of redundancy below. Try to consolidate. */
5801 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5802 ARG_TYPE, extract and return the value of one of its (non-static)
5803 fields. FIELDNO says which field. Differs from value_primitive_field
5804 only in that it can handle packed values of arbitrary type. */
5806 static struct value
*
5807 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5808 struct type
*arg_type
)
5812 arg_type
= ada_check_typedef (arg_type
);
5813 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5815 /* Handle packed fields. */
5817 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5819 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5820 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5822 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5823 offset
+ bit_pos
/ 8,
5824 bit_pos
% 8, bit_size
, type
);
5827 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5830 /* Find field with name NAME in object of type TYPE. If found,
5831 set the following for each argument that is non-null:
5832 - *FIELD_TYPE_P to the field's type;
5833 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5834 an object of that type;
5835 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5836 - *BIT_SIZE_P to its size in bits if the field is packed, and
5838 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5839 fields up to but not including the desired field, or by the total
5840 number of fields if not found. A NULL value of NAME never
5841 matches; the function just counts visible fields in this case.
5843 Returns 1 if found, 0 otherwise. */
5846 find_struct_field (char *name
, struct type
*type
, int offset
,
5847 struct type
**field_type_p
,
5848 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5853 type
= ada_check_typedef (type
);
5855 if (field_type_p
!= NULL
)
5856 *field_type_p
= NULL
;
5857 if (byte_offset_p
!= NULL
)
5859 if (bit_offset_p
!= NULL
)
5861 if (bit_size_p
!= NULL
)
5864 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5866 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5867 int fld_offset
= offset
+ bit_pos
/ 8;
5868 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5870 if (t_field_name
== NULL
)
5873 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5875 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5876 if (field_type_p
!= NULL
)
5877 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5878 if (byte_offset_p
!= NULL
)
5879 *byte_offset_p
= fld_offset
;
5880 if (bit_offset_p
!= NULL
)
5881 *bit_offset_p
= bit_pos
% 8;
5882 if (bit_size_p
!= NULL
)
5883 *bit_size_p
= bit_size
;
5886 else if (ada_is_wrapper_field (type
, i
))
5888 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5889 field_type_p
, byte_offset_p
, bit_offset_p
,
5890 bit_size_p
, index_p
))
5893 else if (ada_is_variant_part (type
, i
))
5895 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5898 struct type
*field_type
5899 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5901 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5903 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5905 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5906 field_type_p
, byte_offset_p
,
5907 bit_offset_p
, bit_size_p
, index_p
))
5911 else if (index_p
!= NULL
)
5917 /* Number of user-visible fields in record type TYPE. */
5920 num_visible_fields (struct type
*type
)
5924 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5928 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5929 and search in it assuming it has (class) type TYPE.
5930 If found, return value, else return NULL.
5932 Searches recursively through wrapper fields (e.g., '_parent'). */
5934 static struct value
*
5935 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5939 type
= ada_check_typedef (type
);
5941 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5943 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5945 if (t_field_name
== NULL
)
5948 else if (field_name_match (t_field_name
, name
))
5949 return ada_value_primitive_field (arg
, offset
, i
, type
);
5951 else if (ada_is_wrapper_field (type
, i
))
5953 struct value
*v
= /* Do not let indent join lines here. */
5954 ada_search_struct_field (name
, arg
,
5955 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5956 TYPE_FIELD_TYPE (type
, i
));
5961 else if (ada_is_variant_part (type
, i
))
5963 /* PNH: Do we ever get here? See find_struct_field. */
5965 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5966 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5968 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5970 struct value
*v
= ada_search_struct_field
/* Force line break. */
5972 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5973 TYPE_FIELD_TYPE (field_type
, j
));
5982 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
5983 int, struct type
*);
5986 /* Return field #INDEX in ARG, where the index is that returned by
5987 * find_struct_field through its INDEX_P argument. Adjust the address
5988 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
5989 * If found, return value, else return NULL. */
5991 static struct value
*
5992 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
5995 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
5999 /* Auxiliary function for ada_index_struct_field. Like
6000 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6003 static struct value
*
6004 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6008 type
= ada_check_typedef (type
);
6010 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6012 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6014 else if (ada_is_wrapper_field (type
, i
))
6016 struct value
*v
= /* Do not let indent join lines here. */
6017 ada_index_struct_field_1 (index_p
, arg
,
6018 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6019 TYPE_FIELD_TYPE (type
, i
));
6024 else if (ada_is_variant_part (type
, i
))
6026 /* PNH: Do we ever get here? See ada_search_struct_field,
6027 find_struct_field. */
6028 error (_("Cannot assign this kind of variant record"));
6030 else if (*index_p
== 0)
6031 return ada_value_primitive_field (arg
, offset
, i
, type
);
6038 /* Given ARG, a value of type (pointer or reference to a)*
6039 structure/union, extract the component named NAME from the ultimate
6040 target structure/union and return it as a value with its
6041 appropriate type. If ARG is a pointer or reference and the field
6042 is not packed, returns a reference to the field, otherwise the
6043 value of the field (an lvalue if ARG is an lvalue).
6045 The routine searches for NAME among all members of the structure itself
6046 and (recursively) among all members of any wrapper members
6049 If NO_ERR, then simply return NULL in case of error, rather than
6053 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6055 struct type
*t
, *t1
;
6059 t1
= t
= ada_check_typedef (value_type (arg
));
6060 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6062 t1
= TYPE_TARGET_TYPE (t
);
6065 t1
= ada_check_typedef (t1
);
6066 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6068 arg
= coerce_ref (arg
);
6073 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6075 t1
= TYPE_TARGET_TYPE (t
);
6078 t1
= ada_check_typedef (t1
);
6079 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6081 arg
= value_ind (arg
);
6088 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6092 v
= ada_search_struct_field (name
, arg
, 0, t
);
6095 int bit_offset
, bit_size
, byte_offset
;
6096 struct type
*field_type
;
6099 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6100 address
= value_as_address (arg
);
6102 address
= unpack_pointer (t
, value_contents (arg
));
6104 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6105 if (find_struct_field (name
, t1
, 0,
6106 &field_type
, &byte_offset
, &bit_offset
,
6111 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6112 arg
= ada_coerce_ref (arg
);
6114 arg
= ada_value_ind (arg
);
6115 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6116 bit_offset
, bit_size
,
6120 v
= value_from_pointer (lookup_reference_type (field_type
),
6121 address
+ byte_offset
);
6125 if (v
!= NULL
|| no_err
)
6128 error (_("There is no member named %s."), name
);
6134 error (_("Attempt to extract a component of a value that is not a record."));
6137 /* Given a type TYPE, look up the type of the component of type named NAME.
6138 If DISPP is non-null, add its byte displacement from the beginning of a
6139 structure (pointed to by a value) of type TYPE to *DISPP (does not
6140 work for packed fields).
6142 Matches any field whose name has NAME as a prefix, possibly
6145 TYPE can be either a struct or union. If REFOK, TYPE may also
6146 be a (pointer or reference)+ to a struct or union, and the
6147 ultimate target type will be searched.
6149 Looks recursively into variant clauses and parent types.
6151 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6152 TYPE is not a type of the right kind. */
6154 static struct type
*
6155 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6156 int noerr
, int *dispp
)
6163 if (refok
&& type
!= NULL
)
6166 type
= ada_check_typedef (type
);
6167 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6168 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6170 type
= TYPE_TARGET_TYPE (type
);
6174 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6175 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6181 target_terminal_ours ();
6182 gdb_flush (gdb_stdout
);
6184 error (_("Type (null) is not a structure or union type"));
6187 /* XXX: type_sprint */
6188 fprintf_unfiltered (gdb_stderr
, _("Type "));
6189 type_print (type
, "", gdb_stderr
, -1);
6190 error (_(" is not a structure or union type"));
6195 type
= to_static_fixed_type (type
);
6197 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6199 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6203 if (t_field_name
== NULL
)
6206 else if (field_name_match (t_field_name
, name
))
6209 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6210 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6213 else if (ada_is_wrapper_field (type
, i
))
6216 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6221 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6226 else if (ada_is_variant_part (type
, i
))
6229 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6231 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6234 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6239 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6250 target_terminal_ours ();
6251 gdb_flush (gdb_stdout
);
6254 /* XXX: type_sprint */
6255 fprintf_unfiltered (gdb_stderr
, _("Type "));
6256 type_print (type
, "", gdb_stderr
, -1);
6257 error (_(" has no component named <null>"));
6261 /* XXX: type_sprint */
6262 fprintf_unfiltered (gdb_stderr
, _("Type "));
6263 type_print (type
, "", gdb_stderr
, -1);
6264 error (_(" has no component named %s"), name
);
6271 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6272 within a value of type OUTER_TYPE that is stored in GDB at
6273 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6274 numbering from 0) is applicable. Returns -1 if none are. */
6277 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6278 const gdb_byte
*outer_valaddr
)
6283 struct type
*discrim_type
;
6284 char *discrim_name
= ada_variant_discrim_name (var_type
);
6285 LONGEST discrim_val
;
6289 ada_lookup_struct_elt_type (outer_type
, discrim_name
, 1, 1, &disp
);
6290 if (discrim_type
== NULL
)
6292 discrim_val
= unpack_long (discrim_type
, outer_valaddr
+ disp
);
6295 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6297 if (ada_is_others_clause (var_type
, i
))
6299 else if (ada_in_variant (discrim_val
, var_type
, i
))
6303 return others_clause
;
6308 /* Dynamic-Sized Records */
6310 /* Strategy: The type ostensibly attached to a value with dynamic size
6311 (i.e., a size that is not statically recorded in the debugging
6312 data) does not accurately reflect the size or layout of the value.
6313 Our strategy is to convert these values to values with accurate,
6314 conventional types that are constructed on the fly. */
6316 /* There is a subtle and tricky problem here. In general, we cannot
6317 determine the size of dynamic records without its data. However,
6318 the 'struct value' data structure, which GDB uses to represent
6319 quantities in the inferior process (the target), requires the size
6320 of the type at the time of its allocation in order to reserve space
6321 for GDB's internal copy of the data. That's why the
6322 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6323 rather than struct value*s.
6325 However, GDB's internal history variables ($1, $2, etc.) are
6326 struct value*s containing internal copies of the data that are not, in
6327 general, the same as the data at their corresponding addresses in
6328 the target. Fortunately, the types we give to these values are all
6329 conventional, fixed-size types (as per the strategy described
6330 above), so that we don't usually have to perform the
6331 'to_fixed_xxx_type' conversions to look at their values.
6332 Unfortunately, there is one exception: if one of the internal
6333 history variables is an array whose elements are unconstrained
6334 records, then we will need to create distinct fixed types for each
6335 element selected. */
6337 /* The upshot of all of this is that many routines take a (type, host
6338 address, target address) triple as arguments to represent a value.
6339 The host address, if non-null, is supposed to contain an internal
6340 copy of the relevant data; otherwise, the program is to consult the
6341 target at the target address. */
6343 /* Assuming that VAL0 represents a pointer value, the result of
6344 dereferencing it. Differs from value_ind in its treatment of
6345 dynamic-sized types. */
6348 ada_value_ind (struct value
*val0
)
6350 struct value
*val
= unwrap_value (value_ind (val0
));
6351 return ada_to_fixed_value (val
);
6354 /* The value resulting from dereferencing any "reference to"
6355 qualifiers on VAL0. */
6357 static struct value
*
6358 ada_coerce_ref (struct value
*val0
)
6360 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6362 struct value
*val
= val0
;
6363 val
= coerce_ref (val
);
6364 val
= unwrap_value (val
);
6365 return ada_to_fixed_value (val
);
6371 /* Return OFF rounded upward if necessary to a multiple of
6372 ALIGNMENT (a power of 2). */
6375 align_value (unsigned int off
, unsigned int alignment
)
6377 return (off
+ alignment
- 1) & ~(alignment
- 1);
6380 /* Return the bit alignment required for field #F of template type TYPE. */
6383 field_alignment (struct type
*type
, int f
)
6385 const char *name
= TYPE_FIELD_NAME (type
, f
);
6389 /* The field name should never be null, unless the debugging information
6390 is somehow malformed. In this case, we assume the field does not
6391 require any alignment. */
6395 len
= strlen (name
);
6397 if (!isdigit (name
[len
- 1]))
6400 if (isdigit (name
[len
- 2]))
6401 align_offset
= len
- 2;
6403 align_offset
= len
- 1;
6405 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6406 return TARGET_CHAR_BIT
;
6408 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6411 /* Find a symbol named NAME. Ignores ambiguity. */
6414 ada_find_any_symbol (const char *name
)
6418 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6419 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6422 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6426 /* Find a type named NAME. Ignores ambiguity. */
6429 ada_find_any_type (const char *name
)
6431 struct symbol
*sym
= ada_find_any_symbol (name
);
6434 return SYMBOL_TYPE (sym
);
6439 /* Given NAME and an associated BLOCK, search all symbols for
6440 NAME suffixed with "___XR", which is the ``renaming'' symbol
6441 associated to NAME. Return this symbol if found, return
6445 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6449 sym
= find_old_style_renaming_symbol (name
, block
);
6454 /* Not right yet. FIXME pnh 7/20/2007. */
6455 sym
= ada_find_any_symbol (name
);
6456 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6462 static struct symbol
*
6463 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6465 const struct symbol
*function_sym
= block_function (block
);
6468 if (function_sym
!= NULL
)
6470 /* If the symbol is defined inside a function, NAME is not fully
6471 qualified. This means we need to prepend the function name
6472 as well as adding the ``___XR'' suffix to build the name of
6473 the associated renaming symbol. */
6474 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6475 /* Function names sometimes contain suffixes used
6476 for instance to qualify nested subprograms. When building
6477 the XR type name, we need to make sure that this suffix is
6478 not included. So do not include any suffix in the function
6479 name length below. */
6480 const int function_name_len
= ada_name_prefix_len (function_name
);
6481 const int rename_len
= function_name_len
+ 2 /* "__" */
6482 + strlen (name
) + 6 /* "___XR\0" */ ;
6484 /* Strip the suffix if necessary. */
6485 function_name
[function_name_len
] = '\0';
6487 /* Library-level functions are a special case, as GNAT adds
6488 a ``_ada_'' prefix to the function name to avoid namespace
6489 pollution. However, the renaming symbols themselves do not
6490 have this prefix, so we need to skip this prefix if present. */
6491 if (function_name_len
> 5 /* "_ada_" */
6492 && strstr (function_name
, "_ada_") == function_name
)
6493 function_name
= function_name
+ 5;
6495 rename
= (char *) alloca (rename_len
* sizeof (char));
6496 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6500 const int rename_len
= strlen (name
) + 6;
6501 rename
= (char *) alloca (rename_len
* sizeof (char));
6502 sprintf (rename
, "%s___XR", name
);
6505 return ada_find_any_symbol (rename
);
6508 /* Because of GNAT encoding conventions, several GDB symbols may match a
6509 given type name. If the type denoted by TYPE0 is to be preferred to
6510 that of TYPE1 for purposes of type printing, return non-zero;
6511 otherwise return 0. */
6514 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6518 else if (type0
== NULL
)
6520 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6522 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6524 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6526 else if (ada_is_packed_array_type (type0
))
6528 else if (ada_is_array_descriptor_type (type0
)
6529 && !ada_is_array_descriptor_type (type1
))
6533 const char *type0_name
= type_name_no_tag (type0
);
6534 const char *type1_name
= type_name_no_tag (type1
);
6536 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6537 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6543 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6544 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6547 ada_type_name (struct type
*type
)
6551 else if (TYPE_NAME (type
) != NULL
)
6552 return TYPE_NAME (type
);
6554 return TYPE_TAG_NAME (type
);
6557 /* Find a parallel type to TYPE whose name is formed by appending
6558 SUFFIX to the name of TYPE. */
6561 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6564 static size_t name_len
= 0;
6566 char *typename
= ada_type_name (type
);
6568 if (typename
== NULL
)
6571 len
= strlen (typename
);
6573 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6575 strcpy (name
, typename
);
6576 strcpy (name
+ len
, suffix
);
6578 return ada_find_any_type (name
);
6582 /* If TYPE is a variable-size record type, return the corresponding template
6583 type describing its fields. Otherwise, return NULL. */
6585 static struct type
*
6586 dynamic_template_type (struct type
*type
)
6588 type
= ada_check_typedef (type
);
6590 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6591 || ada_type_name (type
) == NULL
)
6595 int len
= strlen (ada_type_name (type
));
6596 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6599 return ada_find_parallel_type (type
, "___XVE");
6603 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6604 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6607 is_dynamic_field (struct type
*templ_type
, int field_num
)
6609 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6611 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6612 && strstr (name
, "___XVL") != NULL
;
6615 /* The index of the variant field of TYPE, or -1 if TYPE does not
6616 represent a variant record type. */
6619 variant_field_index (struct type
*type
)
6623 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6626 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6628 if (ada_is_variant_part (type
, f
))
6634 /* A record type with no fields. */
6636 static struct type
*
6637 empty_record (struct objfile
*objfile
)
6639 struct type
*type
= alloc_type (objfile
);
6640 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6641 TYPE_NFIELDS (type
) = 0;
6642 TYPE_FIELDS (type
) = NULL
;
6643 TYPE_NAME (type
) = "<empty>";
6644 TYPE_TAG_NAME (type
) = NULL
;
6645 TYPE_FLAGS (type
) = 0;
6646 TYPE_LENGTH (type
) = 0;
6650 /* An ordinary record type (with fixed-length fields) that describes
6651 the value of type TYPE at VALADDR or ADDRESS (see comments at
6652 the beginning of this section) VAL according to GNAT conventions.
6653 DVAL0 should describe the (portion of a) record that contains any
6654 necessary discriminants. It should be NULL if value_type (VAL) is
6655 an outer-level type (i.e., as opposed to a branch of a variant.) A
6656 variant field (unless unchecked) is replaced by a particular branch
6659 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6660 length are not statically known are discarded. As a consequence,
6661 VALADDR, ADDRESS and DVAL0 are ignored.
6663 NOTE: Limitations: For now, we assume that dynamic fields and
6664 variants occupy whole numbers of bytes. However, they need not be
6668 ada_template_to_fixed_record_type_1 (struct type
*type
,
6669 const gdb_byte
*valaddr
,
6670 CORE_ADDR address
, struct value
*dval0
,
6671 int keep_dynamic_fields
)
6673 struct value
*mark
= value_mark ();
6676 int nfields
, bit_len
;
6679 int fld_bit_len
, bit_incr
;
6682 /* Compute the number of fields in this record type that are going
6683 to be processed: unless keep_dynamic_fields, this includes only
6684 fields whose position and length are static will be processed. */
6685 if (keep_dynamic_fields
)
6686 nfields
= TYPE_NFIELDS (type
);
6690 while (nfields
< TYPE_NFIELDS (type
)
6691 && !ada_is_variant_part (type
, nfields
)
6692 && !is_dynamic_field (type
, nfields
))
6696 rtype
= alloc_type (TYPE_OBJFILE (type
));
6697 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6698 INIT_CPLUS_SPECIFIC (rtype
);
6699 TYPE_NFIELDS (rtype
) = nfields
;
6700 TYPE_FIELDS (rtype
) = (struct field
*)
6701 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6702 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6703 TYPE_NAME (rtype
) = ada_type_name (type
);
6704 TYPE_TAG_NAME (rtype
) = NULL
;
6705 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6711 for (f
= 0; f
< nfields
; f
+= 1)
6713 off
= align_value (off
, field_alignment (type
, f
))
6714 + TYPE_FIELD_BITPOS (type
, f
);
6715 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6716 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6718 if (ada_is_variant_part (type
, f
))
6721 fld_bit_len
= bit_incr
= 0;
6723 else if (is_dynamic_field (type
, f
))
6726 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6730 /* Get the fixed type of the field. Note that, in this case, we
6731 do not want to get the real type out of the tag: if the current
6732 field is the parent part of a tagged record, we will get the
6733 tag of the object. Clearly wrong: the real type of the parent
6734 is not the real type of the child. We would end up in an infinite
6736 TYPE_FIELD_TYPE (rtype
, f
) =
6739 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6740 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6741 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6742 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6743 bit_incr
= fld_bit_len
=
6744 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6748 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6749 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6750 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6751 bit_incr
= fld_bit_len
=
6752 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6754 bit_incr
= fld_bit_len
=
6755 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6757 if (off
+ fld_bit_len
> bit_len
)
6758 bit_len
= off
+ fld_bit_len
;
6760 TYPE_LENGTH (rtype
) =
6761 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6764 /* We handle the variant part, if any, at the end because of certain
6765 odd cases in which it is re-ordered so as NOT the last field of
6766 the record. This can happen in the presence of representation
6768 if (variant_field
>= 0)
6770 struct type
*branch_type
;
6772 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6775 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6780 to_fixed_variant_branch_type
6781 (TYPE_FIELD_TYPE (type
, variant_field
),
6782 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6783 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6784 if (branch_type
== NULL
)
6786 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6787 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6788 TYPE_NFIELDS (rtype
) -= 1;
6792 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6793 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6795 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6797 if (off
+ fld_bit_len
> bit_len
)
6798 bit_len
= off
+ fld_bit_len
;
6799 TYPE_LENGTH (rtype
) =
6800 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6804 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6805 should contain the alignment of that record, which should be a strictly
6806 positive value. If null or negative, then something is wrong, most
6807 probably in the debug info. In that case, we don't round up the size
6808 of the resulting type. If this record is not part of another structure,
6809 the current RTYPE length might be good enough for our purposes. */
6810 if (TYPE_LENGTH (type
) <= 0)
6812 if (TYPE_NAME (rtype
))
6813 warning (_("Invalid type size for `%s' detected: %d."),
6814 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6816 warning (_("Invalid type size for <unnamed> detected: %d."),
6817 TYPE_LENGTH (type
));
6821 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6822 TYPE_LENGTH (type
));
6825 value_free_to_mark (mark
);
6826 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6827 error (_("record type with dynamic size is larger than varsize-limit"));
6831 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6834 static struct type
*
6835 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6836 CORE_ADDR address
, struct value
*dval0
)
6838 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6842 /* An ordinary record type in which ___XVL-convention fields and
6843 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6844 static approximations, containing all possible fields. Uses
6845 no runtime values. Useless for use in values, but that's OK,
6846 since the results are used only for type determinations. Works on both
6847 structs and unions. Representation note: to save space, we memorize
6848 the result of this function in the TYPE_TARGET_TYPE of the
6851 static struct type
*
6852 template_to_static_fixed_type (struct type
*type0
)
6858 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6859 return TYPE_TARGET_TYPE (type0
);
6861 nfields
= TYPE_NFIELDS (type0
);
6864 for (f
= 0; f
< nfields
; f
+= 1)
6866 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6867 struct type
*new_type
;
6869 if (is_dynamic_field (type0
, f
))
6870 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6872 new_type
= static_unwrap_type (field_type
);
6873 if (type
== type0
&& new_type
!= field_type
)
6875 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6876 TYPE_CODE (type
) = TYPE_CODE (type0
);
6877 INIT_CPLUS_SPECIFIC (type
);
6878 TYPE_NFIELDS (type
) = nfields
;
6879 TYPE_FIELDS (type
) = (struct field
*)
6880 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6881 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6882 sizeof (struct field
) * nfields
);
6883 TYPE_NAME (type
) = ada_type_name (type0
);
6884 TYPE_TAG_NAME (type
) = NULL
;
6885 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
6886 TYPE_LENGTH (type
) = 0;
6888 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6889 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6894 /* Given an object of type TYPE whose contents are at VALADDR and
6895 whose address in memory is ADDRESS, returns a revision of TYPE --
6896 a non-dynamic-sized record with a variant part -- in which
6897 the variant part is replaced with the appropriate branch. Looks
6898 for discriminant values in DVAL0, which can be NULL if the record
6899 contains the necessary discriminant values. */
6901 static struct type
*
6902 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6903 CORE_ADDR address
, struct value
*dval0
)
6905 struct value
*mark
= value_mark ();
6908 struct type
*branch_type
;
6909 int nfields
= TYPE_NFIELDS (type
);
6910 int variant_field
= variant_field_index (type
);
6912 if (variant_field
== -1)
6916 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6920 rtype
= alloc_type (TYPE_OBJFILE (type
));
6921 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6922 INIT_CPLUS_SPECIFIC (rtype
);
6923 TYPE_NFIELDS (rtype
) = nfields
;
6924 TYPE_FIELDS (rtype
) =
6925 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6926 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6927 sizeof (struct field
) * nfields
);
6928 TYPE_NAME (rtype
) = ada_type_name (type
);
6929 TYPE_TAG_NAME (rtype
) = NULL
;
6930 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6931 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
6933 branch_type
= to_fixed_variant_branch_type
6934 (TYPE_FIELD_TYPE (type
, variant_field
),
6935 cond_offset_host (valaddr
,
6936 TYPE_FIELD_BITPOS (type
, variant_field
)
6938 cond_offset_target (address
,
6939 TYPE_FIELD_BITPOS (type
, variant_field
)
6940 / TARGET_CHAR_BIT
), dval
);
6941 if (branch_type
== NULL
)
6944 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
6945 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6946 TYPE_NFIELDS (rtype
) -= 1;
6950 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6951 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6952 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
6953 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
6955 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
6957 value_free_to_mark (mark
);
6961 /* An ordinary record type (with fixed-length fields) that describes
6962 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
6963 beginning of this section]. Any necessary discriminants' values
6964 should be in DVAL, a record value; it may be NULL if the object
6965 at ADDR itself contains any necessary discriminant values.
6966 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
6967 values from the record are needed. Except in the case that DVAL,
6968 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
6969 unchecked) is replaced by a particular branch of the variant.
6971 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
6972 is questionable and may be removed. It can arise during the
6973 processing of an unconstrained-array-of-record type where all the
6974 variant branches have exactly the same size. This is because in
6975 such cases, the compiler does not bother to use the XVS convention
6976 when encoding the record. I am currently dubious of this
6977 shortcut and suspect the compiler should be altered. FIXME. */
6979 static struct type
*
6980 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
6981 CORE_ADDR address
, struct value
*dval
)
6983 struct type
*templ_type
;
6985 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
6988 templ_type
= dynamic_template_type (type0
);
6990 if (templ_type
!= NULL
)
6991 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
6992 else if (variant_field_index (type0
) >= 0)
6994 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
6996 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7001 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
7007 /* An ordinary record type (with fixed-length fields) that describes
7008 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7009 union type. Any necessary discriminants' values should be in DVAL,
7010 a record value. That is, this routine selects the appropriate
7011 branch of the union at ADDR according to the discriminant value
7012 indicated in the union's type name. */
7014 static struct type
*
7015 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7016 CORE_ADDR address
, struct value
*dval
)
7019 struct type
*templ_type
;
7020 struct type
*var_type
;
7022 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7023 var_type
= TYPE_TARGET_TYPE (var_type0
);
7025 var_type
= var_type0
;
7027 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7029 if (templ_type
!= NULL
)
7030 var_type
= templ_type
;
7033 ada_which_variant_applies (var_type
,
7034 value_type (dval
), value_contents (dval
));
7037 return empty_record (TYPE_OBJFILE (var_type
));
7038 else if (is_dynamic_field (var_type
, which
))
7039 return to_fixed_record_type
7040 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7041 valaddr
, address
, dval
);
7042 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7044 to_fixed_record_type
7045 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7047 return TYPE_FIELD_TYPE (var_type
, which
);
7050 /* Assuming that TYPE0 is an array type describing the type of a value
7051 at ADDR, and that DVAL describes a record containing any
7052 discriminants used in TYPE0, returns a type for the value that
7053 contains no dynamic components (that is, no components whose sizes
7054 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7055 true, gives an error message if the resulting type's size is over
7058 static struct type
*
7059 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7062 struct type
*index_type_desc
;
7063 struct type
*result
;
7065 if (ada_is_packed_array_type (type0
) /* revisit? */
7066 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7069 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7070 if (index_type_desc
== NULL
)
7072 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7073 /* NOTE: elt_type---the fixed version of elt_type0---should never
7074 depend on the contents of the array in properly constructed
7076 /* Create a fixed version of the array element type.
7077 We're not providing the address of an element here,
7078 and thus the actual object value cannot be inspected to do
7079 the conversion. This should not be a problem, since arrays of
7080 unconstrained objects are not allowed. In particular, all
7081 the elements of an array of a tagged type should all be of
7082 the same type specified in the debugging info. No need to
7083 consult the object tag. */
7084 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7086 if (elt_type0
== elt_type
)
7089 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7090 elt_type
, TYPE_INDEX_TYPE (type0
));
7095 struct type
*elt_type0
;
7098 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7099 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7101 /* NOTE: result---the fixed version of elt_type0---should never
7102 depend on the contents of the array in properly constructed
7104 /* Create a fixed version of the array element type.
7105 We're not providing the address of an element here,
7106 and thus the actual object value cannot be inspected to do
7107 the conversion. This should not be a problem, since arrays of
7108 unconstrained objects are not allowed. In particular, all
7109 the elements of an array of a tagged type should all be of
7110 the same type specified in the debugging info. No need to
7111 consult the object tag. */
7113 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7114 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7116 struct type
*range_type
=
7117 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7118 dval
, TYPE_OBJFILE (type0
));
7119 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7120 result
, range_type
);
7122 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7123 error (_("array type with dynamic size is larger than varsize-limit"));
7126 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7131 /* A standard type (containing no dynamically sized components)
7132 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7133 DVAL describes a record containing any discriminants used in TYPE0,
7134 and may be NULL if there are none, or if the object of type TYPE at
7135 ADDRESS or in VALADDR contains these discriminants.
7137 If CHECK_TAG is not null, in the case of tagged types, this function
7138 attempts to locate the object's tag and use it to compute the actual
7139 type. However, when ADDRESS is null, we cannot use it to determine the
7140 location of the tag, and therefore compute the tagged type's actual type.
7141 So we return the tagged type without consulting the tag. */
7143 static struct type
*
7144 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7145 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7147 type
= ada_check_typedef (type
);
7148 switch (TYPE_CODE (type
))
7152 case TYPE_CODE_STRUCT
:
7154 struct type
*static_type
= to_static_fixed_type (type
);
7155 struct type
*fixed_record_type
=
7156 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7157 /* If STATIC_TYPE is a tagged type and we know the object's address,
7158 then we can determine its tag, and compute the object's actual
7159 type from there. Note that we have to use the fixed record
7160 type (the parent part of the record may have dynamic fields
7161 and the way the location of _tag is expressed may depend on
7164 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7166 struct type
*real_type
=
7167 type_from_tag (value_tag_from_contents_and_address
7171 if (real_type
!= NULL
)
7172 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7174 return fixed_record_type
;
7176 case TYPE_CODE_ARRAY
:
7177 return to_fixed_array_type (type
, dval
, 1);
7178 case TYPE_CODE_UNION
:
7182 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7186 /* The same as ada_to_fixed_type_1, except that it preserves the type
7187 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7188 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7191 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7192 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7195 struct type
*fixed_type
=
7196 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7198 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7199 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7205 /* A standard (static-sized) type corresponding as well as possible to
7206 TYPE0, but based on no runtime data. */
7208 static struct type
*
7209 to_static_fixed_type (struct type
*type0
)
7216 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7219 type0
= ada_check_typedef (type0
);
7221 switch (TYPE_CODE (type0
))
7225 case TYPE_CODE_STRUCT
:
7226 type
= dynamic_template_type (type0
);
7228 return template_to_static_fixed_type (type
);
7230 return template_to_static_fixed_type (type0
);
7231 case TYPE_CODE_UNION
:
7232 type
= ada_find_parallel_type (type0
, "___XVU");
7234 return template_to_static_fixed_type (type
);
7236 return template_to_static_fixed_type (type0
);
7240 /* A static approximation of TYPE with all type wrappers removed. */
7242 static struct type
*
7243 static_unwrap_type (struct type
*type
)
7245 if (ada_is_aligner_type (type
))
7247 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7248 if (ada_type_name (type1
) == NULL
)
7249 TYPE_NAME (type1
) = ada_type_name (type
);
7251 return static_unwrap_type (type1
);
7255 struct type
*raw_real_type
= ada_get_base_type (type
);
7256 if (raw_real_type
== type
)
7259 return to_static_fixed_type (raw_real_type
);
7263 /* In some cases, incomplete and private types require
7264 cross-references that are not resolved as records (for example,
7266 type FooP is access Foo;
7268 type Foo is array ...;
7269 ). In these cases, since there is no mechanism for producing
7270 cross-references to such types, we instead substitute for FooP a
7271 stub enumeration type that is nowhere resolved, and whose tag is
7272 the name of the actual type. Call these types "non-record stubs". */
7274 /* A type equivalent to TYPE that is not a non-record stub, if one
7275 exists, otherwise TYPE. */
7278 ada_check_typedef (struct type
*type
)
7283 CHECK_TYPEDEF (type
);
7284 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7285 || !TYPE_STUB (type
)
7286 || TYPE_TAG_NAME (type
) == NULL
)
7290 char *name
= TYPE_TAG_NAME (type
);
7291 struct type
*type1
= ada_find_any_type (name
);
7292 return (type1
== NULL
) ? type
: type1
;
7296 /* A value representing the data at VALADDR/ADDRESS as described by
7297 type TYPE0, but with a standard (static-sized) type that correctly
7298 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7299 type, then return VAL0 [this feature is simply to avoid redundant
7300 creation of struct values]. */
7302 static struct value
*
7303 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7306 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7307 if (type
== type0
&& val0
!= NULL
)
7310 return value_from_contents_and_address (type
, 0, address
);
7313 /* A value representing VAL, but with a standard (static-sized) type
7314 that correctly describes it. Does not necessarily create a new
7317 static struct value
*
7318 ada_to_fixed_value (struct value
*val
)
7320 return ada_to_fixed_value_create (value_type (val
),
7321 VALUE_ADDRESS (val
) + value_offset (val
),
7325 /* A value representing VAL, but with a standard (static-sized) type
7326 chosen to approximate the real type of VAL as well as possible, but
7327 without consulting any runtime values. For Ada dynamic-sized
7328 types, therefore, the type of the result is likely to be inaccurate. */
7331 ada_to_static_fixed_value (struct value
*val
)
7334 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7335 if (type
== value_type (val
))
7338 return coerce_unspec_val_to_type (val
, type
);
7344 /* Table mapping attribute numbers to names.
7345 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7347 static const char *attribute_names
[] = {
7365 ada_attribute_name (enum exp_opcode n
)
7367 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7368 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7370 return attribute_names
[0];
7373 /* Evaluate the 'POS attribute applied to ARG. */
7376 pos_atr (struct value
*arg
)
7378 struct type
*type
= value_type (arg
);
7380 if (!discrete_type_p (type
))
7381 error (_("'POS only defined on discrete types"));
7383 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7386 LONGEST v
= value_as_long (arg
);
7388 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7390 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7393 error (_("enumeration value is invalid: can't find 'POS"));
7396 return value_as_long (arg
);
7399 static struct value
*
7400 value_pos_atr (struct value
*arg
)
7402 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7405 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7407 static struct value
*
7408 value_val_atr (struct type
*type
, struct value
*arg
)
7410 if (!discrete_type_p (type
))
7411 error (_("'VAL only defined on discrete types"));
7412 if (!integer_type_p (value_type (arg
)))
7413 error (_("'VAL requires integral argument"));
7415 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7417 long pos
= value_as_long (arg
);
7418 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7419 error (_("argument to 'VAL out of range"));
7420 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7423 return value_from_longest (type
, value_as_long (arg
));
7429 /* True if TYPE appears to be an Ada character type.
7430 [At the moment, this is true only for Character and Wide_Character;
7431 It is a heuristic test that could stand improvement]. */
7434 ada_is_character_type (struct type
*type
)
7438 /* If the type code says it's a character, then assume it really is,
7439 and don't check any further. */
7440 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7443 /* Otherwise, assume it's a character type iff it is a discrete type
7444 with a known character type name. */
7445 name
= ada_type_name (type
);
7446 return (name
!= NULL
7447 && (TYPE_CODE (type
) == TYPE_CODE_INT
7448 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7449 && (strcmp (name
, "character") == 0
7450 || strcmp (name
, "wide_character") == 0
7451 || strcmp (name
, "wide_wide_character") == 0
7452 || strcmp (name
, "unsigned char") == 0));
7455 /* True if TYPE appears to be an Ada string type. */
7458 ada_is_string_type (struct type
*type
)
7460 type
= ada_check_typedef (type
);
7462 && TYPE_CODE (type
) != TYPE_CODE_PTR
7463 && (ada_is_simple_array_type (type
)
7464 || ada_is_array_descriptor_type (type
))
7465 && ada_array_arity (type
) == 1)
7467 struct type
*elttype
= ada_array_element_type (type
, 1);
7469 return ada_is_character_type (elttype
);
7476 /* True if TYPE is a struct type introduced by the compiler to force the
7477 alignment of a value. Such types have a single field with a
7478 distinctive name. */
7481 ada_is_aligner_type (struct type
*type
)
7483 type
= ada_check_typedef (type
);
7485 /* If we can find a parallel XVS type, then the XVS type should
7486 be used instead of this type. And hence, this is not an aligner
7488 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7491 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7492 && TYPE_NFIELDS (type
) == 1
7493 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7496 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7497 the parallel type. */
7500 ada_get_base_type (struct type
*raw_type
)
7502 struct type
*real_type_namer
;
7503 struct type
*raw_real_type
;
7505 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7508 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7509 if (real_type_namer
== NULL
7510 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7511 || TYPE_NFIELDS (real_type_namer
) != 1)
7514 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7515 if (raw_real_type
== NULL
)
7518 return raw_real_type
;
7521 /* The type of value designated by TYPE, with all aligners removed. */
7524 ada_aligned_type (struct type
*type
)
7526 if (ada_is_aligner_type (type
))
7527 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7529 return ada_get_base_type (type
);
7533 /* The address of the aligned value in an object at address VALADDR
7534 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7537 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7539 if (ada_is_aligner_type (type
))
7540 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7542 TYPE_FIELD_BITPOS (type
,
7543 0) / TARGET_CHAR_BIT
);
7550 /* The printed representation of an enumeration literal with encoded
7551 name NAME. The value is good to the next call of ada_enum_name. */
7553 ada_enum_name (const char *name
)
7555 static char *result
;
7556 static size_t result_len
= 0;
7559 /* First, unqualify the enumeration name:
7560 1. Search for the last '.' character. If we find one, then skip
7561 all the preceeding characters, the unqualified name starts
7562 right after that dot.
7563 2. Otherwise, we may be debugging on a target where the compiler
7564 translates dots into "__". Search forward for double underscores,
7565 but stop searching when we hit an overloading suffix, which is
7566 of the form "__" followed by digits. */
7568 tmp
= strrchr (name
, '.');
7573 while ((tmp
= strstr (name
, "__")) != NULL
)
7575 if (isdigit (tmp
[2]))
7585 if (name
[1] == 'U' || name
[1] == 'W')
7587 if (sscanf (name
+ 2, "%x", &v
) != 1)
7593 GROW_VECT (result
, result_len
, 16);
7594 if (isascii (v
) && isprint (v
))
7595 sprintf (result
, "'%c'", v
);
7596 else if (name
[1] == 'U')
7597 sprintf (result
, "[\"%02x\"]", v
);
7599 sprintf (result
, "[\"%04x\"]", v
);
7605 tmp
= strstr (name
, "__");
7607 tmp
= strstr (name
, "$");
7610 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7611 strncpy (result
, name
, tmp
- name
);
7612 result
[tmp
- name
] = '\0';
7620 static struct value
*
7621 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7624 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7625 (expect_type
, exp
, pos
, noside
);
7628 /* Evaluate the subexpression of EXP starting at *POS as for
7629 evaluate_type, updating *POS to point just past the evaluated
7632 static struct value
*
7633 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7635 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7636 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7639 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7642 static struct value
*
7643 unwrap_value (struct value
*val
)
7645 struct type
*type
= ada_check_typedef (value_type (val
));
7646 if (ada_is_aligner_type (type
))
7648 struct value
*v
= value_struct_elt (&val
, NULL
, "F",
7649 NULL
, "internal structure");
7650 struct type
*val_type
= ada_check_typedef (value_type (v
));
7651 if (ada_type_name (val_type
) == NULL
)
7652 TYPE_NAME (val_type
) = ada_type_name (type
);
7654 return unwrap_value (v
);
7658 struct type
*raw_real_type
=
7659 ada_check_typedef (ada_get_base_type (type
));
7661 if (type
== raw_real_type
)
7665 coerce_unspec_val_to_type
7666 (val
, ada_to_fixed_type (raw_real_type
, 0,
7667 VALUE_ADDRESS (val
) + value_offset (val
),
7672 static struct value
*
7673 cast_to_fixed (struct type
*type
, struct value
*arg
)
7677 if (type
== value_type (arg
))
7679 else if (ada_is_fixed_point_type (value_type (arg
)))
7680 val
= ada_float_to_fixed (type
,
7681 ada_fixed_to_float (value_type (arg
),
7682 value_as_long (arg
)));
7686 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7687 val
= ada_float_to_fixed (type
, argd
);
7690 return value_from_longest (type
, val
);
7693 static struct value
*
7694 cast_from_fixed_to_double (struct value
*arg
)
7696 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7697 value_as_long (arg
));
7698 return value_from_double (builtin_type_double
, val
);
7701 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7702 return the converted value. */
7704 static struct value
*
7705 coerce_for_assign (struct type
*type
, struct value
*val
)
7707 struct type
*type2
= value_type (val
);
7711 type2
= ada_check_typedef (type2
);
7712 type
= ada_check_typedef (type
);
7714 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7715 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7717 val
= ada_value_ind (val
);
7718 type2
= value_type (val
);
7721 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7722 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7724 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7725 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7726 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7727 error (_("Incompatible types in assignment"));
7728 deprecated_set_value_type (val
, type
);
7733 static struct value
*
7734 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7737 struct type
*type1
, *type2
;
7740 arg1
= coerce_ref (arg1
);
7741 arg2
= coerce_ref (arg2
);
7742 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7743 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7745 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7746 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7747 return value_binop (arg1
, arg2
, op
);
7756 return value_binop (arg1
, arg2
, op
);
7759 v2
= value_as_long (arg2
);
7761 error (_("second operand of %s must not be zero."), op_string (op
));
7763 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7764 return value_binop (arg1
, arg2
, op
);
7766 v1
= value_as_long (arg1
);
7771 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7772 v
+= v
> 0 ? -1 : 1;
7780 /* Should not reach this point. */
7784 val
= allocate_value (type1
);
7785 store_unsigned_integer (value_contents_raw (val
),
7786 TYPE_LENGTH (value_type (val
)), v
);
7791 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7793 if (ada_is_direct_array_type (value_type (arg1
))
7794 || ada_is_direct_array_type (value_type (arg2
)))
7796 /* Automatically dereference any array reference before
7797 we attempt to perform the comparison. */
7798 arg1
= ada_coerce_ref (arg1
);
7799 arg2
= ada_coerce_ref (arg2
);
7801 arg1
= ada_coerce_to_simple_array (arg1
);
7802 arg2
= ada_coerce_to_simple_array (arg2
);
7803 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7804 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7805 error (_("Attempt to compare array with non-array"));
7806 /* FIXME: The following works only for types whose
7807 representations use all bits (no padding or undefined bits)
7808 and do not have user-defined equality. */
7810 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7811 && memcmp (value_contents (arg1
), value_contents (arg2
),
7812 TYPE_LENGTH (value_type (arg1
))) == 0;
7814 return value_equal (arg1
, arg2
);
7817 /* Total number of component associations in the aggregate starting at
7818 index PC in EXP. Assumes that index PC is the start of an
7822 num_component_specs (struct expression
*exp
, int pc
)
7825 m
= exp
->elts
[pc
+ 1].longconst
;
7828 for (i
= 0; i
< m
; i
+= 1)
7830 switch (exp
->elts
[pc
].opcode
)
7836 n
+= exp
->elts
[pc
+ 1].longconst
;
7839 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7844 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7845 component of LHS (a simple array or a record), updating *POS past
7846 the expression, assuming that LHS is contained in CONTAINER. Does
7847 not modify the inferior's memory, nor does it modify LHS (unless
7848 LHS == CONTAINER). */
7851 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7852 struct expression
*exp
, int *pos
)
7854 struct value
*mark
= value_mark ();
7856 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7858 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
7859 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7863 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7864 elt
= ada_to_fixed_value (unwrap_value (elt
));
7867 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7868 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7870 value_assign_to_component (container
, elt
,
7871 ada_evaluate_subexp (NULL
, exp
, pos
,
7874 value_free_to_mark (mark
);
7877 /* Assuming that LHS represents an lvalue having a record or array
7878 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7879 of that aggregate's value to LHS, advancing *POS past the
7880 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7881 lvalue containing LHS (possibly LHS itself). Does not modify
7882 the inferior's memory, nor does it modify the contents of
7883 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7885 static struct value
*
7886 assign_aggregate (struct value
*container
,
7887 struct value
*lhs
, struct expression
*exp
,
7888 int *pos
, enum noside noside
)
7890 struct type
*lhs_type
;
7891 int n
= exp
->elts
[*pos
+1].longconst
;
7892 LONGEST low_index
, high_index
;
7895 int max_indices
, num_indices
;
7896 int is_array_aggregate
;
7898 struct value
*mark
= value_mark ();
7901 if (noside
!= EVAL_NORMAL
)
7904 for (i
= 0; i
< n
; i
+= 1)
7905 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
7909 container
= ada_coerce_ref (container
);
7910 if (ada_is_direct_array_type (value_type (container
)))
7911 container
= ada_coerce_to_simple_array (container
);
7912 lhs
= ada_coerce_ref (lhs
);
7913 if (!deprecated_value_modifiable (lhs
))
7914 error (_("Left operand of assignment is not a modifiable lvalue."));
7916 lhs_type
= value_type (lhs
);
7917 if (ada_is_direct_array_type (lhs_type
))
7919 lhs
= ada_coerce_to_simple_array (lhs
);
7920 lhs_type
= value_type (lhs
);
7921 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
7922 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
7923 is_array_aggregate
= 1;
7925 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
7928 high_index
= num_visible_fields (lhs_type
) - 1;
7929 is_array_aggregate
= 0;
7932 error (_("Left-hand side must be array or record."));
7934 num_specs
= num_component_specs (exp
, *pos
- 3);
7935 max_indices
= 4 * num_specs
+ 4;
7936 indices
= alloca (max_indices
* sizeof (indices
[0]));
7937 indices
[0] = indices
[1] = low_index
- 1;
7938 indices
[2] = indices
[3] = high_index
+ 1;
7941 for (i
= 0; i
< n
; i
+= 1)
7943 switch (exp
->elts
[*pos
].opcode
)
7946 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
7947 &num_indices
, max_indices
,
7948 low_index
, high_index
);
7951 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
7952 &num_indices
, max_indices
,
7953 low_index
, high_index
);
7957 error (_("Misplaced 'others' clause"));
7958 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
7959 num_indices
, low_index
, high_index
);
7962 error (_("Internal error: bad aggregate clause"));
7969 /* Assign into the component of LHS indexed by the OP_POSITIONAL
7970 construct at *POS, updating *POS past the construct, given that
7971 the positions are relative to lower bound LOW, where HIGH is the
7972 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
7973 updating *NUM_INDICES as needed. CONTAINER is as for
7974 assign_aggregate. */
7976 aggregate_assign_positional (struct value
*container
,
7977 struct value
*lhs
, struct expression
*exp
,
7978 int *pos
, LONGEST
*indices
, int *num_indices
,
7979 int max_indices
, LONGEST low
, LONGEST high
)
7981 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
7983 if (ind
- 1 == high
)
7984 warning (_("Extra components in aggregate ignored."));
7987 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
7989 assign_component (container
, lhs
, ind
, exp
, pos
);
7992 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7995 /* Assign into the components of LHS indexed by the OP_CHOICES
7996 construct at *POS, updating *POS past the construct, given that
7997 the allowable indices are LOW..HIGH. Record the indices assigned
7998 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
7999 needed. CONTAINER is as for assign_aggregate. */
8001 aggregate_assign_from_choices (struct value
*container
,
8002 struct value
*lhs
, struct expression
*exp
,
8003 int *pos
, LONGEST
*indices
, int *num_indices
,
8004 int max_indices
, LONGEST low
, LONGEST high
)
8007 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8008 int choice_pos
, expr_pc
;
8009 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8011 choice_pos
= *pos
+= 3;
8013 for (j
= 0; j
< n_choices
; j
+= 1)
8014 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8016 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8018 for (j
= 0; j
< n_choices
; j
+= 1)
8020 LONGEST lower
, upper
;
8021 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8022 if (op
== OP_DISCRETE_RANGE
)
8025 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8027 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8032 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8043 name
= &exp
->elts
[choice_pos
+ 2].string
;
8046 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8049 error (_("Invalid record component association."));
8051 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8053 if (! find_struct_field (name
, value_type (lhs
), 0,
8054 NULL
, NULL
, NULL
, NULL
, &ind
))
8055 error (_("Unknown component name: %s."), name
);
8056 lower
= upper
= ind
;
8059 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8060 error (_("Index in component association out of bounds."));
8062 add_component_interval (lower
, upper
, indices
, num_indices
,
8064 while (lower
<= upper
)
8068 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8074 /* Assign the value of the expression in the OP_OTHERS construct in
8075 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8076 have not been previously assigned. The index intervals already assigned
8077 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8078 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8080 aggregate_assign_others (struct value
*container
,
8081 struct value
*lhs
, struct expression
*exp
,
8082 int *pos
, LONGEST
*indices
, int num_indices
,
8083 LONGEST low
, LONGEST high
)
8086 int expr_pc
= *pos
+1;
8088 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8091 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8095 assign_component (container
, lhs
, ind
, exp
, &pos
);
8098 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8101 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8102 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8103 modifying *SIZE as needed. It is an error if *SIZE exceeds
8104 MAX_SIZE. The resulting intervals do not overlap. */
8106 add_component_interval (LONGEST low
, LONGEST high
,
8107 LONGEST
* indices
, int *size
, int max_size
)
8110 for (i
= 0; i
< *size
; i
+= 2) {
8111 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8114 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8115 if (high
< indices
[kh
])
8117 if (low
< indices
[i
])
8119 indices
[i
+ 1] = indices
[kh
- 1];
8120 if (high
> indices
[i
+ 1])
8121 indices
[i
+ 1] = high
;
8122 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8123 *size
-= kh
- i
- 2;
8126 else if (high
< indices
[i
])
8130 if (*size
== max_size
)
8131 error (_("Internal error: miscounted aggregate components."));
8133 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8134 indices
[j
] = indices
[j
- 2];
8136 indices
[i
+ 1] = high
;
8139 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8142 static struct value
*
8143 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8145 if (type
== ada_check_typedef (value_type (arg2
)))
8148 if (ada_is_fixed_point_type (type
))
8149 return (cast_to_fixed (type
, arg2
));
8151 if (ada_is_fixed_point_type (value_type (arg2
)))
8152 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8154 return value_cast (type
, arg2
);
8157 static struct value
*
8158 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8159 int *pos
, enum noside noside
)
8162 int tem
, tem2
, tem3
;
8164 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8167 struct value
**argvec
;
8171 op
= exp
->elts
[pc
].opcode
;
8177 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8178 arg1
= unwrap_value (arg1
);
8180 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8181 then we need to perform the conversion manually, because
8182 evaluate_subexp_standard doesn't do it. This conversion is
8183 necessary in Ada because the different kinds of float/fixed
8184 types in Ada have different representations.
8186 Similarly, we need to perform the conversion from OP_LONG
8188 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8189 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8195 struct value
*result
;
8197 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8198 /* The result type will have code OP_STRING, bashed there from
8199 OP_ARRAY. Bash it back. */
8200 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8201 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8207 type
= exp
->elts
[pc
+ 1].type
;
8208 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8209 if (noside
== EVAL_SKIP
)
8211 arg1
= ada_value_cast (type
, arg1
, noside
);
8216 type
= exp
->elts
[pc
+ 1].type
;
8217 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8220 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8221 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8223 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8224 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8226 return ada_value_assign (arg1
, arg1
);
8228 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8229 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8231 if (ada_is_fixed_point_type (value_type (arg1
)))
8232 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8233 else if (ada_is_fixed_point_type (value_type (arg2
)))
8235 (_("Fixed-point values must be assigned to fixed-point variables"));
8237 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8238 return ada_value_assign (arg1
, arg2
);
8241 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8242 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8243 if (noside
== EVAL_SKIP
)
8245 if ((ada_is_fixed_point_type (value_type (arg1
))
8246 || ada_is_fixed_point_type (value_type (arg2
)))
8247 && value_type (arg1
) != value_type (arg2
))
8248 error (_("Operands of fixed-point addition must have the same type"));
8249 /* Do the addition, and cast the result to the type of the first
8250 argument. We cannot cast the result to a reference type, so if
8251 ARG1 is a reference type, find its underlying type. */
8252 type
= value_type (arg1
);
8253 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8254 type
= TYPE_TARGET_TYPE (type
);
8255 return value_cast (type
, value_add (arg1
, arg2
));
8258 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8259 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8260 if (noside
== EVAL_SKIP
)
8262 if ((ada_is_fixed_point_type (value_type (arg1
))
8263 || ada_is_fixed_point_type (value_type (arg2
)))
8264 && value_type (arg1
) != value_type (arg2
))
8265 error (_("Operands of fixed-point subtraction must have the same type"));
8266 /* Do the substraction, and cast the result to the type of the first
8267 argument. We cannot cast the result to a reference type, so if
8268 ARG1 is a reference type, find its underlying type. */
8269 type
= value_type (arg1
);
8270 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8271 type
= TYPE_TARGET_TYPE (type
);
8272 return value_cast (type
, value_sub (arg1
, arg2
));
8276 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8277 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8278 if (noside
== EVAL_SKIP
)
8280 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8281 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8282 return value_zero (value_type (arg1
), not_lval
);
8285 if (ada_is_fixed_point_type (value_type (arg1
)))
8286 arg1
= cast_from_fixed_to_double (arg1
);
8287 if (ada_is_fixed_point_type (value_type (arg2
)))
8288 arg2
= cast_from_fixed_to_double (arg2
);
8289 return ada_value_binop (arg1
, arg2
, op
);
8294 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8295 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8296 if (noside
== EVAL_SKIP
)
8298 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8299 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8300 return value_zero (value_type (arg1
), not_lval
);
8302 return ada_value_binop (arg1
, arg2
, op
);
8305 case BINOP_NOTEQUAL
:
8306 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8307 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8308 if (noside
== EVAL_SKIP
)
8310 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8313 tem
= ada_value_equal (arg1
, arg2
);
8314 if (op
== BINOP_NOTEQUAL
)
8316 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8319 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8320 if (noside
== EVAL_SKIP
)
8322 else if (ada_is_fixed_point_type (value_type (arg1
)))
8323 return value_cast (value_type (arg1
), value_neg (arg1
));
8325 return value_neg (arg1
);
8327 case BINOP_LOGICAL_AND
:
8328 case BINOP_LOGICAL_OR
:
8329 case UNOP_LOGICAL_NOT
:
8334 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8335 return value_cast (LA_BOOL_TYPE
, val
);
8338 case BINOP_BITWISE_AND
:
8339 case BINOP_BITWISE_IOR
:
8340 case BINOP_BITWISE_XOR
:
8344 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8346 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8348 return value_cast (value_type (arg1
), val
);
8354 /* Tagged types are a little special in the fact that the real type
8355 is dynamic and can only be determined by inspecting the object
8356 value. So even if we're support to do an EVAL_AVOID_SIDE_EFFECTS
8357 evaluation, we force an EVAL_NORMAL evaluation for tagged types. */
8358 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8359 && ada_is_tagged_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
), 1))
8360 noside
= EVAL_NORMAL
;
8362 if (noside
== EVAL_SKIP
)
8367 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8368 /* Only encountered when an unresolved symbol occurs in a
8369 context other than a function call, in which case, it is
8371 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8372 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8373 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8377 (to_static_fixed_type
8378 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8384 unwrap_value (evaluate_subexp_standard
8385 (expect_type
, exp
, pos
, noside
));
8386 return ada_to_fixed_value (arg1
);
8392 /* Allocate arg vector, including space for the function to be
8393 called in argvec[0] and a terminating NULL. */
8394 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8396 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8398 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8399 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8400 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8401 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8404 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8405 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8408 if (noside
== EVAL_SKIP
)
8412 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8413 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8414 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8415 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8416 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8417 argvec
[0] = value_addr (argvec
[0]);
8419 type
= ada_check_typedef (value_type (argvec
[0]));
8420 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8422 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8424 case TYPE_CODE_FUNC
:
8425 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8427 case TYPE_CODE_ARRAY
:
8429 case TYPE_CODE_STRUCT
:
8430 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8431 argvec
[0] = ada_value_ind (argvec
[0]);
8432 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8435 error (_("cannot subscript or call something of type `%s'"),
8436 ada_type_name (value_type (argvec
[0])));
8441 switch (TYPE_CODE (type
))
8443 case TYPE_CODE_FUNC
:
8444 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8445 return allocate_value (TYPE_TARGET_TYPE (type
));
8446 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8447 case TYPE_CODE_STRUCT
:
8451 arity
= ada_array_arity (type
);
8452 type
= ada_array_element_type (type
, nargs
);
8454 error (_("cannot subscript or call a record"));
8456 error (_("wrong number of subscripts; expecting %d"), arity
);
8457 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8458 return value_zero (ada_aligned_type (type
), lval_memory
);
8460 unwrap_value (ada_value_subscript
8461 (argvec
[0], nargs
, argvec
+ 1));
8463 case TYPE_CODE_ARRAY
:
8464 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8466 type
= ada_array_element_type (type
, nargs
);
8468 error (_("element type of array unknown"));
8470 return value_zero (ada_aligned_type (type
), lval_memory
);
8473 unwrap_value (ada_value_subscript
8474 (ada_coerce_to_simple_array (argvec
[0]),
8475 nargs
, argvec
+ 1));
8476 case TYPE_CODE_PTR
: /* Pointer to array */
8477 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8478 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8480 type
= ada_array_element_type (type
, nargs
);
8482 error (_("element type of array unknown"));
8484 return value_zero (ada_aligned_type (type
), lval_memory
);
8487 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8488 nargs
, argvec
+ 1));
8491 error (_("Attempt to index or call something other than an "
8492 "array or function"));
8497 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8498 struct value
*low_bound_val
=
8499 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8500 struct value
*high_bound_val
=
8501 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8504 low_bound_val
= coerce_ref (low_bound_val
);
8505 high_bound_val
= coerce_ref (high_bound_val
);
8506 low_bound
= pos_atr (low_bound_val
);
8507 high_bound
= pos_atr (high_bound_val
);
8509 if (noside
== EVAL_SKIP
)
8512 /* If this is a reference to an aligner type, then remove all
8514 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8515 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8516 TYPE_TARGET_TYPE (value_type (array
)) =
8517 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8519 if (ada_is_packed_array_type (value_type (array
)))
8520 error (_("cannot slice a packed array"));
8522 /* If this is a reference to an array or an array lvalue,
8523 convert to a pointer. */
8524 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8525 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8526 && VALUE_LVAL (array
) == lval_memory
))
8527 array
= value_addr (array
);
8529 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8530 && ada_is_array_descriptor_type (ada_check_typedef
8531 (value_type (array
))))
8532 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8534 array
= ada_coerce_to_simple_array_ptr (array
);
8536 /* If we have more than one level of pointer indirection,
8537 dereference the value until we get only one level. */
8538 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8539 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8541 array
= value_ind (array
);
8543 /* Make sure we really do have an array type before going further,
8544 to avoid a SEGV when trying to get the index type or the target
8545 type later down the road if the debug info generated by
8546 the compiler is incorrect or incomplete. */
8547 if (!ada_is_simple_array_type (value_type (array
)))
8548 error (_("cannot take slice of non-array"));
8550 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8552 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8553 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8557 struct type
*arr_type0
=
8558 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8560 return ada_value_slice_ptr (array
, arr_type0
,
8561 longest_to_int (low_bound
),
8562 longest_to_int (high_bound
));
8565 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8567 else if (high_bound
< low_bound
)
8568 return empty_array (value_type (array
), low_bound
);
8570 return ada_value_slice (array
, longest_to_int (low_bound
),
8571 longest_to_int (high_bound
));
8576 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8577 type
= exp
->elts
[pc
+ 1].type
;
8579 if (noside
== EVAL_SKIP
)
8582 switch (TYPE_CODE (type
))
8585 lim_warning (_("Membership test incompletely implemented; "
8586 "always returns true"));
8587 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8589 case TYPE_CODE_RANGE
:
8590 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8591 arg3
= value_from_longest (builtin_type_int
,
8592 TYPE_HIGH_BOUND (type
));
8594 value_from_longest (builtin_type_int
,
8595 (value_less (arg1
, arg3
)
8596 || value_equal (arg1
, arg3
))
8597 && (value_less (arg2
, arg1
)
8598 || value_equal (arg2
, arg1
)));
8601 case BINOP_IN_BOUNDS
:
8603 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8604 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8606 if (noside
== EVAL_SKIP
)
8609 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8610 return value_zero (builtin_type_int
, not_lval
);
8612 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8614 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8615 error (_("invalid dimension number to 'range"));
8617 arg3
= ada_array_bound (arg2
, tem
, 1);
8618 arg2
= ada_array_bound (arg2
, tem
, 0);
8621 value_from_longest (builtin_type_int
,
8622 (value_less (arg1
, arg3
)
8623 || value_equal (arg1
, arg3
))
8624 && (value_less (arg2
, arg1
)
8625 || value_equal (arg2
, arg1
)));
8627 case TERNOP_IN_RANGE
:
8628 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8629 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8630 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8632 if (noside
== EVAL_SKIP
)
8636 value_from_longest (builtin_type_int
,
8637 (value_less (arg1
, arg3
)
8638 || value_equal (arg1
, arg3
))
8639 && (value_less (arg2
, arg1
)
8640 || value_equal (arg2
, arg1
)));
8646 struct type
*type_arg
;
8647 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8649 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8651 type_arg
= exp
->elts
[pc
+ 2].type
;
8655 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8659 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8660 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8661 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8664 if (noside
== EVAL_SKIP
)
8667 if (type_arg
== NULL
)
8669 arg1
= ada_coerce_ref (arg1
);
8671 if (ada_is_packed_array_type (value_type (arg1
)))
8672 arg1
= ada_coerce_to_simple_array (arg1
);
8674 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8675 error (_("invalid dimension number to '%s"),
8676 ada_attribute_name (op
));
8678 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8680 type
= ada_index_type (value_type (arg1
), tem
);
8683 (_("attempt to take bound of something that is not an array"));
8684 return allocate_value (type
);
8689 default: /* Should never happen. */
8690 error (_("unexpected attribute encountered"));
8692 return ada_array_bound (arg1
, tem
, 0);
8694 return ada_array_bound (arg1
, tem
, 1);
8696 return ada_array_length (arg1
, tem
);
8699 else if (discrete_type_p (type_arg
))
8701 struct type
*range_type
;
8702 char *name
= ada_type_name (type_arg
);
8704 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8706 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8707 if (range_type
== NULL
)
8708 range_type
= type_arg
;
8712 error (_("unexpected attribute encountered"));
8714 return discrete_type_low_bound (range_type
);
8716 return discrete_type_high_bound (range_type
);
8718 error (_("the 'length attribute applies only to array types"));
8721 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8722 error (_("unimplemented type attribute"));
8727 if (ada_is_packed_array_type (type_arg
))
8728 type_arg
= decode_packed_array_type (type_arg
);
8730 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8731 error (_("invalid dimension number to '%s"),
8732 ada_attribute_name (op
));
8734 type
= ada_index_type (type_arg
, tem
);
8737 (_("attempt to take bound of something that is not an array"));
8738 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8739 return allocate_value (type
);
8744 error (_("unexpected attribute encountered"));
8746 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8747 return value_from_longest (type
, low
);
8749 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8750 return value_from_longest (type
, high
);
8752 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8753 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8754 return value_from_longest (type
, high
- low
+ 1);
8760 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8761 if (noside
== EVAL_SKIP
)
8764 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8765 return value_zero (ada_tag_type (arg1
), not_lval
);
8767 return ada_value_tag (arg1
);
8771 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8772 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8773 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8774 if (noside
== EVAL_SKIP
)
8776 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8777 return value_zero (value_type (arg1
), not_lval
);
8779 return value_binop (arg1
, arg2
,
8780 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8782 case OP_ATR_MODULUS
:
8784 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
8785 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8787 if (noside
== EVAL_SKIP
)
8790 if (!ada_is_modular_type (type_arg
))
8791 error (_("'modulus must be applied to modular type"));
8793 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8794 ada_modulus (type_arg
));
8799 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8800 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8801 if (noside
== EVAL_SKIP
)
8803 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8804 return value_zero (builtin_type_int
, not_lval
);
8806 return value_pos_atr (arg1
);
8809 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8810 if (noside
== EVAL_SKIP
)
8812 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8813 return value_zero (builtin_type_int
, not_lval
);
8815 return value_from_longest (builtin_type_int
,
8817 * TYPE_LENGTH (value_type (arg1
)));
8820 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8821 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8822 type
= exp
->elts
[pc
+ 2].type
;
8823 if (noside
== EVAL_SKIP
)
8825 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8826 return value_zero (type
, not_lval
);
8828 return value_val_atr (type
, arg1
);
8831 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8832 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8833 if (noside
== EVAL_SKIP
)
8835 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8836 return value_zero (value_type (arg1
), not_lval
);
8838 return value_binop (arg1
, arg2
, op
);
8841 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8842 if (noside
== EVAL_SKIP
)
8848 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8849 if (noside
== EVAL_SKIP
)
8851 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
8852 return value_neg (arg1
);
8857 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
8858 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
8859 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
8860 if (noside
== EVAL_SKIP
)
8862 type
= ada_check_typedef (value_type (arg1
));
8863 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8865 if (ada_is_array_descriptor_type (type
))
8866 /* GDB allows dereferencing GNAT array descriptors. */
8868 struct type
*arrType
= ada_type_of_array (arg1
, 0);
8869 if (arrType
== NULL
)
8870 error (_("Attempt to dereference null array pointer."));
8871 return value_at_lazy (arrType
, 0);
8873 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
8874 || TYPE_CODE (type
) == TYPE_CODE_REF
8875 /* In C you can dereference an array to get the 1st elt. */
8876 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8878 type
= to_static_fixed_type
8880 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
8882 return value_zero (type
, lval_memory
);
8884 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
8885 /* GDB allows dereferencing an int. */
8886 return value_zero (builtin_type_int
, lval_memory
);
8888 error (_("Attempt to take contents of a non-pointer value."));
8890 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
8891 type
= ada_check_typedef (value_type (arg1
));
8893 if (ada_is_array_descriptor_type (type
))
8894 /* GDB allows dereferencing GNAT array descriptors. */
8895 return ada_coerce_to_simple_array (arg1
);
8897 return ada_value_ind (arg1
);
8899 case STRUCTOP_STRUCT
:
8900 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8901 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
8902 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8903 if (noside
== EVAL_SKIP
)
8905 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8907 struct type
*type1
= value_type (arg1
);
8908 if (ada_is_tagged_type (type1
, 1))
8910 type
= ada_lookup_struct_elt_type (type1
,
8911 &exp
->elts
[pc
+ 2].string
,
8914 /* In this case, we assume that the field COULD exist
8915 in some extension of the type. Return an object of
8916 "type" void, which will match any formal
8917 (see ada_type_match). */
8918 return value_zero (builtin_type_void
, lval_memory
);
8922 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
8925 return value_zero (ada_aligned_type (type
), lval_memory
);
8929 ada_to_fixed_value (unwrap_value
8930 (ada_value_struct_elt
8931 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
8933 /* The value is not supposed to be used. This is here to make it
8934 easier to accommodate expressions that contain types. */
8936 if (noside
== EVAL_SKIP
)
8938 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8939 return allocate_value (exp
->elts
[pc
+ 1].type
);
8941 error (_("Attempt to use a type name as an expression"));
8946 case OP_DISCRETE_RANGE
:
8949 if (noside
== EVAL_NORMAL
)
8953 error (_("Undefined name, ambiguous name, or renaming used in "
8954 "component association: %s."), &exp
->elts
[pc
+2].string
);
8956 error (_("Aggregates only allowed on the right of an assignment"));
8958 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
8961 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
8963 for (tem
= 0; tem
< nargs
; tem
+= 1)
8964 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8969 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
8975 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
8976 type name that encodes the 'small and 'delta information.
8977 Otherwise, return NULL. */
8980 fixed_type_info (struct type
*type
)
8982 const char *name
= ada_type_name (type
);
8983 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
8985 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
8987 const char *tail
= strstr (name
, "___XF_");
8993 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
8994 return fixed_type_info (TYPE_TARGET_TYPE (type
));
8999 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9002 ada_is_fixed_point_type (struct type
*type
)
9004 return fixed_type_info (type
) != NULL
;
9007 /* Return non-zero iff TYPE represents a System.Address type. */
9010 ada_is_system_address_type (struct type
*type
)
9012 return (TYPE_NAME (type
)
9013 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9016 /* Assuming that TYPE is the representation of an Ada fixed-point
9017 type, return its delta, or -1 if the type is malformed and the
9018 delta cannot be determined. */
9021 ada_delta (struct type
*type
)
9023 const char *encoding
= fixed_type_info (type
);
9026 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9029 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9032 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9033 factor ('SMALL value) associated with the type. */
9036 scaling_factor (struct type
*type
)
9038 const char *encoding
= fixed_type_info (type
);
9039 unsigned long num0
, den0
, num1
, den1
;
9042 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9047 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9049 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9053 /* Assuming that X is the representation of a value of fixed-point
9054 type TYPE, return its floating-point equivalent. */
9057 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9059 return (DOUBLEST
) x
*scaling_factor (type
);
9062 /* The representation of a fixed-point value of type TYPE
9063 corresponding to the value X. */
9066 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9068 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9072 /* VAX floating formats */
9074 /* Non-zero iff TYPE represents one of the special VAX floating-point
9078 ada_is_vax_floating_type (struct type
*type
)
9081 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9084 && (TYPE_CODE (type
) == TYPE_CODE_INT
9085 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9086 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9089 /* The type of special VAX floating-point type this is, assuming
9090 ada_is_vax_floating_point. */
9093 ada_vax_float_type_suffix (struct type
*type
)
9095 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9098 /* A value representing the special debugging function that outputs
9099 VAX floating-point values of the type represented by TYPE. Assumes
9100 ada_is_vax_floating_type (TYPE). */
9103 ada_vax_float_print_function (struct type
*type
)
9105 switch (ada_vax_float_type_suffix (type
))
9108 return get_var_value ("DEBUG_STRING_F", 0);
9110 return get_var_value ("DEBUG_STRING_D", 0);
9112 return get_var_value ("DEBUG_STRING_G", 0);
9114 error (_("invalid VAX floating-point type"));
9121 /* Scan STR beginning at position K for a discriminant name, and
9122 return the value of that discriminant field of DVAL in *PX. If
9123 PNEW_K is not null, put the position of the character beyond the
9124 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9125 not alter *PX and *PNEW_K if unsuccessful. */
9128 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9131 static char *bound_buffer
= NULL
;
9132 static size_t bound_buffer_len
= 0;
9135 struct value
*bound_val
;
9137 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9140 pend
= strstr (str
+ k
, "__");
9144 k
+= strlen (bound
);
9148 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9149 bound
= bound_buffer
;
9150 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9151 bound
[pend
- (str
+ k
)] = '\0';
9155 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9156 if (bound_val
== NULL
)
9159 *px
= value_as_long (bound_val
);
9165 /* Value of variable named NAME in the current environment. If
9166 no such variable found, then if ERR_MSG is null, returns 0, and
9167 otherwise causes an error with message ERR_MSG. */
9169 static struct value
*
9170 get_var_value (char *name
, char *err_msg
)
9172 struct ada_symbol_info
*syms
;
9175 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9180 if (err_msg
== NULL
)
9183 error (("%s"), err_msg
);
9186 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9189 /* Value of integer variable named NAME in the current environment. If
9190 no such variable found, returns 0, and sets *FLAG to 0. If
9191 successful, sets *FLAG to 1. */
9194 get_int_var_value (char *name
, int *flag
)
9196 struct value
*var_val
= get_var_value (name
, 0);
9208 return value_as_long (var_val
);
9213 /* Return a range type whose base type is that of the range type named
9214 NAME in the current environment, and whose bounds are calculated
9215 from NAME according to the GNAT range encoding conventions.
9216 Extract discriminant values, if needed, from DVAL. If a new type
9217 must be created, allocate in OBJFILE's space. The bounds
9218 information, in general, is encoded in NAME, the base type given in
9219 the named range type. */
9221 static struct type
*
9222 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9224 struct type
*raw_type
= ada_find_any_type (name
);
9225 struct type
*base_type
;
9228 if (raw_type
== NULL
)
9229 base_type
= builtin_type_int
;
9230 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9231 base_type
= TYPE_TARGET_TYPE (raw_type
);
9233 base_type
= raw_type
;
9235 subtype_info
= strstr (name
, "___XD");
9236 if (subtype_info
== NULL
)
9240 static char *name_buf
= NULL
;
9241 static size_t name_len
= 0;
9242 int prefix_len
= subtype_info
- name
;
9248 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9249 strncpy (name_buf
, name
, prefix_len
);
9250 name_buf
[prefix_len
] = '\0';
9253 bounds_str
= strchr (subtype_info
, '_');
9256 if (*subtype_info
== 'L')
9258 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9259 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9261 if (bounds_str
[n
] == '_')
9263 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9270 strcpy (name_buf
+ prefix_len
, "___L");
9271 L
= get_int_var_value (name_buf
, &ok
);
9274 lim_warning (_("Unknown lower bound, using 1."));
9279 if (*subtype_info
== 'U')
9281 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9282 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9288 strcpy (name_buf
+ prefix_len
, "___U");
9289 U
= get_int_var_value (name_buf
, &ok
);
9292 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9297 if (objfile
== NULL
)
9298 objfile
= TYPE_OBJFILE (base_type
);
9299 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9300 TYPE_NAME (type
) = name
;
9305 /* True iff NAME is the name of a range type. */
9308 ada_is_range_type_name (const char *name
)
9310 return (name
!= NULL
&& strstr (name
, "___XD"));
9316 /* True iff TYPE is an Ada modular type. */
9319 ada_is_modular_type (struct type
*type
)
9321 struct type
*subranged_type
= base_type (type
);
9323 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9324 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9325 && TYPE_UNSIGNED (subranged_type
));
9328 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9331 ada_modulus (struct type
* type
)
9333 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9337 /* Ada exception catchpoint support:
9338 ---------------------------------
9340 We support 3 kinds of exception catchpoints:
9341 . catchpoints on Ada exceptions
9342 . catchpoints on unhandled Ada exceptions
9343 . catchpoints on failed assertions
9345 Exceptions raised during failed assertions, or unhandled exceptions
9346 could perfectly be caught with the general catchpoint on Ada exceptions.
9347 However, we can easily differentiate these two special cases, and having
9348 the option to distinguish these two cases from the rest can be useful
9349 to zero-in on certain situations.
9351 Exception catchpoints are a specialized form of breakpoint,
9352 since they rely on inserting breakpoints inside known routines
9353 of the GNAT runtime. The implementation therefore uses a standard
9354 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9357 Support in the runtime for exception catchpoints have been changed
9358 a few times already, and these changes affect the implementation
9359 of these catchpoints. In order to be able to support several
9360 variants of the runtime, we use a sniffer that will determine
9361 the runtime variant used by the program being debugged.
9363 At this time, we do not support the use of conditions on Ada exception
9364 catchpoints. The COND and COND_STRING fields are therefore set
9365 to NULL (most of the time, see below).
9367 Conditions where EXP_STRING, COND, and COND_STRING are used:
9369 When a user specifies the name of a specific exception in the case
9370 of catchpoints on Ada exceptions, we store the name of that exception
9371 in the EXP_STRING. We then translate this request into an actual
9372 condition stored in COND_STRING, and then parse it into an expression
9375 /* The different types of catchpoints that we introduced for catching
9378 enum exception_catchpoint_kind
9381 ex_catch_exception_unhandled
,
9385 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9387 /* A structure that describes how to support exception catchpoints
9388 for a given executable. */
9390 struct exception_support_info
9392 /* The name of the symbol to break on in order to insert
9393 a catchpoint on exceptions. */
9394 const char *catch_exception_sym
;
9396 /* The name of the symbol to break on in order to insert
9397 a catchpoint on unhandled exceptions. */
9398 const char *catch_exception_unhandled_sym
;
9400 /* The name of the symbol to break on in order to insert
9401 a catchpoint on failed assertions. */
9402 const char *catch_assert_sym
;
9404 /* Assuming that the inferior just triggered an unhandled exception
9405 catchpoint, this function is responsible for returning the address
9406 in inferior memory where the name of that exception is stored.
9407 Return zero if the address could not be computed. */
9408 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9411 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9412 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9414 /* The following exception support info structure describes how to
9415 implement exception catchpoints with the latest version of the
9416 Ada runtime (as of 2007-03-06). */
9418 static const struct exception_support_info default_exception_support_info
=
9420 "__gnat_debug_raise_exception", /* catch_exception_sym */
9421 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9422 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9423 ada_unhandled_exception_name_addr
9426 /* The following exception support info structure describes how to
9427 implement exception catchpoints with a slightly older version
9428 of the Ada runtime. */
9430 static const struct exception_support_info exception_support_info_fallback
=
9432 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9433 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9434 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9435 ada_unhandled_exception_name_addr_from_raise
9438 /* For each executable, we sniff which exception info structure to use
9439 and cache it in the following global variable. */
9441 static const struct exception_support_info
*exception_info
= NULL
;
9443 /* Inspect the Ada runtime and determine which exception info structure
9444 should be used to provide support for exception catchpoints.
9446 This function will always set exception_info, or raise an error. */
9449 ada_exception_support_info_sniffer (void)
9453 /* If the exception info is already known, then no need to recompute it. */
9454 if (exception_info
!= NULL
)
9457 /* Check the latest (default) exception support info. */
9458 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9462 exception_info
= &default_exception_support_info
;
9466 /* Try our fallback exception suport info. */
9467 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9471 exception_info
= &exception_support_info_fallback
;
9475 /* Sometimes, it is normal for us to not be able to find the routine
9476 we are looking for. This happens when the program is linked with
9477 the shared version of the GNAT runtime, and the program has not been
9478 started yet. Inform the user of these two possible causes if
9481 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9482 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9484 /* If the symbol does not exist, then check that the program is
9485 already started, to make sure that shared libraries have been
9486 loaded. If it is not started, this may mean that the symbol is
9487 in a shared library. */
9489 if (ptid_get_pid (inferior_ptid
) == 0)
9490 error (_("Unable to insert catchpoint. Try to start the program first."));
9492 /* At this point, we know that we are debugging an Ada program and
9493 that the inferior has been started, but we still are not able to
9494 find the run-time symbols. That can mean that we are in
9495 configurable run time mode, or that a-except as been optimized
9496 out by the linker... In any case, at this point it is not worth
9497 supporting this feature. */
9499 error (_("Cannot insert catchpoints in this configuration."));
9502 /* An observer of "executable_changed" events.
9503 Its role is to clear certain cached values that need to be recomputed
9504 each time a new executable is loaded by GDB. */
9507 ada_executable_changed_observer (void *unused
)
9509 /* If the executable changed, then it is possible that the Ada runtime
9510 is different. So we need to invalidate the exception support info
9512 exception_info
= NULL
;
9515 /* Return the name of the function at PC, NULL if could not find it.
9516 This function only checks the debugging information, not the symbol
9520 function_name_from_pc (CORE_ADDR pc
)
9524 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9530 /* True iff FRAME is very likely to be that of a function that is
9531 part of the runtime system. This is all very heuristic, but is
9532 intended to be used as advice as to what frames are uninteresting
9536 is_known_support_routine (struct frame_info
*frame
)
9538 struct symtab_and_line sal
;
9542 /* If this code does not have any debugging information (no symtab),
9543 This cannot be any user code. */
9545 find_frame_sal (frame
, &sal
);
9546 if (sal
.symtab
== NULL
)
9549 /* If there is a symtab, but the associated source file cannot be
9550 located, then assume this is not user code: Selecting a frame
9551 for which we cannot display the code would not be very helpful
9552 for the user. This should also take care of case such as VxWorks
9553 where the kernel has some debugging info provided for a few units. */
9555 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9558 /* Check the unit filename againt the Ada runtime file naming.
9559 We also check the name of the objfile against the name of some
9560 known system libraries that sometimes come with debugging info
9563 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9565 re_comp (known_runtime_file_name_patterns
[i
]);
9566 if (re_exec (sal
.symtab
->filename
))
9568 if (sal
.symtab
->objfile
!= NULL
9569 && re_exec (sal
.symtab
->objfile
->name
))
9573 /* Check whether the function is a GNAT-generated entity. */
9575 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9576 if (func_name
== NULL
)
9579 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9581 re_comp (known_auxiliary_function_name_patterns
[i
]);
9582 if (re_exec (func_name
))
9589 /* Find the first frame that contains debugging information and that is not
9590 part of the Ada run-time, starting from FI and moving upward. */
9593 ada_find_printable_frame (struct frame_info
*fi
)
9595 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9597 if (!is_known_support_routine (fi
))
9606 /* Assuming that the inferior just triggered an unhandled exception
9607 catchpoint, return the address in inferior memory where the name
9608 of the exception is stored.
9610 Return zero if the address could not be computed. */
9613 ada_unhandled_exception_name_addr (void)
9615 return parse_and_eval_address ("e.full_name");
9618 /* Same as ada_unhandled_exception_name_addr, except that this function
9619 should be used when the inferior uses an older version of the runtime,
9620 where the exception name needs to be extracted from a specific frame
9621 several frames up in the callstack. */
9624 ada_unhandled_exception_name_addr_from_raise (void)
9627 struct frame_info
*fi
;
9629 /* To determine the name of this exception, we need to select
9630 the frame corresponding to RAISE_SYM_NAME. This frame is
9631 at least 3 levels up, so we simply skip the first 3 frames
9632 without checking the name of their associated function. */
9633 fi
= get_current_frame ();
9634 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9636 fi
= get_prev_frame (fi
);
9640 const char *func_name
=
9641 function_name_from_pc (get_frame_address_in_block (fi
));
9642 if (func_name
!= NULL
9643 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9644 break; /* We found the frame we were looking for... */
9645 fi
= get_prev_frame (fi
);
9652 return parse_and_eval_address ("id.full_name");
9655 /* Assuming the inferior just triggered an Ada exception catchpoint
9656 (of any type), return the address in inferior memory where the name
9657 of the exception is stored, if applicable.
9659 Return zero if the address could not be computed, or if not relevant. */
9662 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9663 struct breakpoint
*b
)
9667 case ex_catch_exception
:
9668 return (parse_and_eval_address ("e.full_name"));
9671 case ex_catch_exception_unhandled
:
9672 return exception_info
->unhandled_exception_name_addr ();
9675 case ex_catch_assert
:
9676 return 0; /* Exception name is not relevant in this case. */
9680 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9684 return 0; /* Should never be reached. */
9687 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9688 any error that ada_exception_name_addr_1 might cause to be thrown.
9689 When an error is intercepted, a warning with the error message is printed,
9690 and zero is returned. */
9693 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9694 struct breakpoint
*b
)
9696 struct gdb_exception e
;
9697 CORE_ADDR result
= 0;
9699 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9701 result
= ada_exception_name_addr_1 (ex
, b
);
9706 warning (_("failed to get exception name: %s"), e
.message
);
9713 /* Implement the PRINT_IT method in the breakpoint_ops structure
9714 for all exception catchpoint kinds. */
9716 static enum print_stop_action
9717 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9719 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9720 char exception_name
[256];
9724 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9725 exception_name
[sizeof (exception_name
) - 1] = '\0';
9728 ada_find_printable_frame (get_current_frame ());
9730 annotate_catchpoint (b
->number
);
9733 case ex_catch_exception
:
9735 printf_filtered (_("\nCatchpoint %d, %s at "),
9736 b
->number
, exception_name
);
9738 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
9740 case ex_catch_exception_unhandled
:
9742 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
9743 b
->number
, exception_name
);
9745 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
9748 case ex_catch_assert
:
9749 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
9754 return PRINT_SRC_AND_LOC
;
9757 /* Implement the PRINT_ONE method in the breakpoint_ops structure
9758 for all exception catchpoint kinds. */
9761 print_one_exception (enum exception_catchpoint_kind ex
,
9762 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9767 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
9771 *last_addr
= b
->loc
->address
;
9774 case ex_catch_exception
:
9775 if (b
->exp_string
!= NULL
)
9777 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
9779 ui_out_field_string (uiout
, "what", msg
);
9783 ui_out_field_string (uiout
, "what", "all Ada exceptions");
9787 case ex_catch_exception_unhandled
:
9788 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
9791 case ex_catch_assert
:
9792 ui_out_field_string (uiout
, "what", "failed Ada assertions");
9796 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9801 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
9802 for all exception catchpoint kinds. */
9805 print_mention_exception (enum exception_catchpoint_kind ex
,
9806 struct breakpoint
*b
)
9810 case ex_catch_exception
:
9811 if (b
->exp_string
!= NULL
)
9812 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
9813 b
->number
, b
->exp_string
);
9815 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
9819 case ex_catch_exception_unhandled
:
9820 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
9824 case ex_catch_assert
:
9825 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
9829 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9834 /* Virtual table for "catch exception" breakpoints. */
9836 static enum print_stop_action
9837 print_it_catch_exception (struct breakpoint
*b
)
9839 return print_it_exception (ex_catch_exception
, b
);
9843 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9845 print_one_exception (ex_catch_exception
, b
, last_addr
);
9849 print_mention_catch_exception (struct breakpoint
*b
)
9851 print_mention_exception (ex_catch_exception
, b
);
9854 static struct breakpoint_ops catch_exception_breakpoint_ops
=
9856 print_it_catch_exception
,
9857 print_one_catch_exception
,
9858 print_mention_catch_exception
9861 /* Virtual table for "catch exception unhandled" breakpoints. */
9863 static enum print_stop_action
9864 print_it_catch_exception_unhandled (struct breakpoint
*b
)
9866 return print_it_exception (ex_catch_exception_unhandled
, b
);
9870 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9872 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
9876 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
9878 print_mention_exception (ex_catch_exception_unhandled
, b
);
9881 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
9882 print_it_catch_exception_unhandled
,
9883 print_one_catch_exception_unhandled
,
9884 print_mention_catch_exception_unhandled
9887 /* Virtual table for "catch assert" breakpoints. */
9889 static enum print_stop_action
9890 print_it_catch_assert (struct breakpoint
*b
)
9892 return print_it_exception (ex_catch_assert
, b
);
9896 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9898 print_one_exception (ex_catch_assert
, b
, last_addr
);
9902 print_mention_catch_assert (struct breakpoint
*b
)
9904 print_mention_exception (ex_catch_assert
, b
);
9907 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
9908 print_it_catch_assert
,
9909 print_one_catch_assert
,
9910 print_mention_catch_assert
9913 /* Return non-zero if B is an Ada exception catchpoint. */
9916 ada_exception_catchpoint_p (struct breakpoint
*b
)
9918 return (b
->ops
== &catch_exception_breakpoint_ops
9919 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
9920 || b
->ops
== &catch_assert_breakpoint_ops
);
9923 /* Return a newly allocated copy of the first space-separated token
9924 in ARGSP, and then adjust ARGSP to point immediately after that
9927 Return NULL if ARGPS does not contain any more tokens. */
9930 ada_get_next_arg (char **argsp
)
9932 char *args
= *argsp
;
9936 /* Skip any leading white space. */
9938 while (isspace (*args
))
9941 if (args
[0] == '\0')
9942 return NULL
; /* No more arguments. */
9944 /* Find the end of the current argument. */
9947 while (*end
!= '\0' && !isspace (*end
))
9950 /* Adjust ARGSP to point to the start of the next argument. */
9954 /* Make a copy of the current argument and return it. */
9956 result
= xmalloc (end
- args
+ 1);
9957 strncpy (result
, args
, end
- args
);
9958 result
[end
- args
] = '\0';
9963 /* Split the arguments specified in a "catch exception" command.
9964 Set EX to the appropriate catchpoint type.
9965 Set EXP_STRING to the name of the specific exception if
9966 specified by the user. */
9969 catch_ada_exception_command_split (char *args
,
9970 enum exception_catchpoint_kind
*ex
,
9973 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
9974 char *exception_name
;
9976 exception_name
= ada_get_next_arg (&args
);
9977 make_cleanup (xfree
, exception_name
);
9979 /* Check that we do not have any more arguments. Anything else
9982 while (isspace (*args
))
9985 if (args
[0] != '\0')
9986 error (_("Junk at end of expression"));
9988 discard_cleanups (old_chain
);
9990 if (exception_name
== NULL
)
9992 /* Catch all exceptions. */
9993 *ex
= ex_catch_exception
;
9996 else if (strcmp (exception_name
, "unhandled") == 0)
9998 /* Catch unhandled exceptions. */
9999 *ex
= ex_catch_exception_unhandled
;
10000 *exp_string
= NULL
;
10004 /* Catch a specific exception. */
10005 *ex
= ex_catch_exception
;
10006 *exp_string
= exception_name
;
10010 /* Return the name of the symbol on which we should break in order to
10011 implement a catchpoint of the EX kind. */
10013 static const char *
10014 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10016 gdb_assert (exception_info
!= NULL
);
10020 case ex_catch_exception
:
10021 return (exception_info
->catch_exception_sym
);
10023 case ex_catch_exception_unhandled
:
10024 return (exception_info
->catch_exception_unhandled_sym
);
10026 case ex_catch_assert
:
10027 return (exception_info
->catch_assert_sym
);
10030 internal_error (__FILE__
, __LINE__
,
10031 _("unexpected catchpoint kind (%d)"), ex
);
10035 /* Return the breakpoint ops "virtual table" used for catchpoints
10038 static struct breakpoint_ops
*
10039 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10043 case ex_catch_exception
:
10044 return (&catch_exception_breakpoint_ops
);
10046 case ex_catch_exception_unhandled
:
10047 return (&catch_exception_unhandled_breakpoint_ops
);
10049 case ex_catch_assert
:
10050 return (&catch_assert_breakpoint_ops
);
10053 internal_error (__FILE__
, __LINE__
,
10054 _("unexpected catchpoint kind (%d)"), ex
);
10058 /* Return the condition that will be used to match the current exception
10059 being raised with the exception that the user wants to catch. This
10060 assumes that this condition is used when the inferior just triggered
10061 an exception catchpoint.
10063 The string returned is a newly allocated string that needs to be
10064 deallocated later. */
10067 ada_exception_catchpoint_cond_string (const char *exp_string
)
10069 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10072 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10074 static struct expression
*
10075 ada_parse_catchpoint_condition (char *cond_string
,
10076 struct symtab_and_line sal
)
10078 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10081 /* Return the symtab_and_line that should be used to insert an exception
10082 catchpoint of the TYPE kind.
10084 EX_STRING should contain the name of a specific exception
10085 that the catchpoint should catch, or NULL otherwise.
10087 The idea behind all the remaining parameters is that their names match
10088 the name of certain fields in the breakpoint structure that are used to
10089 handle exception catchpoints. This function returns the value to which
10090 these fields should be set, depending on the type of catchpoint we need
10093 If COND and COND_STRING are both non-NULL, any value they might
10094 hold will be free'ed, and then replaced by newly allocated ones.
10095 These parameters are left untouched otherwise. */
10097 static struct symtab_and_line
10098 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10099 char **addr_string
, char **cond_string
,
10100 struct expression
**cond
, struct breakpoint_ops
**ops
)
10102 const char *sym_name
;
10103 struct symbol
*sym
;
10104 struct symtab_and_line sal
;
10106 /* First, find out which exception support info to use. */
10107 ada_exception_support_info_sniffer ();
10109 /* Then lookup the function on which we will break in order to catch
10110 the Ada exceptions requested by the user. */
10112 sym_name
= ada_exception_sym_name (ex
);
10113 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10115 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10116 that should be compiled with debugging information. As a result, we
10117 expect to find that symbol in the symtabs. If we don't find it, then
10118 the target most likely does not support Ada exceptions, or we cannot
10119 insert exception breakpoints yet, because the GNAT runtime hasn't been
10122 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10123 in such a way that no debugging information is produced for the symbol
10124 we are looking for. In this case, we could search the minimal symbols
10125 as a fall-back mechanism. This would still be operating in degraded
10126 mode, however, as we would still be missing the debugging information
10127 that is needed in order to extract the name of the exception being
10128 raised (this name is printed in the catchpoint message, and is also
10129 used when trying to catch a specific exception). We do not handle
10130 this case for now. */
10133 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10135 /* Make sure that the symbol we found corresponds to a function. */
10136 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10137 error (_("Symbol \"%s\" is not a function (class = %d)"),
10138 sym_name
, SYMBOL_CLASS (sym
));
10140 sal
= find_function_start_sal (sym
, 1);
10142 /* Set ADDR_STRING. */
10144 *addr_string
= xstrdup (sym_name
);
10146 /* Set the COND and COND_STRING (if not NULL). */
10148 if (cond_string
!= NULL
&& cond
!= NULL
)
10150 if (*cond_string
!= NULL
)
10152 xfree (*cond_string
);
10153 *cond_string
= NULL
;
10160 if (exp_string
!= NULL
)
10162 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10163 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10168 *ops
= ada_exception_breakpoint_ops (ex
);
10173 /* Parse the arguments (ARGS) of the "catch exception" command.
10175 Set TYPE to the appropriate exception catchpoint type.
10176 If the user asked the catchpoint to catch only a specific
10177 exception, then save the exception name in ADDR_STRING.
10179 See ada_exception_sal for a description of all the remaining
10180 function arguments of this function. */
10182 struct symtab_and_line
10183 ada_decode_exception_location (char *args
, char **addr_string
,
10184 char **exp_string
, char **cond_string
,
10185 struct expression
**cond
,
10186 struct breakpoint_ops
**ops
)
10188 enum exception_catchpoint_kind ex
;
10190 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10191 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10195 struct symtab_and_line
10196 ada_decode_assert_location (char *args
, char **addr_string
,
10197 struct breakpoint_ops
**ops
)
10199 /* Check that no argument where provided at the end of the command. */
10203 while (isspace (*args
))
10206 error (_("Junk at end of arguments."));
10209 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10214 /* Information about operators given special treatment in functions
10216 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10218 #define ADA_OPERATORS \
10219 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10220 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10221 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10222 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10223 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10224 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10225 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10226 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10227 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10228 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10229 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10230 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10231 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10232 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10233 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10234 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10235 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10236 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10237 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10240 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10242 switch (exp
->elts
[pc
- 1].opcode
)
10245 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10248 #define OP_DEFN(op, len, args, binop) \
10249 case op: *oplenp = len; *argsp = args; break;
10255 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10260 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10266 ada_op_name (enum exp_opcode opcode
)
10271 return op_name_standard (opcode
);
10273 #define OP_DEFN(op, len, args, binop) case op: return #op;
10278 return "OP_AGGREGATE";
10280 return "OP_CHOICES";
10286 /* As for operator_length, but assumes PC is pointing at the first
10287 element of the operator, and gives meaningful results only for the
10288 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10291 ada_forward_operator_length (struct expression
*exp
, int pc
,
10292 int *oplenp
, int *argsp
)
10294 switch (exp
->elts
[pc
].opcode
)
10297 *oplenp
= *argsp
= 0;
10300 #define OP_DEFN(op, len, args, binop) \
10301 case op: *oplenp = len; *argsp = args; break;
10307 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10312 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10318 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10319 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10327 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10329 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10334 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10338 /* Ada attributes ('Foo). */
10341 case OP_ATR_LENGTH
:
10345 case OP_ATR_MODULUS
:
10352 case UNOP_IN_RANGE
:
10354 /* XXX: gdb_sprint_host_address, type_sprint */
10355 fprintf_filtered (stream
, _("Type @"));
10356 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10357 fprintf_filtered (stream
, " (");
10358 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10359 fprintf_filtered (stream
, ")");
10361 case BINOP_IN_BOUNDS
:
10362 fprintf_filtered (stream
, " (%d)",
10363 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10365 case TERNOP_IN_RANGE
:
10370 case OP_DISCRETE_RANGE
:
10371 case OP_POSITIONAL
:
10378 char *name
= &exp
->elts
[elt
+ 2].string
;
10379 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10380 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10385 return dump_subexp_body_standard (exp
, stream
, elt
);
10389 for (i
= 0; i
< nargs
; i
+= 1)
10390 elt
= dump_subexp (exp
, stream
, elt
);
10395 /* The Ada extension of print_subexp (q.v.). */
10398 ada_print_subexp (struct expression
*exp
, int *pos
,
10399 struct ui_file
*stream
, enum precedence prec
)
10401 int oplen
, nargs
, i
;
10403 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10405 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10412 print_subexp_standard (exp
, pos
, stream
, prec
);
10416 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10419 case BINOP_IN_BOUNDS
:
10420 /* XXX: sprint_subexp */
10421 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10422 fputs_filtered (" in ", stream
);
10423 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10424 fputs_filtered ("'range", stream
);
10425 if (exp
->elts
[pc
+ 1].longconst
> 1)
10426 fprintf_filtered (stream
, "(%ld)",
10427 (long) exp
->elts
[pc
+ 1].longconst
);
10430 case TERNOP_IN_RANGE
:
10431 if (prec
>= PREC_EQUAL
)
10432 fputs_filtered ("(", stream
);
10433 /* XXX: sprint_subexp */
10434 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10435 fputs_filtered (" in ", stream
);
10436 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10437 fputs_filtered (" .. ", stream
);
10438 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10439 if (prec
>= PREC_EQUAL
)
10440 fputs_filtered (")", stream
);
10445 case OP_ATR_LENGTH
:
10449 case OP_ATR_MODULUS
:
10454 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10456 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10457 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10461 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10462 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10466 for (tem
= 1; tem
< nargs
; tem
+= 1)
10468 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10469 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10471 fputs_filtered (")", stream
);
10476 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10477 fputs_filtered ("'(", stream
);
10478 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10479 fputs_filtered (")", stream
);
10482 case UNOP_IN_RANGE
:
10483 /* XXX: sprint_subexp */
10484 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10485 fputs_filtered (" in ", stream
);
10486 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10489 case OP_DISCRETE_RANGE
:
10490 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10491 fputs_filtered ("..", stream
);
10492 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10496 fputs_filtered ("others => ", stream
);
10497 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10501 for (i
= 0; i
< nargs
-1; i
+= 1)
10504 fputs_filtered ("|", stream
);
10505 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10507 fputs_filtered (" => ", stream
);
10508 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10511 case OP_POSITIONAL
:
10512 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10516 fputs_filtered ("(", stream
);
10517 for (i
= 0; i
< nargs
; i
+= 1)
10520 fputs_filtered (", ", stream
);
10521 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10523 fputs_filtered (")", stream
);
10528 /* Table mapping opcodes into strings for printing operators
10529 and precedences of the operators. */
10531 static const struct op_print ada_op_print_tab
[] = {
10532 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10533 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10534 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10535 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10536 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10537 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10538 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10539 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10540 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10541 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10542 {">", BINOP_GTR
, PREC_ORDER
, 0},
10543 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10544 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10545 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10546 {"+", BINOP_ADD
, PREC_ADD
, 0},
10547 {"-", BINOP_SUB
, PREC_ADD
, 0},
10548 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10549 {"*", BINOP_MUL
, PREC_MUL
, 0},
10550 {"/", BINOP_DIV
, PREC_MUL
, 0},
10551 {"rem", BINOP_REM
, PREC_MUL
, 0},
10552 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10553 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10554 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10555 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10556 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10557 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10558 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10559 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10560 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10561 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10562 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10566 enum ada_primitive_types
{
10567 ada_primitive_type_int
,
10568 ada_primitive_type_long
,
10569 ada_primitive_type_short
,
10570 ada_primitive_type_char
,
10571 ada_primitive_type_float
,
10572 ada_primitive_type_double
,
10573 ada_primitive_type_void
,
10574 ada_primitive_type_long_long
,
10575 ada_primitive_type_long_double
,
10576 ada_primitive_type_natural
,
10577 ada_primitive_type_positive
,
10578 ada_primitive_type_system_address
,
10579 nr_ada_primitive_types
10583 ada_language_arch_info (struct gdbarch
*gdbarch
,
10584 struct language_arch_info
*lai
)
10586 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10587 lai
->primitive_type_vector
10588 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10590 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10591 init_type (TYPE_CODE_INT
,
10592 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10593 0, "integer", (struct objfile
*) NULL
);
10594 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10595 init_type (TYPE_CODE_INT
,
10596 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10597 0, "long_integer", (struct objfile
*) NULL
);
10598 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10599 init_type (TYPE_CODE_INT
,
10600 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10601 0, "short_integer", (struct objfile
*) NULL
);
10602 lai
->string_char_type
=
10603 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10604 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10605 0, "character", (struct objfile
*) NULL
);
10606 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10607 init_type (TYPE_CODE_FLT
,
10608 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10609 0, "float", (struct objfile
*) NULL
);
10610 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10611 init_type (TYPE_CODE_FLT
,
10612 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10613 0, "long_float", (struct objfile
*) NULL
);
10614 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10615 init_type (TYPE_CODE_INT
,
10616 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10617 0, "long_long_integer", (struct objfile
*) NULL
);
10618 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10619 init_type (TYPE_CODE_FLT
,
10620 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10621 0, "long_long_float", (struct objfile
*) NULL
);
10622 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10623 init_type (TYPE_CODE_INT
,
10624 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10625 0, "natural", (struct objfile
*) NULL
);
10626 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10627 init_type (TYPE_CODE_INT
,
10628 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10629 0, "positive", (struct objfile
*) NULL
);
10630 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10632 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10633 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10634 (struct objfile
*) NULL
));
10635 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10636 = "system__address";
10639 /* Language vector */
10641 /* Not really used, but needed in the ada_language_defn. */
10644 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10646 ada_emit_char (c
, stream
, quoter
, 1);
10652 warnings_issued
= 0;
10653 return ada_parse ();
10656 static const struct exp_descriptor ada_exp_descriptor
= {
10658 ada_operator_length
,
10660 ada_dump_subexp_body
,
10661 ada_evaluate_subexp
10664 const struct language_defn ada_language_defn
= {
10665 "ada", /* Language name */
10669 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10670 that's not quite what this means. */
10672 &ada_exp_descriptor
,
10676 ada_printchar
, /* Print a character constant */
10677 ada_printstr
, /* Function to print string constant */
10678 emit_char
, /* Function to print single char (not used) */
10679 ada_print_type
, /* Print a type using appropriate syntax */
10680 ada_val_print
, /* Print a value using appropriate syntax */
10681 ada_value_print
, /* Print a top-level value */
10682 NULL
, /* Language specific skip_trampoline */
10683 NULL
, /* value_of_this */
10684 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10685 basic_lookup_transparent_type
, /* lookup_transparent_type */
10686 ada_la_decode
, /* Language specific symbol demangler */
10687 NULL
, /* Language specific class_name_from_physname */
10688 ada_op_print_tab
, /* expression operators for printing */
10689 0, /* c-style arrays */
10690 1, /* String lower bound */
10691 ada_get_gdb_completer_word_break_characters
,
10692 ada_language_arch_info
,
10693 ada_print_array_index
,
10694 default_pass_by_reference
,
10699 _initialize_ada_language (void)
10701 add_language (&ada_language_defn
);
10703 varsize_limit
= 65536;
10705 obstack_init (&symbol_list_obstack
);
10707 decoded_names_store
= htab_create_alloc
10708 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10709 NULL
, xcalloc
, xfree
);
10711 observer_attach_executable_changed (ada_executable_changed_observer
);