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
);
3006 return evaluate_subexp_type (exp
, pos
);
3009 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3010 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3011 a non-pointer. A type of 'void' (which is never a valid expression type)
3012 by convention matches anything. */
3013 /* The term "match" here is rather loose. The match is heuristic and
3014 liberal. FIXME: TOO liberal, in fact. */
3017 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3019 ftype
= ada_check_typedef (ftype
);
3020 atype
= ada_check_typedef (atype
);
3022 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3023 ftype
= TYPE_TARGET_TYPE (ftype
);
3024 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3025 atype
= TYPE_TARGET_TYPE (atype
);
3027 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3028 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3031 switch (TYPE_CODE (ftype
))
3036 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3037 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3038 TYPE_TARGET_TYPE (atype
), 0);
3041 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3043 case TYPE_CODE_ENUM
:
3044 case TYPE_CODE_RANGE
:
3045 switch (TYPE_CODE (atype
))
3048 case TYPE_CODE_ENUM
:
3049 case TYPE_CODE_RANGE
:
3055 case TYPE_CODE_ARRAY
:
3056 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3057 || ada_is_array_descriptor_type (atype
));
3059 case TYPE_CODE_STRUCT
:
3060 if (ada_is_array_descriptor_type (ftype
))
3061 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3062 || ada_is_array_descriptor_type (atype
));
3064 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3065 && !ada_is_array_descriptor_type (atype
));
3067 case TYPE_CODE_UNION
:
3069 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3073 /* Return non-zero if the formals of FUNC "sufficiently match" the
3074 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3075 may also be an enumeral, in which case it is treated as a 0-
3076 argument function. */
3079 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3082 struct type
*func_type
= SYMBOL_TYPE (func
);
3084 if (SYMBOL_CLASS (func
) == LOC_CONST
3085 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3086 return (n_actuals
== 0);
3087 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3090 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3093 for (i
= 0; i
< n_actuals
; i
+= 1)
3095 if (actuals
[i
] == NULL
)
3099 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3100 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3102 if (!ada_type_match (ftype
, atype
, 1))
3109 /* False iff function type FUNC_TYPE definitely does not produce a value
3110 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3111 FUNC_TYPE is not a valid function type with a non-null return type
3112 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3115 return_match (struct type
*func_type
, struct type
*context_type
)
3117 struct type
*return_type
;
3119 if (func_type
== NULL
)
3122 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3123 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3125 return_type
= base_type (func_type
);
3126 if (return_type
== NULL
)
3129 context_type
= base_type (context_type
);
3131 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3132 return context_type
== NULL
|| return_type
== context_type
;
3133 else if (context_type
== NULL
)
3134 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3136 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3140 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3141 function (if any) that matches the types of the NARGS arguments in
3142 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3143 that returns that type, then eliminate matches that don't. If
3144 CONTEXT_TYPE is void and there is at least one match that does not
3145 return void, eliminate all matches that do.
3147 Asks the user if there is more than one match remaining. Returns -1
3148 if there is no such symbol or none is selected. NAME is used
3149 solely for messages. May re-arrange and modify SYMS in
3150 the process; the index returned is for the modified vector. */
3153 ada_resolve_function (struct ada_symbol_info syms
[],
3154 int nsyms
, struct value
**args
, int nargs
,
3155 const char *name
, struct type
*context_type
)
3158 int m
; /* Number of hits */
3159 struct type
*fallback
;
3160 struct type
*return_type
;
3162 return_type
= context_type
;
3163 if (context_type
== NULL
)
3164 fallback
= builtin_type_void
;
3171 for (k
= 0; k
< nsyms
; k
+= 1)
3173 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3175 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3176 && return_match (type
, return_type
))
3182 if (m
> 0 || return_type
== fallback
)
3185 return_type
= fallback
;
3192 printf_filtered (_("Multiple matches for %s\n"), name
);
3193 user_select_syms (syms
, m
, 1);
3199 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3200 in a listing of choices during disambiguation (see sort_choices, below).
3201 The idea is that overloadings of a subprogram name from the
3202 same package should sort in their source order. We settle for ordering
3203 such symbols by their trailing number (__N or $N). */
3206 encoded_ordered_before (char *N0
, char *N1
)
3210 else if (N0
== NULL
)
3215 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3217 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3219 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3220 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3224 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3227 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3229 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3230 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3232 return (strcmp (N0
, N1
) < 0);
3236 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3240 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3243 for (i
= 1; i
< nsyms
; i
+= 1)
3245 struct ada_symbol_info sym
= syms
[i
];
3248 for (j
= i
- 1; j
>= 0; j
-= 1)
3250 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3251 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3253 syms
[j
+ 1] = syms
[j
];
3259 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3260 by asking the user (if necessary), returning the number selected,
3261 and setting the first elements of SYMS items. Error if no symbols
3264 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3265 to be re-integrated one of these days. */
3268 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3271 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3273 int first_choice
= (max_results
== 1) ? 1 : 2;
3275 if (max_results
< 1)
3276 error (_("Request to select 0 symbols!"));
3280 printf_unfiltered (_("[0] cancel\n"));
3281 if (max_results
> 1)
3282 printf_unfiltered (_("[1] all\n"));
3284 sort_choices (syms
, nsyms
);
3286 for (i
= 0; i
< nsyms
; i
+= 1)
3288 if (syms
[i
].sym
== NULL
)
3291 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3293 struct symtab_and_line sal
=
3294 find_function_start_sal (syms
[i
].sym
, 1);
3295 if (sal
.symtab
== NULL
)
3296 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3298 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3301 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3302 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3303 sal
.symtab
->filename
, sal
.line
);
3309 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3310 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3311 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3312 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3314 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3315 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3317 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3318 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3319 else if (is_enumeral
3320 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3322 printf_unfiltered (("[%d] "), i
+ first_choice
);
3323 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3325 printf_unfiltered (_("'(%s) (enumeral)\n"),
3326 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3328 else if (symtab
!= NULL
)
3329 printf_unfiltered (is_enumeral
3330 ? _("[%d] %s in %s (enumeral)\n")
3331 : _("[%d] %s at %s:?\n"),
3333 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3336 printf_unfiltered (is_enumeral
3337 ? _("[%d] %s (enumeral)\n")
3338 : _("[%d] %s at ?\n"),
3340 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3344 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3347 for (i
= 0; i
< n_chosen
; i
+= 1)
3348 syms
[i
] = syms
[chosen
[i
]];
3353 /* Read and validate a set of numeric choices from the user in the
3354 range 0 .. N_CHOICES-1. Place the results in increasing
3355 order in CHOICES[0 .. N-1], and return N.
3357 The user types choices as a sequence of numbers on one line
3358 separated by blanks, encoding them as follows:
3360 + A choice of 0 means to cancel the selection, throwing an error.
3361 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3362 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3364 The user is not allowed to choose more than MAX_RESULTS values.
3366 ANNOTATION_SUFFIX, if present, is used to annotate the input
3367 prompts (for use with the -f switch). */
3370 get_selections (int *choices
, int n_choices
, int max_results
,
3371 int is_all_choice
, char *annotation_suffix
)
3376 int first_choice
= is_all_choice
? 2 : 1;
3378 prompt
= getenv ("PS2");
3382 printf_unfiltered (("%s "), prompt
);
3383 gdb_flush (gdb_stdout
);
3385 args
= command_line_input ((char *) NULL
, 0, annotation_suffix
);
3388 error_no_arg (_("one or more choice numbers"));
3392 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3393 order, as given in args. Choices are validated. */
3399 while (isspace (*args
))
3401 if (*args
== '\0' && n_chosen
== 0)
3402 error_no_arg (_("one or more choice numbers"));
3403 else if (*args
== '\0')
3406 choice
= strtol (args
, &args2
, 10);
3407 if (args
== args2
|| choice
< 0
3408 || choice
> n_choices
+ first_choice
- 1)
3409 error (_("Argument must be choice number"));
3413 error (_("cancelled"));
3415 if (choice
< first_choice
)
3417 n_chosen
= n_choices
;
3418 for (j
= 0; j
< n_choices
; j
+= 1)
3422 choice
-= first_choice
;
3424 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3428 if (j
< 0 || choice
!= choices
[j
])
3431 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3432 choices
[k
+ 1] = choices
[k
];
3433 choices
[j
+ 1] = choice
;
3438 if (n_chosen
> max_results
)
3439 error (_("Select no more than %d of the above"), max_results
);
3444 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3445 on the function identified by SYM and BLOCK, and taking NARGS
3446 arguments. Update *EXPP as needed to hold more space. */
3449 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3450 int oplen
, struct symbol
*sym
,
3451 struct block
*block
)
3453 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3454 symbol, -oplen for operator being replaced). */
3455 struct expression
*newexp
= (struct expression
*)
3456 xmalloc (sizeof (struct expression
)
3457 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3458 struct expression
*exp
= *expp
;
3460 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3461 newexp
->language_defn
= exp
->language_defn
;
3462 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3463 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3464 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3466 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3467 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3469 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3470 newexp
->elts
[pc
+ 4].block
= block
;
3471 newexp
->elts
[pc
+ 5].symbol
= sym
;
3477 /* Type-class predicates */
3479 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3483 numeric_type_p (struct type
*type
)
3489 switch (TYPE_CODE (type
))
3494 case TYPE_CODE_RANGE
:
3495 return (type
== TYPE_TARGET_TYPE (type
)
3496 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3503 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3506 integer_type_p (struct type
*type
)
3512 switch (TYPE_CODE (type
))
3516 case TYPE_CODE_RANGE
:
3517 return (type
== TYPE_TARGET_TYPE (type
)
3518 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3525 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3528 scalar_type_p (struct type
*type
)
3534 switch (TYPE_CODE (type
))
3537 case TYPE_CODE_RANGE
:
3538 case TYPE_CODE_ENUM
:
3547 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3550 discrete_type_p (struct type
*type
)
3556 switch (TYPE_CODE (type
))
3559 case TYPE_CODE_RANGE
:
3560 case TYPE_CODE_ENUM
:
3568 /* Returns non-zero if OP with operands in the vector ARGS could be
3569 a user-defined function. Errs on the side of pre-defined operators
3570 (i.e., result 0). */
3573 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3575 struct type
*type0
=
3576 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3577 struct type
*type1
=
3578 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3592 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3596 case BINOP_BITWISE_AND
:
3597 case BINOP_BITWISE_IOR
:
3598 case BINOP_BITWISE_XOR
:
3599 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3602 case BINOP_NOTEQUAL
:
3607 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3610 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3613 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3617 case UNOP_LOGICAL_NOT
:
3619 return (!numeric_type_p (type0
));
3628 1. In the following, we assume that a renaming type's name may
3629 have an ___XD suffix. It would be nice if this went away at some
3631 2. We handle both the (old) purely type-based representation of
3632 renamings and the (new) variable-based encoding. At some point,
3633 it is devoutly to be hoped that the former goes away
3634 (FIXME: hilfinger-2007-07-09).
3635 3. Subprogram renamings are not implemented, although the XRS
3636 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3638 /* If SYM encodes a renaming,
3640 <renaming> renames <renamed entity>,
3642 sets *LEN to the length of the renamed entity's name,
3643 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3644 the string describing the subcomponent selected from the renamed
3645 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3646 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3647 are undefined). Otherwise, returns a value indicating the category
3648 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3649 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3650 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3651 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3652 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3653 may be NULL, in which case they are not assigned.
3655 [Currently, however, GCC does not generate subprogram renamings.] */
3657 enum ada_renaming_category
3658 ada_parse_renaming (struct symbol
*sym
,
3659 const char **renamed_entity
, int *len
,
3660 const char **renaming_expr
)
3662 enum ada_renaming_category kind
;
3667 return ADA_NOT_RENAMING
;
3668 switch (SYMBOL_CLASS (sym
))
3671 return ADA_NOT_RENAMING
;
3673 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3674 renamed_entity
, len
, renaming_expr
);
3678 case LOC_OPTIMIZED_OUT
:
3679 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3681 return ADA_NOT_RENAMING
;
3685 kind
= ADA_OBJECT_RENAMING
;
3689 kind
= ADA_EXCEPTION_RENAMING
;
3693 kind
= ADA_PACKAGE_RENAMING
;
3697 kind
= ADA_SUBPROGRAM_RENAMING
;
3701 return ADA_NOT_RENAMING
;
3705 if (renamed_entity
!= NULL
)
3706 *renamed_entity
= info
;
3707 suffix
= strstr (info
, "___XE");
3708 if (suffix
== NULL
|| suffix
== info
)
3709 return ADA_NOT_RENAMING
;
3711 *len
= strlen (info
) - strlen (suffix
);
3713 if (renaming_expr
!= NULL
)
3714 *renaming_expr
= suffix
;
3718 /* Assuming TYPE encodes a renaming according to the old encoding in
3719 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3720 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3721 ADA_NOT_RENAMING otherwise. */
3722 static enum ada_renaming_category
3723 parse_old_style_renaming (struct type
*type
,
3724 const char **renamed_entity
, int *len
,
3725 const char **renaming_expr
)
3727 enum ada_renaming_category kind
;
3732 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3733 || TYPE_NFIELDS (type
) != 1)
3734 return ADA_NOT_RENAMING
;
3736 name
= type_name_no_tag (type
);
3738 return ADA_NOT_RENAMING
;
3740 name
= strstr (name
, "___XR");
3742 return ADA_NOT_RENAMING
;
3747 kind
= ADA_OBJECT_RENAMING
;
3750 kind
= ADA_EXCEPTION_RENAMING
;
3753 kind
= ADA_PACKAGE_RENAMING
;
3756 kind
= ADA_SUBPROGRAM_RENAMING
;
3759 return ADA_NOT_RENAMING
;
3762 info
= TYPE_FIELD_NAME (type
, 0);
3764 return ADA_NOT_RENAMING
;
3765 if (renamed_entity
!= NULL
)
3766 *renamed_entity
= info
;
3767 suffix
= strstr (info
, "___XE");
3768 if (renaming_expr
!= NULL
)
3769 *renaming_expr
= suffix
+ 5;
3770 if (suffix
== NULL
|| suffix
== info
)
3771 return ADA_NOT_RENAMING
;
3773 *len
= suffix
- info
;
3779 /* Evaluation: Function Calls */
3781 /* Return an lvalue containing the value VAL. This is the identity on
3782 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3783 on the stack, using and updating *SP as the stack pointer, and
3784 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3786 static struct value
*
3787 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3789 if (! VALUE_LVAL (val
))
3791 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3793 /* The following is taken from the structure-return code in
3794 call_function_by_hand. FIXME: Therefore, some refactoring seems
3796 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3798 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3799 reserving sufficient space. */
3801 if (gdbarch_frame_align_p (current_gdbarch
))
3802 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3803 VALUE_ADDRESS (val
) = *sp
;
3807 /* Stack grows upward. Align the frame, allocate space, and
3808 then again, re-align the frame. */
3809 if (gdbarch_frame_align_p (current_gdbarch
))
3810 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3811 VALUE_ADDRESS (val
) = *sp
;
3813 if (gdbarch_frame_align_p (current_gdbarch
))
3814 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3817 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3823 /* Return the value ACTUAL, converted to be an appropriate value for a
3824 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3825 allocating any necessary descriptors (fat pointers), or copies of
3826 values not residing in memory, updating it as needed. */
3828 static struct value
*
3829 convert_actual (struct value
*actual
, struct type
*formal_type0
,
3832 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3833 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3834 struct type
*formal_target
=
3835 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3836 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3837 struct type
*actual_target
=
3838 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3839 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3841 if (ada_is_array_descriptor_type (formal_target
)
3842 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3843 return make_array_descriptor (formal_type
, actual
, sp
);
3844 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
)
3846 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3847 && ada_is_array_descriptor_type (actual_target
))
3848 return desc_data (actual
);
3849 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3851 if (VALUE_LVAL (actual
) != lval_memory
)
3854 actual_type
= ada_check_typedef (value_type (actual
));
3855 val
= allocate_value (actual_type
);
3856 memcpy ((char *) value_contents_raw (val
),
3857 (char *) value_contents (actual
),
3858 TYPE_LENGTH (actual_type
));
3859 actual
= ensure_lval (val
, sp
);
3861 return value_addr (actual
);
3864 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3865 return ada_value_ind (actual
);
3871 /* Push a descriptor of type TYPE for array value ARR on the stack at
3872 *SP, updating *SP to reflect the new descriptor. Return either
3873 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3874 to-descriptor type rather than a descriptor type), a struct value *
3875 representing a pointer to this descriptor. */
3877 static struct value
*
3878 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3880 struct type
*bounds_type
= desc_bounds_type (type
);
3881 struct type
*desc_type
= desc_base_type (type
);
3882 struct value
*descriptor
= allocate_value (desc_type
);
3883 struct value
*bounds
= allocate_value (bounds_type
);
3886 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3888 modify_general_field (value_contents_writeable (bounds
),
3889 value_as_long (ada_array_bound (arr
, i
, 0)),
3890 desc_bound_bitpos (bounds_type
, i
, 0),
3891 desc_bound_bitsize (bounds_type
, i
, 0));
3892 modify_general_field (value_contents_writeable (bounds
),
3893 value_as_long (ada_array_bound (arr
, i
, 1)),
3894 desc_bound_bitpos (bounds_type
, i
, 1),
3895 desc_bound_bitsize (bounds_type
, i
, 1));
3898 bounds
= ensure_lval (bounds
, sp
);
3900 modify_general_field (value_contents_writeable (descriptor
),
3901 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3902 fat_pntr_data_bitpos (desc_type
),
3903 fat_pntr_data_bitsize (desc_type
));
3905 modify_general_field (value_contents_writeable (descriptor
),
3906 VALUE_ADDRESS (bounds
),
3907 fat_pntr_bounds_bitpos (desc_type
),
3908 fat_pntr_bounds_bitsize (desc_type
));
3910 descriptor
= ensure_lval (descriptor
, sp
);
3912 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3913 return value_addr (descriptor
);
3919 /* Assuming a dummy frame has been established on the target, perform any
3920 conversions needed for calling function FUNC on the NARGS actual
3921 parameters in ARGS, other than standard C conversions. Does
3922 nothing if FUNC does not have Ada-style prototype data, or if NARGS
3923 does not match the number of arguments expected. Use *SP as a
3924 stack pointer for additional data that must be pushed, updating its
3928 ada_convert_actuals (struct value
*func
, int nargs
, struct value
*args
[],
3933 if (TYPE_NFIELDS (value_type (func
)) == 0
3934 || nargs
!= TYPE_NFIELDS (value_type (func
)))
3937 for (i
= 0; i
< nargs
; i
+= 1)
3939 convert_actual (args
[i
], TYPE_FIELD_TYPE (value_type (func
), i
), sp
);
3942 /* Dummy definitions for an experimental caching module that is not
3943 * used in the public sources. */
3946 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3947 struct symbol
**sym
, struct block
**block
,
3948 struct symtab
**symtab
)
3954 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3955 struct block
*block
, struct symtab
*symtab
)
3961 /* Return the result of a standard (literal, C-like) lookup of NAME in
3962 given DOMAIN, visible from lexical block BLOCK. */
3964 static struct symbol
*
3965 standard_lookup (const char *name
, const struct block
*block
,
3969 struct symtab
*symtab
;
3971 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
, NULL
))
3974 lookup_symbol_in_language (name
, block
, domain
, language_c
, 0, &symtab
);
3975 cache_symbol (name
, domain
, sym
, block_found
, symtab
);
3980 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3981 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3982 since they contend in overloading in the same way. */
3984 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3988 for (i
= 0; i
< n
; i
+= 1)
3989 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3990 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3991 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3997 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3998 struct types. Otherwise, they may not. */
4001 equiv_types (struct type
*type0
, struct type
*type1
)
4005 if (type0
== NULL
|| type1
== NULL
4006 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4008 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4009 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4010 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4011 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4017 /* True iff SYM0 represents the same entity as SYM1, or one that is
4018 no more defined than that of SYM1. */
4021 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4025 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4026 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4029 switch (SYMBOL_CLASS (sym0
))
4035 struct type
*type0
= SYMBOL_TYPE (sym0
);
4036 struct type
*type1
= SYMBOL_TYPE (sym1
);
4037 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4038 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4039 int len0
= strlen (name0
);
4041 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4042 && (equiv_types (type0
, type1
)
4043 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4044 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4047 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4048 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4054 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4055 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4058 add_defn_to_vec (struct obstack
*obstackp
,
4060 struct block
*block
, struct symtab
*symtab
)
4064 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4066 /* Do not try to complete stub types, as the debugger is probably
4067 already scanning all symbols matching a certain name at the
4068 time when this function is called. Trying to replace the stub
4069 type by its associated full type will cause us to restart a scan
4070 which may lead to an infinite recursion. Instead, the client
4071 collecting the matching symbols will end up collecting several
4072 matches, with at least one of them complete. It can then filter
4073 out the stub ones if needed. */
4075 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4077 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4079 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4081 prevDefns
[i
].sym
= sym
;
4082 prevDefns
[i
].block
= block
;
4083 prevDefns
[i
].symtab
= symtab
;
4089 struct ada_symbol_info info
;
4093 info
.symtab
= symtab
;
4094 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4098 /* Number of ada_symbol_info structures currently collected in
4099 current vector in *OBSTACKP. */
4102 num_defns_collected (struct obstack
*obstackp
)
4104 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4107 /* Vector of ada_symbol_info structures currently collected in current
4108 vector in *OBSTACKP. If FINISH, close off the vector and return
4109 its final address. */
4111 static struct ada_symbol_info
*
4112 defns_collected (struct obstack
*obstackp
, int finish
)
4115 return obstack_finish (obstackp
);
4117 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4120 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4121 Check the global symbols if GLOBAL, the static symbols if not.
4122 Do wild-card match if WILD. */
4124 static struct partial_symbol
*
4125 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4126 int global
, domain_enum
namespace, int wild
)
4128 struct partial_symbol
**start
;
4129 int name_len
= strlen (name
);
4130 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4139 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4140 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4144 for (i
= 0; i
< length
; i
+= 1)
4146 struct partial_symbol
*psym
= start
[i
];
4148 if (SYMBOL_DOMAIN (psym
) == namespace
4149 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4163 int M
= (U
+ i
) >> 1;
4164 struct partial_symbol
*psym
= start
[M
];
4165 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4167 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4169 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4180 struct partial_symbol
*psym
= start
[i
];
4182 if (SYMBOL_DOMAIN (psym
) == namespace)
4184 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4192 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4206 int M
= (U
+ i
) >> 1;
4207 struct partial_symbol
*psym
= start
[M
];
4208 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4210 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4212 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4223 struct partial_symbol
*psym
= start
[i
];
4225 if (SYMBOL_DOMAIN (psym
) == namespace)
4229 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4232 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4234 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4244 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4254 /* Find a symbol table containing symbol SYM or NULL if none. */
4256 static struct symtab
*
4257 symtab_for_sym (struct symbol
*sym
)
4260 struct objfile
*objfile
;
4262 struct symbol
*tmp_sym
;
4263 struct dict_iterator iter
;
4266 ALL_PRIMARY_SYMTABS (objfile
, s
)
4268 switch (SYMBOL_CLASS (sym
))
4276 case LOC_CONST_BYTES
:
4277 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4278 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4280 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4281 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4287 switch (SYMBOL_CLASS (sym
))
4293 case LOC_REGPARM_ADDR
:
4298 case LOC_BASEREG_ARG
:
4300 case LOC_COMPUTED_ARG
:
4301 for (j
= FIRST_LOCAL_BLOCK
;
4302 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4304 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4305 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4316 /* Return a minimal symbol matching NAME according to Ada decoding
4317 rules. Returns NULL if there is no such minimal symbol. Names
4318 prefixed with "standard__" are handled specially: "standard__" is
4319 first stripped off, and only static and global symbols are searched. */
4321 struct minimal_symbol
*
4322 ada_lookup_simple_minsym (const char *name
)
4324 struct objfile
*objfile
;
4325 struct minimal_symbol
*msymbol
;
4328 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4330 name
+= sizeof ("standard__") - 1;
4334 wild_match
= (strstr (name
, "__") == NULL
);
4336 ALL_MSYMBOLS (objfile
, msymbol
)
4338 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4339 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4346 /* For all subprograms that statically enclose the subprogram of the
4347 selected frame, add symbols matching identifier NAME in DOMAIN
4348 and their blocks to the list of data in OBSTACKP, as for
4349 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4353 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4354 const char *name
, domain_enum
namespace,
4359 /* True if TYPE is definitely an artificial type supplied to a symbol
4360 for which no debugging information was given in the symbol file. */
4363 is_nondebugging_type (struct type
*type
)
4365 char *name
= ada_type_name (type
);
4366 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4369 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4370 duplicate other symbols in the list (The only case I know of where
4371 this happens is when object files containing stabs-in-ecoff are
4372 linked with files containing ordinary ecoff debugging symbols (or no
4373 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4374 Returns the number of items in the modified list. */
4377 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4384 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4385 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4386 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4388 for (j
= 0; j
< nsyms
; j
+= 1)
4391 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4392 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4393 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4394 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4395 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4396 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4399 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4400 syms
[k
- 1] = syms
[k
];
4413 /* Given a type that corresponds to a renaming entity, use the type name
4414 to extract the scope (package name or function name, fully qualified,
4415 and following the GNAT encoding convention) where this renaming has been
4416 defined. The string returned needs to be deallocated after use. */
4419 xget_renaming_scope (struct type
*renaming_type
)
4421 /* The renaming types adhere to the following convention:
4422 <scope>__<rename>___<XR extension>.
4423 So, to extract the scope, we search for the "___XR" extension,
4424 and then backtrack until we find the first "__". */
4426 const char *name
= type_name_no_tag (renaming_type
);
4427 char *suffix
= strstr (name
, "___XR");
4432 /* Now, backtrack a bit until we find the first "__". Start looking
4433 at suffix - 3, as the <rename> part is at least one character long. */
4435 for (last
= suffix
- 3; last
> name
; last
--)
4436 if (last
[0] == '_' && last
[1] == '_')
4439 /* Make a copy of scope and return it. */
4441 scope_len
= last
- name
;
4442 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4444 strncpy (scope
, name
, scope_len
);
4445 scope
[scope_len
] = '\0';
4450 /* Return nonzero if NAME corresponds to a package name. */
4453 is_package_name (const char *name
)
4455 /* Here, We take advantage of the fact that no symbols are generated
4456 for packages, while symbols are generated for each function.
4457 So the condition for NAME represent a package becomes equivalent
4458 to NAME not existing in our list of symbols. There is only one
4459 small complication with library-level functions (see below). */
4463 /* If it is a function that has not been defined at library level,
4464 then we should be able to look it up in the symbols. */
4465 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4468 /* Library-level function names start with "_ada_". See if function
4469 "_ada_" followed by NAME can be found. */
4471 /* Do a quick check that NAME does not contain "__", since library-level
4472 functions names cannot contain "__" in them. */
4473 if (strstr (name
, "__") != NULL
)
4476 fun_name
= xstrprintf ("_ada_%s", name
);
4478 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4481 /* Return nonzero if SYM corresponds to a renaming entity that is
4482 not visible from FUNCTION_NAME. */
4485 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4489 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4492 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4494 make_cleanup (xfree
, scope
);
4496 /* If the rename has been defined in a package, then it is visible. */
4497 if (is_package_name (scope
))
4500 /* Check that the rename is in the current function scope by checking
4501 that its name starts with SCOPE. */
4503 /* If the function name starts with "_ada_", it means that it is
4504 a library-level function. Strip this prefix before doing the
4505 comparison, as the encoding for the renaming does not contain
4507 if (strncmp (function_name
, "_ada_", 5) == 0)
4510 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4513 /* Remove entries from SYMS that corresponds to a renaming entity that
4514 is not visible from the function associated with CURRENT_BLOCK or
4515 that is superfluous due to the presence of more specific renaming
4516 information. Places surviving symbols in the initial entries of
4517 SYMS and returns the number of surviving symbols.
4520 First, in cases where an object renaming is implemented as a
4521 reference variable, GNAT may produce both the actual reference
4522 variable and the renaming encoding. In this case, we discard the
4525 Second, GNAT emits a type following a specified encoding for each renaming
4526 entity. Unfortunately, STABS currently does not support the definition
4527 of types that are local to a given lexical block, so all renamings types
4528 are emitted at library level. As a consequence, if an application
4529 contains two renaming entities using the same name, and a user tries to
4530 print the value of one of these entities, the result of the ada symbol
4531 lookup will also contain the wrong renaming type.
4533 This function partially covers for this limitation by attempting to
4534 remove from the SYMS list renaming symbols that should be visible
4535 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4536 method with the current information available. The implementation
4537 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4539 - When the user tries to print a rename in a function while there
4540 is another rename entity defined in a package: Normally, the
4541 rename in the function has precedence over the rename in the
4542 package, so the latter should be removed from the list. This is
4543 currently not the case.
4545 - This function will incorrectly remove valid renames if
4546 the CURRENT_BLOCK corresponds to a function which symbol name
4547 has been changed by an "Export" pragma. As a consequence,
4548 the user will be unable to print such rename entities. */
4551 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4552 int nsyms
, const struct block
*current_block
)
4554 struct symbol
*current_function
;
4555 char *current_function_name
;
4557 int is_new_style_renaming
;
4559 /* If there is both a renaming foo___XR... encoded as a variable and
4560 a simple variable foo in the same block, discard the latter.
4561 First, zero out such symbols, then compress. */
4562 is_new_style_renaming
= 0;
4563 for (i
= 0; i
< nsyms
; i
+= 1)
4565 struct symbol
*sym
= syms
[i
].sym
;
4566 struct block
*block
= syms
[i
].block
;
4570 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4572 name
= SYMBOL_LINKAGE_NAME (sym
);
4573 suffix
= strstr (name
, "___XR");
4577 int name_len
= suffix
- name
;
4579 is_new_style_renaming
= 1;
4580 for (j
= 0; j
< nsyms
; j
+= 1)
4581 if (i
!= j
&& syms
[j
].sym
!= NULL
4582 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4584 && block
== syms
[j
].block
)
4588 if (is_new_style_renaming
)
4592 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4593 if (syms
[j
].sym
!= NULL
)
4601 /* Extract the function name associated to CURRENT_BLOCK.
4602 Abort if unable to do so. */
4604 if (current_block
== NULL
)
4607 current_function
= block_function (current_block
);
4608 if (current_function
== NULL
)
4611 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4612 if (current_function_name
== NULL
)
4615 /* Check each of the symbols, and remove it from the list if it is
4616 a type corresponding to a renaming that is out of the scope of
4617 the current block. */
4622 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4623 == ADA_OBJECT_RENAMING
4624 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4627 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4628 syms
[j
- 1] = syms
[j
];
4638 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4639 scope and in global scopes, returning the number of matches. Sets
4640 *RESULTS to point to a vector of (SYM,BLOCK,SYMTAB) triples,
4641 indicating the symbols found and the blocks and symbol tables (if
4642 any) in which they were found. This vector are transient---good only to
4643 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4644 symbol match within the nest of blocks whose innermost member is BLOCK0,
4645 is the one match returned (no other matches in that or
4646 enclosing blocks is returned). If there are any matches in or
4647 surrounding BLOCK0, then these alone are returned. Otherwise, the
4648 search extends to global and file-scope (static) symbol tables.
4649 Names prefixed with "standard__" are handled specially: "standard__"
4650 is first stripped off, and only static and global symbols are searched. */
4653 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4654 domain_enum
namespace,
4655 struct ada_symbol_info
**results
)
4659 struct partial_symtab
*ps
;
4660 struct blockvector
*bv
;
4661 struct objfile
*objfile
;
4662 struct block
*block
;
4664 struct minimal_symbol
*msymbol
;
4670 obstack_free (&symbol_list_obstack
, NULL
);
4671 obstack_init (&symbol_list_obstack
);
4675 /* Search specified block and its superiors. */
4677 wild_match
= (strstr (name0
, "__") == NULL
);
4679 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4680 needed, but adding const will
4681 have a cascade effect. */
4682 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4686 name
= name0
+ sizeof ("standard__") - 1;
4690 while (block
!= NULL
)
4693 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4694 namespace, NULL
, NULL
, wild_match
);
4696 /* If we found a non-function match, assume that's the one. */
4697 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4698 num_defns_collected (&symbol_list_obstack
)))
4701 block
= BLOCK_SUPERBLOCK (block
);
4704 /* If no luck so far, try to find NAME as a local symbol in some lexically
4705 enclosing subprogram. */
4706 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4707 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4708 name
, namespace, wild_match
);
4710 /* If we found ANY matches among non-global symbols, we're done. */
4712 if (num_defns_collected (&symbol_list_obstack
) > 0)
4716 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
, &s
))
4719 add_defn_to_vec (&symbol_list_obstack
, sym
, block
, s
);
4723 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4724 tables, and psymtab's. */
4726 ALL_PRIMARY_SYMTABS (objfile
, s
)
4729 bv
= BLOCKVECTOR (s
);
4730 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4731 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4732 objfile
, s
, wild_match
);
4735 if (namespace == VAR_DOMAIN
)
4737 ALL_MSYMBOLS (objfile
, msymbol
)
4739 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4741 switch (MSYMBOL_TYPE (msymbol
))
4743 case mst_solib_trampoline
:
4746 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4749 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4751 bv
= BLOCKVECTOR (s
);
4752 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4753 ada_add_block_symbols (&symbol_list_obstack
, block
,
4754 SYMBOL_LINKAGE_NAME (msymbol
),
4755 namespace, objfile
, s
, wild_match
);
4757 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4759 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4760 ada_add_block_symbols (&symbol_list_obstack
, block
,
4761 SYMBOL_LINKAGE_NAME (msymbol
),
4762 namespace, objfile
, s
,
4771 ALL_PSYMTABS (objfile
, ps
)
4775 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4777 s
= PSYMTAB_TO_SYMTAB (ps
);
4780 bv
= BLOCKVECTOR (s
);
4781 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4782 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4783 namespace, objfile
, s
, wild_match
);
4787 /* Now add symbols from all per-file blocks if we've gotten no hits
4788 (Not strictly correct, but perhaps better than an error).
4789 Do the symtabs first, then check the psymtabs. */
4791 if (num_defns_collected (&symbol_list_obstack
) == 0)
4794 ALL_PRIMARY_SYMTABS (objfile
, s
)
4797 bv
= BLOCKVECTOR (s
);
4798 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4799 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4800 objfile
, s
, wild_match
);
4803 ALL_PSYMTABS (objfile
, ps
)
4807 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4809 s
= PSYMTAB_TO_SYMTAB (ps
);
4810 bv
= BLOCKVECTOR (s
);
4813 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4814 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4815 namespace, objfile
, s
, wild_match
);
4821 ndefns
= num_defns_collected (&symbol_list_obstack
);
4822 *results
= defns_collected (&symbol_list_obstack
, 1);
4824 ndefns
= remove_extra_symbols (*results
, ndefns
);
4827 cache_symbol (name0
, namespace, NULL
, NULL
, NULL
);
4829 if (ndefns
== 1 && cacheIfUnique
)
4830 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
,
4831 (*results
)[0].symtab
);
4833 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4839 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4840 domain_enum
namespace,
4841 struct block
**block_found
, struct symtab
**symtab
)
4843 struct ada_symbol_info
*candidates
;
4846 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4848 if (n_candidates
== 0)
4851 if (block_found
!= NULL
)
4852 *block_found
= candidates
[0].block
;
4856 *symtab
= candidates
[0].symtab
;
4857 if (*symtab
== NULL
&& candidates
[0].block
!= NULL
)
4859 struct objfile
*objfile
;
4862 struct blockvector
*bv
;
4864 /* Search the list of symtabs for one which contains the
4865 address of the start of this block. */
4866 ALL_PRIMARY_SYMTABS (objfile
, s
)
4868 bv
= BLOCKVECTOR (s
);
4869 b
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4870 if (BLOCK_START (b
) <= BLOCK_START (candidates
[0].block
)
4871 && BLOCK_END (b
) > BLOCK_START (candidates
[0].block
))
4874 return fixup_symbol_section (candidates
[0].sym
, objfile
);
4877 /* FIXME: brobecker/2004-11-12: I think that we should never
4878 reach this point. I don't see a reason why we would not
4879 find a symtab for a given block, so I suggest raising an
4880 internal_error exception here. Otherwise, we end up
4881 returning a symbol but no symtab, which certain parts of
4882 the code that rely (indirectly) on this function do not
4883 expect, eventually causing a SEGV. */
4884 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4887 return candidates
[0].sym
;
4890 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4891 scope and in global scopes, or NULL if none. NAME is folded and
4892 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4893 choosing the first symbol if there are multiple choices.
4894 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4895 table in which the symbol was found (in both cases, these
4896 assignments occur only if the pointers are non-null). */
4898 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4899 domain_enum
namespace, int *is_a_field_of_this
,
4900 struct symtab
**symtab
)
4902 if (is_a_field_of_this
!= NULL
)
4903 *is_a_field_of_this
= 0;
4906 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4907 block0
, namespace, NULL
, symtab
);
4910 static struct symbol
*
4911 ada_lookup_symbol_nonlocal (const char *name
,
4912 const char *linkage_name
,
4913 const struct block
*block
,
4914 const domain_enum domain
, struct symtab
**symtab
)
4916 if (linkage_name
== NULL
)
4917 linkage_name
= name
;
4918 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4923 /* True iff STR is a possible encoded suffix of a normal Ada name
4924 that is to be ignored for matching purposes. Suffixes of parallel
4925 names (e.g., XVE) are not included here. Currently, the possible suffixes
4926 are given by either of the regular expression:
4928 (__[0-9]+)?[.$][0-9]+ [nested subprogram suffix, on platforms such
4930 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4931 _E[0-9]+[bs]$ [protected object entry suffixes]
4932 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4936 is_name_suffix (const char *str
)
4939 const char *matching
;
4940 const int len
= strlen (str
);
4942 /* (__[0-9]+)?\.[0-9]+ */
4944 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4947 while (isdigit (matching
[0]))
4949 if (matching
[0] == '\0')
4953 if (matching
[0] == '.' || matching
[0] == '$')
4956 while (isdigit (matching
[0]))
4958 if (matching
[0] == '\0')
4963 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4966 while (isdigit (matching
[0]))
4968 if (matching
[0] == '\0')
4973 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4974 with a N at the end. Unfortunately, the compiler uses the same
4975 convention for other internal types it creates. So treating
4976 all entity names that end with an "N" as a name suffix causes
4977 some regressions. For instance, consider the case of an enumerated
4978 type. To support the 'Image attribute, it creates an array whose
4980 Having a single character like this as a suffix carrying some
4981 information is a bit risky. Perhaps we should change the encoding
4982 to be something like "_N" instead. In the meantime, do not do
4983 the following check. */
4984 /* Protected Object Subprograms */
4985 if (len
== 1 && str
[0] == 'N')
4990 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4993 while (isdigit (matching
[0]))
4995 if ((matching
[0] == 'b' || matching
[0] == 's')
4996 && matching
[1] == '\0')
5000 /* ??? We should not modify STR directly, as we are doing below. This
5001 is fine in this case, but may become problematic later if we find
5002 that this alternative did not work, and want to try matching
5003 another one from the begining of STR. Since we modified it, we
5004 won't be able to find the begining of the string anymore! */
5008 while (str
[0] != '_' && str
[0] != '\0')
5010 if (str
[0] != 'n' && str
[0] != 'b')
5015 if (str
[0] == '\000')
5019 if (str
[1] != '_' || str
[2] == '\000')
5023 if (strcmp (str
+ 3, "JM") == 0)
5025 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5026 the LJM suffix in favor of the JM one. But we will
5027 still accept LJM as a valid suffix for a reasonable
5028 amount of time, just to allow ourselves to debug programs
5029 compiled using an older version of GNAT. */
5030 if (strcmp (str
+ 3, "LJM") == 0)
5034 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5035 || str
[4] == 'U' || str
[4] == 'P')
5037 if (str
[4] == 'R' && str
[5] != 'T')
5041 if (!isdigit (str
[2]))
5043 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5044 if (!isdigit (str
[k
]) && str
[k
] != '_')
5048 if (str
[0] == '$' && isdigit (str
[1]))
5050 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5051 if (!isdigit (str
[k
]) && str
[k
] != '_')
5058 /* Return nonzero if the given string starts with a dot ('.')
5059 followed by zero or more digits.
5061 Note: brobecker/2003-11-10: A forward declaration has not been
5062 added at the begining of this file yet, because this function
5063 is only used to work around a problem found during wild matching
5064 when trying to match minimal symbol names against symbol names
5065 obtained from dwarf-2 data. This function is therefore currently
5066 only used in wild_match() and is likely to be deleted when the
5067 problem in dwarf-2 is fixed. */
5070 is_dot_digits_suffix (const char *str
)
5076 while (isdigit (str
[0]))
5078 return (str
[0] == '\0');
5081 /* Return non-zero if the string starting at NAME and ending before
5082 NAME_END contains no capital letters. */
5085 is_valid_name_for_wild_match (const char *name0
)
5087 const char *decoded_name
= ada_decode (name0
);
5090 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5091 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5097 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5098 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5099 informational suffixes of NAME (i.e., for which is_name_suffix is
5103 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5110 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5111 stored in the symbol table for nested function names is sometimes
5112 different from the name of the associated entity stored in
5113 the dwarf-2 data: This is the case for nested subprograms, where
5114 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5115 while the symbol name from the dwarf-2 data does not.
5117 Although the DWARF-2 standard documents that entity names stored
5118 in the dwarf-2 data should be identical to the name as seen in
5119 the source code, GNAT takes a different approach as we already use
5120 a special encoding mechanism to convey the information so that
5121 a C debugger can still use the information generated to debug
5122 Ada programs. A corollary is that the symbol names in the dwarf-2
5123 data should match the names found in the symbol table. I therefore
5124 consider this issue as a compiler defect.
5126 Until the compiler is properly fixed, we work-around the problem
5127 by ignoring such suffixes during the match. We do so by making
5128 a copy of PATN0 and NAME0, and then by stripping such a suffix
5129 if present. We then perform the match on the resulting strings. */
5132 name_len
= strlen (name0
);
5134 name
= name_start
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5135 strcpy (name
, name0
);
5136 dot
= strrchr (name
, '.');
5137 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5140 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5141 strncpy (patn
, patn0
, patn_len
);
5142 patn
[patn_len
] = '\0';
5143 dot
= strrchr (patn
, '.');
5144 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5147 patn_len
= dot
- patn
;
5151 /* Now perform the wild match. */
5153 name_len
= strlen (name
);
5154 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5155 && strncmp (patn
, name
+ 5, patn_len
) == 0
5156 && is_name_suffix (name
+ patn_len
+ 5))
5159 while (name_len
>= patn_len
)
5161 if (strncmp (patn
, name
, patn_len
) == 0
5162 && is_name_suffix (name
+ patn_len
))
5163 return (name
== name_start
|| is_valid_name_for_wild_match (name0
));
5170 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5175 if (!islower (name
[2]))
5182 if (!islower (name
[1]))
5193 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5194 vector *defn_symbols, updating the list of symbols in OBSTACKP
5195 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5196 OBJFILE is the section containing BLOCK.
5197 SYMTAB is recorded with each symbol added. */
5200 ada_add_block_symbols (struct obstack
*obstackp
,
5201 struct block
*block
, const char *name
,
5202 domain_enum domain
, struct objfile
*objfile
,
5203 struct symtab
*symtab
, int wild
)
5205 struct dict_iterator iter
;
5206 int name_len
= strlen (name
);
5207 /* A matching argument symbol, if any. */
5208 struct symbol
*arg_sym
;
5209 /* Set true when we find a matching non-argument symbol. */
5218 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5220 if (SYMBOL_DOMAIN (sym
) == domain
5221 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5223 switch (SYMBOL_CLASS (sym
))
5229 case LOC_REGPARM_ADDR
:
5230 case LOC_BASEREG_ARG
:
5231 case LOC_COMPUTED_ARG
:
5234 case LOC_UNRESOLVED
:
5238 add_defn_to_vec (obstackp
,
5239 fixup_symbol_section (sym
, objfile
),
5248 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5250 if (SYMBOL_DOMAIN (sym
) == domain
)
5252 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5254 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5256 switch (SYMBOL_CLASS (sym
))
5262 case LOC_REGPARM_ADDR
:
5263 case LOC_BASEREG_ARG
:
5264 case LOC_COMPUTED_ARG
:
5267 case LOC_UNRESOLVED
:
5271 add_defn_to_vec (obstackp
,
5272 fixup_symbol_section (sym
, objfile
),
5281 if (!found_sym
&& arg_sym
!= NULL
)
5283 add_defn_to_vec (obstackp
,
5284 fixup_symbol_section (arg_sym
, objfile
),
5293 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5295 if (SYMBOL_DOMAIN (sym
) == domain
)
5299 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5302 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5304 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5309 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5311 switch (SYMBOL_CLASS (sym
))
5317 case LOC_REGPARM_ADDR
:
5318 case LOC_BASEREG_ARG
:
5319 case LOC_COMPUTED_ARG
:
5322 case LOC_UNRESOLVED
:
5326 add_defn_to_vec (obstackp
,
5327 fixup_symbol_section (sym
, objfile
),
5335 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5336 They aren't parameters, right? */
5337 if (!found_sym
&& arg_sym
!= NULL
)
5339 add_defn_to_vec (obstackp
,
5340 fixup_symbol_section (arg_sym
, objfile
),
5348 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5349 for tagged types. */
5352 ada_is_dispatch_table_ptr_type (struct type
*type
)
5356 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5359 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5363 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5366 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5367 to be invisible to users. */
5370 ada_is_ignored_field (struct type
*type
, int field_num
)
5372 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5375 /* Check the name of that field. */
5377 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5379 /* Anonymous field names should not be printed.
5380 brobecker/2007-02-20: I don't think this can actually happen
5381 but we don't want to print the value of annonymous fields anyway. */
5385 /* A field named "_parent" is internally generated by GNAT for
5386 tagged types, and should not be printed either. */
5387 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5391 /* If this is the dispatch table of a tagged type, then ignore. */
5392 if (ada_is_tagged_type (type
, 1)
5393 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5396 /* Not a special field, so it should not be ignored. */
5400 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5401 pointer or reference type whose ultimate target has a tag field. */
5404 ada_is_tagged_type (struct type
*type
, int refok
)
5406 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5409 /* True iff TYPE represents the type of X'Tag */
5412 ada_is_tag_type (struct type
*type
)
5414 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5418 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5419 return (name
!= NULL
5420 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5424 /* The type of the tag on VAL. */
5427 ada_tag_type (struct value
*val
)
5429 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5432 /* The value of the tag on VAL. */
5435 ada_value_tag (struct value
*val
)
5437 return ada_value_struct_elt (val
, "_tag", 0);
5440 /* The value of the tag on the object of type TYPE whose contents are
5441 saved at VALADDR, if it is non-null, or is at memory address
5444 static struct value
*
5445 value_tag_from_contents_and_address (struct type
*type
,
5446 const gdb_byte
*valaddr
,
5449 int tag_byte_offset
, dummy1
, dummy2
;
5450 struct type
*tag_type
;
5451 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5454 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5456 : valaddr
+ tag_byte_offset
);
5457 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5459 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5464 static struct type
*
5465 type_from_tag (struct value
*tag
)
5467 const char *type_name
= ada_tag_name (tag
);
5468 if (type_name
!= NULL
)
5469 return ada_find_any_type (ada_encode (type_name
));
5480 static int ada_tag_name_1 (void *);
5481 static int ada_tag_name_2 (struct tag_args
*);
5483 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5484 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5485 The value stored in ARGS->name is valid until the next call to
5489 ada_tag_name_1 (void *args0
)
5491 struct tag_args
*args
= (struct tag_args
*) args0
;
5492 static char name
[1024];
5496 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5498 return ada_tag_name_2 (args
);
5499 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5502 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5503 for (p
= name
; *p
!= '\0'; p
+= 1)
5510 /* Utility function for ada_tag_name_1 that tries the second
5511 representation for the dispatch table (in which there is no
5512 explicit 'tsd' field in the referent of the tag pointer, and instead
5513 the tsd pointer is stored just before the dispatch table. */
5516 ada_tag_name_2 (struct tag_args
*args
)
5518 struct type
*info_type
;
5519 static char name
[1024];
5521 struct value
*val
, *valp
;
5524 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5525 if (info_type
== NULL
)
5527 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5528 valp
= value_cast (info_type
, args
->tag
);
5531 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5534 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5537 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5538 for (p
= name
; *p
!= '\0'; p
+= 1)
5545 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5549 ada_tag_name (struct value
*tag
)
5551 struct tag_args args
;
5552 if (!ada_is_tag_type (value_type (tag
)))
5556 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5560 /* The parent type of TYPE, or NULL if none. */
5563 ada_parent_type (struct type
*type
)
5567 type
= ada_check_typedef (type
);
5569 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5572 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5573 if (ada_is_parent_field (type
, i
))
5574 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5579 /* True iff field number FIELD_NUM of structure type TYPE contains the
5580 parent-type (inherited) fields of a derived type. Assumes TYPE is
5581 a structure type with at least FIELD_NUM+1 fields. */
5584 ada_is_parent_field (struct type
*type
, int field_num
)
5586 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5587 return (name
!= NULL
5588 && (strncmp (name
, "PARENT", 6) == 0
5589 || strncmp (name
, "_parent", 7) == 0));
5592 /* True iff field number FIELD_NUM of structure type TYPE is a
5593 transparent wrapper field (which should be silently traversed when doing
5594 field selection and flattened when printing). Assumes TYPE is a
5595 structure type with at least FIELD_NUM+1 fields. Such fields are always
5599 ada_is_wrapper_field (struct type
*type
, int field_num
)
5601 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5602 return (name
!= NULL
5603 && (strncmp (name
, "PARENT", 6) == 0
5604 || strcmp (name
, "REP") == 0
5605 || strncmp (name
, "_parent", 7) == 0
5606 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5609 /* True iff field number FIELD_NUM of structure or union type TYPE
5610 is a variant wrapper. Assumes TYPE is a structure type with at least
5611 FIELD_NUM+1 fields. */
5614 ada_is_variant_part (struct type
*type
, int field_num
)
5616 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5617 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5618 || (is_dynamic_field (type
, field_num
)
5619 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5620 == TYPE_CODE_UNION
)));
5623 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5624 whose discriminants are contained in the record type OUTER_TYPE,
5625 returns the type of the controlling discriminant for the variant. */
5628 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5630 char *name
= ada_variant_discrim_name (var_type
);
5632 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5634 return builtin_type_int
;
5639 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5640 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5641 represents a 'when others' clause; otherwise 0. */
5644 ada_is_others_clause (struct type
*type
, int field_num
)
5646 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5647 return (name
!= NULL
&& name
[0] == 'O');
5650 /* Assuming that TYPE0 is the type of the variant part of a record,
5651 returns the name of the discriminant controlling the variant.
5652 The value is valid until the next call to ada_variant_discrim_name. */
5655 ada_variant_discrim_name (struct type
*type0
)
5657 static char *result
= NULL
;
5658 static size_t result_len
= 0;
5661 const char *discrim_end
;
5662 const char *discrim_start
;
5664 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5665 type
= TYPE_TARGET_TYPE (type0
);
5669 name
= ada_type_name (type
);
5671 if (name
== NULL
|| name
[0] == '\000')
5674 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5677 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5680 if (discrim_end
== name
)
5683 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5686 if (discrim_start
== name
+ 1)
5688 if ((discrim_start
> name
+ 3
5689 && strncmp (discrim_start
- 3, "___", 3) == 0)
5690 || discrim_start
[-1] == '.')
5694 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5695 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5696 result
[discrim_end
- discrim_start
] = '\0';
5700 /* Scan STR for a subtype-encoded number, beginning at position K.
5701 Put the position of the character just past the number scanned in
5702 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5703 Return 1 if there was a valid number at the given position, and 0
5704 otherwise. A "subtype-encoded" number consists of the absolute value
5705 in decimal, followed by the letter 'm' to indicate a negative number.
5706 Assumes 0m does not occur. */
5709 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5713 if (!isdigit (str
[k
]))
5716 /* Do it the hard way so as not to make any assumption about
5717 the relationship of unsigned long (%lu scan format code) and
5720 while (isdigit (str
[k
]))
5722 RU
= RU
* 10 + (str
[k
] - '0');
5729 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5735 /* NOTE on the above: Technically, C does not say what the results of
5736 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5737 number representable as a LONGEST (although either would probably work
5738 in most implementations). When RU>0, the locution in the then branch
5739 above is always equivalent to the negative of RU. */
5746 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5747 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5748 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5751 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5753 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5766 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5775 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5776 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5778 if (val
>= L
&& val
<= U
)
5790 /* FIXME: Lots of redundancy below. Try to consolidate. */
5792 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5793 ARG_TYPE, extract and return the value of one of its (non-static)
5794 fields. FIELDNO says which field. Differs from value_primitive_field
5795 only in that it can handle packed values of arbitrary type. */
5797 static struct value
*
5798 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5799 struct type
*arg_type
)
5803 arg_type
= ada_check_typedef (arg_type
);
5804 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5806 /* Handle packed fields. */
5808 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5810 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5811 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5813 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5814 offset
+ bit_pos
/ 8,
5815 bit_pos
% 8, bit_size
, type
);
5818 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5821 /* Find field with name NAME in object of type TYPE. If found,
5822 set the following for each argument that is non-null:
5823 - *FIELD_TYPE_P to the field's type;
5824 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5825 an object of that type;
5826 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5827 - *BIT_SIZE_P to its size in bits if the field is packed, and
5829 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5830 fields up to but not including the desired field, or by the total
5831 number of fields if not found. A NULL value of NAME never
5832 matches; the function just counts visible fields in this case.
5834 Returns 1 if found, 0 otherwise. */
5837 find_struct_field (char *name
, struct type
*type
, int offset
,
5838 struct type
**field_type_p
,
5839 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5844 type
= ada_check_typedef (type
);
5846 if (field_type_p
!= NULL
)
5847 *field_type_p
= NULL
;
5848 if (byte_offset_p
!= NULL
)
5850 if (bit_offset_p
!= NULL
)
5852 if (bit_size_p
!= NULL
)
5855 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5857 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5858 int fld_offset
= offset
+ bit_pos
/ 8;
5859 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5861 if (t_field_name
== NULL
)
5864 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5866 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5867 if (field_type_p
!= NULL
)
5868 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5869 if (byte_offset_p
!= NULL
)
5870 *byte_offset_p
= fld_offset
;
5871 if (bit_offset_p
!= NULL
)
5872 *bit_offset_p
= bit_pos
% 8;
5873 if (bit_size_p
!= NULL
)
5874 *bit_size_p
= bit_size
;
5877 else if (ada_is_wrapper_field (type
, i
))
5879 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5880 field_type_p
, byte_offset_p
, bit_offset_p
,
5881 bit_size_p
, index_p
))
5884 else if (ada_is_variant_part (type
, i
))
5886 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5889 struct type
*field_type
5890 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5892 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5894 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5896 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5897 field_type_p
, byte_offset_p
,
5898 bit_offset_p
, bit_size_p
, index_p
))
5902 else if (index_p
!= NULL
)
5908 /* Number of user-visible fields in record type TYPE. */
5911 num_visible_fields (struct type
*type
)
5915 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5919 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5920 and search in it assuming it has (class) type TYPE.
5921 If found, return value, else return NULL.
5923 Searches recursively through wrapper fields (e.g., '_parent'). */
5925 static struct value
*
5926 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5930 type
= ada_check_typedef (type
);
5932 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5934 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5936 if (t_field_name
== NULL
)
5939 else if (field_name_match (t_field_name
, name
))
5940 return ada_value_primitive_field (arg
, offset
, i
, type
);
5942 else if (ada_is_wrapper_field (type
, i
))
5944 struct value
*v
= /* Do not let indent join lines here. */
5945 ada_search_struct_field (name
, arg
,
5946 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5947 TYPE_FIELD_TYPE (type
, i
));
5952 else if (ada_is_variant_part (type
, i
))
5954 /* PNH: Do we ever get here? See find_struct_field. */
5956 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5957 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
5959 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5961 struct value
*v
= ada_search_struct_field
/* Force line break. */
5963 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5964 TYPE_FIELD_TYPE (field_type
, j
));
5973 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
5974 int, struct type
*);
5977 /* Return field #INDEX in ARG, where the index is that returned by
5978 * find_struct_field through its INDEX_P argument. Adjust the address
5979 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
5980 * If found, return value, else return NULL. */
5982 static struct value
*
5983 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
5986 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
5990 /* Auxiliary function for ada_index_struct_field. Like
5991 * ada_index_struct_field, but takes index from *INDEX_P and modifies
5994 static struct value
*
5995 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
5999 type
= ada_check_typedef (type
);
6001 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6003 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6005 else if (ada_is_wrapper_field (type
, i
))
6007 struct value
*v
= /* Do not let indent join lines here. */
6008 ada_index_struct_field_1 (index_p
, arg
,
6009 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6010 TYPE_FIELD_TYPE (type
, i
));
6015 else if (ada_is_variant_part (type
, i
))
6017 /* PNH: Do we ever get here? See ada_search_struct_field,
6018 find_struct_field. */
6019 error (_("Cannot assign this kind of variant record"));
6021 else if (*index_p
== 0)
6022 return ada_value_primitive_field (arg
, offset
, i
, type
);
6029 /* Given ARG, a value of type (pointer or reference to a)*
6030 structure/union, extract the component named NAME from the ultimate
6031 target structure/union and return it as a value with its
6032 appropriate type. If ARG is a pointer or reference and the field
6033 is not packed, returns a reference to the field, otherwise the
6034 value of the field (an lvalue if ARG is an lvalue).
6036 The routine searches for NAME among all members of the structure itself
6037 and (recursively) among all members of any wrapper members
6040 If NO_ERR, then simply return NULL in case of error, rather than
6044 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6046 struct type
*t
, *t1
;
6050 t1
= t
= ada_check_typedef (value_type (arg
));
6051 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6053 t1
= TYPE_TARGET_TYPE (t
);
6056 t1
= ada_check_typedef (t1
);
6057 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6059 arg
= coerce_ref (arg
);
6064 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6066 t1
= TYPE_TARGET_TYPE (t
);
6069 t1
= ada_check_typedef (t1
);
6070 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6072 arg
= value_ind (arg
);
6079 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6083 v
= ada_search_struct_field (name
, arg
, 0, t
);
6086 int bit_offset
, bit_size
, byte_offset
;
6087 struct type
*field_type
;
6090 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6091 address
= value_as_address (arg
);
6093 address
= unpack_pointer (t
, value_contents (arg
));
6095 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6096 if (find_struct_field (name
, t1
, 0,
6097 &field_type
, &byte_offset
, &bit_offset
,
6102 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6103 arg
= ada_coerce_ref (arg
);
6105 arg
= ada_value_ind (arg
);
6106 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6107 bit_offset
, bit_size
,
6111 v
= value_from_pointer (lookup_reference_type (field_type
),
6112 address
+ byte_offset
);
6116 if (v
!= NULL
|| no_err
)
6119 error (_("There is no member named %s."), name
);
6125 error (_("Attempt to extract a component of a value that is not a record."));
6128 /* Given a type TYPE, look up the type of the component of type named NAME.
6129 If DISPP is non-null, add its byte displacement from the beginning of a
6130 structure (pointed to by a value) of type TYPE to *DISPP (does not
6131 work for packed fields).
6133 Matches any field whose name has NAME as a prefix, possibly
6136 TYPE can be either a struct or union. If REFOK, TYPE may also
6137 be a (pointer or reference)+ to a struct or union, and the
6138 ultimate target type will be searched.
6140 Looks recursively into variant clauses and parent types.
6142 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6143 TYPE is not a type of the right kind. */
6145 static struct type
*
6146 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6147 int noerr
, int *dispp
)
6154 if (refok
&& type
!= NULL
)
6157 type
= ada_check_typedef (type
);
6158 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6159 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6161 type
= TYPE_TARGET_TYPE (type
);
6165 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6166 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6172 target_terminal_ours ();
6173 gdb_flush (gdb_stdout
);
6175 error (_("Type (null) is not a structure or union type"));
6178 /* XXX: type_sprint */
6179 fprintf_unfiltered (gdb_stderr
, _("Type "));
6180 type_print (type
, "", gdb_stderr
, -1);
6181 error (_(" is not a structure or union type"));
6186 type
= to_static_fixed_type (type
);
6188 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6190 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6194 if (t_field_name
== NULL
)
6197 else if (field_name_match (t_field_name
, name
))
6200 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6201 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6204 else if (ada_is_wrapper_field (type
, i
))
6207 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6212 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6217 else if (ada_is_variant_part (type
, i
))
6220 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6222 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6225 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6230 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6241 target_terminal_ours ();
6242 gdb_flush (gdb_stdout
);
6245 /* XXX: type_sprint */
6246 fprintf_unfiltered (gdb_stderr
, _("Type "));
6247 type_print (type
, "", gdb_stderr
, -1);
6248 error (_(" has no component named <null>"));
6252 /* XXX: type_sprint */
6253 fprintf_unfiltered (gdb_stderr
, _("Type "));
6254 type_print (type
, "", gdb_stderr
, -1);
6255 error (_(" has no component named %s"), name
);
6262 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6263 within a value of type OUTER_TYPE that is stored in GDB at
6264 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6265 numbering from 0) is applicable. Returns -1 if none are. */
6268 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6269 const gdb_byte
*outer_valaddr
)
6274 struct type
*discrim_type
;
6275 char *discrim_name
= ada_variant_discrim_name (var_type
);
6276 LONGEST discrim_val
;
6280 ada_lookup_struct_elt_type (outer_type
, discrim_name
, 1, 1, &disp
);
6281 if (discrim_type
== NULL
)
6283 discrim_val
= unpack_long (discrim_type
, outer_valaddr
+ disp
);
6286 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6288 if (ada_is_others_clause (var_type
, i
))
6290 else if (ada_in_variant (discrim_val
, var_type
, i
))
6294 return others_clause
;
6299 /* Dynamic-Sized Records */
6301 /* Strategy: The type ostensibly attached to a value with dynamic size
6302 (i.e., a size that is not statically recorded in the debugging
6303 data) does not accurately reflect the size or layout of the value.
6304 Our strategy is to convert these values to values with accurate,
6305 conventional types that are constructed on the fly. */
6307 /* There is a subtle and tricky problem here. In general, we cannot
6308 determine the size of dynamic records without its data. However,
6309 the 'struct value' data structure, which GDB uses to represent
6310 quantities in the inferior process (the target), requires the size
6311 of the type at the time of its allocation in order to reserve space
6312 for GDB's internal copy of the data. That's why the
6313 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6314 rather than struct value*s.
6316 However, GDB's internal history variables ($1, $2, etc.) are
6317 struct value*s containing internal copies of the data that are not, in
6318 general, the same as the data at their corresponding addresses in
6319 the target. Fortunately, the types we give to these values are all
6320 conventional, fixed-size types (as per the strategy described
6321 above), so that we don't usually have to perform the
6322 'to_fixed_xxx_type' conversions to look at their values.
6323 Unfortunately, there is one exception: if one of the internal
6324 history variables is an array whose elements are unconstrained
6325 records, then we will need to create distinct fixed types for each
6326 element selected. */
6328 /* The upshot of all of this is that many routines take a (type, host
6329 address, target address) triple as arguments to represent a value.
6330 The host address, if non-null, is supposed to contain an internal
6331 copy of the relevant data; otherwise, the program is to consult the
6332 target at the target address. */
6334 /* Assuming that VAL0 represents a pointer value, the result of
6335 dereferencing it. Differs from value_ind in its treatment of
6336 dynamic-sized types. */
6339 ada_value_ind (struct value
*val0
)
6341 struct value
*val
= unwrap_value (value_ind (val0
));
6342 return ada_to_fixed_value (val
);
6345 /* The value resulting from dereferencing any "reference to"
6346 qualifiers on VAL0. */
6348 static struct value
*
6349 ada_coerce_ref (struct value
*val0
)
6351 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6353 struct value
*val
= val0
;
6354 val
= coerce_ref (val
);
6355 val
= unwrap_value (val
);
6356 return ada_to_fixed_value (val
);
6362 /* Return OFF rounded upward if necessary to a multiple of
6363 ALIGNMENT (a power of 2). */
6366 align_value (unsigned int off
, unsigned int alignment
)
6368 return (off
+ alignment
- 1) & ~(alignment
- 1);
6371 /* Return the bit alignment required for field #F of template type TYPE. */
6374 field_alignment (struct type
*type
, int f
)
6376 const char *name
= TYPE_FIELD_NAME (type
, f
);
6380 /* The field name should never be null, unless the debugging information
6381 is somehow malformed. In this case, we assume the field does not
6382 require any alignment. */
6386 len
= strlen (name
);
6388 if (!isdigit (name
[len
- 1]))
6391 if (isdigit (name
[len
- 2]))
6392 align_offset
= len
- 2;
6394 align_offset
= len
- 1;
6396 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6397 return TARGET_CHAR_BIT
;
6399 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6402 /* Find a symbol named NAME. Ignores ambiguity. */
6405 ada_find_any_symbol (const char *name
)
6409 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6410 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6413 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6417 /* Find a type named NAME. Ignores ambiguity. */
6420 ada_find_any_type (const char *name
)
6422 struct symbol
*sym
= ada_find_any_symbol (name
);
6425 return SYMBOL_TYPE (sym
);
6430 /* Given NAME and an associated BLOCK, search all symbols for
6431 NAME suffixed with "___XR", which is the ``renaming'' symbol
6432 associated to NAME. Return this symbol if found, return
6436 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6440 sym
= find_old_style_renaming_symbol (name
, block
);
6445 /* Not right yet. FIXME pnh 7/20/2007. */
6446 sym
= ada_find_any_symbol (name
);
6447 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6453 static struct symbol
*
6454 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6456 const struct symbol
*function_sym
= block_function (block
);
6459 if (function_sym
!= NULL
)
6461 /* If the symbol is defined inside a function, NAME is not fully
6462 qualified. This means we need to prepend the function name
6463 as well as adding the ``___XR'' suffix to build the name of
6464 the associated renaming symbol. */
6465 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6466 /* Function names sometimes contain suffixes used
6467 for instance to qualify nested subprograms. When building
6468 the XR type name, we need to make sure that this suffix is
6469 not included. So do not include any suffix in the function
6470 name length below. */
6471 const int function_name_len
= ada_name_prefix_len (function_name
);
6472 const int rename_len
= function_name_len
+ 2 /* "__" */
6473 + strlen (name
) + 6 /* "___XR\0" */ ;
6475 /* Strip the suffix if necessary. */
6476 function_name
[function_name_len
] = '\0';
6478 /* Library-level functions are a special case, as GNAT adds
6479 a ``_ada_'' prefix to the function name to avoid namespace
6480 pollution. However, the renaming symbols themselves do not
6481 have this prefix, so we need to skip this prefix if present. */
6482 if (function_name_len
> 5 /* "_ada_" */
6483 && strstr (function_name
, "_ada_") == function_name
)
6484 function_name
= function_name
+ 5;
6486 rename
= (char *) alloca (rename_len
* sizeof (char));
6487 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6491 const int rename_len
= strlen (name
) + 6;
6492 rename
= (char *) alloca (rename_len
* sizeof (char));
6493 sprintf (rename
, "%s___XR", name
);
6496 return ada_find_any_symbol (rename
);
6499 /* Because of GNAT encoding conventions, several GDB symbols may match a
6500 given type name. If the type denoted by TYPE0 is to be preferred to
6501 that of TYPE1 for purposes of type printing, return non-zero;
6502 otherwise return 0. */
6505 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6509 else if (type0
== NULL
)
6511 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6513 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6515 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6517 else if (ada_is_packed_array_type (type0
))
6519 else if (ada_is_array_descriptor_type (type0
)
6520 && !ada_is_array_descriptor_type (type1
))
6524 const char *type0_name
= type_name_no_tag (type0
);
6525 const char *type1_name
= type_name_no_tag (type1
);
6527 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6528 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6534 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6535 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6538 ada_type_name (struct type
*type
)
6542 else if (TYPE_NAME (type
) != NULL
)
6543 return TYPE_NAME (type
);
6545 return TYPE_TAG_NAME (type
);
6548 /* Find a parallel type to TYPE whose name is formed by appending
6549 SUFFIX to the name of TYPE. */
6552 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6555 static size_t name_len
= 0;
6557 char *typename
= ada_type_name (type
);
6559 if (typename
== NULL
)
6562 len
= strlen (typename
);
6564 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6566 strcpy (name
, typename
);
6567 strcpy (name
+ len
, suffix
);
6569 return ada_find_any_type (name
);
6573 /* If TYPE is a variable-size record type, return the corresponding template
6574 type describing its fields. Otherwise, return NULL. */
6576 static struct type
*
6577 dynamic_template_type (struct type
*type
)
6579 type
= ada_check_typedef (type
);
6581 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6582 || ada_type_name (type
) == NULL
)
6586 int len
= strlen (ada_type_name (type
));
6587 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6590 return ada_find_parallel_type (type
, "___XVE");
6594 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6595 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6598 is_dynamic_field (struct type
*templ_type
, int field_num
)
6600 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6602 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6603 && strstr (name
, "___XVL") != NULL
;
6606 /* The index of the variant field of TYPE, or -1 if TYPE does not
6607 represent a variant record type. */
6610 variant_field_index (struct type
*type
)
6614 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6617 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6619 if (ada_is_variant_part (type
, f
))
6625 /* A record type with no fields. */
6627 static struct type
*
6628 empty_record (struct objfile
*objfile
)
6630 struct type
*type
= alloc_type (objfile
);
6631 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6632 TYPE_NFIELDS (type
) = 0;
6633 TYPE_FIELDS (type
) = NULL
;
6634 TYPE_NAME (type
) = "<empty>";
6635 TYPE_TAG_NAME (type
) = NULL
;
6636 TYPE_FLAGS (type
) = 0;
6637 TYPE_LENGTH (type
) = 0;
6641 /* An ordinary record type (with fixed-length fields) that describes
6642 the value of type TYPE at VALADDR or ADDRESS (see comments at
6643 the beginning of this section) VAL according to GNAT conventions.
6644 DVAL0 should describe the (portion of a) record that contains any
6645 necessary discriminants. It should be NULL if value_type (VAL) is
6646 an outer-level type (i.e., as opposed to a branch of a variant.) A
6647 variant field (unless unchecked) is replaced by a particular branch
6650 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6651 length are not statically known are discarded. As a consequence,
6652 VALADDR, ADDRESS and DVAL0 are ignored.
6654 NOTE: Limitations: For now, we assume that dynamic fields and
6655 variants occupy whole numbers of bytes. However, they need not be
6659 ada_template_to_fixed_record_type_1 (struct type
*type
,
6660 const gdb_byte
*valaddr
,
6661 CORE_ADDR address
, struct value
*dval0
,
6662 int keep_dynamic_fields
)
6664 struct value
*mark
= value_mark ();
6667 int nfields
, bit_len
;
6670 int fld_bit_len
, bit_incr
;
6673 /* Compute the number of fields in this record type that are going
6674 to be processed: unless keep_dynamic_fields, this includes only
6675 fields whose position and length are static will be processed. */
6676 if (keep_dynamic_fields
)
6677 nfields
= TYPE_NFIELDS (type
);
6681 while (nfields
< TYPE_NFIELDS (type
)
6682 && !ada_is_variant_part (type
, nfields
)
6683 && !is_dynamic_field (type
, nfields
))
6687 rtype
= alloc_type (TYPE_OBJFILE (type
));
6688 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6689 INIT_CPLUS_SPECIFIC (rtype
);
6690 TYPE_NFIELDS (rtype
) = nfields
;
6691 TYPE_FIELDS (rtype
) = (struct field
*)
6692 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6693 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6694 TYPE_NAME (rtype
) = ada_type_name (type
);
6695 TYPE_TAG_NAME (rtype
) = NULL
;
6696 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6702 for (f
= 0; f
< nfields
; f
+= 1)
6704 off
= align_value (off
, field_alignment (type
, f
))
6705 + TYPE_FIELD_BITPOS (type
, f
);
6706 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6707 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6709 if (ada_is_variant_part (type
, f
))
6712 fld_bit_len
= bit_incr
= 0;
6714 else if (is_dynamic_field (type
, f
))
6717 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6721 /* Get the fixed type of the field. Note that, in this case, we
6722 do not want to get the real type out of the tag: if the current
6723 field is the parent part of a tagged record, we will get the
6724 tag of the object. Clearly wrong: the real type of the parent
6725 is not the real type of the child. We would end up in an infinite
6727 TYPE_FIELD_TYPE (rtype
, f
) =
6730 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6731 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6732 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6733 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6734 bit_incr
= fld_bit_len
=
6735 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6739 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6740 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6741 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6742 bit_incr
= fld_bit_len
=
6743 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6745 bit_incr
= fld_bit_len
=
6746 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6748 if (off
+ fld_bit_len
> bit_len
)
6749 bit_len
= off
+ fld_bit_len
;
6751 TYPE_LENGTH (rtype
) =
6752 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6755 /* We handle the variant part, if any, at the end because of certain
6756 odd cases in which it is re-ordered so as NOT the last field of
6757 the record. This can happen in the presence of representation
6759 if (variant_field
>= 0)
6761 struct type
*branch_type
;
6763 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6766 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6771 to_fixed_variant_branch_type
6772 (TYPE_FIELD_TYPE (type
, variant_field
),
6773 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6774 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6775 if (branch_type
== NULL
)
6777 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6778 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6779 TYPE_NFIELDS (rtype
) -= 1;
6783 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6784 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6786 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6788 if (off
+ fld_bit_len
> bit_len
)
6789 bit_len
= off
+ fld_bit_len
;
6790 TYPE_LENGTH (rtype
) =
6791 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6795 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6796 should contain the alignment of that record, which should be a strictly
6797 positive value. If null or negative, then something is wrong, most
6798 probably in the debug info. In that case, we don't round up the size
6799 of the resulting type. If this record is not part of another structure,
6800 the current RTYPE length might be good enough for our purposes. */
6801 if (TYPE_LENGTH (type
) <= 0)
6803 if (TYPE_NAME (rtype
))
6804 warning (_("Invalid type size for `%s' detected: %d."),
6805 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6807 warning (_("Invalid type size for <unnamed> detected: %d."),
6808 TYPE_LENGTH (type
));
6812 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6813 TYPE_LENGTH (type
));
6816 value_free_to_mark (mark
);
6817 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6818 error (_("record type with dynamic size is larger than varsize-limit"));
6822 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6825 static struct type
*
6826 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6827 CORE_ADDR address
, struct value
*dval0
)
6829 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6833 /* An ordinary record type in which ___XVL-convention fields and
6834 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6835 static approximations, containing all possible fields. Uses
6836 no runtime values. Useless for use in values, but that's OK,
6837 since the results are used only for type determinations. Works on both
6838 structs and unions. Representation note: to save space, we memorize
6839 the result of this function in the TYPE_TARGET_TYPE of the
6842 static struct type
*
6843 template_to_static_fixed_type (struct type
*type0
)
6849 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6850 return TYPE_TARGET_TYPE (type0
);
6852 nfields
= TYPE_NFIELDS (type0
);
6855 for (f
= 0; f
< nfields
; f
+= 1)
6857 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6858 struct type
*new_type
;
6860 if (is_dynamic_field (type0
, f
))
6861 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6863 new_type
= static_unwrap_type (field_type
);
6864 if (type
== type0
&& new_type
!= field_type
)
6866 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6867 TYPE_CODE (type
) = TYPE_CODE (type0
);
6868 INIT_CPLUS_SPECIFIC (type
);
6869 TYPE_NFIELDS (type
) = nfields
;
6870 TYPE_FIELDS (type
) = (struct field
*)
6871 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6872 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6873 sizeof (struct field
) * nfields
);
6874 TYPE_NAME (type
) = ada_type_name (type0
);
6875 TYPE_TAG_NAME (type
) = NULL
;
6876 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
6877 TYPE_LENGTH (type
) = 0;
6879 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6880 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6885 /* Given an object of type TYPE whose contents are at VALADDR and
6886 whose address in memory is ADDRESS, returns a revision of TYPE --
6887 a non-dynamic-sized record with a variant part -- in which
6888 the variant part is replaced with the appropriate branch. Looks
6889 for discriminant values in DVAL0, which can be NULL if the record
6890 contains the necessary discriminant values. */
6892 static struct type
*
6893 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6894 CORE_ADDR address
, struct value
*dval0
)
6896 struct value
*mark
= value_mark ();
6899 struct type
*branch_type
;
6900 int nfields
= TYPE_NFIELDS (type
);
6901 int variant_field
= variant_field_index (type
);
6903 if (variant_field
== -1)
6907 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6911 rtype
= alloc_type (TYPE_OBJFILE (type
));
6912 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6913 INIT_CPLUS_SPECIFIC (rtype
);
6914 TYPE_NFIELDS (rtype
) = nfields
;
6915 TYPE_FIELDS (rtype
) =
6916 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6917 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6918 sizeof (struct field
) * nfields
);
6919 TYPE_NAME (rtype
) = ada_type_name (type
);
6920 TYPE_TAG_NAME (rtype
) = NULL
;
6921 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6922 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
6924 branch_type
= to_fixed_variant_branch_type
6925 (TYPE_FIELD_TYPE (type
, variant_field
),
6926 cond_offset_host (valaddr
,
6927 TYPE_FIELD_BITPOS (type
, variant_field
)
6929 cond_offset_target (address
,
6930 TYPE_FIELD_BITPOS (type
, variant_field
)
6931 / TARGET_CHAR_BIT
), dval
);
6932 if (branch_type
== NULL
)
6935 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
6936 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6937 TYPE_NFIELDS (rtype
) -= 1;
6941 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6942 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6943 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
6944 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
6946 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
6948 value_free_to_mark (mark
);
6952 /* An ordinary record type (with fixed-length fields) that describes
6953 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
6954 beginning of this section]. Any necessary discriminants' values
6955 should be in DVAL, a record value; it may be NULL if the object
6956 at ADDR itself contains any necessary discriminant values.
6957 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
6958 values from the record are needed. Except in the case that DVAL,
6959 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
6960 unchecked) is replaced by a particular branch of the variant.
6962 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
6963 is questionable and may be removed. It can arise during the
6964 processing of an unconstrained-array-of-record type where all the
6965 variant branches have exactly the same size. This is because in
6966 such cases, the compiler does not bother to use the XVS convention
6967 when encoding the record. I am currently dubious of this
6968 shortcut and suspect the compiler should be altered. FIXME. */
6970 static struct type
*
6971 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
6972 CORE_ADDR address
, struct value
*dval
)
6974 struct type
*templ_type
;
6976 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
6979 templ_type
= dynamic_template_type (type0
);
6981 if (templ_type
!= NULL
)
6982 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
6983 else if (variant_field_index (type0
) >= 0)
6985 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
6987 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
6992 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
6998 /* An ordinary record type (with fixed-length fields) that describes
6999 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7000 union type. Any necessary discriminants' values should be in DVAL,
7001 a record value. That is, this routine selects the appropriate
7002 branch of the union at ADDR according to the discriminant value
7003 indicated in the union's type name. */
7005 static struct type
*
7006 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7007 CORE_ADDR address
, struct value
*dval
)
7010 struct type
*templ_type
;
7011 struct type
*var_type
;
7013 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7014 var_type
= TYPE_TARGET_TYPE (var_type0
);
7016 var_type
= var_type0
;
7018 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7020 if (templ_type
!= NULL
)
7021 var_type
= templ_type
;
7024 ada_which_variant_applies (var_type
,
7025 value_type (dval
), value_contents (dval
));
7028 return empty_record (TYPE_OBJFILE (var_type
));
7029 else if (is_dynamic_field (var_type
, which
))
7030 return to_fixed_record_type
7031 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7032 valaddr
, address
, dval
);
7033 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7035 to_fixed_record_type
7036 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7038 return TYPE_FIELD_TYPE (var_type
, which
);
7041 /* Assuming that TYPE0 is an array type describing the type of a value
7042 at ADDR, and that DVAL describes a record containing any
7043 discriminants used in TYPE0, returns a type for the value that
7044 contains no dynamic components (that is, no components whose sizes
7045 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7046 true, gives an error message if the resulting type's size is over
7049 static struct type
*
7050 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7053 struct type
*index_type_desc
;
7054 struct type
*result
;
7056 if (ada_is_packed_array_type (type0
) /* revisit? */
7057 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7060 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7061 if (index_type_desc
== NULL
)
7063 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7064 /* NOTE: elt_type---the fixed version of elt_type0---should never
7065 depend on the contents of the array in properly constructed
7067 /* Create a fixed version of the array element type.
7068 We're not providing the address of an element here,
7069 and thus the actual object value cannot be inspected to do
7070 the conversion. This should not be a problem, since arrays of
7071 unconstrained objects are not allowed. In particular, all
7072 the elements of an array of a tagged type should all be of
7073 the same type specified in the debugging info. No need to
7074 consult the object tag. */
7075 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7077 if (elt_type0
== elt_type
)
7080 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7081 elt_type
, TYPE_INDEX_TYPE (type0
));
7086 struct type
*elt_type0
;
7089 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7090 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7092 /* NOTE: result---the fixed version of elt_type0---should never
7093 depend on the contents of the array in properly constructed
7095 /* Create a fixed version of the array element type.
7096 We're not providing the address of an element here,
7097 and thus the actual object value cannot be inspected to do
7098 the conversion. This should not be a problem, since arrays of
7099 unconstrained objects are not allowed. In particular, all
7100 the elements of an array of a tagged type should all be of
7101 the same type specified in the debugging info. No need to
7102 consult the object tag. */
7104 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7105 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7107 struct type
*range_type
=
7108 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7109 dval
, TYPE_OBJFILE (type0
));
7110 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7111 result
, range_type
);
7113 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7114 error (_("array type with dynamic size is larger than varsize-limit"));
7117 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7122 /* A standard type (containing no dynamically sized components)
7123 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7124 DVAL describes a record containing any discriminants used in TYPE0,
7125 and may be NULL if there are none, or if the object of type TYPE at
7126 ADDRESS or in VALADDR contains these discriminants.
7128 If CHECK_TAG is not null, in the case of tagged types, this function
7129 attempts to locate the object's tag and use it to compute the actual
7130 type. However, when ADDRESS is null, we cannot use it to determine the
7131 location of the tag, and therefore compute the tagged type's actual type.
7132 So we return the tagged type without consulting the tag. */
7134 static struct type
*
7135 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7136 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7138 type
= ada_check_typedef (type
);
7139 switch (TYPE_CODE (type
))
7143 case TYPE_CODE_STRUCT
:
7145 struct type
*static_type
= to_static_fixed_type (type
);
7146 struct type
*fixed_record_type
=
7147 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7148 /* If STATIC_TYPE is a tagged type and we know the object's address,
7149 then we can determine its tag, and compute the object's actual
7150 type from there. Note that we have to use the fixed record
7151 type (the parent part of the record may have dynamic fields
7152 and the way the location of _tag is expressed may depend on
7155 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7157 struct type
*real_type
=
7158 type_from_tag (value_tag_from_contents_and_address
7162 if (real_type
!= NULL
)
7163 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7165 return fixed_record_type
;
7167 case TYPE_CODE_ARRAY
:
7168 return to_fixed_array_type (type
, dval
, 1);
7169 case TYPE_CODE_UNION
:
7173 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7177 /* The same as ada_to_fixed_type_1, except that it preserves the type
7178 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7179 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7182 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7183 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7186 struct type
*fixed_type
=
7187 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7189 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7190 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7196 /* A standard (static-sized) type corresponding as well as possible to
7197 TYPE0, but based on no runtime data. */
7199 static struct type
*
7200 to_static_fixed_type (struct type
*type0
)
7207 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7210 type0
= ada_check_typedef (type0
);
7212 switch (TYPE_CODE (type0
))
7216 case TYPE_CODE_STRUCT
:
7217 type
= dynamic_template_type (type0
);
7219 return template_to_static_fixed_type (type
);
7221 return template_to_static_fixed_type (type0
);
7222 case TYPE_CODE_UNION
:
7223 type
= ada_find_parallel_type (type0
, "___XVU");
7225 return template_to_static_fixed_type (type
);
7227 return template_to_static_fixed_type (type0
);
7231 /* A static approximation of TYPE with all type wrappers removed. */
7233 static struct type
*
7234 static_unwrap_type (struct type
*type
)
7236 if (ada_is_aligner_type (type
))
7238 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7239 if (ada_type_name (type1
) == NULL
)
7240 TYPE_NAME (type1
) = ada_type_name (type
);
7242 return static_unwrap_type (type1
);
7246 struct type
*raw_real_type
= ada_get_base_type (type
);
7247 if (raw_real_type
== type
)
7250 return to_static_fixed_type (raw_real_type
);
7254 /* In some cases, incomplete and private types require
7255 cross-references that are not resolved as records (for example,
7257 type FooP is access Foo;
7259 type Foo is array ...;
7260 ). In these cases, since there is no mechanism for producing
7261 cross-references to such types, we instead substitute for FooP a
7262 stub enumeration type that is nowhere resolved, and whose tag is
7263 the name of the actual type. Call these types "non-record stubs". */
7265 /* A type equivalent to TYPE that is not a non-record stub, if one
7266 exists, otherwise TYPE. */
7269 ada_check_typedef (struct type
*type
)
7271 CHECK_TYPEDEF (type
);
7272 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7273 || !TYPE_STUB (type
)
7274 || TYPE_TAG_NAME (type
) == NULL
)
7278 char *name
= TYPE_TAG_NAME (type
);
7279 struct type
*type1
= ada_find_any_type (name
);
7280 return (type1
== NULL
) ? type
: type1
;
7284 /* A value representing the data at VALADDR/ADDRESS as described by
7285 type TYPE0, but with a standard (static-sized) type that correctly
7286 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7287 type, then return VAL0 [this feature is simply to avoid redundant
7288 creation of struct values]. */
7290 static struct value
*
7291 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7294 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7295 if (type
== type0
&& val0
!= NULL
)
7298 return value_from_contents_and_address (type
, 0, address
);
7301 /* A value representing VAL, but with a standard (static-sized) type
7302 that correctly describes it. Does not necessarily create a new
7305 static struct value
*
7306 ada_to_fixed_value (struct value
*val
)
7308 return ada_to_fixed_value_create (value_type (val
),
7309 VALUE_ADDRESS (val
) + value_offset (val
),
7313 /* A value representing VAL, but with a standard (static-sized) type
7314 chosen to approximate the real type of VAL as well as possible, but
7315 without consulting any runtime values. For Ada dynamic-sized
7316 types, therefore, the type of the result is likely to be inaccurate. */
7319 ada_to_static_fixed_value (struct value
*val
)
7322 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7323 if (type
== value_type (val
))
7326 return coerce_unspec_val_to_type (val
, type
);
7332 /* Table mapping attribute numbers to names.
7333 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7335 static const char *attribute_names
[] = {
7353 ada_attribute_name (enum exp_opcode n
)
7355 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7356 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7358 return attribute_names
[0];
7361 /* Evaluate the 'POS attribute applied to ARG. */
7364 pos_atr (struct value
*arg
)
7366 struct type
*type
= value_type (arg
);
7368 if (!discrete_type_p (type
))
7369 error (_("'POS only defined on discrete types"));
7371 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7374 LONGEST v
= value_as_long (arg
);
7376 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7378 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7381 error (_("enumeration value is invalid: can't find 'POS"));
7384 return value_as_long (arg
);
7387 static struct value
*
7388 value_pos_atr (struct value
*arg
)
7390 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7393 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7395 static struct value
*
7396 value_val_atr (struct type
*type
, struct value
*arg
)
7398 if (!discrete_type_p (type
))
7399 error (_("'VAL only defined on discrete types"));
7400 if (!integer_type_p (value_type (arg
)))
7401 error (_("'VAL requires integral argument"));
7403 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7405 long pos
= value_as_long (arg
);
7406 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7407 error (_("argument to 'VAL out of range"));
7408 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7411 return value_from_longest (type
, value_as_long (arg
));
7417 /* True if TYPE appears to be an Ada character type.
7418 [At the moment, this is true only for Character and Wide_Character;
7419 It is a heuristic test that could stand improvement]. */
7422 ada_is_character_type (struct type
*type
)
7426 /* If the type code says it's a character, then assume it really is,
7427 and don't check any further. */
7428 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7431 /* Otherwise, assume it's a character type iff it is a discrete type
7432 with a known character type name. */
7433 name
= ada_type_name (type
);
7434 return (name
!= NULL
7435 && (TYPE_CODE (type
) == TYPE_CODE_INT
7436 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7437 && (strcmp (name
, "character") == 0
7438 || strcmp (name
, "wide_character") == 0
7439 || strcmp (name
, "wide_wide_character") == 0
7440 || strcmp (name
, "unsigned char") == 0));
7443 /* True if TYPE appears to be an Ada string type. */
7446 ada_is_string_type (struct type
*type
)
7448 type
= ada_check_typedef (type
);
7450 && TYPE_CODE (type
) != TYPE_CODE_PTR
7451 && (ada_is_simple_array_type (type
)
7452 || ada_is_array_descriptor_type (type
))
7453 && ada_array_arity (type
) == 1)
7455 struct type
*elttype
= ada_array_element_type (type
, 1);
7457 return ada_is_character_type (elttype
);
7464 /* True if TYPE is a struct type introduced by the compiler to force the
7465 alignment of a value. Such types have a single field with a
7466 distinctive name. */
7469 ada_is_aligner_type (struct type
*type
)
7471 type
= ada_check_typedef (type
);
7473 /* If we can find a parallel XVS type, then the XVS type should
7474 be used instead of this type. And hence, this is not an aligner
7476 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7479 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7480 && TYPE_NFIELDS (type
) == 1
7481 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7484 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7485 the parallel type. */
7488 ada_get_base_type (struct type
*raw_type
)
7490 struct type
*real_type_namer
;
7491 struct type
*raw_real_type
;
7493 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7496 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7497 if (real_type_namer
== NULL
7498 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7499 || TYPE_NFIELDS (real_type_namer
) != 1)
7502 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7503 if (raw_real_type
== NULL
)
7506 return raw_real_type
;
7509 /* The type of value designated by TYPE, with all aligners removed. */
7512 ada_aligned_type (struct type
*type
)
7514 if (ada_is_aligner_type (type
))
7515 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7517 return ada_get_base_type (type
);
7521 /* The address of the aligned value in an object at address VALADDR
7522 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7525 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7527 if (ada_is_aligner_type (type
))
7528 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7530 TYPE_FIELD_BITPOS (type
,
7531 0) / TARGET_CHAR_BIT
);
7538 /* The printed representation of an enumeration literal with encoded
7539 name NAME. The value is good to the next call of ada_enum_name. */
7541 ada_enum_name (const char *name
)
7543 static char *result
;
7544 static size_t result_len
= 0;
7547 /* First, unqualify the enumeration name:
7548 1. Search for the last '.' character. If we find one, then skip
7549 all the preceeding characters, the unqualified name starts
7550 right after that dot.
7551 2. Otherwise, we may be debugging on a target where the compiler
7552 translates dots into "__". Search forward for double underscores,
7553 but stop searching when we hit an overloading suffix, which is
7554 of the form "__" followed by digits. */
7556 tmp
= strrchr (name
, '.');
7561 while ((tmp
= strstr (name
, "__")) != NULL
)
7563 if (isdigit (tmp
[2]))
7573 if (name
[1] == 'U' || name
[1] == 'W')
7575 if (sscanf (name
+ 2, "%x", &v
) != 1)
7581 GROW_VECT (result
, result_len
, 16);
7582 if (isascii (v
) && isprint (v
))
7583 sprintf (result
, "'%c'", v
);
7584 else if (name
[1] == 'U')
7585 sprintf (result
, "[\"%02x\"]", v
);
7587 sprintf (result
, "[\"%04x\"]", v
);
7593 tmp
= strstr (name
, "__");
7595 tmp
= strstr (name
, "$");
7598 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7599 strncpy (result
, name
, tmp
- name
);
7600 result
[tmp
- name
] = '\0';
7608 static struct value
*
7609 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7612 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7613 (expect_type
, exp
, pos
, noside
);
7616 /* Evaluate the subexpression of EXP starting at *POS as for
7617 evaluate_type, updating *POS to point just past the evaluated
7620 static struct value
*
7621 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7623 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7624 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7627 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7630 static struct value
*
7631 unwrap_value (struct value
*val
)
7633 struct type
*type
= ada_check_typedef (value_type (val
));
7634 if (ada_is_aligner_type (type
))
7636 struct value
*v
= value_struct_elt (&val
, NULL
, "F",
7637 NULL
, "internal structure");
7638 struct type
*val_type
= ada_check_typedef (value_type (v
));
7639 if (ada_type_name (val_type
) == NULL
)
7640 TYPE_NAME (val_type
) = ada_type_name (type
);
7642 return unwrap_value (v
);
7646 struct type
*raw_real_type
=
7647 ada_check_typedef (ada_get_base_type (type
));
7649 if (type
== raw_real_type
)
7653 coerce_unspec_val_to_type
7654 (val
, ada_to_fixed_type (raw_real_type
, 0,
7655 VALUE_ADDRESS (val
) + value_offset (val
),
7660 static struct value
*
7661 cast_to_fixed (struct type
*type
, struct value
*arg
)
7665 if (type
== value_type (arg
))
7667 else if (ada_is_fixed_point_type (value_type (arg
)))
7668 val
= ada_float_to_fixed (type
,
7669 ada_fixed_to_float (value_type (arg
),
7670 value_as_long (arg
)));
7674 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7675 val
= ada_float_to_fixed (type
, argd
);
7678 return value_from_longest (type
, val
);
7681 static struct value
*
7682 cast_from_fixed_to_double (struct value
*arg
)
7684 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7685 value_as_long (arg
));
7686 return value_from_double (builtin_type_double
, val
);
7689 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7690 return the converted value. */
7692 static struct value
*
7693 coerce_for_assign (struct type
*type
, struct value
*val
)
7695 struct type
*type2
= value_type (val
);
7699 type2
= ada_check_typedef (type2
);
7700 type
= ada_check_typedef (type
);
7702 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7703 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7705 val
= ada_value_ind (val
);
7706 type2
= value_type (val
);
7709 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7710 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7712 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7713 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7714 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7715 error (_("Incompatible types in assignment"));
7716 deprecated_set_value_type (val
, type
);
7721 static struct value
*
7722 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7725 struct type
*type1
, *type2
;
7728 arg1
= coerce_ref (arg1
);
7729 arg2
= coerce_ref (arg2
);
7730 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7731 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7733 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7734 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7735 return value_binop (arg1
, arg2
, op
);
7744 return value_binop (arg1
, arg2
, op
);
7747 v2
= value_as_long (arg2
);
7749 error (_("second operand of %s must not be zero."), op_string (op
));
7751 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7752 return value_binop (arg1
, arg2
, op
);
7754 v1
= value_as_long (arg1
);
7759 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7760 v
+= v
> 0 ? -1 : 1;
7768 /* Should not reach this point. */
7772 val
= allocate_value (type1
);
7773 store_unsigned_integer (value_contents_raw (val
),
7774 TYPE_LENGTH (value_type (val
)), v
);
7779 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7781 if (ada_is_direct_array_type (value_type (arg1
))
7782 || ada_is_direct_array_type (value_type (arg2
)))
7784 /* Automatically dereference any array reference before
7785 we attempt to perform the comparison. */
7786 arg1
= ada_coerce_ref (arg1
);
7787 arg2
= ada_coerce_ref (arg2
);
7789 arg1
= ada_coerce_to_simple_array (arg1
);
7790 arg2
= ada_coerce_to_simple_array (arg2
);
7791 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7792 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7793 error (_("Attempt to compare array with non-array"));
7794 /* FIXME: The following works only for types whose
7795 representations use all bits (no padding or undefined bits)
7796 and do not have user-defined equality. */
7798 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7799 && memcmp (value_contents (arg1
), value_contents (arg2
),
7800 TYPE_LENGTH (value_type (arg1
))) == 0;
7802 return value_equal (arg1
, arg2
);
7805 /* Total number of component associations in the aggregate starting at
7806 index PC in EXP. Assumes that index PC is the start of an
7810 num_component_specs (struct expression
*exp
, int pc
)
7813 m
= exp
->elts
[pc
+ 1].longconst
;
7816 for (i
= 0; i
< m
; i
+= 1)
7818 switch (exp
->elts
[pc
].opcode
)
7824 n
+= exp
->elts
[pc
+ 1].longconst
;
7827 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7832 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7833 component of LHS (a simple array or a record), updating *POS past
7834 the expression, assuming that LHS is contained in CONTAINER. Does
7835 not modify the inferior's memory, nor does it modify LHS (unless
7836 LHS == CONTAINER). */
7839 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7840 struct expression
*exp
, int *pos
)
7842 struct value
*mark
= value_mark ();
7844 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7846 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
7847 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7851 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7852 elt
= ada_to_fixed_value (unwrap_value (elt
));
7855 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7856 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7858 value_assign_to_component (container
, elt
,
7859 ada_evaluate_subexp (NULL
, exp
, pos
,
7862 value_free_to_mark (mark
);
7865 /* Assuming that LHS represents an lvalue having a record or array
7866 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7867 of that aggregate's value to LHS, advancing *POS past the
7868 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7869 lvalue containing LHS (possibly LHS itself). Does not modify
7870 the inferior's memory, nor does it modify the contents of
7871 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7873 static struct value
*
7874 assign_aggregate (struct value
*container
,
7875 struct value
*lhs
, struct expression
*exp
,
7876 int *pos
, enum noside noside
)
7878 struct type
*lhs_type
;
7879 int n
= exp
->elts
[*pos
+1].longconst
;
7880 LONGEST low_index
, high_index
;
7883 int max_indices
, num_indices
;
7884 int is_array_aggregate
;
7886 struct value
*mark
= value_mark ();
7889 if (noside
!= EVAL_NORMAL
)
7892 for (i
= 0; i
< n
; i
+= 1)
7893 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
7897 container
= ada_coerce_ref (container
);
7898 if (ada_is_direct_array_type (value_type (container
)))
7899 container
= ada_coerce_to_simple_array (container
);
7900 lhs
= ada_coerce_ref (lhs
);
7901 if (!deprecated_value_modifiable (lhs
))
7902 error (_("Left operand of assignment is not a modifiable lvalue."));
7904 lhs_type
= value_type (lhs
);
7905 if (ada_is_direct_array_type (lhs_type
))
7907 lhs
= ada_coerce_to_simple_array (lhs
);
7908 lhs_type
= value_type (lhs
);
7909 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
7910 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
7911 is_array_aggregate
= 1;
7913 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
7916 high_index
= num_visible_fields (lhs_type
) - 1;
7917 is_array_aggregate
= 0;
7920 error (_("Left-hand side must be array or record."));
7922 num_specs
= num_component_specs (exp
, *pos
- 3);
7923 max_indices
= 4 * num_specs
+ 4;
7924 indices
= alloca (max_indices
* sizeof (indices
[0]));
7925 indices
[0] = indices
[1] = low_index
- 1;
7926 indices
[2] = indices
[3] = high_index
+ 1;
7929 for (i
= 0; i
< n
; i
+= 1)
7931 switch (exp
->elts
[*pos
].opcode
)
7934 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
7935 &num_indices
, max_indices
,
7936 low_index
, high_index
);
7939 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
7940 &num_indices
, max_indices
,
7941 low_index
, high_index
);
7945 error (_("Misplaced 'others' clause"));
7946 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
7947 num_indices
, low_index
, high_index
);
7950 error (_("Internal error: bad aggregate clause"));
7957 /* Assign into the component of LHS indexed by the OP_POSITIONAL
7958 construct at *POS, updating *POS past the construct, given that
7959 the positions are relative to lower bound LOW, where HIGH is the
7960 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
7961 updating *NUM_INDICES as needed. CONTAINER is as for
7962 assign_aggregate. */
7964 aggregate_assign_positional (struct value
*container
,
7965 struct value
*lhs
, struct expression
*exp
,
7966 int *pos
, LONGEST
*indices
, int *num_indices
,
7967 int max_indices
, LONGEST low
, LONGEST high
)
7969 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
7971 if (ind
- 1 == high
)
7972 warning (_("Extra components in aggregate ignored."));
7975 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
7977 assign_component (container
, lhs
, ind
, exp
, pos
);
7980 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
7983 /* Assign into the components of LHS indexed by the OP_CHOICES
7984 construct at *POS, updating *POS past the construct, given that
7985 the allowable indices are LOW..HIGH. Record the indices assigned
7986 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
7987 needed. CONTAINER is as for assign_aggregate. */
7989 aggregate_assign_from_choices (struct value
*container
,
7990 struct value
*lhs
, struct expression
*exp
,
7991 int *pos
, LONGEST
*indices
, int *num_indices
,
7992 int max_indices
, LONGEST low
, LONGEST high
)
7995 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
7996 int choice_pos
, expr_pc
;
7997 int is_array
= ada_is_direct_array_type (value_type (lhs
));
7999 choice_pos
= *pos
+= 3;
8001 for (j
= 0; j
< n_choices
; j
+= 1)
8002 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8004 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8006 for (j
= 0; j
< n_choices
; j
+= 1)
8008 LONGEST lower
, upper
;
8009 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8010 if (op
== OP_DISCRETE_RANGE
)
8013 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8015 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8020 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8031 name
= &exp
->elts
[choice_pos
+ 2].string
;
8034 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8037 error (_("Invalid record component association."));
8039 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8041 if (! find_struct_field (name
, value_type (lhs
), 0,
8042 NULL
, NULL
, NULL
, NULL
, &ind
))
8043 error (_("Unknown component name: %s."), name
);
8044 lower
= upper
= ind
;
8047 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8048 error (_("Index in component association out of bounds."));
8050 add_component_interval (lower
, upper
, indices
, num_indices
,
8052 while (lower
<= upper
)
8056 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8062 /* Assign the value of the expression in the OP_OTHERS construct in
8063 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8064 have not been previously assigned. The index intervals already assigned
8065 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8066 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8068 aggregate_assign_others (struct value
*container
,
8069 struct value
*lhs
, struct expression
*exp
,
8070 int *pos
, LONGEST
*indices
, int num_indices
,
8071 LONGEST low
, LONGEST high
)
8074 int expr_pc
= *pos
+1;
8076 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8079 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8083 assign_component (container
, lhs
, ind
, exp
, &pos
);
8086 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8089 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8090 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8091 modifying *SIZE as needed. It is an error if *SIZE exceeds
8092 MAX_SIZE. The resulting intervals do not overlap. */
8094 add_component_interval (LONGEST low
, LONGEST high
,
8095 LONGEST
* indices
, int *size
, int max_size
)
8098 for (i
= 0; i
< *size
; i
+= 2) {
8099 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8102 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8103 if (high
< indices
[kh
])
8105 if (low
< indices
[i
])
8107 indices
[i
+ 1] = indices
[kh
- 1];
8108 if (high
> indices
[i
+ 1])
8109 indices
[i
+ 1] = high
;
8110 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8111 *size
-= kh
- i
- 2;
8114 else if (high
< indices
[i
])
8118 if (*size
== max_size
)
8119 error (_("Internal error: miscounted aggregate components."));
8121 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8122 indices
[j
] = indices
[j
- 2];
8124 indices
[i
+ 1] = high
;
8127 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8130 static struct value
*
8131 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8133 if (type
== ada_check_typedef (value_type (arg2
)))
8136 if (ada_is_fixed_point_type (type
))
8137 return (cast_to_fixed (type
, arg2
));
8139 if (ada_is_fixed_point_type (value_type (arg2
)))
8140 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8142 return value_cast (type
, arg2
);
8145 static struct value
*
8146 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8147 int *pos
, enum noside noside
)
8150 int tem
, tem2
, tem3
;
8152 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8155 struct value
**argvec
;
8159 op
= exp
->elts
[pc
].opcode
;
8165 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8166 arg1
= unwrap_value (arg1
);
8168 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8169 then we need to perform the conversion manually, because
8170 evaluate_subexp_standard doesn't do it. This conversion is
8171 necessary in Ada because the different kinds of float/fixed
8172 types in Ada have different representations.
8174 Similarly, we need to perform the conversion from OP_LONG
8176 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8177 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8183 struct value
*result
;
8185 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8186 /* The result type will have code OP_STRING, bashed there from
8187 OP_ARRAY. Bash it back. */
8188 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8189 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8195 type
= exp
->elts
[pc
+ 1].type
;
8196 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8197 if (noside
== EVAL_SKIP
)
8199 arg1
= ada_value_cast (type
, arg1
, noside
);
8204 type
= exp
->elts
[pc
+ 1].type
;
8205 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8208 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8209 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8211 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8212 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8214 return ada_value_assign (arg1
, arg1
);
8216 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8217 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8219 if (ada_is_fixed_point_type (value_type (arg1
)))
8220 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8221 else if (ada_is_fixed_point_type (value_type (arg2
)))
8223 (_("Fixed-point values must be assigned to fixed-point variables"));
8225 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8226 return ada_value_assign (arg1
, arg2
);
8229 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8230 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8231 if (noside
== EVAL_SKIP
)
8233 if ((ada_is_fixed_point_type (value_type (arg1
))
8234 || ada_is_fixed_point_type (value_type (arg2
)))
8235 && value_type (arg1
) != value_type (arg2
))
8236 error (_("Operands of fixed-point addition must have the same type"));
8237 /* Do the addition, and cast the result to the type of the first
8238 argument. We cannot cast the result to a reference type, so if
8239 ARG1 is a reference type, find its underlying type. */
8240 type
= value_type (arg1
);
8241 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8242 type
= TYPE_TARGET_TYPE (type
);
8243 return value_cast (type
, value_add (arg1
, arg2
));
8246 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8247 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8248 if (noside
== EVAL_SKIP
)
8250 if ((ada_is_fixed_point_type (value_type (arg1
))
8251 || ada_is_fixed_point_type (value_type (arg2
)))
8252 && value_type (arg1
) != value_type (arg2
))
8253 error (_("Operands of fixed-point subtraction must have the same type"));
8254 /* Do the substraction, and cast the result to the type of the first
8255 argument. We cannot cast the result to a reference type, so if
8256 ARG1 is a reference type, find its underlying type. */
8257 type
= value_type (arg1
);
8258 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8259 type
= TYPE_TARGET_TYPE (type
);
8260 return value_cast (type
, value_sub (arg1
, arg2
));
8264 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8265 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8266 if (noside
== EVAL_SKIP
)
8268 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8269 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8270 return value_zero (value_type (arg1
), not_lval
);
8273 if (ada_is_fixed_point_type (value_type (arg1
)))
8274 arg1
= cast_from_fixed_to_double (arg1
);
8275 if (ada_is_fixed_point_type (value_type (arg2
)))
8276 arg2
= cast_from_fixed_to_double (arg2
);
8277 return ada_value_binop (arg1
, arg2
, op
);
8282 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8283 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8284 if (noside
== EVAL_SKIP
)
8286 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8287 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8288 return value_zero (value_type (arg1
), not_lval
);
8290 return ada_value_binop (arg1
, arg2
, op
);
8293 case BINOP_NOTEQUAL
:
8294 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8295 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8296 if (noside
== EVAL_SKIP
)
8298 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8301 tem
= ada_value_equal (arg1
, arg2
);
8302 if (op
== BINOP_NOTEQUAL
)
8304 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8307 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8308 if (noside
== EVAL_SKIP
)
8310 else if (ada_is_fixed_point_type (value_type (arg1
)))
8311 return value_cast (value_type (arg1
), value_neg (arg1
));
8313 return value_neg (arg1
);
8315 case BINOP_LOGICAL_AND
:
8316 case BINOP_LOGICAL_OR
:
8317 case UNOP_LOGICAL_NOT
:
8322 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8323 return value_cast (LA_BOOL_TYPE
, val
);
8326 case BINOP_BITWISE_AND
:
8327 case BINOP_BITWISE_IOR
:
8328 case BINOP_BITWISE_XOR
:
8332 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8334 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8336 return value_cast (value_type (arg1
), val
);
8341 if (noside
== EVAL_SKIP
)
8346 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8347 /* Only encountered when an unresolved symbol occurs in a
8348 context other than a function call, in which case, it is
8350 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8351 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8352 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8356 (to_static_fixed_type
8357 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8363 unwrap_value (evaluate_subexp_standard
8364 (expect_type
, exp
, pos
, noside
));
8365 return ada_to_fixed_value (arg1
);
8371 /* Allocate arg vector, including space for the function to be
8372 called in argvec[0] and a terminating NULL. */
8373 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8375 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8377 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8378 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8379 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8380 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8383 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8384 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8387 if (noside
== EVAL_SKIP
)
8391 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8392 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8393 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8394 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8395 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8396 argvec
[0] = value_addr (argvec
[0]);
8398 type
= ada_check_typedef (value_type (argvec
[0]));
8399 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8401 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8403 case TYPE_CODE_FUNC
:
8404 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8406 case TYPE_CODE_ARRAY
:
8408 case TYPE_CODE_STRUCT
:
8409 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8410 argvec
[0] = ada_value_ind (argvec
[0]);
8411 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8414 error (_("cannot subscript or call something of type `%s'"),
8415 ada_type_name (value_type (argvec
[0])));
8420 switch (TYPE_CODE (type
))
8422 case TYPE_CODE_FUNC
:
8423 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8424 return allocate_value (TYPE_TARGET_TYPE (type
));
8425 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8426 case TYPE_CODE_STRUCT
:
8430 arity
= ada_array_arity (type
);
8431 type
= ada_array_element_type (type
, nargs
);
8433 error (_("cannot subscript or call a record"));
8435 error (_("wrong number of subscripts; expecting %d"), arity
);
8436 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8437 return value_zero (ada_aligned_type (type
), lval_memory
);
8439 unwrap_value (ada_value_subscript
8440 (argvec
[0], nargs
, argvec
+ 1));
8442 case TYPE_CODE_ARRAY
:
8443 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8445 type
= ada_array_element_type (type
, nargs
);
8447 error (_("element type of array unknown"));
8449 return value_zero (ada_aligned_type (type
), lval_memory
);
8452 unwrap_value (ada_value_subscript
8453 (ada_coerce_to_simple_array (argvec
[0]),
8454 nargs
, argvec
+ 1));
8455 case TYPE_CODE_PTR
: /* Pointer to array */
8456 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8457 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8459 type
= ada_array_element_type (type
, nargs
);
8461 error (_("element type of array unknown"));
8463 return value_zero (ada_aligned_type (type
), lval_memory
);
8466 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8467 nargs
, argvec
+ 1));
8470 error (_("Attempt to index or call something other than an "
8471 "array or function"));
8476 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8477 struct value
*low_bound_val
=
8478 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8479 struct value
*high_bound_val
=
8480 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8483 low_bound_val
= coerce_ref (low_bound_val
);
8484 high_bound_val
= coerce_ref (high_bound_val
);
8485 low_bound
= pos_atr (low_bound_val
);
8486 high_bound
= pos_atr (high_bound_val
);
8488 if (noside
== EVAL_SKIP
)
8491 /* If this is a reference to an aligner type, then remove all
8493 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8494 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8495 TYPE_TARGET_TYPE (value_type (array
)) =
8496 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8498 if (ada_is_packed_array_type (value_type (array
)))
8499 error (_("cannot slice a packed array"));
8501 /* If this is a reference to an array or an array lvalue,
8502 convert to a pointer. */
8503 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8504 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8505 && VALUE_LVAL (array
) == lval_memory
))
8506 array
= value_addr (array
);
8508 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8509 && ada_is_array_descriptor_type (ada_check_typedef
8510 (value_type (array
))))
8511 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8513 array
= ada_coerce_to_simple_array_ptr (array
);
8515 /* If we have more than one level of pointer indirection,
8516 dereference the value until we get only one level. */
8517 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8518 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8520 array
= value_ind (array
);
8522 /* Make sure we really do have an array type before going further,
8523 to avoid a SEGV when trying to get the index type or the target
8524 type later down the road if the debug info generated by
8525 the compiler is incorrect or incomplete. */
8526 if (!ada_is_simple_array_type (value_type (array
)))
8527 error (_("cannot take slice of non-array"));
8529 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8531 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8532 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8536 struct type
*arr_type0
=
8537 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8539 return ada_value_slice_ptr (array
, arr_type0
,
8540 longest_to_int (low_bound
),
8541 longest_to_int (high_bound
));
8544 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8546 else if (high_bound
< low_bound
)
8547 return empty_array (value_type (array
), low_bound
);
8549 return ada_value_slice (array
, longest_to_int (low_bound
),
8550 longest_to_int (high_bound
));
8555 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8556 type
= exp
->elts
[pc
+ 1].type
;
8558 if (noside
== EVAL_SKIP
)
8561 switch (TYPE_CODE (type
))
8564 lim_warning (_("Membership test incompletely implemented; "
8565 "always returns true"));
8566 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8568 case TYPE_CODE_RANGE
:
8569 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8570 arg3
= value_from_longest (builtin_type_int
,
8571 TYPE_HIGH_BOUND (type
));
8573 value_from_longest (builtin_type_int
,
8574 (value_less (arg1
, arg3
)
8575 || value_equal (arg1
, arg3
))
8576 && (value_less (arg2
, arg1
)
8577 || value_equal (arg2
, arg1
)));
8580 case BINOP_IN_BOUNDS
:
8582 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8583 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8585 if (noside
== EVAL_SKIP
)
8588 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8589 return value_zero (builtin_type_int
, not_lval
);
8591 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8593 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8594 error (_("invalid dimension number to 'range"));
8596 arg3
= ada_array_bound (arg2
, tem
, 1);
8597 arg2
= ada_array_bound (arg2
, tem
, 0);
8600 value_from_longest (builtin_type_int
,
8601 (value_less (arg1
, arg3
)
8602 || value_equal (arg1
, arg3
))
8603 && (value_less (arg2
, arg1
)
8604 || value_equal (arg2
, arg1
)));
8606 case TERNOP_IN_RANGE
:
8607 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8608 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8609 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8611 if (noside
== EVAL_SKIP
)
8615 value_from_longest (builtin_type_int
,
8616 (value_less (arg1
, arg3
)
8617 || value_equal (arg1
, arg3
))
8618 && (value_less (arg2
, arg1
)
8619 || value_equal (arg2
, arg1
)));
8625 struct type
*type_arg
;
8626 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8628 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8630 type_arg
= exp
->elts
[pc
+ 2].type
;
8634 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8638 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8639 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8640 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8643 if (noside
== EVAL_SKIP
)
8646 if (type_arg
== NULL
)
8648 arg1
= ada_coerce_ref (arg1
);
8650 if (ada_is_packed_array_type (value_type (arg1
)))
8651 arg1
= ada_coerce_to_simple_array (arg1
);
8653 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8654 error (_("invalid dimension number to '%s"),
8655 ada_attribute_name (op
));
8657 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8659 type
= ada_index_type (value_type (arg1
), tem
);
8662 (_("attempt to take bound of something that is not an array"));
8663 return allocate_value (type
);
8668 default: /* Should never happen. */
8669 error (_("unexpected attribute encountered"));
8671 return ada_array_bound (arg1
, tem
, 0);
8673 return ada_array_bound (arg1
, tem
, 1);
8675 return ada_array_length (arg1
, tem
);
8678 else if (discrete_type_p (type_arg
))
8680 struct type
*range_type
;
8681 char *name
= ada_type_name (type_arg
);
8683 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8685 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8686 if (range_type
== NULL
)
8687 range_type
= type_arg
;
8691 error (_("unexpected attribute encountered"));
8693 return discrete_type_low_bound (range_type
);
8695 return discrete_type_high_bound (range_type
);
8697 error (_("the 'length attribute applies only to array types"));
8700 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8701 error (_("unimplemented type attribute"));
8706 if (ada_is_packed_array_type (type_arg
))
8707 type_arg
= decode_packed_array_type (type_arg
);
8709 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8710 error (_("invalid dimension number to '%s"),
8711 ada_attribute_name (op
));
8713 type
= ada_index_type (type_arg
, tem
);
8716 (_("attempt to take bound of something that is not an array"));
8717 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8718 return allocate_value (type
);
8723 error (_("unexpected attribute encountered"));
8725 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8726 return value_from_longest (type
, low
);
8728 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8729 return value_from_longest (type
, high
);
8731 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8732 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8733 return value_from_longest (type
, high
- low
+ 1);
8739 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8740 if (noside
== EVAL_SKIP
)
8743 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8744 return value_zero (ada_tag_type (arg1
), not_lval
);
8746 return ada_value_tag (arg1
);
8750 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8751 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8752 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8753 if (noside
== EVAL_SKIP
)
8755 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8756 return value_zero (value_type (arg1
), not_lval
);
8758 return value_binop (arg1
, arg2
,
8759 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8761 case OP_ATR_MODULUS
:
8763 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
8764 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8766 if (noside
== EVAL_SKIP
)
8769 if (!ada_is_modular_type (type_arg
))
8770 error (_("'modulus must be applied to modular type"));
8772 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8773 ada_modulus (type_arg
));
8778 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8779 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8780 if (noside
== EVAL_SKIP
)
8782 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8783 return value_zero (builtin_type_int
, not_lval
);
8785 return value_pos_atr (arg1
);
8788 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8789 if (noside
== EVAL_SKIP
)
8791 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8792 return value_zero (builtin_type_int
, not_lval
);
8794 return value_from_longest (builtin_type_int
,
8796 * TYPE_LENGTH (value_type (arg1
)));
8799 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8800 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8801 type
= exp
->elts
[pc
+ 2].type
;
8802 if (noside
== EVAL_SKIP
)
8804 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8805 return value_zero (type
, not_lval
);
8807 return value_val_atr (type
, arg1
);
8810 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8811 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8812 if (noside
== EVAL_SKIP
)
8814 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8815 return value_zero (value_type (arg1
), not_lval
);
8817 return value_binop (arg1
, arg2
, op
);
8820 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8821 if (noside
== EVAL_SKIP
)
8827 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8828 if (noside
== EVAL_SKIP
)
8830 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
8831 return value_neg (arg1
);
8836 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
8837 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
8838 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
8839 if (noside
== EVAL_SKIP
)
8841 type
= ada_check_typedef (value_type (arg1
));
8842 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8844 if (ada_is_array_descriptor_type (type
))
8845 /* GDB allows dereferencing GNAT array descriptors. */
8847 struct type
*arrType
= ada_type_of_array (arg1
, 0);
8848 if (arrType
== NULL
)
8849 error (_("Attempt to dereference null array pointer."));
8850 return value_at_lazy (arrType
, 0);
8852 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
8853 || TYPE_CODE (type
) == TYPE_CODE_REF
8854 /* In C you can dereference an array to get the 1st elt. */
8855 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8857 type
= to_static_fixed_type
8859 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
8861 return value_zero (type
, lval_memory
);
8863 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
8864 /* GDB allows dereferencing an int. */
8865 return value_zero (builtin_type_int
, lval_memory
);
8867 error (_("Attempt to take contents of a non-pointer value."));
8869 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
8870 type
= ada_check_typedef (value_type (arg1
));
8872 if (ada_is_array_descriptor_type (type
))
8873 /* GDB allows dereferencing GNAT array descriptors. */
8874 return ada_coerce_to_simple_array (arg1
);
8876 return ada_value_ind (arg1
);
8878 case STRUCTOP_STRUCT
:
8879 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8880 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
8881 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8882 if (noside
== EVAL_SKIP
)
8884 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8886 struct type
*type1
= value_type (arg1
);
8887 if (ada_is_tagged_type (type1
, 1))
8889 type
= ada_lookup_struct_elt_type (type1
,
8890 &exp
->elts
[pc
+ 2].string
,
8893 /* In this case, we assume that the field COULD exist
8894 in some extension of the type. Return an object of
8895 "type" void, which will match any formal
8896 (see ada_type_match). */
8897 return value_zero (builtin_type_void
, lval_memory
);
8901 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
8904 return value_zero (ada_aligned_type (type
), lval_memory
);
8908 ada_to_fixed_value (unwrap_value
8909 (ada_value_struct_elt
8910 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
8912 /* The value is not supposed to be used. This is here to make it
8913 easier to accommodate expressions that contain types. */
8915 if (noside
== EVAL_SKIP
)
8917 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8918 return allocate_value (exp
->elts
[pc
+ 1].type
);
8920 error (_("Attempt to use a type name as an expression"));
8925 case OP_DISCRETE_RANGE
:
8928 if (noside
== EVAL_NORMAL
)
8932 error (_("Undefined name, ambiguous name, or renaming used in "
8933 "component association: %s."), &exp
->elts
[pc
+2].string
);
8935 error (_("Aggregates only allowed on the right of an assignment"));
8937 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
8940 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
8942 for (tem
= 0; tem
< nargs
; tem
+= 1)
8943 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8948 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
8954 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
8955 type name that encodes the 'small and 'delta information.
8956 Otherwise, return NULL. */
8959 fixed_type_info (struct type
*type
)
8961 const char *name
= ada_type_name (type
);
8962 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
8964 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
8966 const char *tail
= strstr (name
, "___XF_");
8972 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
8973 return fixed_type_info (TYPE_TARGET_TYPE (type
));
8978 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
8981 ada_is_fixed_point_type (struct type
*type
)
8983 return fixed_type_info (type
) != NULL
;
8986 /* Return non-zero iff TYPE represents a System.Address type. */
8989 ada_is_system_address_type (struct type
*type
)
8991 return (TYPE_NAME (type
)
8992 && strcmp (TYPE_NAME (type
), "system__address") == 0);
8995 /* Assuming that TYPE is the representation of an Ada fixed-point
8996 type, return its delta, or -1 if the type is malformed and the
8997 delta cannot be determined. */
9000 ada_delta (struct type
*type
)
9002 const char *encoding
= fixed_type_info (type
);
9005 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9008 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9011 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9012 factor ('SMALL value) associated with the type. */
9015 scaling_factor (struct type
*type
)
9017 const char *encoding
= fixed_type_info (type
);
9018 unsigned long num0
, den0
, num1
, den1
;
9021 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9026 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9028 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9032 /* Assuming that X is the representation of a value of fixed-point
9033 type TYPE, return its floating-point equivalent. */
9036 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9038 return (DOUBLEST
) x
*scaling_factor (type
);
9041 /* The representation of a fixed-point value of type TYPE
9042 corresponding to the value X. */
9045 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9047 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9051 /* VAX floating formats */
9053 /* Non-zero iff TYPE represents one of the special VAX floating-point
9057 ada_is_vax_floating_type (struct type
*type
)
9060 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9063 && (TYPE_CODE (type
) == TYPE_CODE_INT
9064 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9065 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9068 /* The type of special VAX floating-point type this is, assuming
9069 ada_is_vax_floating_point. */
9072 ada_vax_float_type_suffix (struct type
*type
)
9074 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9077 /* A value representing the special debugging function that outputs
9078 VAX floating-point values of the type represented by TYPE. Assumes
9079 ada_is_vax_floating_type (TYPE). */
9082 ada_vax_float_print_function (struct type
*type
)
9084 switch (ada_vax_float_type_suffix (type
))
9087 return get_var_value ("DEBUG_STRING_F", 0);
9089 return get_var_value ("DEBUG_STRING_D", 0);
9091 return get_var_value ("DEBUG_STRING_G", 0);
9093 error (_("invalid VAX floating-point type"));
9100 /* Scan STR beginning at position K for a discriminant name, and
9101 return the value of that discriminant field of DVAL in *PX. If
9102 PNEW_K is not null, put the position of the character beyond the
9103 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9104 not alter *PX and *PNEW_K if unsuccessful. */
9107 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9110 static char *bound_buffer
= NULL
;
9111 static size_t bound_buffer_len
= 0;
9114 struct value
*bound_val
;
9116 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9119 pend
= strstr (str
+ k
, "__");
9123 k
+= strlen (bound
);
9127 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9128 bound
= bound_buffer
;
9129 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9130 bound
[pend
- (str
+ k
)] = '\0';
9134 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9135 if (bound_val
== NULL
)
9138 *px
= value_as_long (bound_val
);
9144 /* Value of variable named NAME in the current environment. If
9145 no such variable found, then if ERR_MSG is null, returns 0, and
9146 otherwise causes an error with message ERR_MSG. */
9148 static struct value
*
9149 get_var_value (char *name
, char *err_msg
)
9151 struct ada_symbol_info
*syms
;
9154 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9159 if (err_msg
== NULL
)
9162 error (("%s"), err_msg
);
9165 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9168 /* Value of integer variable named NAME in the current environment. If
9169 no such variable found, returns 0, and sets *FLAG to 0. If
9170 successful, sets *FLAG to 1. */
9173 get_int_var_value (char *name
, int *flag
)
9175 struct value
*var_val
= get_var_value (name
, 0);
9187 return value_as_long (var_val
);
9192 /* Return a range type whose base type is that of the range type named
9193 NAME in the current environment, and whose bounds are calculated
9194 from NAME according to the GNAT range encoding conventions.
9195 Extract discriminant values, if needed, from DVAL. If a new type
9196 must be created, allocate in OBJFILE's space. The bounds
9197 information, in general, is encoded in NAME, the base type given in
9198 the named range type. */
9200 static struct type
*
9201 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9203 struct type
*raw_type
= ada_find_any_type (name
);
9204 struct type
*base_type
;
9207 if (raw_type
== NULL
)
9208 base_type
= builtin_type_int
;
9209 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9210 base_type
= TYPE_TARGET_TYPE (raw_type
);
9212 base_type
= raw_type
;
9214 subtype_info
= strstr (name
, "___XD");
9215 if (subtype_info
== NULL
)
9219 static char *name_buf
= NULL
;
9220 static size_t name_len
= 0;
9221 int prefix_len
= subtype_info
- name
;
9227 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9228 strncpy (name_buf
, name
, prefix_len
);
9229 name_buf
[prefix_len
] = '\0';
9232 bounds_str
= strchr (subtype_info
, '_');
9235 if (*subtype_info
== 'L')
9237 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9238 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9240 if (bounds_str
[n
] == '_')
9242 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9249 strcpy (name_buf
+ prefix_len
, "___L");
9250 L
= get_int_var_value (name_buf
, &ok
);
9253 lim_warning (_("Unknown lower bound, using 1."));
9258 if (*subtype_info
== 'U')
9260 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9261 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9267 strcpy (name_buf
+ prefix_len
, "___U");
9268 U
= get_int_var_value (name_buf
, &ok
);
9271 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9276 if (objfile
== NULL
)
9277 objfile
= TYPE_OBJFILE (base_type
);
9278 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9279 TYPE_NAME (type
) = name
;
9284 /* True iff NAME is the name of a range type. */
9287 ada_is_range_type_name (const char *name
)
9289 return (name
!= NULL
&& strstr (name
, "___XD"));
9295 /* True iff TYPE is an Ada modular type. */
9298 ada_is_modular_type (struct type
*type
)
9300 struct type
*subranged_type
= base_type (type
);
9302 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9303 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9304 && TYPE_UNSIGNED (subranged_type
));
9307 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9310 ada_modulus (struct type
* type
)
9312 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9316 /* Ada exception catchpoint support:
9317 ---------------------------------
9319 We support 3 kinds of exception catchpoints:
9320 . catchpoints on Ada exceptions
9321 . catchpoints on unhandled Ada exceptions
9322 . catchpoints on failed assertions
9324 Exceptions raised during failed assertions, or unhandled exceptions
9325 could perfectly be caught with the general catchpoint on Ada exceptions.
9326 However, we can easily differentiate these two special cases, and having
9327 the option to distinguish these two cases from the rest can be useful
9328 to zero-in on certain situations.
9330 Exception catchpoints are a specialized form of breakpoint,
9331 since they rely on inserting breakpoints inside known routines
9332 of the GNAT runtime. The implementation therefore uses a standard
9333 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9336 Support in the runtime for exception catchpoints have been changed
9337 a few times already, and these changes affect the implementation
9338 of these catchpoints. In order to be able to support several
9339 variants of the runtime, we use a sniffer that will determine
9340 the runtime variant used by the program being debugged.
9342 At this time, we do not support the use of conditions on Ada exception
9343 catchpoints. The COND and COND_STRING fields are therefore set
9344 to NULL (most of the time, see below).
9346 Conditions where EXP_STRING, COND, and COND_STRING are used:
9348 When a user specifies the name of a specific exception in the case
9349 of catchpoints on Ada exceptions, we store the name of that exception
9350 in the EXP_STRING. We then translate this request into an actual
9351 condition stored in COND_STRING, and then parse it into an expression
9354 /* The different types of catchpoints that we introduced for catching
9357 enum exception_catchpoint_kind
9360 ex_catch_exception_unhandled
,
9364 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9366 /* A structure that describes how to support exception catchpoints
9367 for a given executable. */
9369 struct exception_support_info
9371 /* The name of the symbol to break on in order to insert
9372 a catchpoint on exceptions. */
9373 const char *catch_exception_sym
;
9375 /* The name of the symbol to break on in order to insert
9376 a catchpoint on unhandled exceptions. */
9377 const char *catch_exception_unhandled_sym
;
9379 /* The name of the symbol to break on in order to insert
9380 a catchpoint on failed assertions. */
9381 const char *catch_assert_sym
;
9383 /* Assuming that the inferior just triggered an unhandled exception
9384 catchpoint, this function is responsible for returning the address
9385 in inferior memory where the name of that exception is stored.
9386 Return zero if the address could not be computed. */
9387 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9390 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9391 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9393 /* The following exception support info structure describes how to
9394 implement exception catchpoints with the latest version of the
9395 Ada runtime (as of 2007-03-06). */
9397 static const struct exception_support_info default_exception_support_info
=
9399 "__gnat_debug_raise_exception", /* catch_exception_sym */
9400 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9401 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9402 ada_unhandled_exception_name_addr
9405 /* The following exception support info structure describes how to
9406 implement exception catchpoints with a slightly older version
9407 of the Ada runtime. */
9409 static const struct exception_support_info exception_support_info_fallback
=
9411 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9412 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9413 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9414 ada_unhandled_exception_name_addr_from_raise
9417 /* For each executable, we sniff which exception info structure to use
9418 and cache it in the following global variable. */
9420 static const struct exception_support_info
*exception_info
= NULL
;
9422 /* Inspect the Ada runtime and determine which exception info structure
9423 should be used to provide support for exception catchpoints.
9425 This function will always set exception_info, or raise an error. */
9428 ada_exception_support_info_sniffer (void)
9432 /* If the exception info is already known, then no need to recompute it. */
9433 if (exception_info
!= NULL
)
9436 /* Check the latest (default) exception support info. */
9437 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9441 exception_info
= &default_exception_support_info
;
9445 /* Try our fallback exception suport info. */
9446 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9450 exception_info
= &exception_support_info_fallback
;
9454 /* Sometimes, it is normal for us to not be able to find the routine
9455 we are looking for. This happens when the program is linked with
9456 the shared version of the GNAT runtime, and the program has not been
9457 started yet. Inform the user of these two possible causes if
9460 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9461 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9463 /* If the symbol does not exist, then check that the program is
9464 already started, to make sure that shared libraries have been
9465 loaded. If it is not started, this may mean that the symbol is
9466 in a shared library. */
9468 if (ptid_get_pid (inferior_ptid
) == 0)
9469 error (_("Unable to insert catchpoint. Try to start the program first."));
9471 /* At this point, we know that we are debugging an Ada program and
9472 that the inferior has been started, but we still are not able to
9473 find the run-time symbols. That can mean that we are in
9474 configurable run time mode, or that a-except as been optimized
9475 out by the linker... In any case, at this point it is not worth
9476 supporting this feature. */
9478 error (_("Cannot insert catchpoints in this configuration."));
9481 /* An observer of "executable_changed" events.
9482 Its role is to clear certain cached values that need to be recomputed
9483 each time a new executable is loaded by GDB. */
9486 ada_executable_changed_observer (void *unused
)
9488 /* If the executable changed, then it is possible that the Ada runtime
9489 is different. So we need to invalidate the exception support info
9491 exception_info
= NULL
;
9494 /* Return the name of the function at PC, NULL if could not find it.
9495 This function only checks the debugging information, not the symbol
9499 function_name_from_pc (CORE_ADDR pc
)
9503 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9509 /* True iff FRAME is very likely to be that of a function that is
9510 part of the runtime system. This is all very heuristic, but is
9511 intended to be used as advice as to what frames are uninteresting
9515 is_known_support_routine (struct frame_info
*frame
)
9517 struct symtab_and_line sal
;
9521 /* If this code does not have any debugging information (no symtab),
9522 This cannot be any user code. */
9524 find_frame_sal (frame
, &sal
);
9525 if (sal
.symtab
== NULL
)
9528 /* If there is a symtab, but the associated source file cannot be
9529 located, then assume this is not user code: Selecting a frame
9530 for which we cannot display the code would not be very helpful
9531 for the user. This should also take care of case such as VxWorks
9532 where the kernel has some debugging info provided for a few units. */
9534 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9537 /* Check the unit filename againt the Ada runtime file naming.
9538 We also check the name of the objfile against the name of some
9539 known system libraries that sometimes come with debugging info
9542 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9544 re_comp (known_runtime_file_name_patterns
[i
]);
9545 if (re_exec (sal
.symtab
->filename
))
9547 if (sal
.symtab
->objfile
!= NULL
9548 && re_exec (sal
.symtab
->objfile
->name
))
9552 /* Check whether the function is a GNAT-generated entity. */
9554 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9555 if (func_name
== NULL
)
9558 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9560 re_comp (known_auxiliary_function_name_patterns
[i
]);
9561 if (re_exec (func_name
))
9568 /* Find the first frame that contains debugging information and that is not
9569 part of the Ada run-time, starting from FI and moving upward. */
9572 ada_find_printable_frame (struct frame_info
*fi
)
9574 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9576 if (!is_known_support_routine (fi
))
9585 /* Assuming that the inferior just triggered an unhandled exception
9586 catchpoint, return the address in inferior memory where the name
9587 of the exception is stored.
9589 Return zero if the address could not be computed. */
9592 ada_unhandled_exception_name_addr (void)
9594 return parse_and_eval_address ("e.full_name");
9597 /* Same as ada_unhandled_exception_name_addr, except that this function
9598 should be used when the inferior uses an older version of the runtime,
9599 where the exception name needs to be extracted from a specific frame
9600 several frames up in the callstack. */
9603 ada_unhandled_exception_name_addr_from_raise (void)
9606 struct frame_info
*fi
;
9608 /* To determine the name of this exception, we need to select
9609 the frame corresponding to RAISE_SYM_NAME. This frame is
9610 at least 3 levels up, so we simply skip the first 3 frames
9611 without checking the name of their associated function. */
9612 fi
= get_current_frame ();
9613 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9615 fi
= get_prev_frame (fi
);
9619 const char *func_name
=
9620 function_name_from_pc (get_frame_address_in_block (fi
));
9621 if (func_name
!= NULL
9622 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9623 break; /* We found the frame we were looking for... */
9624 fi
= get_prev_frame (fi
);
9631 return parse_and_eval_address ("id.full_name");
9634 /* Assuming the inferior just triggered an Ada exception catchpoint
9635 (of any type), return the address in inferior memory where the name
9636 of the exception is stored, if applicable.
9638 Return zero if the address could not be computed, or if not relevant. */
9641 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9642 struct breakpoint
*b
)
9646 case ex_catch_exception
:
9647 return (parse_and_eval_address ("e.full_name"));
9650 case ex_catch_exception_unhandled
:
9651 return exception_info
->unhandled_exception_name_addr ();
9654 case ex_catch_assert
:
9655 return 0; /* Exception name is not relevant in this case. */
9659 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9663 return 0; /* Should never be reached. */
9666 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9667 any error that ada_exception_name_addr_1 might cause to be thrown.
9668 When an error is intercepted, a warning with the error message is printed,
9669 and zero is returned. */
9672 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9673 struct breakpoint
*b
)
9675 struct gdb_exception e
;
9676 CORE_ADDR result
= 0;
9678 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9680 result
= ada_exception_name_addr_1 (ex
, b
);
9685 warning (_("failed to get exception name: %s"), e
.message
);
9692 /* Implement the PRINT_IT method in the breakpoint_ops structure
9693 for all exception catchpoint kinds. */
9695 static enum print_stop_action
9696 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9698 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9699 char exception_name
[256];
9703 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9704 exception_name
[sizeof (exception_name
) - 1] = '\0';
9707 ada_find_printable_frame (get_current_frame ());
9709 annotate_catchpoint (b
->number
);
9712 case ex_catch_exception
:
9714 printf_filtered (_("\nCatchpoint %d, %s at "),
9715 b
->number
, exception_name
);
9717 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
9719 case ex_catch_exception_unhandled
:
9721 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
9722 b
->number
, exception_name
);
9724 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
9727 case ex_catch_assert
:
9728 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
9733 return PRINT_SRC_AND_LOC
;
9736 /* Implement the PRINT_ONE method in the breakpoint_ops structure
9737 for all exception catchpoint kinds. */
9740 print_one_exception (enum exception_catchpoint_kind ex
,
9741 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9746 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
9750 *last_addr
= b
->loc
->address
;
9753 case ex_catch_exception
:
9754 if (b
->exp_string
!= NULL
)
9756 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
9758 ui_out_field_string (uiout
, "what", msg
);
9762 ui_out_field_string (uiout
, "what", "all Ada exceptions");
9766 case ex_catch_exception_unhandled
:
9767 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
9770 case ex_catch_assert
:
9771 ui_out_field_string (uiout
, "what", "failed Ada assertions");
9775 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9780 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
9781 for all exception catchpoint kinds. */
9784 print_mention_exception (enum exception_catchpoint_kind ex
,
9785 struct breakpoint
*b
)
9789 case ex_catch_exception
:
9790 if (b
->exp_string
!= NULL
)
9791 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
9792 b
->number
, b
->exp_string
);
9794 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
9798 case ex_catch_exception_unhandled
:
9799 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
9803 case ex_catch_assert
:
9804 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
9808 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9813 /* Virtual table for "catch exception" breakpoints. */
9815 static enum print_stop_action
9816 print_it_catch_exception (struct breakpoint
*b
)
9818 return print_it_exception (ex_catch_exception
, b
);
9822 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9824 print_one_exception (ex_catch_exception
, b
, last_addr
);
9828 print_mention_catch_exception (struct breakpoint
*b
)
9830 print_mention_exception (ex_catch_exception
, b
);
9833 static struct breakpoint_ops catch_exception_breakpoint_ops
=
9835 print_it_catch_exception
,
9836 print_one_catch_exception
,
9837 print_mention_catch_exception
9840 /* Virtual table for "catch exception unhandled" breakpoints. */
9842 static enum print_stop_action
9843 print_it_catch_exception_unhandled (struct breakpoint
*b
)
9845 return print_it_exception (ex_catch_exception_unhandled
, b
);
9849 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9851 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
9855 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
9857 print_mention_exception (ex_catch_exception_unhandled
, b
);
9860 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
9861 print_it_catch_exception_unhandled
,
9862 print_one_catch_exception_unhandled
,
9863 print_mention_catch_exception_unhandled
9866 /* Virtual table for "catch assert" breakpoints. */
9868 static enum print_stop_action
9869 print_it_catch_assert (struct breakpoint
*b
)
9871 return print_it_exception (ex_catch_assert
, b
);
9875 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
9877 print_one_exception (ex_catch_assert
, b
, last_addr
);
9881 print_mention_catch_assert (struct breakpoint
*b
)
9883 print_mention_exception (ex_catch_assert
, b
);
9886 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
9887 print_it_catch_assert
,
9888 print_one_catch_assert
,
9889 print_mention_catch_assert
9892 /* Return non-zero if B is an Ada exception catchpoint. */
9895 ada_exception_catchpoint_p (struct breakpoint
*b
)
9897 return (b
->ops
== &catch_exception_breakpoint_ops
9898 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
9899 || b
->ops
== &catch_assert_breakpoint_ops
);
9902 /* Return a newly allocated copy of the first space-separated token
9903 in ARGSP, and then adjust ARGSP to point immediately after that
9906 Return NULL if ARGPS does not contain any more tokens. */
9909 ada_get_next_arg (char **argsp
)
9911 char *args
= *argsp
;
9915 /* Skip any leading white space. */
9917 while (isspace (*args
))
9920 if (args
[0] == '\0')
9921 return NULL
; /* No more arguments. */
9923 /* Find the end of the current argument. */
9926 while (*end
!= '\0' && !isspace (*end
))
9929 /* Adjust ARGSP to point to the start of the next argument. */
9933 /* Make a copy of the current argument and return it. */
9935 result
= xmalloc (end
- args
+ 1);
9936 strncpy (result
, args
, end
- args
);
9937 result
[end
- args
] = '\0';
9942 /* Split the arguments specified in a "catch exception" command.
9943 Set EX to the appropriate catchpoint type.
9944 Set EXP_STRING to the name of the specific exception if
9945 specified by the user. */
9948 catch_ada_exception_command_split (char *args
,
9949 enum exception_catchpoint_kind
*ex
,
9952 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
9953 char *exception_name
;
9955 exception_name
= ada_get_next_arg (&args
);
9956 make_cleanup (xfree
, exception_name
);
9958 /* Check that we do not have any more arguments. Anything else
9961 while (isspace (*args
))
9964 if (args
[0] != '\0')
9965 error (_("Junk at end of expression"));
9967 discard_cleanups (old_chain
);
9969 if (exception_name
== NULL
)
9971 /* Catch all exceptions. */
9972 *ex
= ex_catch_exception
;
9975 else if (strcmp (exception_name
, "unhandled") == 0)
9977 /* Catch unhandled exceptions. */
9978 *ex
= ex_catch_exception_unhandled
;
9983 /* Catch a specific exception. */
9984 *ex
= ex_catch_exception
;
9985 *exp_string
= exception_name
;
9989 /* Return the name of the symbol on which we should break in order to
9990 implement a catchpoint of the EX kind. */
9993 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
9995 gdb_assert (exception_info
!= NULL
);
9999 case ex_catch_exception
:
10000 return (exception_info
->catch_exception_sym
);
10002 case ex_catch_exception_unhandled
:
10003 return (exception_info
->catch_exception_unhandled_sym
);
10005 case ex_catch_assert
:
10006 return (exception_info
->catch_assert_sym
);
10009 internal_error (__FILE__
, __LINE__
,
10010 _("unexpected catchpoint kind (%d)"), ex
);
10014 /* Return the breakpoint ops "virtual table" used for catchpoints
10017 static struct breakpoint_ops
*
10018 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10022 case ex_catch_exception
:
10023 return (&catch_exception_breakpoint_ops
);
10025 case ex_catch_exception_unhandled
:
10026 return (&catch_exception_unhandled_breakpoint_ops
);
10028 case ex_catch_assert
:
10029 return (&catch_assert_breakpoint_ops
);
10032 internal_error (__FILE__
, __LINE__
,
10033 _("unexpected catchpoint kind (%d)"), ex
);
10037 /* Return the condition that will be used to match the current exception
10038 being raised with the exception that the user wants to catch. This
10039 assumes that this condition is used when the inferior just triggered
10040 an exception catchpoint.
10042 The string returned is a newly allocated string that needs to be
10043 deallocated later. */
10046 ada_exception_catchpoint_cond_string (const char *exp_string
)
10048 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10051 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10053 static struct expression
*
10054 ada_parse_catchpoint_condition (char *cond_string
,
10055 struct symtab_and_line sal
)
10057 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10060 /* Return the symtab_and_line that should be used to insert an exception
10061 catchpoint of the TYPE kind.
10063 EX_STRING should contain the name of a specific exception
10064 that the catchpoint should catch, or NULL otherwise.
10066 The idea behind all the remaining parameters is that their names match
10067 the name of certain fields in the breakpoint structure that are used to
10068 handle exception catchpoints. This function returns the value to which
10069 these fields should be set, depending on the type of catchpoint we need
10072 If COND and COND_STRING are both non-NULL, any value they might
10073 hold will be free'ed, and then replaced by newly allocated ones.
10074 These parameters are left untouched otherwise. */
10076 static struct symtab_and_line
10077 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10078 char **addr_string
, char **cond_string
,
10079 struct expression
**cond
, struct breakpoint_ops
**ops
)
10081 const char *sym_name
;
10082 struct symbol
*sym
;
10083 struct symtab_and_line sal
;
10085 /* First, find out which exception support info to use. */
10086 ada_exception_support_info_sniffer ();
10088 /* Then lookup the function on which we will break in order to catch
10089 the Ada exceptions requested by the user. */
10091 sym_name
= ada_exception_sym_name (ex
);
10092 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10094 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10095 that should be compiled with debugging information. As a result, we
10096 expect to find that symbol in the symtabs. If we don't find it, then
10097 the target most likely does not support Ada exceptions, or we cannot
10098 insert exception breakpoints yet, because the GNAT runtime hasn't been
10101 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10102 in such a way that no debugging information is produced for the symbol
10103 we are looking for. In this case, we could search the minimal symbols
10104 as a fall-back mechanism. This would still be operating in degraded
10105 mode, however, as we would still be missing the debugging information
10106 that is needed in order to extract the name of the exception being
10107 raised (this name is printed in the catchpoint message, and is also
10108 used when trying to catch a specific exception). We do not handle
10109 this case for now. */
10112 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10114 /* Make sure that the symbol we found corresponds to a function. */
10115 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10116 error (_("Symbol \"%s\" is not a function (class = %d)"),
10117 sym_name
, SYMBOL_CLASS (sym
));
10119 sal
= find_function_start_sal (sym
, 1);
10121 /* Set ADDR_STRING. */
10123 *addr_string
= xstrdup (sym_name
);
10125 /* Set the COND and COND_STRING (if not NULL). */
10127 if (cond_string
!= NULL
&& cond
!= NULL
)
10129 if (*cond_string
!= NULL
)
10131 xfree (*cond_string
);
10132 *cond_string
= NULL
;
10139 if (exp_string
!= NULL
)
10141 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10142 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10147 *ops
= ada_exception_breakpoint_ops (ex
);
10152 /* Parse the arguments (ARGS) of the "catch exception" command.
10154 Set TYPE to the appropriate exception catchpoint type.
10155 If the user asked the catchpoint to catch only a specific
10156 exception, then save the exception name in ADDR_STRING.
10158 See ada_exception_sal for a description of all the remaining
10159 function arguments of this function. */
10161 struct symtab_and_line
10162 ada_decode_exception_location (char *args
, char **addr_string
,
10163 char **exp_string
, char **cond_string
,
10164 struct expression
**cond
,
10165 struct breakpoint_ops
**ops
)
10167 enum exception_catchpoint_kind ex
;
10169 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10170 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10174 struct symtab_and_line
10175 ada_decode_assert_location (char *args
, char **addr_string
,
10176 struct breakpoint_ops
**ops
)
10178 /* Check that no argument where provided at the end of the command. */
10182 while (isspace (*args
))
10185 error (_("Junk at end of arguments."));
10188 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10193 /* Information about operators given special treatment in functions
10195 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10197 #define ADA_OPERATORS \
10198 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10199 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10200 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10201 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10202 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10203 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10204 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10205 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10206 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10207 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10208 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10209 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10210 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10211 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10212 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10213 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10214 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10215 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10216 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10219 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10221 switch (exp
->elts
[pc
- 1].opcode
)
10224 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10227 #define OP_DEFN(op, len, args, binop) \
10228 case op: *oplenp = len; *argsp = args; break;
10234 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10239 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10245 ada_op_name (enum exp_opcode opcode
)
10250 return op_name_standard (opcode
);
10252 #define OP_DEFN(op, len, args, binop) case op: return #op;
10257 return "OP_AGGREGATE";
10259 return "OP_CHOICES";
10265 /* As for operator_length, but assumes PC is pointing at the first
10266 element of the operator, and gives meaningful results only for the
10267 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10270 ada_forward_operator_length (struct expression
*exp
, int pc
,
10271 int *oplenp
, int *argsp
)
10273 switch (exp
->elts
[pc
].opcode
)
10276 *oplenp
= *argsp
= 0;
10279 #define OP_DEFN(op, len, args, binop) \
10280 case op: *oplenp = len; *argsp = args; break;
10286 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10291 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10297 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10298 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10306 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10308 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10313 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10317 /* Ada attributes ('Foo). */
10320 case OP_ATR_LENGTH
:
10324 case OP_ATR_MODULUS
:
10331 case UNOP_IN_RANGE
:
10333 /* XXX: gdb_sprint_host_address, type_sprint */
10334 fprintf_filtered (stream
, _("Type @"));
10335 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10336 fprintf_filtered (stream
, " (");
10337 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10338 fprintf_filtered (stream
, ")");
10340 case BINOP_IN_BOUNDS
:
10341 fprintf_filtered (stream
, " (%d)",
10342 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10344 case TERNOP_IN_RANGE
:
10349 case OP_DISCRETE_RANGE
:
10350 case OP_POSITIONAL
:
10357 char *name
= &exp
->elts
[elt
+ 2].string
;
10358 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10359 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10364 return dump_subexp_body_standard (exp
, stream
, elt
);
10368 for (i
= 0; i
< nargs
; i
+= 1)
10369 elt
= dump_subexp (exp
, stream
, elt
);
10374 /* The Ada extension of print_subexp (q.v.). */
10377 ada_print_subexp (struct expression
*exp
, int *pos
,
10378 struct ui_file
*stream
, enum precedence prec
)
10380 int oplen
, nargs
, i
;
10382 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10384 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10391 print_subexp_standard (exp
, pos
, stream
, prec
);
10395 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10398 case BINOP_IN_BOUNDS
:
10399 /* XXX: sprint_subexp */
10400 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10401 fputs_filtered (" in ", stream
);
10402 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10403 fputs_filtered ("'range", stream
);
10404 if (exp
->elts
[pc
+ 1].longconst
> 1)
10405 fprintf_filtered (stream
, "(%ld)",
10406 (long) exp
->elts
[pc
+ 1].longconst
);
10409 case TERNOP_IN_RANGE
:
10410 if (prec
>= PREC_EQUAL
)
10411 fputs_filtered ("(", stream
);
10412 /* XXX: sprint_subexp */
10413 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10414 fputs_filtered (" in ", stream
);
10415 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10416 fputs_filtered (" .. ", stream
);
10417 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10418 if (prec
>= PREC_EQUAL
)
10419 fputs_filtered (")", stream
);
10424 case OP_ATR_LENGTH
:
10428 case OP_ATR_MODULUS
:
10433 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10435 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10436 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10440 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10441 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10445 for (tem
= 1; tem
< nargs
; tem
+= 1)
10447 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10448 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10450 fputs_filtered (")", stream
);
10455 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10456 fputs_filtered ("'(", stream
);
10457 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10458 fputs_filtered (")", stream
);
10461 case UNOP_IN_RANGE
:
10462 /* XXX: sprint_subexp */
10463 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10464 fputs_filtered (" in ", stream
);
10465 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10468 case OP_DISCRETE_RANGE
:
10469 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10470 fputs_filtered ("..", stream
);
10471 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10475 fputs_filtered ("others => ", stream
);
10476 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10480 for (i
= 0; i
< nargs
-1; i
+= 1)
10483 fputs_filtered ("|", stream
);
10484 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10486 fputs_filtered (" => ", stream
);
10487 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10490 case OP_POSITIONAL
:
10491 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10495 fputs_filtered ("(", stream
);
10496 for (i
= 0; i
< nargs
; i
+= 1)
10499 fputs_filtered (", ", stream
);
10500 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10502 fputs_filtered (")", stream
);
10507 /* Table mapping opcodes into strings for printing operators
10508 and precedences of the operators. */
10510 static const struct op_print ada_op_print_tab
[] = {
10511 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10512 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10513 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10514 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10515 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10516 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10517 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10518 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10519 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10520 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10521 {">", BINOP_GTR
, PREC_ORDER
, 0},
10522 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10523 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10524 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10525 {"+", BINOP_ADD
, PREC_ADD
, 0},
10526 {"-", BINOP_SUB
, PREC_ADD
, 0},
10527 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10528 {"*", BINOP_MUL
, PREC_MUL
, 0},
10529 {"/", BINOP_DIV
, PREC_MUL
, 0},
10530 {"rem", BINOP_REM
, PREC_MUL
, 0},
10531 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10532 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10533 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10534 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10535 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10536 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10537 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10538 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10539 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10540 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10541 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10545 enum ada_primitive_types
{
10546 ada_primitive_type_int
,
10547 ada_primitive_type_long
,
10548 ada_primitive_type_short
,
10549 ada_primitive_type_char
,
10550 ada_primitive_type_float
,
10551 ada_primitive_type_double
,
10552 ada_primitive_type_void
,
10553 ada_primitive_type_long_long
,
10554 ada_primitive_type_long_double
,
10555 ada_primitive_type_natural
,
10556 ada_primitive_type_positive
,
10557 ada_primitive_type_system_address
,
10558 nr_ada_primitive_types
10562 ada_language_arch_info (struct gdbarch
*gdbarch
,
10563 struct language_arch_info
*lai
)
10565 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10566 lai
->primitive_type_vector
10567 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10569 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10570 init_type (TYPE_CODE_INT
,
10571 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10572 0, "integer", (struct objfile
*) NULL
);
10573 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10574 init_type (TYPE_CODE_INT
,
10575 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10576 0, "long_integer", (struct objfile
*) NULL
);
10577 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10578 init_type (TYPE_CODE_INT
,
10579 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10580 0, "short_integer", (struct objfile
*) NULL
);
10581 lai
->string_char_type
=
10582 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10583 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10584 0, "character", (struct objfile
*) NULL
);
10585 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10586 init_type (TYPE_CODE_FLT
,
10587 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10588 0, "float", (struct objfile
*) NULL
);
10589 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10590 init_type (TYPE_CODE_FLT
,
10591 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10592 0, "long_float", (struct objfile
*) NULL
);
10593 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10594 init_type (TYPE_CODE_INT
,
10595 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10596 0, "long_long_integer", (struct objfile
*) NULL
);
10597 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10598 init_type (TYPE_CODE_FLT
,
10599 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10600 0, "long_long_float", (struct objfile
*) NULL
);
10601 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10602 init_type (TYPE_CODE_INT
,
10603 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10604 0, "natural", (struct objfile
*) NULL
);
10605 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10606 init_type (TYPE_CODE_INT
,
10607 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10608 0, "positive", (struct objfile
*) NULL
);
10609 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10611 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10612 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10613 (struct objfile
*) NULL
));
10614 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10615 = "system__address";
10618 /* Language vector */
10620 /* Not really used, but needed in the ada_language_defn. */
10623 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10625 ada_emit_char (c
, stream
, quoter
, 1);
10631 warnings_issued
= 0;
10632 return ada_parse ();
10635 static const struct exp_descriptor ada_exp_descriptor
= {
10637 ada_operator_length
,
10639 ada_dump_subexp_body
,
10640 ada_evaluate_subexp
10643 const struct language_defn ada_language_defn
= {
10644 "ada", /* Language name */
10648 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10649 that's not quite what this means. */
10651 &ada_exp_descriptor
,
10655 ada_printchar
, /* Print a character constant */
10656 ada_printstr
, /* Function to print string constant */
10657 emit_char
, /* Function to print single char (not used) */
10658 ada_print_type
, /* Print a type using appropriate syntax */
10659 ada_val_print
, /* Print a value using appropriate syntax */
10660 ada_value_print
, /* Print a top-level value */
10661 NULL
, /* Language specific skip_trampoline */
10662 NULL
, /* value_of_this */
10663 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10664 basic_lookup_transparent_type
, /* lookup_transparent_type */
10665 ada_la_decode
, /* Language specific symbol demangler */
10666 NULL
, /* Language specific class_name_from_physname */
10667 ada_op_print_tab
, /* expression operators for printing */
10668 0, /* c-style arrays */
10669 1, /* String lower bound */
10670 ada_get_gdb_completer_word_break_characters
,
10671 ada_language_arch_info
,
10672 ada_print_array_index
,
10673 default_pass_by_reference
,
10678 _initialize_ada_language (void)
10680 add_language (&ada_language_defn
);
10682 varsize_limit
= 65536;
10684 obstack_init (&symbol_list_obstack
);
10686 decoded_names_store
= htab_create_alloc
10687 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10688 NULL
, xcalloc
, xfree
);
10690 observer_attach_executable_changed (ada_executable_changed_observer
);