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 const char *raw_name
= ada_type_name (ada_check_typedef (type
));
1813 char *name
= (char *) alloca (strlen (raw_name
) + 1);
1814 char *tail
= strstr (raw_name
, "___XP");
1815 struct type
*shadow_type
;
1819 type
= desc_base_type (type
);
1821 memcpy (name
, raw_name
, tail
- raw_name
);
1822 name
[tail
- raw_name
] = '\000';
1824 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1825 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1827 lim_warning (_("could not find bounds information on packed array"));
1830 shadow_type
= SYMBOL_TYPE (sym
);
1832 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1834 lim_warning (_("could not understand bounds information on packed array"));
1838 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1841 (_("could not understand bit size information on packed array"));
1845 return packed_array_type (shadow_type
, &bits
);
1848 /* Given that ARR is a struct value *indicating a GNAT packed array,
1849 returns a simple array that denotes that array. Its type is a
1850 standard GDB array type except that the BITSIZEs of the array
1851 target types are set to the number of bits in each element, and the
1852 type length is set appropriately. */
1854 static struct value
*
1855 decode_packed_array (struct value
*arr
)
1859 arr
= ada_coerce_ref (arr
);
1860 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1861 arr
= ada_value_ind (arr
);
1863 type
= decode_packed_array_type (value_type (arr
));
1866 error (_("can't unpack array"));
1870 if (BITS_BIG_ENDIAN
&& ada_is_modular_type (value_type (arr
)))
1872 /* This is a (right-justified) modular type representing a packed
1873 array with no wrapper. In order to interpret the value through
1874 the (left-justified) packed array type we just built, we must
1875 first left-justify it. */
1876 int bit_size
, bit_pos
;
1879 mod
= ada_modulus (value_type (arr
)) - 1;
1886 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1887 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1888 bit_pos
/ HOST_CHAR_BIT
,
1889 bit_pos
% HOST_CHAR_BIT
,
1894 return coerce_unspec_val_to_type (arr
, type
);
1898 /* The value of the element of packed array ARR at the ARITY indices
1899 given in IND. ARR must be a simple array. */
1901 static struct value
*
1902 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1905 int bits
, elt_off
, bit_off
;
1906 long elt_total_bit_offset
;
1907 struct type
*elt_type
;
1911 elt_total_bit_offset
= 0;
1912 elt_type
= ada_check_typedef (value_type (arr
));
1913 for (i
= 0; i
< arity
; i
+= 1)
1915 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1916 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1918 (_("attempt to do packed indexing of something other than a packed array"));
1921 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1922 LONGEST lowerbound
, upperbound
;
1925 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1927 lim_warning (_("don't know bounds of array"));
1928 lowerbound
= upperbound
= 0;
1931 idx
= value_as_long (value_pos_atr (ind
[i
]));
1932 if (idx
< lowerbound
|| idx
> upperbound
)
1933 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1934 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1935 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1936 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1939 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1940 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1942 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1947 /* Non-zero iff TYPE includes negative integer values. */
1950 has_negatives (struct type
*type
)
1952 switch (TYPE_CODE (type
))
1957 return !TYPE_UNSIGNED (type
);
1958 case TYPE_CODE_RANGE
:
1959 return TYPE_LOW_BOUND (type
) < 0;
1964 /* Create a new value of type TYPE from the contents of OBJ starting
1965 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1966 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1967 assigning through the result will set the field fetched from.
1968 VALADDR is ignored unless OBJ is NULL, in which case,
1969 VALADDR+OFFSET must address the start of storage containing the
1970 packed value. The value returned in this case is never an lval.
1971 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1974 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1975 long offset
, int bit_offset
, int bit_size
,
1979 int src
, /* Index into the source area */
1980 targ
, /* Index into the target area */
1981 srcBitsLeft
, /* Number of source bits left to move */
1982 nsrc
, ntarg
, /* Number of source and target bytes */
1983 unusedLS
, /* Number of bits in next significant
1984 byte of source that are unused */
1985 accumSize
; /* Number of meaningful bits in accum */
1986 unsigned char *bytes
; /* First byte containing data to unpack */
1987 unsigned char *unpacked
;
1988 unsigned long accum
; /* Staging area for bits being transferred */
1990 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1991 /* Transmit bytes from least to most significant; delta is the direction
1992 the indices move. */
1993 int delta
= BITS_BIG_ENDIAN
? -1 : 1;
1995 type
= ada_check_typedef (type
);
1999 v
= allocate_value (type
);
2000 bytes
= (unsigned char *) (valaddr
+ offset
);
2002 else if (value_lazy (obj
))
2005 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
2006 bytes
= (unsigned char *) alloca (len
);
2007 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
2011 v
= allocate_value (type
);
2012 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2017 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
2018 if (VALUE_LVAL (obj
) == lval_internalvar
)
2019 VALUE_LVAL (v
) = lval_internalvar_component
;
2020 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
2021 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2022 set_value_bitsize (v
, bit_size
);
2023 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2025 VALUE_ADDRESS (v
) += 1;
2026 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2030 set_value_bitsize (v
, bit_size
);
2031 unpacked
= (unsigned char *) value_contents (v
);
2033 srcBitsLeft
= bit_size
;
2035 ntarg
= TYPE_LENGTH (type
);
2039 memset (unpacked
, 0, TYPE_LENGTH (type
));
2042 else if (BITS_BIG_ENDIAN
)
2045 if (has_negatives (type
)
2046 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2050 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2053 switch (TYPE_CODE (type
))
2055 case TYPE_CODE_ARRAY
:
2056 case TYPE_CODE_UNION
:
2057 case TYPE_CODE_STRUCT
:
2058 /* Non-scalar values must be aligned at a byte boundary... */
2060 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2061 /* ... And are placed at the beginning (most-significant) bytes
2063 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2067 targ
= TYPE_LENGTH (type
) - 1;
2073 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2076 unusedLS
= bit_offset
;
2079 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2086 /* Mask for removing bits of the next source byte that are not
2087 part of the value. */
2088 unsigned int unusedMSMask
=
2089 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2091 /* Sign-extend bits for this byte. */
2092 unsigned int signMask
= sign
& ~unusedMSMask
;
2094 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2095 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2096 if (accumSize
>= HOST_CHAR_BIT
)
2098 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2099 accumSize
-= HOST_CHAR_BIT
;
2100 accum
>>= HOST_CHAR_BIT
;
2104 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2111 accum
|= sign
<< accumSize
;
2112 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2113 accumSize
-= HOST_CHAR_BIT
;
2114 accum
>>= HOST_CHAR_BIT
;
2122 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2123 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2126 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2127 int src_offset
, int n
)
2129 unsigned int accum
, mask
;
2130 int accum_bits
, chunk_size
;
2132 target
+= targ_offset
/ HOST_CHAR_BIT
;
2133 targ_offset
%= HOST_CHAR_BIT
;
2134 source
+= src_offset
/ HOST_CHAR_BIT
;
2135 src_offset
%= HOST_CHAR_BIT
;
2136 if (BITS_BIG_ENDIAN
)
2138 accum
= (unsigned char) *source
;
2140 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2145 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2146 accum_bits
+= HOST_CHAR_BIT
;
2148 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2151 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2152 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2155 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2157 accum_bits
-= chunk_size
;
2164 accum
= (unsigned char) *source
>> src_offset
;
2166 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2170 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2171 accum_bits
+= HOST_CHAR_BIT
;
2173 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2176 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2177 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2179 accum_bits
-= chunk_size
;
2180 accum
>>= chunk_size
;
2187 /* Store the contents of FROMVAL into the location of TOVAL.
2188 Return a new value with the location of TOVAL and contents of
2189 FROMVAL. Handles assignment into packed fields that have
2190 floating-point or non-scalar types. */
2192 static struct value
*
2193 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2195 struct type
*type
= value_type (toval
);
2196 int bits
= value_bitsize (toval
);
2198 toval
= ada_coerce_ref (toval
);
2199 fromval
= ada_coerce_ref (fromval
);
2201 if (ada_is_direct_array_type (value_type (toval
)))
2202 toval
= ada_coerce_to_simple_array (toval
);
2203 if (ada_is_direct_array_type (value_type (fromval
)))
2204 fromval
= ada_coerce_to_simple_array (fromval
);
2206 if (!deprecated_value_modifiable (toval
))
2207 error (_("Left operand of assignment is not a modifiable lvalue."));
2209 if (VALUE_LVAL (toval
) == lval_memory
2211 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2212 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2214 int len
= (value_bitpos (toval
)
2215 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2216 char *buffer
= (char *) alloca (len
);
2218 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2220 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2221 fromval
= value_cast (type
, fromval
);
2223 read_memory (to_addr
, buffer
, len
);
2224 if (BITS_BIG_ENDIAN
)
2225 move_bits (buffer
, value_bitpos (toval
),
2226 value_contents (fromval
),
2227 TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
-
2230 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2232 write_memory (to_addr
, buffer
, len
);
2233 if (deprecated_memory_changed_hook
)
2234 deprecated_memory_changed_hook (to_addr
, len
);
2236 val
= value_copy (toval
);
2237 memcpy (value_contents_raw (val
), value_contents (fromval
),
2238 TYPE_LENGTH (type
));
2239 deprecated_set_value_type (val
, type
);
2244 return value_assign (toval
, fromval
);
2248 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2249 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2250 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2251 * COMPONENT, and not the inferior's memory. The current contents
2252 * of COMPONENT are ignored. */
2254 value_assign_to_component (struct value
*container
, struct value
*component
,
2257 LONGEST offset_in_container
=
2258 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2259 - VALUE_ADDRESS (container
) - value_offset (container
));
2260 int bit_offset_in_container
=
2261 value_bitpos (component
) - value_bitpos (container
);
2264 val
= value_cast (value_type (component
), val
);
2266 if (value_bitsize (component
) == 0)
2267 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2269 bits
= value_bitsize (component
);
2271 if (BITS_BIG_ENDIAN
)
2272 move_bits (value_contents_writeable (container
) + offset_in_container
,
2273 value_bitpos (container
) + bit_offset_in_container
,
2274 value_contents (val
),
2275 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2278 move_bits (value_contents_writeable (container
) + offset_in_container
,
2279 value_bitpos (container
) + bit_offset_in_container
,
2280 value_contents (val
), 0, bits
);
2283 /* The value of the element of array ARR at the ARITY indices given in IND.
2284 ARR may be either a simple array, GNAT array descriptor, or pointer
2288 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2292 struct type
*elt_type
;
2294 elt
= ada_coerce_to_simple_array (arr
);
2296 elt_type
= ada_check_typedef (value_type (elt
));
2297 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2298 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2299 return value_subscript_packed (elt
, arity
, ind
);
2301 for (k
= 0; k
< arity
; k
+= 1)
2303 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2304 error (_("too many subscripts (%d expected)"), k
);
2305 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2310 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2311 value of the element of *ARR at the ARITY indices given in
2312 IND. Does not read the entire array into memory. */
2315 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2320 for (k
= 0; k
< arity
; k
+= 1)
2325 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2326 error (_("too many subscripts (%d expected)"), k
);
2327 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2329 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2330 idx
= value_pos_atr (ind
[k
]);
2332 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2333 arr
= value_add (arr
, idx
);
2334 type
= TYPE_TARGET_TYPE (type
);
2337 return value_ind (arr
);
2340 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2341 actual type of ARRAY_PTR is ignored), returns a reference to
2342 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2343 bound of this array is LOW, as per Ada rules. */
2344 static struct value
*
2345 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2348 CORE_ADDR base
= value_as_address (array_ptr
)
2349 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2350 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2351 struct type
*index_type
=
2352 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2354 struct type
*slice_type
=
2355 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2356 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2360 static struct value
*
2361 ada_value_slice (struct value
*array
, int low
, int high
)
2363 struct type
*type
= value_type (array
);
2364 struct type
*index_type
=
2365 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2366 struct type
*slice_type
=
2367 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2368 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2371 /* If type is a record type in the form of a standard GNAT array
2372 descriptor, returns the number of dimensions for type. If arr is a
2373 simple array, returns the number of "array of"s that prefix its
2374 type designation. Otherwise, returns 0. */
2377 ada_array_arity (struct type
*type
)
2384 type
= desc_base_type (type
);
2387 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2388 return desc_arity (desc_bounds_type (type
));
2390 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2393 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2399 /* If TYPE is a record type in the form of a standard GNAT array
2400 descriptor or a simple array type, returns the element type for
2401 TYPE after indexing by NINDICES indices, or by all indices if
2402 NINDICES is -1. Otherwise, returns NULL. */
2405 ada_array_element_type (struct type
*type
, int nindices
)
2407 type
= desc_base_type (type
);
2409 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2412 struct type
*p_array_type
;
2414 p_array_type
= desc_data_type (type
);
2416 k
= ada_array_arity (type
);
2420 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2421 if (nindices
>= 0 && k
> nindices
)
2423 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2424 while (k
> 0 && p_array_type
!= NULL
)
2426 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2429 return p_array_type
;
2431 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2433 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2435 type
= TYPE_TARGET_TYPE (type
);
2444 /* The type of nth index in arrays of given type (n numbering from 1).
2445 Does not examine memory. */
2448 ada_index_type (struct type
*type
, int n
)
2450 struct type
*result_type
;
2452 type
= desc_base_type (type
);
2454 if (n
> ada_array_arity (type
))
2457 if (ada_is_simple_array_type (type
))
2461 for (i
= 1; i
< n
; i
+= 1)
2462 type
= TYPE_TARGET_TYPE (type
);
2463 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2464 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2465 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2466 perhaps stabsread.c would make more sense. */
2467 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2468 result_type
= builtin_type_int
;
2473 return desc_index_type (desc_bounds_type (type
), n
);
2476 /* Given that arr is an array type, returns the lower bound of the
2477 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2478 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2479 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2480 bounds type. It works for other arrays with bounds supplied by
2481 run-time quantities other than discriminants. */
2484 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2485 struct type
** typep
)
2488 struct type
*index_type_desc
;
2490 if (ada_is_packed_array_type (arr_type
))
2491 arr_type
= decode_packed_array_type (arr_type
);
2493 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2496 *typep
= builtin_type_int
;
2497 return (LONGEST
) - which
;
2500 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2501 type
= TYPE_TARGET_TYPE (arr_type
);
2505 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2506 if (index_type_desc
== NULL
)
2508 struct type
*index_type
;
2512 type
= TYPE_TARGET_TYPE (type
);
2516 index_type
= TYPE_INDEX_TYPE (type
);
2518 *typep
= index_type
;
2520 /* The index type is either a range type or an enumerated type.
2521 For the range type, we have some macros that allow us to
2522 extract the value of the low and high bounds. But they
2523 do now work for enumerated types. The expressions used
2524 below work for both range and enum types. */
2526 (LONGEST
) (which
== 0
2527 ? TYPE_FIELD_BITPOS (index_type
, 0)
2528 : TYPE_FIELD_BITPOS (index_type
,
2529 TYPE_NFIELDS (index_type
) - 1));
2533 struct type
*index_type
=
2534 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2535 NULL
, TYPE_OBJFILE (arr_type
));
2538 *typep
= index_type
;
2541 (LONGEST
) (which
== 0
2542 ? TYPE_LOW_BOUND (index_type
)
2543 : TYPE_HIGH_BOUND (index_type
));
2547 /* Given that arr is an array value, returns the lower bound of the
2548 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2549 WHICH is 1. This routine will also work for arrays with bounds
2550 supplied by run-time quantities other than discriminants. */
2553 ada_array_bound (struct value
*arr
, int n
, int which
)
2555 struct type
*arr_type
= value_type (arr
);
2557 if (ada_is_packed_array_type (arr_type
))
2558 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2559 else if (ada_is_simple_array_type (arr_type
))
2562 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2563 return value_from_longest (type
, v
);
2566 return desc_one_bound (desc_bounds (arr
), n
, which
);
2569 /* Given that arr is an array value, returns the length of the
2570 nth index. This routine will also work for arrays with bounds
2571 supplied by run-time quantities other than discriminants.
2572 Does not work for arrays indexed by enumeration types with representation
2573 clauses at the moment. */
2576 ada_array_length (struct value
*arr
, int n
)
2578 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2580 if (ada_is_packed_array_type (arr_type
))
2581 return ada_array_length (decode_packed_array (arr
), n
);
2583 if (ada_is_simple_array_type (arr_type
))
2587 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2588 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2589 return value_from_longest (type
, v
);
2593 value_from_longest (builtin_type_int
,
2594 value_as_long (desc_one_bound (desc_bounds (arr
),
2596 - value_as_long (desc_one_bound (desc_bounds (arr
),
2600 /* An empty array whose type is that of ARR_TYPE (an array type),
2601 with bounds LOW to LOW-1. */
2603 static struct value
*
2604 empty_array (struct type
*arr_type
, int low
)
2606 struct type
*index_type
=
2607 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2609 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2610 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2614 /* Name resolution */
2616 /* The "decoded" name for the user-definable Ada operator corresponding
2620 ada_decoded_op_name (enum exp_opcode op
)
2624 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2626 if (ada_opname_table
[i
].op
== op
)
2627 return ada_opname_table
[i
].decoded
;
2629 error (_("Could not find operator name for opcode"));
2633 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2634 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2635 undefined namespace) and converts operators that are
2636 user-defined into appropriate function calls. If CONTEXT_TYPE is
2637 non-null, it provides a preferred result type [at the moment, only
2638 type void has any effect---causing procedures to be preferred over
2639 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2640 return type is preferred. May change (expand) *EXP. */
2643 resolve (struct expression
**expp
, int void_context_p
)
2647 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2650 /* Resolve the operator of the subexpression beginning at
2651 position *POS of *EXPP. "Resolving" consists of replacing
2652 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2653 with their resolutions, replacing built-in operators with
2654 function calls to user-defined operators, where appropriate, and,
2655 when DEPROCEDURE_P is non-zero, converting function-valued variables
2656 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2657 are as in ada_resolve, above. */
2659 static struct value
*
2660 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2661 struct type
*context_type
)
2665 struct expression
*exp
; /* Convenience: == *expp. */
2666 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2667 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2668 int nargs
; /* Number of operands. */
2675 /* Pass one: resolve operands, saving their types and updating *pos,
2680 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2681 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2686 resolve_subexp (expp
, pos
, 0, NULL
);
2688 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2693 resolve_subexp (expp
, pos
, 0, NULL
);
2698 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2701 case OP_ATR_MODULUS
:
2711 case TERNOP_IN_RANGE
:
2712 case BINOP_IN_BOUNDS
:
2718 case OP_DISCRETE_RANGE
:
2720 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2729 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2731 resolve_subexp (expp
, pos
, 1, NULL
);
2733 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2750 case BINOP_LOGICAL_AND
:
2751 case BINOP_LOGICAL_OR
:
2752 case BINOP_BITWISE_AND
:
2753 case BINOP_BITWISE_IOR
:
2754 case BINOP_BITWISE_XOR
:
2757 case BINOP_NOTEQUAL
:
2764 case BINOP_SUBSCRIPT
:
2772 case UNOP_LOGICAL_NOT
:
2788 case OP_INTERNALVAR
:
2798 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2801 case STRUCTOP_STRUCT
:
2802 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2815 error (_("Unexpected operator during name resolution"));
2818 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2819 for (i
= 0; i
< nargs
; i
+= 1)
2820 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2824 /* Pass two: perform any resolution on principal operator. */
2831 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2833 struct ada_symbol_info
*candidates
;
2837 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2838 (exp
->elts
[pc
+ 2].symbol
),
2839 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2842 if (n_candidates
> 1)
2844 /* Types tend to get re-introduced locally, so if there
2845 are any local symbols that are not types, first filter
2848 for (j
= 0; j
< n_candidates
; j
+= 1)
2849 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2855 case LOC_REGPARM_ADDR
:
2859 case LOC_BASEREG_ARG
:
2861 case LOC_COMPUTED_ARG
:
2867 if (j
< n_candidates
)
2870 while (j
< n_candidates
)
2872 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2874 candidates
[j
] = candidates
[n_candidates
- 1];
2883 if (n_candidates
== 0)
2884 error (_("No definition found for %s"),
2885 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2886 else if (n_candidates
== 1)
2888 else if (deprocedure_p
2889 && !is_nonfunction (candidates
, n_candidates
))
2891 i
= ada_resolve_function
2892 (candidates
, n_candidates
, NULL
, 0,
2893 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2896 error (_("Could not find a match for %s"),
2897 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2901 printf_filtered (_("Multiple matches for %s\n"),
2902 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2903 user_select_syms (candidates
, n_candidates
, 1);
2907 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2908 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2909 if (innermost_block
== NULL
2910 || contained_in (candidates
[i
].block
, innermost_block
))
2911 innermost_block
= candidates
[i
].block
;
2915 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2918 replace_operator_with_call (expp
, pc
, 0, 0,
2919 exp
->elts
[pc
+ 2].symbol
,
2920 exp
->elts
[pc
+ 1].block
);
2927 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2928 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2930 struct ada_symbol_info
*candidates
;
2934 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2935 (exp
->elts
[pc
+ 5].symbol
),
2936 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2938 if (n_candidates
== 1)
2942 i
= ada_resolve_function
2943 (candidates
, n_candidates
,
2945 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2948 error (_("Could not find a match for %s"),
2949 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2952 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2953 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2954 if (innermost_block
== NULL
2955 || contained_in (candidates
[i
].block
, innermost_block
))
2956 innermost_block
= candidates
[i
].block
;
2967 case BINOP_BITWISE_AND
:
2968 case BINOP_BITWISE_IOR
:
2969 case BINOP_BITWISE_XOR
:
2971 case BINOP_NOTEQUAL
:
2979 case UNOP_LOGICAL_NOT
:
2981 if (possible_user_operator_p (op
, argvec
))
2983 struct ada_symbol_info
*candidates
;
2987 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2988 (struct block
*) NULL
, VAR_DOMAIN
,
2990 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2991 ada_decoded_op_name (op
), NULL
);
2995 replace_operator_with_call (expp
, pc
, nargs
, 1,
2996 candidates
[i
].sym
, candidates
[i
].block
);
3007 return evaluate_subexp_type (exp
, pos
);
3010 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3011 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3012 a non-pointer. A type of 'void' (which is never a valid expression type)
3013 by convention matches anything. */
3014 /* The term "match" here is rather loose. The match is heuristic and
3015 liberal. FIXME: TOO liberal, in fact. */
3018 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3020 ftype
= ada_check_typedef (ftype
);
3021 atype
= ada_check_typedef (atype
);
3023 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3024 ftype
= TYPE_TARGET_TYPE (ftype
);
3025 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3026 atype
= TYPE_TARGET_TYPE (atype
);
3028 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3029 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3032 switch (TYPE_CODE (ftype
))
3037 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3038 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3039 TYPE_TARGET_TYPE (atype
), 0);
3042 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3044 case TYPE_CODE_ENUM
:
3045 case TYPE_CODE_RANGE
:
3046 switch (TYPE_CODE (atype
))
3049 case TYPE_CODE_ENUM
:
3050 case TYPE_CODE_RANGE
:
3056 case TYPE_CODE_ARRAY
:
3057 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3058 || ada_is_array_descriptor_type (atype
));
3060 case TYPE_CODE_STRUCT
:
3061 if (ada_is_array_descriptor_type (ftype
))
3062 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3063 || ada_is_array_descriptor_type (atype
));
3065 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3066 && !ada_is_array_descriptor_type (atype
));
3068 case TYPE_CODE_UNION
:
3070 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3074 /* Return non-zero if the formals of FUNC "sufficiently match" the
3075 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3076 may also be an enumeral, in which case it is treated as a 0-
3077 argument function. */
3080 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3083 struct type
*func_type
= SYMBOL_TYPE (func
);
3085 if (SYMBOL_CLASS (func
) == LOC_CONST
3086 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3087 return (n_actuals
== 0);
3088 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3091 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3094 for (i
= 0; i
< n_actuals
; i
+= 1)
3096 if (actuals
[i
] == NULL
)
3100 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3101 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3103 if (!ada_type_match (ftype
, atype
, 1))
3110 /* False iff function type FUNC_TYPE definitely does not produce a value
3111 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3112 FUNC_TYPE is not a valid function type with a non-null return type
3113 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3116 return_match (struct type
*func_type
, struct type
*context_type
)
3118 struct type
*return_type
;
3120 if (func_type
== NULL
)
3123 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3124 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3126 return_type
= base_type (func_type
);
3127 if (return_type
== NULL
)
3130 context_type
= base_type (context_type
);
3132 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3133 return context_type
== NULL
|| return_type
== context_type
;
3134 else if (context_type
== NULL
)
3135 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3137 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3141 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3142 function (if any) that matches the types of the NARGS arguments in
3143 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3144 that returns that type, then eliminate matches that don't. If
3145 CONTEXT_TYPE is void and there is at least one match that does not
3146 return void, eliminate all matches that do.
3148 Asks the user if there is more than one match remaining. Returns -1
3149 if there is no such symbol or none is selected. NAME is used
3150 solely for messages. May re-arrange and modify SYMS in
3151 the process; the index returned is for the modified vector. */
3154 ada_resolve_function (struct ada_symbol_info syms
[],
3155 int nsyms
, struct value
**args
, int nargs
,
3156 const char *name
, struct type
*context_type
)
3159 int m
; /* Number of hits */
3160 struct type
*fallback
;
3161 struct type
*return_type
;
3163 return_type
= context_type
;
3164 if (context_type
== NULL
)
3165 fallback
= builtin_type_void
;
3172 for (k
= 0; k
< nsyms
; k
+= 1)
3174 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3176 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3177 && return_match (type
, return_type
))
3183 if (m
> 0 || return_type
== fallback
)
3186 return_type
= fallback
;
3193 printf_filtered (_("Multiple matches for %s\n"), name
);
3194 user_select_syms (syms
, m
, 1);
3200 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3201 in a listing of choices during disambiguation (see sort_choices, below).
3202 The idea is that overloadings of a subprogram name from the
3203 same package should sort in their source order. We settle for ordering
3204 such symbols by their trailing number (__N or $N). */
3207 encoded_ordered_before (char *N0
, char *N1
)
3211 else if (N0
== NULL
)
3216 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3218 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3220 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3221 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3225 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3228 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3230 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3231 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3233 return (strcmp (N0
, N1
) < 0);
3237 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3241 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3244 for (i
= 1; i
< nsyms
; i
+= 1)
3246 struct ada_symbol_info sym
= syms
[i
];
3249 for (j
= i
- 1; j
>= 0; j
-= 1)
3251 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3252 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3254 syms
[j
+ 1] = syms
[j
];
3260 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3261 by asking the user (if necessary), returning the number selected,
3262 and setting the first elements of SYMS items. Error if no symbols
3265 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3266 to be re-integrated one of these days. */
3269 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3272 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3274 int first_choice
= (max_results
== 1) ? 1 : 2;
3276 if (max_results
< 1)
3277 error (_("Request to select 0 symbols!"));
3281 printf_unfiltered (_("[0] cancel\n"));
3282 if (max_results
> 1)
3283 printf_unfiltered (_("[1] all\n"));
3285 sort_choices (syms
, nsyms
);
3287 for (i
= 0; i
< nsyms
; i
+= 1)
3289 if (syms
[i
].sym
== NULL
)
3292 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3294 struct symtab_and_line sal
=
3295 find_function_start_sal (syms
[i
].sym
, 1);
3296 if (sal
.symtab
== NULL
)
3297 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3299 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3302 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3303 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3304 sal
.symtab
->filename
, sal
.line
);
3310 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3311 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3312 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3313 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3315 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3316 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3318 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3319 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3320 else if (is_enumeral
3321 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3323 printf_unfiltered (("[%d] "), i
+ first_choice
);
3324 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3326 printf_unfiltered (_("'(%s) (enumeral)\n"),
3327 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3329 else if (symtab
!= NULL
)
3330 printf_unfiltered (is_enumeral
3331 ? _("[%d] %s in %s (enumeral)\n")
3332 : _("[%d] %s at %s:?\n"),
3334 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3337 printf_unfiltered (is_enumeral
3338 ? _("[%d] %s (enumeral)\n")
3339 : _("[%d] %s at ?\n"),
3341 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3345 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3348 for (i
= 0; i
< n_chosen
; i
+= 1)
3349 syms
[i
] = syms
[chosen
[i
]];
3354 /* Read and validate a set of numeric choices from the user in the
3355 range 0 .. N_CHOICES-1. Place the results in increasing
3356 order in CHOICES[0 .. N-1], and return N.
3358 The user types choices as a sequence of numbers on one line
3359 separated by blanks, encoding them as follows:
3361 + A choice of 0 means to cancel the selection, throwing an error.
3362 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3363 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3365 The user is not allowed to choose more than MAX_RESULTS values.
3367 ANNOTATION_SUFFIX, if present, is used to annotate the input
3368 prompts (for use with the -f switch). */
3371 get_selections (int *choices
, int n_choices
, int max_results
,
3372 int is_all_choice
, char *annotation_suffix
)
3377 int first_choice
= is_all_choice
? 2 : 1;
3379 prompt
= getenv ("PS2");
3383 printf_unfiltered (("%s "), prompt
);
3384 gdb_flush (gdb_stdout
);
3386 args
= command_line_input ((char *) NULL
, 0, annotation_suffix
);
3389 error_no_arg (_("one or more choice numbers"));
3393 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3394 order, as given in args. Choices are validated. */
3400 while (isspace (*args
))
3402 if (*args
== '\0' && n_chosen
== 0)
3403 error_no_arg (_("one or more choice numbers"));
3404 else if (*args
== '\0')
3407 choice
= strtol (args
, &args2
, 10);
3408 if (args
== args2
|| choice
< 0
3409 || choice
> n_choices
+ first_choice
- 1)
3410 error (_("Argument must be choice number"));
3414 error (_("cancelled"));
3416 if (choice
< first_choice
)
3418 n_chosen
= n_choices
;
3419 for (j
= 0; j
< n_choices
; j
+= 1)
3423 choice
-= first_choice
;
3425 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3429 if (j
< 0 || choice
!= choices
[j
])
3432 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3433 choices
[k
+ 1] = choices
[k
];
3434 choices
[j
+ 1] = choice
;
3439 if (n_chosen
> max_results
)
3440 error (_("Select no more than %d of the above"), max_results
);
3445 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3446 on the function identified by SYM and BLOCK, and taking NARGS
3447 arguments. Update *EXPP as needed to hold more space. */
3450 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3451 int oplen
, struct symbol
*sym
,
3452 struct block
*block
)
3454 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3455 symbol, -oplen for operator being replaced). */
3456 struct expression
*newexp
= (struct expression
*)
3457 xmalloc (sizeof (struct expression
)
3458 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3459 struct expression
*exp
= *expp
;
3461 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3462 newexp
->language_defn
= exp
->language_defn
;
3463 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3464 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3465 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3467 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3468 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3470 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3471 newexp
->elts
[pc
+ 4].block
= block
;
3472 newexp
->elts
[pc
+ 5].symbol
= sym
;
3478 /* Type-class predicates */
3480 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3484 numeric_type_p (struct type
*type
)
3490 switch (TYPE_CODE (type
))
3495 case TYPE_CODE_RANGE
:
3496 return (type
== TYPE_TARGET_TYPE (type
)
3497 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3504 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3507 integer_type_p (struct type
*type
)
3513 switch (TYPE_CODE (type
))
3517 case TYPE_CODE_RANGE
:
3518 return (type
== TYPE_TARGET_TYPE (type
)
3519 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3526 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3529 scalar_type_p (struct type
*type
)
3535 switch (TYPE_CODE (type
))
3538 case TYPE_CODE_RANGE
:
3539 case TYPE_CODE_ENUM
:
3548 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3551 discrete_type_p (struct type
*type
)
3557 switch (TYPE_CODE (type
))
3560 case TYPE_CODE_RANGE
:
3561 case TYPE_CODE_ENUM
:
3569 /* Returns non-zero if OP with operands in the vector ARGS could be
3570 a user-defined function. Errs on the side of pre-defined operators
3571 (i.e., result 0). */
3574 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3576 struct type
*type0
=
3577 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3578 struct type
*type1
=
3579 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3593 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3597 case BINOP_BITWISE_AND
:
3598 case BINOP_BITWISE_IOR
:
3599 case BINOP_BITWISE_XOR
:
3600 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3603 case BINOP_NOTEQUAL
:
3608 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3611 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3614 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3618 case UNOP_LOGICAL_NOT
:
3620 return (!numeric_type_p (type0
));
3629 1. In the following, we assume that a renaming type's name may
3630 have an ___XD suffix. It would be nice if this went away at some
3632 2. We handle both the (old) purely type-based representation of
3633 renamings and the (new) variable-based encoding. At some point,
3634 it is devoutly to be hoped that the former goes away
3635 (FIXME: hilfinger-2007-07-09).
3636 3. Subprogram renamings are not implemented, although the XRS
3637 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3639 /* If SYM encodes a renaming,
3641 <renaming> renames <renamed entity>,
3643 sets *LEN to the length of the renamed entity's name,
3644 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3645 the string describing the subcomponent selected from the renamed
3646 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3647 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3648 are undefined). Otherwise, returns a value indicating the category
3649 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3650 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3651 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3652 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3653 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3654 may be NULL, in which case they are not assigned.
3656 [Currently, however, GCC does not generate subprogram renamings.] */
3658 enum ada_renaming_category
3659 ada_parse_renaming (struct symbol
*sym
,
3660 const char **renamed_entity
, int *len
,
3661 const char **renaming_expr
)
3663 enum ada_renaming_category kind
;
3668 return ADA_NOT_RENAMING
;
3669 switch (SYMBOL_CLASS (sym
))
3672 return ADA_NOT_RENAMING
;
3674 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3675 renamed_entity
, len
, renaming_expr
);
3679 case LOC_OPTIMIZED_OUT
:
3680 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3682 return ADA_NOT_RENAMING
;
3686 kind
= ADA_OBJECT_RENAMING
;
3690 kind
= ADA_EXCEPTION_RENAMING
;
3694 kind
= ADA_PACKAGE_RENAMING
;
3698 kind
= ADA_SUBPROGRAM_RENAMING
;
3702 return ADA_NOT_RENAMING
;
3706 if (renamed_entity
!= NULL
)
3707 *renamed_entity
= info
;
3708 suffix
= strstr (info
, "___XE");
3709 if (suffix
== NULL
|| suffix
== info
)
3710 return ADA_NOT_RENAMING
;
3712 *len
= strlen (info
) - strlen (suffix
);
3714 if (renaming_expr
!= NULL
)
3715 *renaming_expr
= suffix
;
3719 /* Assuming TYPE encodes a renaming according to the old encoding in
3720 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3721 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3722 ADA_NOT_RENAMING otherwise. */
3723 static enum ada_renaming_category
3724 parse_old_style_renaming (struct type
*type
,
3725 const char **renamed_entity
, int *len
,
3726 const char **renaming_expr
)
3728 enum ada_renaming_category kind
;
3733 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3734 || TYPE_NFIELDS (type
) != 1)
3735 return ADA_NOT_RENAMING
;
3737 name
= type_name_no_tag (type
);
3739 return ADA_NOT_RENAMING
;
3741 name
= strstr (name
, "___XR");
3743 return ADA_NOT_RENAMING
;
3748 kind
= ADA_OBJECT_RENAMING
;
3751 kind
= ADA_EXCEPTION_RENAMING
;
3754 kind
= ADA_PACKAGE_RENAMING
;
3757 kind
= ADA_SUBPROGRAM_RENAMING
;
3760 return ADA_NOT_RENAMING
;
3763 info
= TYPE_FIELD_NAME (type
, 0);
3765 return ADA_NOT_RENAMING
;
3766 if (renamed_entity
!= NULL
)
3767 *renamed_entity
= info
;
3768 suffix
= strstr (info
, "___XE");
3769 if (renaming_expr
!= NULL
)
3770 *renaming_expr
= suffix
+ 5;
3771 if (suffix
== NULL
|| suffix
== info
)
3772 return ADA_NOT_RENAMING
;
3774 *len
= suffix
- info
;
3780 /* Evaluation: Function Calls */
3782 /* Return an lvalue containing the value VAL. This is the identity on
3783 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3784 on the stack, using and updating *SP as the stack pointer, and
3785 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3787 static struct value
*
3788 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3790 if (! VALUE_LVAL (val
))
3792 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3794 /* The following is taken from the structure-return code in
3795 call_function_by_hand. FIXME: Therefore, some refactoring seems
3797 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3799 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3800 reserving sufficient space. */
3802 if (gdbarch_frame_align_p (current_gdbarch
))
3803 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3804 VALUE_ADDRESS (val
) = *sp
;
3808 /* Stack grows upward. Align the frame, allocate space, and
3809 then again, re-align the frame. */
3810 if (gdbarch_frame_align_p (current_gdbarch
))
3811 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3812 VALUE_ADDRESS (val
) = *sp
;
3814 if (gdbarch_frame_align_p (current_gdbarch
))
3815 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3818 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3824 /* Return the value ACTUAL, converted to be an appropriate value for a
3825 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3826 allocating any necessary descriptors (fat pointers), or copies of
3827 values not residing in memory, updating it as needed. */
3829 static struct value
*
3830 convert_actual (struct value
*actual
, struct type
*formal_type0
,
3833 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3834 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3835 struct type
*formal_target
=
3836 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3837 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3838 struct type
*actual_target
=
3839 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3840 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3842 if (ada_is_array_descriptor_type (formal_target
)
3843 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3844 return make_array_descriptor (formal_type
, actual
, sp
);
3845 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
)
3847 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3848 && ada_is_array_descriptor_type (actual_target
))
3849 return desc_data (actual
);
3850 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3852 if (VALUE_LVAL (actual
) != lval_memory
)
3855 actual_type
= ada_check_typedef (value_type (actual
));
3856 val
= allocate_value (actual_type
);
3857 memcpy ((char *) value_contents_raw (val
),
3858 (char *) value_contents (actual
),
3859 TYPE_LENGTH (actual_type
));
3860 actual
= ensure_lval (val
, sp
);
3862 return value_addr (actual
);
3865 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3866 return ada_value_ind (actual
);
3872 /* Push a descriptor of type TYPE for array value ARR on the stack at
3873 *SP, updating *SP to reflect the new descriptor. Return either
3874 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3875 to-descriptor type rather than a descriptor type), a struct value *
3876 representing a pointer to this descriptor. */
3878 static struct value
*
3879 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3881 struct type
*bounds_type
= desc_bounds_type (type
);
3882 struct type
*desc_type
= desc_base_type (type
);
3883 struct value
*descriptor
= allocate_value (desc_type
);
3884 struct value
*bounds
= allocate_value (bounds_type
);
3887 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3889 modify_general_field (value_contents_writeable (bounds
),
3890 value_as_long (ada_array_bound (arr
, i
, 0)),
3891 desc_bound_bitpos (bounds_type
, i
, 0),
3892 desc_bound_bitsize (bounds_type
, i
, 0));
3893 modify_general_field (value_contents_writeable (bounds
),
3894 value_as_long (ada_array_bound (arr
, i
, 1)),
3895 desc_bound_bitpos (bounds_type
, i
, 1),
3896 desc_bound_bitsize (bounds_type
, i
, 1));
3899 bounds
= ensure_lval (bounds
, sp
);
3901 modify_general_field (value_contents_writeable (descriptor
),
3902 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3903 fat_pntr_data_bitpos (desc_type
),
3904 fat_pntr_data_bitsize (desc_type
));
3906 modify_general_field (value_contents_writeable (descriptor
),
3907 VALUE_ADDRESS (bounds
),
3908 fat_pntr_bounds_bitpos (desc_type
),
3909 fat_pntr_bounds_bitsize (desc_type
));
3911 descriptor
= ensure_lval (descriptor
, sp
);
3913 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3914 return value_addr (descriptor
);
3920 /* Assuming a dummy frame has been established on the target, perform any
3921 conversions needed for calling function FUNC on the NARGS actual
3922 parameters in ARGS, other than standard C conversions. Does
3923 nothing if FUNC does not have Ada-style prototype data, or if NARGS
3924 does not match the number of arguments expected. Use *SP as a
3925 stack pointer for additional data that must be pushed, updating its
3929 ada_convert_actuals (struct value
*func
, int nargs
, struct value
*args
[],
3934 if (TYPE_NFIELDS (value_type (func
)) == 0
3935 || nargs
!= TYPE_NFIELDS (value_type (func
)))
3938 for (i
= 0; i
< nargs
; i
+= 1)
3940 convert_actual (args
[i
], TYPE_FIELD_TYPE (value_type (func
), i
), sp
);
3943 /* Dummy definitions for an experimental caching module that is not
3944 * used in the public sources. */
3947 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3948 struct symbol
**sym
, struct block
**block
,
3949 struct symtab
**symtab
)
3955 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3956 struct block
*block
, struct symtab
*symtab
)
3962 /* Return the result of a standard (literal, C-like) lookup of NAME in
3963 given DOMAIN, visible from lexical block BLOCK. */
3965 static struct symbol
*
3966 standard_lookup (const char *name
, const struct block
*block
,
3970 struct symtab
*symtab
;
3972 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
, NULL
))
3975 lookup_symbol_in_language (name
, block
, domain
, language_c
, 0, &symtab
);
3976 cache_symbol (name
, domain
, sym
, block_found
, symtab
);
3981 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3982 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3983 since they contend in overloading in the same way. */
3985 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3989 for (i
= 0; i
< n
; i
+= 1)
3990 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3991 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3992 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3998 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3999 struct types. Otherwise, they may not. */
4002 equiv_types (struct type
*type0
, struct type
*type1
)
4006 if (type0
== NULL
|| type1
== NULL
4007 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4009 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4010 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4011 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4012 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4018 /* True iff SYM0 represents the same entity as SYM1, or one that is
4019 no more defined than that of SYM1. */
4022 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4026 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4027 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4030 switch (SYMBOL_CLASS (sym0
))
4036 struct type
*type0
= SYMBOL_TYPE (sym0
);
4037 struct type
*type1
= SYMBOL_TYPE (sym1
);
4038 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4039 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4040 int len0
= strlen (name0
);
4042 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4043 && (equiv_types (type0
, type1
)
4044 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4045 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4048 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4049 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4055 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4056 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4059 add_defn_to_vec (struct obstack
*obstackp
,
4061 struct block
*block
, struct symtab
*symtab
)
4065 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4067 /* Do not try to complete stub types, as the debugger is probably
4068 already scanning all symbols matching a certain name at the
4069 time when this function is called. Trying to replace the stub
4070 type by its associated full type will cause us to restart a scan
4071 which may lead to an infinite recursion. Instead, the client
4072 collecting the matching symbols will end up collecting several
4073 matches, with at least one of them complete. It can then filter
4074 out the stub ones if needed. */
4076 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4078 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4080 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4082 prevDefns
[i
].sym
= sym
;
4083 prevDefns
[i
].block
= block
;
4084 prevDefns
[i
].symtab
= symtab
;
4090 struct ada_symbol_info info
;
4094 info
.symtab
= symtab
;
4095 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4099 /* Number of ada_symbol_info structures currently collected in
4100 current vector in *OBSTACKP. */
4103 num_defns_collected (struct obstack
*obstackp
)
4105 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4108 /* Vector of ada_symbol_info structures currently collected in current
4109 vector in *OBSTACKP. If FINISH, close off the vector and return
4110 its final address. */
4112 static struct ada_symbol_info
*
4113 defns_collected (struct obstack
*obstackp
, int finish
)
4116 return obstack_finish (obstackp
);
4118 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4121 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4122 Check the global symbols if GLOBAL, the static symbols if not.
4123 Do wild-card match if WILD. */
4125 static struct partial_symbol
*
4126 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4127 int global
, domain_enum
namespace, int wild
)
4129 struct partial_symbol
**start
;
4130 int name_len
= strlen (name
);
4131 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4140 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4141 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4145 for (i
= 0; i
< length
; i
+= 1)
4147 struct partial_symbol
*psym
= start
[i
];
4149 if (SYMBOL_DOMAIN (psym
) == namespace
4150 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4164 int M
= (U
+ i
) >> 1;
4165 struct partial_symbol
*psym
= start
[M
];
4166 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4168 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4170 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4181 struct partial_symbol
*psym
= start
[i
];
4183 if (SYMBOL_DOMAIN (psym
) == namespace)
4185 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4193 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4207 int M
= (U
+ i
) >> 1;
4208 struct partial_symbol
*psym
= start
[M
];
4209 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4211 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4213 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4224 struct partial_symbol
*psym
= start
[i
];
4226 if (SYMBOL_DOMAIN (psym
) == namespace)
4230 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4233 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4235 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4245 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4255 /* Find a symbol table containing symbol SYM or NULL if none. */
4257 static struct symtab
*
4258 symtab_for_sym (struct symbol
*sym
)
4261 struct objfile
*objfile
;
4263 struct symbol
*tmp_sym
;
4264 struct dict_iterator iter
;
4267 ALL_PRIMARY_SYMTABS (objfile
, s
)
4269 switch (SYMBOL_CLASS (sym
))
4277 case LOC_CONST_BYTES
:
4278 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4279 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4281 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4282 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4288 switch (SYMBOL_CLASS (sym
))
4294 case LOC_REGPARM_ADDR
:
4299 case LOC_BASEREG_ARG
:
4301 case LOC_COMPUTED_ARG
:
4302 for (j
= FIRST_LOCAL_BLOCK
;
4303 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4305 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4306 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4317 /* Return a minimal symbol matching NAME according to Ada decoding
4318 rules. Returns NULL if there is no such minimal symbol. Names
4319 prefixed with "standard__" are handled specially: "standard__" is
4320 first stripped off, and only static and global symbols are searched. */
4322 struct minimal_symbol
*
4323 ada_lookup_simple_minsym (const char *name
)
4325 struct objfile
*objfile
;
4326 struct minimal_symbol
*msymbol
;
4329 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4331 name
+= sizeof ("standard__") - 1;
4335 wild_match
= (strstr (name
, "__") == NULL
);
4337 ALL_MSYMBOLS (objfile
, msymbol
)
4339 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4340 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4347 /* For all subprograms that statically enclose the subprogram of the
4348 selected frame, add symbols matching identifier NAME in DOMAIN
4349 and their blocks to the list of data in OBSTACKP, as for
4350 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4354 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4355 const char *name
, domain_enum
namespace,
4360 /* True if TYPE is definitely an artificial type supplied to a symbol
4361 for which no debugging information was given in the symbol file. */
4364 is_nondebugging_type (struct type
*type
)
4366 char *name
= ada_type_name (type
);
4367 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4370 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4371 duplicate other symbols in the list (The only case I know of where
4372 this happens is when object files containing stabs-in-ecoff are
4373 linked with files containing ordinary ecoff debugging symbols (or no
4374 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4375 Returns the number of items in the modified list. */
4378 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4385 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4386 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4387 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4389 for (j
= 0; j
< nsyms
; j
+= 1)
4392 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4393 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4394 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4395 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4396 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4397 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4400 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4401 syms
[k
- 1] = syms
[k
];
4414 /* Given a type that corresponds to a renaming entity, use the type name
4415 to extract the scope (package name or function name, fully qualified,
4416 and following the GNAT encoding convention) where this renaming has been
4417 defined. The string returned needs to be deallocated after use. */
4420 xget_renaming_scope (struct type
*renaming_type
)
4422 /* The renaming types adhere to the following convention:
4423 <scope>__<rename>___<XR extension>.
4424 So, to extract the scope, we search for the "___XR" extension,
4425 and then backtrack until we find the first "__". */
4427 const char *name
= type_name_no_tag (renaming_type
);
4428 char *suffix
= strstr (name
, "___XR");
4433 /* Now, backtrack a bit until we find the first "__". Start looking
4434 at suffix - 3, as the <rename> part is at least one character long. */
4436 for (last
= suffix
- 3; last
> name
; last
--)
4437 if (last
[0] == '_' && last
[1] == '_')
4440 /* Make a copy of scope and return it. */
4442 scope_len
= last
- name
;
4443 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4445 strncpy (scope
, name
, scope_len
);
4446 scope
[scope_len
] = '\0';
4451 /* Return nonzero if NAME corresponds to a package name. */
4454 is_package_name (const char *name
)
4456 /* Here, We take advantage of the fact that no symbols are generated
4457 for packages, while symbols are generated for each function.
4458 So the condition for NAME represent a package becomes equivalent
4459 to NAME not existing in our list of symbols. There is only one
4460 small complication with library-level functions (see below). */
4464 /* If it is a function that has not been defined at library level,
4465 then we should be able to look it up in the symbols. */
4466 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4469 /* Library-level function names start with "_ada_". See if function
4470 "_ada_" followed by NAME can be found. */
4472 /* Do a quick check that NAME does not contain "__", since library-level
4473 functions names cannot contain "__" in them. */
4474 if (strstr (name
, "__") != NULL
)
4477 fun_name
= xstrprintf ("_ada_%s", name
);
4479 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4482 /* Return nonzero if SYM corresponds to a renaming entity that is
4483 not visible from FUNCTION_NAME. */
4486 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4490 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4493 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4495 make_cleanup (xfree
, scope
);
4497 /* If the rename has been defined in a package, then it is visible. */
4498 if (is_package_name (scope
))
4501 /* Check that the rename is in the current function scope by checking
4502 that its name starts with SCOPE. */
4504 /* If the function name starts with "_ada_", it means that it is
4505 a library-level function. Strip this prefix before doing the
4506 comparison, as the encoding for the renaming does not contain
4508 if (strncmp (function_name
, "_ada_", 5) == 0)
4511 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4514 /* Remove entries from SYMS that corresponds to a renaming entity that
4515 is not visible from the function associated with CURRENT_BLOCK or
4516 that is superfluous due to the presence of more specific renaming
4517 information. Places surviving symbols in the initial entries of
4518 SYMS and returns the number of surviving symbols.
4521 First, in cases where an object renaming is implemented as a
4522 reference variable, GNAT may produce both the actual reference
4523 variable and the renaming encoding. In this case, we discard the
4526 Second, GNAT emits a type following a specified encoding for each renaming
4527 entity. Unfortunately, STABS currently does not support the definition
4528 of types that are local to a given lexical block, so all renamings types
4529 are emitted at library level. As a consequence, if an application
4530 contains two renaming entities using the same name, and a user tries to
4531 print the value of one of these entities, the result of the ada symbol
4532 lookup will also contain the wrong renaming type.
4534 This function partially covers for this limitation by attempting to
4535 remove from the SYMS list renaming symbols that should be visible
4536 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4537 method with the current information available. The implementation
4538 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4540 - When the user tries to print a rename in a function while there
4541 is another rename entity defined in a package: Normally, the
4542 rename in the function has precedence over the rename in the
4543 package, so the latter should be removed from the list. This is
4544 currently not the case.
4546 - This function will incorrectly remove valid renames if
4547 the CURRENT_BLOCK corresponds to a function which symbol name
4548 has been changed by an "Export" pragma. As a consequence,
4549 the user will be unable to print such rename entities. */
4552 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4553 int nsyms
, const struct block
*current_block
)
4555 struct symbol
*current_function
;
4556 char *current_function_name
;
4558 int is_new_style_renaming
;
4560 /* If there is both a renaming foo___XR... encoded as a variable and
4561 a simple variable foo in the same block, discard the latter.
4562 First, zero out such symbols, then compress. */
4563 is_new_style_renaming
= 0;
4564 for (i
= 0; i
< nsyms
; i
+= 1)
4566 struct symbol
*sym
= syms
[i
].sym
;
4567 struct block
*block
= syms
[i
].block
;
4571 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4573 name
= SYMBOL_LINKAGE_NAME (sym
);
4574 suffix
= strstr (name
, "___XR");
4578 int name_len
= suffix
- name
;
4580 is_new_style_renaming
= 1;
4581 for (j
= 0; j
< nsyms
; j
+= 1)
4582 if (i
!= j
&& syms
[j
].sym
!= NULL
4583 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4585 && block
== syms
[j
].block
)
4589 if (is_new_style_renaming
)
4593 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4594 if (syms
[j
].sym
!= NULL
)
4602 /* Extract the function name associated to CURRENT_BLOCK.
4603 Abort if unable to do so. */
4605 if (current_block
== NULL
)
4608 current_function
= block_function (current_block
);
4609 if (current_function
== NULL
)
4612 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4613 if (current_function_name
== NULL
)
4616 /* Check each of the symbols, and remove it from the list if it is
4617 a type corresponding to a renaming that is out of the scope of
4618 the current block. */
4623 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4624 == ADA_OBJECT_RENAMING
4625 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4628 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4629 syms
[j
- 1] = syms
[j
];
4639 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4640 scope and in global scopes, returning the number of matches. Sets
4641 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4642 indicating the symbols found and the blocks and symbol tables (if
4643 any) in which they were found. This vector are transient---good only to
4644 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4645 symbol match within the nest of blocks whose innermost member is BLOCK0,
4646 is the one match returned (no other matches in that or
4647 enclosing blocks is returned). If there are any matches in or
4648 surrounding BLOCK0, then these alone are returned. Otherwise, the
4649 search extends to global and file-scope (static) symbol tables.
4650 Names prefixed with "standard__" are handled specially: "standard__"
4651 is first stripped off, and only static and global symbols are searched. */
4654 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4655 domain_enum
namespace,
4656 struct ada_symbol_info
**results
)
4660 struct partial_symtab
*ps
;
4661 struct blockvector
*bv
;
4662 struct objfile
*objfile
;
4663 struct block
*block
;
4665 struct minimal_symbol
*msymbol
;
4671 obstack_free (&symbol_list_obstack
, NULL
);
4672 obstack_init (&symbol_list_obstack
);
4676 /* Search specified block and its superiors. */
4678 wild_match
= (strstr (name0
, "__") == NULL
);
4680 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4681 needed, but adding const will
4682 have a cascade effect. */
4683 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4687 name
= name0
+ sizeof ("standard__") - 1;
4691 while (block
!= NULL
)
4694 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4695 namespace, NULL
, NULL
, wild_match
);
4697 /* If we found a non-function match, assume that's the one. */
4698 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4699 num_defns_collected (&symbol_list_obstack
)))
4702 block
= BLOCK_SUPERBLOCK (block
);
4705 /* If no luck so far, try to find NAME as a local symbol in some lexically
4706 enclosing subprogram. */
4707 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4708 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4709 name
, namespace, wild_match
);
4711 /* If we found ANY matches among non-global symbols, we're done. */
4713 if (num_defns_collected (&symbol_list_obstack
) > 0)
4717 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
, &s
))
4720 add_defn_to_vec (&symbol_list_obstack
, sym
, block
, s
);
4724 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4725 tables, and psymtab's. */
4727 ALL_PRIMARY_SYMTABS (objfile
, s
)
4730 bv
= BLOCKVECTOR (s
);
4731 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4732 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4733 objfile
, s
, wild_match
);
4736 if (namespace == VAR_DOMAIN
)
4738 ALL_MSYMBOLS (objfile
, msymbol
)
4740 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4742 switch (MSYMBOL_TYPE (msymbol
))
4744 case mst_solib_trampoline
:
4747 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4750 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4752 bv
= BLOCKVECTOR (s
);
4753 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4754 ada_add_block_symbols (&symbol_list_obstack
, block
,
4755 SYMBOL_LINKAGE_NAME (msymbol
),
4756 namespace, objfile
, s
, wild_match
);
4758 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4760 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4761 ada_add_block_symbols (&symbol_list_obstack
, block
,
4762 SYMBOL_LINKAGE_NAME (msymbol
),
4763 namespace, objfile
, s
,
4772 ALL_PSYMTABS (objfile
, ps
)
4776 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4778 s
= PSYMTAB_TO_SYMTAB (ps
);
4781 bv
= BLOCKVECTOR (s
);
4782 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4783 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4784 namespace, objfile
, s
, wild_match
);
4788 /* Now add symbols from all per-file blocks if we've gotten no hits
4789 (Not strictly correct, but perhaps better than an error).
4790 Do the symtabs first, then check the psymtabs. */
4792 if (num_defns_collected (&symbol_list_obstack
) == 0)
4795 ALL_PRIMARY_SYMTABS (objfile
, s
)
4798 bv
= BLOCKVECTOR (s
);
4799 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4800 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4801 objfile
, s
, wild_match
);
4804 ALL_PSYMTABS (objfile
, ps
)
4808 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4810 s
= PSYMTAB_TO_SYMTAB (ps
);
4811 bv
= BLOCKVECTOR (s
);
4814 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4815 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4816 namespace, objfile
, s
, wild_match
);
4822 ndefns
= num_defns_collected (&symbol_list_obstack
);
4823 *results
= defns_collected (&symbol_list_obstack
, 1);
4825 ndefns
= remove_extra_symbols (*results
, ndefns
);
4828 cache_symbol (name0
, namespace, NULL
, NULL
, NULL
);
4830 if (ndefns
== 1 && cacheIfUnique
)
4831 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
,
4832 (*results
)[0].symtab
);
4834 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4840 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4841 domain_enum
namespace,
4842 struct block
**block_found
, struct symtab
**symtab
)
4844 struct ada_symbol_info
*candidates
;
4847 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4849 if (n_candidates
== 0)
4852 if (block_found
!= NULL
)
4853 *block_found
= candidates
[0].block
;
4857 *symtab
= candidates
[0].symtab
;
4858 if (*symtab
== NULL
&& candidates
[0].block
!= NULL
)
4860 struct objfile
*objfile
;
4863 struct blockvector
*bv
;
4865 /* Search the list of symtabs for one which contains the
4866 address of the start of this block. */
4867 ALL_PRIMARY_SYMTABS (objfile
, s
)
4869 bv
= BLOCKVECTOR (s
);
4870 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4871 if (BLOCK_START (b
) <= BLOCK_START (candidates
[0].block
)
4872 && BLOCK_END (b
) > BLOCK_START (candidates
[0].block
))
4875 return fixup_symbol_section (candidates
[0].sym
, objfile
);
4878 /* FIXME: brobecker/2004-11-12: I think that we should never
4879 reach this point. I don't see a reason why we would not
4880 find a symtab for a given block, so I suggest raising an
4881 internal_error exception here. Otherwise, we end up
4882 returning a symbol but no symtab, which certain parts of
4883 the code that rely (indirectly) on this function do not
4884 expect, eventually causing a SEGV. */
4885 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4888 return candidates
[0].sym
;
4891 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4892 scope and in global scopes, or NULL if none. NAME is folded and
4893 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4894 choosing the first symbol if there are multiple choices.
4895 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4896 table in which the symbol was found (in both cases, these
4897 assignments occur only if the pointers are non-null). */
4899 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4900 domain_enum
namespace, int *is_a_field_of_this
,
4901 struct symtab
**symtab
)
4903 if (is_a_field_of_this
!= NULL
)
4904 *is_a_field_of_this
= 0;
4907 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4908 block0
, namespace, NULL
, symtab
);
4911 static struct symbol
*
4912 ada_lookup_symbol_nonlocal (const char *name
,
4913 const char *linkage_name
,
4914 const struct block
*block
,
4915 const domain_enum domain
, struct symtab
**symtab
)
4917 if (linkage_name
== NULL
)
4918 linkage_name
= name
;
4919 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4924 /* True iff STR is a possible encoded suffix of a normal Ada name
4925 that is to be ignored for matching purposes. Suffixes of parallel
4926 names (e.g., XVE) are not included here. Currently, the possible suffixes
4927 are given by either of the regular expression:
4929 (__[0-9]+)?[.$][0-9]+ [nested subprogram suffix, on platforms such
4931 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4932 _E[0-9]+[bs]$ [protected object entry suffixes]
4933 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4937 is_name_suffix (const char *str
)
4940 const char *matching
;
4941 const int len
= strlen (str
);
4943 /* (__[0-9]+)?\.[0-9]+ */
4945 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4948 while (isdigit (matching
[0]))
4950 if (matching
[0] == '\0')
4954 if (matching
[0] == '.' || matching
[0] == '$')
4957 while (isdigit (matching
[0]))
4959 if (matching
[0] == '\0')
4964 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4967 while (isdigit (matching
[0]))
4969 if (matching
[0] == '\0')
4974 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4975 with a N at the end. Unfortunately, the compiler uses the same
4976 convention for other internal types it creates. So treating
4977 all entity names that end with an "N" as a name suffix causes
4978 some regressions. For instance, consider the case of an enumerated
4979 type. To support the 'Image attribute, it creates an array whose
4981 Having a single character like this as a suffix carrying some
4982 information is a bit risky. Perhaps we should change the encoding
4983 to be something like "_N" instead. In the meantime, do not do
4984 the following check. */
4985 /* Protected Object Subprograms */
4986 if (len
== 1 && str
[0] == 'N')
4991 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4994 while (isdigit (matching
[0]))
4996 if ((matching
[0] == 'b' || matching
[0] == 's')
4997 && matching
[1] == '\0')
5001 /* ??? We should not modify STR directly, as we are doing below. This
5002 is fine in this case, but may become problematic later if we find
5003 that this alternative did not work, and want to try matching
5004 another one from the begining of STR. Since we modified it, we
5005 won't be able to find the begining of the string anymore! */
5009 while (str
[0] != '_' && str
[0] != '\0')
5011 if (str
[0] != 'n' && str
[0] != 'b')
5016 if (str
[0] == '\000')
5020 if (str
[1] != '_' || str
[2] == '\000')
5024 if (strcmp (str
+ 3, "JM") == 0)
5026 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5027 the LJM suffix in favor of the JM one. But we will
5028 still accept LJM as a valid suffix for a reasonable
5029 amount of time, just to allow ourselves to debug programs
5030 compiled using an older version of GNAT. */
5031 if (strcmp (str
+ 3, "LJM") == 0)
5035 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5036 || str
[4] == 'U' || str
[4] == 'P')
5038 if (str
[4] == 'R' && str
[5] != 'T')
5042 if (!isdigit (str
[2]))
5044 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5045 if (!isdigit (str
[k
]) && str
[k
] != '_')
5049 if (str
[0] == '$' && isdigit (str
[1]))
5051 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5052 if (!isdigit (str
[k
]) && str
[k
] != '_')
5059 /* Return nonzero if the given string starts with a dot ('.')
5060 followed by zero or more digits.
5062 Note: brobecker/2003-11-10: A forward declaration has not been
5063 added at the begining of this file yet, because this function
5064 is only used to work around a problem found during wild matching
5065 when trying to match minimal symbol names against symbol names
5066 obtained from dwarf-2 data. This function is therefore currently
5067 only used in wild_match() and is likely to be deleted when the
5068 problem in dwarf-2 is fixed. */
5071 is_dot_digits_suffix (const char *str
)
5077 while (isdigit (str
[0]))
5079 return (str
[0] == '\0');
5082 /* Return non-zero if the string starting at NAME and ending before
5083 NAME_END contains no capital letters. */
5086 is_valid_name_for_wild_match (const char *name0
)
5088 const char *decoded_name
= ada_decode (name0
);
5091 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5092 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5098 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5099 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5100 informational suffixes of NAME (i.e., for which is_name_suffix is
5104 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5111 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5112 stored in the symbol table for nested function names is sometimes
5113 different from the name of the associated entity stored in
5114 the dwarf-2 data: This is the case for nested subprograms, where
5115 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5116 while the symbol name from the dwarf-2 data does not.
5118 Although the DWARF-2 standard documents that entity names stored
5119 in the dwarf-2 data should be identical to the name as seen in
5120 the source code, GNAT takes a different approach as we already use
5121 a special encoding mechanism to convey the information so that
5122 a C debugger can still use the information generated to debug
5123 Ada programs. A corollary is that the symbol names in the dwarf-2
5124 data should match the names found in the symbol table. I therefore
5125 consider this issue as a compiler defect.
5127 Until the compiler is properly fixed, we work-around the problem
5128 by ignoring such suffixes during the match. We do so by making
5129 a copy of PATN0 and NAME0, and then by stripping such a suffix
5130 if present. We then perform the match on the resulting strings. */
5133 name_len
= strlen (name0
);
5135 name
= name_start
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5136 strcpy (name
, name0
);
5137 dot
= strrchr (name
, '.');
5138 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5141 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5142 strncpy (patn
, patn0
, patn_len
);
5143 patn
[patn_len
] = '\0';
5144 dot
= strrchr (patn
, '.');
5145 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5148 patn_len
= dot
- patn
;
5152 /* Now perform the wild match. */
5154 name_len
= strlen (name
);
5155 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5156 && strncmp (patn
, name
+ 5, patn_len
) == 0
5157 && is_name_suffix (name
+ patn_len
+ 5))
5160 while (name_len
>= patn_len
)
5162 if (strncmp (patn
, name
, patn_len
) == 0
5163 && is_name_suffix (name
+ patn_len
))
5164 return (name
== name_start
|| is_valid_name_for_wild_match (name0
));
5171 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5176 if (!islower (name
[2]))
5183 if (!islower (name
[1]))
5194 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5195 vector *defn_symbols, updating the list of symbols in OBSTACKP
5196 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5197 OBJFILE is the section containing BLOCK.
5198 SYMTAB is recorded with each symbol added. */
5201 ada_add_block_symbols (struct obstack
*obstackp
,
5202 struct block
*block
, const char *name
,
5203 domain_enum domain
, struct objfile
*objfile
,
5204 struct symtab
*symtab
, int wild
)
5206 struct dict_iterator iter
;
5207 int name_len
= strlen (name
);
5208 /* A matching argument symbol, if any. */
5209 struct symbol
*arg_sym
;
5210 /* Set true when we find a matching non-argument symbol. */
5219 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5221 if (SYMBOL_DOMAIN (sym
) == domain
5222 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5224 switch (SYMBOL_CLASS (sym
))
5230 case LOC_REGPARM_ADDR
:
5231 case LOC_BASEREG_ARG
:
5232 case LOC_COMPUTED_ARG
:
5235 case LOC_UNRESOLVED
:
5239 add_defn_to_vec (obstackp
,
5240 fixup_symbol_section (sym
, objfile
),
5249 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5251 if (SYMBOL_DOMAIN (sym
) == domain
)
5253 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5255 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5257 switch (SYMBOL_CLASS (sym
))
5263 case LOC_REGPARM_ADDR
:
5264 case LOC_BASEREG_ARG
:
5265 case LOC_COMPUTED_ARG
:
5268 case LOC_UNRESOLVED
:
5272 add_defn_to_vec (obstackp
,
5273 fixup_symbol_section (sym
, objfile
),
5282 if (!found_sym
&& arg_sym
!= NULL
)
5284 add_defn_to_vec (obstackp
,
5285 fixup_symbol_section (arg_sym
, objfile
),
5294 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5296 if (SYMBOL_DOMAIN (sym
) == domain
)
5300 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5303 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5305 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5310 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5312 switch (SYMBOL_CLASS (sym
))
5318 case LOC_REGPARM_ADDR
:
5319 case LOC_BASEREG_ARG
:
5320 case LOC_COMPUTED_ARG
:
5323 case LOC_UNRESOLVED
:
5327 add_defn_to_vec (obstackp
,
5328 fixup_symbol_section (sym
, objfile
),
5336 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5337 They aren't parameters, right? */
5338 if (!found_sym
&& arg_sym
!= NULL
)
5340 add_defn_to_vec (obstackp
,
5341 fixup_symbol_section (arg_sym
, objfile
),
5349 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5350 for tagged types. */
5353 ada_is_dispatch_table_ptr_type (struct type
*type
)
5357 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5360 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5364 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5367 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5368 to be invisible to users. */
5371 ada_is_ignored_field (struct type
*type
, int field_num
)
5373 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5376 /* Check the name of that field. */
5378 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5380 /* Anonymous field names should not be printed.
5381 brobecker/2007-02-20: I don't think this can actually happen
5382 but we don't want to print the value of annonymous fields anyway. */
5386 /* A field named "_parent" is internally generated by GNAT for
5387 tagged types, and should not be printed either. */
5388 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5392 /* If this is the dispatch table of a tagged type, then ignore. */
5393 if (ada_is_tagged_type (type
, 1)
5394 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5397 /* Not a special field, so it should not be ignored. */
5401 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5402 pointer or reference type whose ultimate target has a tag field. */
5405 ada_is_tagged_type (struct type
*type
, int refok
)
5407 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5410 /* True iff TYPE represents the type of X'Tag */
5413 ada_is_tag_type (struct type
*type
)
5415 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5419 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5420 return (name
!= NULL
5421 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5425 /* The type of the tag on VAL. */
5428 ada_tag_type (struct value
*val
)
5430 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5433 /* The value of the tag on VAL. */
5436 ada_value_tag (struct value
*val
)
5438 return ada_value_struct_elt (val
, "_tag", 0);
5441 /* The value of the tag on the object of type TYPE whose contents are
5442 saved at VALADDR, if it is non-null, or is at memory address
5445 static struct value
*
5446 value_tag_from_contents_and_address (struct type
*type
,
5447 const gdb_byte
*valaddr
,
5450 int tag_byte_offset
, dummy1
, dummy2
;
5451 struct type
*tag_type
;
5452 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5455 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5457 : valaddr
+ tag_byte_offset
);
5458 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5460 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5465 static struct type
*
5466 type_from_tag (struct value
*tag
)
5468 const char *type_name
= ada_tag_name (tag
);
5469 if (type_name
!= NULL
)
5470 return ada_find_any_type (ada_encode (type_name
));
5481 static int ada_tag_name_1 (void *);
5482 static int ada_tag_name_2 (struct tag_args
*);
5484 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5485 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5486 The value stored in ARGS->name is valid until the next call to
5490 ada_tag_name_1 (void *args0
)
5492 struct tag_args
*args
= (struct tag_args
*) args0
;
5493 static char name
[1024];
5497 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5499 return ada_tag_name_2 (args
);
5500 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5503 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5504 for (p
= name
; *p
!= '\0'; p
+= 1)
5511 /* Utility function for ada_tag_name_1 that tries the second
5512 representation for the dispatch table (in which there is no
5513 explicit 'tsd' field in the referent of the tag pointer, and instead
5514 the tsd pointer is stored just before the dispatch table. */
5517 ada_tag_name_2 (struct tag_args
*args
)
5519 struct type
*info_type
;
5520 static char name
[1024];
5522 struct value
*val
, *valp
;
5525 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5526 if (info_type
== NULL
)
5528 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5529 valp
= value_cast (info_type
, args
->tag
);
5532 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5535 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5538 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5539 for (p
= name
; *p
!= '\0'; p
+= 1)
5546 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5550 ada_tag_name (struct value
*tag
)
5552 struct tag_args args
;
5553 if (!ada_is_tag_type (value_type (tag
)))
5557 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5561 /* The parent type of TYPE, or NULL if none. */
5564 ada_parent_type (struct type
*type
)
5568 type
= ada_check_typedef (type
);
5570 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5573 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5574 if (ada_is_parent_field (type
, i
))
5575 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5580 /* True iff field number FIELD_NUM of structure type TYPE contains the
5581 parent-type (inherited) fields of a derived type. Assumes TYPE is
5582 a structure type with at least FIELD_NUM+1 fields. */
5585 ada_is_parent_field (struct type
*type
, int field_num
)
5587 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5588 return (name
!= NULL
5589 && (strncmp (name
, "PARENT", 6) == 0
5590 || strncmp (name
, "_parent", 7) == 0));
5593 /* True iff field number FIELD_NUM of structure type TYPE is a
5594 transparent wrapper field (which should be silently traversed when doing
5595 field selection and flattened when printing). Assumes TYPE is a
5596 structure type with at least FIELD_NUM+1 fields. Such fields are always
5600 ada_is_wrapper_field (struct type
*type
, int field_num
)
5602 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5603 return (name
!= NULL
5604 && (strncmp (name
, "PARENT", 6) == 0
5605 || strcmp (name
, "REP") == 0
5606 || strncmp (name
, "_parent", 7) == 0
5607 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5610 /* True iff field number FIELD_NUM of structure or union type TYPE
5611 is a variant wrapper. Assumes TYPE is a structure type with at least
5612 FIELD_NUM+1 fields. */
5615 ada_is_variant_part (struct type
*type
, int field_num
)
5617 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5618 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5619 || (is_dynamic_field (type
, field_num
)
5620 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5621 == TYPE_CODE_UNION
)));
5624 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5625 whose discriminants are contained in the record type OUTER_TYPE,
5626 returns the type of the controlling discriminant for the variant. */
5629 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5631 char *name
= ada_variant_discrim_name (var_type
);
5633 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5635 return builtin_type_int
;
5640 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5641 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5642 represents a 'when others' clause; otherwise 0. */
5645 ada_is_others_clause (struct type
*type
, int field_num
)
5647 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5648 return (name
!= NULL
&& name
[0] == 'O');
5651 /* Assuming that TYPE0 is the type of the variant part of a record,
5652 returns the name of the discriminant controlling the variant.
5653 The value is valid until the next call to ada_variant_discrim_name. */
5656 ada_variant_discrim_name (struct type
*type0
)
5658 static char *result
= NULL
;
5659 static size_t result_len
= 0;
5662 const char *discrim_end
;
5663 const char *discrim_start
;
5665 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5666 type
= TYPE_TARGET_TYPE (type0
);
5670 name
= ada_type_name (type
);
5672 if (name
== NULL
|| name
[0] == '\000')
5675 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5678 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5681 if (discrim_end
== name
)
5684 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5687 if (discrim_start
== name
+ 1)
5689 if ((discrim_start
> name
+ 3
5690 && strncmp (discrim_start
- 3, "___", 3) == 0)
5691 || discrim_start
[-1] == '.')
5695 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5696 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5697 result
[discrim_end
- discrim_start
] = '\0';
5701 /* Scan STR for a subtype-encoded number, beginning at position K.
5702 Put the position of the character just past the number scanned in
5703 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5704 Return 1 if there was a valid number at the given position, and 0
5705 otherwise. A "subtype-encoded" number consists of the absolute value
5706 in decimal, followed by the letter 'm' to indicate a negative number.
5707 Assumes 0m does not occur. */
5710 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5714 if (!isdigit (str
[k
]))
5717 /* Do it the hard way so as not to make any assumption about
5718 the relationship of unsigned long (%lu scan format code) and
5721 while (isdigit (str
[k
]))
5723 RU
= RU
* 10 + (str
[k
] - '0');
5730 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5736 /* NOTE on the above: Technically, C does not say what the results of
5737 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5738 number representable as a LONGEST (although either would probably work
5739 in most implementations). When RU>0, the locution in the then branch
5740 above is always equivalent to the negative of RU. */
5747 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5748 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5749 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5752 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5754 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5767 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5776 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5777 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5779 if (val
>= L
&& val
<= U
)
5791 /* FIXME: Lots of redundancy below. Try to consolidate. */
5793 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5794 ARG_TYPE, extract and return the value of one of its (non-static)
5795 fields. FIELDNO says which field. Differs from value_primitive_field
5796 only in that it can handle packed values of arbitrary type. */
5798 static struct value
*
5799 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5800 struct type
*arg_type
)
5804 arg_type
= ada_check_typedef (arg_type
);
5805 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5807 /* Handle packed fields. */
5809 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5811 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5812 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5814 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5815 offset
+ bit_pos
/ 8,
5816 bit_pos
% 8, bit_size
, type
);
5819 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5822 /* Find field with name NAME in object of type TYPE. If found,
5823 set the following for each argument that is non-null:
5824 - *FIELD_TYPE_P to the field's type;
5825 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5826 an object of that type;
5827 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5828 - *BIT_SIZE_P to its size in bits if the field is packed, and
5830 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5831 fields up to but not including the desired field, or by the total
5832 number of fields if not found. A NULL value of NAME never
5833 matches; the function just counts visible fields in this case.
5835 Returns 1 if found, 0 otherwise. */
5838 find_struct_field (char *name
, struct type
*type
, int offset
,
5839 struct type
**field_type_p
,
5840 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5845 type
= ada_check_typedef (type
);
5847 if (field_type_p
!= NULL
)
5848 *field_type_p
= NULL
;
5849 if (byte_offset_p
!= NULL
)
5851 if (bit_offset_p
!= NULL
)
5853 if (bit_size_p
!= NULL
)
5856 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5858 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5859 int fld_offset
= offset
+ bit_pos
/ 8;
5860 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5862 if (t_field_name
== NULL
)
5865 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5867 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5868 if (field_type_p
!= NULL
)
5869 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5870 if (byte_offset_p
!= NULL
)
5871 *byte_offset_p
= fld_offset
;
5872 if (bit_offset_p
!= NULL
)
5873 *bit_offset_p
= bit_pos
% 8;
5874 if (bit_size_p
!= NULL
)
5875 *bit_size_p
= bit_size
;
5878 else if (ada_is_wrapper_field (type
, i
))
5880 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5881 field_type_p
, byte_offset_p
, bit_offset_p
,
5882 bit_size_p
, index_p
))
5885 else if (ada_is_variant_part (type
, i
))
5887 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5890 struct type
*field_type
5891 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5893 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5895 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5897 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5898 field_type_p
, byte_offset_p
,
5899 bit_offset_p
, bit_size_p
, index_p
))
5903 else if (index_p
!= NULL
)
5909 /* Number of user-visible fields in record type TYPE. */
5912 num_visible_fields (struct type
*type
)
5916 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5920 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5921 and search in it assuming it has (class) type TYPE.
5922 If found, return value, else return NULL.
5924 Searches recursively through wrapper fields (e.g., '_parent'). */
5926 static struct value
*
5927 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5931 type
= ada_check_typedef (type
);
5933 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5935 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5937 if (t_field_name
== NULL
)
5940 else if (field_name_match (t_field_name
, name
))
5941 return ada_value_primitive_field (arg
, offset
, i
, type
);
5943 else if (ada_is_wrapper_field (type
, i
))
5945 struct value
*v
= /* Do not let indent join lines here. */
5946 ada_search_struct_field (name
, arg
,
5947 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5948 TYPE_FIELD_TYPE (type
, i
));
5953 else if (ada_is_variant_part (type
, i
))
5955 /* PNH: Do we ever get here? See find_struct_field. */
5957 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5958 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5960 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5962 struct value
*v
= ada_search_struct_field
/* Force line break. */
5964 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5965 TYPE_FIELD_TYPE (field_type
, j
));
5974 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
5975 int, struct type
*);
5978 /* Return field #INDEX in ARG, where the index is that returned by
5979 * find_struct_field through its INDEX_P argument. Adjust the address
5980 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
5981 * If found, return value, else return NULL. */
5983 static struct value
*
5984 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
5987 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
5991 /* Auxiliary function for ada_index_struct_field. Like
5992 * ada_index_struct_field, but takes index from *INDEX_P and modifies
5995 static struct value
*
5996 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6000 type
= ada_check_typedef (type
);
6002 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6004 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6006 else if (ada_is_wrapper_field (type
, i
))
6008 struct value
*v
= /* Do not let indent join lines here. */
6009 ada_index_struct_field_1 (index_p
, arg
,
6010 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6011 TYPE_FIELD_TYPE (type
, i
));
6016 else if (ada_is_variant_part (type
, i
))
6018 /* PNH: Do we ever get here? See ada_search_struct_field,
6019 find_struct_field. */
6020 error (_("Cannot assign this kind of variant record"));
6022 else if (*index_p
== 0)
6023 return ada_value_primitive_field (arg
, offset
, i
, type
);
6030 /* Given ARG, a value of type (pointer or reference to a)*
6031 structure/union, extract the component named NAME from the ultimate
6032 target structure/union and return it as a value with its
6033 appropriate type. If ARG is a pointer or reference and the field
6034 is not packed, returns a reference to the field, otherwise the
6035 value of the field (an lvalue if ARG is an lvalue).
6037 The routine searches for NAME among all members of the structure itself
6038 and (recursively) among all members of any wrapper members
6041 If NO_ERR, then simply return NULL in case of error, rather than
6045 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6047 struct type
*t
, *t1
;
6051 t1
= t
= ada_check_typedef (value_type (arg
));
6052 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6054 t1
= TYPE_TARGET_TYPE (t
);
6057 t1
= ada_check_typedef (t1
);
6058 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6060 arg
= coerce_ref (arg
);
6065 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6067 t1
= TYPE_TARGET_TYPE (t
);
6070 t1
= ada_check_typedef (t1
);
6071 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6073 arg
= value_ind (arg
);
6080 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6084 v
= ada_search_struct_field (name
, arg
, 0, t
);
6087 int bit_offset
, bit_size
, byte_offset
;
6088 struct type
*field_type
;
6091 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6092 address
= value_as_address (arg
);
6094 address
= unpack_pointer (t
, value_contents (arg
));
6096 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6097 if (find_struct_field (name
, t1
, 0,
6098 &field_type
, &byte_offset
, &bit_offset
,
6103 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6104 arg
= ada_coerce_ref (arg
);
6106 arg
= ada_value_ind (arg
);
6107 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6108 bit_offset
, bit_size
,
6112 v
= value_from_pointer (lookup_reference_type (field_type
),
6113 address
+ byte_offset
);
6117 if (v
!= NULL
|| no_err
)
6120 error (_("There is no member named %s."), name
);
6126 error (_("Attempt to extract a component of a value that is not a record."));
6129 /* Given a type TYPE, look up the type of the component of type named NAME.
6130 If DISPP is non-null, add its byte displacement from the beginning of a
6131 structure (pointed to by a value) of type TYPE to *DISPP (does not
6132 work for packed fields).
6134 Matches any field whose name has NAME as a prefix, possibly
6137 TYPE can be either a struct or union. If REFOK, TYPE may also
6138 be a (pointer or reference)+ to a struct or union, and the
6139 ultimate target type will be searched.
6141 Looks recursively into variant clauses and parent types.
6143 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6144 TYPE is not a type of the right kind. */
6146 static struct type
*
6147 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6148 int noerr
, int *dispp
)
6155 if (refok
&& type
!= NULL
)
6158 type
= ada_check_typedef (type
);
6159 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6160 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6162 type
= TYPE_TARGET_TYPE (type
);
6166 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6167 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6173 target_terminal_ours ();
6174 gdb_flush (gdb_stdout
);
6176 error (_("Type (null) is not a structure or union type"));
6179 /* XXX: type_sprint */
6180 fprintf_unfiltered (gdb_stderr
, _("Type "));
6181 type_print (type
, "", gdb_stderr
, -1);
6182 error (_(" is not a structure or union type"));
6187 type
= to_static_fixed_type (type
);
6189 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6191 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6195 if (t_field_name
== NULL
)
6198 else if (field_name_match (t_field_name
, name
))
6201 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6202 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6205 else if (ada_is_wrapper_field (type
, i
))
6208 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6213 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6218 else if (ada_is_variant_part (type
, i
))
6221 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6223 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6226 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6231 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6242 target_terminal_ours ();
6243 gdb_flush (gdb_stdout
);
6246 /* XXX: type_sprint */
6247 fprintf_unfiltered (gdb_stderr
, _("Type "));
6248 type_print (type
, "", gdb_stderr
, -1);
6249 error (_(" has no component named <null>"));
6253 /* XXX: type_sprint */
6254 fprintf_unfiltered (gdb_stderr
, _("Type "));
6255 type_print (type
, "", gdb_stderr
, -1);
6256 error (_(" has no component named %s"), name
);
6263 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6264 within a value of type OUTER_TYPE that is stored in GDB at
6265 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6266 numbering from 0) is applicable. Returns -1 if none are. */
6269 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6270 const gdb_byte
*outer_valaddr
)
6275 struct type
*discrim_type
;
6276 char *discrim_name
= ada_variant_discrim_name (var_type
);
6277 LONGEST discrim_val
;
6281 ada_lookup_struct_elt_type (outer_type
, discrim_name
, 1, 1, &disp
);
6282 if (discrim_type
== NULL
)
6284 discrim_val
= unpack_long (discrim_type
, outer_valaddr
+ disp
);
6287 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6289 if (ada_is_others_clause (var_type
, i
))
6291 else if (ada_in_variant (discrim_val
, var_type
, i
))
6295 return others_clause
;
6300 /* Dynamic-Sized Records */
6302 /* Strategy: The type ostensibly attached to a value with dynamic size
6303 (i.e., a size that is not statically recorded in the debugging
6304 data) does not accurately reflect the size or layout of the value.
6305 Our strategy is to convert these values to values with accurate,
6306 conventional types that are constructed on the fly. */
6308 /* There is a subtle and tricky problem here. In general, we cannot
6309 determine the size of dynamic records without its data. However,
6310 the 'struct value' data structure, which GDB uses to represent
6311 quantities in the inferior process (the target), requires the size
6312 of the type at the time of its allocation in order to reserve space
6313 for GDB's internal copy of the data. That's why the
6314 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6315 rather than struct value*s.
6317 However, GDB's internal history variables ($1, $2, etc.) are
6318 struct value*s containing internal copies of the data that are not, in
6319 general, the same as the data at their corresponding addresses in
6320 the target. Fortunately, the types we give to these values are all
6321 conventional, fixed-size types (as per the strategy described
6322 above), so that we don't usually have to perform the
6323 'to_fixed_xxx_type' conversions to look at their values.
6324 Unfortunately, there is one exception: if one of the internal
6325 history variables is an array whose elements are unconstrained
6326 records, then we will need to create distinct fixed types for each
6327 element selected. */
6329 /* The upshot of all of this is that many routines take a (type, host
6330 address, target address) triple as arguments to represent a value.
6331 The host address, if non-null, is supposed to contain an internal
6332 copy of the relevant data; otherwise, the program is to consult the
6333 target at the target address. */
6335 /* Assuming that VAL0 represents a pointer value, the result of
6336 dereferencing it. Differs from value_ind in its treatment of
6337 dynamic-sized types. */
6340 ada_value_ind (struct value
*val0
)
6342 struct value
*val
= unwrap_value (value_ind (val0
));
6343 return ada_to_fixed_value (val
);
6346 /* The value resulting from dereferencing any "reference to"
6347 qualifiers on VAL0. */
6349 static struct value
*
6350 ada_coerce_ref (struct value
*val0
)
6352 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6354 struct value
*val
= val0
;
6355 val
= coerce_ref (val
);
6356 val
= unwrap_value (val
);
6357 return ada_to_fixed_value (val
);
6363 /* Return OFF rounded upward if necessary to a multiple of
6364 ALIGNMENT (a power of 2). */
6367 align_value (unsigned int off
, unsigned int alignment
)
6369 return (off
+ alignment
- 1) & ~(alignment
- 1);
6372 /* Return the bit alignment required for field #F of template type TYPE. */
6375 field_alignment (struct type
*type
, int f
)
6377 const char *name
= TYPE_FIELD_NAME (type
, f
);
6381 /* The field name should never be null, unless the debugging information
6382 is somehow malformed. In this case, we assume the field does not
6383 require any alignment. */
6387 len
= strlen (name
);
6389 if (!isdigit (name
[len
- 1]))
6392 if (isdigit (name
[len
- 2]))
6393 align_offset
= len
- 2;
6395 align_offset
= len
- 1;
6397 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6398 return TARGET_CHAR_BIT
;
6400 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6403 /* Find a symbol named NAME. Ignores ambiguity. */
6406 ada_find_any_symbol (const char *name
)
6410 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6411 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6414 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6418 /* Find a type named NAME. Ignores ambiguity. */
6421 ada_find_any_type (const char *name
)
6423 struct symbol
*sym
= ada_find_any_symbol (name
);
6426 return SYMBOL_TYPE (sym
);
6431 /* Given NAME and an associated BLOCK, search all symbols for
6432 NAME suffixed with "___XR", which is the ``renaming'' symbol
6433 associated to NAME. Return this symbol if found, return
6437 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6441 sym
= find_old_style_renaming_symbol (name
, block
);
6446 /* Not right yet. FIXME pnh 7/20/2007. */
6447 sym
= ada_find_any_symbol (name
);
6448 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6454 static struct symbol
*
6455 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6457 const struct symbol
*function_sym
= block_function (block
);
6460 if (function_sym
!= NULL
)
6462 /* If the symbol is defined inside a function, NAME is not fully
6463 qualified. This means we need to prepend the function name
6464 as well as adding the ``___XR'' suffix to build the name of
6465 the associated renaming symbol. */
6466 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6467 /* Function names sometimes contain suffixes used
6468 for instance to qualify nested subprograms. When building
6469 the XR type name, we need to make sure that this suffix is
6470 not included. So do not include any suffix in the function
6471 name length below. */
6472 const int function_name_len
= ada_name_prefix_len (function_name
);
6473 const int rename_len
= function_name_len
+ 2 /* "__" */
6474 + strlen (name
) + 6 /* "___XR\0" */ ;
6476 /* Strip the suffix if necessary. */
6477 function_name
[function_name_len
] = '\0';
6479 /* Library-level functions are a special case, as GNAT adds
6480 a ``_ada_'' prefix to the function name to avoid namespace
6481 pollution. However, the renaming symbols themselves do not
6482 have this prefix, so we need to skip this prefix if present. */
6483 if (function_name_len
> 5 /* "_ada_" */
6484 && strstr (function_name
, "_ada_") == function_name
)
6485 function_name
= function_name
+ 5;
6487 rename
= (char *) alloca (rename_len
* sizeof (char));
6488 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6492 const int rename_len
= strlen (name
) + 6;
6493 rename
= (char *) alloca (rename_len
* sizeof (char));
6494 sprintf (rename
, "%s___XR", name
);
6497 return ada_find_any_symbol (rename
);
6500 /* Because of GNAT encoding conventions, several GDB symbols may match a
6501 given type name. If the type denoted by TYPE0 is to be preferred to
6502 that of TYPE1 for purposes of type printing, return non-zero;
6503 otherwise return 0. */
6506 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6510 else if (type0
== NULL
)
6512 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6514 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6516 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6518 else if (ada_is_packed_array_type (type0
))
6520 else if (ada_is_array_descriptor_type (type0
)
6521 && !ada_is_array_descriptor_type (type1
))
6525 const char *type0_name
= type_name_no_tag (type0
);
6526 const char *type1_name
= type_name_no_tag (type1
);
6528 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6529 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6535 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6536 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6539 ada_type_name (struct type
*type
)
6543 else if (TYPE_NAME (type
) != NULL
)
6544 return TYPE_NAME (type
);
6546 return TYPE_TAG_NAME (type
);
6549 /* Find a parallel type to TYPE whose name is formed by appending
6550 SUFFIX to the name of TYPE. */
6553 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6556 static size_t name_len
= 0;
6558 char *typename
= ada_type_name (type
);
6560 if (typename
== NULL
)
6563 len
= strlen (typename
);
6565 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6567 strcpy (name
, typename
);
6568 strcpy (name
+ len
, suffix
);
6570 return ada_find_any_type (name
);
6574 /* If TYPE is a variable-size record type, return the corresponding template
6575 type describing its fields. Otherwise, return NULL. */
6577 static struct type
*
6578 dynamic_template_type (struct type
*type
)
6580 type
= ada_check_typedef (type
);
6582 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6583 || ada_type_name (type
) == NULL
)
6587 int len
= strlen (ada_type_name (type
));
6588 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6591 return ada_find_parallel_type (type
, "___XVE");
6595 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6596 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6599 is_dynamic_field (struct type
*templ_type
, int field_num
)
6601 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6603 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6604 && strstr (name
, "___XVL") != NULL
;
6607 /* The index of the variant field of TYPE, or -1 if TYPE does not
6608 represent a variant record type. */
6611 variant_field_index (struct type
*type
)
6615 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6618 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6620 if (ada_is_variant_part (type
, f
))
6626 /* A record type with no fields. */
6628 static struct type
*
6629 empty_record (struct objfile
*objfile
)
6631 struct type
*type
= alloc_type (objfile
);
6632 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6633 TYPE_NFIELDS (type
) = 0;
6634 TYPE_FIELDS (type
) = NULL
;
6635 TYPE_NAME (type
) = "<empty>";
6636 TYPE_TAG_NAME (type
) = NULL
;
6637 TYPE_FLAGS (type
) = 0;
6638 TYPE_LENGTH (type
) = 0;
6642 /* An ordinary record type (with fixed-length fields) that describes
6643 the value of type TYPE at VALADDR or ADDRESS (see comments at
6644 the beginning of this section) VAL according to GNAT conventions.
6645 DVAL0 should describe the (portion of a) record that contains any
6646 necessary discriminants. It should be NULL if value_type (VAL) is
6647 an outer-level type (i.e., as opposed to a branch of a variant.) A
6648 variant field (unless unchecked) is replaced by a particular branch
6651 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6652 length are not statically known are discarded. As a consequence,
6653 VALADDR, ADDRESS and DVAL0 are ignored.
6655 NOTE: Limitations: For now, we assume that dynamic fields and
6656 variants occupy whole numbers of bytes. However, they need not be
6660 ada_template_to_fixed_record_type_1 (struct type
*type
,
6661 const gdb_byte
*valaddr
,
6662 CORE_ADDR address
, struct value
*dval0
,
6663 int keep_dynamic_fields
)
6665 struct value
*mark
= value_mark ();
6668 int nfields
, bit_len
;
6671 int fld_bit_len
, bit_incr
;
6674 /* Compute the number of fields in this record type that are going
6675 to be processed: unless keep_dynamic_fields, this includes only
6676 fields whose position and length are static will be processed. */
6677 if (keep_dynamic_fields
)
6678 nfields
= TYPE_NFIELDS (type
);
6682 while (nfields
< TYPE_NFIELDS (type
)
6683 && !ada_is_variant_part (type
, nfields
)
6684 && !is_dynamic_field (type
, nfields
))
6688 rtype
= alloc_type (TYPE_OBJFILE (type
));
6689 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6690 INIT_CPLUS_SPECIFIC (rtype
);
6691 TYPE_NFIELDS (rtype
) = nfields
;
6692 TYPE_FIELDS (rtype
) = (struct field
*)
6693 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6694 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6695 TYPE_NAME (rtype
) = ada_type_name (type
);
6696 TYPE_TAG_NAME (rtype
) = NULL
;
6697 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6703 for (f
= 0; f
< nfields
; f
+= 1)
6705 off
= align_value (off
, field_alignment (type
, f
))
6706 + TYPE_FIELD_BITPOS (type
, f
);
6707 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6708 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6710 if (ada_is_variant_part (type
, f
))
6713 fld_bit_len
= bit_incr
= 0;
6715 else if (is_dynamic_field (type
, f
))
6718 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6722 /* Get the fixed type of the field. Note that, in this case, we
6723 do not want to get the real type out of the tag: if the current
6724 field is the parent part of a tagged record, we will get the
6725 tag of the object. Clearly wrong: the real type of the parent
6726 is not the real type of the child. We would end up in an infinite
6728 TYPE_FIELD_TYPE (rtype
, f
) =
6731 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6732 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6733 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6734 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6735 bit_incr
= fld_bit_len
=
6736 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6740 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6741 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6742 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6743 bit_incr
= fld_bit_len
=
6744 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6746 bit_incr
= fld_bit_len
=
6747 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6749 if (off
+ fld_bit_len
> bit_len
)
6750 bit_len
= off
+ fld_bit_len
;
6752 TYPE_LENGTH (rtype
) =
6753 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6756 /* We handle the variant part, if any, at the end because of certain
6757 odd cases in which it is re-ordered so as NOT the last field of
6758 the record. This can happen in the presence of representation
6760 if (variant_field
>= 0)
6762 struct type
*branch_type
;
6764 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6767 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6772 to_fixed_variant_branch_type
6773 (TYPE_FIELD_TYPE (type
, variant_field
),
6774 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6775 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6776 if (branch_type
== NULL
)
6778 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6779 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6780 TYPE_NFIELDS (rtype
) -= 1;
6784 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6785 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6787 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6789 if (off
+ fld_bit_len
> bit_len
)
6790 bit_len
= off
+ fld_bit_len
;
6791 TYPE_LENGTH (rtype
) =
6792 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6796 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6797 should contain the alignment of that record, which should be a strictly
6798 positive value. If null or negative, then something is wrong, most
6799 probably in the debug info. In that case, we don't round up the size
6800 of the resulting type. If this record is not part of another structure,
6801 the current RTYPE length might be good enough for our purposes. */
6802 if (TYPE_LENGTH (type
) <= 0)
6804 if (TYPE_NAME (rtype
))
6805 warning (_("Invalid type size for `%s' detected: %d."),
6806 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6808 warning (_("Invalid type size for <unnamed> detected: %d."),
6809 TYPE_LENGTH (type
));
6813 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6814 TYPE_LENGTH (type
));
6817 value_free_to_mark (mark
);
6818 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6819 error (_("record type with dynamic size is larger than varsize-limit"));
6823 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6826 static struct type
*
6827 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6828 CORE_ADDR address
, struct value
*dval0
)
6830 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6834 /* An ordinary record type in which ___XVL-convention fields and
6835 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6836 static approximations, containing all possible fields. Uses
6837 no runtime values. Useless for use in values, but that's OK,
6838 since the results are used only for type determinations. Works on both
6839 structs and unions. Representation note: to save space, we memorize
6840 the result of this function in the TYPE_TARGET_TYPE of the
6843 static struct type
*
6844 template_to_static_fixed_type (struct type
*type0
)
6850 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6851 return TYPE_TARGET_TYPE (type0
);
6853 nfields
= TYPE_NFIELDS (type0
);
6856 for (f
= 0; f
< nfields
; f
+= 1)
6858 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6859 struct type
*new_type
;
6861 if (is_dynamic_field (type0
, f
))
6862 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6864 new_type
= static_unwrap_type (field_type
);
6865 if (type
== type0
&& new_type
!= field_type
)
6867 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6868 TYPE_CODE (type
) = TYPE_CODE (type0
);
6869 INIT_CPLUS_SPECIFIC (type
);
6870 TYPE_NFIELDS (type
) = nfields
;
6871 TYPE_FIELDS (type
) = (struct field
*)
6872 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6873 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6874 sizeof (struct field
) * nfields
);
6875 TYPE_NAME (type
) = ada_type_name (type0
);
6876 TYPE_TAG_NAME (type
) = NULL
;
6877 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
6878 TYPE_LENGTH (type
) = 0;
6880 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6881 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6886 /* Given an object of type TYPE whose contents are at VALADDR and
6887 whose address in memory is ADDRESS, returns a revision of TYPE --
6888 a non-dynamic-sized record with a variant part -- in which
6889 the variant part is replaced with the appropriate branch. Looks
6890 for discriminant values in DVAL0, which can be NULL if the record
6891 contains the necessary discriminant values. */
6893 static struct type
*
6894 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6895 CORE_ADDR address
, struct value
*dval0
)
6897 struct value
*mark
= value_mark ();
6900 struct type
*branch_type
;
6901 int nfields
= TYPE_NFIELDS (type
);
6902 int variant_field
= variant_field_index (type
);
6904 if (variant_field
== -1)
6908 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6912 rtype
= alloc_type (TYPE_OBJFILE (type
));
6913 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6914 INIT_CPLUS_SPECIFIC (rtype
);
6915 TYPE_NFIELDS (rtype
) = nfields
;
6916 TYPE_FIELDS (rtype
) =
6917 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6918 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6919 sizeof (struct field
) * nfields
);
6920 TYPE_NAME (rtype
) = ada_type_name (type
);
6921 TYPE_TAG_NAME (rtype
) = NULL
;
6922 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6923 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
6925 branch_type
= to_fixed_variant_branch_type
6926 (TYPE_FIELD_TYPE (type
, variant_field
),
6927 cond_offset_host (valaddr
,
6928 TYPE_FIELD_BITPOS (type
, variant_field
)
6930 cond_offset_target (address
,
6931 TYPE_FIELD_BITPOS (type
, variant_field
)
6932 / TARGET_CHAR_BIT
), dval
);
6933 if (branch_type
== NULL
)
6936 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
6937 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6938 TYPE_NFIELDS (rtype
) -= 1;
6942 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6943 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6944 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
6945 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
6947 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
6949 value_free_to_mark (mark
);
6953 /* An ordinary record type (with fixed-length fields) that describes
6954 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
6955 beginning of this section]. Any necessary discriminants' values
6956 should be in DVAL, a record value; it may be NULL if the object
6957 at ADDR itself contains any necessary discriminant values.
6958 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
6959 values from the record are needed. Except in the case that DVAL,
6960 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
6961 unchecked) is replaced by a particular branch of the variant.
6963 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
6964 is questionable and may be removed. It can arise during the
6965 processing of an unconstrained-array-of-record type where all the
6966 variant branches have exactly the same size. This is because in
6967 such cases, the compiler does not bother to use the XVS convention
6968 when encoding the record. I am currently dubious of this
6969 shortcut and suspect the compiler should be altered. FIXME. */
6971 static struct type
*
6972 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
6973 CORE_ADDR address
, struct value
*dval
)
6975 struct type
*templ_type
;
6977 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
6980 templ_type
= dynamic_template_type (type0
);
6982 if (templ_type
!= NULL
)
6983 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
6984 else if (variant_field_index (type0
) >= 0)
6986 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
6988 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
6993 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
6999 /* An ordinary record type (with fixed-length fields) that describes
7000 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7001 union type. Any necessary discriminants' values should be in DVAL,
7002 a record value. That is, this routine selects the appropriate
7003 branch of the union at ADDR according to the discriminant value
7004 indicated in the union's type name. */
7006 static struct type
*
7007 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7008 CORE_ADDR address
, struct value
*dval
)
7011 struct type
*templ_type
;
7012 struct type
*var_type
;
7014 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7015 var_type
= TYPE_TARGET_TYPE (var_type0
);
7017 var_type
= var_type0
;
7019 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7021 if (templ_type
!= NULL
)
7022 var_type
= templ_type
;
7025 ada_which_variant_applies (var_type
,
7026 value_type (dval
), value_contents (dval
));
7029 return empty_record (TYPE_OBJFILE (var_type
));
7030 else if (is_dynamic_field (var_type
, which
))
7031 return to_fixed_record_type
7032 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7033 valaddr
, address
, dval
);
7034 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7036 to_fixed_record_type
7037 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7039 return TYPE_FIELD_TYPE (var_type
, which
);
7042 /* Assuming that TYPE0 is an array type describing the type of a value
7043 at ADDR, and that DVAL describes a record containing any
7044 discriminants used in TYPE0, returns a type for the value that
7045 contains no dynamic components (that is, no components whose sizes
7046 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7047 true, gives an error message if the resulting type's size is over
7050 static struct type
*
7051 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7054 struct type
*index_type_desc
;
7055 struct type
*result
;
7057 if (ada_is_packed_array_type (type0
) /* revisit? */
7058 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7061 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7062 if (index_type_desc
== NULL
)
7064 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7065 /* NOTE: elt_type---the fixed version of elt_type0---should never
7066 depend on the contents of the array in properly constructed
7068 /* Create a fixed version of the array element type.
7069 We're not providing the address of an element here,
7070 and thus the actual object value cannot be inspected to do
7071 the conversion. This should not be a problem, since arrays of
7072 unconstrained objects are not allowed. In particular, all
7073 the elements of an array of a tagged type should all be of
7074 the same type specified in the debugging info. No need to
7075 consult the object tag. */
7076 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7078 if (elt_type0
== elt_type
)
7081 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7082 elt_type
, TYPE_INDEX_TYPE (type0
));
7087 struct type
*elt_type0
;
7090 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7091 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7093 /* NOTE: result---the fixed version of elt_type0---should never
7094 depend on the contents of the array in properly constructed
7096 /* Create a fixed version of the array element type.
7097 We're not providing the address of an element here,
7098 and thus the actual object value cannot be inspected to do
7099 the conversion. This should not be a problem, since arrays of
7100 unconstrained objects are not allowed. In particular, all
7101 the elements of an array of a tagged type should all be of
7102 the same type specified in the debugging info. No need to
7103 consult the object tag. */
7105 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7106 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7108 struct type
*range_type
=
7109 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7110 dval
, TYPE_OBJFILE (type0
));
7111 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7112 result
, range_type
);
7114 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7115 error (_("array type with dynamic size is larger than varsize-limit"));
7118 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7123 /* A standard type (containing no dynamically sized components)
7124 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7125 DVAL describes a record containing any discriminants used in TYPE0,
7126 and may be NULL if there are none, or if the object of type TYPE at
7127 ADDRESS or in VALADDR contains these discriminants.
7129 If CHECK_TAG is not null, in the case of tagged types, this function
7130 attempts to locate the object's tag and use it to compute the actual
7131 type. However, when ADDRESS is null, we cannot use it to determine the
7132 location of the tag, and therefore compute the tagged type's actual type.
7133 So we return the tagged type without consulting the tag. */
7135 static struct type
*
7136 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7137 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7139 type
= ada_check_typedef (type
);
7140 switch (TYPE_CODE (type
))
7144 case TYPE_CODE_STRUCT
:
7146 struct type
*static_type
= to_static_fixed_type (type
);
7147 struct type
*fixed_record_type
=
7148 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7149 /* If STATIC_TYPE is a tagged type and we know the object's address,
7150 then we can determine its tag, and compute the object's actual
7151 type from there. Note that we have to use the fixed record
7152 type (the parent part of the record may have dynamic fields
7153 and the way the location of _tag is expressed may depend on
7156 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7158 struct type
*real_type
=
7159 type_from_tag (value_tag_from_contents_and_address
7163 if (real_type
!= NULL
)
7164 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7166 return fixed_record_type
;
7168 case TYPE_CODE_ARRAY
:
7169 return to_fixed_array_type (type
, dval
, 1);
7170 case TYPE_CODE_UNION
:
7174 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7178 /* The same as ada_to_fixed_type_1, except that it preserves the type
7179 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7180 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7183 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7184 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7187 struct type
*fixed_type
=
7188 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7190 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7191 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7197 /* A standard (static-sized) type corresponding as well as possible to
7198 TYPE0, but based on no runtime data. */
7200 static struct type
*
7201 to_static_fixed_type (struct type
*type0
)
7208 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7211 type0
= ada_check_typedef (type0
);
7213 switch (TYPE_CODE (type0
))
7217 case TYPE_CODE_STRUCT
:
7218 type
= dynamic_template_type (type0
);
7220 return template_to_static_fixed_type (type
);
7222 return template_to_static_fixed_type (type0
);
7223 case TYPE_CODE_UNION
:
7224 type
= ada_find_parallel_type (type0
, "___XVU");
7226 return template_to_static_fixed_type (type
);
7228 return template_to_static_fixed_type (type0
);
7232 /* A static approximation of TYPE with all type wrappers removed. */
7234 static struct type
*
7235 static_unwrap_type (struct type
*type
)
7237 if (ada_is_aligner_type (type
))
7239 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7240 if (ada_type_name (type1
) == NULL
)
7241 TYPE_NAME (type1
) = ada_type_name (type
);
7243 return static_unwrap_type (type1
);
7247 struct type
*raw_real_type
= ada_get_base_type (type
);
7248 if (raw_real_type
== type
)
7251 return to_static_fixed_type (raw_real_type
);
7255 /* In some cases, incomplete and private types require
7256 cross-references that are not resolved as records (for example,
7258 type FooP is access Foo;
7260 type Foo is array ...;
7261 ). In these cases, since there is no mechanism for producing
7262 cross-references to such types, we instead substitute for FooP a
7263 stub enumeration type that is nowhere resolved, and whose tag is
7264 the name of the actual type. Call these types "non-record stubs". */
7266 /* A type equivalent to TYPE that is not a non-record stub, if one
7267 exists, otherwise TYPE. */
7270 ada_check_typedef (struct type
*type
)
7272 CHECK_TYPEDEF (type
);
7273 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7274 || !TYPE_STUB (type
)
7275 || TYPE_TAG_NAME (type
) == NULL
)
7279 char *name
= TYPE_TAG_NAME (type
);
7280 struct type
*type1
= ada_find_any_type (name
);
7281 return (type1
== NULL
) ? type
: type1
;
7285 /* A value representing the data at VALADDR/ADDRESS as described by
7286 type TYPE0, but with a standard (static-sized) type that correctly
7287 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7288 type, then return VAL0 [this feature is simply to avoid redundant
7289 creation of struct values]. */
7291 static struct value
*
7292 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7295 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7296 if (type
== type0
&& val0
!= NULL
)
7299 return value_from_contents_and_address (type
, 0, address
);
7302 /* A value representing VAL, but with a standard (static-sized) type
7303 that correctly describes it. Does not necessarily create a new
7306 static struct value
*
7307 ada_to_fixed_value (struct value
*val
)
7309 return ada_to_fixed_value_create (value_type (val
),
7310 VALUE_ADDRESS (val
) + value_offset (val
),
7314 /* A value representing VAL, but with a standard (static-sized) type
7315 chosen to approximate the real type of VAL as well as possible, but
7316 without consulting any runtime values. For Ada dynamic-sized
7317 types, therefore, the type of the result is likely to be inaccurate. */
7320 ada_to_static_fixed_value (struct value
*val
)
7323 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7324 if (type
== value_type (val
))
7327 return coerce_unspec_val_to_type (val
, type
);
7333 /* Table mapping attribute numbers to names.
7334 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7336 static const char *attribute_names
[] = {
7354 ada_attribute_name (enum exp_opcode n
)
7356 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7357 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7359 return attribute_names
[0];
7362 /* Evaluate the 'POS attribute applied to ARG. */
7365 pos_atr (struct value
*arg
)
7367 struct type
*type
= value_type (arg
);
7369 if (!discrete_type_p (type
))
7370 error (_("'POS only defined on discrete types"));
7372 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7375 LONGEST v
= value_as_long (arg
);
7377 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7379 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7382 error (_("enumeration value is invalid: can't find 'POS"));
7385 return value_as_long (arg
);
7388 static struct value
*
7389 value_pos_atr (struct value
*arg
)
7391 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7394 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7396 static struct value
*
7397 value_val_atr (struct type
*type
, struct value
*arg
)
7399 if (!discrete_type_p (type
))
7400 error (_("'VAL only defined on discrete types"));
7401 if (!integer_type_p (value_type (arg
)))
7402 error (_("'VAL requires integral argument"));
7404 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7406 long pos
= value_as_long (arg
);
7407 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7408 error (_("argument to 'VAL out of range"));
7409 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7412 return value_from_longest (type
, value_as_long (arg
));
7418 /* True if TYPE appears to be an Ada character type.
7419 [At the moment, this is true only for Character and Wide_Character;
7420 It is a heuristic test that could stand improvement]. */
7423 ada_is_character_type (struct type
*type
)
7427 /* If the type code says it's a character, then assume it really is,
7428 and don't check any further. */
7429 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7432 /* Otherwise, assume it's a character type iff it is a discrete type
7433 with a known character type name. */
7434 name
= ada_type_name (type
);
7435 return (name
!= NULL
7436 && (TYPE_CODE (type
) == TYPE_CODE_INT
7437 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7438 && (strcmp (name
, "character") == 0
7439 || strcmp (name
, "wide_character") == 0
7440 || strcmp (name
, "wide_wide_character") == 0
7441 || strcmp (name
, "unsigned char") == 0));
7444 /* True if TYPE appears to be an Ada string type. */
7447 ada_is_string_type (struct type
*type
)
7449 type
= ada_check_typedef (type
);
7451 && TYPE_CODE (type
) != TYPE_CODE_PTR
7452 && (ada_is_simple_array_type (type
)
7453 || ada_is_array_descriptor_type (type
))
7454 && ada_array_arity (type
) == 1)
7456 struct type
*elttype
= ada_array_element_type (type
, 1);
7458 return ada_is_character_type (elttype
);
7465 /* True if TYPE is a struct type introduced by the compiler to force the
7466 alignment of a value. Such types have a single field with a
7467 distinctive name. */
7470 ada_is_aligner_type (struct type
*type
)
7472 type
= ada_check_typedef (type
);
7474 /* If we can find a parallel XVS type, then the XVS type should
7475 be used instead of this type. And hence, this is not an aligner
7477 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7480 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7481 && TYPE_NFIELDS (type
) == 1
7482 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7485 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7486 the parallel type. */
7489 ada_get_base_type (struct type
*raw_type
)
7491 struct type
*real_type_namer
;
7492 struct type
*raw_real_type
;
7494 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7497 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7498 if (real_type_namer
== NULL
7499 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7500 || TYPE_NFIELDS (real_type_namer
) != 1)
7503 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7504 if (raw_real_type
== NULL
)
7507 return raw_real_type
;
7510 /* The type of value designated by TYPE, with all aligners removed. */
7513 ada_aligned_type (struct type
*type
)
7515 if (ada_is_aligner_type (type
))
7516 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7518 return ada_get_base_type (type
);
7522 /* The address of the aligned value in an object at address VALADDR
7523 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7526 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7528 if (ada_is_aligner_type (type
))
7529 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7531 TYPE_FIELD_BITPOS (type
,
7532 0) / TARGET_CHAR_BIT
);
7539 /* The printed representation of an enumeration literal with encoded
7540 name NAME. The value is good to the next call of ada_enum_name. */
7542 ada_enum_name (const char *name
)
7544 static char *result
;
7545 static size_t result_len
= 0;
7548 /* First, unqualify the enumeration name:
7549 1. Search for the last '.' character. If we find one, then skip
7550 all the preceeding characters, the unqualified name starts
7551 right after that dot.
7552 2. Otherwise, we may be debugging on a target where the compiler
7553 translates dots into "__". Search forward for double underscores,
7554 but stop searching when we hit an overloading suffix, which is
7555 of the form "__" followed by digits. */
7557 tmp
= strrchr (name
, '.');
7562 while ((tmp
= strstr (name
, "__")) != NULL
)
7564 if (isdigit (tmp
[2]))
7574 if (name
[1] == 'U' || name
[1] == 'W')
7576 if (sscanf (name
+ 2, "%x", &v
) != 1)
7582 GROW_VECT (result
, result_len
, 16);
7583 if (isascii (v
) && isprint (v
))
7584 sprintf (result
, "'%c'", v
);
7585 else if (name
[1] == 'U')
7586 sprintf (result
, "[\"%02x\"]", v
);
7588 sprintf (result
, "[\"%04x\"]", v
);
7594 tmp
= strstr (name
, "__");
7596 tmp
= strstr (name
, "$");
7599 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7600 strncpy (result
, name
, tmp
- name
);
7601 result
[tmp
- name
] = '\0';
7609 static struct value
*
7610 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7613 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7614 (expect_type
, exp
, pos
, noside
);
7617 /* Evaluate the subexpression of EXP starting at *POS as for
7618 evaluate_type, updating *POS to point just past the evaluated
7621 static struct value
*
7622 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7624 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7625 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7628 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7631 static struct value
*
7632 unwrap_value (struct value
*val
)
7634 struct type
*type
= ada_check_typedef (value_type (val
));
7635 if (ada_is_aligner_type (type
))
7637 struct value
*v
= value_struct_elt (&val
, NULL
, "F",
7638 NULL
, "internal structure");
7639 struct type
*val_type
= ada_check_typedef (value_type (v
));
7640 if (ada_type_name (val_type
) == NULL
)
7641 TYPE_NAME (val_type
) = ada_type_name (type
);
7643 return unwrap_value (v
);
7647 struct type
*raw_real_type
=
7648 ada_check_typedef (ada_get_base_type (type
));
7650 if (type
== raw_real_type
)
7654 coerce_unspec_val_to_type
7655 (val
, ada_to_fixed_type (raw_real_type
, 0,
7656 VALUE_ADDRESS (val
) + value_offset (val
),
7661 static struct value
*
7662 cast_to_fixed (struct type
*type
, struct value
*arg
)
7666 if (type
== value_type (arg
))
7668 else if (ada_is_fixed_point_type (value_type (arg
)))
7669 val
= ada_float_to_fixed (type
,
7670 ada_fixed_to_float (value_type (arg
),
7671 value_as_long (arg
)));
7675 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7676 val
= ada_float_to_fixed (type
, argd
);
7679 return value_from_longest (type
, val
);
7682 static struct value
*
7683 cast_from_fixed_to_double (struct value
*arg
)
7685 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7686 value_as_long (arg
));
7687 return value_from_double (builtin_type_double
, val
);
7690 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7691 return the converted value. */
7693 static struct value
*
7694 coerce_for_assign (struct type
*type
, struct value
*val
)
7696 struct type
*type2
= value_type (val
);
7700 type2
= ada_check_typedef (type2
);
7701 type
= ada_check_typedef (type
);
7703 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7704 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7706 val
= ada_value_ind (val
);
7707 type2
= value_type (val
);
7710 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7711 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7713 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7714 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7715 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7716 error (_("Incompatible types in assignment"));
7717 deprecated_set_value_type (val
, type
);
7722 static struct value
*
7723 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7726 struct type
*type1
, *type2
;
7729 arg1
= coerce_ref (arg1
);
7730 arg2
= coerce_ref (arg2
);
7731 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7732 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7734 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7735 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7736 return value_binop (arg1
, arg2
, op
);
7745 return value_binop (arg1
, arg2
, op
);
7748 v2
= value_as_long (arg2
);
7750 error (_("second operand of %s must not be zero."), op_string (op
));
7752 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7753 return value_binop (arg1
, arg2
, op
);
7755 v1
= value_as_long (arg1
);
7760 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7761 v
+= v
> 0 ? -1 : 1;
7769 /* Should not reach this point. */
7773 val
= allocate_value (type1
);
7774 store_unsigned_integer (value_contents_raw (val
),
7775 TYPE_LENGTH (value_type (val
)), v
);
7780 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7782 if (ada_is_direct_array_type (value_type (arg1
))
7783 || ada_is_direct_array_type (value_type (arg2
)))
7785 /* Automatically dereference any array reference before
7786 we attempt to perform the comparison. */
7787 arg1
= ada_coerce_ref (arg1
);
7788 arg2
= ada_coerce_ref (arg2
);
7790 arg1
= ada_coerce_to_simple_array (arg1
);
7791 arg2
= ada_coerce_to_simple_array (arg2
);
7792 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7793 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7794 error (_("Attempt to compare array with non-array"));
7795 /* FIXME: The following works only for types whose
7796 representations use all bits (no padding or undefined bits)
7797 and do not have user-defined equality. */
7799 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7800 && memcmp (value_contents (arg1
), value_contents (arg2
),
7801 TYPE_LENGTH (value_type (arg1
))) == 0;
7803 return value_equal (arg1
, arg2
);
7806 /* Total number of component associations in the aggregate starting at
7807 index PC in EXP. Assumes that index PC is the start of an
7811 num_component_specs (struct expression
*exp
, int pc
)
7814 m
= exp
->elts
[pc
+ 1].longconst
;
7817 for (i
= 0; i
< m
; i
+= 1)
7819 switch (exp
->elts
[pc
].opcode
)
7825 n
+= exp
->elts
[pc
+ 1].longconst
;
7828 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7833 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7834 component of LHS (a simple array or a record), updating *POS past
7835 the expression, assuming that LHS is contained in CONTAINER. Does
7836 not modify the inferior's memory, nor does it modify LHS (unless
7837 LHS == CONTAINER). */
7840 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7841 struct expression
*exp
, int *pos
)
7843 struct value
*mark
= value_mark ();
7845 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7847 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
7848 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7852 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7853 elt
= ada_to_fixed_value (unwrap_value (elt
));
7856 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7857 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7859 value_assign_to_component (container
, elt
,
7860 ada_evaluate_subexp (NULL
, exp
, pos
,
7863 value_free_to_mark (mark
);
7866 /* Assuming that LHS represents an lvalue having a record or array
7867 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7868 of that aggregate's value to LHS, advancing *POS past the
7869 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7870 lvalue containing LHS (possibly LHS itself). Does not modify
7871 the inferior's memory, nor does it modify the contents of
7872 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7874 static struct value
*
7875 assign_aggregate (struct value
*container
,
7876 struct value
*lhs
, struct expression
*exp
,
7877 int *pos
, enum noside noside
)
7879 struct type
*lhs_type
;
7880 int n
= exp
->elts
[*pos
+1].longconst
;
7881 LONGEST low_index
, high_index
;
7884 int max_indices
, num_indices
;
7885 int is_array_aggregate
;
7887 struct value
*mark
= value_mark ();
7890 if (noside
!= EVAL_NORMAL
)
7893 for (i
= 0; i
< n
; i
+= 1)
7894 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
7898 container
= ada_coerce_ref (container
);
7899 if (ada_is_direct_array_type (value_type (container
)))
7900 container
= ada_coerce_to_simple_array (container
);
7901 lhs
= ada_coerce_ref (lhs
);
7902 if (!deprecated_value_modifiable (lhs
))
7903 error (_("Left operand of assignment is not a modifiable lvalue."));
7905 lhs_type
= value_type (lhs
);
7906 if (ada_is_direct_array_type (lhs_type
))
7908 lhs
= ada_coerce_to_simple_array (lhs
);
7909 lhs_type
= value_type (lhs
);
7910 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
7911 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
7912 is_array_aggregate
= 1;
7914 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
7917 high_index
= num_visible_fields (lhs_type
) - 1;
7918 is_array_aggregate
= 0;
7921 error (_("Left-hand side must be array or record."));
7923 num_specs
= num_component_specs (exp
, *pos
- 3);
7924 max_indices
= 4 * num_specs
+ 4;
7925 indices
= alloca (max_indices
* sizeof (indices
[0]));
7926 indices
[0] = indices
[1] = low_index
- 1;
7927 indices
[2] = indices
[3] = high_index
+ 1;
7930 for (i
= 0; i
< n
; i
+= 1)
7932 switch (exp
->elts
[*pos
].opcode
)
7935 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
7936 &num_indices
, max_indices
,
7937 low_index
, high_index
);
7940 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
7941 &num_indices
, max_indices
,
7942 low_index
, high_index
);
7946 error (_("Misplaced 'others' clause"));
7947 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
7948 num_indices
, low_index
, high_index
);
7951 error (_("Internal error: bad aggregate clause"));
7958 /* Assign into the component of LHS indexed by the OP_POSITIONAL
7959 construct at *POS, updating *POS past the construct, given that
7960 the positions are relative to lower bound LOW, where HIGH is the
7961 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
7962 updating *NUM_INDICES as needed. CONTAINER is as for
7963 assign_aggregate. */
7965 aggregate_assign_positional (struct value
*container
,
7966 struct value
*lhs
, struct expression
*exp
,
7967 int *pos
, LONGEST
*indices
, int *num_indices
,
7968 int max_indices
, LONGEST low
, LONGEST high
)
7970 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
7972 if (ind
- 1 == high
)
7973 warning (_("Extra components in aggregate ignored."));
7976 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
7978 assign_component (container
, lhs
, ind
, exp
, pos
);
7981 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7984 /* Assign into the components of LHS indexed by the OP_CHOICES
7985 construct at *POS, updating *POS past the construct, given that
7986 the allowable indices are LOW..HIGH. Record the indices assigned
7987 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
7988 needed. CONTAINER is as for assign_aggregate. */
7990 aggregate_assign_from_choices (struct value
*container
,
7991 struct value
*lhs
, struct expression
*exp
,
7992 int *pos
, LONGEST
*indices
, int *num_indices
,
7993 int max_indices
, LONGEST low
, LONGEST high
)
7996 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
7997 int choice_pos
, expr_pc
;
7998 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8000 choice_pos
= *pos
+= 3;
8002 for (j
= 0; j
< n_choices
; j
+= 1)
8003 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8005 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8007 for (j
= 0; j
< n_choices
; j
+= 1)
8009 LONGEST lower
, upper
;
8010 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8011 if (op
== OP_DISCRETE_RANGE
)
8014 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8016 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8021 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8032 name
= &exp
->elts
[choice_pos
+ 2].string
;
8035 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8038 error (_("Invalid record component association."));
8040 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8042 if (! find_struct_field (name
, value_type (lhs
), 0,
8043 NULL
, NULL
, NULL
, NULL
, &ind
))
8044 error (_("Unknown component name: %s."), name
);
8045 lower
= upper
= ind
;
8048 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8049 error (_("Index in component association out of bounds."));
8051 add_component_interval (lower
, upper
, indices
, num_indices
,
8053 while (lower
<= upper
)
8057 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8063 /* Assign the value of the expression in the OP_OTHERS construct in
8064 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8065 have not been previously assigned. The index intervals already assigned
8066 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8067 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8069 aggregate_assign_others (struct value
*container
,
8070 struct value
*lhs
, struct expression
*exp
,
8071 int *pos
, LONGEST
*indices
, int num_indices
,
8072 LONGEST low
, LONGEST high
)
8075 int expr_pc
= *pos
+1;
8077 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8080 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8084 assign_component (container
, lhs
, ind
, exp
, &pos
);
8087 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8090 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8091 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8092 modifying *SIZE as needed. It is an error if *SIZE exceeds
8093 MAX_SIZE. The resulting intervals do not overlap. */
8095 add_component_interval (LONGEST low
, LONGEST high
,
8096 LONGEST
* indices
, int *size
, int max_size
)
8099 for (i
= 0; i
< *size
; i
+= 2) {
8100 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8103 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8104 if (high
< indices
[kh
])
8106 if (low
< indices
[i
])
8108 indices
[i
+ 1] = indices
[kh
- 1];
8109 if (high
> indices
[i
+ 1])
8110 indices
[i
+ 1] = high
;
8111 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8112 *size
-= kh
- i
- 2;
8115 else if (high
< indices
[i
])
8119 if (*size
== max_size
)
8120 error (_("Internal error: miscounted aggregate components."));
8122 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8123 indices
[j
] = indices
[j
- 2];
8125 indices
[i
+ 1] = high
;
8128 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8131 static struct value
*
8132 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8134 if (type
== ada_check_typedef (value_type (arg2
)))
8137 if (ada_is_fixed_point_type (type
))
8138 return (cast_to_fixed (type
, arg2
));
8140 if (ada_is_fixed_point_type (value_type (arg2
)))
8141 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8143 return value_cast (type
, arg2
);
8146 static struct value
*
8147 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8148 int *pos
, enum noside noside
)
8151 int tem
, tem2
, tem3
;
8153 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8156 struct value
**argvec
;
8160 op
= exp
->elts
[pc
].opcode
;
8166 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8167 arg1
= unwrap_value (arg1
);
8169 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8170 then we need to perform the conversion manually, because
8171 evaluate_subexp_standard doesn't do it. This conversion is
8172 necessary in Ada because the different kinds of float/fixed
8173 types in Ada have different representations.
8175 Similarly, we need to perform the conversion from OP_LONG
8177 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8178 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8184 struct value
*result
;
8186 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8187 /* The result type will have code OP_STRING, bashed there from
8188 OP_ARRAY. Bash it back. */
8189 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8190 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8196 type
= exp
->elts
[pc
+ 1].type
;
8197 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8198 if (noside
== EVAL_SKIP
)
8200 arg1
= ada_value_cast (type
, arg1
, noside
);
8205 type
= exp
->elts
[pc
+ 1].type
;
8206 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8209 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8210 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8212 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8213 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8215 return ada_value_assign (arg1
, arg1
);
8217 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8218 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8220 if (ada_is_fixed_point_type (value_type (arg1
)))
8221 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8222 else if (ada_is_fixed_point_type (value_type (arg2
)))
8224 (_("Fixed-point values must be assigned to fixed-point variables"));
8226 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8227 return ada_value_assign (arg1
, arg2
);
8230 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8231 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8232 if (noside
== EVAL_SKIP
)
8234 if ((ada_is_fixed_point_type (value_type (arg1
))
8235 || ada_is_fixed_point_type (value_type (arg2
)))
8236 && value_type (arg1
) != value_type (arg2
))
8237 error (_("Operands of fixed-point addition must have the same type"));
8238 /* Do the addition, and cast the result to the type of the first
8239 argument. We cannot cast the result to a reference type, so if
8240 ARG1 is a reference type, find its underlying type. */
8241 type
= value_type (arg1
);
8242 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8243 type
= TYPE_TARGET_TYPE (type
);
8244 return value_cast (type
, value_add (arg1
, arg2
));
8247 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8248 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8249 if (noside
== EVAL_SKIP
)
8251 if ((ada_is_fixed_point_type (value_type (arg1
))
8252 || ada_is_fixed_point_type (value_type (arg2
)))
8253 && value_type (arg1
) != value_type (arg2
))
8254 error (_("Operands of fixed-point subtraction must have the same type"));
8255 /* Do the substraction, and cast the result to the type of the first
8256 argument. We cannot cast the result to a reference type, so if
8257 ARG1 is a reference type, find its underlying type. */
8258 type
= value_type (arg1
);
8259 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8260 type
= TYPE_TARGET_TYPE (type
);
8261 return value_cast (type
, value_sub (arg1
, arg2
));
8265 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8266 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8267 if (noside
== EVAL_SKIP
)
8269 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8270 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8271 return value_zero (value_type (arg1
), not_lval
);
8274 if (ada_is_fixed_point_type (value_type (arg1
)))
8275 arg1
= cast_from_fixed_to_double (arg1
);
8276 if (ada_is_fixed_point_type (value_type (arg2
)))
8277 arg2
= cast_from_fixed_to_double (arg2
);
8278 return ada_value_binop (arg1
, arg2
, op
);
8283 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8284 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8285 if (noside
== EVAL_SKIP
)
8287 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8288 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8289 return value_zero (value_type (arg1
), not_lval
);
8291 return ada_value_binop (arg1
, arg2
, op
);
8294 case BINOP_NOTEQUAL
:
8295 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8296 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8297 if (noside
== EVAL_SKIP
)
8299 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8302 tem
= ada_value_equal (arg1
, arg2
);
8303 if (op
== BINOP_NOTEQUAL
)
8305 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8308 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8309 if (noside
== EVAL_SKIP
)
8311 else if (ada_is_fixed_point_type (value_type (arg1
)))
8312 return value_cast (value_type (arg1
), value_neg (arg1
));
8314 return value_neg (arg1
);
8316 case BINOP_LOGICAL_AND
:
8317 case BINOP_LOGICAL_OR
:
8318 case UNOP_LOGICAL_NOT
:
8323 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8324 return value_cast (LA_BOOL_TYPE
, val
);
8327 case BINOP_BITWISE_AND
:
8328 case BINOP_BITWISE_IOR
:
8329 case BINOP_BITWISE_XOR
:
8333 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8335 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8337 return value_cast (value_type (arg1
), val
);
8342 if (noside
== EVAL_SKIP
)
8347 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8348 /* Only encountered when an unresolved symbol occurs in a
8349 context other than a function call, in which case, it is
8351 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8352 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8353 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8357 (to_static_fixed_type
8358 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8364 unwrap_value (evaluate_subexp_standard
8365 (expect_type
, exp
, pos
, noside
));
8366 return ada_to_fixed_value (arg1
);
8372 /* Allocate arg vector, including space for the function to be
8373 called in argvec[0] and a terminating NULL. */
8374 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8376 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8378 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8379 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8380 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8381 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8384 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8385 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8388 if (noside
== EVAL_SKIP
)
8392 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8393 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8394 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8395 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8396 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8397 argvec
[0] = value_addr (argvec
[0]);
8399 type
= ada_check_typedef (value_type (argvec
[0]));
8400 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8402 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8404 case TYPE_CODE_FUNC
:
8405 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8407 case TYPE_CODE_ARRAY
:
8409 case TYPE_CODE_STRUCT
:
8410 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8411 argvec
[0] = ada_value_ind (argvec
[0]);
8412 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8415 error (_("cannot subscript or call something of type `%s'"),
8416 ada_type_name (value_type (argvec
[0])));
8421 switch (TYPE_CODE (type
))
8423 case TYPE_CODE_FUNC
:
8424 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8425 return allocate_value (TYPE_TARGET_TYPE (type
));
8426 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8427 case TYPE_CODE_STRUCT
:
8431 arity
= ada_array_arity (type
);
8432 type
= ada_array_element_type (type
, nargs
);
8434 error (_("cannot subscript or call a record"));
8436 error (_("wrong number of subscripts; expecting %d"), arity
);
8437 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8438 return value_zero (ada_aligned_type (type
), lval_memory
);
8440 unwrap_value (ada_value_subscript
8441 (argvec
[0], nargs
, argvec
+ 1));
8443 case TYPE_CODE_ARRAY
:
8444 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8446 type
= ada_array_element_type (type
, nargs
);
8448 error (_("element type of array unknown"));
8450 return value_zero (ada_aligned_type (type
), lval_memory
);
8453 unwrap_value (ada_value_subscript
8454 (ada_coerce_to_simple_array (argvec
[0]),
8455 nargs
, argvec
+ 1));
8456 case TYPE_CODE_PTR
: /* Pointer to array */
8457 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8458 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8460 type
= ada_array_element_type (type
, nargs
);
8462 error (_("element type of array unknown"));
8464 return value_zero (ada_aligned_type (type
), lval_memory
);
8467 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8468 nargs
, argvec
+ 1));
8471 error (_("Attempt to index or call something other than an "
8472 "array or function"));
8477 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8478 struct value
*low_bound_val
=
8479 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8480 struct value
*high_bound_val
=
8481 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8484 low_bound_val
= coerce_ref (low_bound_val
);
8485 high_bound_val
= coerce_ref (high_bound_val
);
8486 low_bound
= pos_atr (low_bound_val
);
8487 high_bound
= pos_atr (high_bound_val
);
8489 if (noside
== EVAL_SKIP
)
8492 /* If this is a reference to an aligner type, then remove all
8494 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8495 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8496 TYPE_TARGET_TYPE (value_type (array
)) =
8497 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8499 if (ada_is_packed_array_type (value_type (array
)))
8500 error (_("cannot slice a packed array"));
8502 /* If this is a reference to an array or an array lvalue,
8503 convert to a pointer. */
8504 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8505 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8506 && VALUE_LVAL (array
) == lval_memory
))
8507 array
= value_addr (array
);
8509 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8510 && ada_is_array_descriptor_type (ada_check_typedef
8511 (value_type (array
))))
8512 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8514 array
= ada_coerce_to_simple_array_ptr (array
);
8516 /* If we have more than one level of pointer indirection,
8517 dereference the value until we get only one level. */
8518 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8519 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8521 array
= value_ind (array
);
8523 /* Make sure we really do have an array type before going further,
8524 to avoid a SEGV when trying to get the index type or the target
8525 type later down the road if the debug info generated by
8526 the compiler is incorrect or incomplete. */
8527 if (!ada_is_simple_array_type (value_type (array
)))
8528 error (_("cannot take slice of non-array"));
8530 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8532 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8533 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8537 struct type
*arr_type0
=
8538 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8540 return ada_value_slice_ptr (array
, arr_type0
,
8541 longest_to_int (low_bound
),
8542 longest_to_int (high_bound
));
8545 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8547 else if (high_bound
< low_bound
)
8548 return empty_array (value_type (array
), low_bound
);
8550 return ada_value_slice (array
, longest_to_int (low_bound
),
8551 longest_to_int (high_bound
));
8556 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8557 type
= exp
->elts
[pc
+ 1].type
;
8559 if (noside
== EVAL_SKIP
)
8562 switch (TYPE_CODE (type
))
8565 lim_warning (_("Membership test incompletely implemented; "
8566 "always returns true"));
8567 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8569 case TYPE_CODE_RANGE
:
8570 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8571 arg3
= value_from_longest (builtin_type_int
,
8572 TYPE_HIGH_BOUND (type
));
8574 value_from_longest (builtin_type_int
,
8575 (value_less (arg1
, arg3
)
8576 || value_equal (arg1
, arg3
))
8577 && (value_less (arg2
, arg1
)
8578 || value_equal (arg2
, arg1
)));
8581 case BINOP_IN_BOUNDS
:
8583 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8584 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8586 if (noside
== EVAL_SKIP
)
8589 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8590 return value_zero (builtin_type_int
, not_lval
);
8592 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8594 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8595 error (_("invalid dimension number to 'range"));
8597 arg3
= ada_array_bound (arg2
, tem
, 1);
8598 arg2
= ada_array_bound (arg2
, tem
, 0);
8601 value_from_longest (builtin_type_int
,
8602 (value_less (arg1
, arg3
)
8603 || value_equal (arg1
, arg3
))
8604 && (value_less (arg2
, arg1
)
8605 || value_equal (arg2
, arg1
)));
8607 case TERNOP_IN_RANGE
:
8608 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8609 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8610 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8612 if (noside
== EVAL_SKIP
)
8616 value_from_longest (builtin_type_int
,
8617 (value_less (arg1
, arg3
)
8618 || value_equal (arg1
, arg3
))
8619 && (value_less (arg2
, arg1
)
8620 || value_equal (arg2
, arg1
)));
8626 struct type
*type_arg
;
8627 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8629 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8631 type_arg
= exp
->elts
[pc
+ 2].type
;
8635 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8639 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8640 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8641 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8644 if (noside
== EVAL_SKIP
)
8647 if (type_arg
== NULL
)
8649 arg1
= ada_coerce_ref (arg1
);
8651 if (ada_is_packed_array_type (value_type (arg1
)))
8652 arg1
= ada_coerce_to_simple_array (arg1
);
8654 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8655 error (_("invalid dimension number to '%s"),
8656 ada_attribute_name (op
));
8658 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8660 type
= ada_index_type (value_type (arg1
), tem
);
8663 (_("attempt to take bound of something that is not an array"));
8664 return allocate_value (type
);
8669 default: /* Should never happen. */
8670 error (_("unexpected attribute encountered"));
8672 return ada_array_bound (arg1
, tem
, 0);
8674 return ada_array_bound (arg1
, tem
, 1);
8676 return ada_array_length (arg1
, tem
);
8679 else if (discrete_type_p (type_arg
))
8681 struct type
*range_type
;
8682 char *name
= ada_type_name (type_arg
);
8684 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8686 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8687 if (range_type
== NULL
)
8688 range_type
= type_arg
;
8692 error (_("unexpected attribute encountered"));
8694 return discrete_type_low_bound (range_type
);
8696 return discrete_type_high_bound (range_type
);
8698 error (_("the 'length attribute applies only to array types"));
8701 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8702 error (_("unimplemented type attribute"));
8707 if (ada_is_packed_array_type (type_arg
))
8708 type_arg
= decode_packed_array_type (type_arg
);
8710 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8711 error (_("invalid dimension number to '%s"),
8712 ada_attribute_name (op
));
8714 type
= ada_index_type (type_arg
, tem
);
8717 (_("attempt to take bound of something that is not an array"));
8718 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8719 return allocate_value (type
);
8724 error (_("unexpected attribute encountered"));
8726 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8727 return value_from_longest (type
, low
);
8729 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8730 return value_from_longest (type
, high
);
8732 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8733 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8734 return value_from_longest (type
, high
- low
+ 1);
8740 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8741 if (noside
== EVAL_SKIP
)
8744 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8745 return value_zero (ada_tag_type (arg1
), not_lval
);
8747 return ada_value_tag (arg1
);
8751 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8752 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8753 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8754 if (noside
== EVAL_SKIP
)
8756 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8757 return value_zero (value_type (arg1
), not_lval
);
8759 return value_binop (arg1
, arg2
,
8760 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8762 case OP_ATR_MODULUS
:
8764 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
8765 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8767 if (noside
== EVAL_SKIP
)
8770 if (!ada_is_modular_type (type_arg
))
8771 error (_("'modulus must be applied to modular type"));
8773 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8774 ada_modulus (type_arg
));
8779 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8780 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8781 if (noside
== EVAL_SKIP
)
8783 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8784 return value_zero (builtin_type_int
, not_lval
);
8786 return value_pos_atr (arg1
);
8789 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8790 if (noside
== EVAL_SKIP
)
8792 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8793 return value_zero (builtin_type_int
, not_lval
);
8795 return value_from_longest (builtin_type_int
,
8797 * TYPE_LENGTH (value_type (arg1
)));
8800 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8801 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8802 type
= exp
->elts
[pc
+ 2].type
;
8803 if (noside
== EVAL_SKIP
)
8805 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8806 return value_zero (type
, not_lval
);
8808 return value_val_atr (type
, arg1
);
8811 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8812 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8813 if (noside
== EVAL_SKIP
)
8815 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8816 return value_zero (value_type (arg1
), not_lval
);
8818 return value_binop (arg1
, arg2
, op
);
8821 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8822 if (noside
== EVAL_SKIP
)
8828 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8829 if (noside
== EVAL_SKIP
)
8831 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
8832 return value_neg (arg1
);
8837 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
8838 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
8839 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
8840 if (noside
== EVAL_SKIP
)
8842 type
= ada_check_typedef (value_type (arg1
));
8843 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8845 if (ada_is_array_descriptor_type (type
))
8846 /* GDB allows dereferencing GNAT array descriptors. */
8848 struct type
*arrType
= ada_type_of_array (arg1
, 0);
8849 if (arrType
== NULL
)
8850 error (_("Attempt to dereference null array pointer."));
8851 return value_at_lazy (arrType
, 0);
8853 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
8854 || TYPE_CODE (type
) == TYPE_CODE_REF
8855 /* In C you can dereference an array to get the 1st elt. */
8856 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8858 type
= to_static_fixed_type
8860 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
8862 return value_zero (type
, lval_memory
);
8864 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
8865 /* GDB allows dereferencing an int. */
8866 return value_zero (builtin_type_int
, lval_memory
);
8868 error (_("Attempt to take contents of a non-pointer value."));
8870 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
8871 type
= ada_check_typedef (value_type (arg1
));
8873 if (ada_is_array_descriptor_type (type
))
8874 /* GDB allows dereferencing GNAT array descriptors. */
8875 return ada_coerce_to_simple_array (arg1
);
8877 return ada_value_ind (arg1
);
8879 case STRUCTOP_STRUCT
:
8880 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8881 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
8882 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8883 if (noside
== EVAL_SKIP
)
8885 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8887 struct type
*type1
= value_type (arg1
);
8888 if (ada_is_tagged_type (type1
, 1))
8890 type
= ada_lookup_struct_elt_type (type1
,
8891 &exp
->elts
[pc
+ 2].string
,
8894 /* In this case, we assume that the field COULD exist
8895 in some extension of the type. Return an object of
8896 "type" void, which will match any formal
8897 (see ada_type_match). */
8898 return value_zero (builtin_type_void
, lval_memory
);
8902 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
8905 return value_zero (ada_aligned_type (type
), lval_memory
);
8909 ada_to_fixed_value (unwrap_value
8910 (ada_value_struct_elt
8911 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
8913 /* The value is not supposed to be used. This is here to make it
8914 easier to accommodate expressions that contain types. */
8916 if (noside
== EVAL_SKIP
)
8918 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8919 return allocate_value (exp
->elts
[pc
+ 1].type
);
8921 error (_("Attempt to use a type name as an expression"));
8926 case OP_DISCRETE_RANGE
:
8929 if (noside
== EVAL_NORMAL
)
8933 error (_("Undefined name, ambiguous name, or renaming used in "
8934 "component association: %s."), &exp
->elts
[pc
+2].string
);
8936 error (_("Aggregates only allowed on the right of an assignment"));
8938 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
8941 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
8943 for (tem
= 0; tem
< nargs
; tem
+= 1)
8944 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8949 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
8955 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
8956 type name that encodes the 'small and 'delta information.
8957 Otherwise, return NULL. */
8960 fixed_type_info (struct type
*type
)
8962 const char *name
= ada_type_name (type
);
8963 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
8965 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
8967 const char *tail
= strstr (name
, "___XF_");
8973 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
8974 return fixed_type_info (TYPE_TARGET_TYPE (type
));
8979 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
8982 ada_is_fixed_point_type (struct type
*type
)
8984 return fixed_type_info (type
) != NULL
;
8987 /* Return non-zero iff TYPE represents a System.Address type. */
8990 ada_is_system_address_type (struct type
*type
)
8992 return (TYPE_NAME (type
)
8993 && strcmp (TYPE_NAME (type
), "system__address") == 0);
8996 /* Assuming that TYPE is the representation of an Ada fixed-point
8997 type, return its delta, or -1 if the type is malformed and the
8998 delta cannot be determined. */
9001 ada_delta (struct type
*type
)
9003 const char *encoding
= fixed_type_info (type
);
9006 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9009 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9012 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9013 factor ('SMALL value) associated with the type. */
9016 scaling_factor (struct type
*type
)
9018 const char *encoding
= fixed_type_info (type
);
9019 unsigned long num0
, den0
, num1
, den1
;
9022 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9027 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9029 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9033 /* Assuming that X is the representation of a value of fixed-point
9034 type TYPE, return its floating-point equivalent. */
9037 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9039 return (DOUBLEST
) x
*scaling_factor (type
);
9042 /* The representation of a fixed-point value of type TYPE
9043 corresponding to the value X. */
9046 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9048 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9052 /* VAX floating formats */
9054 /* Non-zero iff TYPE represents one of the special VAX floating-point
9058 ada_is_vax_floating_type (struct type
*type
)
9061 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9064 && (TYPE_CODE (type
) == TYPE_CODE_INT
9065 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9066 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9069 /* The type of special VAX floating-point type this is, assuming
9070 ada_is_vax_floating_point. */
9073 ada_vax_float_type_suffix (struct type
*type
)
9075 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9078 /* A value representing the special debugging function that outputs
9079 VAX floating-point values of the type represented by TYPE. Assumes
9080 ada_is_vax_floating_type (TYPE). */
9083 ada_vax_float_print_function (struct type
*type
)
9085 switch (ada_vax_float_type_suffix (type
))
9088 return get_var_value ("DEBUG_STRING_F", 0);
9090 return get_var_value ("DEBUG_STRING_D", 0);
9092 return get_var_value ("DEBUG_STRING_G", 0);
9094 error (_("invalid VAX floating-point type"));
9101 /* Scan STR beginning at position K for a discriminant name, and
9102 return the value of that discriminant field of DVAL in *PX. If
9103 PNEW_K is not null, put the position of the character beyond the
9104 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9105 not alter *PX and *PNEW_K if unsuccessful. */
9108 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9111 static char *bound_buffer
= NULL
;
9112 static size_t bound_buffer_len
= 0;
9115 struct value
*bound_val
;
9117 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9120 pend
= strstr (str
+ k
, "__");
9124 k
+= strlen (bound
);
9128 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9129 bound
= bound_buffer
;
9130 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9131 bound
[pend
- (str
+ k
)] = '\0';
9135 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9136 if (bound_val
== NULL
)
9139 *px
= value_as_long (bound_val
);
9145 /* Value of variable named NAME in the current environment. If
9146 no such variable found, then if ERR_MSG is null, returns 0, and
9147 otherwise causes an error with message ERR_MSG. */
9149 static struct value
*
9150 get_var_value (char *name
, char *err_msg
)
9152 struct ada_symbol_info
*syms
;
9155 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9160 if (err_msg
== NULL
)
9163 error (("%s"), err_msg
);
9166 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9169 /* Value of integer variable named NAME in the current environment. If
9170 no such variable found, returns 0, and sets *FLAG to 0. If
9171 successful, sets *FLAG to 1. */
9174 get_int_var_value (char *name
, int *flag
)
9176 struct value
*var_val
= get_var_value (name
, 0);
9188 return value_as_long (var_val
);
9193 /* Return a range type whose base type is that of the range type named
9194 NAME in the current environment, and whose bounds are calculated
9195 from NAME according to the GNAT range encoding conventions.
9196 Extract discriminant values, if needed, from DVAL. If a new type
9197 must be created, allocate in OBJFILE's space. The bounds
9198 information, in general, is encoded in NAME, the base type given in
9199 the named range type. */
9201 static struct type
*
9202 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9204 struct type
*raw_type
= ada_find_any_type (name
);
9205 struct type
*base_type
;
9208 if (raw_type
== NULL
)
9209 base_type
= builtin_type_int
;
9210 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9211 base_type
= TYPE_TARGET_TYPE (raw_type
);
9213 base_type
= raw_type
;
9215 subtype_info
= strstr (name
, "___XD");
9216 if (subtype_info
== NULL
)
9220 static char *name_buf
= NULL
;
9221 static size_t name_len
= 0;
9222 int prefix_len
= subtype_info
- name
;
9228 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9229 strncpy (name_buf
, name
, prefix_len
);
9230 name_buf
[prefix_len
] = '\0';
9233 bounds_str
= strchr (subtype_info
, '_');
9236 if (*subtype_info
== 'L')
9238 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9239 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9241 if (bounds_str
[n
] == '_')
9243 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9250 strcpy (name_buf
+ prefix_len
, "___L");
9251 L
= get_int_var_value (name_buf
, &ok
);
9254 lim_warning (_("Unknown lower bound, using 1."));
9259 if (*subtype_info
== 'U')
9261 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9262 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9268 strcpy (name_buf
+ prefix_len
, "___U");
9269 U
= get_int_var_value (name_buf
, &ok
);
9272 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9277 if (objfile
== NULL
)
9278 objfile
= TYPE_OBJFILE (base_type
);
9279 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9280 TYPE_NAME (type
) = name
;
9285 /* True iff NAME is the name of a range type. */
9288 ada_is_range_type_name (const char *name
)
9290 return (name
!= NULL
&& strstr (name
, "___XD"));
9296 /* True iff TYPE is an Ada modular type. */
9299 ada_is_modular_type (struct type
*type
)
9301 struct type
*subranged_type
= base_type (type
);
9303 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9304 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9305 && TYPE_UNSIGNED (subranged_type
));
9308 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9311 ada_modulus (struct type
* type
)
9313 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9317 /* Ada exception catchpoint support:
9318 ---------------------------------
9320 We support 3 kinds of exception catchpoints:
9321 . catchpoints on Ada exceptions
9322 . catchpoints on unhandled Ada exceptions
9323 . catchpoints on failed assertions
9325 Exceptions raised during failed assertions, or unhandled exceptions
9326 could perfectly be caught with the general catchpoint on Ada exceptions.
9327 However, we can easily differentiate these two special cases, and having
9328 the option to distinguish these two cases from the rest can be useful
9329 to zero-in on certain situations.
9331 Exception catchpoints are a specialized form of breakpoint,
9332 since they rely on inserting breakpoints inside known routines
9333 of the GNAT runtime. The implementation therefore uses a standard
9334 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9337 Support in the runtime for exception catchpoints have been changed
9338 a few times already, and these changes affect the implementation
9339 of these catchpoints. In order to be able to support several
9340 variants of the runtime, we use a sniffer that will determine
9341 the runtime variant used by the program being debugged.
9343 At this time, we do not support the use of conditions on Ada exception
9344 catchpoints. The COND and COND_STRING fields are therefore set
9345 to NULL (most of the time, see below).
9347 Conditions where EXP_STRING, COND, and COND_STRING are used:
9349 When a user specifies the name of a specific exception in the case
9350 of catchpoints on Ada exceptions, we store the name of that exception
9351 in the EXP_STRING. We then translate this request into an actual
9352 condition stored in COND_STRING, and then parse it into an expression
9355 /* The different types of catchpoints that we introduced for catching
9358 enum exception_catchpoint_kind
9361 ex_catch_exception_unhandled
,
9365 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9367 /* A structure that describes how to support exception catchpoints
9368 for a given executable. */
9370 struct exception_support_info
9372 /* The name of the symbol to break on in order to insert
9373 a catchpoint on exceptions. */
9374 const char *catch_exception_sym
;
9376 /* The name of the symbol to break on in order to insert
9377 a catchpoint on unhandled exceptions. */
9378 const char *catch_exception_unhandled_sym
;
9380 /* The name of the symbol to break on in order to insert
9381 a catchpoint on failed assertions. */
9382 const char *catch_assert_sym
;
9384 /* Assuming that the inferior just triggered an unhandled exception
9385 catchpoint, this function is responsible for returning the address
9386 in inferior memory where the name of that exception is stored.
9387 Return zero if the address could not be computed. */
9388 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9391 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9392 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9394 /* The following exception support info structure describes how to
9395 implement exception catchpoints with the latest version of the
9396 Ada runtime (as of 2007-03-06). */
9398 static const struct exception_support_info default_exception_support_info
=
9400 "__gnat_debug_raise_exception", /* catch_exception_sym */
9401 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9402 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9403 ada_unhandled_exception_name_addr
9406 /* The following exception support info structure describes how to
9407 implement exception catchpoints with a slightly older version
9408 of the Ada runtime. */
9410 static const struct exception_support_info exception_support_info_fallback
=
9412 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9413 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9414 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9415 ada_unhandled_exception_name_addr_from_raise
9418 /* For each executable, we sniff which exception info structure to use
9419 and cache it in the following global variable. */
9421 static const struct exception_support_info
*exception_info
= NULL
;
9423 /* Inspect the Ada runtime and determine which exception info structure
9424 should be used to provide support for exception catchpoints.
9426 This function will always set exception_info, or raise an error. */
9429 ada_exception_support_info_sniffer (void)
9433 /* If the exception info is already known, then no need to recompute it. */
9434 if (exception_info
!= NULL
)
9437 /* Check the latest (default) exception support info. */
9438 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9442 exception_info
= &default_exception_support_info
;
9446 /* Try our fallback exception suport info. */
9447 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9451 exception_info
= &exception_support_info_fallback
;
9455 /* Sometimes, it is normal for us to not be able to find the routine
9456 we are looking for. This happens when the program is linked with
9457 the shared version of the GNAT runtime, and the program has not been
9458 started yet. Inform the user of these two possible causes if
9461 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9462 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9464 /* If the symbol does not exist, then check that the program is
9465 already started, to make sure that shared libraries have been
9466 loaded. If it is not started, this may mean that the symbol is
9467 in a shared library. */
9469 if (ptid_get_pid (inferior_ptid
) == 0)
9470 error (_("Unable to insert catchpoint. Try to start the program first."));
9472 /* At this point, we know that we are debugging an Ada program and
9473 that the inferior has been started, but we still are not able to
9474 find the run-time symbols. That can mean that we are in
9475 configurable run time mode, or that a-except as been optimized
9476 out by the linker... In any case, at this point it is not worth
9477 supporting this feature. */
9479 error (_("Cannot insert catchpoints in this configuration."));
9482 /* An observer of "executable_changed" events.
9483 Its role is to clear certain cached values that need to be recomputed
9484 each time a new executable is loaded by GDB. */
9487 ada_executable_changed_observer (void *unused
)
9489 /* If the executable changed, then it is possible that the Ada runtime
9490 is different. So we need to invalidate the exception support info
9492 exception_info
= NULL
;
9495 /* Return the name of the function at PC, NULL if could not find it.
9496 This function only checks the debugging information, not the symbol
9500 function_name_from_pc (CORE_ADDR pc
)
9504 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9510 /* True iff FRAME is very likely to be that of a function that is
9511 part of the runtime system. This is all very heuristic, but is
9512 intended to be used as advice as to what frames are uninteresting
9516 is_known_support_routine (struct frame_info
*frame
)
9518 struct symtab_and_line sal
;
9522 /* If this code does not have any debugging information (no symtab),
9523 This cannot be any user code. */
9525 find_frame_sal (frame
, &sal
);
9526 if (sal
.symtab
== NULL
)
9529 /* If there is a symtab, but the associated source file cannot be
9530 located, then assume this is not user code: Selecting a frame
9531 for which we cannot display the code would not be very helpful
9532 for the user. This should also take care of case such as VxWorks
9533 where the kernel has some debugging info provided for a few units. */
9535 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9538 /* Check the unit filename againt the Ada runtime file naming.
9539 We also check the name of the objfile against the name of some
9540 known system libraries that sometimes come with debugging info
9543 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9545 re_comp (known_runtime_file_name_patterns
[i
]);
9546 if (re_exec (sal
.symtab
->filename
))
9548 if (sal
.symtab
->objfile
!= NULL
9549 && re_exec (sal
.symtab
->objfile
->name
))
9553 /* Check whether the function is a GNAT-generated entity. */
9555 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9556 if (func_name
== NULL
)
9559 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9561 re_comp (known_auxiliary_function_name_patterns
[i
]);
9562 if (re_exec (func_name
))
9569 /* Find the first frame that contains debugging information and that is not
9570 part of the Ada run-time, starting from FI and moving upward. */
9573 ada_find_printable_frame (struct frame_info
*fi
)
9575 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9577 if (!is_known_support_routine (fi
))
9586 /* Assuming that the inferior just triggered an unhandled exception
9587 catchpoint, return the address in inferior memory where the name
9588 of the exception is stored.
9590 Return zero if the address could not be computed. */
9593 ada_unhandled_exception_name_addr (void)
9595 return parse_and_eval_address ("e.full_name");
9598 /* Same as ada_unhandled_exception_name_addr, except that this function
9599 should be used when the inferior uses an older version of the runtime,
9600 where the exception name needs to be extracted from a specific frame
9601 several frames up in the callstack. */
9604 ada_unhandled_exception_name_addr_from_raise (void)
9607 struct frame_info
*fi
;
9609 /* To determine the name of this exception, we need to select
9610 the frame corresponding to RAISE_SYM_NAME. This frame is
9611 at least 3 levels up, so we simply skip the first 3 frames
9612 without checking the name of their associated function. */
9613 fi
= get_current_frame ();
9614 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9616 fi
= get_prev_frame (fi
);
9620 const char *func_name
=
9621 function_name_from_pc (get_frame_address_in_block (fi
));
9622 if (func_name
!= NULL
9623 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9624 break; /* We found the frame we were looking for... */
9625 fi
= get_prev_frame (fi
);
9632 return parse_and_eval_address ("id.full_name");
9635 /* Assuming the inferior just triggered an Ada exception catchpoint
9636 (of any type), return the address in inferior memory where the name
9637 of the exception is stored, if applicable.
9639 Return zero if the address could not be computed, or if not relevant. */
9642 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9643 struct breakpoint
*b
)
9647 case ex_catch_exception
:
9648 return (parse_and_eval_address ("e.full_name"));
9651 case ex_catch_exception_unhandled
:
9652 return exception_info
->unhandled_exception_name_addr ();
9655 case ex_catch_assert
:
9656 return 0; /* Exception name is not relevant in this case. */
9660 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9664 return 0; /* Should never be reached. */
9667 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9668 any error that ada_exception_name_addr_1 might cause to be thrown.
9669 When an error is intercepted, a warning with the error message is printed,
9670 and zero is returned. */
9673 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9674 struct breakpoint
*b
)
9676 struct gdb_exception e
;
9677 CORE_ADDR result
= 0;
9679 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9681 result
= ada_exception_name_addr_1 (ex
, b
);
9686 warning (_("failed to get exception name: %s"), e
.message
);
9693 /* Implement the PRINT_IT method in the breakpoint_ops structure
9694 for all exception catchpoint kinds. */
9696 static enum print_stop_action
9697 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9699 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9700 char exception_name
[256];
9704 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9705 exception_name
[sizeof (exception_name
) - 1] = '\0';
9708 ada_find_printable_frame (get_current_frame ());
9710 annotate_catchpoint (b
->number
);
9713 case ex_catch_exception
:
9715 printf_filtered (_("\nCatchpoint %d, %s at "),
9716 b
->number
, exception_name
);
9718 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
9720 case ex_catch_exception_unhandled
:
9722 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
9723 b
->number
, exception_name
);
9725 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
9728 case ex_catch_assert
:
9729 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
9734 return PRINT_SRC_AND_LOC
;
9737 /* Implement the PRINT_ONE method in the breakpoint_ops structure
9738 for all exception catchpoint kinds. */
9741 print_one_exception (enum exception_catchpoint_kind ex
,
9742 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9747 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
9751 *last_addr
= b
->loc
->address
;
9754 case ex_catch_exception
:
9755 if (b
->exp_string
!= NULL
)
9757 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
9759 ui_out_field_string (uiout
, "what", msg
);
9763 ui_out_field_string (uiout
, "what", "all Ada exceptions");
9767 case ex_catch_exception_unhandled
:
9768 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
9771 case ex_catch_assert
:
9772 ui_out_field_string (uiout
, "what", "failed Ada assertions");
9776 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9781 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
9782 for all exception catchpoint kinds. */
9785 print_mention_exception (enum exception_catchpoint_kind ex
,
9786 struct breakpoint
*b
)
9790 case ex_catch_exception
:
9791 if (b
->exp_string
!= NULL
)
9792 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
9793 b
->number
, b
->exp_string
);
9795 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
9799 case ex_catch_exception_unhandled
:
9800 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
9804 case ex_catch_assert
:
9805 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
9809 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9814 /* Virtual table for "catch exception" breakpoints. */
9816 static enum print_stop_action
9817 print_it_catch_exception (struct breakpoint
*b
)
9819 return print_it_exception (ex_catch_exception
, b
);
9823 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9825 print_one_exception (ex_catch_exception
, b
, last_addr
);
9829 print_mention_catch_exception (struct breakpoint
*b
)
9831 print_mention_exception (ex_catch_exception
, b
);
9834 static struct breakpoint_ops catch_exception_breakpoint_ops
=
9836 print_it_catch_exception
,
9837 print_one_catch_exception
,
9838 print_mention_catch_exception
9841 /* Virtual table for "catch exception unhandled" breakpoints. */
9843 static enum print_stop_action
9844 print_it_catch_exception_unhandled (struct breakpoint
*b
)
9846 return print_it_exception (ex_catch_exception_unhandled
, b
);
9850 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9852 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
9856 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
9858 print_mention_exception (ex_catch_exception_unhandled
, b
);
9861 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
9862 print_it_catch_exception_unhandled
,
9863 print_one_catch_exception_unhandled
,
9864 print_mention_catch_exception_unhandled
9867 /* Virtual table for "catch assert" breakpoints. */
9869 static enum print_stop_action
9870 print_it_catch_assert (struct breakpoint
*b
)
9872 return print_it_exception (ex_catch_assert
, b
);
9876 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9878 print_one_exception (ex_catch_assert
, b
, last_addr
);
9882 print_mention_catch_assert (struct breakpoint
*b
)
9884 print_mention_exception (ex_catch_assert
, b
);
9887 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
9888 print_it_catch_assert
,
9889 print_one_catch_assert
,
9890 print_mention_catch_assert
9893 /* Return non-zero if B is an Ada exception catchpoint. */
9896 ada_exception_catchpoint_p (struct breakpoint
*b
)
9898 return (b
->ops
== &catch_exception_breakpoint_ops
9899 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
9900 || b
->ops
== &catch_assert_breakpoint_ops
);
9903 /* Return a newly allocated copy of the first space-separated token
9904 in ARGSP, and then adjust ARGSP to point immediately after that
9907 Return NULL if ARGPS does not contain any more tokens. */
9910 ada_get_next_arg (char **argsp
)
9912 char *args
= *argsp
;
9916 /* Skip any leading white space. */
9918 while (isspace (*args
))
9921 if (args
[0] == '\0')
9922 return NULL
; /* No more arguments. */
9924 /* Find the end of the current argument. */
9927 while (*end
!= '\0' && !isspace (*end
))
9930 /* Adjust ARGSP to point to the start of the next argument. */
9934 /* Make a copy of the current argument and return it. */
9936 result
= xmalloc (end
- args
+ 1);
9937 strncpy (result
, args
, end
- args
);
9938 result
[end
- args
] = '\0';
9943 /* Split the arguments specified in a "catch exception" command.
9944 Set EX to the appropriate catchpoint type.
9945 Set EXP_STRING to the name of the specific exception if
9946 specified by the user. */
9949 catch_ada_exception_command_split (char *args
,
9950 enum exception_catchpoint_kind
*ex
,
9953 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
9954 char *exception_name
;
9956 exception_name
= ada_get_next_arg (&args
);
9957 make_cleanup (xfree
, exception_name
);
9959 /* Check that we do not have any more arguments. Anything else
9962 while (isspace (*args
))
9965 if (args
[0] != '\0')
9966 error (_("Junk at end of expression"));
9968 discard_cleanups (old_chain
);
9970 if (exception_name
== NULL
)
9972 /* Catch all exceptions. */
9973 *ex
= ex_catch_exception
;
9976 else if (strcmp (exception_name
, "unhandled") == 0)
9978 /* Catch unhandled exceptions. */
9979 *ex
= ex_catch_exception_unhandled
;
9984 /* Catch a specific exception. */
9985 *ex
= ex_catch_exception
;
9986 *exp_string
= exception_name
;
9990 /* Return the name of the symbol on which we should break in order to
9991 implement a catchpoint of the EX kind. */
9994 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
9996 gdb_assert (exception_info
!= NULL
);
10000 case ex_catch_exception
:
10001 return (exception_info
->catch_exception_sym
);
10003 case ex_catch_exception_unhandled
:
10004 return (exception_info
->catch_exception_unhandled_sym
);
10006 case ex_catch_assert
:
10007 return (exception_info
->catch_assert_sym
);
10010 internal_error (__FILE__
, __LINE__
,
10011 _("unexpected catchpoint kind (%d)"), ex
);
10015 /* Return the breakpoint ops "virtual table" used for catchpoints
10018 static struct breakpoint_ops
*
10019 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10023 case ex_catch_exception
:
10024 return (&catch_exception_breakpoint_ops
);
10026 case ex_catch_exception_unhandled
:
10027 return (&catch_exception_unhandled_breakpoint_ops
);
10029 case ex_catch_assert
:
10030 return (&catch_assert_breakpoint_ops
);
10033 internal_error (__FILE__
, __LINE__
,
10034 _("unexpected catchpoint kind (%d)"), ex
);
10038 /* Return the condition that will be used to match the current exception
10039 being raised with the exception that the user wants to catch. This
10040 assumes that this condition is used when the inferior just triggered
10041 an exception catchpoint.
10043 The string returned is a newly allocated string that needs to be
10044 deallocated later. */
10047 ada_exception_catchpoint_cond_string (const char *exp_string
)
10049 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10052 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10054 static struct expression
*
10055 ada_parse_catchpoint_condition (char *cond_string
,
10056 struct symtab_and_line sal
)
10058 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10061 /* Return the symtab_and_line that should be used to insert an exception
10062 catchpoint of the TYPE kind.
10064 EX_STRING should contain the name of a specific exception
10065 that the catchpoint should catch, or NULL otherwise.
10067 The idea behind all the remaining parameters is that their names match
10068 the name of certain fields in the breakpoint structure that are used to
10069 handle exception catchpoints. This function returns the value to which
10070 these fields should be set, depending on the type of catchpoint we need
10073 If COND and COND_STRING are both non-NULL, any value they might
10074 hold will be free'ed, and then replaced by newly allocated ones.
10075 These parameters are left untouched otherwise. */
10077 static struct symtab_and_line
10078 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10079 char **addr_string
, char **cond_string
,
10080 struct expression
**cond
, struct breakpoint_ops
**ops
)
10082 const char *sym_name
;
10083 struct symbol
*sym
;
10084 struct symtab_and_line sal
;
10086 /* First, find out which exception support info to use. */
10087 ada_exception_support_info_sniffer ();
10089 /* Then lookup the function on which we will break in order to catch
10090 the Ada exceptions requested by the user. */
10092 sym_name
= ada_exception_sym_name (ex
);
10093 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10095 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10096 that should be compiled with debugging information. As a result, we
10097 expect to find that symbol in the symtabs. If we don't find it, then
10098 the target most likely does not support Ada exceptions, or we cannot
10099 insert exception breakpoints yet, because the GNAT runtime hasn't been
10102 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10103 in such a way that no debugging information is produced for the symbol
10104 we are looking for. In this case, we could search the minimal symbols
10105 as a fall-back mechanism. This would still be operating in degraded
10106 mode, however, as we would still be missing the debugging information
10107 that is needed in order to extract the name of the exception being
10108 raised (this name is printed in the catchpoint message, and is also
10109 used when trying to catch a specific exception). We do not handle
10110 this case for now. */
10113 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10115 /* Make sure that the symbol we found corresponds to a function. */
10116 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10117 error (_("Symbol \"%s\" is not a function (class = %d)"),
10118 sym_name
, SYMBOL_CLASS (sym
));
10120 sal
= find_function_start_sal (sym
, 1);
10122 /* Set ADDR_STRING. */
10124 *addr_string
= xstrdup (sym_name
);
10126 /* Set the COND and COND_STRING (if not NULL). */
10128 if (cond_string
!= NULL
&& cond
!= NULL
)
10130 if (*cond_string
!= NULL
)
10132 xfree (*cond_string
);
10133 *cond_string
= NULL
;
10140 if (exp_string
!= NULL
)
10142 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10143 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10148 *ops
= ada_exception_breakpoint_ops (ex
);
10153 /* Parse the arguments (ARGS) of the "catch exception" command.
10155 Set TYPE to the appropriate exception catchpoint type.
10156 If the user asked the catchpoint to catch only a specific
10157 exception, then save the exception name in ADDR_STRING.
10159 See ada_exception_sal for a description of all the remaining
10160 function arguments of this function. */
10162 struct symtab_and_line
10163 ada_decode_exception_location (char *args
, char **addr_string
,
10164 char **exp_string
, char **cond_string
,
10165 struct expression
**cond
,
10166 struct breakpoint_ops
**ops
)
10168 enum exception_catchpoint_kind ex
;
10170 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10171 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10175 struct symtab_and_line
10176 ada_decode_assert_location (char *args
, char **addr_string
,
10177 struct breakpoint_ops
**ops
)
10179 /* Check that no argument where provided at the end of the command. */
10183 while (isspace (*args
))
10186 error (_("Junk at end of arguments."));
10189 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10194 /* Information about operators given special treatment in functions
10196 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10198 #define ADA_OPERATORS \
10199 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10200 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10201 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10202 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10203 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10204 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10205 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10206 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10207 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10208 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10209 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10210 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10211 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10212 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10213 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10214 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10215 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10216 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10217 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10220 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10222 switch (exp
->elts
[pc
- 1].opcode
)
10225 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10228 #define OP_DEFN(op, len, args, binop) \
10229 case op: *oplenp = len; *argsp = args; break;
10235 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10240 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10246 ada_op_name (enum exp_opcode opcode
)
10251 return op_name_standard (opcode
);
10253 #define OP_DEFN(op, len, args, binop) case op: return #op;
10258 return "OP_AGGREGATE";
10260 return "OP_CHOICES";
10266 /* As for operator_length, but assumes PC is pointing at the first
10267 element of the operator, and gives meaningful results only for the
10268 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10271 ada_forward_operator_length (struct expression
*exp
, int pc
,
10272 int *oplenp
, int *argsp
)
10274 switch (exp
->elts
[pc
].opcode
)
10277 *oplenp
= *argsp
= 0;
10280 #define OP_DEFN(op, len, args, binop) \
10281 case op: *oplenp = len; *argsp = args; break;
10287 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10292 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10298 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10299 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10307 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10309 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10314 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10318 /* Ada attributes ('Foo). */
10321 case OP_ATR_LENGTH
:
10325 case OP_ATR_MODULUS
:
10332 case UNOP_IN_RANGE
:
10334 /* XXX: gdb_sprint_host_address, type_sprint */
10335 fprintf_filtered (stream
, _("Type @"));
10336 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10337 fprintf_filtered (stream
, " (");
10338 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10339 fprintf_filtered (stream
, ")");
10341 case BINOP_IN_BOUNDS
:
10342 fprintf_filtered (stream
, " (%d)",
10343 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10345 case TERNOP_IN_RANGE
:
10350 case OP_DISCRETE_RANGE
:
10351 case OP_POSITIONAL
:
10358 char *name
= &exp
->elts
[elt
+ 2].string
;
10359 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10360 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10365 return dump_subexp_body_standard (exp
, stream
, elt
);
10369 for (i
= 0; i
< nargs
; i
+= 1)
10370 elt
= dump_subexp (exp
, stream
, elt
);
10375 /* The Ada extension of print_subexp (q.v.). */
10378 ada_print_subexp (struct expression
*exp
, int *pos
,
10379 struct ui_file
*stream
, enum precedence prec
)
10381 int oplen
, nargs
, i
;
10383 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10385 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10392 print_subexp_standard (exp
, pos
, stream
, prec
);
10396 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10399 case BINOP_IN_BOUNDS
:
10400 /* XXX: sprint_subexp */
10401 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10402 fputs_filtered (" in ", stream
);
10403 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10404 fputs_filtered ("'range", stream
);
10405 if (exp
->elts
[pc
+ 1].longconst
> 1)
10406 fprintf_filtered (stream
, "(%ld)",
10407 (long) exp
->elts
[pc
+ 1].longconst
);
10410 case TERNOP_IN_RANGE
:
10411 if (prec
>= PREC_EQUAL
)
10412 fputs_filtered ("(", stream
);
10413 /* XXX: sprint_subexp */
10414 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10415 fputs_filtered (" in ", stream
);
10416 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10417 fputs_filtered (" .. ", stream
);
10418 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10419 if (prec
>= PREC_EQUAL
)
10420 fputs_filtered (")", stream
);
10425 case OP_ATR_LENGTH
:
10429 case OP_ATR_MODULUS
:
10434 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10436 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10437 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10441 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10442 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10446 for (tem
= 1; tem
< nargs
; tem
+= 1)
10448 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10449 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10451 fputs_filtered (")", stream
);
10456 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10457 fputs_filtered ("'(", stream
);
10458 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10459 fputs_filtered (")", stream
);
10462 case UNOP_IN_RANGE
:
10463 /* XXX: sprint_subexp */
10464 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10465 fputs_filtered (" in ", stream
);
10466 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10469 case OP_DISCRETE_RANGE
:
10470 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10471 fputs_filtered ("..", stream
);
10472 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10476 fputs_filtered ("others => ", stream
);
10477 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10481 for (i
= 0; i
< nargs
-1; i
+= 1)
10484 fputs_filtered ("|", stream
);
10485 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10487 fputs_filtered (" => ", stream
);
10488 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10491 case OP_POSITIONAL
:
10492 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10496 fputs_filtered ("(", stream
);
10497 for (i
= 0; i
< nargs
; i
+= 1)
10500 fputs_filtered (", ", stream
);
10501 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10503 fputs_filtered (")", stream
);
10508 /* Table mapping opcodes into strings for printing operators
10509 and precedences of the operators. */
10511 static const struct op_print ada_op_print_tab
[] = {
10512 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10513 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10514 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10515 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10516 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10517 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10518 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10519 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10520 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10521 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10522 {">", BINOP_GTR
, PREC_ORDER
, 0},
10523 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10524 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10525 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10526 {"+", BINOP_ADD
, PREC_ADD
, 0},
10527 {"-", BINOP_SUB
, PREC_ADD
, 0},
10528 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10529 {"*", BINOP_MUL
, PREC_MUL
, 0},
10530 {"/", BINOP_DIV
, PREC_MUL
, 0},
10531 {"rem", BINOP_REM
, PREC_MUL
, 0},
10532 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10533 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10534 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10535 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10536 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10537 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10538 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10539 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10540 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10541 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10542 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10546 enum ada_primitive_types
{
10547 ada_primitive_type_int
,
10548 ada_primitive_type_long
,
10549 ada_primitive_type_short
,
10550 ada_primitive_type_char
,
10551 ada_primitive_type_float
,
10552 ada_primitive_type_double
,
10553 ada_primitive_type_void
,
10554 ada_primitive_type_long_long
,
10555 ada_primitive_type_long_double
,
10556 ada_primitive_type_natural
,
10557 ada_primitive_type_positive
,
10558 ada_primitive_type_system_address
,
10559 nr_ada_primitive_types
10563 ada_language_arch_info (struct gdbarch
*gdbarch
,
10564 struct language_arch_info
*lai
)
10566 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10567 lai
->primitive_type_vector
10568 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10570 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10571 init_type (TYPE_CODE_INT
,
10572 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10573 0, "integer", (struct objfile
*) NULL
);
10574 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10575 init_type (TYPE_CODE_INT
,
10576 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10577 0, "long_integer", (struct objfile
*) NULL
);
10578 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10579 init_type (TYPE_CODE_INT
,
10580 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10581 0, "short_integer", (struct objfile
*) NULL
);
10582 lai
->string_char_type
=
10583 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10584 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10585 0, "character", (struct objfile
*) NULL
);
10586 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10587 init_type (TYPE_CODE_FLT
,
10588 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10589 0, "float", (struct objfile
*) NULL
);
10590 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10591 init_type (TYPE_CODE_FLT
,
10592 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10593 0, "long_float", (struct objfile
*) NULL
);
10594 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10595 init_type (TYPE_CODE_INT
,
10596 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10597 0, "long_long_integer", (struct objfile
*) NULL
);
10598 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10599 init_type (TYPE_CODE_FLT
,
10600 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10601 0, "long_long_float", (struct objfile
*) NULL
);
10602 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10603 init_type (TYPE_CODE_INT
,
10604 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10605 0, "natural", (struct objfile
*) NULL
);
10606 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10607 init_type (TYPE_CODE_INT
,
10608 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10609 0, "positive", (struct objfile
*) NULL
);
10610 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10612 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10613 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10614 (struct objfile
*) NULL
));
10615 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10616 = "system__address";
10619 /* Language vector */
10621 /* Not really used, but needed in the ada_language_defn. */
10624 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10626 ada_emit_char (c
, stream
, quoter
, 1);
10632 warnings_issued
= 0;
10633 return ada_parse ();
10636 static const struct exp_descriptor ada_exp_descriptor
= {
10638 ada_operator_length
,
10640 ada_dump_subexp_body
,
10641 ada_evaluate_subexp
10644 const struct language_defn ada_language_defn
= {
10645 "ada", /* Language name */
10649 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10650 that's not quite what this means. */
10652 &ada_exp_descriptor
,
10656 ada_printchar
, /* Print a character constant */
10657 ada_printstr
, /* Function to print string constant */
10658 emit_char
, /* Function to print single char (not used) */
10659 ada_print_type
, /* Print a type using appropriate syntax */
10660 ada_val_print
, /* Print a value using appropriate syntax */
10661 ada_value_print
, /* Print a top-level value */
10662 NULL
, /* Language specific skip_trampoline */
10663 NULL
, /* value_of_this */
10664 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10665 basic_lookup_transparent_type
, /* lookup_transparent_type */
10666 ada_la_decode
, /* Language specific symbol demangler */
10667 NULL
, /* Language specific class_name_from_physname */
10668 ada_op_print_tab
, /* expression operators for printing */
10669 0, /* c-style arrays */
10670 1, /* String lower bound */
10671 ada_get_gdb_completer_word_break_characters
,
10672 ada_language_arch_info
,
10673 ada_print_array_index
,
10674 default_pass_by_reference
,
10679 _initialize_ada_language (void)
10681 add_language (&ada_language_defn
);
10683 varsize_limit
= 65536;
10685 obstack_init (&symbol_list_obstack
);
10687 decoded_names_store
= htab_create_alloc
10688 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10689 NULL
, xcalloc
, xfree
);
10691 observer_attach_executable_changed (ada_executable_changed_observer
);