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 (gdbarch_bits_big_endian (current_gdbarch
)
1879 && ada_is_modular_type (value_type (arr
)))
1881 /* This is a (right-justified) modular type representing a packed
1882 array with no wrapper. In order to interpret the value through
1883 the (left-justified) packed array type we just built, we must
1884 first left-justify it. */
1885 int bit_size
, bit_pos
;
1888 mod
= ada_modulus (value_type (arr
)) - 1;
1895 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1896 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1897 bit_pos
/ HOST_CHAR_BIT
,
1898 bit_pos
% HOST_CHAR_BIT
,
1903 return coerce_unspec_val_to_type (arr
, type
);
1907 /* The value of the element of packed array ARR at the ARITY indices
1908 given in IND. ARR must be a simple array. */
1910 static struct value
*
1911 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1914 int bits
, elt_off
, bit_off
;
1915 long elt_total_bit_offset
;
1916 struct type
*elt_type
;
1920 elt_total_bit_offset
= 0;
1921 elt_type
= ada_check_typedef (value_type (arr
));
1922 for (i
= 0; i
< arity
; i
+= 1)
1924 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1925 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1927 (_("attempt to do packed indexing of something other than a packed array"));
1930 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1931 LONGEST lowerbound
, upperbound
;
1934 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1936 lim_warning (_("don't know bounds of array"));
1937 lowerbound
= upperbound
= 0;
1940 idx
= value_as_long (value_pos_atr (ind
[i
]));
1941 if (idx
< lowerbound
|| idx
> upperbound
)
1942 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1943 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1944 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1945 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1948 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1949 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1951 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1956 /* Non-zero iff TYPE includes negative integer values. */
1959 has_negatives (struct type
*type
)
1961 switch (TYPE_CODE (type
))
1966 return !TYPE_UNSIGNED (type
);
1967 case TYPE_CODE_RANGE
:
1968 return TYPE_LOW_BOUND (type
) < 0;
1973 /* Create a new value of type TYPE from the contents of OBJ starting
1974 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1975 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1976 assigning through the result will set the field fetched from.
1977 VALADDR is ignored unless OBJ is NULL, in which case,
1978 VALADDR+OFFSET must address the start of storage containing the
1979 packed value. The value returned in this case is never an lval.
1980 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1983 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1984 long offset
, int bit_offset
, int bit_size
,
1988 int src
, /* Index into the source area */
1989 targ
, /* Index into the target area */
1990 srcBitsLeft
, /* Number of source bits left to move */
1991 nsrc
, ntarg
, /* Number of source and target bytes */
1992 unusedLS
, /* Number of bits in next significant
1993 byte of source that are unused */
1994 accumSize
; /* Number of meaningful bits in accum */
1995 unsigned char *bytes
; /* First byte containing data to unpack */
1996 unsigned char *unpacked
;
1997 unsigned long accum
; /* Staging area for bits being transferred */
1999 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2000 /* Transmit bytes from least to most significant; delta is the direction
2001 the indices move. */
2002 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
2004 type
= ada_check_typedef (type
);
2008 v
= allocate_value (type
);
2009 bytes
= (unsigned char *) (valaddr
+ offset
);
2011 else if (value_lazy (obj
))
2014 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
2015 bytes
= (unsigned char *) alloca (len
);
2016 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
2020 v
= allocate_value (type
);
2021 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2026 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
2027 if (VALUE_LVAL (obj
) == lval_internalvar
)
2028 VALUE_LVAL (v
) = lval_internalvar_component
;
2029 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
2030 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2031 set_value_bitsize (v
, bit_size
);
2032 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2034 VALUE_ADDRESS (v
) += 1;
2035 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2039 set_value_bitsize (v
, bit_size
);
2040 unpacked
= (unsigned char *) value_contents (v
);
2042 srcBitsLeft
= bit_size
;
2044 ntarg
= TYPE_LENGTH (type
);
2048 memset (unpacked
, 0, TYPE_LENGTH (type
));
2051 else if (gdbarch_bits_big_endian (current_gdbarch
))
2054 if (has_negatives (type
)
2055 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2059 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2062 switch (TYPE_CODE (type
))
2064 case TYPE_CODE_ARRAY
:
2065 case TYPE_CODE_UNION
:
2066 case TYPE_CODE_STRUCT
:
2067 /* Non-scalar values must be aligned at a byte boundary... */
2069 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2070 /* ... And are placed at the beginning (most-significant) bytes
2072 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2076 targ
= TYPE_LENGTH (type
) - 1;
2082 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2085 unusedLS
= bit_offset
;
2088 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2095 /* Mask for removing bits of the next source byte that are not
2096 part of the value. */
2097 unsigned int unusedMSMask
=
2098 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2100 /* Sign-extend bits for this byte. */
2101 unsigned int signMask
= sign
& ~unusedMSMask
;
2103 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2104 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2105 if (accumSize
>= HOST_CHAR_BIT
)
2107 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2108 accumSize
-= HOST_CHAR_BIT
;
2109 accum
>>= HOST_CHAR_BIT
;
2113 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2120 accum
|= sign
<< accumSize
;
2121 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2122 accumSize
-= HOST_CHAR_BIT
;
2123 accum
>>= HOST_CHAR_BIT
;
2131 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2132 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2135 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2136 int src_offset
, int n
)
2138 unsigned int accum
, mask
;
2139 int accum_bits
, chunk_size
;
2141 target
+= targ_offset
/ HOST_CHAR_BIT
;
2142 targ_offset
%= HOST_CHAR_BIT
;
2143 source
+= src_offset
/ HOST_CHAR_BIT
;
2144 src_offset
%= HOST_CHAR_BIT
;
2145 if (gdbarch_bits_big_endian (current_gdbarch
))
2147 accum
= (unsigned char) *source
;
2149 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2154 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2155 accum_bits
+= HOST_CHAR_BIT
;
2157 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2160 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2161 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2164 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2166 accum_bits
-= chunk_size
;
2173 accum
= (unsigned char) *source
>> src_offset
;
2175 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2179 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2180 accum_bits
+= HOST_CHAR_BIT
;
2182 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2185 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2186 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2188 accum_bits
-= chunk_size
;
2189 accum
>>= chunk_size
;
2196 /* Store the contents of FROMVAL into the location of TOVAL.
2197 Return a new value with the location of TOVAL and contents of
2198 FROMVAL. Handles assignment into packed fields that have
2199 floating-point or non-scalar types. */
2201 static struct value
*
2202 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2204 struct type
*type
= value_type (toval
);
2205 int bits
= value_bitsize (toval
);
2207 toval
= ada_coerce_ref (toval
);
2208 fromval
= ada_coerce_ref (fromval
);
2210 if (ada_is_direct_array_type (value_type (toval
)))
2211 toval
= ada_coerce_to_simple_array (toval
);
2212 if (ada_is_direct_array_type (value_type (fromval
)))
2213 fromval
= ada_coerce_to_simple_array (fromval
);
2215 if (!deprecated_value_modifiable (toval
))
2216 error (_("Left operand of assignment is not a modifiable lvalue."));
2218 if (VALUE_LVAL (toval
) == lval_memory
2220 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2221 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2223 int len
= (value_bitpos (toval
)
2224 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2225 char *buffer
= (char *) alloca (len
);
2227 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2229 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2230 fromval
= value_cast (type
, fromval
);
2232 read_memory (to_addr
, buffer
, len
);
2233 if (gdbarch_bits_big_endian (current_gdbarch
))
2234 move_bits (buffer
, value_bitpos (toval
),
2235 value_contents (fromval
),
2236 TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
-
2239 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2241 write_memory (to_addr
, buffer
, len
);
2242 if (deprecated_memory_changed_hook
)
2243 deprecated_memory_changed_hook (to_addr
, len
);
2245 val
= value_copy (toval
);
2246 memcpy (value_contents_raw (val
), value_contents (fromval
),
2247 TYPE_LENGTH (type
));
2248 deprecated_set_value_type (val
, type
);
2253 return value_assign (toval
, fromval
);
2257 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2258 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2259 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2260 * COMPONENT, and not the inferior's memory. The current contents
2261 * of COMPONENT are ignored. */
2263 value_assign_to_component (struct value
*container
, struct value
*component
,
2266 LONGEST offset_in_container
=
2267 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2268 - VALUE_ADDRESS (container
) - value_offset (container
));
2269 int bit_offset_in_container
=
2270 value_bitpos (component
) - value_bitpos (container
);
2273 val
= value_cast (value_type (component
), val
);
2275 if (value_bitsize (component
) == 0)
2276 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2278 bits
= value_bitsize (component
);
2280 if (gdbarch_bits_big_endian (current_gdbarch
))
2281 move_bits (value_contents_writeable (container
) + offset_in_container
,
2282 value_bitpos (container
) + bit_offset_in_container
,
2283 value_contents (val
),
2284 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2287 move_bits (value_contents_writeable (container
) + offset_in_container
,
2288 value_bitpos (container
) + bit_offset_in_container
,
2289 value_contents (val
), 0, bits
);
2292 /* The value of the element of array ARR at the ARITY indices given in IND.
2293 ARR may be either a simple array, GNAT array descriptor, or pointer
2297 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2301 struct type
*elt_type
;
2303 elt
= ada_coerce_to_simple_array (arr
);
2305 elt_type
= ada_check_typedef (value_type (elt
));
2306 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2307 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2308 return value_subscript_packed (elt
, arity
, ind
);
2310 for (k
= 0; k
< arity
; k
+= 1)
2312 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2313 error (_("too many subscripts (%d expected)"), k
);
2314 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2319 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2320 value of the element of *ARR at the ARITY indices given in
2321 IND. Does not read the entire array into memory. */
2324 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2329 for (k
= 0; k
< arity
; k
+= 1)
2334 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2335 error (_("too many subscripts (%d expected)"), k
);
2336 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2338 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2339 idx
= value_pos_atr (ind
[k
]);
2341 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2342 arr
= value_add (arr
, idx
);
2343 type
= TYPE_TARGET_TYPE (type
);
2346 return value_ind (arr
);
2349 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2350 actual type of ARRAY_PTR is ignored), returns a reference to
2351 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2352 bound of this array is LOW, as per Ada rules. */
2353 static struct value
*
2354 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2357 CORE_ADDR base
= value_as_address (array_ptr
)
2358 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2359 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2360 struct type
*index_type
=
2361 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2363 struct type
*slice_type
=
2364 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2365 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2369 static struct value
*
2370 ada_value_slice (struct value
*array
, int low
, int high
)
2372 struct type
*type
= value_type (array
);
2373 struct type
*index_type
=
2374 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2375 struct type
*slice_type
=
2376 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2377 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2380 /* If type is a record type in the form of a standard GNAT array
2381 descriptor, returns the number of dimensions for type. If arr is a
2382 simple array, returns the number of "array of"s that prefix its
2383 type designation. Otherwise, returns 0. */
2386 ada_array_arity (struct type
*type
)
2393 type
= desc_base_type (type
);
2396 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2397 return desc_arity (desc_bounds_type (type
));
2399 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2402 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2408 /* If TYPE is a record type in the form of a standard GNAT array
2409 descriptor or a simple array type, returns the element type for
2410 TYPE after indexing by NINDICES indices, or by all indices if
2411 NINDICES is -1. Otherwise, returns NULL. */
2414 ada_array_element_type (struct type
*type
, int nindices
)
2416 type
= desc_base_type (type
);
2418 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2421 struct type
*p_array_type
;
2423 p_array_type
= desc_data_type (type
);
2425 k
= ada_array_arity (type
);
2429 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2430 if (nindices
>= 0 && k
> nindices
)
2432 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2433 while (k
> 0 && p_array_type
!= NULL
)
2435 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2438 return p_array_type
;
2440 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2442 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2444 type
= TYPE_TARGET_TYPE (type
);
2453 /* The type of nth index in arrays of given type (n numbering from 1).
2454 Does not examine memory. */
2457 ada_index_type (struct type
*type
, int n
)
2459 struct type
*result_type
;
2461 type
= desc_base_type (type
);
2463 if (n
> ada_array_arity (type
))
2466 if (ada_is_simple_array_type (type
))
2470 for (i
= 1; i
< n
; i
+= 1)
2471 type
= TYPE_TARGET_TYPE (type
);
2472 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2473 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2474 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2475 perhaps stabsread.c would make more sense. */
2476 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2477 result_type
= builtin_type_int
;
2482 return desc_index_type (desc_bounds_type (type
), n
);
2485 /* Given that arr is an array type, returns the lower bound of the
2486 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2487 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2488 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2489 bounds type. It works for other arrays with bounds supplied by
2490 run-time quantities other than discriminants. */
2493 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2494 struct type
** typep
)
2497 struct type
*index_type_desc
;
2499 if (ada_is_packed_array_type (arr_type
))
2500 arr_type
= decode_packed_array_type (arr_type
);
2502 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2505 *typep
= builtin_type_int
;
2506 return (LONGEST
) - which
;
2509 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2510 type
= TYPE_TARGET_TYPE (arr_type
);
2514 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2515 if (index_type_desc
== NULL
)
2517 struct type
*index_type
;
2521 type
= TYPE_TARGET_TYPE (type
);
2525 index_type
= TYPE_INDEX_TYPE (type
);
2527 *typep
= index_type
;
2529 /* The index type is either a range type or an enumerated type.
2530 For the range type, we have some macros that allow us to
2531 extract the value of the low and high bounds. But they
2532 do now work for enumerated types. The expressions used
2533 below work for both range and enum types. */
2535 (LONGEST
) (which
== 0
2536 ? TYPE_FIELD_BITPOS (index_type
, 0)
2537 : TYPE_FIELD_BITPOS (index_type
,
2538 TYPE_NFIELDS (index_type
) - 1));
2542 struct type
*index_type
=
2543 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2544 NULL
, TYPE_OBJFILE (arr_type
));
2547 *typep
= index_type
;
2550 (LONGEST
) (which
== 0
2551 ? TYPE_LOW_BOUND (index_type
)
2552 : TYPE_HIGH_BOUND (index_type
));
2556 /* Given that arr is an array value, returns the lower bound of the
2557 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2558 WHICH is 1. This routine will also work for arrays with bounds
2559 supplied by run-time quantities other than discriminants. */
2562 ada_array_bound (struct value
*arr
, int n
, int which
)
2564 struct type
*arr_type
= value_type (arr
);
2566 if (ada_is_packed_array_type (arr_type
))
2567 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2568 else if (ada_is_simple_array_type (arr_type
))
2571 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2572 return value_from_longest (type
, v
);
2575 return desc_one_bound (desc_bounds (arr
), n
, which
);
2578 /* Given that arr is an array value, returns the length of the
2579 nth index. This routine will also work for arrays with bounds
2580 supplied by run-time quantities other than discriminants.
2581 Does not work for arrays indexed by enumeration types with representation
2582 clauses at the moment. */
2585 ada_array_length (struct value
*arr
, int n
)
2587 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2589 if (ada_is_packed_array_type (arr_type
))
2590 return ada_array_length (decode_packed_array (arr
), n
);
2592 if (ada_is_simple_array_type (arr_type
))
2596 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2597 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2598 return value_from_longest (type
, v
);
2602 value_from_longest (builtin_type_int
,
2603 value_as_long (desc_one_bound (desc_bounds (arr
),
2605 - value_as_long (desc_one_bound (desc_bounds (arr
),
2609 /* An empty array whose type is that of ARR_TYPE (an array type),
2610 with bounds LOW to LOW-1. */
2612 static struct value
*
2613 empty_array (struct type
*arr_type
, int low
)
2615 struct type
*index_type
=
2616 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2618 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2619 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2623 /* Name resolution */
2625 /* The "decoded" name for the user-definable Ada operator corresponding
2629 ada_decoded_op_name (enum exp_opcode op
)
2633 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2635 if (ada_opname_table
[i
].op
== op
)
2636 return ada_opname_table
[i
].decoded
;
2638 error (_("Could not find operator name for opcode"));
2642 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2643 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2644 undefined namespace) and converts operators that are
2645 user-defined into appropriate function calls. If CONTEXT_TYPE is
2646 non-null, it provides a preferred result type [at the moment, only
2647 type void has any effect---causing procedures to be preferred over
2648 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2649 return type is preferred. May change (expand) *EXP. */
2652 resolve (struct expression
**expp
, int void_context_p
)
2656 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2659 /* Resolve the operator of the subexpression beginning at
2660 position *POS of *EXPP. "Resolving" consists of replacing
2661 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2662 with their resolutions, replacing built-in operators with
2663 function calls to user-defined operators, where appropriate, and,
2664 when DEPROCEDURE_P is non-zero, converting function-valued variables
2665 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2666 are as in ada_resolve, above. */
2668 static struct value
*
2669 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2670 struct type
*context_type
)
2674 struct expression
*exp
; /* Convenience: == *expp. */
2675 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2676 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2677 int nargs
; /* Number of operands. */
2684 /* Pass one: resolve operands, saving their types and updating *pos,
2689 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2690 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2695 resolve_subexp (expp
, pos
, 0, NULL
);
2697 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2702 resolve_subexp (expp
, pos
, 0, NULL
);
2707 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2710 case OP_ATR_MODULUS
:
2720 case TERNOP_IN_RANGE
:
2721 case BINOP_IN_BOUNDS
:
2727 case OP_DISCRETE_RANGE
:
2729 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2738 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2740 resolve_subexp (expp
, pos
, 1, NULL
);
2742 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2759 case BINOP_LOGICAL_AND
:
2760 case BINOP_LOGICAL_OR
:
2761 case BINOP_BITWISE_AND
:
2762 case BINOP_BITWISE_IOR
:
2763 case BINOP_BITWISE_XOR
:
2766 case BINOP_NOTEQUAL
:
2773 case BINOP_SUBSCRIPT
:
2781 case UNOP_LOGICAL_NOT
:
2797 case OP_INTERNALVAR
:
2807 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2810 case STRUCTOP_STRUCT
:
2811 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2824 error (_("Unexpected operator during name resolution"));
2827 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2828 for (i
= 0; i
< nargs
; i
+= 1)
2829 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2833 /* Pass two: perform any resolution on principal operator. */
2840 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2842 struct ada_symbol_info
*candidates
;
2846 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2847 (exp
->elts
[pc
+ 2].symbol
),
2848 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2851 if (n_candidates
> 1)
2853 /* Types tend to get re-introduced locally, so if there
2854 are any local symbols that are not types, first filter
2857 for (j
= 0; j
< n_candidates
; j
+= 1)
2858 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2864 case LOC_REGPARM_ADDR
:
2868 case LOC_BASEREG_ARG
:
2870 case LOC_COMPUTED_ARG
:
2876 if (j
< n_candidates
)
2879 while (j
< n_candidates
)
2881 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2883 candidates
[j
] = candidates
[n_candidates
- 1];
2892 if (n_candidates
== 0)
2893 error (_("No definition found for %s"),
2894 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2895 else if (n_candidates
== 1)
2897 else if (deprocedure_p
2898 && !is_nonfunction (candidates
, n_candidates
))
2900 i
= ada_resolve_function
2901 (candidates
, n_candidates
, NULL
, 0,
2902 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2905 error (_("Could not find a match for %s"),
2906 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2910 printf_filtered (_("Multiple matches for %s\n"),
2911 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2912 user_select_syms (candidates
, n_candidates
, 1);
2916 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2917 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2918 if (innermost_block
== NULL
2919 || contained_in (candidates
[i
].block
, innermost_block
))
2920 innermost_block
= candidates
[i
].block
;
2924 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2927 replace_operator_with_call (expp
, pc
, 0, 0,
2928 exp
->elts
[pc
+ 2].symbol
,
2929 exp
->elts
[pc
+ 1].block
);
2936 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2937 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2939 struct ada_symbol_info
*candidates
;
2943 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2944 (exp
->elts
[pc
+ 5].symbol
),
2945 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2947 if (n_candidates
== 1)
2951 i
= ada_resolve_function
2952 (candidates
, n_candidates
,
2954 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2957 error (_("Could not find a match for %s"),
2958 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2961 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2962 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2963 if (innermost_block
== NULL
2964 || contained_in (candidates
[i
].block
, innermost_block
))
2965 innermost_block
= candidates
[i
].block
;
2976 case BINOP_BITWISE_AND
:
2977 case BINOP_BITWISE_IOR
:
2978 case BINOP_BITWISE_XOR
:
2980 case BINOP_NOTEQUAL
:
2988 case UNOP_LOGICAL_NOT
:
2990 if (possible_user_operator_p (op
, argvec
))
2992 struct ada_symbol_info
*candidates
;
2996 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2997 (struct block
*) NULL
, VAR_DOMAIN
,
2999 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3000 ada_decoded_op_name (op
), NULL
);
3004 replace_operator_with_call (expp
, pc
, nargs
, 1,
3005 candidates
[i
].sym
, candidates
[i
].block
);
3016 return evaluate_subexp_type (exp
, pos
);
3019 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3020 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3021 a non-pointer. A type of 'void' (which is never a valid expression type)
3022 by convention matches anything. */
3023 /* The term "match" here is rather loose. The match is heuristic and
3024 liberal. FIXME: TOO liberal, in fact. */
3027 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3029 ftype
= ada_check_typedef (ftype
);
3030 atype
= ada_check_typedef (atype
);
3032 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3033 ftype
= TYPE_TARGET_TYPE (ftype
);
3034 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3035 atype
= TYPE_TARGET_TYPE (atype
);
3037 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3038 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3041 switch (TYPE_CODE (ftype
))
3046 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3047 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3048 TYPE_TARGET_TYPE (atype
), 0);
3051 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3053 case TYPE_CODE_ENUM
:
3054 case TYPE_CODE_RANGE
:
3055 switch (TYPE_CODE (atype
))
3058 case TYPE_CODE_ENUM
:
3059 case TYPE_CODE_RANGE
:
3065 case TYPE_CODE_ARRAY
:
3066 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3067 || ada_is_array_descriptor_type (atype
));
3069 case TYPE_CODE_STRUCT
:
3070 if (ada_is_array_descriptor_type (ftype
))
3071 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3072 || ada_is_array_descriptor_type (atype
));
3074 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3075 && !ada_is_array_descriptor_type (atype
));
3077 case TYPE_CODE_UNION
:
3079 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3083 /* Return non-zero if the formals of FUNC "sufficiently match" the
3084 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3085 may also be an enumeral, in which case it is treated as a 0-
3086 argument function. */
3089 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3092 struct type
*func_type
= SYMBOL_TYPE (func
);
3094 if (SYMBOL_CLASS (func
) == LOC_CONST
3095 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3096 return (n_actuals
== 0);
3097 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3100 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3103 for (i
= 0; i
< n_actuals
; i
+= 1)
3105 if (actuals
[i
] == NULL
)
3109 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3110 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3112 if (!ada_type_match (ftype
, atype
, 1))
3119 /* False iff function type FUNC_TYPE definitely does not produce a value
3120 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3121 FUNC_TYPE is not a valid function type with a non-null return type
3122 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3125 return_match (struct type
*func_type
, struct type
*context_type
)
3127 struct type
*return_type
;
3129 if (func_type
== NULL
)
3132 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3133 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3135 return_type
= base_type (func_type
);
3136 if (return_type
== NULL
)
3139 context_type
= base_type (context_type
);
3141 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3142 return context_type
== NULL
|| return_type
== context_type
;
3143 else if (context_type
== NULL
)
3144 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3146 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3150 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3151 function (if any) that matches the types of the NARGS arguments in
3152 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3153 that returns that type, then eliminate matches that don't. If
3154 CONTEXT_TYPE is void and there is at least one match that does not
3155 return void, eliminate all matches that do.
3157 Asks the user if there is more than one match remaining. Returns -1
3158 if there is no such symbol or none is selected. NAME is used
3159 solely for messages. May re-arrange and modify SYMS in
3160 the process; the index returned is for the modified vector. */
3163 ada_resolve_function (struct ada_symbol_info syms
[],
3164 int nsyms
, struct value
**args
, int nargs
,
3165 const char *name
, struct type
*context_type
)
3168 int m
; /* Number of hits */
3169 struct type
*fallback
;
3170 struct type
*return_type
;
3172 return_type
= context_type
;
3173 if (context_type
== NULL
)
3174 fallback
= builtin_type_void
;
3181 for (k
= 0; k
< nsyms
; k
+= 1)
3183 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3185 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3186 && return_match (type
, return_type
))
3192 if (m
> 0 || return_type
== fallback
)
3195 return_type
= fallback
;
3202 printf_filtered (_("Multiple matches for %s\n"), name
);
3203 user_select_syms (syms
, m
, 1);
3209 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3210 in a listing of choices during disambiguation (see sort_choices, below).
3211 The idea is that overloadings of a subprogram name from the
3212 same package should sort in their source order. We settle for ordering
3213 such symbols by their trailing number (__N or $N). */
3216 encoded_ordered_before (char *N0
, char *N1
)
3220 else if (N0
== NULL
)
3225 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3227 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3229 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3230 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3234 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3237 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3239 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3240 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3242 return (strcmp (N0
, N1
) < 0);
3246 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3250 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3253 for (i
= 1; i
< nsyms
; i
+= 1)
3255 struct ada_symbol_info sym
= syms
[i
];
3258 for (j
= i
- 1; j
>= 0; j
-= 1)
3260 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3261 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3263 syms
[j
+ 1] = syms
[j
];
3269 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3270 by asking the user (if necessary), returning the number selected,
3271 and setting the first elements of SYMS items. Error if no symbols
3274 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3275 to be re-integrated one of these days. */
3278 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3281 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3283 int first_choice
= (max_results
== 1) ? 1 : 2;
3285 if (max_results
< 1)
3286 error (_("Request to select 0 symbols!"));
3290 printf_unfiltered (_("[0] cancel\n"));
3291 if (max_results
> 1)
3292 printf_unfiltered (_("[1] all\n"));
3294 sort_choices (syms
, nsyms
);
3296 for (i
= 0; i
< nsyms
; i
+= 1)
3298 if (syms
[i
].sym
== NULL
)
3301 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3303 struct symtab_and_line sal
=
3304 find_function_start_sal (syms
[i
].sym
, 1);
3305 if (sal
.symtab
== NULL
)
3306 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3308 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3311 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3312 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3313 sal
.symtab
->filename
, sal
.line
);
3319 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3320 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3321 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3322 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3324 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3325 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3327 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3328 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3329 else if (is_enumeral
3330 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3332 printf_unfiltered (("[%d] "), i
+ first_choice
);
3333 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3335 printf_unfiltered (_("'(%s) (enumeral)\n"),
3336 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3338 else if (symtab
!= NULL
)
3339 printf_unfiltered (is_enumeral
3340 ? _("[%d] %s in %s (enumeral)\n")
3341 : _("[%d] %s at %s:?\n"),
3343 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3346 printf_unfiltered (is_enumeral
3347 ? _("[%d] %s (enumeral)\n")
3348 : _("[%d] %s at ?\n"),
3350 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3354 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3357 for (i
= 0; i
< n_chosen
; i
+= 1)
3358 syms
[i
] = syms
[chosen
[i
]];
3363 /* Read and validate a set of numeric choices from the user in the
3364 range 0 .. N_CHOICES-1. Place the results in increasing
3365 order in CHOICES[0 .. N-1], and return N.
3367 The user types choices as a sequence of numbers on one line
3368 separated by blanks, encoding them as follows:
3370 + A choice of 0 means to cancel the selection, throwing an error.
3371 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3372 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3374 The user is not allowed to choose more than MAX_RESULTS values.
3376 ANNOTATION_SUFFIX, if present, is used to annotate the input
3377 prompts (for use with the -f switch). */
3380 get_selections (int *choices
, int n_choices
, int max_results
,
3381 int is_all_choice
, char *annotation_suffix
)
3386 int first_choice
= is_all_choice
? 2 : 1;
3388 prompt
= getenv ("PS2");
3392 printf_unfiltered (("%s "), prompt
);
3393 gdb_flush (gdb_stdout
);
3395 args
= command_line_input ((char *) NULL
, 0, annotation_suffix
);
3398 error_no_arg (_("one or more choice numbers"));
3402 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3403 order, as given in args. Choices are validated. */
3409 while (isspace (*args
))
3411 if (*args
== '\0' && n_chosen
== 0)
3412 error_no_arg (_("one or more choice numbers"));
3413 else if (*args
== '\0')
3416 choice
= strtol (args
, &args2
, 10);
3417 if (args
== args2
|| choice
< 0
3418 || choice
> n_choices
+ first_choice
- 1)
3419 error (_("Argument must be choice number"));
3423 error (_("cancelled"));
3425 if (choice
< first_choice
)
3427 n_chosen
= n_choices
;
3428 for (j
= 0; j
< n_choices
; j
+= 1)
3432 choice
-= first_choice
;
3434 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3438 if (j
< 0 || choice
!= choices
[j
])
3441 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3442 choices
[k
+ 1] = choices
[k
];
3443 choices
[j
+ 1] = choice
;
3448 if (n_chosen
> max_results
)
3449 error (_("Select no more than %d of the above"), max_results
);
3454 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3455 on the function identified by SYM and BLOCK, and taking NARGS
3456 arguments. Update *EXPP as needed to hold more space. */
3459 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3460 int oplen
, struct symbol
*sym
,
3461 struct block
*block
)
3463 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3464 symbol, -oplen for operator being replaced). */
3465 struct expression
*newexp
= (struct expression
*)
3466 xmalloc (sizeof (struct expression
)
3467 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3468 struct expression
*exp
= *expp
;
3470 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3471 newexp
->language_defn
= exp
->language_defn
;
3472 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3473 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3474 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3476 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3477 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3479 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3480 newexp
->elts
[pc
+ 4].block
= block
;
3481 newexp
->elts
[pc
+ 5].symbol
= sym
;
3487 /* Type-class predicates */
3489 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3493 numeric_type_p (struct type
*type
)
3499 switch (TYPE_CODE (type
))
3504 case TYPE_CODE_RANGE
:
3505 return (type
== TYPE_TARGET_TYPE (type
)
3506 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3513 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3516 integer_type_p (struct type
*type
)
3522 switch (TYPE_CODE (type
))
3526 case TYPE_CODE_RANGE
:
3527 return (type
== TYPE_TARGET_TYPE (type
)
3528 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3535 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3538 scalar_type_p (struct type
*type
)
3544 switch (TYPE_CODE (type
))
3547 case TYPE_CODE_RANGE
:
3548 case TYPE_CODE_ENUM
:
3557 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3560 discrete_type_p (struct type
*type
)
3566 switch (TYPE_CODE (type
))
3569 case TYPE_CODE_RANGE
:
3570 case TYPE_CODE_ENUM
:
3578 /* Returns non-zero if OP with operands in the vector ARGS could be
3579 a user-defined function. Errs on the side of pre-defined operators
3580 (i.e., result 0). */
3583 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3585 struct type
*type0
=
3586 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3587 struct type
*type1
=
3588 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3602 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3606 case BINOP_BITWISE_AND
:
3607 case BINOP_BITWISE_IOR
:
3608 case BINOP_BITWISE_XOR
:
3609 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3612 case BINOP_NOTEQUAL
:
3617 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3620 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3623 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3627 case UNOP_LOGICAL_NOT
:
3629 return (!numeric_type_p (type0
));
3638 1. In the following, we assume that a renaming type's name may
3639 have an ___XD suffix. It would be nice if this went away at some
3641 2. We handle both the (old) purely type-based representation of
3642 renamings and the (new) variable-based encoding. At some point,
3643 it is devoutly to be hoped that the former goes away
3644 (FIXME: hilfinger-2007-07-09).
3645 3. Subprogram renamings are not implemented, although the XRS
3646 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3648 /* If SYM encodes a renaming,
3650 <renaming> renames <renamed entity>,
3652 sets *LEN to the length of the renamed entity's name,
3653 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3654 the string describing the subcomponent selected from the renamed
3655 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3656 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3657 are undefined). Otherwise, returns a value indicating the category
3658 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3659 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3660 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3661 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3662 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3663 may be NULL, in which case they are not assigned.
3665 [Currently, however, GCC does not generate subprogram renamings.] */
3667 enum ada_renaming_category
3668 ada_parse_renaming (struct symbol
*sym
,
3669 const char **renamed_entity
, int *len
,
3670 const char **renaming_expr
)
3672 enum ada_renaming_category kind
;
3677 return ADA_NOT_RENAMING
;
3678 switch (SYMBOL_CLASS (sym
))
3681 return ADA_NOT_RENAMING
;
3683 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3684 renamed_entity
, len
, renaming_expr
);
3688 case LOC_OPTIMIZED_OUT
:
3689 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3691 return ADA_NOT_RENAMING
;
3695 kind
= ADA_OBJECT_RENAMING
;
3699 kind
= ADA_EXCEPTION_RENAMING
;
3703 kind
= ADA_PACKAGE_RENAMING
;
3707 kind
= ADA_SUBPROGRAM_RENAMING
;
3711 return ADA_NOT_RENAMING
;
3715 if (renamed_entity
!= NULL
)
3716 *renamed_entity
= info
;
3717 suffix
= strstr (info
, "___XE");
3718 if (suffix
== NULL
|| suffix
== info
)
3719 return ADA_NOT_RENAMING
;
3721 *len
= strlen (info
) - strlen (suffix
);
3723 if (renaming_expr
!= NULL
)
3724 *renaming_expr
= suffix
;
3728 /* Assuming TYPE encodes a renaming according to the old encoding in
3729 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3730 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3731 ADA_NOT_RENAMING otherwise. */
3732 static enum ada_renaming_category
3733 parse_old_style_renaming (struct type
*type
,
3734 const char **renamed_entity
, int *len
,
3735 const char **renaming_expr
)
3737 enum ada_renaming_category kind
;
3742 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3743 || TYPE_NFIELDS (type
) != 1)
3744 return ADA_NOT_RENAMING
;
3746 name
= type_name_no_tag (type
);
3748 return ADA_NOT_RENAMING
;
3750 name
= strstr (name
, "___XR");
3752 return ADA_NOT_RENAMING
;
3757 kind
= ADA_OBJECT_RENAMING
;
3760 kind
= ADA_EXCEPTION_RENAMING
;
3763 kind
= ADA_PACKAGE_RENAMING
;
3766 kind
= ADA_SUBPROGRAM_RENAMING
;
3769 return ADA_NOT_RENAMING
;
3772 info
= TYPE_FIELD_NAME (type
, 0);
3774 return ADA_NOT_RENAMING
;
3775 if (renamed_entity
!= NULL
)
3776 *renamed_entity
= info
;
3777 suffix
= strstr (info
, "___XE");
3778 if (renaming_expr
!= NULL
)
3779 *renaming_expr
= suffix
+ 5;
3780 if (suffix
== NULL
|| suffix
== info
)
3781 return ADA_NOT_RENAMING
;
3783 *len
= suffix
- info
;
3789 /* Evaluation: Function Calls */
3791 /* Return an lvalue containing the value VAL. This is the identity on
3792 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3793 on the stack, using and updating *SP as the stack pointer, and
3794 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3796 static struct value
*
3797 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3799 if (! VALUE_LVAL (val
))
3801 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3803 /* The following is taken from the structure-return code in
3804 call_function_by_hand. FIXME: Therefore, some refactoring seems
3806 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3808 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3809 reserving sufficient space. */
3811 if (gdbarch_frame_align_p (current_gdbarch
))
3812 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3813 VALUE_ADDRESS (val
) = *sp
;
3817 /* Stack grows upward. Align the frame, allocate space, and
3818 then again, re-align the frame. */
3819 if (gdbarch_frame_align_p (current_gdbarch
))
3820 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3821 VALUE_ADDRESS (val
) = *sp
;
3823 if (gdbarch_frame_align_p (current_gdbarch
))
3824 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3826 VALUE_LVAL (val
) = lval_memory
;
3828 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3834 /* Return the value ACTUAL, converted to be an appropriate value for a
3835 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3836 allocating any necessary descriptors (fat pointers), or copies of
3837 values not residing in memory, updating it as needed. */
3840 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3843 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3844 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3845 struct type
*formal_target
=
3846 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3847 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3848 struct type
*actual_target
=
3849 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3850 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3852 if (ada_is_array_descriptor_type (formal_target
)
3853 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3854 return make_array_descriptor (formal_type
, actual
, sp
);
3855 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3856 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3858 struct value
*result
;
3859 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3860 && ada_is_array_descriptor_type (actual_target
))
3861 result
= desc_data (actual
);
3862 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3864 if (VALUE_LVAL (actual
) != lval_memory
)
3867 actual_type
= ada_check_typedef (value_type (actual
));
3868 val
= allocate_value (actual_type
);
3869 memcpy ((char *) value_contents_raw (val
),
3870 (char *) value_contents (actual
),
3871 TYPE_LENGTH (actual_type
));
3872 actual
= ensure_lval (val
, sp
);
3874 result
= value_addr (actual
);
3878 return value_cast_pointers (formal_type
, result
);
3880 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3881 return ada_value_ind (actual
);
3887 /* Push a descriptor of type TYPE for array value ARR on the stack at
3888 *SP, updating *SP to reflect the new descriptor. Return either
3889 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3890 to-descriptor type rather than a descriptor type), a struct value *
3891 representing a pointer to this descriptor. */
3893 static struct value
*
3894 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3896 struct type
*bounds_type
= desc_bounds_type (type
);
3897 struct type
*desc_type
= desc_base_type (type
);
3898 struct value
*descriptor
= allocate_value (desc_type
);
3899 struct value
*bounds
= allocate_value (bounds_type
);
3902 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3904 modify_general_field (value_contents_writeable (bounds
),
3905 value_as_long (ada_array_bound (arr
, i
, 0)),
3906 desc_bound_bitpos (bounds_type
, i
, 0),
3907 desc_bound_bitsize (bounds_type
, i
, 0));
3908 modify_general_field (value_contents_writeable (bounds
),
3909 value_as_long (ada_array_bound (arr
, i
, 1)),
3910 desc_bound_bitpos (bounds_type
, i
, 1),
3911 desc_bound_bitsize (bounds_type
, i
, 1));
3914 bounds
= ensure_lval (bounds
, sp
);
3916 modify_general_field (value_contents_writeable (descriptor
),
3917 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3918 fat_pntr_data_bitpos (desc_type
),
3919 fat_pntr_data_bitsize (desc_type
));
3921 modify_general_field (value_contents_writeable (descriptor
),
3922 VALUE_ADDRESS (bounds
),
3923 fat_pntr_bounds_bitpos (desc_type
),
3924 fat_pntr_bounds_bitsize (desc_type
));
3926 descriptor
= ensure_lval (descriptor
, sp
);
3928 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3929 return value_addr (descriptor
);
3934 /* Dummy definitions for an experimental caching module that is not
3935 * used in the public sources. */
3938 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3939 struct symbol
**sym
, struct block
**block
,
3940 struct symtab
**symtab
)
3946 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3947 struct block
*block
, struct symtab
*symtab
)
3953 /* Return the result of a standard (literal, C-like) lookup of NAME in
3954 given DOMAIN, visible from lexical block BLOCK. */
3956 static struct symbol
*
3957 standard_lookup (const char *name
, const struct block
*block
,
3961 struct symtab
*symtab
;
3963 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
, NULL
))
3966 lookup_symbol_in_language (name
, block
, domain
, language_c
, 0, &symtab
);
3967 cache_symbol (name
, domain
, sym
, block_found
, symtab
);
3972 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3973 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3974 since they contend in overloading in the same way. */
3976 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3980 for (i
= 0; i
< n
; i
+= 1)
3981 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3982 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3983 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3989 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3990 struct types. Otherwise, they may not. */
3993 equiv_types (struct type
*type0
, struct type
*type1
)
3997 if (type0
== NULL
|| type1
== NULL
3998 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4000 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4001 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4002 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4003 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4009 /* True iff SYM0 represents the same entity as SYM1, or one that is
4010 no more defined than that of SYM1. */
4013 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4017 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4018 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4021 switch (SYMBOL_CLASS (sym0
))
4027 struct type
*type0
= SYMBOL_TYPE (sym0
);
4028 struct type
*type1
= SYMBOL_TYPE (sym1
);
4029 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4030 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4031 int len0
= strlen (name0
);
4033 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4034 && (equiv_types (type0
, type1
)
4035 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4036 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4039 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4040 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4046 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4047 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4050 add_defn_to_vec (struct obstack
*obstackp
,
4052 struct block
*block
, struct symtab
*symtab
)
4056 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4058 /* Do not try to complete stub types, as the debugger is probably
4059 already scanning all symbols matching a certain name at the
4060 time when this function is called. Trying to replace the stub
4061 type by its associated full type will cause us to restart a scan
4062 which may lead to an infinite recursion. Instead, the client
4063 collecting the matching symbols will end up collecting several
4064 matches, with at least one of them complete. It can then filter
4065 out the stub ones if needed. */
4067 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4069 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4071 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4073 prevDefns
[i
].sym
= sym
;
4074 prevDefns
[i
].block
= block
;
4075 prevDefns
[i
].symtab
= symtab
;
4081 struct ada_symbol_info info
;
4085 info
.symtab
= symtab
;
4086 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4090 /* Number of ada_symbol_info structures currently collected in
4091 current vector in *OBSTACKP. */
4094 num_defns_collected (struct obstack
*obstackp
)
4096 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4099 /* Vector of ada_symbol_info structures currently collected in current
4100 vector in *OBSTACKP. If FINISH, close off the vector and return
4101 its final address. */
4103 static struct ada_symbol_info
*
4104 defns_collected (struct obstack
*obstackp
, int finish
)
4107 return obstack_finish (obstackp
);
4109 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4112 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4113 Check the global symbols if GLOBAL, the static symbols if not.
4114 Do wild-card match if WILD. */
4116 static struct partial_symbol
*
4117 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4118 int global
, domain_enum
namespace, int wild
)
4120 struct partial_symbol
**start
;
4121 int name_len
= strlen (name
);
4122 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4131 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4132 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4136 for (i
= 0; i
< length
; i
+= 1)
4138 struct partial_symbol
*psym
= start
[i
];
4140 if (SYMBOL_DOMAIN (psym
) == namespace
4141 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4155 int M
= (U
+ i
) >> 1;
4156 struct partial_symbol
*psym
= start
[M
];
4157 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4159 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4161 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4172 struct partial_symbol
*psym
= start
[i
];
4174 if (SYMBOL_DOMAIN (psym
) == namespace)
4176 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4184 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4198 int M
= (U
+ i
) >> 1;
4199 struct partial_symbol
*psym
= start
[M
];
4200 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4202 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4204 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4215 struct partial_symbol
*psym
= start
[i
];
4217 if (SYMBOL_DOMAIN (psym
) == namespace)
4221 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4224 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4226 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4236 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4246 /* Find a symbol table containing symbol SYM or NULL if none. */
4248 static struct symtab
*
4249 symtab_for_sym (struct symbol
*sym
)
4252 struct objfile
*objfile
;
4254 struct symbol
*tmp_sym
;
4255 struct dict_iterator iter
;
4258 ALL_PRIMARY_SYMTABS (objfile
, s
)
4260 switch (SYMBOL_CLASS (sym
))
4268 case LOC_CONST_BYTES
:
4269 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4270 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4272 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4273 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4279 switch (SYMBOL_CLASS (sym
))
4285 case LOC_REGPARM_ADDR
:
4290 case LOC_BASEREG_ARG
:
4292 case LOC_COMPUTED_ARG
:
4293 for (j
= FIRST_LOCAL_BLOCK
;
4294 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4296 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4297 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4308 /* Return a minimal symbol matching NAME according to Ada decoding
4309 rules. Returns NULL if there is no such minimal symbol. Names
4310 prefixed with "standard__" are handled specially: "standard__" is
4311 first stripped off, and only static and global symbols are searched. */
4313 struct minimal_symbol
*
4314 ada_lookup_simple_minsym (const char *name
)
4316 struct objfile
*objfile
;
4317 struct minimal_symbol
*msymbol
;
4320 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4322 name
+= sizeof ("standard__") - 1;
4326 wild_match
= (strstr (name
, "__") == NULL
);
4328 ALL_MSYMBOLS (objfile
, msymbol
)
4330 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4331 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4338 /* For all subprograms that statically enclose the subprogram of the
4339 selected frame, add symbols matching identifier NAME in DOMAIN
4340 and their blocks to the list of data in OBSTACKP, as for
4341 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4345 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4346 const char *name
, domain_enum
namespace,
4351 /* True if TYPE is definitely an artificial type supplied to a symbol
4352 for which no debugging information was given in the symbol file. */
4355 is_nondebugging_type (struct type
*type
)
4357 char *name
= ada_type_name (type
);
4358 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4361 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4362 duplicate other symbols in the list (The only case I know of where
4363 this happens is when object files containing stabs-in-ecoff are
4364 linked with files containing ordinary ecoff debugging symbols (or no
4365 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4366 Returns the number of items in the modified list. */
4369 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4376 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4377 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4378 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4380 for (j
= 0; j
< nsyms
; j
+= 1)
4383 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4384 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4385 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4386 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4387 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4388 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4391 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4392 syms
[k
- 1] = syms
[k
];
4405 /* Given a type that corresponds to a renaming entity, use the type name
4406 to extract the scope (package name or function name, fully qualified,
4407 and following the GNAT encoding convention) where this renaming has been
4408 defined. The string returned needs to be deallocated after use. */
4411 xget_renaming_scope (struct type
*renaming_type
)
4413 /* The renaming types adhere to the following convention:
4414 <scope>__<rename>___<XR extension>.
4415 So, to extract the scope, we search for the "___XR" extension,
4416 and then backtrack until we find the first "__". */
4418 const char *name
= type_name_no_tag (renaming_type
);
4419 char *suffix
= strstr (name
, "___XR");
4424 /* Now, backtrack a bit until we find the first "__". Start looking
4425 at suffix - 3, as the <rename> part is at least one character long. */
4427 for (last
= suffix
- 3; last
> name
; last
--)
4428 if (last
[0] == '_' && last
[1] == '_')
4431 /* Make a copy of scope and return it. */
4433 scope_len
= last
- name
;
4434 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4436 strncpy (scope
, name
, scope_len
);
4437 scope
[scope_len
] = '\0';
4442 /* Return nonzero if NAME corresponds to a package name. */
4445 is_package_name (const char *name
)
4447 /* Here, We take advantage of the fact that no symbols are generated
4448 for packages, while symbols are generated for each function.
4449 So the condition for NAME represent a package becomes equivalent
4450 to NAME not existing in our list of symbols. There is only one
4451 small complication with library-level functions (see below). */
4455 /* If it is a function that has not been defined at library level,
4456 then we should be able to look it up in the symbols. */
4457 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4460 /* Library-level function names start with "_ada_". See if function
4461 "_ada_" followed by NAME can be found. */
4463 /* Do a quick check that NAME does not contain "__", since library-level
4464 functions names cannot contain "__" in them. */
4465 if (strstr (name
, "__") != NULL
)
4468 fun_name
= xstrprintf ("_ada_%s", name
);
4470 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4473 /* Return nonzero if SYM corresponds to a renaming entity that is
4474 not visible from FUNCTION_NAME. */
4477 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4481 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4484 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4486 make_cleanup (xfree
, scope
);
4488 /* If the rename has been defined in a package, then it is visible. */
4489 if (is_package_name (scope
))
4492 /* Check that the rename is in the current function scope by checking
4493 that its name starts with SCOPE. */
4495 /* If the function name starts with "_ada_", it means that it is
4496 a library-level function. Strip this prefix before doing the
4497 comparison, as the encoding for the renaming does not contain
4499 if (strncmp (function_name
, "_ada_", 5) == 0)
4502 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4505 /* Remove entries from SYMS that corresponds to a renaming entity that
4506 is not visible from the function associated with CURRENT_BLOCK or
4507 that is superfluous due to the presence of more specific renaming
4508 information. Places surviving symbols in the initial entries of
4509 SYMS and returns the number of surviving symbols.
4512 First, in cases where an object renaming is implemented as a
4513 reference variable, GNAT may produce both the actual reference
4514 variable and the renaming encoding. In this case, we discard the
4517 Second, GNAT emits a type following a specified encoding for each renaming
4518 entity. Unfortunately, STABS currently does not support the definition
4519 of types that are local to a given lexical block, so all renamings types
4520 are emitted at library level. As a consequence, if an application
4521 contains two renaming entities using the same name, and a user tries to
4522 print the value of one of these entities, the result of the ada symbol
4523 lookup will also contain the wrong renaming type.
4525 This function partially covers for this limitation by attempting to
4526 remove from the SYMS list renaming symbols that should be visible
4527 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4528 method with the current information available. The implementation
4529 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4531 - When the user tries to print a rename in a function while there
4532 is another rename entity defined in a package: Normally, the
4533 rename in the function has precedence over the rename in the
4534 package, so the latter should be removed from the list. This is
4535 currently not the case.
4537 - This function will incorrectly remove valid renames if
4538 the CURRENT_BLOCK corresponds to a function which symbol name
4539 has been changed by an "Export" pragma. As a consequence,
4540 the user will be unable to print such rename entities. */
4543 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4544 int nsyms
, const struct block
*current_block
)
4546 struct symbol
*current_function
;
4547 char *current_function_name
;
4549 int is_new_style_renaming
;
4551 /* If there is both a renaming foo___XR... encoded as a variable and
4552 a simple variable foo in the same block, discard the latter.
4553 First, zero out such symbols, then compress. */
4554 is_new_style_renaming
= 0;
4555 for (i
= 0; i
< nsyms
; i
+= 1)
4557 struct symbol
*sym
= syms
[i
].sym
;
4558 struct block
*block
= syms
[i
].block
;
4562 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4564 name
= SYMBOL_LINKAGE_NAME (sym
);
4565 suffix
= strstr (name
, "___XR");
4569 int name_len
= suffix
- name
;
4571 is_new_style_renaming
= 1;
4572 for (j
= 0; j
< nsyms
; j
+= 1)
4573 if (i
!= j
&& syms
[j
].sym
!= NULL
4574 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4576 && block
== syms
[j
].block
)
4580 if (is_new_style_renaming
)
4584 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4585 if (syms
[j
].sym
!= NULL
)
4593 /* Extract the function name associated to CURRENT_BLOCK.
4594 Abort if unable to do so. */
4596 if (current_block
== NULL
)
4599 current_function
= block_function (current_block
);
4600 if (current_function
== NULL
)
4603 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4604 if (current_function_name
== NULL
)
4607 /* Check each of the symbols, and remove it from the list if it is
4608 a type corresponding to a renaming that is out of the scope of
4609 the current block. */
4614 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4615 == ADA_OBJECT_RENAMING
4616 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4619 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4620 syms
[j
- 1] = syms
[j
];
4630 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4631 scope and in global scopes, returning the number of matches. Sets
4632 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4633 indicating the symbols found and the blocks and symbol tables (if
4634 any) in which they were found. This vector are transient---good only to
4635 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4636 symbol match within the nest of blocks whose innermost member is BLOCK0,
4637 is the one match returned (no other matches in that or
4638 enclosing blocks is returned). If there are any matches in or
4639 surrounding BLOCK0, then these alone are returned. Otherwise, the
4640 search extends to global and file-scope (static) symbol tables.
4641 Names prefixed with "standard__" are handled specially: "standard__"
4642 is first stripped off, and only static and global symbols are searched. */
4645 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4646 domain_enum
namespace,
4647 struct ada_symbol_info
**results
)
4651 struct partial_symtab
*ps
;
4652 struct blockvector
*bv
;
4653 struct objfile
*objfile
;
4654 struct block
*block
;
4656 struct minimal_symbol
*msymbol
;
4662 obstack_free (&symbol_list_obstack
, NULL
);
4663 obstack_init (&symbol_list_obstack
);
4667 /* Search specified block and its superiors. */
4669 wild_match
= (strstr (name0
, "__") == NULL
);
4671 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4672 needed, but adding const will
4673 have a cascade effect. */
4674 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4678 name
= name0
+ sizeof ("standard__") - 1;
4682 while (block
!= NULL
)
4685 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4686 namespace, NULL
, NULL
, wild_match
);
4688 /* If we found a non-function match, assume that's the one. */
4689 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4690 num_defns_collected (&symbol_list_obstack
)))
4693 block
= BLOCK_SUPERBLOCK (block
);
4696 /* If no luck so far, try to find NAME as a local symbol in some lexically
4697 enclosing subprogram. */
4698 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4699 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4700 name
, namespace, wild_match
);
4702 /* If we found ANY matches among non-global symbols, we're done. */
4704 if (num_defns_collected (&symbol_list_obstack
) > 0)
4708 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
, &s
))
4711 add_defn_to_vec (&symbol_list_obstack
, sym
, block
, s
);
4715 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4716 tables, and psymtab's. */
4718 ALL_PRIMARY_SYMTABS (objfile
, s
)
4721 bv
= BLOCKVECTOR (s
);
4722 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4723 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4724 objfile
, s
, wild_match
);
4727 if (namespace == VAR_DOMAIN
)
4729 ALL_MSYMBOLS (objfile
, msymbol
)
4731 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4733 switch (MSYMBOL_TYPE (msymbol
))
4735 case mst_solib_trampoline
:
4738 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4741 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4743 bv
= BLOCKVECTOR (s
);
4744 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4745 ada_add_block_symbols (&symbol_list_obstack
, block
,
4746 SYMBOL_LINKAGE_NAME (msymbol
),
4747 namespace, objfile
, s
, wild_match
);
4749 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4751 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4752 ada_add_block_symbols (&symbol_list_obstack
, block
,
4753 SYMBOL_LINKAGE_NAME (msymbol
),
4754 namespace, objfile
, s
,
4763 ALL_PSYMTABS (objfile
, ps
)
4767 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4769 s
= PSYMTAB_TO_SYMTAB (ps
);
4772 bv
= BLOCKVECTOR (s
);
4773 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4774 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4775 namespace, objfile
, s
, wild_match
);
4779 /* Now add symbols from all per-file blocks if we've gotten no hits
4780 (Not strictly correct, but perhaps better than an error).
4781 Do the symtabs first, then check the psymtabs. */
4783 if (num_defns_collected (&symbol_list_obstack
) == 0)
4786 ALL_PRIMARY_SYMTABS (objfile
, s
)
4789 bv
= BLOCKVECTOR (s
);
4790 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4791 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4792 objfile
, s
, wild_match
);
4795 ALL_PSYMTABS (objfile
, ps
)
4799 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4801 s
= PSYMTAB_TO_SYMTAB (ps
);
4802 bv
= BLOCKVECTOR (s
);
4805 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4806 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4807 namespace, objfile
, s
, wild_match
);
4813 ndefns
= num_defns_collected (&symbol_list_obstack
);
4814 *results
= defns_collected (&symbol_list_obstack
, 1);
4816 ndefns
= remove_extra_symbols (*results
, ndefns
);
4819 cache_symbol (name0
, namespace, NULL
, NULL
, NULL
);
4821 if (ndefns
== 1 && cacheIfUnique
)
4822 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
,
4823 (*results
)[0].symtab
);
4825 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4831 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4832 domain_enum
namespace,
4833 struct block
**block_found
, struct symtab
**symtab
)
4835 struct ada_symbol_info
*candidates
;
4838 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4840 if (n_candidates
== 0)
4843 if (block_found
!= NULL
)
4844 *block_found
= candidates
[0].block
;
4848 *symtab
= candidates
[0].symtab
;
4849 if (*symtab
== NULL
&& candidates
[0].block
!= NULL
)
4851 struct objfile
*objfile
;
4854 struct blockvector
*bv
;
4856 /* Search the list of symtabs for one which contains the
4857 address of the start of this block. */
4858 ALL_PRIMARY_SYMTABS (objfile
, s
)
4860 bv
= BLOCKVECTOR (s
);
4861 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4862 if (BLOCK_START (b
) <= BLOCK_START (candidates
[0].block
)
4863 && BLOCK_END (b
) > BLOCK_START (candidates
[0].block
))
4866 return fixup_symbol_section (candidates
[0].sym
, objfile
);
4869 /* FIXME: brobecker/2004-11-12: I think that we should never
4870 reach this point. I don't see a reason why we would not
4871 find a symtab for a given block, so I suggest raising an
4872 internal_error exception here. Otherwise, we end up
4873 returning a symbol but no symtab, which certain parts of
4874 the code that rely (indirectly) on this function do not
4875 expect, eventually causing a SEGV. */
4876 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4879 return candidates
[0].sym
;
4882 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4883 scope and in global scopes, or NULL if none. NAME is folded and
4884 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4885 choosing the first symbol if there are multiple choices.
4886 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4887 table in which the symbol was found (in both cases, these
4888 assignments occur only if the pointers are non-null). */
4890 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4891 domain_enum
namespace, int *is_a_field_of_this
,
4892 struct symtab
**symtab
)
4894 if (is_a_field_of_this
!= NULL
)
4895 *is_a_field_of_this
= 0;
4898 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4899 block0
, namespace, NULL
, symtab
);
4902 static struct symbol
*
4903 ada_lookup_symbol_nonlocal (const char *name
,
4904 const char *linkage_name
,
4905 const struct block
*block
,
4906 const domain_enum domain
, struct symtab
**symtab
)
4908 if (linkage_name
== NULL
)
4909 linkage_name
= name
;
4910 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4915 /* True iff STR is a possible encoded suffix of a normal Ada name
4916 that is to be ignored for matching purposes. Suffixes of parallel
4917 names (e.g., XVE) are not included here. Currently, the possible suffixes
4918 are given by either of the regular expression:
4920 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4921 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4922 _E[0-9]+[bs]$ [protected object entry suffixes]
4923 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4925 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4926 match is performed. This sequence is used to differentiate homonyms,
4927 is an optional part of a valid name suffix. */
4930 is_name_suffix (const char *str
)
4933 const char *matching
;
4934 const int len
= strlen (str
);
4936 /* Skip optional leading __[0-9]+. */
4938 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4941 while (isdigit (str
[0]))
4947 if (str
[0] == '.' || str
[0] == '$')
4950 while (isdigit (matching
[0]))
4952 if (matching
[0] == '\0')
4958 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4961 while (isdigit (matching
[0]))
4963 if (matching
[0] == '\0')
4968 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4969 with a N at the end. Unfortunately, the compiler uses the same
4970 convention for other internal types it creates. So treating
4971 all entity names that end with an "N" as a name suffix causes
4972 some regressions. For instance, consider the case of an enumerated
4973 type. To support the 'Image attribute, it creates an array whose
4975 Having a single character like this as a suffix carrying some
4976 information is a bit risky. Perhaps we should change the encoding
4977 to be something like "_N" instead. In the meantime, do not do
4978 the following check. */
4979 /* Protected Object Subprograms */
4980 if (len
== 1 && str
[0] == 'N')
4985 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4988 while (isdigit (matching
[0]))
4990 if ((matching
[0] == 'b' || matching
[0] == 's')
4991 && matching
[1] == '\0')
4995 /* ??? We should not modify STR directly, as we are doing below. This
4996 is fine in this case, but may become problematic later if we find
4997 that this alternative did not work, and want to try matching
4998 another one from the begining of STR. Since we modified it, we
4999 won't be able to find the begining of the string anymore! */
5003 while (str
[0] != '_' && str
[0] != '\0')
5005 if (str
[0] != 'n' && str
[0] != 'b')
5011 if (str
[0] == '\000')
5016 if (str
[1] != '_' || str
[2] == '\000')
5020 if (strcmp (str
+ 3, "JM") == 0)
5022 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5023 the LJM suffix in favor of the JM one. But we will
5024 still accept LJM as a valid suffix for a reasonable
5025 amount of time, just to allow ourselves to debug programs
5026 compiled using an older version of GNAT. */
5027 if (strcmp (str
+ 3, "LJM") == 0)
5031 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5032 || str
[4] == 'U' || str
[4] == 'P')
5034 if (str
[4] == 'R' && str
[5] != 'T')
5038 if (!isdigit (str
[2]))
5040 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5041 if (!isdigit (str
[k
]) && str
[k
] != '_')
5045 if (str
[0] == '$' && isdigit (str
[1]))
5047 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5048 if (!isdigit (str
[k
]) && str
[k
] != '_')
5055 /* Return nonzero if the given string starts with a dot ('.')
5056 followed by zero or more digits.
5058 Note: brobecker/2003-11-10: A forward declaration has not been
5059 added at the begining of this file yet, because this function
5060 is only used to work around a problem found during wild matching
5061 when trying to match minimal symbol names against symbol names
5062 obtained from dwarf-2 data. This function is therefore currently
5063 only used in wild_match() and is likely to be deleted when the
5064 problem in dwarf-2 is fixed. */
5067 is_dot_digits_suffix (const char *str
)
5073 while (isdigit (str
[0]))
5075 return (str
[0] == '\0');
5078 /* Return non-zero if the string starting at NAME and ending before
5079 NAME_END contains no capital letters. */
5082 is_valid_name_for_wild_match (const char *name0
)
5084 const char *decoded_name
= ada_decode (name0
);
5087 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5088 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5094 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5095 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5096 informational suffixes of NAME (i.e., for which is_name_suffix is
5100 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5107 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5108 stored in the symbol table for nested function names is sometimes
5109 different from the name of the associated entity stored in
5110 the dwarf-2 data: This is the case for nested subprograms, where
5111 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5112 while the symbol name from the dwarf-2 data does not.
5114 Although the DWARF-2 standard documents that entity names stored
5115 in the dwarf-2 data should be identical to the name as seen in
5116 the source code, GNAT takes a different approach as we already use
5117 a special encoding mechanism to convey the information so that
5118 a C debugger can still use the information generated to debug
5119 Ada programs. A corollary is that the symbol names in the dwarf-2
5120 data should match the names found in the symbol table. I therefore
5121 consider this issue as a compiler defect.
5123 Until the compiler is properly fixed, we work-around the problem
5124 by ignoring such suffixes during the match. We do so by making
5125 a copy of PATN0 and NAME0, and then by stripping such a suffix
5126 if present. We then perform the match on the resulting strings. */
5129 name_len
= strlen (name0
);
5131 name
= name_start
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5132 strcpy (name
, name0
);
5133 dot
= strrchr (name
, '.');
5134 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5137 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5138 strncpy (patn
, patn0
, patn_len
);
5139 patn
[patn_len
] = '\0';
5140 dot
= strrchr (patn
, '.');
5141 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5144 patn_len
= dot
- patn
;
5148 /* Now perform the wild match. */
5150 name_len
= strlen (name
);
5151 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5152 && strncmp (patn
, name
+ 5, patn_len
) == 0
5153 && is_name_suffix (name
+ patn_len
+ 5))
5156 while (name_len
>= patn_len
)
5158 if (strncmp (patn
, name
, patn_len
) == 0
5159 && is_name_suffix (name
+ patn_len
))
5160 return (name
== name_start
|| is_valid_name_for_wild_match (name0
));
5167 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5172 if (!islower (name
[2]))
5179 if (!islower (name
[1]))
5190 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5191 vector *defn_symbols, updating the list of symbols in OBSTACKP
5192 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5193 OBJFILE is the section containing BLOCK.
5194 SYMTAB is recorded with each symbol added. */
5197 ada_add_block_symbols (struct obstack
*obstackp
,
5198 struct block
*block
, const char *name
,
5199 domain_enum domain
, struct objfile
*objfile
,
5200 struct symtab
*symtab
, int wild
)
5202 struct dict_iterator iter
;
5203 int name_len
= strlen (name
);
5204 /* A matching argument symbol, if any. */
5205 struct symbol
*arg_sym
;
5206 /* Set true when we find a matching non-argument symbol. */
5215 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5217 if (SYMBOL_DOMAIN (sym
) == domain
5218 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5220 switch (SYMBOL_CLASS (sym
))
5226 case LOC_REGPARM_ADDR
:
5227 case LOC_BASEREG_ARG
:
5228 case LOC_COMPUTED_ARG
:
5231 case LOC_UNRESOLVED
:
5235 add_defn_to_vec (obstackp
,
5236 fixup_symbol_section (sym
, objfile
),
5245 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5247 if (SYMBOL_DOMAIN (sym
) == domain
)
5249 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5251 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5253 switch (SYMBOL_CLASS (sym
))
5259 case LOC_REGPARM_ADDR
:
5260 case LOC_BASEREG_ARG
:
5261 case LOC_COMPUTED_ARG
:
5264 case LOC_UNRESOLVED
:
5268 add_defn_to_vec (obstackp
,
5269 fixup_symbol_section (sym
, objfile
),
5278 if (!found_sym
&& arg_sym
!= NULL
)
5280 add_defn_to_vec (obstackp
,
5281 fixup_symbol_section (arg_sym
, objfile
),
5290 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5292 if (SYMBOL_DOMAIN (sym
) == domain
)
5296 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5299 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5301 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5306 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5308 switch (SYMBOL_CLASS (sym
))
5314 case LOC_REGPARM_ADDR
:
5315 case LOC_BASEREG_ARG
:
5316 case LOC_COMPUTED_ARG
:
5319 case LOC_UNRESOLVED
:
5323 add_defn_to_vec (obstackp
,
5324 fixup_symbol_section (sym
, objfile
),
5332 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5333 They aren't parameters, right? */
5334 if (!found_sym
&& arg_sym
!= NULL
)
5336 add_defn_to_vec (obstackp
,
5337 fixup_symbol_section (arg_sym
, objfile
),
5345 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5346 for tagged types. */
5349 ada_is_dispatch_table_ptr_type (struct type
*type
)
5353 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5356 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5360 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5363 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5364 to be invisible to users. */
5367 ada_is_ignored_field (struct type
*type
, int field_num
)
5369 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5372 /* Check the name of that field. */
5374 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5376 /* Anonymous field names should not be printed.
5377 brobecker/2007-02-20: I don't think this can actually happen
5378 but we don't want to print the value of annonymous fields anyway. */
5382 /* A field named "_parent" is internally generated by GNAT for
5383 tagged types, and should not be printed either. */
5384 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5388 /* If this is the dispatch table of a tagged type, then ignore. */
5389 if (ada_is_tagged_type (type
, 1)
5390 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5393 /* Not a special field, so it should not be ignored. */
5397 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5398 pointer or reference type whose ultimate target has a tag field. */
5401 ada_is_tagged_type (struct type
*type
, int refok
)
5403 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5406 /* True iff TYPE represents the type of X'Tag */
5409 ada_is_tag_type (struct type
*type
)
5411 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5415 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5416 return (name
!= NULL
5417 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5421 /* The type of the tag on VAL. */
5424 ada_tag_type (struct value
*val
)
5426 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5429 /* The value of the tag on VAL. */
5432 ada_value_tag (struct value
*val
)
5434 return ada_value_struct_elt (val
, "_tag", 0);
5437 /* The value of the tag on the object of type TYPE whose contents are
5438 saved at VALADDR, if it is non-null, or is at memory address
5441 static struct value
*
5442 value_tag_from_contents_and_address (struct type
*type
,
5443 const gdb_byte
*valaddr
,
5446 int tag_byte_offset
, dummy1
, dummy2
;
5447 struct type
*tag_type
;
5448 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5451 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5453 : valaddr
+ tag_byte_offset
);
5454 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5456 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5461 static struct type
*
5462 type_from_tag (struct value
*tag
)
5464 const char *type_name
= ada_tag_name (tag
);
5465 if (type_name
!= NULL
)
5466 return ada_find_any_type (ada_encode (type_name
));
5477 static int ada_tag_name_1 (void *);
5478 static int ada_tag_name_2 (struct tag_args
*);
5480 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5481 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5482 The value stored in ARGS->name is valid until the next call to
5486 ada_tag_name_1 (void *args0
)
5488 struct tag_args
*args
= (struct tag_args
*) args0
;
5489 static char name
[1024];
5493 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5495 return ada_tag_name_2 (args
);
5496 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5499 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5500 for (p
= name
; *p
!= '\0'; p
+= 1)
5507 /* Utility function for ada_tag_name_1 that tries the second
5508 representation for the dispatch table (in which there is no
5509 explicit 'tsd' field in the referent of the tag pointer, and instead
5510 the tsd pointer is stored just before the dispatch table. */
5513 ada_tag_name_2 (struct tag_args
*args
)
5515 struct type
*info_type
;
5516 static char name
[1024];
5518 struct value
*val
, *valp
;
5521 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5522 if (info_type
== NULL
)
5524 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5525 valp
= value_cast (info_type
, args
->tag
);
5528 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5531 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5534 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5535 for (p
= name
; *p
!= '\0'; p
+= 1)
5542 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5546 ada_tag_name (struct value
*tag
)
5548 struct tag_args args
;
5549 if (!ada_is_tag_type (value_type (tag
)))
5553 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5557 /* The parent type of TYPE, or NULL if none. */
5560 ada_parent_type (struct type
*type
)
5564 type
= ada_check_typedef (type
);
5566 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5569 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5570 if (ada_is_parent_field (type
, i
))
5571 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5576 /* True iff field number FIELD_NUM of structure type TYPE contains the
5577 parent-type (inherited) fields of a derived type. Assumes TYPE is
5578 a structure type with at least FIELD_NUM+1 fields. */
5581 ada_is_parent_field (struct type
*type
, int field_num
)
5583 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5584 return (name
!= NULL
5585 && (strncmp (name
, "PARENT", 6) == 0
5586 || strncmp (name
, "_parent", 7) == 0));
5589 /* True iff field number FIELD_NUM of structure type TYPE is a
5590 transparent wrapper field (which should be silently traversed when doing
5591 field selection and flattened when printing). Assumes TYPE is a
5592 structure type with at least FIELD_NUM+1 fields. Such fields are always
5596 ada_is_wrapper_field (struct type
*type
, int field_num
)
5598 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5599 return (name
!= NULL
5600 && (strncmp (name
, "PARENT", 6) == 0
5601 || strcmp (name
, "REP") == 0
5602 || strncmp (name
, "_parent", 7) == 0
5603 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5606 /* True iff field number FIELD_NUM of structure or union type TYPE
5607 is a variant wrapper. Assumes TYPE is a structure type with at least
5608 FIELD_NUM+1 fields. */
5611 ada_is_variant_part (struct type
*type
, int field_num
)
5613 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5614 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5615 || (is_dynamic_field (type
, field_num
)
5616 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5617 == TYPE_CODE_UNION
)));
5620 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5621 whose discriminants are contained in the record type OUTER_TYPE,
5622 returns the type of the controlling discriminant for the variant. */
5625 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5627 char *name
= ada_variant_discrim_name (var_type
);
5629 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5631 return builtin_type_int
;
5636 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5637 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5638 represents a 'when others' clause; otherwise 0. */
5641 ada_is_others_clause (struct type
*type
, int field_num
)
5643 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5644 return (name
!= NULL
&& name
[0] == 'O');
5647 /* Assuming that TYPE0 is the type of the variant part of a record,
5648 returns the name of the discriminant controlling the variant.
5649 The value is valid until the next call to ada_variant_discrim_name. */
5652 ada_variant_discrim_name (struct type
*type0
)
5654 static char *result
= NULL
;
5655 static size_t result_len
= 0;
5658 const char *discrim_end
;
5659 const char *discrim_start
;
5661 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5662 type
= TYPE_TARGET_TYPE (type0
);
5666 name
= ada_type_name (type
);
5668 if (name
== NULL
|| name
[0] == '\000')
5671 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5674 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5677 if (discrim_end
== name
)
5680 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5683 if (discrim_start
== name
+ 1)
5685 if ((discrim_start
> name
+ 3
5686 && strncmp (discrim_start
- 3, "___", 3) == 0)
5687 || discrim_start
[-1] == '.')
5691 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5692 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5693 result
[discrim_end
- discrim_start
] = '\0';
5697 /* Scan STR for a subtype-encoded number, beginning at position K.
5698 Put the position of the character just past the number scanned in
5699 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5700 Return 1 if there was a valid number at the given position, and 0
5701 otherwise. A "subtype-encoded" number consists of the absolute value
5702 in decimal, followed by the letter 'm' to indicate a negative number.
5703 Assumes 0m does not occur. */
5706 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5710 if (!isdigit (str
[k
]))
5713 /* Do it the hard way so as not to make any assumption about
5714 the relationship of unsigned long (%lu scan format code) and
5717 while (isdigit (str
[k
]))
5719 RU
= RU
* 10 + (str
[k
] - '0');
5726 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5732 /* NOTE on the above: Technically, C does not say what the results of
5733 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5734 number representable as a LONGEST (although either would probably work
5735 in most implementations). When RU>0, the locution in the then branch
5736 above is always equivalent to the negative of RU. */
5743 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5744 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5745 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5748 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5750 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5763 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5772 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5773 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5775 if (val
>= L
&& val
<= U
)
5787 /* FIXME: Lots of redundancy below. Try to consolidate. */
5789 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5790 ARG_TYPE, extract and return the value of one of its (non-static)
5791 fields. FIELDNO says which field. Differs from value_primitive_field
5792 only in that it can handle packed values of arbitrary type. */
5794 static struct value
*
5795 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5796 struct type
*arg_type
)
5800 arg_type
= ada_check_typedef (arg_type
);
5801 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5803 /* Handle packed fields. */
5805 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5807 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5808 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5810 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5811 offset
+ bit_pos
/ 8,
5812 bit_pos
% 8, bit_size
, type
);
5815 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5818 /* Find field with name NAME in object of type TYPE. If found,
5819 set the following for each argument that is non-null:
5820 - *FIELD_TYPE_P to the field's type;
5821 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5822 an object of that type;
5823 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5824 - *BIT_SIZE_P to its size in bits if the field is packed, and
5826 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5827 fields up to but not including the desired field, or by the total
5828 number of fields if not found. A NULL value of NAME never
5829 matches; the function just counts visible fields in this case.
5831 Returns 1 if found, 0 otherwise. */
5834 find_struct_field (char *name
, struct type
*type
, int offset
,
5835 struct type
**field_type_p
,
5836 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5841 type
= ada_check_typedef (type
);
5843 if (field_type_p
!= NULL
)
5844 *field_type_p
= NULL
;
5845 if (byte_offset_p
!= NULL
)
5847 if (bit_offset_p
!= NULL
)
5849 if (bit_size_p
!= NULL
)
5852 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5854 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5855 int fld_offset
= offset
+ bit_pos
/ 8;
5856 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5858 if (t_field_name
== NULL
)
5861 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5863 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5864 if (field_type_p
!= NULL
)
5865 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5866 if (byte_offset_p
!= NULL
)
5867 *byte_offset_p
= fld_offset
;
5868 if (bit_offset_p
!= NULL
)
5869 *bit_offset_p
= bit_pos
% 8;
5870 if (bit_size_p
!= NULL
)
5871 *bit_size_p
= bit_size
;
5874 else if (ada_is_wrapper_field (type
, i
))
5876 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5877 field_type_p
, byte_offset_p
, bit_offset_p
,
5878 bit_size_p
, index_p
))
5881 else if (ada_is_variant_part (type
, i
))
5883 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5886 struct type
*field_type
5887 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5889 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5891 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5893 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5894 field_type_p
, byte_offset_p
,
5895 bit_offset_p
, bit_size_p
, index_p
))
5899 else if (index_p
!= NULL
)
5905 /* Number of user-visible fields in record type TYPE. */
5908 num_visible_fields (struct type
*type
)
5912 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5916 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5917 and search in it assuming it has (class) type TYPE.
5918 If found, return value, else return NULL.
5920 Searches recursively through wrapper fields (e.g., '_parent'). */
5922 static struct value
*
5923 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5927 type
= ada_check_typedef (type
);
5929 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5931 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5933 if (t_field_name
== NULL
)
5936 else if (field_name_match (t_field_name
, name
))
5937 return ada_value_primitive_field (arg
, offset
, i
, type
);
5939 else if (ada_is_wrapper_field (type
, i
))
5941 struct value
*v
= /* Do not let indent join lines here. */
5942 ada_search_struct_field (name
, arg
,
5943 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5944 TYPE_FIELD_TYPE (type
, i
));
5949 else if (ada_is_variant_part (type
, i
))
5951 /* PNH: Do we ever get here? See find_struct_field. */
5953 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5954 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5956 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5958 struct value
*v
= ada_search_struct_field
/* Force line break. */
5960 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5961 TYPE_FIELD_TYPE (field_type
, j
));
5970 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
5971 int, struct type
*);
5974 /* Return field #INDEX in ARG, where the index is that returned by
5975 * find_struct_field through its INDEX_P argument. Adjust the address
5976 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
5977 * If found, return value, else return NULL. */
5979 static struct value
*
5980 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
5983 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
5987 /* Auxiliary function for ada_index_struct_field. Like
5988 * ada_index_struct_field, but takes index from *INDEX_P and modifies
5991 static struct value
*
5992 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
5996 type
= ada_check_typedef (type
);
5998 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6000 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6002 else if (ada_is_wrapper_field (type
, i
))
6004 struct value
*v
= /* Do not let indent join lines here. */
6005 ada_index_struct_field_1 (index_p
, arg
,
6006 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6007 TYPE_FIELD_TYPE (type
, i
));
6012 else if (ada_is_variant_part (type
, i
))
6014 /* PNH: Do we ever get here? See ada_search_struct_field,
6015 find_struct_field. */
6016 error (_("Cannot assign this kind of variant record"));
6018 else if (*index_p
== 0)
6019 return ada_value_primitive_field (arg
, offset
, i
, type
);
6026 /* Given ARG, a value of type (pointer or reference to a)*
6027 structure/union, extract the component named NAME from the ultimate
6028 target structure/union and return it as a value with its
6029 appropriate type. If ARG is a pointer or reference and the field
6030 is not packed, returns a reference to the field, otherwise the
6031 value of the field (an lvalue if ARG is an lvalue).
6033 The routine searches for NAME among all members of the structure itself
6034 and (recursively) among all members of any wrapper members
6037 If NO_ERR, then simply return NULL in case of error, rather than
6041 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6043 struct type
*t
, *t1
;
6047 t1
= t
= ada_check_typedef (value_type (arg
));
6048 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6050 t1
= TYPE_TARGET_TYPE (t
);
6053 t1
= ada_check_typedef (t1
);
6054 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6056 arg
= coerce_ref (arg
);
6061 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6063 t1
= TYPE_TARGET_TYPE (t
);
6066 t1
= ada_check_typedef (t1
);
6067 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6069 arg
= value_ind (arg
);
6076 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6080 v
= ada_search_struct_field (name
, arg
, 0, t
);
6083 int bit_offset
, bit_size
, byte_offset
;
6084 struct type
*field_type
;
6087 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6088 address
= value_as_address (arg
);
6090 address
= unpack_pointer (t
, value_contents (arg
));
6092 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6093 if (find_struct_field (name
, t1
, 0,
6094 &field_type
, &byte_offset
, &bit_offset
,
6099 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6100 arg
= ada_coerce_ref (arg
);
6102 arg
= ada_value_ind (arg
);
6103 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6104 bit_offset
, bit_size
,
6108 v
= value_from_pointer (lookup_reference_type (field_type
),
6109 address
+ byte_offset
);
6113 if (v
!= NULL
|| no_err
)
6116 error (_("There is no member named %s."), name
);
6122 error (_("Attempt to extract a component of a value that is not a record."));
6125 /* Given a type TYPE, look up the type of the component of type named NAME.
6126 If DISPP is non-null, add its byte displacement from the beginning of a
6127 structure (pointed to by a value) of type TYPE to *DISPP (does not
6128 work for packed fields).
6130 Matches any field whose name has NAME as a prefix, possibly
6133 TYPE can be either a struct or union. If REFOK, TYPE may also
6134 be a (pointer or reference)+ to a struct or union, and the
6135 ultimate target type will be searched.
6137 Looks recursively into variant clauses and parent types.
6139 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6140 TYPE is not a type of the right kind. */
6142 static struct type
*
6143 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6144 int noerr
, int *dispp
)
6151 if (refok
&& type
!= NULL
)
6154 type
= ada_check_typedef (type
);
6155 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6156 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6158 type
= TYPE_TARGET_TYPE (type
);
6162 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6163 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6169 target_terminal_ours ();
6170 gdb_flush (gdb_stdout
);
6172 error (_("Type (null) is not a structure or union type"));
6175 /* XXX: type_sprint */
6176 fprintf_unfiltered (gdb_stderr
, _("Type "));
6177 type_print (type
, "", gdb_stderr
, -1);
6178 error (_(" is not a structure or union type"));
6183 type
= to_static_fixed_type (type
);
6185 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6187 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6191 if (t_field_name
== NULL
)
6194 else if (field_name_match (t_field_name
, name
))
6197 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6198 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6201 else if (ada_is_wrapper_field (type
, i
))
6204 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6209 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6214 else if (ada_is_variant_part (type
, i
))
6217 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6219 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6222 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6227 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6238 target_terminal_ours ();
6239 gdb_flush (gdb_stdout
);
6242 /* XXX: type_sprint */
6243 fprintf_unfiltered (gdb_stderr
, _("Type "));
6244 type_print (type
, "", gdb_stderr
, -1);
6245 error (_(" has no component named <null>"));
6249 /* XXX: type_sprint */
6250 fprintf_unfiltered (gdb_stderr
, _("Type "));
6251 type_print (type
, "", gdb_stderr
, -1);
6252 error (_(" has no component named %s"), name
);
6259 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6260 within a value of type OUTER_TYPE that is stored in GDB at
6261 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6262 numbering from 0) is applicable. Returns -1 if none are. */
6265 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6266 const gdb_byte
*outer_valaddr
)
6270 char *discrim_name
= ada_variant_discrim_name (var_type
);
6271 struct value
*outer
;
6272 struct value
*discrim
;
6273 LONGEST discrim_val
;
6275 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6276 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6277 if (discrim
== NULL
)
6279 discrim_val
= value_as_long (discrim
);
6282 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6284 if (ada_is_others_clause (var_type
, i
))
6286 else if (ada_in_variant (discrim_val
, var_type
, i
))
6290 return others_clause
;
6295 /* Dynamic-Sized Records */
6297 /* Strategy: The type ostensibly attached to a value with dynamic size
6298 (i.e., a size that is not statically recorded in the debugging
6299 data) does not accurately reflect the size or layout of the value.
6300 Our strategy is to convert these values to values with accurate,
6301 conventional types that are constructed on the fly. */
6303 /* There is a subtle and tricky problem here. In general, we cannot
6304 determine the size of dynamic records without its data. However,
6305 the 'struct value' data structure, which GDB uses to represent
6306 quantities in the inferior process (the target), requires the size
6307 of the type at the time of its allocation in order to reserve space
6308 for GDB's internal copy of the data. That's why the
6309 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6310 rather than struct value*s.
6312 However, GDB's internal history variables ($1, $2, etc.) are
6313 struct value*s containing internal copies of the data that are not, in
6314 general, the same as the data at their corresponding addresses in
6315 the target. Fortunately, the types we give to these values are all
6316 conventional, fixed-size types (as per the strategy described
6317 above), so that we don't usually have to perform the
6318 'to_fixed_xxx_type' conversions to look at their values.
6319 Unfortunately, there is one exception: if one of the internal
6320 history variables is an array whose elements are unconstrained
6321 records, then we will need to create distinct fixed types for each
6322 element selected. */
6324 /* The upshot of all of this is that many routines take a (type, host
6325 address, target address) triple as arguments to represent a value.
6326 The host address, if non-null, is supposed to contain an internal
6327 copy of the relevant data; otherwise, the program is to consult the
6328 target at the target address. */
6330 /* Assuming that VAL0 represents a pointer value, the result of
6331 dereferencing it. Differs from value_ind in its treatment of
6332 dynamic-sized types. */
6335 ada_value_ind (struct value
*val0
)
6337 struct value
*val
= unwrap_value (value_ind (val0
));
6338 return ada_to_fixed_value (val
);
6341 /* The value resulting from dereferencing any "reference to"
6342 qualifiers on VAL0. */
6344 static struct value
*
6345 ada_coerce_ref (struct value
*val0
)
6347 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6349 struct value
*val
= val0
;
6350 val
= coerce_ref (val
);
6351 val
= unwrap_value (val
);
6352 return ada_to_fixed_value (val
);
6358 /* Return OFF rounded upward if necessary to a multiple of
6359 ALIGNMENT (a power of 2). */
6362 align_value (unsigned int off
, unsigned int alignment
)
6364 return (off
+ alignment
- 1) & ~(alignment
- 1);
6367 /* Return the bit alignment required for field #F of template type TYPE. */
6370 field_alignment (struct type
*type
, int f
)
6372 const char *name
= TYPE_FIELD_NAME (type
, f
);
6376 /* The field name should never be null, unless the debugging information
6377 is somehow malformed. In this case, we assume the field does not
6378 require any alignment. */
6382 len
= strlen (name
);
6384 if (!isdigit (name
[len
- 1]))
6387 if (isdigit (name
[len
- 2]))
6388 align_offset
= len
- 2;
6390 align_offset
= len
- 1;
6392 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6393 return TARGET_CHAR_BIT
;
6395 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6398 /* Find a symbol named NAME. Ignores ambiguity. */
6401 ada_find_any_symbol (const char *name
)
6405 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6406 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6409 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6413 /* Find a type named NAME. Ignores ambiguity. */
6416 ada_find_any_type (const char *name
)
6418 struct symbol
*sym
= ada_find_any_symbol (name
);
6421 return SYMBOL_TYPE (sym
);
6426 /* Given NAME and an associated BLOCK, search all symbols for
6427 NAME suffixed with "___XR", which is the ``renaming'' symbol
6428 associated to NAME. Return this symbol if found, return
6432 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6436 sym
= find_old_style_renaming_symbol (name
, block
);
6441 /* Not right yet. FIXME pnh 7/20/2007. */
6442 sym
= ada_find_any_symbol (name
);
6443 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6449 static struct symbol
*
6450 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6452 const struct symbol
*function_sym
= block_function (block
);
6455 if (function_sym
!= NULL
)
6457 /* If the symbol is defined inside a function, NAME is not fully
6458 qualified. This means we need to prepend the function name
6459 as well as adding the ``___XR'' suffix to build the name of
6460 the associated renaming symbol. */
6461 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6462 /* Function names sometimes contain suffixes used
6463 for instance to qualify nested subprograms. When building
6464 the XR type name, we need to make sure that this suffix is
6465 not included. So do not include any suffix in the function
6466 name length below. */
6467 const int function_name_len
= ada_name_prefix_len (function_name
);
6468 const int rename_len
= function_name_len
+ 2 /* "__" */
6469 + strlen (name
) + 6 /* "___XR\0" */ ;
6471 /* Strip the suffix if necessary. */
6472 function_name
[function_name_len
] = '\0';
6474 /* Library-level functions are a special case, as GNAT adds
6475 a ``_ada_'' prefix to the function name to avoid namespace
6476 pollution. However, the renaming symbols themselves do not
6477 have this prefix, so we need to skip this prefix if present. */
6478 if (function_name_len
> 5 /* "_ada_" */
6479 && strstr (function_name
, "_ada_") == function_name
)
6480 function_name
= function_name
+ 5;
6482 rename
= (char *) alloca (rename_len
* sizeof (char));
6483 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6487 const int rename_len
= strlen (name
) + 6;
6488 rename
= (char *) alloca (rename_len
* sizeof (char));
6489 sprintf (rename
, "%s___XR", name
);
6492 return ada_find_any_symbol (rename
);
6495 /* Because of GNAT encoding conventions, several GDB symbols may match a
6496 given type name. If the type denoted by TYPE0 is to be preferred to
6497 that of TYPE1 for purposes of type printing, return non-zero;
6498 otherwise return 0. */
6501 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6505 else if (type0
== NULL
)
6507 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6509 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6511 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6513 else if (ada_is_packed_array_type (type0
))
6515 else if (ada_is_array_descriptor_type (type0
)
6516 && !ada_is_array_descriptor_type (type1
))
6520 const char *type0_name
= type_name_no_tag (type0
);
6521 const char *type1_name
= type_name_no_tag (type1
);
6523 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6524 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6530 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6531 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6534 ada_type_name (struct type
*type
)
6538 else if (TYPE_NAME (type
) != NULL
)
6539 return TYPE_NAME (type
);
6541 return TYPE_TAG_NAME (type
);
6544 /* Find a parallel type to TYPE whose name is formed by appending
6545 SUFFIX to the name of TYPE. */
6548 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6551 static size_t name_len
= 0;
6553 char *typename
= ada_type_name (type
);
6555 if (typename
== NULL
)
6558 len
= strlen (typename
);
6560 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6562 strcpy (name
, typename
);
6563 strcpy (name
+ len
, suffix
);
6565 return ada_find_any_type (name
);
6569 /* If TYPE is a variable-size record type, return the corresponding template
6570 type describing its fields. Otherwise, return NULL. */
6572 static struct type
*
6573 dynamic_template_type (struct type
*type
)
6575 type
= ada_check_typedef (type
);
6577 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6578 || ada_type_name (type
) == NULL
)
6582 int len
= strlen (ada_type_name (type
));
6583 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6586 return ada_find_parallel_type (type
, "___XVE");
6590 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6591 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6594 is_dynamic_field (struct type
*templ_type
, int field_num
)
6596 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6598 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6599 && strstr (name
, "___XVL") != NULL
;
6602 /* The index of the variant field of TYPE, or -1 if TYPE does not
6603 represent a variant record type. */
6606 variant_field_index (struct type
*type
)
6610 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6613 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6615 if (ada_is_variant_part (type
, f
))
6621 /* A record type with no fields. */
6623 static struct type
*
6624 empty_record (struct objfile
*objfile
)
6626 struct type
*type
= alloc_type (objfile
);
6627 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6628 TYPE_NFIELDS (type
) = 0;
6629 TYPE_FIELDS (type
) = NULL
;
6630 TYPE_NAME (type
) = "<empty>";
6631 TYPE_TAG_NAME (type
) = NULL
;
6632 TYPE_FLAGS (type
) = 0;
6633 TYPE_LENGTH (type
) = 0;
6637 /* An ordinary record type (with fixed-length fields) that describes
6638 the value of type TYPE at VALADDR or ADDRESS (see comments at
6639 the beginning of this section) VAL according to GNAT conventions.
6640 DVAL0 should describe the (portion of a) record that contains any
6641 necessary discriminants. It should be NULL if value_type (VAL) is
6642 an outer-level type (i.e., as opposed to a branch of a variant.) A
6643 variant field (unless unchecked) is replaced by a particular branch
6646 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6647 length are not statically known are discarded. As a consequence,
6648 VALADDR, ADDRESS and DVAL0 are ignored.
6650 NOTE: Limitations: For now, we assume that dynamic fields and
6651 variants occupy whole numbers of bytes. However, they need not be
6655 ada_template_to_fixed_record_type_1 (struct type
*type
,
6656 const gdb_byte
*valaddr
,
6657 CORE_ADDR address
, struct value
*dval0
,
6658 int keep_dynamic_fields
)
6660 struct value
*mark
= value_mark ();
6663 int nfields
, bit_len
;
6666 int fld_bit_len
, bit_incr
;
6669 /* Compute the number of fields in this record type that are going
6670 to be processed: unless keep_dynamic_fields, this includes only
6671 fields whose position and length are static will be processed. */
6672 if (keep_dynamic_fields
)
6673 nfields
= TYPE_NFIELDS (type
);
6677 while (nfields
< TYPE_NFIELDS (type
)
6678 && !ada_is_variant_part (type
, nfields
)
6679 && !is_dynamic_field (type
, nfields
))
6683 rtype
= alloc_type (TYPE_OBJFILE (type
));
6684 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6685 INIT_CPLUS_SPECIFIC (rtype
);
6686 TYPE_NFIELDS (rtype
) = nfields
;
6687 TYPE_FIELDS (rtype
) = (struct field
*)
6688 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6689 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6690 TYPE_NAME (rtype
) = ada_type_name (type
);
6691 TYPE_TAG_NAME (rtype
) = NULL
;
6692 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6698 for (f
= 0; f
< nfields
; f
+= 1)
6700 off
= align_value (off
, field_alignment (type
, f
))
6701 + TYPE_FIELD_BITPOS (type
, f
);
6702 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6703 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6705 if (ada_is_variant_part (type
, f
))
6708 fld_bit_len
= bit_incr
= 0;
6710 else if (is_dynamic_field (type
, f
))
6713 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6717 /* Get the fixed type of the field. Note that, in this case, we
6718 do not want to get the real type out of the tag: if the current
6719 field is the parent part of a tagged record, we will get the
6720 tag of the object. Clearly wrong: the real type of the parent
6721 is not the real type of the child. We would end up in an infinite
6723 TYPE_FIELD_TYPE (rtype
, f
) =
6726 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6727 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6728 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6729 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6730 bit_incr
= fld_bit_len
=
6731 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6735 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6736 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6737 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6738 bit_incr
= fld_bit_len
=
6739 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6741 bit_incr
= fld_bit_len
=
6742 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6744 if (off
+ fld_bit_len
> bit_len
)
6745 bit_len
= off
+ fld_bit_len
;
6747 TYPE_LENGTH (rtype
) =
6748 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6751 /* We handle the variant part, if any, at the end because of certain
6752 odd cases in which it is re-ordered so as NOT the last field of
6753 the record. This can happen in the presence of representation
6755 if (variant_field
>= 0)
6757 struct type
*branch_type
;
6759 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6762 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6767 to_fixed_variant_branch_type
6768 (TYPE_FIELD_TYPE (type
, variant_field
),
6769 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6770 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6771 if (branch_type
== NULL
)
6773 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6774 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6775 TYPE_NFIELDS (rtype
) -= 1;
6779 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6780 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6782 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6784 if (off
+ fld_bit_len
> bit_len
)
6785 bit_len
= off
+ fld_bit_len
;
6786 TYPE_LENGTH (rtype
) =
6787 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6791 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6792 should contain the alignment of that record, which should be a strictly
6793 positive value. If null or negative, then something is wrong, most
6794 probably in the debug info. In that case, we don't round up the size
6795 of the resulting type. If this record is not part of another structure,
6796 the current RTYPE length might be good enough for our purposes. */
6797 if (TYPE_LENGTH (type
) <= 0)
6799 if (TYPE_NAME (rtype
))
6800 warning (_("Invalid type size for `%s' detected: %d."),
6801 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6803 warning (_("Invalid type size for <unnamed> detected: %d."),
6804 TYPE_LENGTH (type
));
6808 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6809 TYPE_LENGTH (type
));
6812 value_free_to_mark (mark
);
6813 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6814 error (_("record type with dynamic size is larger than varsize-limit"));
6818 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6821 static struct type
*
6822 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6823 CORE_ADDR address
, struct value
*dval0
)
6825 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6829 /* An ordinary record type in which ___XVL-convention fields and
6830 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6831 static approximations, containing all possible fields. Uses
6832 no runtime values. Useless for use in values, but that's OK,
6833 since the results are used only for type determinations. Works on both
6834 structs and unions. Representation note: to save space, we memorize
6835 the result of this function in the TYPE_TARGET_TYPE of the
6838 static struct type
*
6839 template_to_static_fixed_type (struct type
*type0
)
6845 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6846 return TYPE_TARGET_TYPE (type0
);
6848 nfields
= TYPE_NFIELDS (type0
);
6851 for (f
= 0; f
< nfields
; f
+= 1)
6853 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6854 struct type
*new_type
;
6856 if (is_dynamic_field (type0
, f
))
6857 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6859 new_type
= static_unwrap_type (field_type
);
6860 if (type
== type0
&& new_type
!= field_type
)
6862 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6863 TYPE_CODE (type
) = TYPE_CODE (type0
);
6864 INIT_CPLUS_SPECIFIC (type
);
6865 TYPE_NFIELDS (type
) = nfields
;
6866 TYPE_FIELDS (type
) = (struct field
*)
6867 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6868 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6869 sizeof (struct field
) * nfields
);
6870 TYPE_NAME (type
) = ada_type_name (type0
);
6871 TYPE_TAG_NAME (type
) = NULL
;
6872 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
6873 TYPE_LENGTH (type
) = 0;
6875 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6876 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6881 /* Given an object of type TYPE whose contents are at VALADDR and
6882 whose address in memory is ADDRESS, returns a revision of TYPE --
6883 a non-dynamic-sized record with a variant part -- in which
6884 the variant part is replaced with the appropriate branch. Looks
6885 for discriminant values in DVAL0, which can be NULL if the record
6886 contains the necessary discriminant values. */
6888 static struct type
*
6889 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6890 CORE_ADDR address
, struct value
*dval0
)
6892 struct value
*mark
= value_mark ();
6895 struct type
*branch_type
;
6896 int nfields
= TYPE_NFIELDS (type
);
6897 int variant_field
= variant_field_index (type
);
6899 if (variant_field
== -1)
6903 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6907 rtype
= alloc_type (TYPE_OBJFILE (type
));
6908 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6909 INIT_CPLUS_SPECIFIC (rtype
);
6910 TYPE_NFIELDS (rtype
) = nfields
;
6911 TYPE_FIELDS (rtype
) =
6912 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6913 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6914 sizeof (struct field
) * nfields
);
6915 TYPE_NAME (rtype
) = ada_type_name (type
);
6916 TYPE_TAG_NAME (rtype
) = NULL
;
6917 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6918 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
6920 branch_type
= to_fixed_variant_branch_type
6921 (TYPE_FIELD_TYPE (type
, variant_field
),
6922 cond_offset_host (valaddr
,
6923 TYPE_FIELD_BITPOS (type
, variant_field
)
6925 cond_offset_target (address
,
6926 TYPE_FIELD_BITPOS (type
, variant_field
)
6927 / TARGET_CHAR_BIT
), dval
);
6928 if (branch_type
== NULL
)
6931 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
6932 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6933 TYPE_NFIELDS (rtype
) -= 1;
6937 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6938 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6939 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
6940 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
6942 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
6944 value_free_to_mark (mark
);
6948 /* An ordinary record type (with fixed-length fields) that describes
6949 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
6950 beginning of this section]. Any necessary discriminants' values
6951 should be in DVAL, a record value; it may be NULL if the object
6952 at ADDR itself contains any necessary discriminant values.
6953 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
6954 values from the record are needed. Except in the case that DVAL,
6955 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
6956 unchecked) is replaced by a particular branch of the variant.
6958 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
6959 is questionable and may be removed. It can arise during the
6960 processing of an unconstrained-array-of-record type where all the
6961 variant branches have exactly the same size. This is because in
6962 such cases, the compiler does not bother to use the XVS convention
6963 when encoding the record. I am currently dubious of this
6964 shortcut and suspect the compiler should be altered. FIXME. */
6966 static struct type
*
6967 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
6968 CORE_ADDR address
, struct value
*dval
)
6970 struct type
*templ_type
;
6972 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
6975 templ_type
= dynamic_template_type (type0
);
6977 if (templ_type
!= NULL
)
6978 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
6979 else if (variant_field_index (type0
) >= 0)
6981 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
6983 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
6988 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
6994 /* An ordinary record type (with fixed-length fields) that describes
6995 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
6996 union type. Any necessary discriminants' values should be in DVAL,
6997 a record value. That is, this routine selects the appropriate
6998 branch of the union at ADDR according to the discriminant value
6999 indicated in the union's type name. */
7001 static struct type
*
7002 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7003 CORE_ADDR address
, struct value
*dval
)
7006 struct type
*templ_type
;
7007 struct type
*var_type
;
7009 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7010 var_type
= TYPE_TARGET_TYPE (var_type0
);
7012 var_type
= var_type0
;
7014 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7016 if (templ_type
!= NULL
)
7017 var_type
= templ_type
;
7020 ada_which_variant_applies (var_type
,
7021 value_type (dval
), value_contents (dval
));
7024 return empty_record (TYPE_OBJFILE (var_type
));
7025 else if (is_dynamic_field (var_type
, which
))
7026 return to_fixed_record_type
7027 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7028 valaddr
, address
, dval
);
7029 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7031 to_fixed_record_type
7032 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7034 return TYPE_FIELD_TYPE (var_type
, which
);
7037 /* Assuming that TYPE0 is an array type describing the type of a value
7038 at ADDR, and that DVAL describes a record containing any
7039 discriminants used in TYPE0, returns a type for the value that
7040 contains no dynamic components (that is, no components whose sizes
7041 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7042 true, gives an error message if the resulting type's size is over
7045 static struct type
*
7046 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7049 struct type
*index_type_desc
;
7050 struct type
*result
;
7052 if (ada_is_packed_array_type (type0
) /* revisit? */
7053 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7056 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7057 if (index_type_desc
== NULL
)
7059 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7060 /* NOTE: elt_type---the fixed version of elt_type0---should never
7061 depend on the contents of the array in properly constructed
7063 /* Create a fixed version of the array element type.
7064 We're not providing the address of an element here,
7065 and thus the actual object value cannot be inspected to do
7066 the conversion. This should not be a problem, since arrays of
7067 unconstrained objects are not allowed. In particular, all
7068 the elements of an array of a tagged type should all be of
7069 the same type specified in the debugging info. No need to
7070 consult the object tag. */
7071 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7073 if (elt_type0
== elt_type
)
7076 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7077 elt_type
, TYPE_INDEX_TYPE (type0
));
7082 struct type
*elt_type0
;
7085 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7086 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7088 /* NOTE: result---the fixed version of elt_type0---should never
7089 depend on the contents of the array in properly constructed
7091 /* Create a fixed version of the array element type.
7092 We're not providing the address of an element here,
7093 and thus the actual object value cannot be inspected to do
7094 the conversion. This should not be a problem, since arrays of
7095 unconstrained objects are not allowed. In particular, all
7096 the elements of an array of a tagged type should all be of
7097 the same type specified in the debugging info. No need to
7098 consult the object tag. */
7100 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7101 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7103 struct type
*range_type
=
7104 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7105 dval
, TYPE_OBJFILE (type0
));
7106 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7107 result
, range_type
);
7109 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7110 error (_("array type with dynamic size is larger than varsize-limit"));
7113 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7118 /* A standard type (containing no dynamically sized components)
7119 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7120 DVAL describes a record containing any discriminants used in TYPE0,
7121 and may be NULL if there are none, or if the object of type TYPE at
7122 ADDRESS or in VALADDR contains these discriminants.
7124 If CHECK_TAG is not null, in the case of tagged types, this function
7125 attempts to locate the object's tag and use it to compute the actual
7126 type. However, when ADDRESS is null, we cannot use it to determine the
7127 location of the tag, and therefore compute the tagged type's actual type.
7128 So we return the tagged type without consulting the tag. */
7130 static struct type
*
7131 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7132 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7134 type
= ada_check_typedef (type
);
7135 switch (TYPE_CODE (type
))
7139 case TYPE_CODE_STRUCT
:
7141 struct type
*static_type
= to_static_fixed_type (type
);
7142 struct type
*fixed_record_type
=
7143 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7144 /* If STATIC_TYPE is a tagged type and we know the object's address,
7145 then we can determine its tag, and compute the object's actual
7146 type from there. Note that we have to use the fixed record
7147 type (the parent part of the record may have dynamic fields
7148 and the way the location of _tag is expressed may depend on
7151 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7153 struct type
*real_type
=
7154 type_from_tag (value_tag_from_contents_and_address
7158 if (real_type
!= NULL
)
7159 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7161 return fixed_record_type
;
7163 case TYPE_CODE_ARRAY
:
7164 return to_fixed_array_type (type
, dval
, 1);
7165 case TYPE_CODE_UNION
:
7169 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7173 /* The same as ada_to_fixed_type_1, except that it preserves the type
7174 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7175 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7178 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7179 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7182 struct type
*fixed_type
=
7183 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7185 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7186 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7192 /* A standard (static-sized) type corresponding as well as possible to
7193 TYPE0, but based on no runtime data. */
7195 static struct type
*
7196 to_static_fixed_type (struct type
*type0
)
7203 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7206 type0
= ada_check_typedef (type0
);
7208 switch (TYPE_CODE (type0
))
7212 case TYPE_CODE_STRUCT
:
7213 type
= dynamic_template_type (type0
);
7215 return template_to_static_fixed_type (type
);
7217 return template_to_static_fixed_type (type0
);
7218 case TYPE_CODE_UNION
:
7219 type
= ada_find_parallel_type (type0
, "___XVU");
7221 return template_to_static_fixed_type (type
);
7223 return template_to_static_fixed_type (type0
);
7227 /* A static approximation of TYPE with all type wrappers removed. */
7229 static struct type
*
7230 static_unwrap_type (struct type
*type
)
7232 if (ada_is_aligner_type (type
))
7234 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7235 if (ada_type_name (type1
) == NULL
)
7236 TYPE_NAME (type1
) = ada_type_name (type
);
7238 return static_unwrap_type (type1
);
7242 struct type
*raw_real_type
= ada_get_base_type (type
);
7243 if (raw_real_type
== type
)
7246 return to_static_fixed_type (raw_real_type
);
7250 /* In some cases, incomplete and private types require
7251 cross-references that are not resolved as records (for example,
7253 type FooP is access Foo;
7255 type Foo is array ...;
7256 ). In these cases, since there is no mechanism for producing
7257 cross-references to such types, we instead substitute for FooP a
7258 stub enumeration type that is nowhere resolved, and whose tag is
7259 the name of the actual type. Call these types "non-record stubs". */
7261 /* A type equivalent to TYPE that is not a non-record stub, if one
7262 exists, otherwise TYPE. */
7265 ada_check_typedef (struct type
*type
)
7270 CHECK_TYPEDEF (type
);
7271 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7272 || !TYPE_STUB (type
)
7273 || TYPE_TAG_NAME (type
) == NULL
)
7277 char *name
= TYPE_TAG_NAME (type
);
7278 struct type
*type1
= ada_find_any_type (name
);
7279 return (type1
== NULL
) ? type
: type1
;
7283 /* A value representing the data at VALADDR/ADDRESS as described by
7284 type TYPE0, but with a standard (static-sized) type that correctly
7285 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7286 type, then return VAL0 [this feature is simply to avoid redundant
7287 creation of struct values]. */
7289 static struct value
*
7290 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7293 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7294 if (type
== type0
&& val0
!= NULL
)
7297 return value_from_contents_and_address (type
, 0, address
);
7300 /* A value representing VAL, but with a standard (static-sized) type
7301 that correctly describes it. Does not necessarily create a new
7304 static struct value
*
7305 ada_to_fixed_value (struct value
*val
)
7307 return ada_to_fixed_value_create (value_type (val
),
7308 VALUE_ADDRESS (val
) + value_offset (val
),
7312 /* A value representing VAL, but with a standard (static-sized) type
7313 chosen to approximate the real type of VAL as well as possible, but
7314 without consulting any runtime values. For Ada dynamic-sized
7315 types, therefore, the type of the result is likely to be inaccurate. */
7318 ada_to_static_fixed_value (struct value
*val
)
7321 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7322 if (type
== value_type (val
))
7325 return coerce_unspec_val_to_type (val
, type
);
7331 /* Table mapping attribute numbers to names.
7332 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7334 static const char *attribute_names
[] = {
7352 ada_attribute_name (enum exp_opcode n
)
7354 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7355 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7357 return attribute_names
[0];
7360 /* Evaluate the 'POS attribute applied to ARG. */
7363 pos_atr (struct value
*arg
)
7365 struct type
*type
= value_type (arg
);
7367 if (!discrete_type_p (type
))
7368 error (_("'POS only defined on discrete types"));
7370 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7373 LONGEST v
= value_as_long (arg
);
7375 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7377 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7380 error (_("enumeration value is invalid: can't find 'POS"));
7383 return value_as_long (arg
);
7386 static struct value
*
7387 value_pos_atr (struct value
*arg
)
7389 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7392 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7394 static struct value
*
7395 value_val_atr (struct type
*type
, struct value
*arg
)
7397 if (!discrete_type_p (type
))
7398 error (_("'VAL only defined on discrete types"));
7399 if (!integer_type_p (value_type (arg
)))
7400 error (_("'VAL requires integral argument"));
7402 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7404 long pos
= value_as_long (arg
);
7405 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7406 error (_("argument to 'VAL out of range"));
7407 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7410 return value_from_longest (type
, value_as_long (arg
));
7416 /* True if TYPE appears to be an Ada character type.
7417 [At the moment, this is true only for Character and Wide_Character;
7418 It is a heuristic test that could stand improvement]. */
7421 ada_is_character_type (struct type
*type
)
7425 /* If the type code says it's a character, then assume it really is,
7426 and don't check any further. */
7427 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7430 /* Otherwise, assume it's a character type iff it is a discrete type
7431 with a known character type name. */
7432 name
= ada_type_name (type
);
7433 return (name
!= NULL
7434 && (TYPE_CODE (type
) == TYPE_CODE_INT
7435 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7436 && (strcmp (name
, "character") == 0
7437 || strcmp (name
, "wide_character") == 0
7438 || strcmp (name
, "wide_wide_character") == 0
7439 || strcmp (name
, "unsigned char") == 0));
7442 /* True if TYPE appears to be an Ada string type. */
7445 ada_is_string_type (struct type
*type
)
7447 type
= ada_check_typedef (type
);
7449 && TYPE_CODE (type
) != TYPE_CODE_PTR
7450 && (ada_is_simple_array_type (type
)
7451 || ada_is_array_descriptor_type (type
))
7452 && ada_array_arity (type
) == 1)
7454 struct type
*elttype
= ada_array_element_type (type
, 1);
7456 return ada_is_character_type (elttype
);
7463 /* True if TYPE is a struct type introduced by the compiler to force the
7464 alignment of a value. Such types have a single field with a
7465 distinctive name. */
7468 ada_is_aligner_type (struct type
*type
)
7470 type
= ada_check_typedef (type
);
7472 /* If we can find a parallel XVS type, then the XVS type should
7473 be used instead of this type. And hence, this is not an aligner
7475 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7478 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7479 && TYPE_NFIELDS (type
) == 1
7480 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7483 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7484 the parallel type. */
7487 ada_get_base_type (struct type
*raw_type
)
7489 struct type
*real_type_namer
;
7490 struct type
*raw_real_type
;
7492 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7495 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7496 if (real_type_namer
== NULL
7497 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7498 || TYPE_NFIELDS (real_type_namer
) != 1)
7501 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7502 if (raw_real_type
== NULL
)
7505 return raw_real_type
;
7508 /* The type of value designated by TYPE, with all aligners removed. */
7511 ada_aligned_type (struct type
*type
)
7513 if (ada_is_aligner_type (type
))
7514 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7516 return ada_get_base_type (type
);
7520 /* The address of the aligned value in an object at address VALADDR
7521 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7524 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7526 if (ada_is_aligner_type (type
))
7527 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7529 TYPE_FIELD_BITPOS (type
,
7530 0) / TARGET_CHAR_BIT
);
7537 /* The printed representation of an enumeration literal with encoded
7538 name NAME. The value is good to the next call of ada_enum_name. */
7540 ada_enum_name (const char *name
)
7542 static char *result
;
7543 static size_t result_len
= 0;
7546 /* First, unqualify the enumeration name:
7547 1. Search for the last '.' character. If we find one, then skip
7548 all the preceeding characters, the unqualified name starts
7549 right after that dot.
7550 2. Otherwise, we may be debugging on a target where the compiler
7551 translates dots into "__". Search forward for double underscores,
7552 but stop searching when we hit an overloading suffix, which is
7553 of the form "__" followed by digits. */
7555 tmp
= strrchr (name
, '.');
7560 while ((tmp
= strstr (name
, "__")) != NULL
)
7562 if (isdigit (tmp
[2]))
7572 if (name
[1] == 'U' || name
[1] == 'W')
7574 if (sscanf (name
+ 2, "%x", &v
) != 1)
7580 GROW_VECT (result
, result_len
, 16);
7581 if (isascii (v
) && isprint (v
))
7582 sprintf (result
, "'%c'", v
);
7583 else if (name
[1] == 'U')
7584 sprintf (result
, "[\"%02x\"]", v
);
7586 sprintf (result
, "[\"%04x\"]", v
);
7592 tmp
= strstr (name
, "__");
7594 tmp
= strstr (name
, "$");
7597 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7598 strncpy (result
, name
, tmp
- name
);
7599 result
[tmp
- name
] = '\0';
7607 static struct value
*
7608 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7611 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7612 (expect_type
, exp
, pos
, noside
);
7615 /* Evaluate the subexpression of EXP starting at *POS as for
7616 evaluate_type, updating *POS to point just past the evaluated
7619 static struct value
*
7620 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7622 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7623 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7626 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7629 static struct value
*
7630 unwrap_value (struct value
*val
)
7632 struct type
*type
= ada_check_typedef (value_type (val
));
7633 if (ada_is_aligner_type (type
))
7635 struct value
*v
= value_struct_elt (&val
, NULL
, "F",
7636 NULL
, "internal structure");
7637 struct type
*val_type
= ada_check_typedef (value_type (v
));
7638 if (ada_type_name (val_type
) == NULL
)
7639 TYPE_NAME (val_type
) = ada_type_name (type
);
7641 return unwrap_value (v
);
7645 struct type
*raw_real_type
=
7646 ada_check_typedef (ada_get_base_type (type
));
7648 if (type
== raw_real_type
)
7652 coerce_unspec_val_to_type
7653 (val
, ada_to_fixed_type (raw_real_type
, 0,
7654 VALUE_ADDRESS (val
) + value_offset (val
),
7659 static struct value
*
7660 cast_to_fixed (struct type
*type
, struct value
*arg
)
7664 if (type
== value_type (arg
))
7666 else if (ada_is_fixed_point_type (value_type (arg
)))
7667 val
= ada_float_to_fixed (type
,
7668 ada_fixed_to_float (value_type (arg
),
7669 value_as_long (arg
)));
7673 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7674 val
= ada_float_to_fixed (type
, argd
);
7677 return value_from_longest (type
, val
);
7680 static struct value
*
7681 cast_from_fixed_to_double (struct value
*arg
)
7683 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7684 value_as_long (arg
));
7685 return value_from_double (builtin_type_double
, val
);
7688 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7689 return the converted value. */
7691 static struct value
*
7692 coerce_for_assign (struct type
*type
, struct value
*val
)
7694 struct type
*type2
= value_type (val
);
7698 type2
= ada_check_typedef (type2
);
7699 type
= ada_check_typedef (type
);
7701 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7702 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7704 val
= ada_value_ind (val
);
7705 type2
= value_type (val
);
7708 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7709 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7711 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7712 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7713 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7714 error (_("Incompatible types in assignment"));
7715 deprecated_set_value_type (val
, type
);
7720 static struct value
*
7721 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7724 struct type
*type1
, *type2
;
7727 arg1
= coerce_ref (arg1
);
7728 arg2
= coerce_ref (arg2
);
7729 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7730 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7732 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7733 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7734 return value_binop (arg1
, arg2
, op
);
7743 return value_binop (arg1
, arg2
, op
);
7746 v2
= value_as_long (arg2
);
7748 error (_("second operand of %s must not be zero."), op_string (op
));
7750 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7751 return value_binop (arg1
, arg2
, op
);
7753 v1
= value_as_long (arg1
);
7758 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7759 v
+= v
> 0 ? -1 : 1;
7767 /* Should not reach this point. */
7771 val
= allocate_value (type1
);
7772 store_unsigned_integer (value_contents_raw (val
),
7773 TYPE_LENGTH (value_type (val
)), v
);
7778 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7780 if (ada_is_direct_array_type (value_type (arg1
))
7781 || ada_is_direct_array_type (value_type (arg2
)))
7783 /* Automatically dereference any array reference before
7784 we attempt to perform the comparison. */
7785 arg1
= ada_coerce_ref (arg1
);
7786 arg2
= ada_coerce_ref (arg2
);
7788 arg1
= ada_coerce_to_simple_array (arg1
);
7789 arg2
= ada_coerce_to_simple_array (arg2
);
7790 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7791 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7792 error (_("Attempt to compare array with non-array"));
7793 /* FIXME: The following works only for types whose
7794 representations use all bits (no padding or undefined bits)
7795 and do not have user-defined equality. */
7797 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7798 && memcmp (value_contents (arg1
), value_contents (arg2
),
7799 TYPE_LENGTH (value_type (arg1
))) == 0;
7801 return value_equal (arg1
, arg2
);
7804 /* Total number of component associations in the aggregate starting at
7805 index PC in EXP. Assumes that index PC is the start of an
7809 num_component_specs (struct expression
*exp
, int pc
)
7812 m
= exp
->elts
[pc
+ 1].longconst
;
7815 for (i
= 0; i
< m
; i
+= 1)
7817 switch (exp
->elts
[pc
].opcode
)
7823 n
+= exp
->elts
[pc
+ 1].longconst
;
7826 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7831 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7832 component of LHS (a simple array or a record), updating *POS past
7833 the expression, assuming that LHS is contained in CONTAINER. Does
7834 not modify the inferior's memory, nor does it modify LHS (unless
7835 LHS == CONTAINER). */
7838 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7839 struct expression
*exp
, int *pos
)
7841 struct value
*mark
= value_mark ();
7843 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7845 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
7846 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7850 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7851 elt
= ada_to_fixed_value (unwrap_value (elt
));
7854 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7855 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7857 value_assign_to_component (container
, elt
,
7858 ada_evaluate_subexp (NULL
, exp
, pos
,
7861 value_free_to_mark (mark
);
7864 /* Assuming that LHS represents an lvalue having a record or array
7865 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7866 of that aggregate's value to LHS, advancing *POS past the
7867 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7868 lvalue containing LHS (possibly LHS itself). Does not modify
7869 the inferior's memory, nor does it modify the contents of
7870 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7872 static struct value
*
7873 assign_aggregate (struct value
*container
,
7874 struct value
*lhs
, struct expression
*exp
,
7875 int *pos
, enum noside noside
)
7877 struct type
*lhs_type
;
7878 int n
= exp
->elts
[*pos
+1].longconst
;
7879 LONGEST low_index
, high_index
;
7882 int max_indices
, num_indices
;
7883 int is_array_aggregate
;
7885 struct value
*mark
= value_mark ();
7888 if (noside
!= EVAL_NORMAL
)
7891 for (i
= 0; i
< n
; i
+= 1)
7892 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
7896 container
= ada_coerce_ref (container
);
7897 if (ada_is_direct_array_type (value_type (container
)))
7898 container
= ada_coerce_to_simple_array (container
);
7899 lhs
= ada_coerce_ref (lhs
);
7900 if (!deprecated_value_modifiable (lhs
))
7901 error (_("Left operand of assignment is not a modifiable lvalue."));
7903 lhs_type
= value_type (lhs
);
7904 if (ada_is_direct_array_type (lhs_type
))
7906 lhs
= ada_coerce_to_simple_array (lhs
);
7907 lhs_type
= value_type (lhs
);
7908 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
7909 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
7910 is_array_aggregate
= 1;
7912 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
7915 high_index
= num_visible_fields (lhs_type
) - 1;
7916 is_array_aggregate
= 0;
7919 error (_("Left-hand side must be array or record."));
7921 num_specs
= num_component_specs (exp
, *pos
- 3);
7922 max_indices
= 4 * num_specs
+ 4;
7923 indices
= alloca (max_indices
* sizeof (indices
[0]));
7924 indices
[0] = indices
[1] = low_index
- 1;
7925 indices
[2] = indices
[3] = high_index
+ 1;
7928 for (i
= 0; i
< n
; i
+= 1)
7930 switch (exp
->elts
[*pos
].opcode
)
7933 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
7934 &num_indices
, max_indices
,
7935 low_index
, high_index
);
7938 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
7939 &num_indices
, max_indices
,
7940 low_index
, high_index
);
7944 error (_("Misplaced 'others' clause"));
7945 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
7946 num_indices
, low_index
, high_index
);
7949 error (_("Internal error: bad aggregate clause"));
7956 /* Assign into the component of LHS indexed by the OP_POSITIONAL
7957 construct at *POS, updating *POS past the construct, given that
7958 the positions are relative to lower bound LOW, where HIGH is the
7959 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
7960 updating *NUM_INDICES as needed. CONTAINER is as for
7961 assign_aggregate. */
7963 aggregate_assign_positional (struct value
*container
,
7964 struct value
*lhs
, struct expression
*exp
,
7965 int *pos
, LONGEST
*indices
, int *num_indices
,
7966 int max_indices
, LONGEST low
, LONGEST high
)
7968 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
7970 if (ind
- 1 == high
)
7971 warning (_("Extra components in aggregate ignored."));
7974 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
7976 assign_component (container
, lhs
, ind
, exp
, pos
);
7979 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7982 /* Assign into the components of LHS indexed by the OP_CHOICES
7983 construct at *POS, updating *POS past the construct, given that
7984 the allowable indices are LOW..HIGH. Record the indices assigned
7985 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
7986 needed. CONTAINER is as for assign_aggregate. */
7988 aggregate_assign_from_choices (struct value
*container
,
7989 struct value
*lhs
, struct expression
*exp
,
7990 int *pos
, LONGEST
*indices
, int *num_indices
,
7991 int max_indices
, LONGEST low
, LONGEST high
)
7994 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
7995 int choice_pos
, expr_pc
;
7996 int is_array
= ada_is_direct_array_type (value_type (lhs
));
7998 choice_pos
= *pos
+= 3;
8000 for (j
= 0; j
< n_choices
; j
+= 1)
8001 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8003 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8005 for (j
= 0; j
< n_choices
; j
+= 1)
8007 LONGEST lower
, upper
;
8008 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8009 if (op
== OP_DISCRETE_RANGE
)
8012 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8014 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8019 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8030 name
= &exp
->elts
[choice_pos
+ 2].string
;
8033 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8036 error (_("Invalid record component association."));
8038 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8040 if (! find_struct_field (name
, value_type (lhs
), 0,
8041 NULL
, NULL
, NULL
, NULL
, &ind
))
8042 error (_("Unknown component name: %s."), name
);
8043 lower
= upper
= ind
;
8046 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8047 error (_("Index in component association out of bounds."));
8049 add_component_interval (lower
, upper
, indices
, num_indices
,
8051 while (lower
<= upper
)
8055 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8061 /* Assign the value of the expression in the OP_OTHERS construct in
8062 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8063 have not been previously assigned. The index intervals already assigned
8064 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8065 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8067 aggregate_assign_others (struct value
*container
,
8068 struct value
*lhs
, struct expression
*exp
,
8069 int *pos
, LONGEST
*indices
, int num_indices
,
8070 LONGEST low
, LONGEST high
)
8073 int expr_pc
= *pos
+1;
8075 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8078 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8082 assign_component (container
, lhs
, ind
, exp
, &pos
);
8085 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8088 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8089 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8090 modifying *SIZE as needed. It is an error if *SIZE exceeds
8091 MAX_SIZE. The resulting intervals do not overlap. */
8093 add_component_interval (LONGEST low
, LONGEST high
,
8094 LONGEST
* indices
, int *size
, int max_size
)
8097 for (i
= 0; i
< *size
; i
+= 2) {
8098 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8101 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8102 if (high
< indices
[kh
])
8104 if (low
< indices
[i
])
8106 indices
[i
+ 1] = indices
[kh
- 1];
8107 if (high
> indices
[i
+ 1])
8108 indices
[i
+ 1] = high
;
8109 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8110 *size
-= kh
- i
- 2;
8113 else if (high
< indices
[i
])
8117 if (*size
== max_size
)
8118 error (_("Internal error: miscounted aggregate components."));
8120 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8121 indices
[j
] = indices
[j
- 2];
8123 indices
[i
+ 1] = high
;
8126 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8129 static struct value
*
8130 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8132 if (type
== ada_check_typedef (value_type (arg2
)))
8135 if (ada_is_fixed_point_type (type
))
8136 return (cast_to_fixed (type
, arg2
));
8138 if (ada_is_fixed_point_type (value_type (arg2
)))
8139 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8141 return value_cast (type
, arg2
);
8144 static struct value
*
8145 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8146 int *pos
, enum noside noside
)
8149 int tem
, tem2
, tem3
;
8151 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8154 struct value
**argvec
;
8158 op
= exp
->elts
[pc
].opcode
;
8164 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8165 arg1
= unwrap_value (arg1
);
8167 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8168 then we need to perform the conversion manually, because
8169 evaluate_subexp_standard doesn't do it. This conversion is
8170 necessary in Ada because the different kinds of float/fixed
8171 types in Ada have different representations.
8173 Similarly, we need to perform the conversion from OP_LONG
8175 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8176 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8182 struct value
*result
;
8184 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8185 /* The result type will have code OP_STRING, bashed there from
8186 OP_ARRAY. Bash it back. */
8187 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8188 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8194 type
= exp
->elts
[pc
+ 1].type
;
8195 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8196 if (noside
== EVAL_SKIP
)
8198 arg1
= ada_value_cast (type
, arg1
, noside
);
8203 type
= exp
->elts
[pc
+ 1].type
;
8204 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8207 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8208 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8210 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8211 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8213 return ada_value_assign (arg1
, arg1
);
8215 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8216 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8218 if (ada_is_fixed_point_type (value_type (arg1
)))
8219 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8220 else if (ada_is_fixed_point_type (value_type (arg2
)))
8222 (_("Fixed-point values must be assigned to fixed-point variables"));
8224 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8225 return ada_value_assign (arg1
, arg2
);
8228 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8229 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8230 if (noside
== EVAL_SKIP
)
8232 if ((ada_is_fixed_point_type (value_type (arg1
))
8233 || ada_is_fixed_point_type (value_type (arg2
)))
8234 && value_type (arg1
) != value_type (arg2
))
8235 error (_("Operands of fixed-point addition must have the same type"));
8236 /* Do the addition, and cast the result to the type of the first
8237 argument. We cannot cast the result to a reference type, so if
8238 ARG1 is a reference type, find its underlying type. */
8239 type
= value_type (arg1
);
8240 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8241 type
= TYPE_TARGET_TYPE (type
);
8242 return value_cast (type
, value_add (arg1
, arg2
));
8245 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8246 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8247 if (noside
== EVAL_SKIP
)
8249 if ((ada_is_fixed_point_type (value_type (arg1
))
8250 || ada_is_fixed_point_type (value_type (arg2
)))
8251 && value_type (arg1
) != value_type (arg2
))
8252 error (_("Operands of fixed-point subtraction must have the same type"));
8253 /* Do the substraction, and cast the result to the type of the first
8254 argument. We cannot cast the result to a reference type, so if
8255 ARG1 is a reference type, find its underlying type. */
8256 type
= value_type (arg1
);
8257 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8258 type
= TYPE_TARGET_TYPE (type
);
8259 return value_cast (type
, value_sub (arg1
, arg2
));
8263 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8264 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8265 if (noside
== EVAL_SKIP
)
8267 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8268 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8269 return value_zero (value_type (arg1
), not_lval
);
8272 if (ada_is_fixed_point_type (value_type (arg1
)))
8273 arg1
= cast_from_fixed_to_double (arg1
);
8274 if (ada_is_fixed_point_type (value_type (arg2
)))
8275 arg2
= cast_from_fixed_to_double (arg2
);
8276 return ada_value_binop (arg1
, arg2
, op
);
8281 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8282 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8283 if (noside
== EVAL_SKIP
)
8285 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8286 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8287 return value_zero (value_type (arg1
), not_lval
);
8289 return ada_value_binop (arg1
, arg2
, op
);
8292 case BINOP_NOTEQUAL
:
8293 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8294 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8295 if (noside
== EVAL_SKIP
)
8297 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8300 tem
= ada_value_equal (arg1
, arg2
);
8301 if (op
== BINOP_NOTEQUAL
)
8303 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8306 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8307 if (noside
== EVAL_SKIP
)
8309 else if (ada_is_fixed_point_type (value_type (arg1
)))
8310 return value_cast (value_type (arg1
), value_neg (arg1
));
8312 return value_neg (arg1
);
8314 case BINOP_LOGICAL_AND
:
8315 case BINOP_LOGICAL_OR
:
8316 case UNOP_LOGICAL_NOT
:
8321 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8322 return value_cast (LA_BOOL_TYPE
, val
);
8325 case BINOP_BITWISE_AND
:
8326 case BINOP_BITWISE_IOR
:
8327 case BINOP_BITWISE_XOR
:
8331 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8333 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8335 return value_cast (value_type (arg1
), val
);
8341 /* Tagged types are a little special in the fact that the real type
8342 is dynamic and can only be determined by inspecting the object
8343 value. So even if we're support to do an EVAL_AVOID_SIDE_EFFECTS
8344 evaluation, we force an EVAL_NORMAL evaluation for tagged types. */
8345 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8346 && ada_is_tagged_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
), 1))
8347 noside
= EVAL_NORMAL
;
8349 if (noside
== EVAL_SKIP
)
8354 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8355 /* Only encountered when an unresolved symbol occurs in a
8356 context other than a function call, in which case, it is
8358 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8359 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8360 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8364 (to_static_fixed_type
8365 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8371 unwrap_value (evaluate_subexp_standard
8372 (expect_type
, exp
, pos
, noside
));
8373 return ada_to_fixed_value (arg1
);
8379 /* Allocate arg vector, including space for the function to be
8380 called in argvec[0] and a terminating NULL. */
8381 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8383 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8385 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8386 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8387 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8388 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8391 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8392 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8395 if (noside
== EVAL_SKIP
)
8399 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8400 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8401 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8402 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8403 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8404 argvec
[0] = value_addr (argvec
[0]);
8406 type
= ada_check_typedef (value_type (argvec
[0]));
8407 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8409 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8411 case TYPE_CODE_FUNC
:
8412 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8414 case TYPE_CODE_ARRAY
:
8416 case TYPE_CODE_STRUCT
:
8417 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8418 argvec
[0] = ada_value_ind (argvec
[0]);
8419 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8422 error (_("cannot subscript or call something of type `%s'"),
8423 ada_type_name (value_type (argvec
[0])));
8428 switch (TYPE_CODE (type
))
8430 case TYPE_CODE_FUNC
:
8431 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8432 return allocate_value (TYPE_TARGET_TYPE (type
));
8433 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8434 case TYPE_CODE_STRUCT
:
8438 arity
= ada_array_arity (type
);
8439 type
= ada_array_element_type (type
, nargs
);
8441 error (_("cannot subscript or call a record"));
8443 error (_("wrong number of subscripts; expecting %d"), arity
);
8444 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8445 return value_zero (ada_aligned_type (type
), lval_memory
);
8447 unwrap_value (ada_value_subscript
8448 (argvec
[0], nargs
, argvec
+ 1));
8450 case TYPE_CODE_ARRAY
:
8451 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8453 type
= ada_array_element_type (type
, nargs
);
8455 error (_("element type of array unknown"));
8457 return value_zero (ada_aligned_type (type
), lval_memory
);
8460 unwrap_value (ada_value_subscript
8461 (ada_coerce_to_simple_array (argvec
[0]),
8462 nargs
, argvec
+ 1));
8463 case TYPE_CODE_PTR
: /* Pointer to array */
8464 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8465 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8467 type
= ada_array_element_type (type
, nargs
);
8469 error (_("element type of array unknown"));
8471 return value_zero (ada_aligned_type (type
), lval_memory
);
8474 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8475 nargs
, argvec
+ 1));
8478 error (_("Attempt to index or call something other than an "
8479 "array or function"));
8484 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8485 struct value
*low_bound_val
=
8486 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8487 struct value
*high_bound_val
=
8488 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8491 low_bound_val
= coerce_ref (low_bound_val
);
8492 high_bound_val
= coerce_ref (high_bound_val
);
8493 low_bound
= pos_atr (low_bound_val
);
8494 high_bound
= pos_atr (high_bound_val
);
8496 if (noside
== EVAL_SKIP
)
8499 /* If this is a reference to an aligner type, then remove all
8501 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8502 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8503 TYPE_TARGET_TYPE (value_type (array
)) =
8504 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8506 if (ada_is_packed_array_type (value_type (array
)))
8507 error (_("cannot slice a packed array"));
8509 /* If this is a reference to an array or an array lvalue,
8510 convert to a pointer. */
8511 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8512 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8513 && VALUE_LVAL (array
) == lval_memory
))
8514 array
= value_addr (array
);
8516 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8517 && ada_is_array_descriptor_type (ada_check_typedef
8518 (value_type (array
))))
8519 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8521 array
= ada_coerce_to_simple_array_ptr (array
);
8523 /* If we have more than one level of pointer indirection,
8524 dereference the value until we get only one level. */
8525 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8526 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8528 array
= value_ind (array
);
8530 /* Make sure we really do have an array type before going further,
8531 to avoid a SEGV when trying to get the index type or the target
8532 type later down the road if the debug info generated by
8533 the compiler is incorrect or incomplete. */
8534 if (!ada_is_simple_array_type (value_type (array
)))
8535 error (_("cannot take slice of non-array"));
8537 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8539 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8540 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8544 struct type
*arr_type0
=
8545 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8547 return ada_value_slice_ptr (array
, arr_type0
,
8548 longest_to_int (low_bound
),
8549 longest_to_int (high_bound
));
8552 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8554 else if (high_bound
< low_bound
)
8555 return empty_array (value_type (array
), low_bound
);
8557 return ada_value_slice (array
, longest_to_int (low_bound
),
8558 longest_to_int (high_bound
));
8563 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8564 type
= exp
->elts
[pc
+ 1].type
;
8566 if (noside
== EVAL_SKIP
)
8569 switch (TYPE_CODE (type
))
8572 lim_warning (_("Membership test incompletely implemented; "
8573 "always returns true"));
8574 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8576 case TYPE_CODE_RANGE
:
8577 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8578 arg3
= value_from_longest (builtin_type_int
,
8579 TYPE_HIGH_BOUND (type
));
8581 value_from_longest (builtin_type_int
,
8582 (value_less (arg1
, arg3
)
8583 || value_equal (arg1
, arg3
))
8584 && (value_less (arg2
, arg1
)
8585 || value_equal (arg2
, arg1
)));
8588 case BINOP_IN_BOUNDS
:
8590 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8591 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8593 if (noside
== EVAL_SKIP
)
8596 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8597 return value_zero (builtin_type_int
, not_lval
);
8599 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8601 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8602 error (_("invalid dimension number to 'range"));
8604 arg3
= ada_array_bound (arg2
, tem
, 1);
8605 arg2
= ada_array_bound (arg2
, tem
, 0);
8608 value_from_longest (builtin_type_int
,
8609 (value_less (arg1
, arg3
)
8610 || value_equal (arg1
, arg3
))
8611 && (value_less (arg2
, arg1
)
8612 || value_equal (arg2
, arg1
)));
8614 case TERNOP_IN_RANGE
:
8615 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8616 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8617 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8619 if (noside
== EVAL_SKIP
)
8623 value_from_longest (builtin_type_int
,
8624 (value_less (arg1
, arg3
)
8625 || value_equal (arg1
, arg3
))
8626 && (value_less (arg2
, arg1
)
8627 || value_equal (arg2
, arg1
)));
8633 struct type
*type_arg
;
8634 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8636 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8638 type_arg
= exp
->elts
[pc
+ 2].type
;
8642 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8646 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8647 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8648 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8651 if (noside
== EVAL_SKIP
)
8654 if (type_arg
== NULL
)
8656 arg1
= ada_coerce_ref (arg1
);
8658 if (ada_is_packed_array_type (value_type (arg1
)))
8659 arg1
= ada_coerce_to_simple_array (arg1
);
8661 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8662 error (_("invalid dimension number to '%s"),
8663 ada_attribute_name (op
));
8665 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8667 type
= ada_index_type (value_type (arg1
), tem
);
8670 (_("attempt to take bound of something that is not an array"));
8671 return allocate_value (type
);
8676 default: /* Should never happen. */
8677 error (_("unexpected attribute encountered"));
8679 return ada_array_bound (arg1
, tem
, 0);
8681 return ada_array_bound (arg1
, tem
, 1);
8683 return ada_array_length (arg1
, tem
);
8686 else if (discrete_type_p (type_arg
))
8688 struct type
*range_type
;
8689 char *name
= ada_type_name (type_arg
);
8691 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8693 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8694 if (range_type
== NULL
)
8695 range_type
= type_arg
;
8699 error (_("unexpected attribute encountered"));
8701 return discrete_type_low_bound (range_type
);
8703 return discrete_type_high_bound (range_type
);
8705 error (_("the 'length attribute applies only to array types"));
8708 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8709 error (_("unimplemented type attribute"));
8714 if (ada_is_packed_array_type (type_arg
))
8715 type_arg
= decode_packed_array_type (type_arg
);
8717 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8718 error (_("invalid dimension number to '%s"),
8719 ada_attribute_name (op
));
8721 type
= ada_index_type (type_arg
, tem
);
8724 (_("attempt to take bound of something that is not an array"));
8725 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8726 return allocate_value (type
);
8731 error (_("unexpected attribute encountered"));
8733 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8734 return value_from_longest (type
, low
);
8736 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8737 return value_from_longest (type
, high
);
8739 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8740 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8741 return value_from_longest (type
, high
- low
+ 1);
8747 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8748 if (noside
== EVAL_SKIP
)
8751 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8752 return value_zero (ada_tag_type (arg1
), not_lval
);
8754 return ada_value_tag (arg1
);
8758 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8759 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8760 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8761 if (noside
== EVAL_SKIP
)
8763 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8764 return value_zero (value_type (arg1
), not_lval
);
8766 return value_binop (arg1
, arg2
,
8767 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8769 case OP_ATR_MODULUS
:
8771 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
8772 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8774 if (noside
== EVAL_SKIP
)
8777 if (!ada_is_modular_type (type_arg
))
8778 error (_("'modulus must be applied to modular type"));
8780 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8781 ada_modulus (type_arg
));
8786 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8787 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8788 if (noside
== EVAL_SKIP
)
8790 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8791 return value_zero (builtin_type_int
, not_lval
);
8793 return value_pos_atr (arg1
);
8796 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8797 if (noside
== EVAL_SKIP
)
8799 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8800 return value_zero (builtin_type_int
, not_lval
);
8802 return value_from_longest (builtin_type_int
,
8804 * TYPE_LENGTH (value_type (arg1
)));
8807 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8808 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8809 type
= exp
->elts
[pc
+ 2].type
;
8810 if (noside
== EVAL_SKIP
)
8812 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8813 return value_zero (type
, not_lval
);
8815 return value_val_atr (type
, arg1
);
8818 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8819 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8820 if (noside
== EVAL_SKIP
)
8822 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8823 return value_zero (value_type (arg1
), not_lval
);
8825 return value_binop (arg1
, arg2
, op
);
8828 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8829 if (noside
== EVAL_SKIP
)
8835 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8836 if (noside
== EVAL_SKIP
)
8838 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
8839 return value_neg (arg1
);
8844 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
8845 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
8846 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
8847 if (noside
== EVAL_SKIP
)
8849 type
= ada_check_typedef (value_type (arg1
));
8850 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8852 if (ada_is_array_descriptor_type (type
))
8853 /* GDB allows dereferencing GNAT array descriptors. */
8855 struct type
*arrType
= ada_type_of_array (arg1
, 0);
8856 if (arrType
== NULL
)
8857 error (_("Attempt to dereference null array pointer."));
8858 return value_at_lazy (arrType
, 0);
8860 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
8861 || TYPE_CODE (type
) == TYPE_CODE_REF
8862 /* In C you can dereference an array to get the 1st elt. */
8863 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8865 type
= to_static_fixed_type
8867 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
8869 return value_zero (type
, lval_memory
);
8871 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
8872 /* GDB allows dereferencing an int. */
8873 return value_zero (builtin_type_int
, lval_memory
);
8875 error (_("Attempt to take contents of a non-pointer value."));
8877 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
8878 type
= ada_check_typedef (value_type (arg1
));
8880 if (ada_is_array_descriptor_type (type
))
8881 /* GDB allows dereferencing GNAT array descriptors. */
8882 return ada_coerce_to_simple_array (arg1
);
8884 return ada_value_ind (arg1
);
8886 case STRUCTOP_STRUCT
:
8887 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8888 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
8889 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8890 if (noside
== EVAL_SKIP
)
8892 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8894 struct type
*type1
= value_type (arg1
);
8895 if (ada_is_tagged_type (type1
, 1))
8897 type
= ada_lookup_struct_elt_type (type1
,
8898 &exp
->elts
[pc
+ 2].string
,
8901 /* In this case, we assume that the field COULD exist
8902 in some extension of the type. Return an object of
8903 "type" void, which will match any formal
8904 (see ada_type_match). */
8905 return value_zero (builtin_type_void
, lval_memory
);
8909 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
8912 return value_zero (ada_aligned_type (type
), lval_memory
);
8916 ada_to_fixed_value (unwrap_value
8917 (ada_value_struct_elt
8918 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
8920 /* The value is not supposed to be used. This is here to make it
8921 easier to accommodate expressions that contain types. */
8923 if (noside
== EVAL_SKIP
)
8925 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8926 return allocate_value (exp
->elts
[pc
+ 1].type
);
8928 error (_("Attempt to use a type name as an expression"));
8933 case OP_DISCRETE_RANGE
:
8936 if (noside
== EVAL_NORMAL
)
8940 error (_("Undefined name, ambiguous name, or renaming used in "
8941 "component association: %s."), &exp
->elts
[pc
+2].string
);
8943 error (_("Aggregates only allowed on the right of an assignment"));
8945 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
8948 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
8950 for (tem
= 0; tem
< nargs
; tem
+= 1)
8951 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8956 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
8962 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
8963 type name that encodes the 'small and 'delta information.
8964 Otherwise, return NULL. */
8967 fixed_type_info (struct type
*type
)
8969 const char *name
= ada_type_name (type
);
8970 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
8972 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
8974 const char *tail
= strstr (name
, "___XF_");
8980 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
8981 return fixed_type_info (TYPE_TARGET_TYPE (type
));
8986 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
8989 ada_is_fixed_point_type (struct type
*type
)
8991 return fixed_type_info (type
) != NULL
;
8994 /* Return non-zero iff TYPE represents a System.Address type. */
8997 ada_is_system_address_type (struct type
*type
)
8999 return (TYPE_NAME (type
)
9000 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9003 /* Assuming that TYPE is the representation of an Ada fixed-point
9004 type, return its delta, or -1 if the type is malformed and the
9005 delta cannot be determined. */
9008 ada_delta (struct type
*type
)
9010 const char *encoding
= fixed_type_info (type
);
9013 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9016 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9019 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9020 factor ('SMALL value) associated with the type. */
9023 scaling_factor (struct type
*type
)
9025 const char *encoding
= fixed_type_info (type
);
9026 unsigned long num0
, den0
, num1
, den1
;
9029 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9034 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9036 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9040 /* Assuming that X is the representation of a value of fixed-point
9041 type TYPE, return its floating-point equivalent. */
9044 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9046 return (DOUBLEST
) x
*scaling_factor (type
);
9049 /* The representation of a fixed-point value of type TYPE
9050 corresponding to the value X. */
9053 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9055 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9059 /* VAX floating formats */
9061 /* Non-zero iff TYPE represents one of the special VAX floating-point
9065 ada_is_vax_floating_type (struct type
*type
)
9068 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9071 && (TYPE_CODE (type
) == TYPE_CODE_INT
9072 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9073 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9076 /* The type of special VAX floating-point type this is, assuming
9077 ada_is_vax_floating_point. */
9080 ada_vax_float_type_suffix (struct type
*type
)
9082 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9085 /* A value representing the special debugging function that outputs
9086 VAX floating-point values of the type represented by TYPE. Assumes
9087 ada_is_vax_floating_type (TYPE). */
9090 ada_vax_float_print_function (struct type
*type
)
9092 switch (ada_vax_float_type_suffix (type
))
9095 return get_var_value ("DEBUG_STRING_F", 0);
9097 return get_var_value ("DEBUG_STRING_D", 0);
9099 return get_var_value ("DEBUG_STRING_G", 0);
9101 error (_("invalid VAX floating-point type"));
9108 /* Scan STR beginning at position K for a discriminant name, and
9109 return the value of that discriminant field of DVAL in *PX. If
9110 PNEW_K is not null, put the position of the character beyond the
9111 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9112 not alter *PX and *PNEW_K if unsuccessful. */
9115 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9118 static char *bound_buffer
= NULL
;
9119 static size_t bound_buffer_len
= 0;
9122 struct value
*bound_val
;
9124 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9127 pend
= strstr (str
+ k
, "__");
9131 k
+= strlen (bound
);
9135 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9136 bound
= bound_buffer
;
9137 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9138 bound
[pend
- (str
+ k
)] = '\0';
9142 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9143 if (bound_val
== NULL
)
9146 *px
= value_as_long (bound_val
);
9152 /* Value of variable named NAME in the current environment. If
9153 no such variable found, then if ERR_MSG is null, returns 0, and
9154 otherwise causes an error with message ERR_MSG. */
9156 static struct value
*
9157 get_var_value (char *name
, char *err_msg
)
9159 struct ada_symbol_info
*syms
;
9162 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9167 if (err_msg
== NULL
)
9170 error (("%s"), err_msg
);
9173 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9176 /* Value of integer variable named NAME in the current environment. If
9177 no such variable found, returns 0, and sets *FLAG to 0. If
9178 successful, sets *FLAG to 1. */
9181 get_int_var_value (char *name
, int *flag
)
9183 struct value
*var_val
= get_var_value (name
, 0);
9195 return value_as_long (var_val
);
9200 /* Return a range type whose base type is that of the range type named
9201 NAME in the current environment, and whose bounds are calculated
9202 from NAME according to the GNAT range encoding conventions.
9203 Extract discriminant values, if needed, from DVAL. If a new type
9204 must be created, allocate in OBJFILE's space. The bounds
9205 information, in general, is encoded in NAME, the base type given in
9206 the named range type. */
9208 static struct type
*
9209 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9211 struct type
*raw_type
= ada_find_any_type (name
);
9212 struct type
*base_type
;
9215 if (raw_type
== NULL
)
9216 base_type
= builtin_type_int
;
9217 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9218 base_type
= TYPE_TARGET_TYPE (raw_type
);
9220 base_type
= raw_type
;
9222 subtype_info
= strstr (name
, "___XD");
9223 if (subtype_info
== NULL
)
9227 static char *name_buf
= NULL
;
9228 static size_t name_len
= 0;
9229 int prefix_len
= subtype_info
- name
;
9235 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9236 strncpy (name_buf
, name
, prefix_len
);
9237 name_buf
[prefix_len
] = '\0';
9240 bounds_str
= strchr (subtype_info
, '_');
9243 if (*subtype_info
== 'L')
9245 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9246 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9248 if (bounds_str
[n
] == '_')
9250 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9257 strcpy (name_buf
+ prefix_len
, "___L");
9258 L
= get_int_var_value (name_buf
, &ok
);
9261 lim_warning (_("Unknown lower bound, using 1."));
9266 if (*subtype_info
== 'U')
9268 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9269 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9275 strcpy (name_buf
+ prefix_len
, "___U");
9276 U
= get_int_var_value (name_buf
, &ok
);
9279 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9284 if (objfile
== NULL
)
9285 objfile
= TYPE_OBJFILE (base_type
);
9286 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9287 TYPE_NAME (type
) = name
;
9292 /* True iff NAME is the name of a range type. */
9295 ada_is_range_type_name (const char *name
)
9297 return (name
!= NULL
&& strstr (name
, "___XD"));
9303 /* True iff TYPE is an Ada modular type. */
9306 ada_is_modular_type (struct type
*type
)
9308 struct type
*subranged_type
= base_type (type
);
9310 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9311 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9312 && TYPE_UNSIGNED (subranged_type
));
9315 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9318 ada_modulus (struct type
* type
)
9320 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9324 /* Ada exception catchpoint support:
9325 ---------------------------------
9327 We support 3 kinds of exception catchpoints:
9328 . catchpoints on Ada exceptions
9329 . catchpoints on unhandled Ada exceptions
9330 . catchpoints on failed assertions
9332 Exceptions raised during failed assertions, or unhandled exceptions
9333 could perfectly be caught with the general catchpoint on Ada exceptions.
9334 However, we can easily differentiate these two special cases, and having
9335 the option to distinguish these two cases from the rest can be useful
9336 to zero-in on certain situations.
9338 Exception catchpoints are a specialized form of breakpoint,
9339 since they rely on inserting breakpoints inside known routines
9340 of the GNAT runtime. The implementation therefore uses a standard
9341 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9344 Support in the runtime for exception catchpoints have been changed
9345 a few times already, and these changes affect the implementation
9346 of these catchpoints. In order to be able to support several
9347 variants of the runtime, we use a sniffer that will determine
9348 the runtime variant used by the program being debugged.
9350 At this time, we do not support the use of conditions on Ada exception
9351 catchpoints. The COND and COND_STRING fields are therefore set
9352 to NULL (most of the time, see below).
9354 Conditions where EXP_STRING, COND, and COND_STRING are used:
9356 When a user specifies the name of a specific exception in the case
9357 of catchpoints on Ada exceptions, we store the name of that exception
9358 in the EXP_STRING. We then translate this request into an actual
9359 condition stored in COND_STRING, and then parse it into an expression
9362 /* The different types of catchpoints that we introduced for catching
9365 enum exception_catchpoint_kind
9368 ex_catch_exception_unhandled
,
9372 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9374 /* A structure that describes how to support exception catchpoints
9375 for a given executable. */
9377 struct exception_support_info
9379 /* The name of the symbol to break on in order to insert
9380 a catchpoint on exceptions. */
9381 const char *catch_exception_sym
;
9383 /* The name of the symbol to break on in order to insert
9384 a catchpoint on unhandled exceptions. */
9385 const char *catch_exception_unhandled_sym
;
9387 /* The name of the symbol to break on in order to insert
9388 a catchpoint on failed assertions. */
9389 const char *catch_assert_sym
;
9391 /* Assuming that the inferior just triggered an unhandled exception
9392 catchpoint, this function is responsible for returning the address
9393 in inferior memory where the name of that exception is stored.
9394 Return zero if the address could not be computed. */
9395 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9398 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9399 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9401 /* The following exception support info structure describes how to
9402 implement exception catchpoints with the latest version of the
9403 Ada runtime (as of 2007-03-06). */
9405 static const struct exception_support_info default_exception_support_info
=
9407 "__gnat_debug_raise_exception", /* catch_exception_sym */
9408 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9409 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9410 ada_unhandled_exception_name_addr
9413 /* The following exception support info structure describes how to
9414 implement exception catchpoints with a slightly older version
9415 of the Ada runtime. */
9417 static const struct exception_support_info exception_support_info_fallback
=
9419 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9420 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9421 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9422 ada_unhandled_exception_name_addr_from_raise
9425 /* For each executable, we sniff which exception info structure to use
9426 and cache it in the following global variable. */
9428 static const struct exception_support_info
*exception_info
= NULL
;
9430 /* Inspect the Ada runtime and determine which exception info structure
9431 should be used to provide support for exception catchpoints.
9433 This function will always set exception_info, or raise an error. */
9436 ada_exception_support_info_sniffer (void)
9440 /* If the exception info is already known, then no need to recompute it. */
9441 if (exception_info
!= NULL
)
9444 /* Check the latest (default) exception support info. */
9445 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9449 exception_info
= &default_exception_support_info
;
9453 /* Try our fallback exception suport info. */
9454 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9458 exception_info
= &exception_support_info_fallback
;
9462 /* Sometimes, it is normal for us to not be able to find the routine
9463 we are looking for. This happens when the program is linked with
9464 the shared version of the GNAT runtime, and the program has not been
9465 started yet. Inform the user of these two possible causes if
9468 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9469 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9471 /* If the symbol does not exist, then check that the program is
9472 already started, to make sure that shared libraries have been
9473 loaded. If it is not started, this may mean that the symbol is
9474 in a shared library. */
9476 if (ptid_get_pid (inferior_ptid
) == 0)
9477 error (_("Unable to insert catchpoint. Try to start the program first."));
9479 /* At this point, we know that we are debugging an Ada program and
9480 that the inferior has been started, but we still are not able to
9481 find the run-time symbols. That can mean that we are in
9482 configurable run time mode, or that a-except as been optimized
9483 out by the linker... In any case, at this point it is not worth
9484 supporting this feature. */
9486 error (_("Cannot insert catchpoints in this configuration."));
9489 /* An observer of "executable_changed" events.
9490 Its role is to clear certain cached values that need to be recomputed
9491 each time a new executable is loaded by GDB. */
9494 ada_executable_changed_observer (void *unused
)
9496 /* If the executable changed, then it is possible that the Ada runtime
9497 is different. So we need to invalidate the exception support info
9499 exception_info
= NULL
;
9502 /* Return the name of the function at PC, NULL if could not find it.
9503 This function only checks the debugging information, not the symbol
9507 function_name_from_pc (CORE_ADDR pc
)
9511 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9517 /* True iff FRAME is very likely to be that of a function that is
9518 part of the runtime system. This is all very heuristic, but is
9519 intended to be used as advice as to what frames are uninteresting
9523 is_known_support_routine (struct frame_info
*frame
)
9525 struct symtab_and_line sal
;
9529 /* If this code does not have any debugging information (no symtab),
9530 This cannot be any user code. */
9532 find_frame_sal (frame
, &sal
);
9533 if (sal
.symtab
== NULL
)
9536 /* If there is a symtab, but the associated source file cannot be
9537 located, then assume this is not user code: Selecting a frame
9538 for which we cannot display the code would not be very helpful
9539 for the user. This should also take care of case such as VxWorks
9540 where the kernel has some debugging info provided for a few units. */
9542 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9545 /* Check the unit filename againt the Ada runtime file naming.
9546 We also check the name of the objfile against the name of some
9547 known system libraries that sometimes come with debugging info
9550 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9552 re_comp (known_runtime_file_name_patterns
[i
]);
9553 if (re_exec (sal
.symtab
->filename
))
9555 if (sal
.symtab
->objfile
!= NULL
9556 && re_exec (sal
.symtab
->objfile
->name
))
9560 /* Check whether the function is a GNAT-generated entity. */
9562 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9563 if (func_name
== NULL
)
9566 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9568 re_comp (known_auxiliary_function_name_patterns
[i
]);
9569 if (re_exec (func_name
))
9576 /* Find the first frame that contains debugging information and that is not
9577 part of the Ada run-time, starting from FI and moving upward. */
9580 ada_find_printable_frame (struct frame_info
*fi
)
9582 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9584 if (!is_known_support_routine (fi
))
9593 /* Assuming that the inferior just triggered an unhandled exception
9594 catchpoint, return the address in inferior memory where the name
9595 of the exception is stored.
9597 Return zero if the address could not be computed. */
9600 ada_unhandled_exception_name_addr (void)
9602 return parse_and_eval_address ("e.full_name");
9605 /* Same as ada_unhandled_exception_name_addr, except that this function
9606 should be used when the inferior uses an older version of the runtime,
9607 where the exception name needs to be extracted from a specific frame
9608 several frames up in the callstack. */
9611 ada_unhandled_exception_name_addr_from_raise (void)
9614 struct frame_info
*fi
;
9616 /* To determine the name of this exception, we need to select
9617 the frame corresponding to RAISE_SYM_NAME. This frame is
9618 at least 3 levels up, so we simply skip the first 3 frames
9619 without checking the name of their associated function. */
9620 fi
= get_current_frame ();
9621 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9623 fi
= get_prev_frame (fi
);
9627 const char *func_name
=
9628 function_name_from_pc (get_frame_address_in_block (fi
));
9629 if (func_name
!= NULL
9630 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9631 break; /* We found the frame we were looking for... */
9632 fi
= get_prev_frame (fi
);
9639 return parse_and_eval_address ("id.full_name");
9642 /* Assuming the inferior just triggered an Ada exception catchpoint
9643 (of any type), return the address in inferior memory where the name
9644 of the exception is stored, if applicable.
9646 Return zero if the address could not be computed, or if not relevant. */
9649 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9650 struct breakpoint
*b
)
9654 case ex_catch_exception
:
9655 return (parse_and_eval_address ("e.full_name"));
9658 case ex_catch_exception_unhandled
:
9659 return exception_info
->unhandled_exception_name_addr ();
9662 case ex_catch_assert
:
9663 return 0; /* Exception name is not relevant in this case. */
9667 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9671 return 0; /* Should never be reached. */
9674 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9675 any error that ada_exception_name_addr_1 might cause to be thrown.
9676 When an error is intercepted, a warning with the error message is printed,
9677 and zero is returned. */
9680 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9681 struct breakpoint
*b
)
9683 struct gdb_exception e
;
9684 CORE_ADDR result
= 0;
9686 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9688 result
= ada_exception_name_addr_1 (ex
, b
);
9693 warning (_("failed to get exception name: %s"), e
.message
);
9700 /* Implement the PRINT_IT method in the breakpoint_ops structure
9701 for all exception catchpoint kinds. */
9703 static enum print_stop_action
9704 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9706 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9707 char exception_name
[256];
9711 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9712 exception_name
[sizeof (exception_name
) - 1] = '\0';
9715 ada_find_printable_frame (get_current_frame ());
9717 annotate_catchpoint (b
->number
);
9720 case ex_catch_exception
:
9722 printf_filtered (_("\nCatchpoint %d, %s at "),
9723 b
->number
, exception_name
);
9725 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
9727 case ex_catch_exception_unhandled
:
9729 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
9730 b
->number
, exception_name
);
9732 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
9735 case ex_catch_assert
:
9736 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
9741 return PRINT_SRC_AND_LOC
;
9744 /* Implement the PRINT_ONE method in the breakpoint_ops structure
9745 for all exception catchpoint kinds. */
9748 print_one_exception (enum exception_catchpoint_kind ex
,
9749 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9754 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
9758 *last_addr
= b
->loc
->address
;
9761 case ex_catch_exception
:
9762 if (b
->exp_string
!= NULL
)
9764 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
9766 ui_out_field_string (uiout
, "what", msg
);
9770 ui_out_field_string (uiout
, "what", "all Ada exceptions");
9774 case ex_catch_exception_unhandled
:
9775 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
9778 case ex_catch_assert
:
9779 ui_out_field_string (uiout
, "what", "failed Ada assertions");
9783 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9788 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
9789 for all exception catchpoint kinds. */
9792 print_mention_exception (enum exception_catchpoint_kind ex
,
9793 struct breakpoint
*b
)
9797 case ex_catch_exception
:
9798 if (b
->exp_string
!= NULL
)
9799 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
9800 b
->number
, b
->exp_string
);
9802 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
9806 case ex_catch_exception_unhandled
:
9807 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
9811 case ex_catch_assert
:
9812 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
9816 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9821 /* Virtual table for "catch exception" breakpoints. */
9823 static enum print_stop_action
9824 print_it_catch_exception (struct breakpoint
*b
)
9826 return print_it_exception (ex_catch_exception
, b
);
9830 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9832 print_one_exception (ex_catch_exception
, b
, last_addr
);
9836 print_mention_catch_exception (struct breakpoint
*b
)
9838 print_mention_exception (ex_catch_exception
, b
);
9841 static struct breakpoint_ops catch_exception_breakpoint_ops
=
9843 print_it_catch_exception
,
9844 print_one_catch_exception
,
9845 print_mention_catch_exception
9848 /* Virtual table for "catch exception unhandled" breakpoints. */
9850 static enum print_stop_action
9851 print_it_catch_exception_unhandled (struct breakpoint
*b
)
9853 return print_it_exception (ex_catch_exception_unhandled
, b
);
9857 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9859 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
9863 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
9865 print_mention_exception (ex_catch_exception_unhandled
, b
);
9868 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
9869 print_it_catch_exception_unhandled
,
9870 print_one_catch_exception_unhandled
,
9871 print_mention_catch_exception_unhandled
9874 /* Virtual table for "catch assert" breakpoints. */
9876 static enum print_stop_action
9877 print_it_catch_assert (struct breakpoint
*b
)
9879 return print_it_exception (ex_catch_assert
, b
);
9883 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9885 print_one_exception (ex_catch_assert
, b
, last_addr
);
9889 print_mention_catch_assert (struct breakpoint
*b
)
9891 print_mention_exception (ex_catch_assert
, b
);
9894 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
9895 print_it_catch_assert
,
9896 print_one_catch_assert
,
9897 print_mention_catch_assert
9900 /* Return non-zero if B is an Ada exception catchpoint. */
9903 ada_exception_catchpoint_p (struct breakpoint
*b
)
9905 return (b
->ops
== &catch_exception_breakpoint_ops
9906 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
9907 || b
->ops
== &catch_assert_breakpoint_ops
);
9910 /* Return a newly allocated copy of the first space-separated token
9911 in ARGSP, and then adjust ARGSP to point immediately after that
9914 Return NULL if ARGPS does not contain any more tokens. */
9917 ada_get_next_arg (char **argsp
)
9919 char *args
= *argsp
;
9923 /* Skip any leading white space. */
9925 while (isspace (*args
))
9928 if (args
[0] == '\0')
9929 return NULL
; /* No more arguments. */
9931 /* Find the end of the current argument. */
9934 while (*end
!= '\0' && !isspace (*end
))
9937 /* Adjust ARGSP to point to the start of the next argument. */
9941 /* Make a copy of the current argument and return it. */
9943 result
= xmalloc (end
- args
+ 1);
9944 strncpy (result
, args
, end
- args
);
9945 result
[end
- args
] = '\0';
9950 /* Split the arguments specified in a "catch exception" command.
9951 Set EX to the appropriate catchpoint type.
9952 Set EXP_STRING to the name of the specific exception if
9953 specified by the user. */
9956 catch_ada_exception_command_split (char *args
,
9957 enum exception_catchpoint_kind
*ex
,
9960 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
9961 char *exception_name
;
9963 exception_name
= ada_get_next_arg (&args
);
9964 make_cleanup (xfree
, exception_name
);
9966 /* Check that we do not have any more arguments. Anything else
9969 while (isspace (*args
))
9972 if (args
[0] != '\0')
9973 error (_("Junk at end of expression"));
9975 discard_cleanups (old_chain
);
9977 if (exception_name
== NULL
)
9979 /* Catch all exceptions. */
9980 *ex
= ex_catch_exception
;
9983 else if (strcmp (exception_name
, "unhandled") == 0)
9985 /* Catch unhandled exceptions. */
9986 *ex
= ex_catch_exception_unhandled
;
9991 /* Catch a specific exception. */
9992 *ex
= ex_catch_exception
;
9993 *exp_string
= exception_name
;
9997 /* Return the name of the symbol on which we should break in order to
9998 implement a catchpoint of the EX kind. */
10000 static const char *
10001 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10003 gdb_assert (exception_info
!= NULL
);
10007 case ex_catch_exception
:
10008 return (exception_info
->catch_exception_sym
);
10010 case ex_catch_exception_unhandled
:
10011 return (exception_info
->catch_exception_unhandled_sym
);
10013 case ex_catch_assert
:
10014 return (exception_info
->catch_assert_sym
);
10017 internal_error (__FILE__
, __LINE__
,
10018 _("unexpected catchpoint kind (%d)"), ex
);
10022 /* Return the breakpoint ops "virtual table" used for catchpoints
10025 static struct breakpoint_ops
*
10026 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10030 case ex_catch_exception
:
10031 return (&catch_exception_breakpoint_ops
);
10033 case ex_catch_exception_unhandled
:
10034 return (&catch_exception_unhandled_breakpoint_ops
);
10036 case ex_catch_assert
:
10037 return (&catch_assert_breakpoint_ops
);
10040 internal_error (__FILE__
, __LINE__
,
10041 _("unexpected catchpoint kind (%d)"), ex
);
10045 /* Return the condition that will be used to match the current exception
10046 being raised with the exception that the user wants to catch. This
10047 assumes that this condition is used when the inferior just triggered
10048 an exception catchpoint.
10050 The string returned is a newly allocated string that needs to be
10051 deallocated later. */
10054 ada_exception_catchpoint_cond_string (const char *exp_string
)
10056 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10059 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10061 static struct expression
*
10062 ada_parse_catchpoint_condition (char *cond_string
,
10063 struct symtab_and_line sal
)
10065 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10068 /* Return the symtab_and_line that should be used to insert an exception
10069 catchpoint of the TYPE kind.
10071 EX_STRING should contain the name of a specific exception
10072 that the catchpoint should catch, or NULL otherwise.
10074 The idea behind all the remaining parameters is that their names match
10075 the name of certain fields in the breakpoint structure that are used to
10076 handle exception catchpoints. This function returns the value to which
10077 these fields should be set, depending on the type of catchpoint we need
10080 If COND and COND_STRING are both non-NULL, any value they might
10081 hold will be free'ed, and then replaced by newly allocated ones.
10082 These parameters are left untouched otherwise. */
10084 static struct symtab_and_line
10085 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10086 char **addr_string
, char **cond_string
,
10087 struct expression
**cond
, struct breakpoint_ops
**ops
)
10089 const char *sym_name
;
10090 struct symbol
*sym
;
10091 struct symtab_and_line sal
;
10093 /* First, find out which exception support info to use. */
10094 ada_exception_support_info_sniffer ();
10096 /* Then lookup the function on which we will break in order to catch
10097 the Ada exceptions requested by the user. */
10099 sym_name
= ada_exception_sym_name (ex
);
10100 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10102 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10103 that should be compiled with debugging information. As a result, we
10104 expect to find that symbol in the symtabs. If we don't find it, then
10105 the target most likely does not support Ada exceptions, or we cannot
10106 insert exception breakpoints yet, because the GNAT runtime hasn't been
10109 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10110 in such a way that no debugging information is produced for the symbol
10111 we are looking for. In this case, we could search the minimal symbols
10112 as a fall-back mechanism. This would still be operating in degraded
10113 mode, however, as we would still be missing the debugging information
10114 that is needed in order to extract the name of the exception being
10115 raised (this name is printed in the catchpoint message, and is also
10116 used when trying to catch a specific exception). We do not handle
10117 this case for now. */
10120 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10122 /* Make sure that the symbol we found corresponds to a function. */
10123 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10124 error (_("Symbol \"%s\" is not a function (class = %d)"),
10125 sym_name
, SYMBOL_CLASS (sym
));
10127 sal
= find_function_start_sal (sym
, 1);
10129 /* Set ADDR_STRING. */
10131 *addr_string
= xstrdup (sym_name
);
10133 /* Set the COND and COND_STRING (if not NULL). */
10135 if (cond_string
!= NULL
&& cond
!= NULL
)
10137 if (*cond_string
!= NULL
)
10139 xfree (*cond_string
);
10140 *cond_string
= NULL
;
10147 if (exp_string
!= NULL
)
10149 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10150 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10155 *ops
= ada_exception_breakpoint_ops (ex
);
10160 /* Parse the arguments (ARGS) of the "catch exception" command.
10162 Set TYPE to the appropriate exception catchpoint type.
10163 If the user asked the catchpoint to catch only a specific
10164 exception, then save the exception name in ADDR_STRING.
10166 See ada_exception_sal for a description of all the remaining
10167 function arguments of this function. */
10169 struct symtab_and_line
10170 ada_decode_exception_location (char *args
, char **addr_string
,
10171 char **exp_string
, char **cond_string
,
10172 struct expression
**cond
,
10173 struct breakpoint_ops
**ops
)
10175 enum exception_catchpoint_kind ex
;
10177 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10178 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10182 struct symtab_and_line
10183 ada_decode_assert_location (char *args
, char **addr_string
,
10184 struct breakpoint_ops
**ops
)
10186 /* Check that no argument where provided at the end of the command. */
10190 while (isspace (*args
))
10193 error (_("Junk at end of arguments."));
10196 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10201 /* Information about operators given special treatment in functions
10203 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10205 #define ADA_OPERATORS \
10206 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10207 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10208 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10209 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10210 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10211 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10212 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10213 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10214 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10215 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10216 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10217 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10218 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10219 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10220 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10221 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10222 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10223 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10224 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10227 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10229 switch (exp
->elts
[pc
- 1].opcode
)
10232 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10235 #define OP_DEFN(op, len, args, binop) \
10236 case op: *oplenp = len; *argsp = args; break;
10242 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10247 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10253 ada_op_name (enum exp_opcode opcode
)
10258 return op_name_standard (opcode
);
10260 #define OP_DEFN(op, len, args, binop) case op: return #op;
10265 return "OP_AGGREGATE";
10267 return "OP_CHOICES";
10273 /* As for operator_length, but assumes PC is pointing at the first
10274 element of the operator, and gives meaningful results only for the
10275 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10278 ada_forward_operator_length (struct expression
*exp
, int pc
,
10279 int *oplenp
, int *argsp
)
10281 switch (exp
->elts
[pc
].opcode
)
10284 *oplenp
= *argsp
= 0;
10287 #define OP_DEFN(op, len, args, binop) \
10288 case op: *oplenp = len; *argsp = args; break;
10294 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10299 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10305 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10306 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10314 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10316 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10321 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10325 /* Ada attributes ('Foo). */
10328 case OP_ATR_LENGTH
:
10332 case OP_ATR_MODULUS
:
10339 case UNOP_IN_RANGE
:
10341 /* XXX: gdb_sprint_host_address, type_sprint */
10342 fprintf_filtered (stream
, _("Type @"));
10343 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10344 fprintf_filtered (stream
, " (");
10345 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10346 fprintf_filtered (stream
, ")");
10348 case BINOP_IN_BOUNDS
:
10349 fprintf_filtered (stream
, " (%d)",
10350 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10352 case TERNOP_IN_RANGE
:
10357 case OP_DISCRETE_RANGE
:
10358 case OP_POSITIONAL
:
10365 char *name
= &exp
->elts
[elt
+ 2].string
;
10366 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10367 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10372 return dump_subexp_body_standard (exp
, stream
, elt
);
10376 for (i
= 0; i
< nargs
; i
+= 1)
10377 elt
= dump_subexp (exp
, stream
, elt
);
10382 /* The Ada extension of print_subexp (q.v.). */
10385 ada_print_subexp (struct expression
*exp
, int *pos
,
10386 struct ui_file
*stream
, enum precedence prec
)
10388 int oplen
, nargs
, i
;
10390 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10392 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10399 print_subexp_standard (exp
, pos
, stream
, prec
);
10403 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10406 case BINOP_IN_BOUNDS
:
10407 /* XXX: sprint_subexp */
10408 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10409 fputs_filtered (" in ", stream
);
10410 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10411 fputs_filtered ("'range", stream
);
10412 if (exp
->elts
[pc
+ 1].longconst
> 1)
10413 fprintf_filtered (stream
, "(%ld)",
10414 (long) exp
->elts
[pc
+ 1].longconst
);
10417 case TERNOP_IN_RANGE
:
10418 if (prec
>= PREC_EQUAL
)
10419 fputs_filtered ("(", stream
);
10420 /* XXX: sprint_subexp */
10421 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10422 fputs_filtered (" in ", stream
);
10423 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10424 fputs_filtered (" .. ", stream
);
10425 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10426 if (prec
>= PREC_EQUAL
)
10427 fputs_filtered (")", stream
);
10432 case OP_ATR_LENGTH
:
10436 case OP_ATR_MODULUS
:
10441 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10443 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10444 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10448 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10449 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10453 for (tem
= 1; tem
< nargs
; tem
+= 1)
10455 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10456 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10458 fputs_filtered (")", stream
);
10463 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10464 fputs_filtered ("'(", stream
);
10465 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10466 fputs_filtered (")", stream
);
10469 case UNOP_IN_RANGE
:
10470 /* XXX: sprint_subexp */
10471 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10472 fputs_filtered (" in ", stream
);
10473 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10476 case OP_DISCRETE_RANGE
:
10477 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10478 fputs_filtered ("..", stream
);
10479 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10483 fputs_filtered ("others => ", stream
);
10484 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10488 for (i
= 0; i
< nargs
-1; i
+= 1)
10491 fputs_filtered ("|", stream
);
10492 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10494 fputs_filtered (" => ", stream
);
10495 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10498 case OP_POSITIONAL
:
10499 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10503 fputs_filtered ("(", stream
);
10504 for (i
= 0; i
< nargs
; i
+= 1)
10507 fputs_filtered (", ", stream
);
10508 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10510 fputs_filtered (")", stream
);
10515 /* Table mapping opcodes into strings for printing operators
10516 and precedences of the operators. */
10518 static const struct op_print ada_op_print_tab
[] = {
10519 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10520 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10521 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10522 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10523 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10524 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10525 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10526 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10527 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10528 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10529 {">", BINOP_GTR
, PREC_ORDER
, 0},
10530 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10531 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10532 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10533 {"+", BINOP_ADD
, PREC_ADD
, 0},
10534 {"-", BINOP_SUB
, PREC_ADD
, 0},
10535 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10536 {"*", BINOP_MUL
, PREC_MUL
, 0},
10537 {"/", BINOP_DIV
, PREC_MUL
, 0},
10538 {"rem", BINOP_REM
, PREC_MUL
, 0},
10539 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10540 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10541 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10542 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10543 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10544 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10545 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10546 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10547 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10548 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10549 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10553 enum ada_primitive_types
{
10554 ada_primitive_type_int
,
10555 ada_primitive_type_long
,
10556 ada_primitive_type_short
,
10557 ada_primitive_type_char
,
10558 ada_primitive_type_float
,
10559 ada_primitive_type_double
,
10560 ada_primitive_type_void
,
10561 ada_primitive_type_long_long
,
10562 ada_primitive_type_long_double
,
10563 ada_primitive_type_natural
,
10564 ada_primitive_type_positive
,
10565 ada_primitive_type_system_address
,
10566 nr_ada_primitive_types
10570 ada_language_arch_info (struct gdbarch
*gdbarch
,
10571 struct language_arch_info
*lai
)
10573 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10574 lai
->primitive_type_vector
10575 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10577 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10578 init_type (TYPE_CODE_INT
,
10579 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10580 0, "integer", (struct objfile
*) NULL
);
10581 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10582 init_type (TYPE_CODE_INT
,
10583 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10584 0, "long_integer", (struct objfile
*) NULL
);
10585 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10586 init_type (TYPE_CODE_INT
,
10587 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10588 0, "short_integer", (struct objfile
*) NULL
);
10589 lai
->string_char_type
=
10590 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10591 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10592 0, "character", (struct objfile
*) NULL
);
10593 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10594 init_type (TYPE_CODE_FLT
,
10595 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10596 0, "float", (struct objfile
*) NULL
);
10597 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10598 init_type (TYPE_CODE_FLT
,
10599 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10600 0, "long_float", (struct objfile
*) NULL
);
10601 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10602 init_type (TYPE_CODE_INT
,
10603 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10604 0, "long_long_integer", (struct objfile
*) NULL
);
10605 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10606 init_type (TYPE_CODE_FLT
,
10607 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10608 0, "long_long_float", (struct objfile
*) NULL
);
10609 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10610 init_type (TYPE_CODE_INT
,
10611 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10612 0, "natural", (struct objfile
*) NULL
);
10613 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10614 init_type (TYPE_CODE_INT
,
10615 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10616 0, "positive", (struct objfile
*) NULL
);
10617 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10619 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10620 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10621 (struct objfile
*) NULL
));
10622 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10623 = "system__address";
10626 /* Language vector */
10628 /* Not really used, but needed in the ada_language_defn. */
10631 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10633 ada_emit_char (c
, stream
, quoter
, 1);
10639 warnings_issued
= 0;
10640 return ada_parse ();
10643 static const struct exp_descriptor ada_exp_descriptor
= {
10645 ada_operator_length
,
10647 ada_dump_subexp_body
,
10648 ada_evaluate_subexp
10651 const struct language_defn ada_language_defn
= {
10652 "ada", /* Language name */
10656 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10657 that's not quite what this means. */
10659 &ada_exp_descriptor
,
10663 ada_printchar
, /* Print a character constant */
10664 ada_printstr
, /* Function to print string constant */
10665 emit_char
, /* Function to print single char (not used) */
10666 ada_print_type
, /* Print a type using appropriate syntax */
10667 ada_val_print
, /* Print a value using appropriate syntax */
10668 ada_value_print
, /* Print a top-level value */
10669 NULL
, /* Language specific skip_trampoline */
10670 NULL
, /* value_of_this */
10671 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10672 basic_lookup_transparent_type
, /* lookup_transparent_type */
10673 ada_la_decode
, /* Language specific symbol demangler */
10674 NULL
, /* Language specific class_name_from_physname */
10675 ada_op_print_tab
, /* expression operators for printing */
10676 0, /* c-style arrays */
10677 1, /* String lower bound */
10678 ada_get_gdb_completer_word_break_characters
,
10679 ada_language_arch_info
,
10680 ada_print_array_index
,
10681 default_pass_by_reference
,
10686 _initialize_ada_language (void)
10688 add_language (&ada_language_defn
);
10690 varsize_limit
= 65536;
10692 obstack_init (&symbol_list_obstack
);
10694 decoded_names_store
= htab_create_alloc
10695 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10696 NULL
, xcalloc
, xfree
);
10698 observer_attach_executable_changed (ada_executable_changed_observer
);