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"
60 #ifndef ADA_RETAIN_DOTS
61 #define ADA_RETAIN_DOTS 0
64 /* Define whether or not the C operator '/' truncates towards zero for
65 differently signed operands (truncation direction is undefined in C).
66 Copied from valarith.c. */
68 #ifndef TRUNCATION_TOWARDS_ZERO
69 #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
*, int);
120 static int is_nonfunction (struct ada_symbol_info
*, int);
122 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
125 static int num_defns_collected (struct obstack
*);
127 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
129 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
130 *, const char *, int,
133 static struct symtab
*symtab_for_sym (struct symbol
*);
135 static struct value
*resolve_subexp (struct expression
**, int *, int,
138 static void replace_operator_with_call (struct expression
**, int, int, int,
139 struct symbol
*, struct block
*);
141 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
143 static char *ada_op_name (enum exp_opcode
);
145 static const char *ada_decoded_op_name (enum exp_opcode
);
147 static int numeric_type_p (struct type
*);
149 static int integer_type_p (struct type
*);
151 static int scalar_type_p (struct type
*);
153 static int discrete_type_p (struct type
*);
155 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
160 static struct symbol
*find_old_style_renaming_symbol (const char *,
163 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
166 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
169 static struct value
*evaluate_subexp_type (struct expression
*, int *);
171 static int is_dynamic_field (struct type
*, int);
173 static struct type
*to_fixed_variant_branch_type (struct type
*,
175 CORE_ADDR
, struct value
*);
177 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
179 static struct type
*to_fixed_range_type (char *, struct value
*,
182 static struct type
*to_static_fixed_type (struct type
*);
183 static struct type
*static_unwrap_type (struct type
*type
);
185 static struct value
*unwrap_value (struct value
*);
187 static struct type
*packed_array_type (struct type
*, long *);
189 static struct type
*decode_packed_array_type (struct type
*);
191 static struct value
*decode_packed_array (struct value
*);
193 static struct value
*value_subscript_packed (struct value
*, int,
196 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
198 static struct value
*coerce_unspec_val_to_type (struct value
*,
201 static struct value
*get_var_value (char *, char *);
203 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
205 static int equiv_types (struct type
*, struct type
*);
207 static int is_name_suffix (const char *);
209 static int wild_match (const char *, int, const char *);
211 static struct value
*ada_coerce_ref (struct value
*);
213 static LONGEST
pos_atr (struct value
*);
215 static struct value
*value_pos_atr (struct value
*);
217 static struct value
*value_val_atr (struct type
*, struct value
*);
219 static struct symbol
*standard_lookup (const char *, const struct block
*,
222 static struct value
*ada_search_struct_field (char *, struct value
*, int,
225 static struct value
*ada_value_primitive_field (struct value
*, int, int,
228 static int find_struct_field (char *, struct type
*, int,
229 struct type
**, int *, int *, int *, int *);
231 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
234 static struct value
*ada_to_fixed_value (struct value
*);
236 static int ada_resolve_function (struct ada_symbol_info
*, int,
237 struct value
**, int, const char *,
240 static struct value
*ada_coerce_to_simple_array (struct value
*);
242 static int ada_is_direct_array_type (struct type
*);
244 static void ada_language_arch_info (struct gdbarch
*,
245 struct language_arch_info
*);
247 static void check_size (const struct type
*);
249 static struct value
*ada_index_struct_field (int, struct value
*, int,
252 static struct value
*assign_aggregate (struct value
*, struct value
*,
253 struct expression
*, int *, enum noside
);
255 static void aggregate_assign_from_choices (struct value
*, struct value
*,
257 int *, LONGEST
*, int *,
258 int, LONGEST
, LONGEST
);
260 static void aggregate_assign_positional (struct value
*, struct value
*,
262 int *, LONGEST
*, int *, int,
266 static void aggregate_assign_others (struct value
*, struct value
*,
268 int *, LONGEST
*, int, LONGEST
, LONGEST
);
271 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
274 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
277 static void ada_forward_operator_length (struct expression
*, int, int *,
282 /* Maximum-sized dynamic type. */
283 static unsigned int varsize_limit
;
285 /* FIXME: brobecker/2003-09-17: No longer a const because it is
286 returned by a function that does not return a const char *. */
287 static char *ada_completer_word_break_characters
=
289 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
291 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
294 /* The name of the symbol to use to get the name of the main subprogram. */
295 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
296 = "__gnat_ada_main_program_name";
298 /* Limit on the number of warnings to raise per expression evaluation. */
299 static int warning_limit
= 2;
301 /* Number of warning messages issued; reset to 0 by cleanups after
302 expression evaluation. */
303 static int warnings_issued
= 0;
305 static const char *known_runtime_file_name_patterns
[] = {
306 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
309 static const char *known_auxiliary_function_name_patterns
[] = {
310 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
313 /* Space for allocating results of ada_lookup_symbol_list. */
314 static struct obstack symbol_list_obstack
;
318 /* Given DECODED_NAME a string holding a symbol name in its
319 decoded form (ie using the Ada dotted notation), returns
320 its unqualified name. */
323 ada_unqualified_name (const char *decoded_name
)
325 const char *result
= strrchr (decoded_name
, '.');
328 result
++; /* Skip the dot... */
330 result
= decoded_name
;
335 /* Return a string starting with '<', followed by STR, and '>'.
336 The result is good until the next call. */
339 add_angle_brackets (const char *str
)
341 static char *result
= NULL
;
344 result
= (char *) xmalloc ((strlen (str
) + 3) * sizeof (char));
346 sprintf (result
, "<%s>", str
);
351 ada_get_gdb_completer_word_break_characters (void)
353 return ada_completer_word_break_characters
;
356 /* Print an array element index using the Ada syntax. */
359 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
360 int format
, enum val_prettyprint pretty
)
362 LA_VALUE_PRINT (index_value
, stream
, format
, pretty
);
363 fprintf_filtered (stream
, " => ");
366 /* Read the string located at ADDR from the inferior and store the
370 extract_string (CORE_ADDR addr
, char *buf
)
374 /* Loop, reading one byte at a time, until we reach the '\000'
375 end-of-string marker. */
378 target_read_memory (addr
+ char_index
* sizeof (char),
379 buf
+ char_index
* sizeof (char), sizeof (char));
382 while (buf
[char_index
- 1] != '\000');
385 /* Assuming VECT points to an array of *SIZE objects of size
386 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
387 updating *SIZE as necessary and returning the (new) array. */
390 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
392 if (*size
< min_size
)
395 if (*size
< min_size
)
397 vect
= xrealloc (vect
, *size
* element_size
);
402 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
403 suffix of FIELD_NAME beginning "___". */
406 field_name_match (const char *field_name
, const char *target
)
408 int len
= strlen (target
);
410 (strncmp (field_name
, target
, len
) == 0
411 && (field_name
[len
] == '\0'
412 || (strncmp (field_name
+ len
, "___", 3) == 0
413 && strcmp (field_name
+ strlen (field_name
) - 6,
418 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
419 FIELD_NAME, and return its index. This function also handles fields
420 whose name have ___ suffixes because the compiler sometimes alters
421 their name by adding such a suffix to represent fields with certain
422 constraints. If the field could not be found, return a negative
423 number if MAYBE_MISSING is set. Otherwise raise an error. */
426 ada_get_field_index (const struct type
*type
, const char *field_name
,
430 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
431 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
435 error (_("Unable to find field %s in struct %s. Aborting"),
436 field_name
, TYPE_NAME (type
));
441 /* The length of the prefix of NAME prior to any "___" suffix. */
444 ada_name_prefix_len (const char *name
)
450 const char *p
= strstr (name
, "___");
452 return strlen (name
);
458 /* Return non-zero if SUFFIX is a suffix of STR.
459 Return zero if STR is null. */
462 is_suffix (const char *str
, const char *suffix
)
468 len2
= strlen (suffix
);
469 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
472 /* Create a value of type TYPE whose contents come from VALADDR, if it
473 is non-null, and whose memory address (in the inferior) is
477 value_from_contents_and_address (struct type
*type
,
478 const gdb_byte
*valaddr
,
481 struct value
*v
= allocate_value (type
);
483 set_value_lazy (v
, 1);
485 memcpy (value_contents_raw (v
), valaddr
, TYPE_LENGTH (type
));
486 VALUE_ADDRESS (v
) = address
;
488 VALUE_LVAL (v
) = lval_memory
;
492 /* The contents of value VAL, treated as a value of type TYPE. The
493 result is an lval in memory if VAL is. */
495 static struct value
*
496 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
498 type
= ada_check_typedef (type
);
499 if (value_type (val
) == type
)
503 struct value
*result
;
505 /* Make sure that the object size is not unreasonable before
506 trying to allocate some memory for it. */
509 result
= allocate_value (type
);
510 VALUE_LVAL (result
) = VALUE_LVAL (val
);
511 set_value_bitsize (result
, value_bitsize (val
));
512 set_value_bitpos (result
, value_bitpos (val
));
513 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + value_offset (val
);
515 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
516 set_value_lazy (result
, 1);
518 memcpy (value_contents_raw (result
), value_contents (val
),
524 static const gdb_byte
*
525 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
530 return valaddr
+ offset
;
534 cond_offset_target (CORE_ADDR address
, long offset
)
539 return address
+ offset
;
542 /* Issue a warning (as for the definition of warning in utils.c, but
543 with exactly one argument rather than ...), unless the limit on the
544 number of warnings has passed during the evaluation of the current
547 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
548 provided by "complaint". */
549 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
552 lim_warning (const char *format
, ...)
555 va_start (args
, format
);
557 warnings_issued
+= 1;
558 if (warnings_issued
<= warning_limit
)
559 vwarning (format
, args
);
564 /* Issue an error if the size of an object of type T is unreasonable,
565 i.e. if it would be a bad idea to allocate a value of this type in
569 check_size (const struct type
*type
)
571 if (TYPE_LENGTH (type
) > varsize_limit
)
572 error (_("object size is larger than varsize-limit"));
576 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
577 gdbtypes.h, but some of the necessary definitions in that file
578 seem to have gone missing. */
580 /* Maximum value of a SIZE-byte signed integer type. */
582 max_of_size (int size
)
584 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
585 return top_bit
| (top_bit
- 1);
588 /* Minimum value of a SIZE-byte signed integer type. */
590 min_of_size (int size
)
592 return -max_of_size (size
) - 1;
595 /* Maximum value of a SIZE-byte unsigned integer type. */
597 umax_of_size (int size
)
599 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
600 return top_bit
| (top_bit
- 1);
603 /* Maximum value of integral type T, as a signed quantity. */
605 max_of_type (struct type
*t
)
607 if (TYPE_UNSIGNED (t
))
608 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
610 return max_of_size (TYPE_LENGTH (t
));
613 /* Minimum value of integral type T, as a signed quantity. */
615 min_of_type (struct type
*t
)
617 if (TYPE_UNSIGNED (t
))
620 return min_of_size (TYPE_LENGTH (t
));
623 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
624 static struct value
*
625 discrete_type_high_bound (struct type
*type
)
627 switch (TYPE_CODE (type
))
629 case TYPE_CODE_RANGE
:
630 return value_from_longest (TYPE_TARGET_TYPE (type
),
631 TYPE_HIGH_BOUND (type
));
634 value_from_longest (type
,
635 TYPE_FIELD_BITPOS (type
,
636 TYPE_NFIELDS (type
) - 1));
638 return value_from_longest (type
, max_of_type (type
));
640 error (_("Unexpected type in discrete_type_high_bound."));
644 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
645 static struct value
*
646 discrete_type_low_bound (struct type
*type
)
648 switch (TYPE_CODE (type
))
650 case TYPE_CODE_RANGE
:
651 return value_from_longest (TYPE_TARGET_TYPE (type
),
652 TYPE_LOW_BOUND (type
));
654 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, 0));
656 return value_from_longest (type
, min_of_type (type
));
658 error (_("Unexpected type in discrete_type_low_bound."));
662 /* The identity on non-range types. For range types, the underlying
663 non-range scalar type. */
666 base_type (struct type
*type
)
668 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
670 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
672 type
= TYPE_TARGET_TYPE (type
);
678 /* Language Selection */
680 /* If the main program is in Ada, return language_ada, otherwise return LANG
681 (the main program is in Ada iif the adainit symbol is found).
683 MAIN_PST is not used. */
686 ada_update_initial_language (enum language lang
,
687 struct partial_symtab
*main_pst
)
689 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
690 (struct objfile
*) NULL
) != NULL
)
696 /* If the main procedure is written in Ada, then return its name.
697 The result is good until the next call. Return NULL if the main
698 procedure doesn't appear to be in Ada. */
703 struct minimal_symbol
*msym
;
704 CORE_ADDR main_program_name_addr
;
705 static char main_program_name
[1024];
707 /* For Ada, the name of the main procedure is stored in a specific
708 string constant, generated by the binder. Look for that symbol,
709 extract its address, and then read that string. If we didn't find
710 that string, then most probably the main procedure is not written
712 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
716 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
717 if (main_program_name_addr
== 0)
718 error (_("Invalid address for Ada main program name."));
720 extract_string (main_program_name_addr
, main_program_name
);
721 return main_program_name
;
724 /* The main procedure doesn't seem to be in Ada. */
730 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
733 const struct ada_opname_map ada_opname_table
[] = {
734 {"Oadd", "\"+\"", BINOP_ADD
},
735 {"Osubtract", "\"-\"", BINOP_SUB
},
736 {"Omultiply", "\"*\"", BINOP_MUL
},
737 {"Odivide", "\"/\"", BINOP_DIV
},
738 {"Omod", "\"mod\"", BINOP_MOD
},
739 {"Orem", "\"rem\"", BINOP_REM
},
740 {"Oexpon", "\"**\"", BINOP_EXP
},
741 {"Olt", "\"<\"", BINOP_LESS
},
742 {"Ole", "\"<=\"", BINOP_LEQ
},
743 {"Ogt", "\">\"", BINOP_GTR
},
744 {"Oge", "\">=\"", BINOP_GEQ
},
745 {"Oeq", "\"=\"", BINOP_EQUAL
},
746 {"One", "\"/=\"", BINOP_NOTEQUAL
},
747 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
748 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
749 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
750 {"Oconcat", "\"&\"", BINOP_CONCAT
},
751 {"Oabs", "\"abs\"", UNOP_ABS
},
752 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
753 {"Oadd", "\"+\"", UNOP_PLUS
},
754 {"Osubtract", "\"-\"", UNOP_NEG
},
758 /* Return non-zero if STR should be suppressed in info listings. */
761 is_suppressed_name (const char *str
)
763 if (strncmp (str
, "_ada_", 5) == 0)
765 if (str
[0] == '_' || str
[0] == '\000')
770 const char *suffix
= strstr (str
, "___");
771 if (suffix
!= NULL
&& suffix
[3] != 'X')
774 suffix
= str
+ strlen (str
);
775 for (p
= suffix
- 1; p
!= str
; p
-= 1)
779 if (p
[0] == 'X' && p
[-1] != '_')
783 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
784 if (strncmp (ada_opname_table
[i
].encoded
, p
,
785 strlen (ada_opname_table
[i
].encoded
)) == 0)
794 /* The "encoded" form of DECODED, according to GNAT conventions.
795 The result is valid until the next call to ada_encode. */
798 ada_encode (const char *decoded
)
800 static char *encoding_buffer
= NULL
;
801 static size_t encoding_buffer_size
= 0;
808 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
809 2 * strlen (decoded
) + 10);
812 for (p
= decoded
; *p
!= '\0'; p
+= 1)
814 if (!ADA_RETAIN_DOTS
&& *p
== '.')
816 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
821 const struct ada_opname_map
*mapping
;
823 for (mapping
= ada_opname_table
;
824 mapping
->encoded
!= NULL
825 && strncmp (mapping
->decoded
, p
,
826 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
828 if (mapping
->encoded
== NULL
)
829 error (_("invalid Ada operator name: %s"), p
);
830 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
831 k
+= strlen (mapping
->encoded
);
836 encoding_buffer
[k
] = *p
;
841 encoding_buffer
[k
] = '\0';
842 return encoding_buffer
;
845 /* Return NAME folded to lower case, or, if surrounded by single
846 quotes, unfolded, but with the quotes stripped away. Result good
850 ada_fold_name (const char *name
)
852 static char *fold_buffer
= NULL
;
853 static size_t fold_buffer_size
= 0;
855 int len
= strlen (name
);
856 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
860 strncpy (fold_buffer
, name
+ 1, len
- 2);
861 fold_buffer
[len
- 2] = '\000';
866 for (i
= 0; i
<= len
; i
+= 1)
867 fold_buffer
[i
] = tolower (name
[i
]);
873 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
876 is_lower_alphanum (const char c
)
878 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
881 /* Remove either of these suffixes:
886 These are suffixes introduced by the compiler for entities such as
887 nested subprogram for instance, in order to avoid name clashes.
888 They do not serve any purpose for the debugger. */
891 ada_remove_trailing_digits (const char *encoded
, int *len
)
893 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
896 while (i
> 0 && isdigit (encoded
[i
]))
898 if (i
>= 0 && encoded
[i
] == '.')
900 else if (i
>= 0 && encoded
[i
] == '$')
902 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
904 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
909 /* Remove the suffix introduced by the compiler for protected object
913 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
915 /* Remove trailing N. */
917 /* Protected entry subprograms are broken into two
918 separate subprograms: The first one is unprotected, and has
919 a 'N' suffix; the second is the protected version, and has
920 the 'P' suffix. The second calls the first one after handling
921 the protection. Since the P subprograms are internally generated,
922 we leave these names undecoded, giving the user a clue that this
923 entity is internal. */
926 && encoded
[*len
- 1] == 'N'
927 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
931 /* If ENCODED follows the GNAT entity encoding conventions, then return
932 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
935 The resulting string is valid until the next call of ada_decode.
936 If the string is unchanged by decoding, the original string pointer
940 ada_decode (const char *encoded
)
947 static char *decoding_buffer
= NULL
;
948 static size_t decoding_buffer_size
= 0;
950 /* The name of the Ada main procedure starts with "_ada_".
951 This prefix is not part of the decoded name, so skip this part
952 if we see this prefix. */
953 if (strncmp (encoded
, "_ada_", 5) == 0)
956 /* If the name starts with '_', then it is not a properly encoded
957 name, so do not attempt to decode it. Similarly, if the name
958 starts with '<', the name should not be decoded. */
959 if (encoded
[0] == '_' || encoded
[0] == '<')
962 len0
= strlen (encoded
);
964 ada_remove_trailing_digits (encoded
, &len0
);
965 ada_remove_po_subprogram_suffix (encoded
, &len0
);
967 /* Remove the ___X.* suffix if present. Do not forget to verify that
968 the suffix is located before the current "end" of ENCODED. We want
969 to avoid re-matching parts of ENCODED that have previously been
970 marked as discarded (by decrementing LEN0). */
971 p
= strstr (encoded
, "___");
972 if (p
!= NULL
&& p
- encoded
< len0
- 3)
980 /* Remove any trailing TKB suffix. It tells us that this symbol
981 is for the body of a task, but that information does not actually
982 appear in the decoded name. */
984 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
987 /* Remove trailing "B" suffixes. */
988 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
990 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
993 /* Make decoded big enough for possible expansion by operator name. */
995 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
996 decoded
= decoding_buffer
;
998 /* Remove trailing __{digit}+ or trailing ${digit}+. */
1000 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
1003 while ((i
>= 0 && isdigit (encoded
[i
]))
1004 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
1006 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
1008 else if (encoded
[i
] == '$')
1012 /* The first few characters that are not alphabetic are not part
1013 of any encoding we use, so we can copy them over verbatim. */
1015 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
1016 decoded
[j
] = encoded
[i
];
1021 /* Is this a symbol function? */
1022 if (at_start_name
&& encoded
[i
] == 'O')
1025 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1027 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1028 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1030 && !isalnum (encoded
[i
+ op_len
]))
1032 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1035 j
+= strlen (ada_opname_table
[k
].decoded
);
1039 if (ada_opname_table
[k
].encoded
!= NULL
)
1044 /* Replace "TK__" with "__", which will eventually be translated
1045 into "." (just below). */
1047 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1050 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1051 be translated into "." (just below). These are internal names
1052 generated for anonymous blocks inside which our symbol is nested. */
1054 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1055 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1056 && isdigit (encoded
[i
+4]))
1060 while (k
< len0
&& isdigit (encoded
[k
]))
1061 k
++; /* Skip any extra digit. */
1063 /* Double-check that the "__B_{DIGITS}+" sequence we found
1064 is indeed followed by "__". */
1065 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1069 /* Remove _E{DIGITS}+[sb] */
1071 /* Just as for protected object subprograms, there are 2 categories
1072 of subprograms created by the compiler for each entry. The first
1073 one implements the actual entry code, and has a suffix following
1074 the convention above; the second one implements the barrier and
1075 uses the same convention as above, except that the 'E' is replaced
1078 Just as above, we do not decode the name of barrier functions
1079 to give the user a clue that the code he is debugging has been
1080 internally generated. */
1082 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1083 && isdigit (encoded
[i
+2]))
1087 while (k
< len0
&& isdigit (encoded
[k
]))
1091 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1094 /* Just as an extra precaution, make sure that if this
1095 suffix is followed by anything else, it is a '_'.
1096 Otherwise, we matched this sequence by accident. */
1098 || (k
< len0
&& encoded
[k
] == '_'))
1103 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1104 the GNAT front-end in protected object subprograms. */
1107 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1109 /* Backtrack a bit up until we reach either the begining of
1110 the encoded name, or "__". Make sure that we only find
1111 digits or lowercase characters. */
1112 const char *ptr
= encoded
+ i
- 1;
1114 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1117 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1121 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1123 /* This is a X[bn]* sequence not separated from the previous
1124 part of the name with a non-alpha-numeric character (in other
1125 words, immediately following an alpha-numeric character), then
1126 verify that it is placed at the end of the encoded name. If
1127 not, then the encoding is not valid and we should abort the
1128 decoding. Otherwise, just skip it, it is used in body-nested
1132 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1136 else if (!ADA_RETAIN_DOTS
1137 && i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1139 /* Replace '__' by '.'. */
1147 /* It's a character part of the decoded name, so just copy it
1149 decoded
[j
] = encoded
[i
];
1154 decoded
[j
] = '\000';
1156 /* Decoded names should never contain any uppercase character.
1157 Double-check this, and abort the decoding if we find one. */
1159 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1160 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1163 if (strcmp (decoded
, encoded
) == 0)
1169 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1170 decoded
= decoding_buffer
;
1171 if (encoded
[0] == '<')
1172 strcpy (decoded
, encoded
);
1174 sprintf (decoded
, "<%s>", encoded
);
1179 /* Table for keeping permanent unique copies of decoded names. Once
1180 allocated, names in this table are never released. While this is a
1181 storage leak, it should not be significant unless there are massive
1182 changes in the set of decoded names in successive versions of a
1183 symbol table loaded during a single session. */
1184 static struct htab
*decoded_names_store
;
1186 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1187 in the language-specific part of GSYMBOL, if it has not been
1188 previously computed. Tries to save the decoded name in the same
1189 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1190 in any case, the decoded symbol has a lifetime at least that of
1192 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1193 const, but nevertheless modified to a semantically equivalent form
1194 when a decoded name is cached in it.
1198 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1201 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1202 if (*resultp
== NULL
)
1204 const char *decoded
= ada_decode (gsymbol
->name
);
1205 if (gsymbol
->bfd_section
!= NULL
)
1207 bfd
*obfd
= gsymbol
->bfd_section
->owner
;
1210 struct objfile
*objf
;
1213 if (obfd
== objf
->obfd
)
1215 *resultp
= obsavestring (decoded
, strlen (decoded
),
1216 &objf
->objfile_obstack
);
1222 /* Sometimes, we can't find a corresponding objfile, in which
1223 case, we put the result on the heap. Since we only decode
1224 when needed, we hope this usually does not cause a
1225 significant memory leak (FIXME). */
1226 if (*resultp
== NULL
)
1228 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1231 *slot
= xstrdup (decoded
);
1240 ada_la_decode (const char *encoded
, int options
)
1242 return xstrdup (ada_decode (encoded
));
1245 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1246 suffixes that encode debugging information or leading _ada_ on
1247 SYM_NAME (see is_name_suffix commentary for the debugging
1248 information that is ignored). If WILD, then NAME need only match a
1249 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1250 either argument is NULL. */
1253 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1255 if (sym_name
== NULL
|| name
== NULL
)
1258 return wild_match (name
, strlen (name
), sym_name
);
1261 int len_name
= strlen (name
);
1262 return (strncmp (sym_name
, name
, len_name
) == 0
1263 && is_name_suffix (sym_name
+ len_name
))
1264 || (strncmp (sym_name
, "_ada_", 5) == 0
1265 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1266 && is_name_suffix (sym_name
+ len_name
+ 5));
1270 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1271 suppressed in info listings. */
1274 ada_suppress_symbol_printing (struct symbol
*sym
)
1276 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1279 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1285 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1287 static char *bound_name
[] = {
1288 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1289 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1292 /* Maximum number of array dimensions we are prepared to handle. */
1294 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1296 /* Like modify_field, but allows bitpos > wordlength. */
1299 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1301 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1305 /* The desc_* routines return primitive portions of array descriptors
1308 /* The descriptor or array type, if any, indicated by TYPE; removes
1309 level of indirection, if needed. */
1311 static struct type
*
1312 desc_base_type (struct type
*type
)
1316 type
= ada_check_typedef (type
);
1318 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1319 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1320 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1325 /* True iff TYPE indicates a "thin" array pointer type. */
1328 is_thin_pntr (struct type
*type
)
1331 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1332 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1335 /* The descriptor type for thin pointer type TYPE. */
1337 static struct type
*
1338 thin_descriptor_type (struct type
*type
)
1340 struct type
*base_type
= desc_base_type (type
);
1341 if (base_type
== NULL
)
1343 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1347 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1348 if (alt_type
== NULL
)
1355 /* A pointer to the array data for thin-pointer value VAL. */
1357 static struct value
*
1358 thin_data_pntr (struct value
*val
)
1360 struct type
*type
= value_type (val
);
1361 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1362 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1365 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1366 VALUE_ADDRESS (val
) + value_offset (val
));
1369 /* True iff TYPE indicates a "thick" array pointer type. */
1372 is_thick_pntr (struct type
*type
)
1374 type
= desc_base_type (type
);
1375 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1376 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1379 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1380 pointer to one, the type of its bounds data; otherwise, NULL. */
1382 static struct type
*
1383 desc_bounds_type (struct type
*type
)
1387 type
= desc_base_type (type
);
1391 else if (is_thin_pntr (type
))
1393 type
= thin_descriptor_type (type
);
1396 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1398 return ada_check_typedef (r
);
1400 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1402 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1404 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1409 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1410 one, a pointer to its bounds data. Otherwise NULL. */
1412 static struct value
*
1413 desc_bounds (struct value
*arr
)
1415 struct type
*type
= ada_check_typedef (value_type (arr
));
1416 if (is_thin_pntr (type
))
1418 struct type
*bounds_type
=
1419 desc_bounds_type (thin_descriptor_type (type
));
1422 if (bounds_type
== NULL
)
1423 error (_("Bad GNAT array descriptor"));
1425 /* NOTE: The following calculation is not really kosher, but
1426 since desc_type is an XVE-encoded type (and shouldn't be),
1427 the correct calculation is a real pain. FIXME (and fix GCC). */
1428 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1429 addr
= value_as_long (arr
);
1431 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1434 value_from_longest (lookup_pointer_type (bounds_type
),
1435 addr
- TYPE_LENGTH (bounds_type
));
1438 else if (is_thick_pntr (type
))
1439 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1440 _("Bad GNAT array descriptor"));
1445 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1446 position of the field containing the address of the bounds data. */
1449 fat_pntr_bounds_bitpos (struct type
*type
)
1451 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1454 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1455 size of the field containing the address of the bounds data. */
1458 fat_pntr_bounds_bitsize (struct type
*type
)
1460 type
= desc_base_type (type
);
1462 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1463 return TYPE_FIELD_BITSIZE (type
, 1);
1465 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1468 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1469 pointer to one, the type of its array data (a
1470 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1471 ada_type_of_array to get an array type with bounds data. */
1473 static struct type
*
1474 desc_data_type (struct type
*type
)
1476 type
= desc_base_type (type
);
1478 /* NOTE: The following is bogus; see comment in desc_bounds. */
1479 if (is_thin_pntr (type
))
1480 return lookup_pointer_type
1481 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1482 else if (is_thick_pntr (type
))
1483 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1488 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1491 static struct value
*
1492 desc_data (struct value
*arr
)
1494 struct type
*type
= value_type (arr
);
1495 if (is_thin_pntr (type
))
1496 return thin_data_pntr (arr
);
1497 else if (is_thick_pntr (type
))
1498 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1499 _("Bad GNAT array descriptor"));
1505 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1506 position of the field containing the address of the data. */
1509 fat_pntr_data_bitpos (struct type
*type
)
1511 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1514 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1515 size of the field containing the address of the data. */
1518 fat_pntr_data_bitsize (struct type
*type
)
1520 type
= desc_base_type (type
);
1522 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1523 return TYPE_FIELD_BITSIZE (type
, 0);
1525 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1528 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1529 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1530 bound, if WHICH is 1. The first bound is I=1. */
1532 static struct value
*
1533 desc_one_bound (struct value
*bounds
, int i
, int which
)
1535 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1536 _("Bad GNAT array descriptor bounds"));
1539 /* If BOUNDS is an array-bounds structure type, return the bit position
1540 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1541 bound, if WHICH is 1. The first bound is I=1. */
1544 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1546 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1549 /* If BOUNDS is an array-bounds structure type, return the bit field size
1550 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1551 bound, if WHICH is 1. The first bound is I=1. */
1554 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1556 type
= desc_base_type (type
);
1558 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1559 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1561 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1564 /* If TYPE is the type of an array-bounds structure, the type of its
1565 Ith bound (numbering from 1). Otherwise, NULL. */
1567 static struct type
*
1568 desc_index_type (struct type
*type
, int i
)
1570 type
= desc_base_type (type
);
1572 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1573 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1578 /* The number of index positions in the array-bounds type TYPE.
1579 Return 0 if TYPE is NULL. */
1582 desc_arity (struct type
*type
)
1584 type
= desc_base_type (type
);
1587 return TYPE_NFIELDS (type
) / 2;
1591 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1592 an array descriptor type (representing an unconstrained array
1596 ada_is_direct_array_type (struct type
*type
)
1600 type
= ada_check_typedef (type
);
1601 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1602 || ada_is_array_descriptor_type (type
));
1605 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1609 ada_is_array_type (struct type
*type
)
1612 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1613 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1614 type
= TYPE_TARGET_TYPE (type
);
1615 return ada_is_direct_array_type (type
);
1618 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1621 ada_is_simple_array_type (struct type
*type
)
1625 type
= ada_check_typedef (type
);
1626 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1627 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1628 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1631 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1634 ada_is_array_descriptor_type (struct type
*type
)
1636 struct type
*data_type
= desc_data_type (type
);
1640 type
= ada_check_typedef (type
);
1643 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1644 && TYPE_TARGET_TYPE (data_type
) != NULL
1645 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1646 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1647 && desc_arity (desc_bounds_type (type
)) > 0;
1650 /* Non-zero iff type is a partially mal-formed GNAT array
1651 descriptor. FIXME: This is to compensate for some problems with
1652 debugging output from GNAT. Re-examine periodically to see if it
1656 ada_is_bogus_array_descriptor (struct type
*type
)
1660 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1661 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1662 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1663 && !ada_is_array_descriptor_type (type
);
1667 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1668 (fat pointer) returns the type of the array data described---specifically,
1669 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1670 in from the descriptor; otherwise, they are left unspecified. If
1671 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1672 returns NULL. The result is simply the type of ARR if ARR is not
1675 ada_type_of_array (struct value
*arr
, int bounds
)
1677 if (ada_is_packed_array_type (value_type (arr
)))
1678 return decode_packed_array_type (value_type (arr
));
1680 if (!ada_is_array_descriptor_type (value_type (arr
)))
1681 return value_type (arr
);
1685 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1688 struct type
*elt_type
;
1690 struct value
*descriptor
;
1691 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1693 elt_type
= ada_array_element_type (value_type (arr
), -1);
1694 arity
= ada_array_arity (value_type (arr
));
1696 if (elt_type
== NULL
|| arity
== 0)
1697 return ada_check_typedef (value_type (arr
));
1699 descriptor
= desc_bounds (arr
);
1700 if (value_as_long (descriptor
) == 0)
1704 struct type
*range_type
= alloc_type (objf
);
1705 struct type
*array_type
= alloc_type (objf
);
1706 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1707 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1710 create_range_type (range_type
, value_type (low
),
1711 longest_to_int (value_as_long (low
)),
1712 longest_to_int (value_as_long (high
)));
1713 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1716 return lookup_pointer_type (elt_type
);
1720 /* If ARR does not represent an array, returns ARR unchanged.
1721 Otherwise, returns either a standard GDB array with bounds set
1722 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1723 GDB array. Returns NULL if ARR is a null fat pointer. */
1726 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1728 if (ada_is_array_descriptor_type (value_type (arr
)))
1730 struct type
*arrType
= ada_type_of_array (arr
, 1);
1731 if (arrType
== NULL
)
1733 return value_cast (arrType
, value_copy (desc_data (arr
)));
1735 else if (ada_is_packed_array_type (value_type (arr
)))
1736 return decode_packed_array (arr
);
1741 /* If ARR does not represent an array, returns ARR unchanged.
1742 Otherwise, returns a standard GDB array describing ARR (which may
1743 be ARR itself if it already is in the proper form). */
1745 static struct value
*
1746 ada_coerce_to_simple_array (struct value
*arr
)
1748 if (ada_is_array_descriptor_type (value_type (arr
)))
1750 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1752 error (_("Bounds unavailable for null array pointer."));
1753 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1754 return value_ind (arrVal
);
1756 else if (ada_is_packed_array_type (value_type (arr
)))
1757 return decode_packed_array (arr
);
1762 /* If TYPE represents a GNAT array type, return it translated to an
1763 ordinary GDB array type (possibly with BITSIZE fields indicating
1764 packing). For other types, is the identity. */
1767 ada_coerce_to_simple_array_type (struct type
*type
)
1769 struct value
*mark
= value_mark ();
1770 struct value
*dummy
= value_from_longest (builtin_type_long
, 0);
1771 struct type
*result
;
1772 deprecated_set_value_type (dummy
, type
);
1773 result
= ada_type_of_array (dummy
, 0);
1774 value_free_to_mark (mark
);
1778 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1781 ada_is_packed_array_type (struct type
*type
)
1785 type
= desc_base_type (type
);
1786 type
= ada_check_typedef (type
);
1788 ada_type_name (type
) != NULL
1789 && strstr (ada_type_name (type
), "___XP") != NULL
;
1792 /* Given that TYPE is a standard GDB array type with all bounds filled
1793 in, and that the element size of its ultimate scalar constituents
1794 (that is, either its elements, or, if it is an array of arrays, its
1795 elements' elements, etc.) is *ELT_BITS, return an identical type,
1796 but with the bit sizes of its elements (and those of any
1797 constituent arrays) recorded in the BITSIZE components of its
1798 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1801 static struct type
*
1802 packed_array_type (struct type
*type
, long *elt_bits
)
1804 struct type
*new_elt_type
;
1805 struct type
*new_type
;
1806 LONGEST low_bound
, high_bound
;
1808 type
= ada_check_typedef (type
);
1809 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1812 new_type
= alloc_type (TYPE_OBJFILE (type
));
1813 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1815 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1816 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1817 TYPE_NAME (new_type
) = ada_type_name (type
);
1819 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1820 &low_bound
, &high_bound
) < 0)
1821 low_bound
= high_bound
= 0;
1822 if (high_bound
< low_bound
)
1823 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1826 *elt_bits
*= (high_bound
- low_bound
+ 1);
1827 TYPE_LENGTH (new_type
) =
1828 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1831 TYPE_FLAGS (new_type
) |= TYPE_FLAG_FIXED_INSTANCE
;
1835 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1837 static struct type
*
1838 decode_packed_array_type (struct type
*type
)
1841 struct block
**blocks
;
1842 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1845 struct type
*shadow_type
;
1850 raw_name
= ada_type_name (desc_base_type (type
));
1855 name
= (char *) alloca (strlen (raw_name
) + 1);
1856 tail
= strstr (raw_name
, "___XP");
1857 type
= desc_base_type (type
);
1859 memcpy (name
, raw_name
, tail
- raw_name
);
1860 name
[tail
- raw_name
] = '\000';
1862 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1863 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1865 lim_warning (_("could not find bounds information on packed array"));
1868 shadow_type
= SYMBOL_TYPE (sym
);
1870 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1872 lim_warning (_("could not understand bounds information on packed array"));
1876 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1879 (_("could not understand bit size information on packed array"));
1883 return packed_array_type (shadow_type
, &bits
);
1886 /* Given that ARR is a struct value *indicating a GNAT packed array,
1887 returns a simple array that denotes that array. Its type is a
1888 standard GDB array type except that the BITSIZEs of the array
1889 target types are set to the number of bits in each element, and the
1890 type length is set appropriately. */
1892 static struct value
*
1893 decode_packed_array (struct value
*arr
)
1897 arr
= ada_coerce_ref (arr
);
1898 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1899 arr
= ada_value_ind (arr
);
1901 type
= decode_packed_array_type (value_type (arr
));
1904 error (_("can't unpack array"));
1908 if (gdbarch_bits_big_endian (current_gdbarch
)
1909 && ada_is_modular_type (value_type (arr
)))
1911 /* This is a (right-justified) modular type representing a packed
1912 array with no wrapper. In order to interpret the value through
1913 the (left-justified) packed array type we just built, we must
1914 first left-justify it. */
1915 int bit_size
, bit_pos
;
1918 mod
= ada_modulus (value_type (arr
)) - 1;
1925 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1926 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1927 bit_pos
/ HOST_CHAR_BIT
,
1928 bit_pos
% HOST_CHAR_BIT
,
1933 return coerce_unspec_val_to_type (arr
, type
);
1937 /* The value of the element of packed array ARR at the ARITY indices
1938 given in IND. ARR must be a simple array. */
1940 static struct value
*
1941 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1944 int bits
, elt_off
, bit_off
;
1945 long elt_total_bit_offset
;
1946 struct type
*elt_type
;
1950 elt_total_bit_offset
= 0;
1951 elt_type
= ada_check_typedef (value_type (arr
));
1952 for (i
= 0; i
< arity
; i
+= 1)
1954 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1955 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1957 (_("attempt to do packed indexing of something other than a packed array"));
1960 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1961 LONGEST lowerbound
, upperbound
;
1964 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1966 lim_warning (_("don't know bounds of array"));
1967 lowerbound
= upperbound
= 0;
1970 idx
= value_as_long (value_pos_atr (ind
[i
]));
1971 if (idx
< lowerbound
|| idx
> upperbound
)
1972 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1973 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1974 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1975 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1978 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1979 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1981 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1986 /* Non-zero iff TYPE includes negative integer values. */
1989 has_negatives (struct type
*type
)
1991 switch (TYPE_CODE (type
))
1996 return !TYPE_UNSIGNED (type
);
1997 case TYPE_CODE_RANGE
:
1998 return TYPE_LOW_BOUND (type
) < 0;
2003 /* Create a new value of type TYPE from the contents of OBJ starting
2004 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
2005 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
2006 assigning through the result will set the field fetched from.
2007 VALADDR is ignored unless OBJ is NULL, in which case,
2008 VALADDR+OFFSET must address the start of storage containing the
2009 packed value. The value returned in this case is never an lval.
2010 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
2013 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
2014 long offset
, int bit_offset
, int bit_size
,
2018 int src
, /* Index into the source area */
2019 targ
, /* Index into the target area */
2020 srcBitsLeft
, /* Number of source bits left to move */
2021 nsrc
, ntarg
, /* Number of source and target bytes */
2022 unusedLS
, /* Number of bits in next significant
2023 byte of source that are unused */
2024 accumSize
; /* Number of meaningful bits in accum */
2025 unsigned char *bytes
; /* First byte containing data to unpack */
2026 unsigned char *unpacked
;
2027 unsigned long accum
; /* Staging area for bits being transferred */
2029 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
2030 /* Transmit bytes from least to most significant; delta is the direction
2031 the indices move. */
2032 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
2034 type
= ada_check_typedef (type
);
2038 v
= allocate_value (type
);
2039 bytes
= (unsigned char *) (valaddr
+ offset
);
2041 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2044 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
2045 bytes
= (unsigned char *) alloca (len
);
2046 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
2050 v
= allocate_value (type
);
2051 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2056 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
2057 if (VALUE_LVAL (obj
) == lval_internalvar
)
2058 VALUE_LVAL (v
) = lval_internalvar_component
;
2059 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
2060 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2061 set_value_bitsize (v
, bit_size
);
2062 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2064 VALUE_ADDRESS (v
) += 1;
2065 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2069 set_value_bitsize (v
, bit_size
);
2070 unpacked
= (unsigned char *) value_contents (v
);
2072 srcBitsLeft
= bit_size
;
2074 ntarg
= TYPE_LENGTH (type
);
2078 memset (unpacked
, 0, TYPE_LENGTH (type
));
2081 else if (gdbarch_bits_big_endian (current_gdbarch
))
2084 if (has_negatives (type
)
2085 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2089 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2092 switch (TYPE_CODE (type
))
2094 case TYPE_CODE_ARRAY
:
2095 case TYPE_CODE_UNION
:
2096 case TYPE_CODE_STRUCT
:
2097 /* Non-scalar values must be aligned at a byte boundary... */
2099 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2100 /* ... And are placed at the beginning (most-significant) bytes
2102 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2106 targ
= TYPE_LENGTH (type
) - 1;
2112 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2115 unusedLS
= bit_offset
;
2118 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2125 /* Mask for removing bits of the next source byte that are not
2126 part of the value. */
2127 unsigned int unusedMSMask
=
2128 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2130 /* Sign-extend bits for this byte. */
2131 unsigned int signMask
= sign
& ~unusedMSMask
;
2133 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2134 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2135 if (accumSize
>= HOST_CHAR_BIT
)
2137 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2138 accumSize
-= HOST_CHAR_BIT
;
2139 accum
>>= HOST_CHAR_BIT
;
2143 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2150 accum
|= sign
<< accumSize
;
2151 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2152 accumSize
-= HOST_CHAR_BIT
;
2153 accum
>>= HOST_CHAR_BIT
;
2161 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2162 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2165 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2166 int src_offset
, int n
)
2168 unsigned int accum
, mask
;
2169 int accum_bits
, chunk_size
;
2171 target
+= targ_offset
/ HOST_CHAR_BIT
;
2172 targ_offset
%= HOST_CHAR_BIT
;
2173 source
+= src_offset
/ HOST_CHAR_BIT
;
2174 src_offset
%= HOST_CHAR_BIT
;
2175 if (gdbarch_bits_big_endian (current_gdbarch
))
2177 accum
= (unsigned char) *source
;
2179 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2184 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2185 accum_bits
+= HOST_CHAR_BIT
;
2187 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2190 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2191 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2194 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2196 accum_bits
-= chunk_size
;
2203 accum
= (unsigned char) *source
>> src_offset
;
2205 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2209 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2210 accum_bits
+= HOST_CHAR_BIT
;
2212 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2215 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2216 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2218 accum_bits
-= chunk_size
;
2219 accum
>>= chunk_size
;
2226 /* Store the contents of FROMVAL into the location of TOVAL.
2227 Return a new value with the location of TOVAL and contents of
2228 FROMVAL. Handles assignment into packed fields that have
2229 floating-point or non-scalar types. */
2231 static struct value
*
2232 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2234 struct type
*type
= value_type (toval
);
2235 int bits
= value_bitsize (toval
);
2237 toval
= ada_coerce_ref (toval
);
2238 fromval
= ada_coerce_ref (fromval
);
2240 if (ada_is_direct_array_type (value_type (toval
)))
2241 toval
= ada_coerce_to_simple_array (toval
);
2242 if (ada_is_direct_array_type (value_type (fromval
)))
2243 fromval
= ada_coerce_to_simple_array (fromval
);
2245 if (!deprecated_value_modifiable (toval
))
2246 error (_("Left operand of assignment is not a modifiable lvalue."));
2248 if (VALUE_LVAL (toval
) == lval_memory
2250 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2251 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2253 int len
= (value_bitpos (toval
)
2254 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2255 char *buffer
= (char *) alloca (len
);
2257 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2259 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2260 fromval
= value_cast (type
, fromval
);
2262 read_memory (to_addr
, buffer
, len
);
2263 if (gdbarch_bits_big_endian (current_gdbarch
))
2264 move_bits (buffer
, value_bitpos (toval
),
2265 value_contents (fromval
),
2266 TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
-
2269 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2271 write_memory (to_addr
, buffer
, len
);
2272 if (deprecated_memory_changed_hook
)
2273 deprecated_memory_changed_hook (to_addr
, len
);
2275 val
= value_copy (toval
);
2276 memcpy (value_contents_raw (val
), value_contents (fromval
),
2277 TYPE_LENGTH (type
));
2278 deprecated_set_value_type (val
, type
);
2283 return value_assign (toval
, fromval
);
2287 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2288 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2289 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2290 * COMPONENT, and not the inferior's memory. The current contents
2291 * of COMPONENT are ignored. */
2293 value_assign_to_component (struct value
*container
, struct value
*component
,
2296 LONGEST offset_in_container
=
2297 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2298 - VALUE_ADDRESS (container
) - value_offset (container
));
2299 int bit_offset_in_container
=
2300 value_bitpos (component
) - value_bitpos (container
);
2303 val
= value_cast (value_type (component
), val
);
2305 if (value_bitsize (component
) == 0)
2306 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2308 bits
= value_bitsize (component
);
2310 if (gdbarch_bits_big_endian (current_gdbarch
))
2311 move_bits (value_contents_writeable (container
) + offset_in_container
,
2312 value_bitpos (container
) + bit_offset_in_container
,
2313 value_contents (val
),
2314 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2317 move_bits (value_contents_writeable (container
) + offset_in_container
,
2318 value_bitpos (container
) + bit_offset_in_container
,
2319 value_contents (val
), 0, bits
);
2322 /* The value of the element of array ARR at the ARITY indices given in IND.
2323 ARR may be either a simple array, GNAT array descriptor, or pointer
2327 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2331 struct type
*elt_type
;
2333 elt
= ada_coerce_to_simple_array (arr
);
2335 elt_type
= ada_check_typedef (value_type (elt
));
2336 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2337 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2338 return value_subscript_packed (elt
, arity
, ind
);
2340 for (k
= 0; k
< arity
; k
+= 1)
2342 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2343 error (_("too many subscripts (%d expected)"), k
);
2344 elt
= value_subscript (elt
, value_pos_atr (ind
[k
]));
2349 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2350 value of the element of *ARR at the ARITY indices given in
2351 IND. Does not read the entire array into memory. */
2354 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2359 for (k
= 0; k
< arity
; k
+= 1)
2364 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2365 error (_("too many subscripts (%d expected)"), k
);
2366 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2368 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2369 idx
= value_pos_atr (ind
[k
]);
2371 idx
= value_sub (idx
, value_from_longest (builtin_type_int
, lwb
));
2372 arr
= value_add (arr
, idx
);
2373 type
= TYPE_TARGET_TYPE (type
);
2376 return value_ind (arr
);
2379 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2380 actual type of ARRAY_PTR is ignored), returns a reference to
2381 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2382 bound of this array is LOW, as per Ada rules. */
2383 static struct value
*
2384 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2387 CORE_ADDR base
= value_as_address (array_ptr
)
2388 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2389 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2390 struct type
*index_type
=
2391 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2393 struct type
*slice_type
=
2394 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2395 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2399 static struct value
*
2400 ada_value_slice (struct value
*array
, int low
, int high
)
2402 struct type
*type
= value_type (array
);
2403 struct type
*index_type
=
2404 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2405 struct type
*slice_type
=
2406 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2407 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2410 /* If type is a record type in the form of a standard GNAT array
2411 descriptor, returns the number of dimensions for type. If arr is a
2412 simple array, returns the number of "array of"s that prefix its
2413 type designation. Otherwise, returns 0. */
2416 ada_array_arity (struct type
*type
)
2423 type
= desc_base_type (type
);
2426 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2427 return desc_arity (desc_bounds_type (type
));
2429 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2432 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2438 /* If TYPE is a record type in the form of a standard GNAT array
2439 descriptor or a simple array type, returns the element type for
2440 TYPE after indexing by NINDICES indices, or by all indices if
2441 NINDICES is -1. Otherwise, returns NULL. */
2444 ada_array_element_type (struct type
*type
, int nindices
)
2446 type
= desc_base_type (type
);
2448 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2451 struct type
*p_array_type
;
2453 p_array_type
= desc_data_type (type
);
2455 k
= ada_array_arity (type
);
2459 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2460 if (nindices
>= 0 && k
> nindices
)
2462 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2463 while (k
> 0 && p_array_type
!= NULL
)
2465 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2468 return p_array_type
;
2470 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2472 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2474 type
= TYPE_TARGET_TYPE (type
);
2483 /* The type of nth index in arrays of given type (n numbering from 1).
2484 Does not examine memory. */
2487 ada_index_type (struct type
*type
, int n
)
2489 struct type
*result_type
;
2491 type
= desc_base_type (type
);
2493 if (n
> ada_array_arity (type
))
2496 if (ada_is_simple_array_type (type
))
2500 for (i
= 1; i
< n
; i
+= 1)
2501 type
= TYPE_TARGET_TYPE (type
);
2502 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2503 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2504 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2505 perhaps stabsread.c would make more sense. */
2506 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2507 result_type
= builtin_type_int
;
2512 return desc_index_type (desc_bounds_type (type
), n
);
2515 /* Given that arr is an array type, returns the lower bound of the
2516 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2517 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2518 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2519 bounds type. It works for other arrays with bounds supplied by
2520 run-time quantities other than discriminants. */
2523 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2524 struct type
** typep
)
2527 struct type
*index_type_desc
;
2529 if (ada_is_packed_array_type (arr_type
))
2530 arr_type
= decode_packed_array_type (arr_type
);
2532 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2535 *typep
= builtin_type_int
;
2536 return (LONGEST
) - which
;
2539 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2540 type
= TYPE_TARGET_TYPE (arr_type
);
2544 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2545 if (index_type_desc
== NULL
)
2547 struct type
*index_type
;
2551 type
= TYPE_TARGET_TYPE (type
);
2555 index_type
= TYPE_INDEX_TYPE (type
);
2557 *typep
= index_type
;
2559 /* The index type is either a range type or an enumerated type.
2560 For the range type, we have some macros that allow us to
2561 extract the value of the low and high bounds. But they
2562 do now work for enumerated types. The expressions used
2563 below work for both range and enum types. */
2565 (LONGEST
) (which
== 0
2566 ? TYPE_FIELD_BITPOS (index_type
, 0)
2567 : TYPE_FIELD_BITPOS (index_type
,
2568 TYPE_NFIELDS (index_type
) - 1));
2572 struct type
*index_type
=
2573 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2574 NULL
, TYPE_OBJFILE (arr_type
));
2577 *typep
= index_type
;
2580 (LONGEST
) (which
== 0
2581 ? TYPE_LOW_BOUND (index_type
)
2582 : TYPE_HIGH_BOUND (index_type
));
2586 /* Given that arr is an array value, returns the lower bound of the
2587 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2588 WHICH is 1. This routine will also work for arrays with bounds
2589 supplied by run-time quantities other than discriminants. */
2592 ada_array_bound (struct value
*arr
, int n
, int which
)
2594 struct type
*arr_type
= value_type (arr
);
2596 if (ada_is_packed_array_type (arr_type
))
2597 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2598 else if (ada_is_simple_array_type (arr_type
))
2601 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2602 return value_from_longest (type
, v
);
2605 return desc_one_bound (desc_bounds (arr
), n
, which
);
2608 /* Given that arr is an array value, returns the length of the
2609 nth index. This routine will also work for arrays with bounds
2610 supplied by run-time quantities other than discriminants.
2611 Does not work for arrays indexed by enumeration types with representation
2612 clauses at the moment. */
2615 ada_array_length (struct value
*arr
, int n
)
2617 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2619 if (ada_is_packed_array_type (arr_type
))
2620 return ada_array_length (decode_packed_array (arr
), n
);
2622 if (ada_is_simple_array_type (arr_type
))
2626 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2627 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2628 return value_from_longest (type
, v
);
2632 value_from_longest (builtin_type_int
,
2633 value_as_long (desc_one_bound (desc_bounds (arr
),
2635 - value_as_long (desc_one_bound (desc_bounds (arr
),
2639 /* An empty array whose type is that of ARR_TYPE (an array type),
2640 with bounds LOW to LOW-1. */
2642 static struct value
*
2643 empty_array (struct type
*arr_type
, int low
)
2645 struct type
*index_type
=
2646 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2648 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2649 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2653 /* Name resolution */
2655 /* The "decoded" name for the user-definable Ada operator corresponding
2659 ada_decoded_op_name (enum exp_opcode op
)
2663 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2665 if (ada_opname_table
[i
].op
== op
)
2666 return ada_opname_table
[i
].decoded
;
2668 error (_("Could not find operator name for opcode"));
2672 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2673 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2674 undefined namespace) and converts operators that are
2675 user-defined into appropriate function calls. If CONTEXT_TYPE is
2676 non-null, it provides a preferred result type [at the moment, only
2677 type void has any effect---causing procedures to be preferred over
2678 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2679 return type is preferred. May change (expand) *EXP. */
2682 resolve (struct expression
**expp
, int void_context_p
)
2686 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2689 /* Resolve the operator of the subexpression beginning at
2690 position *POS of *EXPP. "Resolving" consists of replacing
2691 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2692 with their resolutions, replacing built-in operators with
2693 function calls to user-defined operators, where appropriate, and,
2694 when DEPROCEDURE_P is non-zero, converting function-valued variables
2695 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2696 are as in ada_resolve, above. */
2698 static struct value
*
2699 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2700 struct type
*context_type
)
2704 struct expression
*exp
; /* Convenience: == *expp. */
2705 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2706 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2707 int nargs
; /* Number of operands. */
2714 /* Pass one: resolve operands, saving their types and updating *pos,
2719 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2720 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2725 resolve_subexp (expp
, pos
, 0, NULL
);
2727 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2732 resolve_subexp (expp
, pos
, 0, NULL
);
2737 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2740 case OP_ATR_MODULUS
:
2750 case TERNOP_IN_RANGE
:
2751 case BINOP_IN_BOUNDS
:
2757 case OP_DISCRETE_RANGE
:
2759 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2768 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2770 resolve_subexp (expp
, pos
, 1, NULL
);
2772 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2789 case BINOP_LOGICAL_AND
:
2790 case BINOP_LOGICAL_OR
:
2791 case BINOP_BITWISE_AND
:
2792 case BINOP_BITWISE_IOR
:
2793 case BINOP_BITWISE_XOR
:
2796 case BINOP_NOTEQUAL
:
2803 case BINOP_SUBSCRIPT
:
2811 case UNOP_LOGICAL_NOT
:
2827 case OP_INTERNALVAR
:
2837 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2840 case STRUCTOP_STRUCT
:
2841 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2854 error (_("Unexpected operator during name resolution"));
2857 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2858 for (i
= 0; i
< nargs
; i
+= 1)
2859 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2863 /* Pass two: perform any resolution on principal operator. */
2870 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2872 struct ada_symbol_info
*candidates
;
2876 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2877 (exp
->elts
[pc
+ 2].symbol
),
2878 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2881 if (n_candidates
> 1)
2883 /* Types tend to get re-introduced locally, so if there
2884 are any local symbols that are not types, first filter
2887 for (j
= 0; j
< n_candidates
; j
+= 1)
2888 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2893 case LOC_REGPARM_ADDR
:
2901 if (j
< n_candidates
)
2904 while (j
< n_candidates
)
2906 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2908 candidates
[j
] = candidates
[n_candidates
- 1];
2917 if (n_candidates
== 0)
2918 error (_("No definition found for %s"),
2919 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2920 else if (n_candidates
== 1)
2922 else if (deprocedure_p
2923 && !is_nonfunction (candidates
, n_candidates
))
2925 i
= ada_resolve_function
2926 (candidates
, n_candidates
, NULL
, 0,
2927 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2930 error (_("Could not find a match for %s"),
2931 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2935 printf_filtered (_("Multiple matches for %s\n"),
2936 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2937 user_select_syms (candidates
, n_candidates
, 1);
2941 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2942 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2943 if (innermost_block
== NULL
2944 || contained_in (candidates
[i
].block
, innermost_block
))
2945 innermost_block
= candidates
[i
].block
;
2949 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2952 replace_operator_with_call (expp
, pc
, 0, 0,
2953 exp
->elts
[pc
+ 2].symbol
,
2954 exp
->elts
[pc
+ 1].block
);
2961 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2962 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2964 struct ada_symbol_info
*candidates
;
2968 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2969 (exp
->elts
[pc
+ 5].symbol
),
2970 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2972 if (n_candidates
== 1)
2976 i
= ada_resolve_function
2977 (candidates
, n_candidates
,
2979 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2982 error (_("Could not find a match for %s"),
2983 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2986 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2987 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2988 if (innermost_block
== NULL
2989 || contained_in (candidates
[i
].block
, innermost_block
))
2990 innermost_block
= candidates
[i
].block
;
3001 case BINOP_BITWISE_AND
:
3002 case BINOP_BITWISE_IOR
:
3003 case BINOP_BITWISE_XOR
:
3005 case BINOP_NOTEQUAL
:
3013 case UNOP_LOGICAL_NOT
:
3015 if (possible_user_operator_p (op
, argvec
))
3017 struct ada_symbol_info
*candidates
;
3021 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3022 (struct block
*) NULL
, VAR_DOMAIN
,
3024 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3025 ada_decoded_op_name (op
), NULL
);
3029 replace_operator_with_call (expp
, pc
, nargs
, 1,
3030 candidates
[i
].sym
, candidates
[i
].block
);
3041 return evaluate_subexp_type (exp
, pos
);
3044 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3045 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3046 a non-pointer. A type of 'void' (which is never a valid expression type)
3047 by convention matches anything. */
3048 /* The term "match" here is rather loose. The match is heuristic and
3049 liberal. FIXME: TOO liberal, in fact. */
3052 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3054 ftype
= ada_check_typedef (ftype
);
3055 atype
= ada_check_typedef (atype
);
3057 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3058 ftype
= TYPE_TARGET_TYPE (ftype
);
3059 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3060 atype
= TYPE_TARGET_TYPE (atype
);
3062 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3063 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3066 switch (TYPE_CODE (ftype
))
3071 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3072 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3073 TYPE_TARGET_TYPE (atype
), 0);
3076 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3078 case TYPE_CODE_ENUM
:
3079 case TYPE_CODE_RANGE
:
3080 switch (TYPE_CODE (atype
))
3083 case TYPE_CODE_ENUM
:
3084 case TYPE_CODE_RANGE
:
3090 case TYPE_CODE_ARRAY
:
3091 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3092 || ada_is_array_descriptor_type (atype
));
3094 case TYPE_CODE_STRUCT
:
3095 if (ada_is_array_descriptor_type (ftype
))
3096 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3097 || ada_is_array_descriptor_type (atype
));
3099 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3100 && !ada_is_array_descriptor_type (atype
));
3102 case TYPE_CODE_UNION
:
3104 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3108 /* Return non-zero if the formals of FUNC "sufficiently match" the
3109 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3110 may also be an enumeral, in which case it is treated as a 0-
3111 argument function. */
3114 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3117 struct type
*func_type
= SYMBOL_TYPE (func
);
3119 if (SYMBOL_CLASS (func
) == LOC_CONST
3120 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3121 return (n_actuals
== 0);
3122 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3125 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3128 for (i
= 0; i
< n_actuals
; i
+= 1)
3130 if (actuals
[i
] == NULL
)
3134 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3135 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3137 if (!ada_type_match (ftype
, atype
, 1))
3144 /* False iff function type FUNC_TYPE definitely does not produce a value
3145 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3146 FUNC_TYPE is not a valid function type with a non-null return type
3147 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3150 return_match (struct type
*func_type
, struct type
*context_type
)
3152 struct type
*return_type
;
3154 if (func_type
== NULL
)
3157 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3158 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3160 return_type
= base_type (func_type
);
3161 if (return_type
== NULL
)
3164 context_type
= base_type (context_type
);
3166 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3167 return context_type
== NULL
|| return_type
== context_type
;
3168 else if (context_type
== NULL
)
3169 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3171 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3175 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3176 function (if any) that matches the types of the NARGS arguments in
3177 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3178 that returns that type, then eliminate matches that don't. If
3179 CONTEXT_TYPE is void and there is at least one match that does not
3180 return void, eliminate all matches that do.
3182 Asks the user if there is more than one match remaining. Returns -1
3183 if there is no such symbol or none is selected. NAME is used
3184 solely for messages. May re-arrange and modify SYMS in
3185 the process; the index returned is for the modified vector. */
3188 ada_resolve_function (struct ada_symbol_info syms
[],
3189 int nsyms
, struct value
**args
, int nargs
,
3190 const char *name
, struct type
*context_type
)
3193 int m
; /* Number of hits */
3194 struct type
*fallback
;
3195 struct type
*return_type
;
3197 return_type
= context_type
;
3198 if (context_type
== NULL
)
3199 fallback
= builtin_type_void
;
3206 for (k
= 0; k
< nsyms
; k
+= 1)
3208 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3210 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3211 && return_match (type
, return_type
))
3217 if (m
> 0 || return_type
== fallback
)
3220 return_type
= fallback
;
3227 printf_filtered (_("Multiple matches for %s\n"), name
);
3228 user_select_syms (syms
, m
, 1);
3234 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3235 in a listing of choices during disambiguation (see sort_choices, below).
3236 The idea is that overloadings of a subprogram name from the
3237 same package should sort in their source order. We settle for ordering
3238 such symbols by their trailing number (__N or $N). */
3241 encoded_ordered_before (char *N0
, char *N1
)
3245 else if (N0
== NULL
)
3250 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3252 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3254 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3255 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3259 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3262 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3264 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3265 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3267 return (strcmp (N0
, N1
) < 0);
3271 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3275 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3278 for (i
= 1; i
< nsyms
; i
+= 1)
3280 struct ada_symbol_info sym
= syms
[i
];
3283 for (j
= i
- 1; j
>= 0; j
-= 1)
3285 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3286 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3288 syms
[j
+ 1] = syms
[j
];
3294 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3295 by asking the user (if necessary), returning the number selected,
3296 and setting the first elements of SYMS items. Error if no symbols
3299 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3300 to be re-integrated one of these days. */
3303 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3306 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3308 int first_choice
= (max_results
== 1) ? 1 : 2;
3309 const char *select_mode
= multiple_symbols_select_mode ();
3311 if (max_results
< 1)
3312 error (_("Request to select 0 symbols!"));
3316 if (select_mode
== multiple_symbols_cancel
)
3318 canceled because the command is ambiguous\n\
3319 See set/show multiple-symbol."));
3321 /* If select_mode is "all", then return all possible symbols.
3322 Only do that if more than one symbol can be selected, of course.
3323 Otherwise, display the menu as usual. */
3324 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3327 printf_unfiltered (_("[0] cancel\n"));
3328 if (max_results
> 1)
3329 printf_unfiltered (_("[1] all\n"));
3331 sort_choices (syms
, nsyms
);
3333 for (i
= 0; i
< nsyms
; i
+= 1)
3335 if (syms
[i
].sym
== NULL
)
3338 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3340 struct symtab_and_line sal
=
3341 find_function_start_sal (syms
[i
].sym
, 1);
3342 if (sal
.symtab
== NULL
)
3343 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3345 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3348 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3349 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3350 sal
.symtab
->filename
, sal
.line
);
3356 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3357 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3358 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3359 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3361 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3362 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3364 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3365 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3366 else if (is_enumeral
3367 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3369 printf_unfiltered (("[%d] "), i
+ first_choice
);
3370 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3372 printf_unfiltered (_("'(%s) (enumeral)\n"),
3373 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3375 else if (symtab
!= NULL
)
3376 printf_unfiltered (is_enumeral
3377 ? _("[%d] %s in %s (enumeral)\n")
3378 : _("[%d] %s at %s:?\n"),
3380 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3383 printf_unfiltered (is_enumeral
3384 ? _("[%d] %s (enumeral)\n")
3385 : _("[%d] %s at ?\n"),
3387 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3391 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3394 for (i
= 0; i
< n_chosen
; i
+= 1)
3395 syms
[i
] = syms
[chosen
[i
]];
3400 /* Read and validate a set of numeric choices from the user in the
3401 range 0 .. N_CHOICES-1. Place the results in increasing
3402 order in CHOICES[0 .. N-1], and return N.
3404 The user types choices as a sequence of numbers on one line
3405 separated by blanks, encoding them as follows:
3407 + A choice of 0 means to cancel the selection, throwing an error.
3408 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3409 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3411 The user is not allowed to choose more than MAX_RESULTS values.
3413 ANNOTATION_SUFFIX, if present, is used to annotate the input
3414 prompts (for use with the -f switch). */
3417 get_selections (int *choices
, int n_choices
, int max_results
,
3418 int is_all_choice
, char *annotation_suffix
)
3423 int first_choice
= is_all_choice
? 2 : 1;
3425 prompt
= getenv ("PS2");
3429 args
= command_line_input (prompt
, 0, annotation_suffix
);
3432 error_no_arg (_("one or more choice numbers"));
3436 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3437 order, as given in args. Choices are validated. */
3443 while (isspace (*args
))
3445 if (*args
== '\0' && n_chosen
== 0)
3446 error_no_arg (_("one or more choice numbers"));
3447 else if (*args
== '\0')
3450 choice
= strtol (args
, &args2
, 10);
3451 if (args
== args2
|| choice
< 0
3452 || choice
> n_choices
+ first_choice
- 1)
3453 error (_("Argument must be choice number"));
3457 error (_("cancelled"));
3459 if (choice
< first_choice
)
3461 n_chosen
= n_choices
;
3462 for (j
= 0; j
< n_choices
; j
+= 1)
3466 choice
-= first_choice
;
3468 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3472 if (j
< 0 || choice
!= choices
[j
])
3475 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3476 choices
[k
+ 1] = choices
[k
];
3477 choices
[j
+ 1] = choice
;
3482 if (n_chosen
> max_results
)
3483 error (_("Select no more than %d of the above"), max_results
);
3488 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3489 on the function identified by SYM and BLOCK, and taking NARGS
3490 arguments. Update *EXPP as needed to hold more space. */
3493 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3494 int oplen
, struct symbol
*sym
,
3495 struct block
*block
)
3497 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3498 symbol, -oplen for operator being replaced). */
3499 struct expression
*newexp
= (struct expression
*)
3500 xmalloc (sizeof (struct expression
)
3501 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3502 struct expression
*exp
= *expp
;
3504 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3505 newexp
->language_defn
= exp
->language_defn
;
3506 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3507 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3508 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3510 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3511 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3513 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3514 newexp
->elts
[pc
+ 4].block
= block
;
3515 newexp
->elts
[pc
+ 5].symbol
= sym
;
3521 /* Type-class predicates */
3523 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3527 numeric_type_p (struct type
*type
)
3533 switch (TYPE_CODE (type
))
3538 case TYPE_CODE_RANGE
:
3539 return (type
== TYPE_TARGET_TYPE (type
)
3540 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3547 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3550 integer_type_p (struct type
*type
)
3556 switch (TYPE_CODE (type
))
3560 case TYPE_CODE_RANGE
:
3561 return (type
== TYPE_TARGET_TYPE (type
)
3562 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3569 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3572 scalar_type_p (struct type
*type
)
3578 switch (TYPE_CODE (type
))
3581 case TYPE_CODE_RANGE
:
3582 case TYPE_CODE_ENUM
:
3591 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3594 discrete_type_p (struct type
*type
)
3600 switch (TYPE_CODE (type
))
3603 case TYPE_CODE_RANGE
:
3604 case TYPE_CODE_ENUM
:
3612 /* Returns non-zero if OP with operands in the vector ARGS could be
3613 a user-defined function. Errs on the side of pre-defined operators
3614 (i.e., result 0). */
3617 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3619 struct type
*type0
=
3620 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3621 struct type
*type1
=
3622 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3636 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3640 case BINOP_BITWISE_AND
:
3641 case BINOP_BITWISE_IOR
:
3642 case BINOP_BITWISE_XOR
:
3643 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3646 case BINOP_NOTEQUAL
:
3651 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3654 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3657 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3661 case UNOP_LOGICAL_NOT
:
3663 return (!numeric_type_p (type0
));
3672 1. In the following, we assume that a renaming type's name may
3673 have an ___XD suffix. It would be nice if this went away at some
3675 2. We handle both the (old) purely type-based representation of
3676 renamings and the (new) variable-based encoding. At some point,
3677 it is devoutly to be hoped that the former goes away
3678 (FIXME: hilfinger-2007-07-09).
3679 3. Subprogram renamings are not implemented, although the XRS
3680 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3682 /* If SYM encodes a renaming,
3684 <renaming> renames <renamed entity>,
3686 sets *LEN to the length of the renamed entity's name,
3687 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3688 the string describing the subcomponent selected from the renamed
3689 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3690 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3691 are undefined). Otherwise, returns a value indicating the category
3692 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3693 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3694 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3695 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3696 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3697 may be NULL, in which case they are not assigned.
3699 [Currently, however, GCC does not generate subprogram renamings.] */
3701 enum ada_renaming_category
3702 ada_parse_renaming (struct symbol
*sym
,
3703 const char **renamed_entity
, int *len
,
3704 const char **renaming_expr
)
3706 enum ada_renaming_category kind
;
3711 return ADA_NOT_RENAMING
;
3712 switch (SYMBOL_CLASS (sym
))
3715 return ADA_NOT_RENAMING
;
3717 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3718 renamed_entity
, len
, renaming_expr
);
3722 case LOC_OPTIMIZED_OUT
:
3723 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3725 return ADA_NOT_RENAMING
;
3729 kind
= ADA_OBJECT_RENAMING
;
3733 kind
= ADA_EXCEPTION_RENAMING
;
3737 kind
= ADA_PACKAGE_RENAMING
;
3741 kind
= ADA_SUBPROGRAM_RENAMING
;
3745 return ADA_NOT_RENAMING
;
3749 if (renamed_entity
!= NULL
)
3750 *renamed_entity
= info
;
3751 suffix
= strstr (info
, "___XE");
3752 if (suffix
== NULL
|| suffix
== info
)
3753 return ADA_NOT_RENAMING
;
3755 *len
= strlen (info
) - strlen (suffix
);
3757 if (renaming_expr
!= NULL
)
3758 *renaming_expr
= suffix
;
3762 /* Assuming TYPE encodes a renaming according to the old encoding in
3763 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3764 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3765 ADA_NOT_RENAMING otherwise. */
3766 static enum ada_renaming_category
3767 parse_old_style_renaming (struct type
*type
,
3768 const char **renamed_entity
, int *len
,
3769 const char **renaming_expr
)
3771 enum ada_renaming_category kind
;
3776 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3777 || TYPE_NFIELDS (type
) != 1)
3778 return ADA_NOT_RENAMING
;
3780 name
= type_name_no_tag (type
);
3782 return ADA_NOT_RENAMING
;
3784 name
= strstr (name
, "___XR");
3786 return ADA_NOT_RENAMING
;
3791 kind
= ADA_OBJECT_RENAMING
;
3794 kind
= ADA_EXCEPTION_RENAMING
;
3797 kind
= ADA_PACKAGE_RENAMING
;
3800 kind
= ADA_SUBPROGRAM_RENAMING
;
3803 return ADA_NOT_RENAMING
;
3806 info
= TYPE_FIELD_NAME (type
, 0);
3808 return ADA_NOT_RENAMING
;
3809 if (renamed_entity
!= NULL
)
3810 *renamed_entity
= info
;
3811 suffix
= strstr (info
, "___XE");
3812 if (renaming_expr
!= NULL
)
3813 *renaming_expr
= suffix
+ 5;
3814 if (suffix
== NULL
|| suffix
== info
)
3815 return ADA_NOT_RENAMING
;
3817 *len
= suffix
- info
;
3823 /* Evaluation: Function Calls */
3825 /* Return an lvalue containing the value VAL. This is the identity on
3826 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3827 on the stack, using and updating *SP as the stack pointer, and
3828 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3830 static struct value
*
3831 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3833 if (! VALUE_LVAL (val
))
3835 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3837 /* The following is taken from the structure-return code in
3838 call_function_by_hand. FIXME: Therefore, some refactoring seems
3840 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3842 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3843 reserving sufficient space. */
3845 if (gdbarch_frame_align_p (current_gdbarch
))
3846 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3847 VALUE_ADDRESS (val
) = *sp
;
3851 /* Stack grows upward. Align the frame, allocate space, and
3852 then again, re-align the frame. */
3853 if (gdbarch_frame_align_p (current_gdbarch
))
3854 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3855 VALUE_ADDRESS (val
) = *sp
;
3857 if (gdbarch_frame_align_p (current_gdbarch
))
3858 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3860 VALUE_LVAL (val
) = lval_memory
;
3862 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3868 /* Return the value ACTUAL, converted to be an appropriate value for a
3869 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3870 allocating any necessary descriptors (fat pointers), or copies of
3871 values not residing in memory, updating it as needed. */
3874 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3877 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3878 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3879 struct type
*formal_target
=
3880 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3881 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3882 struct type
*actual_target
=
3883 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3884 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3886 if (ada_is_array_descriptor_type (formal_target
)
3887 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3888 return make_array_descriptor (formal_type
, actual
, sp
);
3889 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3890 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3892 struct value
*result
;
3893 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3894 && ada_is_array_descriptor_type (actual_target
))
3895 result
= desc_data (actual
);
3896 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3898 if (VALUE_LVAL (actual
) != lval_memory
)
3901 actual_type
= ada_check_typedef (value_type (actual
));
3902 val
= allocate_value (actual_type
);
3903 memcpy ((char *) value_contents_raw (val
),
3904 (char *) value_contents (actual
),
3905 TYPE_LENGTH (actual_type
));
3906 actual
= ensure_lval (val
, sp
);
3908 result
= value_addr (actual
);
3912 return value_cast_pointers (formal_type
, result
);
3914 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3915 return ada_value_ind (actual
);
3921 /* Push a descriptor of type TYPE for array value ARR on the stack at
3922 *SP, updating *SP to reflect the new descriptor. Return either
3923 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3924 to-descriptor type rather than a descriptor type), a struct value *
3925 representing a pointer to this descriptor. */
3927 static struct value
*
3928 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3930 struct type
*bounds_type
= desc_bounds_type (type
);
3931 struct type
*desc_type
= desc_base_type (type
);
3932 struct value
*descriptor
= allocate_value (desc_type
);
3933 struct value
*bounds
= allocate_value (bounds_type
);
3936 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3938 modify_general_field (value_contents_writeable (bounds
),
3939 value_as_long (ada_array_bound (arr
, i
, 0)),
3940 desc_bound_bitpos (bounds_type
, i
, 0),
3941 desc_bound_bitsize (bounds_type
, i
, 0));
3942 modify_general_field (value_contents_writeable (bounds
),
3943 value_as_long (ada_array_bound (arr
, i
, 1)),
3944 desc_bound_bitpos (bounds_type
, i
, 1),
3945 desc_bound_bitsize (bounds_type
, i
, 1));
3948 bounds
= ensure_lval (bounds
, sp
);
3950 modify_general_field (value_contents_writeable (descriptor
),
3951 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3952 fat_pntr_data_bitpos (desc_type
),
3953 fat_pntr_data_bitsize (desc_type
));
3955 modify_general_field (value_contents_writeable (descriptor
),
3956 VALUE_ADDRESS (bounds
),
3957 fat_pntr_bounds_bitpos (desc_type
),
3958 fat_pntr_bounds_bitsize (desc_type
));
3960 descriptor
= ensure_lval (descriptor
, sp
);
3962 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3963 return value_addr (descriptor
);
3968 /* Dummy definitions for an experimental caching module that is not
3969 * used in the public sources. */
3972 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3973 struct symbol
**sym
, struct block
**block
)
3979 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3980 struct block
*block
)
3986 /* Return the result of a standard (literal, C-like) lookup of NAME in
3987 given DOMAIN, visible from lexical block BLOCK. */
3989 static struct symbol
*
3990 standard_lookup (const char *name
, const struct block
*block
,
3995 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3997 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3998 cache_symbol (name
, domain
, sym
, block_found
);
4003 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4004 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4005 since they contend in overloading in the same way. */
4007 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4011 for (i
= 0; i
< n
; i
+= 1)
4012 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4013 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4014 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4020 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4021 struct types. Otherwise, they may not. */
4024 equiv_types (struct type
*type0
, struct type
*type1
)
4028 if (type0
== NULL
|| type1
== NULL
4029 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4031 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4032 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4033 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4034 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4040 /* True iff SYM0 represents the same entity as SYM1, or one that is
4041 no more defined than that of SYM1. */
4044 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4048 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4049 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4052 switch (SYMBOL_CLASS (sym0
))
4058 struct type
*type0
= SYMBOL_TYPE (sym0
);
4059 struct type
*type1
= SYMBOL_TYPE (sym1
);
4060 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4061 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4062 int len0
= strlen (name0
);
4064 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4065 && (equiv_types (type0
, type1
)
4066 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4067 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4070 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4071 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4077 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4078 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4081 add_defn_to_vec (struct obstack
*obstackp
,
4083 struct block
*block
)
4087 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4089 /* Do not try to complete stub types, as the debugger is probably
4090 already scanning all symbols matching a certain name at the
4091 time when this function is called. Trying to replace the stub
4092 type by its associated full type will cause us to restart a scan
4093 which may lead to an infinite recursion. Instead, the client
4094 collecting the matching symbols will end up collecting several
4095 matches, with at least one of them complete. It can then filter
4096 out the stub ones if needed. */
4098 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4100 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4102 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4104 prevDefns
[i
].sym
= sym
;
4105 prevDefns
[i
].block
= block
;
4111 struct ada_symbol_info info
;
4115 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4119 /* Number of ada_symbol_info structures currently collected in
4120 current vector in *OBSTACKP. */
4123 num_defns_collected (struct obstack
*obstackp
)
4125 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4128 /* Vector of ada_symbol_info structures currently collected in current
4129 vector in *OBSTACKP. If FINISH, close off the vector and return
4130 its final address. */
4132 static struct ada_symbol_info
*
4133 defns_collected (struct obstack
*obstackp
, int finish
)
4136 return obstack_finish (obstackp
);
4138 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4141 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4142 Check the global symbols if GLOBAL, the static symbols if not.
4143 Do wild-card match if WILD. */
4145 static struct partial_symbol
*
4146 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4147 int global
, domain_enum
namespace, int wild
)
4149 struct partial_symbol
**start
;
4150 int name_len
= strlen (name
);
4151 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4160 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4161 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4165 for (i
= 0; i
< length
; i
+= 1)
4167 struct partial_symbol
*psym
= start
[i
];
4169 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4170 SYMBOL_DOMAIN (psym
), namespace)
4171 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4185 int M
= (U
+ i
) >> 1;
4186 struct partial_symbol
*psym
= start
[M
];
4187 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4189 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4191 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4202 struct partial_symbol
*psym
= start
[i
];
4204 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4205 SYMBOL_DOMAIN (psym
), namespace))
4207 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4215 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4229 int M
= (U
+ i
) >> 1;
4230 struct partial_symbol
*psym
= start
[M
];
4231 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4233 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4235 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4246 struct partial_symbol
*psym
= start
[i
];
4248 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4249 SYMBOL_DOMAIN (psym
), namespace))
4253 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4256 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4258 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4268 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4278 /* Find a symbol table containing symbol SYM or NULL if none. */
4280 static struct symtab
*
4281 symtab_for_sym (struct symbol
*sym
)
4284 struct objfile
*objfile
;
4286 struct symbol
*tmp_sym
;
4287 struct dict_iterator iter
;
4290 ALL_PRIMARY_SYMTABS (objfile
, s
)
4292 switch (SYMBOL_CLASS (sym
))
4300 case LOC_CONST_BYTES
:
4301 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4302 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4304 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4305 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4311 switch (SYMBOL_CLASS (sym
))
4316 case LOC_REGPARM_ADDR
:
4320 for (j
= FIRST_LOCAL_BLOCK
;
4321 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4323 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4324 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4335 /* Return a minimal symbol matching NAME according to Ada decoding
4336 rules. Returns NULL if there is no such minimal symbol. Names
4337 prefixed with "standard__" are handled specially: "standard__" is
4338 first stripped off, and only static and global symbols are searched. */
4340 struct minimal_symbol
*
4341 ada_lookup_simple_minsym (const char *name
)
4343 struct objfile
*objfile
;
4344 struct minimal_symbol
*msymbol
;
4347 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4349 name
+= sizeof ("standard__") - 1;
4353 wild_match
= (strstr (name
, "__") == NULL
);
4355 ALL_MSYMBOLS (objfile
, msymbol
)
4357 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4358 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4365 /* For all subprograms that statically enclose the subprogram of the
4366 selected frame, add symbols matching identifier NAME in DOMAIN
4367 and their blocks to the list of data in OBSTACKP, as for
4368 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4372 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4373 const char *name
, domain_enum
namespace,
4378 /* True if TYPE is definitely an artificial type supplied to a symbol
4379 for which no debugging information was given in the symbol file. */
4382 is_nondebugging_type (struct type
*type
)
4384 char *name
= ada_type_name (type
);
4385 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4388 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4389 duplicate other symbols in the list (The only case I know of where
4390 this happens is when object files containing stabs-in-ecoff are
4391 linked with files containing ordinary ecoff debugging symbols (or no
4392 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4393 Returns the number of items in the modified list. */
4396 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4403 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4404 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4405 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4407 for (j
= 0; j
< nsyms
; j
+= 1)
4410 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4411 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4412 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4413 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4414 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4415 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4418 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4419 syms
[k
- 1] = syms
[k
];
4432 /* Given a type that corresponds to a renaming entity, use the type name
4433 to extract the scope (package name or function name, fully qualified,
4434 and following the GNAT encoding convention) where this renaming has been
4435 defined. The string returned needs to be deallocated after use. */
4438 xget_renaming_scope (struct type
*renaming_type
)
4440 /* The renaming types adhere to the following convention:
4441 <scope>__<rename>___<XR extension>.
4442 So, to extract the scope, we search for the "___XR" extension,
4443 and then backtrack until we find the first "__". */
4445 const char *name
= type_name_no_tag (renaming_type
);
4446 char *suffix
= strstr (name
, "___XR");
4451 /* Now, backtrack a bit until we find the first "__". Start looking
4452 at suffix - 3, as the <rename> part is at least one character long. */
4454 for (last
= suffix
- 3; last
> name
; last
--)
4455 if (last
[0] == '_' && last
[1] == '_')
4458 /* Make a copy of scope and return it. */
4460 scope_len
= last
- name
;
4461 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4463 strncpy (scope
, name
, scope_len
);
4464 scope
[scope_len
] = '\0';
4469 /* Return nonzero if NAME corresponds to a package name. */
4472 is_package_name (const char *name
)
4474 /* Here, We take advantage of the fact that no symbols are generated
4475 for packages, while symbols are generated for each function.
4476 So the condition for NAME represent a package becomes equivalent
4477 to NAME not existing in our list of symbols. There is only one
4478 small complication with library-level functions (see below). */
4482 /* If it is a function that has not been defined at library level,
4483 then we should be able to look it up in the symbols. */
4484 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4487 /* Library-level function names start with "_ada_". See if function
4488 "_ada_" followed by NAME can be found. */
4490 /* Do a quick check that NAME does not contain "__", since library-level
4491 functions names cannot contain "__" in them. */
4492 if (strstr (name
, "__") != NULL
)
4495 fun_name
= xstrprintf ("_ada_%s", name
);
4497 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4500 /* Return nonzero if SYM corresponds to a renaming entity that is
4501 not visible from FUNCTION_NAME. */
4504 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4508 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4511 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4513 make_cleanup (xfree
, scope
);
4515 /* If the rename has been defined in a package, then it is visible. */
4516 if (is_package_name (scope
))
4519 /* Check that the rename is in the current function scope by checking
4520 that its name starts with SCOPE. */
4522 /* If the function name starts with "_ada_", it means that it is
4523 a library-level function. Strip this prefix before doing the
4524 comparison, as the encoding for the renaming does not contain
4526 if (strncmp (function_name
, "_ada_", 5) == 0)
4529 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4532 /* Remove entries from SYMS that corresponds to a renaming entity that
4533 is not visible from the function associated with CURRENT_BLOCK or
4534 that is superfluous due to the presence of more specific renaming
4535 information. Places surviving symbols in the initial entries of
4536 SYMS and returns the number of surviving symbols.
4539 First, in cases where an object renaming is implemented as a
4540 reference variable, GNAT may produce both the actual reference
4541 variable and the renaming encoding. In this case, we discard the
4544 Second, GNAT emits a type following a specified encoding for each renaming
4545 entity. Unfortunately, STABS currently does not support the definition
4546 of types that are local to a given lexical block, so all renamings types
4547 are emitted at library level. As a consequence, if an application
4548 contains two renaming entities using the same name, and a user tries to
4549 print the value of one of these entities, the result of the ada symbol
4550 lookup will also contain the wrong renaming type.
4552 This function partially covers for this limitation by attempting to
4553 remove from the SYMS list renaming symbols that should be visible
4554 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4555 method with the current information available. The implementation
4556 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4558 - When the user tries to print a rename in a function while there
4559 is another rename entity defined in a package: Normally, the
4560 rename in the function has precedence over the rename in the
4561 package, so the latter should be removed from the list. This is
4562 currently not the case.
4564 - This function will incorrectly remove valid renames if
4565 the CURRENT_BLOCK corresponds to a function which symbol name
4566 has been changed by an "Export" pragma. As a consequence,
4567 the user will be unable to print such rename entities. */
4570 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4571 int nsyms
, const struct block
*current_block
)
4573 struct symbol
*current_function
;
4574 char *current_function_name
;
4576 int is_new_style_renaming
;
4578 /* If there is both a renaming foo___XR... encoded as a variable and
4579 a simple variable foo in the same block, discard the latter.
4580 First, zero out such symbols, then compress. */
4581 is_new_style_renaming
= 0;
4582 for (i
= 0; i
< nsyms
; i
+= 1)
4584 struct symbol
*sym
= syms
[i
].sym
;
4585 struct block
*block
= syms
[i
].block
;
4589 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4591 name
= SYMBOL_LINKAGE_NAME (sym
);
4592 suffix
= strstr (name
, "___XR");
4596 int name_len
= suffix
- name
;
4598 is_new_style_renaming
= 1;
4599 for (j
= 0; j
< nsyms
; j
+= 1)
4600 if (i
!= j
&& syms
[j
].sym
!= NULL
4601 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4603 && block
== syms
[j
].block
)
4607 if (is_new_style_renaming
)
4611 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4612 if (syms
[j
].sym
!= NULL
)
4620 /* Extract the function name associated to CURRENT_BLOCK.
4621 Abort if unable to do so. */
4623 if (current_block
== NULL
)
4626 current_function
= block_function (current_block
);
4627 if (current_function
== NULL
)
4630 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4631 if (current_function_name
== NULL
)
4634 /* Check each of the symbols, and remove it from the list if it is
4635 a type corresponding to a renaming that is out of the scope of
4636 the current block. */
4641 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4642 == ADA_OBJECT_RENAMING
4643 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4646 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4647 syms
[j
- 1] = syms
[j
];
4657 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4658 scope and in global scopes, returning the number of matches. Sets
4659 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4660 indicating the symbols found and the blocks and symbol tables (if
4661 any) in which they were found. This vector are transient---good only to
4662 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4663 symbol match within the nest of blocks whose innermost member is BLOCK0,
4664 is the one match returned (no other matches in that or
4665 enclosing blocks is returned). If there are any matches in or
4666 surrounding BLOCK0, then these alone are returned. Otherwise, the
4667 search extends to global and file-scope (static) symbol tables.
4668 Names prefixed with "standard__" are handled specially: "standard__"
4669 is first stripped off, and only static and global symbols are searched. */
4672 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4673 domain_enum
namespace,
4674 struct ada_symbol_info
**results
)
4678 struct partial_symtab
*ps
;
4679 struct blockvector
*bv
;
4680 struct objfile
*objfile
;
4681 struct block
*block
;
4683 struct minimal_symbol
*msymbol
;
4689 obstack_free (&symbol_list_obstack
, NULL
);
4690 obstack_init (&symbol_list_obstack
);
4694 /* Search specified block and its superiors. */
4696 wild_match
= (strstr (name0
, "__") == NULL
);
4698 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4699 needed, but adding const will
4700 have a cascade effect. */
4701 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4705 name
= name0
+ sizeof ("standard__") - 1;
4709 while (block
!= NULL
)
4712 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4713 namespace, NULL
, wild_match
);
4715 /* If we found a non-function match, assume that's the one. */
4716 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4717 num_defns_collected (&symbol_list_obstack
)))
4720 block
= BLOCK_SUPERBLOCK (block
);
4723 /* If no luck so far, try to find NAME as a local symbol in some lexically
4724 enclosing subprogram. */
4725 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4726 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4727 name
, namespace, wild_match
);
4729 /* If we found ANY matches among non-global symbols, we're done. */
4731 if (num_defns_collected (&symbol_list_obstack
) > 0)
4735 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4738 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4742 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4743 tables, and psymtab's. */
4745 ALL_PRIMARY_SYMTABS (objfile
, s
)
4748 bv
= BLOCKVECTOR (s
);
4749 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4750 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4751 objfile
, wild_match
);
4754 if (namespace == VAR_DOMAIN
)
4756 ALL_MSYMBOLS (objfile
, msymbol
)
4758 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4760 switch (MSYMBOL_TYPE (msymbol
))
4762 case mst_solib_trampoline
:
4765 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4768 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4770 bv
= BLOCKVECTOR (s
);
4771 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4772 ada_add_block_symbols (&symbol_list_obstack
, block
,
4773 SYMBOL_LINKAGE_NAME (msymbol
),
4774 namespace, objfile
, wild_match
);
4776 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4778 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4779 ada_add_block_symbols (&symbol_list_obstack
, block
,
4780 SYMBOL_LINKAGE_NAME (msymbol
),
4790 ALL_PSYMTABS (objfile
, ps
)
4794 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4796 s
= PSYMTAB_TO_SYMTAB (ps
);
4799 bv
= BLOCKVECTOR (s
);
4800 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4801 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4802 namespace, objfile
, wild_match
);
4806 /* Now add symbols from all per-file blocks if we've gotten no hits
4807 (Not strictly correct, but perhaps better than an error).
4808 Do the symtabs first, then check the psymtabs. */
4810 if (num_defns_collected (&symbol_list_obstack
) == 0)
4813 ALL_PRIMARY_SYMTABS (objfile
, s
)
4816 bv
= BLOCKVECTOR (s
);
4817 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4818 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4819 objfile
, wild_match
);
4822 ALL_PSYMTABS (objfile
, ps
)
4826 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4828 s
= PSYMTAB_TO_SYMTAB (ps
);
4829 bv
= BLOCKVECTOR (s
);
4832 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4833 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4834 namespace, objfile
, wild_match
);
4840 ndefns
= num_defns_collected (&symbol_list_obstack
);
4841 *results
= defns_collected (&symbol_list_obstack
, 1);
4843 ndefns
= remove_extra_symbols (*results
, ndefns
);
4846 cache_symbol (name0
, namespace, NULL
, NULL
);
4848 if (ndefns
== 1 && cacheIfUnique
)
4849 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4851 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4857 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4858 domain_enum
namespace, struct block
**block_found
)
4860 struct ada_symbol_info
*candidates
;
4863 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4865 if (n_candidates
== 0)
4868 if (block_found
!= NULL
)
4869 *block_found
= candidates
[0].block
;
4871 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4874 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4875 scope and in global scopes, or NULL if none. NAME is folded and
4876 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4877 choosing the first symbol if there are multiple choices.
4878 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4879 table in which the symbol was found (in both cases, these
4880 assignments occur only if the pointers are non-null). */
4882 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4883 domain_enum
namespace, int *is_a_field_of_this
)
4885 if (is_a_field_of_this
!= NULL
)
4886 *is_a_field_of_this
= 0;
4889 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4890 block0
, namespace, NULL
);
4893 static struct symbol
*
4894 ada_lookup_symbol_nonlocal (const char *name
,
4895 const char *linkage_name
,
4896 const struct block
*block
,
4897 const domain_enum domain
)
4899 if (linkage_name
== NULL
)
4900 linkage_name
= name
;
4901 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4906 /* True iff STR is a possible encoded suffix of a normal Ada name
4907 that is to be ignored for matching purposes. Suffixes of parallel
4908 names (e.g., XVE) are not included here. Currently, the possible suffixes
4909 are given by either of the regular expression:
4911 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4912 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4913 _E[0-9]+[bs]$ [protected object entry suffixes]
4914 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4916 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4917 match is performed. This sequence is used to differentiate homonyms,
4918 is an optional part of a valid name suffix. */
4921 is_name_suffix (const char *str
)
4924 const char *matching
;
4925 const int len
= strlen (str
);
4927 /* Skip optional leading __[0-9]+. */
4929 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4932 while (isdigit (str
[0]))
4938 if (str
[0] == '.' || str
[0] == '$')
4941 while (isdigit (matching
[0]))
4943 if (matching
[0] == '\0')
4949 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4952 while (isdigit (matching
[0]))
4954 if (matching
[0] == '\0')
4959 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4960 with a N at the end. Unfortunately, the compiler uses the same
4961 convention for other internal types it creates. So treating
4962 all entity names that end with an "N" as a name suffix causes
4963 some regressions. For instance, consider the case of an enumerated
4964 type. To support the 'Image attribute, it creates an array whose
4966 Having a single character like this as a suffix carrying some
4967 information is a bit risky. Perhaps we should change the encoding
4968 to be something like "_N" instead. In the meantime, do not do
4969 the following check. */
4970 /* Protected Object Subprograms */
4971 if (len
== 1 && str
[0] == 'N')
4976 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4979 while (isdigit (matching
[0]))
4981 if ((matching
[0] == 'b' || matching
[0] == 's')
4982 && matching
[1] == '\0')
4986 /* ??? We should not modify STR directly, as we are doing below. This
4987 is fine in this case, but may become problematic later if we find
4988 that this alternative did not work, and want to try matching
4989 another one from the begining of STR. Since we modified it, we
4990 won't be able to find the begining of the string anymore! */
4994 while (str
[0] != '_' && str
[0] != '\0')
4996 if (str
[0] != 'n' && str
[0] != 'b')
5002 if (str
[0] == '\000')
5007 if (str
[1] != '_' || str
[2] == '\000')
5011 if (strcmp (str
+ 3, "JM") == 0)
5013 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5014 the LJM suffix in favor of the JM one. But we will
5015 still accept LJM as a valid suffix for a reasonable
5016 amount of time, just to allow ourselves to debug programs
5017 compiled using an older version of GNAT. */
5018 if (strcmp (str
+ 3, "LJM") == 0)
5022 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5023 || str
[4] == 'U' || str
[4] == 'P')
5025 if (str
[4] == 'R' && str
[5] != 'T')
5029 if (!isdigit (str
[2]))
5031 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5032 if (!isdigit (str
[k
]) && str
[k
] != '_')
5036 if (str
[0] == '$' && isdigit (str
[1]))
5038 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5039 if (!isdigit (str
[k
]) && str
[k
] != '_')
5046 /* Return nonzero if the given string starts with a dot ('.')
5047 followed by zero or more digits.
5049 Note: brobecker/2003-11-10: A forward declaration has not been
5050 added at the begining of this file yet, because this function
5051 is only used to work around a problem found during wild matching
5052 when trying to match minimal symbol names against symbol names
5053 obtained from dwarf-2 data. This function is therefore currently
5054 only used in wild_match() and is likely to be deleted when the
5055 problem in dwarf-2 is fixed. */
5058 is_dot_digits_suffix (const char *str
)
5064 while (isdigit (str
[0]))
5066 return (str
[0] == '\0');
5069 /* Return non-zero if the string starting at NAME and ending before
5070 NAME_END contains no capital letters. */
5073 is_valid_name_for_wild_match (const char *name0
)
5075 const char *decoded_name
= ada_decode (name0
);
5078 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5079 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5085 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5086 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5087 informational suffixes of NAME (i.e., for which is_name_suffix is
5091 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5098 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5099 stored in the symbol table for nested function names is sometimes
5100 different from the name of the associated entity stored in
5101 the dwarf-2 data: This is the case for nested subprograms, where
5102 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5103 while the symbol name from the dwarf-2 data does not.
5105 Although the DWARF-2 standard documents that entity names stored
5106 in the dwarf-2 data should be identical to the name as seen in
5107 the source code, GNAT takes a different approach as we already use
5108 a special encoding mechanism to convey the information so that
5109 a C debugger can still use the information generated to debug
5110 Ada programs. A corollary is that the symbol names in the dwarf-2
5111 data should match the names found in the symbol table. I therefore
5112 consider this issue as a compiler defect.
5114 Until the compiler is properly fixed, we work-around the problem
5115 by ignoring such suffixes during the match. We do so by making
5116 a copy of PATN0 and NAME0, and then by stripping such a suffix
5117 if present. We then perform the match on the resulting strings. */
5120 name_len
= strlen (name0
);
5122 name
= name_start
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5123 strcpy (name
, name0
);
5124 dot
= strrchr (name
, '.');
5125 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5128 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5129 strncpy (patn
, patn0
, patn_len
);
5130 patn
[patn_len
] = '\0';
5131 dot
= strrchr (patn
, '.');
5132 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5135 patn_len
= dot
- patn
;
5139 /* Now perform the wild match. */
5141 name_len
= strlen (name
);
5142 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5143 && strncmp (patn
, name
+ 5, patn_len
) == 0
5144 && is_name_suffix (name
+ patn_len
+ 5))
5147 while (name_len
>= patn_len
)
5149 if (strncmp (patn
, name
, patn_len
) == 0
5150 && is_name_suffix (name
+ patn_len
))
5151 return (name
== name_start
|| is_valid_name_for_wild_match (name0
));
5158 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5163 if (!islower (name
[2]))
5170 if (!islower (name
[1]))
5181 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5182 vector *defn_symbols, updating the list of symbols in OBSTACKP
5183 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5184 OBJFILE is the section containing BLOCK.
5185 SYMTAB is recorded with each symbol added. */
5188 ada_add_block_symbols (struct obstack
*obstackp
,
5189 struct block
*block
, const char *name
,
5190 domain_enum domain
, struct objfile
*objfile
,
5193 struct dict_iterator iter
;
5194 int name_len
= strlen (name
);
5195 /* A matching argument symbol, if any. */
5196 struct symbol
*arg_sym
;
5197 /* Set true when we find a matching non-argument symbol. */
5206 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5208 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5209 SYMBOL_DOMAIN (sym
), domain
)
5210 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5212 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5214 else if (SYMBOL_IS_ARGUMENT (sym
))
5219 add_defn_to_vec (obstackp
,
5220 fixup_symbol_section (sym
, objfile
),
5228 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5230 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5231 SYMBOL_DOMAIN (sym
), domain
))
5233 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5235 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5237 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5239 if (SYMBOL_IS_ARGUMENT (sym
))
5244 add_defn_to_vec (obstackp
,
5245 fixup_symbol_section (sym
, objfile
),
5254 if (!found_sym
&& arg_sym
!= NULL
)
5256 add_defn_to_vec (obstackp
,
5257 fixup_symbol_section (arg_sym
, objfile
),
5266 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5268 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5269 SYMBOL_DOMAIN (sym
), domain
))
5273 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5276 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5278 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5283 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5285 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5287 if (SYMBOL_IS_ARGUMENT (sym
))
5292 add_defn_to_vec (obstackp
,
5293 fixup_symbol_section (sym
, objfile
),
5301 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5302 They aren't parameters, right? */
5303 if (!found_sym
&& arg_sym
!= NULL
)
5305 add_defn_to_vec (obstackp
,
5306 fixup_symbol_section (arg_sym
, objfile
),
5313 /* Symbol Completion */
5315 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5316 name in a form that's appropriate for the completion. The result
5317 does not need to be deallocated, but is only good until the next call.
5319 TEXT_LEN is equal to the length of TEXT.
5320 Perform a wild match if WILD_MATCH is set.
5321 ENCODED should be set if TEXT represents the start of a symbol name
5322 in its encoded form. */
5325 symbol_completion_match (const char *sym_name
,
5326 const char *text
, int text_len
,
5327 int wild_match
, int encoded
)
5330 const int verbatim_match
= (text
[0] == '<');
5335 /* Strip the leading angle bracket. */
5340 /* First, test against the fully qualified name of the symbol. */
5342 if (strncmp (sym_name
, text
, text_len
) == 0)
5345 if (match
&& !encoded
)
5347 /* One needed check before declaring a positive match is to verify
5348 that iff we are doing a verbatim match, the decoded version
5349 of the symbol name starts with '<'. Otherwise, this symbol name
5350 is not a suitable completion. */
5351 const char *sym_name_copy
= sym_name
;
5352 int has_angle_bracket
;
5354 sym_name
= ada_decode (sym_name
);
5355 has_angle_bracket
= (sym_name
[0] == '<');
5356 match
= (has_angle_bracket
== verbatim_match
);
5357 sym_name
= sym_name_copy
;
5360 if (match
&& !verbatim_match
)
5362 /* When doing non-verbatim match, another check that needs to
5363 be done is to verify that the potentially matching symbol name
5364 does not include capital letters, because the ada-mode would
5365 not be able to understand these symbol names without the
5366 angle bracket notation. */
5369 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5374 /* Second: Try wild matching... */
5376 if (!match
&& wild_match
)
5378 /* Since we are doing wild matching, this means that TEXT
5379 may represent an unqualified symbol name. We therefore must
5380 also compare TEXT against the unqualified name of the symbol. */
5381 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5383 if (strncmp (sym_name
, text
, text_len
) == 0)
5387 /* Finally: If we found a mach, prepare the result to return. */
5393 sym_name
= add_angle_brackets (sym_name
);
5396 sym_name
= ada_decode (sym_name
);
5401 typedef char *char_ptr
;
5402 DEF_VEC_P (char_ptr
);
5404 /* A companion function to ada_make_symbol_completion_list().
5405 Check if SYM_NAME represents a symbol which name would be suitable
5406 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5407 it is appended at the end of the given string vector SV.
5409 ORIG_TEXT is the string original string from the user command
5410 that needs to be completed. WORD is the entire command on which
5411 completion should be performed. These two parameters are used to
5412 determine which part of the symbol name should be added to the
5414 if WILD_MATCH is set, then wild matching is performed.
5415 ENCODED should be set if TEXT represents a symbol name in its
5416 encoded formed (in which case the completion should also be
5420 symbol_completion_add (VEC(char_ptr
) **sv
,
5421 const char *sym_name
,
5422 const char *text
, int text_len
,
5423 const char *orig_text
, const char *word
,
5424 int wild_match
, int encoded
)
5426 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5427 wild_match
, encoded
);
5433 /* We found a match, so add the appropriate completion to the given
5436 if (word
== orig_text
)
5438 completion
= xmalloc (strlen (match
) + 5);
5439 strcpy (completion
, match
);
5441 else if (word
> orig_text
)
5443 /* Return some portion of sym_name. */
5444 completion
= xmalloc (strlen (match
) + 5);
5445 strcpy (completion
, match
+ (word
- orig_text
));
5449 /* Return some of ORIG_TEXT plus sym_name. */
5450 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5451 strncpy (completion
, word
, orig_text
- word
);
5452 completion
[orig_text
- word
] = '\0';
5453 strcat (completion
, match
);
5456 VEC_safe_push (char_ptr
, *sv
, completion
);
5459 /* Return a list of possible symbol names completing TEXT0. The list
5460 is NULL terminated. WORD is the entire command on which completion
5464 ada_make_symbol_completion_list (char *text0
, char *word
)
5470 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5473 struct partial_symtab
*ps
;
5474 struct minimal_symbol
*msymbol
;
5475 struct objfile
*objfile
;
5476 struct block
*b
, *surrounding_static_block
= 0;
5478 struct dict_iterator iter
;
5480 if (text0
[0] == '<')
5482 text
= xstrdup (text0
);
5483 make_cleanup (xfree
, text
);
5484 text_len
= strlen (text
);
5490 text
= xstrdup (ada_encode (text0
));
5491 make_cleanup (xfree
, text
);
5492 text_len
= strlen (text
);
5493 for (i
= 0; i
< text_len
; i
++)
5494 text
[i
] = tolower (text
[i
]);
5496 encoded
= (strstr (text0
, "__") != NULL
);
5497 /* If the name contains a ".", then the user is entering a fully
5498 qualified entity name, and the match must not be done in wild
5499 mode. Similarly, if the user wants to complete what looks like
5500 an encoded name, the match must not be done in wild mode. */
5501 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5504 /* First, look at the partial symtab symbols. */
5505 ALL_PSYMTABS (objfile
, ps
)
5507 struct partial_symbol
**psym
;
5509 /* If the psymtab's been read in we'll get it when we search
5510 through the blockvector. */
5514 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5515 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5516 + ps
->n_global_syms
); psym
++)
5519 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5520 text
, text_len
, text0
, word
,
5521 wild_match
, encoded
);
5524 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5525 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5526 + ps
->n_static_syms
); psym
++)
5529 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5530 text
, text_len
, text0
, word
,
5531 wild_match
, encoded
);
5535 /* At this point scan through the misc symbol vectors and add each
5536 symbol you find to the list. Eventually we want to ignore
5537 anything that isn't a text symbol (everything else will be
5538 handled by the psymtab code above). */
5540 ALL_MSYMBOLS (objfile
, msymbol
)
5543 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5544 text
, text_len
, text0
, word
, wild_match
, encoded
);
5547 /* Search upwards from currently selected frame (so that we can
5548 complete on local vars. */
5550 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5552 if (!BLOCK_SUPERBLOCK (b
))
5553 surrounding_static_block
= b
; /* For elmin of dups */
5555 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5557 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5558 text
, text_len
, text0
, word
,
5559 wild_match
, encoded
);
5563 /* Go through the symtabs and check the externs and statics for
5564 symbols which match. */
5566 ALL_SYMTABS (objfile
, s
)
5569 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5570 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5572 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5573 text
, text_len
, text0
, word
,
5574 wild_match
, encoded
);
5578 ALL_SYMTABS (objfile
, s
)
5581 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5582 /* Don't do this block twice. */
5583 if (b
== surrounding_static_block
)
5585 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5587 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5588 text
, text_len
, text0
, word
,
5589 wild_match
, encoded
);
5593 /* Append the closing NULL entry. */
5594 VEC_safe_push (char_ptr
, completions
, NULL
);
5596 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5597 return the copy. It's unfortunate that we have to make a copy
5598 of an array that we're about to destroy, but there is nothing much
5599 we can do about it. Fortunately, it's typically not a very large
5602 const size_t completions_size
=
5603 VEC_length (char_ptr
, completions
) * sizeof (char *);
5604 char **result
= malloc (completions_size
);
5606 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5608 VEC_free (char_ptr
, completions
);
5615 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5616 for tagged types. */
5619 ada_is_dispatch_table_ptr_type (struct type
*type
)
5623 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5626 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5630 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5633 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5634 to be invisible to users. */
5637 ada_is_ignored_field (struct type
*type
, int field_num
)
5639 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5642 /* Check the name of that field. */
5644 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5646 /* Anonymous field names should not be printed.
5647 brobecker/2007-02-20: I don't think this can actually happen
5648 but we don't want to print the value of annonymous fields anyway. */
5652 /* A field named "_parent" is internally generated by GNAT for
5653 tagged types, and should not be printed either. */
5654 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5658 /* If this is the dispatch table of a tagged type, then ignore. */
5659 if (ada_is_tagged_type (type
, 1)
5660 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5663 /* Not a special field, so it should not be ignored. */
5667 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5668 pointer or reference type whose ultimate target has a tag field. */
5671 ada_is_tagged_type (struct type
*type
, int refok
)
5673 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5676 /* True iff TYPE represents the type of X'Tag */
5679 ada_is_tag_type (struct type
*type
)
5681 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5685 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5686 return (name
!= NULL
5687 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5691 /* The type of the tag on VAL. */
5694 ada_tag_type (struct value
*val
)
5696 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5699 /* The value of the tag on VAL. */
5702 ada_value_tag (struct value
*val
)
5704 return ada_value_struct_elt (val
, "_tag", 0);
5707 /* The value of the tag on the object of type TYPE whose contents are
5708 saved at VALADDR, if it is non-null, or is at memory address
5711 static struct value
*
5712 value_tag_from_contents_and_address (struct type
*type
,
5713 const gdb_byte
*valaddr
,
5716 int tag_byte_offset
, dummy1
, dummy2
;
5717 struct type
*tag_type
;
5718 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5721 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5723 : valaddr
+ tag_byte_offset
);
5724 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5726 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5731 static struct type
*
5732 type_from_tag (struct value
*tag
)
5734 const char *type_name
= ada_tag_name (tag
);
5735 if (type_name
!= NULL
)
5736 return ada_find_any_type (ada_encode (type_name
));
5747 static int ada_tag_name_1 (void *);
5748 static int ada_tag_name_2 (struct tag_args
*);
5750 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5751 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5752 The value stored in ARGS->name is valid until the next call to
5756 ada_tag_name_1 (void *args0
)
5758 struct tag_args
*args
= (struct tag_args
*) args0
;
5759 static char name
[1024];
5763 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5765 return ada_tag_name_2 (args
);
5766 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5769 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5770 for (p
= name
; *p
!= '\0'; p
+= 1)
5777 /* Utility function for ada_tag_name_1 that tries the second
5778 representation for the dispatch table (in which there is no
5779 explicit 'tsd' field in the referent of the tag pointer, and instead
5780 the tsd pointer is stored just before the dispatch table. */
5783 ada_tag_name_2 (struct tag_args
*args
)
5785 struct type
*info_type
;
5786 static char name
[1024];
5788 struct value
*val
, *valp
;
5791 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5792 if (info_type
== NULL
)
5794 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5795 valp
= value_cast (info_type
, args
->tag
);
5798 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5801 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5804 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5805 for (p
= name
; *p
!= '\0'; p
+= 1)
5812 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5816 ada_tag_name (struct value
*tag
)
5818 struct tag_args args
;
5819 if (!ada_is_tag_type (value_type (tag
)))
5823 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5827 /* The parent type of TYPE, or NULL if none. */
5830 ada_parent_type (struct type
*type
)
5834 type
= ada_check_typedef (type
);
5836 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5839 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5840 if (ada_is_parent_field (type
, i
))
5841 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5846 /* True iff field number FIELD_NUM of structure type TYPE contains the
5847 parent-type (inherited) fields of a derived type. Assumes TYPE is
5848 a structure type with at least FIELD_NUM+1 fields. */
5851 ada_is_parent_field (struct type
*type
, int field_num
)
5853 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5854 return (name
!= NULL
5855 && (strncmp (name
, "PARENT", 6) == 0
5856 || strncmp (name
, "_parent", 7) == 0));
5859 /* True iff field number FIELD_NUM of structure type TYPE is a
5860 transparent wrapper field (which should be silently traversed when doing
5861 field selection and flattened when printing). Assumes TYPE is a
5862 structure type with at least FIELD_NUM+1 fields. Such fields are always
5866 ada_is_wrapper_field (struct type
*type
, int field_num
)
5868 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5869 return (name
!= NULL
5870 && (strncmp (name
, "PARENT", 6) == 0
5871 || strcmp (name
, "REP") == 0
5872 || strncmp (name
, "_parent", 7) == 0
5873 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5876 /* True iff field number FIELD_NUM of structure or union type TYPE
5877 is a variant wrapper. Assumes TYPE is a structure type with at least
5878 FIELD_NUM+1 fields. */
5881 ada_is_variant_part (struct type
*type
, int field_num
)
5883 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5884 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5885 || (is_dynamic_field (type
, field_num
)
5886 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5887 == TYPE_CODE_UNION
)));
5890 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5891 whose discriminants are contained in the record type OUTER_TYPE,
5892 returns the type of the controlling discriminant for the variant. */
5895 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5897 char *name
= ada_variant_discrim_name (var_type
);
5899 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5901 return builtin_type_int
;
5906 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5907 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5908 represents a 'when others' clause; otherwise 0. */
5911 ada_is_others_clause (struct type
*type
, int field_num
)
5913 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5914 return (name
!= NULL
&& name
[0] == 'O');
5917 /* Assuming that TYPE0 is the type of the variant part of a record,
5918 returns the name of the discriminant controlling the variant.
5919 The value is valid until the next call to ada_variant_discrim_name. */
5922 ada_variant_discrim_name (struct type
*type0
)
5924 static char *result
= NULL
;
5925 static size_t result_len
= 0;
5928 const char *discrim_end
;
5929 const char *discrim_start
;
5931 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5932 type
= TYPE_TARGET_TYPE (type0
);
5936 name
= ada_type_name (type
);
5938 if (name
== NULL
|| name
[0] == '\000')
5941 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5944 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5947 if (discrim_end
== name
)
5950 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5953 if (discrim_start
== name
+ 1)
5955 if ((discrim_start
> name
+ 3
5956 && strncmp (discrim_start
- 3, "___", 3) == 0)
5957 || discrim_start
[-1] == '.')
5961 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5962 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5963 result
[discrim_end
- discrim_start
] = '\0';
5967 /* Scan STR for a subtype-encoded number, beginning at position K.
5968 Put the position of the character just past the number scanned in
5969 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5970 Return 1 if there was a valid number at the given position, and 0
5971 otherwise. A "subtype-encoded" number consists of the absolute value
5972 in decimal, followed by the letter 'm' to indicate a negative number.
5973 Assumes 0m does not occur. */
5976 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5980 if (!isdigit (str
[k
]))
5983 /* Do it the hard way so as not to make any assumption about
5984 the relationship of unsigned long (%lu scan format code) and
5987 while (isdigit (str
[k
]))
5989 RU
= RU
* 10 + (str
[k
] - '0');
5996 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6002 /* NOTE on the above: Technically, C does not say what the results of
6003 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6004 number representable as a LONGEST (although either would probably work
6005 in most implementations). When RU>0, the locution in the then branch
6006 above is always equivalent to the negative of RU. */
6013 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6014 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6015 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6018 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6020 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6033 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6042 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6043 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6045 if (val
>= L
&& val
<= U
)
6057 /* FIXME: Lots of redundancy below. Try to consolidate. */
6059 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6060 ARG_TYPE, extract and return the value of one of its (non-static)
6061 fields. FIELDNO says which field. Differs from value_primitive_field
6062 only in that it can handle packed values of arbitrary type. */
6064 static struct value
*
6065 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6066 struct type
*arg_type
)
6070 arg_type
= ada_check_typedef (arg_type
);
6071 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6073 /* Handle packed fields. */
6075 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6077 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6078 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6080 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6081 offset
+ bit_pos
/ 8,
6082 bit_pos
% 8, bit_size
, type
);
6085 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6088 /* Find field with name NAME in object of type TYPE. If found,
6089 set the following for each argument that is non-null:
6090 - *FIELD_TYPE_P to the field's type;
6091 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6092 an object of that type;
6093 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6094 - *BIT_SIZE_P to its size in bits if the field is packed, and
6096 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6097 fields up to but not including the desired field, or by the total
6098 number of fields if not found. A NULL value of NAME never
6099 matches; the function just counts visible fields in this case.
6101 Returns 1 if found, 0 otherwise. */
6104 find_struct_field (char *name
, struct type
*type
, int offset
,
6105 struct type
**field_type_p
,
6106 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6111 type
= ada_check_typedef (type
);
6113 if (field_type_p
!= NULL
)
6114 *field_type_p
= NULL
;
6115 if (byte_offset_p
!= NULL
)
6117 if (bit_offset_p
!= NULL
)
6119 if (bit_size_p
!= NULL
)
6122 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6124 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6125 int fld_offset
= offset
+ bit_pos
/ 8;
6126 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6128 if (t_field_name
== NULL
)
6131 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6133 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6134 if (field_type_p
!= NULL
)
6135 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6136 if (byte_offset_p
!= NULL
)
6137 *byte_offset_p
= fld_offset
;
6138 if (bit_offset_p
!= NULL
)
6139 *bit_offset_p
= bit_pos
% 8;
6140 if (bit_size_p
!= NULL
)
6141 *bit_size_p
= bit_size
;
6144 else if (ada_is_wrapper_field (type
, i
))
6146 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6147 field_type_p
, byte_offset_p
, bit_offset_p
,
6148 bit_size_p
, index_p
))
6151 else if (ada_is_variant_part (type
, i
))
6153 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6156 struct type
*field_type
6157 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6159 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6161 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6163 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6164 field_type_p
, byte_offset_p
,
6165 bit_offset_p
, bit_size_p
, index_p
))
6169 else if (index_p
!= NULL
)
6175 /* Number of user-visible fields in record type TYPE. */
6178 num_visible_fields (struct type
*type
)
6182 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6186 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6187 and search in it assuming it has (class) type TYPE.
6188 If found, return value, else return NULL.
6190 Searches recursively through wrapper fields (e.g., '_parent'). */
6192 static struct value
*
6193 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6197 type
= ada_check_typedef (type
);
6199 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6201 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6203 if (t_field_name
== NULL
)
6206 else if (field_name_match (t_field_name
, name
))
6207 return ada_value_primitive_field (arg
, offset
, i
, type
);
6209 else if (ada_is_wrapper_field (type
, i
))
6211 struct value
*v
= /* Do not let indent join lines here. */
6212 ada_search_struct_field (name
, arg
,
6213 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6214 TYPE_FIELD_TYPE (type
, i
));
6219 else if (ada_is_variant_part (type
, i
))
6221 /* PNH: Do we ever get here? See find_struct_field. */
6223 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6224 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6226 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6228 struct value
*v
= ada_search_struct_field
/* Force line break. */
6230 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6231 TYPE_FIELD_TYPE (field_type
, j
));
6240 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6241 int, struct type
*);
6244 /* Return field #INDEX in ARG, where the index is that returned by
6245 * find_struct_field through its INDEX_P argument. Adjust the address
6246 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6247 * If found, return value, else return NULL. */
6249 static struct value
*
6250 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6253 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6257 /* Auxiliary function for ada_index_struct_field. Like
6258 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6261 static struct value
*
6262 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6266 type
= ada_check_typedef (type
);
6268 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6270 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6272 else if (ada_is_wrapper_field (type
, i
))
6274 struct value
*v
= /* Do not let indent join lines here. */
6275 ada_index_struct_field_1 (index_p
, arg
,
6276 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6277 TYPE_FIELD_TYPE (type
, i
));
6282 else if (ada_is_variant_part (type
, i
))
6284 /* PNH: Do we ever get here? See ada_search_struct_field,
6285 find_struct_field. */
6286 error (_("Cannot assign this kind of variant record"));
6288 else if (*index_p
== 0)
6289 return ada_value_primitive_field (arg
, offset
, i
, type
);
6296 /* Given ARG, a value of type (pointer or reference to a)*
6297 structure/union, extract the component named NAME from the ultimate
6298 target structure/union and return it as a value with its
6299 appropriate type. If ARG is a pointer or reference and the field
6300 is not packed, returns a reference to the field, otherwise the
6301 value of the field (an lvalue if ARG is an lvalue).
6303 The routine searches for NAME among all members of the structure itself
6304 and (recursively) among all members of any wrapper members
6307 If NO_ERR, then simply return NULL in case of error, rather than
6311 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6313 struct type
*t
, *t1
;
6317 t1
= t
= ada_check_typedef (value_type (arg
));
6318 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6320 t1
= TYPE_TARGET_TYPE (t
);
6323 t1
= ada_check_typedef (t1
);
6324 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6326 arg
= coerce_ref (arg
);
6331 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6333 t1
= TYPE_TARGET_TYPE (t
);
6336 t1
= ada_check_typedef (t1
);
6337 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6339 arg
= value_ind (arg
);
6346 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6350 v
= ada_search_struct_field (name
, arg
, 0, t
);
6353 int bit_offset
, bit_size
, byte_offset
;
6354 struct type
*field_type
;
6357 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6358 address
= value_as_address (arg
);
6360 address
= unpack_pointer (t
, value_contents (arg
));
6362 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6363 if (find_struct_field (name
, t1
, 0,
6364 &field_type
, &byte_offset
, &bit_offset
,
6369 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6370 arg
= ada_coerce_ref (arg
);
6372 arg
= ada_value_ind (arg
);
6373 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6374 bit_offset
, bit_size
,
6378 v
= value_from_pointer (lookup_reference_type (field_type
),
6379 address
+ byte_offset
);
6383 if (v
!= NULL
|| no_err
)
6386 error (_("There is no member named %s."), name
);
6392 error (_("Attempt to extract a component of a value that is not a record."));
6395 /* Given a type TYPE, look up the type of the component of type named NAME.
6396 If DISPP is non-null, add its byte displacement from the beginning of a
6397 structure (pointed to by a value) of type TYPE to *DISPP (does not
6398 work for packed fields).
6400 Matches any field whose name has NAME as a prefix, possibly
6403 TYPE can be either a struct or union. If REFOK, TYPE may also
6404 be a (pointer or reference)+ to a struct or union, and the
6405 ultimate target type will be searched.
6407 Looks recursively into variant clauses and parent types.
6409 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6410 TYPE is not a type of the right kind. */
6412 static struct type
*
6413 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6414 int noerr
, int *dispp
)
6421 if (refok
&& type
!= NULL
)
6424 type
= ada_check_typedef (type
);
6425 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6426 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6428 type
= TYPE_TARGET_TYPE (type
);
6432 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6433 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6439 target_terminal_ours ();
6440 gdb_flush (gdb_stdout
);
6442 error (_("Type (null) is not a structure or union type"));
6445 /* XXX: type_sprint */
6446 fprintf_unfiltered (gdb_stderr
, _("Type "));
6447 type_print (type
, "", gdb_stderr
, -1);
6448 error (_(" is not a structure or union type"));
6453 type
= to_static_fixed_type (type
);
6455 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6457 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6461 if (t_field_name
== NULL
)
6464 else if (field_name_match (t_field_name
, name
))
6467 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6468 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6471 else if (ada_is_wrapper_field (type
, i
))
6474 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6479 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6484 else if (ada_is_variant_part (type
, i
))
6487 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6489 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6492 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6497 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6508 target_terminal_ours ();
6509 gdb_flush (gdb_stdout
);
6512 /* XXX: type_sprint */
6513 fprintf_unfiltered (gdb_stderr
, _("Type "));
6514 type_print (type
, "", gdb_stderr
, -1);
6515 error (_(" has no component named <null>"));
6519 /* XXX: type_sprint */
6520 fprintf_unfiltered (gdb_stderr
, _("Type "));
6521 type_print (type
, "", gdb_stderr
, -1);
6522 error (_(" has no component named %s"), name
);
6529 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6530 within a value of type OUTER_TYPE that is stored in GDB at
6531 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6532 numbering from 0) is applicable. Returns -1 if none are. */
6535 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6536 const gdb_byte
*outer_valaddr
)
6540 char *discrim_name
= ada_variant_discrim_name (var_type
);
6541 struct value
*outer
;
6542 struct value
*discrim
;
6543 LONGEST discrim_val
;
6545 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6546 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6547 if (discrim
== NULL
)
6549 discrim_val
= value_as_long (discrim
);
6552 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6554 if (ada_is_others_clause (var_type
, i
))
6556 else if (ada_in_variant (discrim_val
, var_type
, i
))
6560 return others_clause
;
6565 /* Dynamic-Sized Records */
6567 /* Strategy: The type ostensibly attached to a value with dynamic size
6568 (i.e., a size that is not statically recorded in the debugging
6569 data) does not accurately reflect the size or layout of the value.
6570 Our strategy is to convert these values to values with accurate,
6571 conventional types that are constructed on the fly. */
6573 /* There is a subtle and tricky problem here. In general, we cannot
6574 determine the size of dynamic records without its data. However,
6575 the 'struct value' data structure, which GDB uses to represent
6576 quantities in the inferior process (the target), requires the size
6577 of the type at the time of its allocation in order to reserve space
6578 for GDB's internal copy of the data. That's why the
6579 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6580 rather than struct value*s.
6582 However, GDB's internal history variables ($1, $2, etc.) are
6583 struct value*s containing internal copies of the data that are not, in
6584 general, the same as the data at their corresponding addresses in
6585 the target. Fortunately, the types we give to these values are all
6586 conventional, fixed-size types (as per the strategy described
6587 above), so that we don't usually have to perform the
6588 'to_fixed_xxx_type' conversions to look at their values.
6589 Unfortunately, there is one exception: if one of the internal
6590 history variables is an array whose elements are unconstrained
6591 records, then we will need to create distinct fixed types for each
6592 element selected. */
6594 /* The upshot of all of this is that many routines take a (type, host
6595 address, target address) triple as arguments to represent a value.
6596 The host address, if non-null, is supposed to contain an internal
6597 copy of the relevant data; otherwise, the program is to consult the
6598 target at the target address. */
6600 /* Assuming that VAL0 represents a pointer value, the result of
6601 dereferencing it. Differs from value_ind in its treatment of
6602 dynamic-sized types. */
6605 ada_value_ind (struct value
*val0
)
6607 struct value
*val
= unwrap_value (value_ind (val0
));
6608 return ada_to_fixed_value (val
);
6611 /* The value resulting from dereferencing any "reference to"
6612 qualifiers on VAL0. */
6614 static struct value
*
6615 ada_coerce_ref (struct value
*val0
)
6617 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6619 struct value
*val
= val0
;
6620 val
= coerce_ref (val
);
6621 val
= unwrap_value (val
);
6622 return ada_to_fixed_value (val
);
6628 /* Return OFF rounded upward if necessary to a multiple of
6629 ALIGNMENT (a power of 2). */
6632 align_value (unsigned int off
, unsigned int alignment
)
6634 return (off
+ alignment
- 1) & ~(alignment
- 1);
6637 /* Return the bit alignment required for field #F of template type TYPE. */
6640 field_alignment (struct type
*type
, int f
)
6642 const char *name
= TYPE_FIELD_NAME (type
, f
);
6646 /* The field name should never be null, unless the debugging information
6647 is somehow malformed. In this case, we assume the field does not
6648 require any alignment. */
6652 len
= strlen (name
);
6654 if (!isdigit (name
[len
- 1]))
6657 if (isdigit (name
[len
- 2]))
6658 align_offset
= len
- 2;
6660 align_offset
= len
- 1;
6662 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6663 return TARGET_CHAR_BIT
;
6665 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6668 /* Find a symbol named NAME. Ignores ambiguity. */
6671 ada_find_any_symbol (const char *name
)
6675 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6676 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6679 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6683 /* Find a type named NAME. Ignores ambiguity. */
6686 ada_find_any_type (const char *name
)
6688 struct symbol
*sym
= ada_find_any_symbol (name
);
6691 return SYMBOL_TYPE (sym
);
6696 /* Given NAME and an associated BLOCK, search all symbols for
6697 NAME suffixed with "___XR", which is the ``renaming'' symbol
6698 associated to NAME. Return this symbol if found, return
6702 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6706 sym
= find_old_style_renaming_symbol (name
, block
);
6711 /* Not right yet. FIXME pnh 7/20/2007. */
6712 sym
= ada_find_any_symbol (name
);
6713 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6719 static struct symbol
*
6720 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6722 const struct symbol
*function_sym
= block_function (block
);
6725 if (function_sym
!= NULL
)
6727 /* If the symbol is defined inside a function, NAME is not fully
6728 qualified. This means we need to prepend the function name
6729 as well as adding the ``___XR'' suffix to build the name of
6730 the associated renaming symbol. */
6731 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6732 /* Function names sometimes contain suffixes used
6733 for instance to qualify nested subprograms. When building
6734 the XR type name, we need to make sure that this suffix is
6735 not included. So do not include any suffix in the function
6736 name length below. */
6737 const int function_name_len
= ada_name_prefix_len (function_name
);
6738 const int rename_len
= function_name_len
+ 2 /* "__" */
6739 + strlen (name
) + 6 /* "___XR\0" */ ;
6741 /* Strip the suffix if necessary. */
6742 function_name
[function_name_len
] = '\0';
6744 /* Library-level functions are a special case, as GNAT adds
6745 a ``_ada_'' prefix to the function name to avoid namespace
6746 pollution. However, the renaming symbols themselves do not
6747 have this prefix, so we need to skip this prefix if present. */
6748 if (function_name_len
> 5 /* "_ada_" */
6749 && strstr (function_name
, "_ada_") == function_name
)
6750 function_name
= function_name
+ 5;
6752 rename
= (char *) alloca (rename_len
* sizeof (char));
6753 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6757 const int rename_len
= strlen (name
) + 6;
6758 rename
= (char *) alloca (rename_len
* sizeof (char));
6759 sprintf (rename
, "%s___XR", name
);
6762 return ada_find_any_symbol (rename
);
6765 /* Because of GNAT encoding conventions, several GDB symbols may match a
6766 given type name. If the type denoted by TYPE0 is to be preferred to
6767 that of TYPE1 for purposes of type printing, return non-zero;
6768 otherwise return 0. */
6771 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6775 else if (type0
== NULL
)
6777 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6779 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6781 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6783 else if (ada_is_packed_array_type (type0
))
6785 else if (ada_is_array_descriptor_type (type0
)
6786 && !ada_is_array_descriptor_type (type1
))
6790 const char *type0_name
= type_name_no_tag (type0
);
6791 const char *type1_name
= type_name_no_tag (type1
);
6793 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6794 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6800 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6801 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6804 ada_type_name (struct type
*type
)
6808 else if (TYPE_NAME (type
) != NULL
)
6809 return TYPE_NAME (type
);
6811 return TYPE_TAG_NAME (type
);
6814 /* Find a parallel type to TYPE whose name is formed by appending
6815 SUFFIX to the name of TYPE. */
6818 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6821 static size_t name_len
= 0;
6823 char *typename
= ada_type_name (type
);
6825 if (typename
== NULL
)
6828 len
= strlen (typename
);
6830 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6832 strcpy (name
, typename
);
6833 strcpy (name
+ len
, suffix
);
6835 return ada_find_any_type (name
);
6839 /* If TYPE is a variable-size record type, return the corresponding template
6840 type describing its fields. Otherwise, return NULL. */
6842 static struct type
*
6843 dynamic_template_type (struct type
*type
)
6845 type
= ada_check_typedef (type
);
6847 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6848 || ada_type_name (type
) == NULL
)
6852 int len
= strlen (ada_type_name (type
));
6853 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6856 return ada_find_parallel_type (type
, "___XVE");
6860 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6861 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6864 is_dynamic_field (struct type
*templ_type
, int field_num
)
6866 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6868 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6869 && strstr (name
, "___XVL") != NULL
;
6872 /* The index of the variant field of TYPE, or -1 if TYPE does not
6873 represent a variant record type. */
6876 variant_field_index (struct type
*type
)
6880 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6883 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6885 if (ada_is_variant_part (type
, f
))
6891 /* A record type with no fields. */
6893 static struct type
*
6894 empty_record (struct objfile
*objfile
)
6896 struct type
*type
= alloc_type (objfile
);
6897 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6898 TYPE_NFIELDS (type
) = 0;
6899 TYPE_FIELDS (type
) = NULL
;
6900 TYPE_NAME (type
) = "<empty>";
6901 TYPE_TAG_NAME (type
) = NULL
;
6902 TYPE_FLAGS (type
) = 0;
6903 TYPE_LENGTH (type
) = 0;
6907 /* An ordinary record type (with fixed-length fields) that describes
6908 the value of type TYPE at VALADDR or ADDRESS (see comments at
6909 the beginning of this section) VAL according to GNAT conventions.
6910 DVAL0 should describe the (portion of a) record that contains any
6911 necessary discriminants. It should be NULL if value_type (VAL) is
6912 an outer-level type (i.e., as opposed to a branch of a variant.) A
6913 variant field (unless unchecked) is replaced by a particular branch
6916 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6917 length are not statically known are discarded. As a consequence,
6918 VALADDR, ADDRESS and DVAL0 are ignored.
6920 NOTE: Limitations: For now, we assume that dynamic fields and
6921 variants occupy whole numbers of bytes. However, they need not be
6925 ada_template_to_fixed_record_type_1 (struct type
*type
,
6926 const gdb_byte
*valaddr
,
6927 CORE_ADDR address
, struct value
*dval0
,
6928 int keep_dynamic_fields
)
6930 struct value
*mark
= value_mark ();
6933 int nfields
, bit_len
;
6936 int fld_bit_len
, bit_incr
;
6939 /* Compute the number of fields in this record type that are going
6940 to be processed: unless keep_dynamic_fields, this includes only
6941 fields whose position and length are static will be processed. */
6942 if (keep_dynamic_fields
)
6943 nfields
= TYPE_NFIELDS (type
);
6947 while (nfields
< TYPE_NFIELDS (type
)
6948 && !ada_is_variant_part (type
, nfields
)
6949 && !is_dynamic_field (type
, nfields
))
6953 rtype
= alloc_type (TYPE_OBJFILE (type
));
6954 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6955 INIT_CPLUS_SPECIFIC (rtype
);
6956 TYPE_NFIELDS (rtype
) = nfields
;
6957 TYPE_FIELDS (rtype
) = (struct field
*)
6958 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6959 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6960 TYPE_NAME (rtype
) = ada_type_name (type
);
6961 TYPE_TAG_NAME (rtype
) = NULL
;
6962 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6968 for (f
= 0; f
< nfields
; f
+= 1)
6970 off
= align_value (off
, field_alignment (type
, f
))
6971 + TYPE_FIELD_BITPOS (type
, f
);
6972 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6973 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6975 if (ada_is_variant_part (type
, f
))
6978 fld_bit_len
= bit_incr
= 0;
6980 else if (is_dynamic_field (type
, f
))
6983 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6987 /* Get the fixed type of the field. Note that, in this case, we
6988 do not want to get the real type out of the tag: if the current
6989 field is the parent part of a tagged record, we will get the
6990 tag of the object. Clearly wrong: the real type of the parent
6991 is not the real type of the child. We would end up in an infinite
6993 TYPE_FIELD_TYPE (rtype
, f
) =
6996 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6997 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6998 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6999 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7000 bit_incr
= fld_bit_len
=
7001 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7005 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7006 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7007 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7008 bit_incr
= fld_bit_len
=
7009 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7011 bit_incr
= fld_bit_len
=
7012 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
7014 if (off
+ fld_bit_len
> bit_len
)
7015 bit_len
= off
+ fld_bit_len
;
7017 TYPE_LENGTH (rtype
) =
7018 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7021 /* We handle the variant part, if any, at the end because of certain
7022 odd cases in which it is re-ordered so as NOT the last field of
7023 the record. This can happen in the presence of representation
7025 if (variant_field
>= 0)
7027 struct type
*branch_type
;
7029 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7032 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7037 to_fixed_variant_branch_type
7038 (TYPE_FIELD_TYPE (type
, variant_field
),
7039 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7040 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7041 if (branch_type
== NULL
)
7043 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7044 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7045 TYPE_NFIELDS (rtype
) -= 1;
7049 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7050 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7052 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7054 if (off
+ fld_bit_len
> bit_len
)
7055 bit_len
= off
+ fld_bit_len
;
7056 TYPE_LENGTH (rtype
) =
7057 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7061 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7062 should contain the alignment of that record, which should be a strictly
7063 positive value. If null or negative, then something is wrong, most
7064 probably in the debug info. In that case, we don't round up the size
7065 of the resulting type. If this record is not part of another structure,
7066 the current RTYPE length might be good enough for our purposes. */
7067 if (TYPE_LENGTH (type
) <= 0)
7069 if (TYPE_NAME (rtype
))
7070 warning (_("Invalid type size for `%s' detected: %d."),
7071 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7073 warning (_("Invalid type size for <unnamed> detected: %d."),
7074 TYPE_LENGTH (type
));
7078 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7079 TYPE_LENGTH (type
));
7082 value_free_to_mark (mark
);
7083 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7084 error (_("record type with dynamic size is larger than varsize-limit"));
7088 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7091 static struct type
*
7092 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7093 CORE_ADDR address
, struct value
*dval0
)
7095 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7099 /* An ordinary record type in which ___XVL-convention fields and
7100 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7101 static approximations, containing all possible fields. Uses
7102 no runtime values. Useless for use in values, but that's OK,
7103 since the results are used only for type determinations. Works on both
7104 structs and unions. Representation note: to save space, we memorize
7105 the result of this function in the TYPE_TARGET_TYPE of the
7108 static struct type
*
7109 template_to_static_fixed_type (struct type
*type0
)
7115 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7116 return TYPE_TARGET_TYPE (type0
);
7118 nfields
= TYPE_NFIELDS (type0
);
7121 for (f
= 0; f
< nfields
; f
+= 1)
7123 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7124 struct type
*new_type
;
7126 if (is_dynamic_field (type0
, f
))
7127 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7129 new_type
= static_unwrap_type (field_type
);
7130 if (type
== type0
&& new_type
!= field_type
)
7132 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
7133 TYPE_CODE (type
) = TYPE_CODE (type0
);
7134 INIT_CPLUS_SPECIFIC (type
);
7135 TYPE_NFIELDS (type
) = nfields
;
7136 TYPE_FIELDS (type
) = (struct field
*)
7137 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7138 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7139 sizeof (struct field
) * nfields
);
7140 TYPE_NAME (type
) = ada_type_name (type0
);
7141 TYPE_TAG_NAME (type
) = NULL
;
7142 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
7143 TYPE_LENGTH (type
) = 0;
7145 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7146 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7151 /* Given an object of type TYPE whose contents are at VALADDR and
7152 whose address in memory is ADDRESS, returns a revision of TYPE --
7153 a non-dynamic-sized record with a variant part -- in which
7154 the variant part is replaced with the appropriate branch. Looks
7155 for discriminant values in DVAL0, which can be NULL if the record
7156 contains the necessary discriminant values. */
7158 static struct type
*
7159 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7160 CORE_ADDR address
, struct value
*dval0
)
7162 struct value
*mark
= value_mark ();
7165 struct type
*branch_type
;
7166 int nfields
= TYPE_NFIELDS (type
);
7167 int variant_field
= variant_field_index (type
);
7169 if (variant_field
== -1)
7173 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7177 rtype
= alloc_type (TYPE_OBJFILE (type
));
7178 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7179 INIT_CPLUS_SPECIFIC (rtype
);
7180 TYPE_NFIELDS (rtype
) = nfields
;
7181 TYPE_FIELDS (rtype
) =
7182 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7183 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7184 sizeof (struct field
) * nfields
);
7185 TYPE_NAME (rtype
) = ada_type_name (type
);
7186 TYPE_TAG_NAME (rtype
) = NULL
;
7187 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
7188 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7190 branch_type
= to_fixed_variant_branch_type
7191 (TYPE_FIELD_TYPE (type
, variant_field
),
7192 cond_offset_host (valaddr
,
7193 TYPE_FIELD_BITPOS (type
, variant_field
)
7195 cond_offset_target (address
,
7196 TYPE_FIELD_BITPOS (type
, variant_field
)
7197 / TARGET_CHAR_BIT
), dval
);
7198 if (branch_type
== NULL
)
7201 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7202 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7203 TYPE_NFIELDS (rtype
) -= 1;
7207 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7208 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7209 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7210 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7212 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7214 value_free_to_mark (mark
);
7218 /* An ordinary record type (with fixed-length fields) that describes
7219 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7220 beginning of this section]. Any necessary discriminants' values
7221 should be in DVAL, a record value; it may be NULL if the object
7222 at ADDR itself contains any necessary discriminant values.
7223 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7224 values from the record are needed. Except in the case that DVAL,
7225 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7226 unchecked) is replaced by a particular branch of the variant.
7228 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7229 is questionable and may be removed. It can arise during the
7230 processing of an unconstrained-array-of-record type where all the
7231 variant branches have exactly the same size. This is because in
7232 such cases, the compiler does not bother to use the XVS convention
7233 when encoding the record. I am currently dubious of this
7234 shortcut and suspect the compiler should be altered. FIXME. */
7236 static struct type
*
7237 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7238 CORE_ADDR address
, struct value
*dval
)
7240 struct type
*templ_type
;
7242 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7245 templ_type
= dynamic_template_type (type0
);
7247 if (templ_type
!= NULL
)
7248 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7249 else if (variant_field_index (type0
) >= 0)
7251 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7253 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7258 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
7264 /* An ordinary record type (with fixed-length fields) that describes
7265 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7266 union type. Any necessary discriminants' values should be in DVAL,
7267 a record value. That is, this routine selects the appropriate
7268 branch of the union at ADDR according to the discriminant value
7269 indicated in the union's type name. */
7271 static struct type
*
7272 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7273 CORE_ADDR address
, struct value
*dval
)
7276 struct type
*templ_type
;
7277 struct type
*var_type
;
7279 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7280 var_type
= TYPE_TARGET_TYPE (var_type0
);
7282 var_type
= var_type0
;
7284 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7286 if (templ_type
!= NULL
)
7287 var_type
= templ_type
;
7290 ada_which_variant_applies (var_type
,
7291 value_type (dval
), value_contents (dval
));
7294 return empty_record (TYPE_OBJFILE (var_type
));
7295 else if (is_dynamic_field (var_type
, which
))
7296 return to_fixed_record_type
7297 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7298 valaddr
, address
, dval
);
7299 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7301 to_fixed_record_type
7302 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7304 return TYPE_FIELD_TYPE (var_type
, which
);
7307 /* Assuming that TYPE0 is an array type describing the type of a value
7308 at ADDR, and that DVAL describes a record containing any
7309 discriminants used in TYPE0, returns a type for the value that
7310 contains no dynamic components (that is, no components whose sizes
7311 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7312 true, gives an error message if the resulting type's size is over
7315 static struct type
*
7316 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7319 struct type
*index_type_desc
;
7320 struct type
*result
;
7322 if (ada_is_packed_array_type (type0
) /* revisit? */
7323 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7326 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7327 if (index_type_desc
== NULL
)
7329 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7330 /* NOTE: elt_type---the fixed version of elt_type0---should never
7331 depend on the contents of the array in properly constructed
7333 /* Create a fixed version of the array element type.
7334 We're not providing the address of an element here,
7335 and thus the actual object value cannot be inspected to do
7336 the conversion. This should not be a problem, since arrays of
7337 unconstrained objects are not allowed. In particular, all
7338 the elements of an array of a tagged type should all be of
7339 the same type specified in the debugging info. No need to
7340 consult the object tag. */
7341 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7343 if (elt_type0
== elt_type
)
7346 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7347 elt_type
, TYPE_INDEX_TYPE (type0
));
7352 struct type
*elt_type0
;
7355 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7356 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7358 /* NOTE: result---the fixed version of elt_type0---should never
7359 depend on the contents of the array in properly constructed
7361 /* Create a fixed version of the array element type.
7362 We're not providing the address of an element here,
7363 and thus the actual object value cannot be inspected to do
7364 the conversion. This should not be a problem, since arrays of
7365 unconstrained objects are not allowed. In particular, all
7366 the elements of an array of a tagged type should all be of
7367 the same type specified in the debugging info. No need to
7368 consult the object tag. */
7370 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7371 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7373 struct type
*range_type
=
7374 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7375 dval
, TYPE_OBJFILE (type0
));
7376 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7377 result
, range_type
);
7379 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7380 error (_("array type with dynamic size is larger than varsize-limit"));
7383 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7388 /* A standard type (containing no dynamically sized components)
7389 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7390 DVAL describes a record containing any discriminants used in TYPE0,
7391 and may be NULL if there are none, or if the object of type TYPE at
7392 ADDRESS or in VALADDR contains these discriminants.
7394 If CHECK_TAG is not null, in the case of tagged types, this function
7395 attempts to locate the object's tag and use it to compute the actual
7396 type. However, when ADDRESS is null, we cannot use it to determine the
7397 location of the tag, and therefore compute the tagged type's actual type.
7398 So we return the tagged type without consulting the tag. */
7400 static struct type
*
7401 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7402 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7404 type
= ada_check_typedef (type
);
7405 switch (TYPE_CODE (type
))
7409 case TYPE_CODE_STRUCT
:
7411 struct type
*static_type
= to_static_fixed_type (type
);
7412 struct type
*fixed_record_type
=
7413 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7414 /* If STATIC_TYPE is a tagged type and we know the object's address,
7415 then we can determine its tag, and compute the object's actual
7416 type from there. Note that we have to use the fixed record
7417 type (the parent part of the record may have dynamic fields
7418 and the way the location of _tag is expressed may depend on
7421 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7423 struct type
*real_type
=
7424 type_from_tag (value_tag_from_contents_and_address
7428 if (real_type
!= NULL
)
7429 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7431 return fixed_record_type
;
7433 case TYPE_CODE_ARRAY
:
7434 return to_fixed_array_type (type
, dval
, 1);
7435 case TYPE_CODE_UNION
:
7439 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7443 /* The same as ada_to_fixed_type_1, except that it preserves the type
7444 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7445 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7448 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7449 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7452 struct type
*fixed_type
=
7453 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7455 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7456 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7462 /* A standard (static-sized) type corresponding as well as possible to
7463 TYPE0, but based on no runtime data. */
7465 static struct type
*
7466 to_static_fixed_type (struct type
*type0
)
7473 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7476 type0
= ada_check_typedef (type0
);
7478 switch (TYPE_CODE (type0
))
7482 case TYPE_CODE_STRUCT
:
7483 type
= dynamic_template_type (type0
);
7485 return template_to_static_fixed_type (type
);
7487 return template_to_static_fixed_type (type0
);
7488 case TYPE_CODE_UNION
:
7489 type
= ada_find_parallel_type (type0
, "___XVU");
7491 return template_to_static_fixed_type (type
);
7493 return template_to_static_fixed_type (type0
);
7497 /* A static approximation of TYPE with all type wrappers removed. */
7499 static struct type
*
7500 static_unwrap_type (struct type
*type
)
7502 if (ada_is_aligner_type (type
))
7504 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7505 if (ada_type_name (type1
) == NULL
)
7506 TYPE_NAME (type1
) = ada_type_name (type
);
7508 return static_unwrap_type (type1
);
7512 struct type
*raw_real_type
= ada_get_base_type (type
);
7513 if (raw_real_type
== type
)
7516 return to_static_fixed_type (raw_real_type
);
7520 /* In some cases, incomplete and private types require
7521 cross-references that are not resolved as records (for example,
7523 type FooP is access Foo;
7525 type Foo is array ...;
7526 ). In these cases, since there is no mechanism for producing
7527 cross-references to such types, we instead substitute for FooP a
7528 stub enumeration type that is nowhere resolved, and whose tag is
7529 the name of the actual type. Call these types "non-record stubs". */
7531 /* A type equivalent to TYPE that is not a non-record stub, if one
7532 exists, otherwise TYPE. */
7535 ada_check_typedef (struct type
*type
)
7540 CHECK_TYPEDEF (type
);
7541 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7542 || !TYPE_STUB (type
)
7543 || TYPE_TAG_NAME (type
) == NULL
)
7547 char *name
= TYPE_TAG_NAME (type
);
7548 struct type
*type1
= ada_find_any_type (name
);
7549 return (type1
== NULL
) ? type
: type1
;
7553 /* A value representing the data at VALADDR/ADDRESS as described by
7554 type TYPE0, but with a standard (static-sized) type that correctly
7555 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7556 type, then return VAL0 [this feature is simply to avoid redundant
7557 creation of struct values]. */
7559 static struct value
*
7560 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7563 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7564 if (type
== type0
&& val0
!= NULL
)
7567 return value_from_contents_and_address (type
, 0, address
);
7570 /* A value representing VAL, but with a standard (static-sized) type
7571 that correctly describes it. Does not necessarily create a new
7574 static struct value
*
7575 ada_to_fixed_value (struct value
*val
)
7577 return ada_to_fixed_value_create (value_type (val
),
7578 VALUE_ADDRESS (val
) + value_offset (val
),
7582 /* A value representing VAL, but with a standard (static-sized) type
7583 chosen to approximate the real type of VAL as well as possible, but
7584 without consulting any runtime values. For Ada dynamic-sized
7585 types, therefore, the type of the result is likely to be inaccurate. */
7588 ada_to_static_fixed_value (struct value
*val
)
7591 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7592 if (type
== value_type (val
))
7595 return coerce_unspec_val_to_type (val
, type
);
7601 /* Table mapping attribute numbers to names.
7602 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7604 static const char *attribute_names
[] = {
7622 ada_attribute_name (enum exp_opcode n
)
7624 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7625 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7627 return attribute_names
[0];
7630 /* Evaluate the 'POS attribute applied to ARG. */
7633 pos_atr (struct value
*arg
)
7635 struct type
*type
= value_type (arg
);
7637 if (!discrete_type_p (type
))
7638 error (_("'POS only defined on discrete types"));
7640 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7643 LONGEST v
= value_as_long (arg
);
7645 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7647 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7650 error (_("enumeration value is invalid: can't find 'POS"));
7653 return value_as_long (arg
);
7656 static struct value
*
7657 value_pos_atr (struct value
*arg
)
7659 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7662 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7664 static struct value
*
7665 value_val_atr (struct type
*type
, struct value
*arg
)
7667 if (!discrete_type_p (type
))
7668 error (_("'VAL only defined on discrete types"));
7669 if (!integer_type_p (value_type (arg
)))
7670 error (_("'VAL requires integral argument"));
7672 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7674 long pos
= value_as_long (arg
);
7675 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7676 error (_("argument to 'VAL out of range"));
7677 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7680 return value_from_longest (type
, value_as_long (arg
));
7686 /* True if TYPE appears to be an Ada character type.
7687 [At the moment, this is true only for Character and Wide_Character;
7688 It is a heuristic test that could stand improvement]. */
7691 ada_is_character_type (struct type
*type
)
7695 /* If the type code says it's a character, then assume it really is,
7696 and don't check any further. */
7697 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7700 /* Otherwise, assume it's a character type iff it is a discrete type
7701 with a known character type name. */
7702 name
= ada_type_name (type
);
7703 return (name
!= NULL
7704 && (TYPE_CODE (type
) == TYPE_CODE_INT
7705 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7706 && (strcmp (name
, "character") == 0
7707 || strcmp (name
, "wide_character") == 0
7708 || strcmp (name
, "wide_wide_character") == 0
7709 || strcmp (name
, "unsigned char") == 0));
7712 /* True if TYPE appears to be an Ada string type. */
7715 ada_is_string_type (struct type
*type
)
7717 type
= ada_check_typedef (type
);
7719 && TYPE_CODE (type
) != TYPE_CODE_PTR
7720 && (ada_is_simple_array_type (type
)
7721 || ada_is_array_descriptor_type (type
))
7722 && ada_array_arity (type
) == 1)
7724 struct type
*elttype
= ada_array_element_type (type
, 1);
7726 return ada_is_character_type (elttype
);
7733 /* True if TYPE is a struct type introduced by the compiler to force the
7734 alignment of a value. Such types have a single field with a
7735 distinctive name. */
7738 ada_is_aligner_type (struct type
*type
)
7740 type
= ada_check_typedef (type
);
7742 /* If we can find a parallel XVS type, then the XVS type should
7743 be used instead of this type. And hence, this is not an aligner
7745 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7748 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7749 && TYPE_NFIELDS (type
) == 1
7750 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7753 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7754 the parallel type. */
7757 ada_get_base_type (struct type
*raw_type
)
7759 struct type
*real_type_namer
;
7760 struct type
*raw_real_type
;
7762 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7765 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7766 if (real_type_namer
== NULL
7767 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7768 || TYPE_NFIELDS (real_type_namer
) != 1)
7771 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7772 if (raw_real_type
== NULL
)
7775 return raw_real_type
;
7778 /* The type of value designated by TYPE, with all aligners removed. */
7781 ada_aligned_type (struct type
*type
)
7783 if (ada_is_aligner_type (type
))
7784 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7786 return ada_get_base_type (type
);
7790 /* The address of the aligned value in an object at address VALADDR
7791 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7794 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7796 if (ada_is_aligner_type (type
))
7797 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7799 TYPE_FIELD_BITPOS (type
,
7800 0) / TARGET_CHAR_BIT
);
7807 /* The printed representation of an enumeration literal with encoded
7808 name NAME. The value is good to the next call of ada_enum_name. */
7810 ada_enum_name (const char *name
)
7812 static char *result
;
7813 static size_t result_len
= 0;
7816 /* First, unqualify the enumeration name:
7817 1. Search for the last '.' character. If we find one, then skip
7818 all the preceeding characters, the unqualified name starts
7819 right after that dot.
7820 2. Otherwise, we may be debugging on a target where the compiler
7821 translates dots into "__". Search forward for double underscores,
7822 but stop searching when we hit an overloading suffix, which is
7823 of the form "__" followed by digits. */
7825 tmp
= strrchr (name
, '.');
7830 while ((tmp
= strstr (name
, "__")) != NULL
)
7832 if (isdigit (tmp
[2]))
7842 if (name
[1] == 'U' || name
[1] == 'W')
7844 if (sscanf (name
+ 2, "%x", &v
) != 1)
7850 GROW_VECT (result
, result_len
, 16);
7851 if (isascii (v
) && isprint (v
))
7852 sprintf (result
, "'%c'", v
);
7853 else if (name
[1] == 'U')
7854 sprintf (result
, "[\"%02x\"]", v
);
7856 sprintf (result
, "[\"%04x\"]", v
);
7862 tmp
= strstr (name
, "__");
7864 tmp
= strstr (name
, "$");
7867 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7868 strncpy (result
, name
, tmp
- name
);
7869 result
[tmp
- name
] = '\0';
7877 static struct value
*
7878 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7881 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7882 (expect_type
, exp
, pos
, noside
);
7885 /* Evaluate the subexpression of EXP starting at *POS as for
7886 evaluate_type, updating *POS to point just past the evaluated
7889 static struct value
*
7890 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7892 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7893 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7896 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7899 static struct value
*
7900 unwrap_value (struct value
*val
)
7902 struct type
*type
= ada_check_typedef (value_type (val
));
7903 if (ada_is_aligner_type (type
))
7905 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7906 struct type
*val_type
= ada_check_typedef (value_type (v
));
7907 if (ada_type_name (val_type
) == NULL
)
7908 TYPE_NAME (val_type
) = ada_type_name (type
);
7910 return unwrap_value (v
);
7914 struct type
*raw_real_type
=
7915 ada_check_typedef (ada_get_base_type (type
));
7917 if (type
== raw_real_type
)
7921 coerce_unspec_val_to_type
7922 (val
, ada_to_fixed_type (raw_real_type
, 0,
7923 VALUE_ADDRESS (val
) + value_offset (val
),
7928 static struct value
*
7929 cast_to_fixed (struct type
*type
, struct value
*arg
)
7933 if (type
== value_type (arg
))
7935 else if (ada_is_fixed_point_type (value_type (arg
)))
7936 val
= ada_float_to_fixed (type
,
7937 ada_fixed_to_float (value_type (arg
),
7938 value_as_long (arg
)));
7942 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7943 val
= ada_float_to_fixed (type
, argd
);
7946 return value_from_longest (type
, val
);
7949 static struct value
*
7950 cast_from_fixed_to_double (struct value
*arg
)
7952 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7953 value_as_long (arg
));
7954 return value_from_double (builtin_type_double
, val
);
7957 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7958 return the converted value. */
7960 static struct value
*
7961 coerce_for_assign (struct type
*type
, struct value
*val
)
7963 struct type
*type2
= value_type (val
);
7967 type2
= ada_check_typedef (type2
);
7968 type
= ada_check_typedef (type
);
7970 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7971 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7973 val
= ada_value_ind (val
);
7974 type2
= value_type (val
);
7977 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7978 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7980 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7981 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7982 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7983 error (_("Incompatible types in assignment"));
7984 deprecated_set_value_type (val
, type
);
7989 static struct value
*
7990 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7993 struct type
*type1
, *type2
;
7996 arg1
= coerce_ref (arg1
);
7997 arg2
= coerce_ref (arg2
);
7998 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7999 type2
= base_type (ada_check_typedef (value_type (arg2
)));
8001 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8002 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8003 return value_binop (arg1
, arg2
, op
);
8012 return value_binop (arg1
, arg2
, op
);
8015 v2
= value_as_long (arg2
);
8017 error (_("second operand of %s must not be zero."), op_string (op
));
8019 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8020 return value_binop (arg1
, arg2
, op
);
8022 v1
= value_as_long (arg1
);
8027 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8028 v
+= v
> 0 ? -1 : 1;
8036 /* Should not reach this point. */
8040 val
= allocate_value (type1
);
8041 store_unsigned_integer (value_contents_raw (val
),
8042 TYPE_LENGTH (value_type (val
)), v
);
8047 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8049 if (ada_is_direct_array_type (value_type (arg1
))
8050 || ada_is_direct_array_type (value_type (arg2
)))
8052 /* Automatically dereference any array reference before
8053 we attempt to perform the comparison. */
8054 arg1
= ada_coerce_ref (arg1
);
8055 arg2
= ada_coerce_ref (arg2
);
8057 arg1
= ada_coerce_to_simple_array (arg1
);
8058 arg2
= ada_coerce_to_simple_array (arg2
);
8059 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8060 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8061 error (_("Attempt to compare array with non-array"));
8062 /* FIXME: The following works only for types whose
8063 representations use all bits (no padding or undefined bits)
8064 and do not have user-defined equality. */
8066 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8067 && memcmp (value_contents (arg1
), value_contents (arg2
),
8068 TYPE_LENGTH (value_type (arg1
))) == 0;
8070 return value_equal (arg1
, arg2
);
8073 /* Total number of component associations in the aggregate starting at
8074 index PC in EXP. Assumes that index PC is the start of an
8078 num_component_specs (struct expression
*exp
, int pc
)
8081 m
= exp
->elts
[pc
+ 1].longconst
;
8084 for (i
= 0; i
< m
; i
+= 1)
8086 switch (exp
->elts
[pc
].opcode
)
8092 n
+= exp
->elts
[pc
+ 1].longconst
;
8095 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8100 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8101 component of LHS (a simple array or a record), updating *POS past
8102 the expression, assuming that LHS is contained in CONTAINER. Does
8103 not modify the inferior's memory, nor does it modify LHS (unless
8104 LHS == CONTAINER). */
8107 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8108 struct expression
*exp
, int *pos
)
8110 struct value
*mark
= value_mark ();
8112 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8114 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
8115 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8119 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8120 elt
= ada_to_fixed_value (unwrap_value (elt
));
8123 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8124 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8126 value_assign_to_component (container
, elt
,
8127 ada_evaluate_subexp (NULL
, exp
, pos
,
8130 value_free_to_mark (mark
);
8133 /* Assuming that LHS represents an lvalue having a record or array
8134 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8135 of that aggregate's value to LHS, advancing *POS past the
8136 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8137 lvalue containing LHS (possibly LHS itself). Does not modify
8138 the inferior's memory, nor does it modify the contents of
8139 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8141 static struct value
*
8142 assign_aggregate (struct value
*container
,
8143 struct value
*lhs
, struct expression
*exp
,
8144 int *pos
, enum noside noside
)
8146 struct type
*lhs_type
;
8147 int n
= exp
->elts
[*pos
+1].longconst
;
8148 LONGEST low_index
, high_index
;
8151 int max_indices
, num_indices
;
8152 int is_array_aggregate
;
8154 struct value
*mark
= value_mark ();
8157 if (noside
!= EVAL_NORMAL
)
8160 for (i
= 0; i
< n
; i
+= 1)
8161 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8165 container
= ada_coerce_ref (container
);
8166 if (ada_is_direct_array_type (value_type (container
)))
8167 container
= ada_coerce_to_simple_array (container
);
8168 lhs
= ada_coerce_ref (lhs
);
8169 if (!deprecated_value_modifiable (lhs
))
8170 error (_("Left operand of assignment is not a modifiable lvalue."));
8172 lhs_type
= value_type (lhs
);
8173 if (ada_is_direct_array_type (lhs_type
))
8175 lhs
= ada_coerce_to_simple_array (lhs
);
8176 lhs_type
= value_type (lhs
);
8177 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8178 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8179 is_array_aggregate
= 1;
8181 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8184 high_index
= num_visible_fields (lhs_type
) - 1;
8185 is_array_aggregate
= 0;
8188 error (_("Left-hand side must be array or record."));
8190 num_specs
= num_component_specs (exp
, *pos
- 3);
8191 max_indices
= 4 * num_specs
+ 4;
8192 indices
= alloca (max_indices
* sizeof (indices
[0]));
8193 indices
[0] = indices
[1] = low_index
- 1;
8194 indices
[2] = indices
[3] = high_index
+ 1;
8197 for (i
= 0; i
< n
; i
+= 1)
8199 switch (exp
->elts
[*pos
].opcode
)
8202 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8203 &num_indices
, max_indices
,
8204 low_index
, high_index
);
8207 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8208 &num_indices
, max_indices
,
8209 low_index
, high_index
);
8213 error (_("Misplaced 'others' clause"));
8214 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8215 num_indices
, low_index
, high_index
);
8218 error (_("Internal error: bad aggregate clause"));
8225 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8226 construct at *POS, updating *POS past the construct, given that
8227 the positions are relative to lower bound LOW, where HIGH is the
8228 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8229 updating *NUM_INDICES as needed. CONTAINER is as for
8230 assign_aggregate. */
8232 aggregate_assign_positional (struct value
*container
,
8233 struct value
*lhs
, struct expression
*exp
,
8234 int *pos
, LONGEST
*indices
, int *num_indices
,
8235 int max_indices
, LONGEST low
, LONGEST high
)
8237 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8239 if (ind
- 1 == high
)
8240 warning (_("Extra components in aggregate ignored."));
8243 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8245 assign_component (container
, lhs
, ind
, exp
, pos
);
8248 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8251 /* Assign into the components of LHS indexed by the OP_CHOICES
8252 construct at *POS, updating *POS past the construct, given that
8253 the allowable indices are LOW..HIGH. Record the indices assigned
8254 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8255 needed. CONTAINER is as for assign_aggregate. */
8257 aggregate_assign_from_choices (struct value
*container
,
8258 struct value
*lhs
, struct expression
*exp
,
8259 int *pos
, LONGEST
*indices
, int *num_indices
,
8260 int max_indices
, LONGEST low
, LONGEST high
)
8263 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8264 int choice_pos
, expr_pc
;
8265 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8267 choice_pos
= *pos
+= 3;
8269 for (j
= 0; j
< n_choices
; j
+= 1)
8270 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8272 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8274 for (j
= 0; j
< n_choices
; j
+= 1)
8276 LONGEST lower
, upper
;
8277 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8278 if (op
== OP_DISCRETE_RANGE
)
8281 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8283 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8288 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8299 name
= &exp
->elts
[choice_pos
+ 2].string
;
8302 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8305 error (_("Invalid record component association."));
8307 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8309 if (! find_struct_field (name
, value_type (lhs
), 0,
8310 NULL
, NULL
, NULL
, NULL
, &ind
))
8311 error (_("Unknown component name: %s."), name
);
8312 lower
= upper
= ind
;
8315 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8316 error (_("Index in component association out of bounds."));
8318 add_component_interval (lower
, upper
, indices
, num_indices
,
8320 while (lower
<= upper
)
8324 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8330 /* Assign the value of the expression in the OP_OTHERS construct in
8331 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8332 have not been previously assigned. The index intervals already assigned
8333 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8334 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8336 aggregate_assign_others (struct value
*container
,
8337 struct value
*lhs
, struct expression
*exp
,
8338 int *pos
, LONGEST
*indices
, int num_indices
,
8339 LONGEST low
, LONGEST high
)
8342 int expr_pc
= *pos
+1;
8344 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8347 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8351 assign_component (container
, lhs
, ind
, exp
, &pos
);
8354 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8357 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8358 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8359 modifying *SIZE as needed. It is an error if *SIZE exceeds
8360 MAX_SIZE. The resulting intervals do not overlap. */
8362 add_component_interval (LONGEST low
, LONGEST high
,
8363 LONGEST
* indices
, int *size
, int max_size
)
8366 for (i
= 0; i
< *size
; i
+= 2) {
8367 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8370 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8371 if (high
< indices
[kh
])
8373 if (low
< indices
[i
])
8375 indices
[i
+ 1] = indices
[kh
- 1];
8376 if (high
> indices
[i
+ 1])
8377 indices
[i
+ 1] = high
;
8378 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8379 *size
-= kh
- i
- 2;
8382 else if (high
< indices
[i
])
8386 if (*size
== max_size
)
8387 error (_("Internal error: miscounted aggregate components."));
8389 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8390 indices
[j
] = indices
[j
- 2];
8392 indices
[i
+ 1] = high
;
8395 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8398 static struct value
*
8399 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8401 if (type
== ada_check_typedef (value_type (arg2
)))
8404 if (ada_is_fixed_point_type (type
))
8405 return (cast_to_fixed (type
, arg2
));
8407 if (ada_is_fixed_point_type (value_type (arg2
)))
8408 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8410 return value_cast (type
, arg2
);
8413 static struct value
*
8414 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8415 int *pos
, enum noside noside
)
8418 int tem
, tem2
, tem3
;
8420 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8423 struct value
**argvec
;
8427 op
= exp
->elts
[pc
].opcode
;
8433 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8434 arg1
= unwrap_value (arg1
);
8436 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8437 then we need to perform the conversion manually, because
8438 evaluate_subexp_standard doesn't do it. This conversion is
8439 necessary in Ada because the different kinds of float/fixed
8440 types in Ada have different representations.
8442 Similarly, we need to perform the conversion from OP_LONG
8444 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8445 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8451 struct value
*result
;
8453 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8454 /* The result type will have code OP_STRING, bashed there from
8455 OP_ARRAY. Bash it back. */
8456 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8457 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8463 type
= exp
->elts
[pc
+ 1].type
;
8464 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8465 if (noside
== EVAL_SKIP
)
8467 arg1
= ada_value_cast (type
, arg1
, noside
);
8472 type
= exp
->elts
[pc
+ 1].type
;
8473 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8476 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8477 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8479 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8480 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8482 return ada_value_assign (arg1
, arg1
);
8484 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8485 except if the lhs of our assignment is a convenience variable.
8486 In the case of assigning to a convenience variable, the lhs
8487 should be exactly the result of the evaluation of the rhs. */
8488 type
= value_type (arg1
);
8489 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8491 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8492 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8494 if (ada_is_fixed_point_type (value_type (arg1
)))
8495 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8496 else if (ada_is_fixed_point_type (value_type (arg2
)))
8498 (_("Fixed-point values must be assigned to fixed-point variables"));
8500 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8501 return ada_value_assign (arg1
, arg2
);
8504 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8505 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8506 if (noside
== EVAL_SKIP
)
8508 if ((ada_is_fixed_point_type (value_type (arg1
))
8509 || ada_is_fixed_point_type (value_type (arg2
)))
8510 && value_type (arg1
) != value_type (arg2
))
8511 error (_("Operands of fixed-point addition must have the same type"));
8512 /* Do the addition, and cast the result to the type of the first
8513 argument. We cannot cast the result to a reference type, so if
8514 ARG1 is a reference type, find its underlying type. */
8515 type
= value_type (arg1
);
8516 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8517 type
= TYPE_TARGET_TYPE (type
);
8518 return value_cast (type
, value_add (arg1
, arg2
));
8521 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8522 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8523 if (noside
== EVAL_SKIP
)
8525 if ((ada_is_fixed_point_type (value_type (arg1
))
8526 || ada_is_fixed_point_type (value_type (arg2
)))
8527 && value_type (arg1
) != value_type (arg2
))
8528 error (_("Operands of fixed-point subtraction must have the same type"));
8529 /* Do the substraction, and cast the result to the type of the first
8530 argument. We cannot cast the result to a reference type, so if
8531 ARG1 is a reference type, find its underlying type. */
8532 type
= value_type (arg1
);
8533 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8534 type
= TYPE_TARGET_TYPE (type
);
8535 return value_cast (type
, value_sub (arg1
, arg2
));
8539 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8540 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8541 if (noside
== EVAL_SKIP
)
8543 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8544 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8545 return value_zero (value_type (arg1
), not_lval
);
8548 if (ada_is_fixed_point_type (value_type (arg1
)))
8549 arg1
= cast_from_fixed_to_double (arg1
);
8550 if (ada_is_fixed_point_type (value_type (arg2
)))
8551 arg2
= cast_from_fixed_to_double (arg2
);
8552 return ada_value_binop (arg1
, arg2
, op
);
8557 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8558 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8559 if (noside
== EVAL_SKIP
)
8561 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8562 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8563 return value_zero (value_type (arg1
), not_lval
);
8565 return ada_value_binop (arg1
, arg2
, op
);
8568 case BINOP_NOTEQUAL
:
8569 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8570 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8571 if (noside
== EVAL_SKIP
)
8573 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8576 tem
= ada_value_equal (arg1
, arg2
);
8577 if (op
== BINOP_NOTEQUAL
)
8579 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8582 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8583 if (noside
== EVAL_SKIP
)
8585 else if (ada_is_fixed_point_type (value_type (arg1
)))
8586 return value_cast (value_type (arg1
), value_neg (arg1
));
8588 return value_neg (arg1
);
8590 case BINOP_LOGICAL_AND
:
8591 case BINOP_LOGICAL_OR
:
8592 case UNOP_LOGICAL_NOT
:
8597 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8598 return value_cast (LA_BOOL_TYPE
, val
);
8601 case BINOP_BITWISE_AND
:
8602 case BINOP_BITWISE_IOR
:
8603 case BINOP_BITWISE_XOR
:
8607 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8609 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8611 return value_cast (value_type (arg1
), val
);
8617 /* Tagged types are a little special in the fact that the real type
8618 is dynamic and can only be determined by inspecting the object
8619 value. So even if we're support to do an EVAL_AVOID_SIDE_EFFECTS
8620 evaluation, we force an EVAL_NORMAL evaluation for tagged types. */
8621 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8622 && ada_is_tagged_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
), 1))
8623 noside
= EVAL_NORMAL
;
8625 if (noside
== EVAL_SKIP
)
8630 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8631 /* Only encountered when an unresolved symbol occurs in a
8632 context other than a function call, in which case, it is
8634 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8635 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8636 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8640 (to_static_fixed_type
8641 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8647 unwrap_value (evaluate_subexp_standard
8648 (expect_type
, exp
, pos
, noside
));
8649 return ada_to_fixed_value (arg1
);
8655 /* Allocate arg vector, including space for the function to be
8656 called in argvec[0] and a terminating NULL. */
8657 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8659 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8661 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8662 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8663 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8664 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8667 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8668 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8671 if (noside
== EVAL_SKIP
)
8675 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8676 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8677 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8678 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8679 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8680 argvec
[0] = value_addr (argvec
[0]);
8682 type
= ada_check_typedef (value_type (argvec
[0]));
8683 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8685 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8687 case TYPE_CODE_FUNC
:
8688 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8690 case TYPE_CODE_ARRAY
:
8692 case TYPE_CODE_STRUCT
:
8693 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8694 argvec
[0] = ada_value_ind (argvec
[0]);
8695 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8698 error (_("cannot subscript or call something of type `%s'"),
8699 ada_type_name (value_type (argvec
[0])));
8704 switch (TYPE_CODE (type
))
8706 case TYPE_CODE_FUNC
:
8707 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8708 return allocate_value (TYPE_TARGET_TYPE (type
));
8709 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8710 case TYPE_CODE_STRUCT
:
8714 arity
= ada_array_arity (type
);
8715 type
= ada_array_element_type (type
, nargs
);
8717 error (_("cannot subscript or call a record"));
8719 error (_("wrong number of subscripts; expecting %d"), arity
);
8720 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8721 return value_zero (ada_aligned_type (type
), lval_memory
);
8723 unwrap_value (ada_value_subscript
8724 (argvec
[0], nargs
, argvec
+ 1));
8726 case TYPE_CODE_ARRAY
:
8727 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8729 type
= ada_array_element_type (type
, nargs
);
8731 error (_("element type of array unknown"));
8733 return value_zero (ada_aligned_type (type
), lval_memory
);
8736 unwrap_value (ada_value_subscript
8737 (ada_coerce_to_simple_array (argvec
[0]),
8738 nargs
, argvec
+ 1));
8739 case TYPE_CODE_PTR
: /* Pointer to array */
8740 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8741 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8743 type
= ada_array_element_type (type
, nargs
);
8745 error (_("element type of array unknown"));
8747 return value_zero (ada_aligned_type (type
), lval_memory
);
8750 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8751 nargs
, argvec
+ 1));
8754 error (_("Attempt to index or call something other than an "
8755 "array or function"));
8760 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8761 struct value
*low_bound_val
=
8762 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8763 struct value
*high_bound_val
=
8764 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8767 low_bound_val
= coerce_ref (low_bound_val
);
8768 high_bound_val
= coerce_ref (high_bound_val
);
8769 low_bound
= pos_atr (low_bound_val
);
8770 high_bound
= pos_atr (high_bound_val
);
8772 if (noside
== EVAL_SKIP
)
8775 /* If this is a reference to an aligner type, then remove all
8777 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8778 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8779 TYPE_TARGET_TYPE (value_type (array
)) =
8780 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8782 if (ada_is_packed_array_type (value_type (array
)))
8783 error (_("cannot slice a packed array"));
8785 /* If this is a reference to an array or an array lvalue,
8786 convert to a pointer. */
8787 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8788 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8789 && VALUE_LVAL (array
) == lval_memory
))
8790 array
= value_addr (array
);
8792 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8793 && ada_is_array_descriptor_type (ada_check_typedef
8794 (value_type (array
))))
8795 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8797 array
= ada_coerce_to_simple_array_ptr (array
);
8799 /* If we have more than one level of pointer indirection,
8800 dereference the value until we get only one level. */
8801 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8802 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8804 array
= value_ind (array
);
8806 /* Make sure we really do have an array type before going further,
8807 to avoid a SEGV when trying to get the index type or the target
8808 type later down the road if the debug info generated by
8809 the compiler is incorrect or incomplete. */
8810 if (!ada_is_simple_array_type (value_type (array
)))
8811 error (_("cannot take slice of non-array"));
8813 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8815 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8816 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8820 struct type
*arr_type0
=
8821 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8823 return ada_value_slice_ptr (array
, arr_type0
,
8824 longest_to_int (low_bound
),
8825 longest_to_int (high_bound
));
8828 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8830 else if (high_bound
< low_bound
)
8831 return empty_array (value_type (array
), low_bound
);
8833 return ada_value_slice (array
, longest_to_int (low_bound
),
8834 longest_to_int (high_bound
));
8839 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8840 type
= exp
->elts
[pc
+ 1].type
;
8842 if (noside
== EVAL_SKIP
)
8845 switch (TYPE_CODE (type
))
8848 lim_warning (_("Membership test incompletely implemented; "
8849 "always returns true"));
8850 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8852 case TYPE_CODE_RANGE
:
8853 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8854 arg3
= value_from_longest (builtin_type_int
,
8855 TYPE_HIGH_BOUND (type
));
8857 value_from_longest (builtin_type_int
,
8858 (value_less (arg1
, arg3
)
8859 || value_equal (arg1
, arg3
))
8860 && (value_less (arg2
, arg1
)
8861 || value_equal (arg2
, arg1
)));
8864 case BINOP_IN_BOUNDS
:
8866 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8867 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8869 if (noside
== EVAL_SKIP
)
8872 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8873 return value_zero (builtin_type_int
, not_lval
);
8875 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8877 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8878 error (_("invalid dimension number to 'range"));
8880 arg3
= ada_array_bound (arg2
, tem
, 1);
8881 arg2
= ada_array_bound (arg2
, tem
, 0);
8884 value_from_longest (builtin_type_int
,
8885 (value_less (arg1
, arg3
)
8886 || value_equal (arg1
, arg3
))
8887 && (value_less (arg2
, arg1
)
8888 || value_equal (arg2
, arg1
)));
8890 case TERNOP_IN_RANGE
:
8891 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8892 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8893 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8895 if (noside
== EVAL_SKIP
)
8899 value_from_longest (builtin_type_int
,
8900 (value_less (arg1
, arg3
)
8901 || value_equal (arg1
, arg3
))
8902 && (value_less (arg2
, arg1
)
8903 || value_equal (arg2
, arg1
)));
8909 struct type
*type_arg
;
8910 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8912 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8914 type_arg
= exp
->elts
[pc
+ 2].type
;
8918 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8922 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8923 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8924 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8927 if (noside
== EVAL_SKIP
)
8930 if (type_arg
== NULL
)
8932 arg1
= ada_coerce_ref (arg1
);
8934 if (ada_is_packed_array_type (value_type (arg1
)))
8935 arg1
= ada_coerce_to_simple_array (arg1
);
8937 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8938 error (_("invalid dimension number to '%s"),
8939 ada_attribute_name (op
));
8941 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8943 type
= ada_index_type (value_type (arg1
), tem
);
8946 (_("attempt to take bound of something that is not an array"));
8947 return allocate_value (type
);
8952 default: /* Should never happen. */
8953 error (_("unexpected attribute encountered"));
8955 return ada_array_bound (arg1
, tem
, 0);
8957 return ada_array_bound (arg1
, tem
, 1);
8959 return ada_array_length (arg1
, tem
);
8962 else if (discrete_type_p (type_arg
))
8964 struct type
*range_type
;
8965 char *name
= ada_type_name (type_arg
);
8967 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8969 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8970 if (range_type
== NULL
)
8971 range_type
= type_arg
;
8975 error (_("unexpected attribute encountered"));
8977 return discrete_type_low_bound (range_type
);
8979 return discrete_type_high_bound (range_type
);
8981 error (_("the 'length attribute applies only to array types"));
8984 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8985 error (_("unimplemented type attribute"));
8990 if (ada_is_packed_array_type (type_arg
))
8991 type_arg
= decode_packed_array_type (type_arg
);
8993 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8994 error (_("invalid dimension number to '%s"),
8995 ada_attribute_name (op
));
8997 type
= ada_index_type (type_arg
, tem
);
9000 (_("attempt to take bound of something that is not an array"));
9001 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9002 return allocate_value (type
);
9007 error (_("unexpected attribute encountered"));
9009 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9010 return value_from_longest (type
, low
);
9012 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
9013 return value_from_longest (type
, high
);
9015 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9016 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
9017 return value_from_longest (type
, high
- low
+ 1);
9023 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9024 if (noside
== EVAL_SKIP
)
9027 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9028 return value_zero (ada_tag_type (arg1
), not_lval
);
9030 return ada_value_tag (arg1
);
9034 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9035 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9036 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9037 if (noside
== EVAL_SKIP
)
9039 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9040 return value_zero (value_type (arg1
), not_lval
);
9042 return value_binop (arg1
, arg2
,
9043 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9045 case OP_ATR_MODULUS
:
9047 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9048 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9050 if (noside
== EVAL_SKIP
)
9053 if (!ada_is_modular_type (type_arg
))
9054 error (_("'modulus must be applied to modular type"));
9056 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9057 ada_modulus (type_arg
));
9062 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9063 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9064 if (noside
== EVAL_SKIP
)
9066 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9067 return value_zero (builtin_type_int
, not_lval
);
9069 return value_pos_atr (arg1
);
9072 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9073 if (noside
== EVAL_SKIP
)
9075 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9076 return value_zero (builtin_type_int
, not_lval
);
9078 return value_from_longest (builtin_type_int
,
9080 * TYPE_LENGTH (value_type (arg1
)));
9083 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9084 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9085 type
= exp
->elts
[pc
+ 2].type
;
9086 if (noside
== EVAL_SKIP
)
9088 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9089 return value_zero (type
, not_lval
);
9091 return value_val_atr (type
, arg1
);
9094 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9095 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9096 if (noside
== EVAL_SKIP
)
9098 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9099 return value_zero (value_type (arg1
), not_lval
);
9101 return value_binop (arg1
, arg2
, op
);
9104 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9105 if (noside
== EVAL_SKIP
)
9111 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9112 if (noside
== EVAL_SKIP
)
9114 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9115 return value_neg (arg1
);
9120 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
9121 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
9122 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
9123 if (noside
== EVAL_SKIP
)
9125 type
= ada_check_typedef (value_type (arg1
));
9126 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9128 if (ada_is_array_descriptor_type (type
))
9129 /* GDB allows dereferencing GNAT array descriptors. */
9131 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9132 if (arrType
== NULL
)
9133 error (_("Attempt to dereference null array pointer."));
9134 return value_at_lazy (arrType
, 0);
9136 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9137 || TYPE_CODE (type
) == TYPE_CODE_REF
9138 /* In C you can dereference an array to get the 1st elt. */
9139 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9141 type
= to_static_fixed_type
9143 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9145 return value_zero (type
, lval_memory
);
9147 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9148 /* GDB allows dereferencing an int. */
9149 return value_zero (builtin_type_int
, lval_memory
);
9151 error (_("Attempt to take contents of a non-pointer value."));
9153 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9154 type
= ada_check_typedef (value_type (arg1
));
9156 if (ada_is_array_descriptor_type (type
))
9157 /* GDB allows dereferencing GNAT array descriptors. */
9158 return ada_coerce_to_simple_array (arg1
);
9160 return ada_value_ind (arg1
);
9162 case STRUCTOP_STRUCT
:
9163 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9164 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9165 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9166 if (noside
== EVAL_SKIP
)
9168 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9170 struct type
*type1
= value_type (arg1
);
9171 if (ada_is_tagged_type (type1
, 1))
9173 type
= ada_lookup_struct_elt_type (type1
,
9174 &exp
->elts
[pc
+ 2].string
,
9177 /* In this case, we assume that the field COULD exist
9178 in some extension of the type. Return an object of
9179 "type" void, which will match any formal
9180 (see ada_type_match). */
9181 return value_zero (builtin_type_void
, lval_memory
);
9185 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9188 return value_zero (ada_aligned_type (type
), lval_memory
);
9192 ada_to_fixed_value (unwrap_value
9193 (ada_value_struct_elt
9194 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9196 /* The value is not supposed to be used. This is here to make it
9197 easier to accommodate expressions that contain types. */
9199 if (noside
== EVAL_SKIP
)
9201 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9202 return allocate_value (exp
->elts
[pc
+ 1].type
);
9204 error (_("Attempt to use a type name as an expression"));
9209 case OP_DISCRETE_RANGE
:
9212 if (noside
== EVAL_NORMAL
)
9216 error (_("Undefined name, ambiguous name, or renaming used in "
9217 "component association: %s."), &exp
->elts
[pc
+2].string
);
9219 error (_("Aggregates only allowed on the right of an assignment"));
9221 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9224 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9226 for (tem
= 0; tem
< nargs
; tem
+= 1)
9227 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9232 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
9238 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9239 type name that encodes the 'small and 'delta information.
9240 Otherwise, return NULL. */
9243 fixed_type_info (struct type
*type
)
9245 const char *name
= ada_type_name (type
);
9246 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9248 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9250 const char *tail
= strstr (name
, "___XF_");
9256 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9257 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9262 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9265 ada_is_fixed_point_type (struct type
*type
)
9267 return fixed_type_info (type
) != NULL
;
9270 /* Return non-zero iff TYPE represents a System.Address type. */
9273 ada_is_system_address_type (struct type
*type
)
9275 return (TYPE_NAME (type
)
9276 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9279 /* Assuming that TYPE is the representation of an Ada fixed-point
9280 type, return its delta, or -1 if the type is malformed and the
9281 delta cannot be determined. */
9284 ada_delta (struct type
*type
)
9286 const char *encoding
= fixed_type_info (type
);
9289 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9292 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9295 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9296 factor ('SMALL value) associated with the type. */
9299 scaling_factor (struct type
*type
)
9301 const char *encoding
= fixed_type_info (type
);
9302 unsigned long num0
, den0
, num1
, den1
;
9305 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9310 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9312 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9316 /* Assuming that X is the representation of a value of fixed-point
9317 type TYPE, return its floating-point equivalent. */
9320 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9322 return (DOUBLEST
) x
*scaling_factor (type
);
9325 /* The representation of a fixed-point value of type TYPE
9326 corresponding to the value X. */
9329 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9331 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9335 /* VAX floating formats */
9337 /* Non-zero iff TYPE represents one of the special VAX floating-point
9341 ada_is_vax_floating_type (struct type
*type
)
9344 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9347 && (TYPE_CODE (type
) == TYPE_CODE_INT
9348 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9349 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9352 /* The type of special VAX floating-point type this is, assuming
9353 ada_is_vax_floating_point. */
9356 ada_vax_float_type_suffix (struct type
*type
)
9358 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9361 /* A value representing the special debugging function that outputs
9362 VAX floating-point values of the type represented by TYPE. Assumes
9363 ada_is_vax_floating_type (TYPE). */
9366 ada_vax_float_print_function (struct type
*type
)
9368 switch (ada_vax_float_type_suffix (type
))
9371 return get_var_value ("DEBUG_STRING_F", 0);
9373 return get_var_value ("DEBUG_STRING_D", 0);
9375 return get_var_value ("DEBUG_STRING_G", 0);
9377 error (_("invalid VAX floating-point type"));
9384 /* Scan STR beginning at position K for a discriminant name, and
9385 return the value of that discriminant field of DVAL in *PX. If
9386 PNEW_K is not null, put the position of the character beyond the
9387 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9388 not alter *PX and *PNEW_K if unsuccessful. */
9391 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9394 static char *bound_buffer
= NULL
;
9395 static size_t bound_buffer_len
= 0;
9398 struct value
*bound_val
;
9400 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9403 pend
= strstr (str
+ k
, "__");
9407 k
+= strlen (bound
);
9411 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9412 bound
= bound_buffer
;
9413 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9414 bound
[pend
- (str
+ k
)] = '\0';
9418 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9419 if (bound_val
== NULL
)
9422 *px
= value_as_long (bound_val
);
9428 /* Value of variable named NAME in the current environment. If
9429 no such variable found, then if ERR_MSG is null, returns 0, and
9430 otherwise causes an error with message ERR_MSG. */
9432 static struct value
*
9433 get_var_value (char *name
, char *err_msg
)
9435 struct ada_symbol_info
*syms
;
9438 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9443 if (err_msg
== NULL
)
9446 error (("%s"), err_msg
);
9449 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9452 /* Value of integer variable named NAME in the current environment. If
9453 no such variable found, returns 0, and sets *FLAG to 0. If
9454 successful, sets *FLAG to 1. */
9457 get_int_var_value (char *name
, int *flag
)
9459 struct value
*var_val
= get_var_value (name
, 0);
9471 return value_as_long (var_val
);
9476 /* Return a range type whose base type is that of the range type named
9477 NAME in the current environment, and whose bounds are calculated
9478 from NAME according to the GNAT range encoding conventions.
9479 Extract discriminant values, if needed, from DVAL. If a new type
9480 must be created, allocate in OBJFILE's space. The bounds
9481 information, in general, is encoded in NAME, the base type given in
9482 the named range type. */
9484 static struct type
*
9485 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9487 struct type
*raw_type
= ada_find_any_type (name
);
9488 struct type
*base_type
;
9491 if (raw_type
== NULL
)
9492 base_type
= builtin_type_int
;
9493 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9494 base_type
= TYPE_TARGET_TYPE (raw_type
);
9496 base_type
= raw_type
;
9498 subtype_info
= strstr (name
, "___XD");
9499 if (subtype_info
== NULL
)
9503 static char *name_buf
= NULL
;
9504 static size_t name_len
= 0;
9505 int prefix_len
= subtype_info
- name
;
9511 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9512 strncpy (name_buf
, name
, prefix_len
);
9513 name_buf
[prefix_len
] = '\0';
9516 bounds_str
= strchr (subtype_info
, '_');
9519 if (*subtype_info
== 'L')
9521 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9522 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9524 if (bounds_str
[n
] == '_')
9526 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9533 strcpy (name_buf
+ prefix_len
, "___L");
9534 L
= get_int_var_value (name_buf
, &ok
);
9537 lim_warning (_("Unknown lower bound, using 1."));
9542 if (*subtype_info
== 'U')
9544 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9545 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9551 strcpy (name_buf
+ prefix_len
, "___U");
9552 U
= get_int_var_value (name_buf
, &ok
);
9555 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9560 if (objfile
== NULL
)
9561 objfile
= TYPE_OBJFILE (base_type
);
9562 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9563 TYPE_NAME (type
) = name
;
9568 /* True iff NAME is the name of a range type. */
9571 ada_is_range_type_name (const char *name
)
9573 return (name
!= NULL
&& strstr (name
, "___XD"));
9579 /* True iff TYPE is an Ada modular type. */
9582 ada_is_modular_type (struct type
*type
)
9584 struct type
*subranged_type
= base_type (type
);
9586 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9587 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9588 && TYPE_UNSIGNED (subranged_type
));
9591 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9594 ada_modulus (struct type
* type
)
9596 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9600 /* Ada exception catchpoint support:
9601 ---------------------------------
9603 We support 3 kinds of exception catchpoints:
9604 . catchpoints on Ada exceptions
9605 . catchpoints on unhandled Ada exceptions
9606 . catchpoints on failed assertions
9608 Exceptions raised during failed assertions, or unhandled exceptions
9609 could perfectly be caught with the general catchpoint on Ada exceptions.
9610 However, we can easily differentiate these two special cases, and having
9611 the option to distinguish these two cases from the rest can be useful
9612 to zero-in on certain situations.
9614 Exception catchpoints are a specialized form of breakpoint,
9615 since they rely on inserting breakpoints inside known routines
9616 of the GNAT runtime. The implementation therefore uses a standard
9617 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9620 Support in the runtime for exception catchpoints have been changed
9621 a few times already, and these changes affect the implementation
9622 of these catchpoints. In order to be able to support several
9623 variants of the runtime, we use a sniffer that will determine
9624 the runtime variant used by the program being debugged.
9626 At this time, we do not support the use of conditions on Ada exception
9627 catchpoints. The COND and COND_STRING fields are therefore set
9628 to NULL (most of the time, see below).
9630 Conditions where EXP_STRING, COND, and COND_STRING are used:
9632 When a user specifies the name of a specific exception in the case
9633 of catchpoints on Ada exceptions, we store the name of that exception
9634 in the EXP_STRING. We then translate this request into an actual
9635 condition stored in COND_STRING, and then parse it into an expression
9638 /* The different types of catchpoints that we introduced for catching
9641 enum exception_catchpoint_kind
9644 ex_catch_exception_unhandled
,
9648 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9650 /* A structure that describes how to support exception catchpoints
9651 for a given executable. */
9653 struct exception_support_info
9655 /* The name of the symbol to break on in order to insert
9656 a catchpoint on exceptions. */
9657 const char *catch_exception_sym
;
9659 /* The name of the symbol to break on in order to insert
9660 a catchpoint on unhandled exceptions. */
9661 const char *catch_exception_unhandled_sym
;
9663 /* The name of the symbol to break on in order to insert
9664 a catchpoint on failed assertions. */
9665 const char *catch_assert_sym
;
9667 /* Assuming that the inferior just triggered an unhandled exception
9668 catchpoint, this function is responsible for returning the address
9669 in inferior memory where the name of that exception is stored.
9670 Return zero if the address could not be computed. */
9671 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9674 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9675 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9677 /* The following exception support info structure describes how to
9678 implement exception catchpoints with the latest version of the
9679 Ada runtime (as of 2007-03-06). */
9681 static const struct exception_support_info default_exception_support_info
=
9683 "__gnat_debug_raise_exception", /* catch_exception_sym */
9684 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9685 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9686 ada_unhandled_exception_name_addr
9689 /* The following exception support info structure describes how to
9690 implement exception catchpoints with a slightly older version
9691 of the Ada runtime. */
9693 static const struct exception_support_info exception_support_info_fallback
=
9695 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9696 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9697 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9698 ada_unhandled_exception_name_addr_from_raise
9701 /* For each executable, we sniff which exception info structure to use
9702 and cache it in the following global variable. */
9704 static const struct exception_support_info
*exception_info
= NULL
;
9706 /* Inspect the Ada runtime and determine which exception info structure
9707 should be used to provide support for exception catchpoints.
9709 This function will always set exception_info, or raise an error. */
9712 ada_exception_support_info_sniffer (void)
9716 /* If the exception info is already known, then no need to recompute it. */
9717 if (exception_info
!= NULL
)
9720 /* Check the latest (default) exception support info. */
9721 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9725 exception_info
= &default_exception_support_info
;
9729 /* Try our fallback exception suport info. */
9730 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9734 exception_info
= &exception_support_info_fallback
;
9738 /* Sometimes, it is normal for us to not be able to find the routine
9739 we are looking for. This happens when the program is linked with
9740 the shared version of the GNAT runtime, and the program has not been
9741 started yet. Inform the user of these two possible causes if
9744 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9745 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9747 /* If the symbol does not exist, then check that the program is
9748 already started, to make sure that shared libraries have been
9749 loaded. If it is not started, this may mean that the symbol is
9750 in a shared library. */
9752 if (ptid_get_pid (inferior_ptid
) == 0)
9753 error (_("Unable to insert catchpoint. Try to start the program first."));
9755 /* At this point, we know that we are debugging an Ada program and
9756 that the inferior has been started, but we still are not able to
9757 find the run-time symbols. That can mean that we are in
9758 configurable run time mode, or that a-except as been optimized
9759 out by the linker... In any case, at this point it is not worth
9760 supporting this feature. */
9762 error (_("Cannot insert catchpoints in this configuration."));
9765 /* An observer of "executable_changed" events.
9766 Its role is to clear certain cached values that need to be recomputed
9767 each time a new executable is loaded by GDB. */
9770 ada_executable_changed_observer (void *unused
)
9772 /* If the executable changed, then it is possible that the Ada runtime
9773 is different. So we need to invalidate the exception support info
9775 exception_info
= NULL
;
9778 /* Return the name of the function at PC, NULL if could not find it.
9779 This function only checks the debugging information, not the symbol
9783 function_name_from_pc (CORE_ADDR pc
)
9787 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9793 /* True iff FRAME is very likely to be that of a function that is
9794 part of the runtime system. This is all very heuristic, but is
9795 intended to be used as advice as to what frames are uninteresting
9799 is_known_support_routine (struct frame_info
*frame
)
9801 struct symtab_and_line sal
;
9805 /* If this code does not have any debugging information (no symtab),
9806 This cannot be any user code. */
9808 find_frame_sal (frame
, &sal
);
9809 if (sal
.symtab
== NULL
)
9812 /* If there is a symtab, but the associated source file cannot be
9813 located, then assume this is not user code: Selecting a frame
9814 for which we cannot display the code would not be very helpful
9815 for the user. This should also take care of case such as VxWorks
9816 where the kernel has some debugging info provided for a few units. */
9818 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9821 /* Check the unit filename againt the Ada runtime file naming.
9822 We also check the name of the objfile against the name of some
9823 known system libraries that sometimes come with debugging info
9826 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9828 re_comp (known_runtime_file_name_patterns
[i
]);
9829 if (re_exec (sal
.symtab
->filename
))
9831 if (sal
.symtab
->objfile
!= NULL
9832 && re_exec (sal
.symtab
->objfile
->name
))
9836 /* Check whether the function is a GNAT-generated entity. */
9838 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9839 if (func_name
== NULL
)
9842 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9844 re_comp (known_auxiliary_function_name_patterns
[i
]);
9845 if (re_exec (func_name
))
9852 /* Find the first frame that contains debugging information and that is not
9853 part of the Ada run-time, starting from FI and moving upward. */
9856 ada_find_printable_frame (struct frame_info
*fi
)
9858 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9860 if (!is_known_support_routine (fi
))
9869 /* Assuming that the inferior just triggered an unhandled exception
9870 catchpoint, return the address in inferior memory where the name
9871 of the exception is stored.
9873 Return zero if the address could not be computed. */
9876 ada_unhandled_exception_name_addr (void)
9878 return parse_and_eval_address ("e.full_name");
9881 /* Same as ada_unhandled_exception_name_addr, except that this function
9882 should be used when the inferior uses an older version of the runtime,
9883 where the exception name needs to be extracted from a specific frame
9884 several frames up in the callstack. */
9887 ada_unhandled_exception_name_addr_from_raise (void)
9890 struct frame_info
*fi
;
9892 /* To determine the name of this exception, we need to select
9893 the frame corresponding to RAISE_SYM_NAME. This frame is
9894 at least 3 levels up, so we simply skip the first 3 frames
9895 without checking the name of their associated function. */
9896 fi
= get_current_frame ();
9897 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9899 fi
= get_prev_frame (fi
);
9903 const char *func_name
=
9904 function_name_from_pc (get_frame_address_in_block (fi
));
9905 if (func_name
!= NULL
9906 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9907 break; /* We found the frame we were looking for... */
9908 fi
= get_prev_frame (fi
);
9915 return parse_and_eval_address ("id.full_name");
9918 /* Assuming the inferior just triggered an Ada exception catchpoint
9919 (of any type), return the address in inferior memory where the name
9920 of the exception is stored, if applicable.
9922 Return zero if the address could not be computed, or if not relevant. */
9925 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9926 struct breakpoint
*b
)
9930 case ex_catch_exception
:
9931 return (parse_and_eval_address ("e.full_name"));
9934 case ex_catch_exception_unhandled
:
9935 return exception_info
->unhandled_exception_name_addr ();
9938 case ex_catch_assert
:
9939 return 0; /* Exception name is not relevant in this case. */
9943 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9947 return 0; /* Should never be reached. */
9950 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9951 any error that ada_exception_name_addr_1 might cause to be thrown.
9952 When an error is intercepted, a warning with the error message is printed,
9953 and zero is returned. */
9956 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9957 struct breakpoint
*b
)
9959 struct gdb_exception e
;
9960 CORE_ADDR result
= 0;
9962 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9964 result
= ada_exception_name_addr_1 (ex
, b
);
9969 warning (_("failed to get exception name: %s"), e
.message
);
9976 /* Implement the PRINT_IT method in the breakpoint_ops structure
9977 for all exception catchpoint kinds. */
9979 static enum print_stop_action
9980 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9982 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9983 char exception_name
[256];
9987 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
9988 exception_name
[sizeof (exception_name
) - 1] = '\0';
9991 ada_find_printable_frame (get_current_frame ());
9993 annotate_catchpoint (b
->number
);
9996 case ex_catch_exception
:
9998 printf_filtered (_("\nCatchpoint %d, %s at "),
9999 b
->number
, exception_name
);
10001 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10003 case ex_catch_exception_unhandled
:
10005 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10006 b
->number
, exception_name
);
10008 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10011 case ex_catch_assert
:
10012 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10017 return PRINT_SRC_AND_LOC
;
10020 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10021 for all exception catchpoint kinds. */
10024 print_one_exception (enum exception_catchpoint_kind ex
,
10025 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10029 annotate_field (4);
10030 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10033 annotate_field (5);
10034 *last_addr
= b
->loc
->address
;
10037 case ex_catch_exception
:
10038 if (b
->exp_string
!= NULL
)
10040 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10042 ui_out_field_string (uiout
, "what", msg
);
10046 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10050 case ex_catch_exception_unhandled
:
10051 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10054 case ex_catch_assert
:
10055 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10059 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10064 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10065 for all exception catchpoint kinds. */
10068 print_mention_exception (enum exception_catchpoint_kind ex
,
10069 struct breakpoint
*b
)
10073 case ex_catch_exception
:
10074 if (b
->exp_string
!= NULL
)
10075 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10076 b
->number
, b
->exp_string
);
10078 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10082 case ex_catch_exception_unhandled
:
10083 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10087 case ex_catch_assert
:
10088 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10092 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10097 /* Virtual table for "catch exception" breakpoints. */
10099 static enum print_stop_action
10100 print_it_catch_exception (struct breakpoint
*b
)
10102 return print_it_exception (ex_catch_exception
, b
);
10106 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10108 print_one_exception (ex_catch_exception
, b
, last_addr
);
10112 print_mention_catch_exception (struct breakpoint
*b
)
10114 print_mention_exception (ex_catch_exception
, b
);
10117 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10119 print_it_catch_exception
,
10120 print_one_catch_exception
,
10121 print_mention_catch_exception
10124 /* Virtual table for "catch exception unhandled" breakpoints. */
10126 static enum print_stop_action
10127 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10129 return print_it_exception (ex_catch_exception_unhandled
, b
);
10133 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10135 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10139 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10141 print_mention_exception (ex_catch_exception_unhandled
, b
);
10144 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10145 print_it_catch_exception_unhandled
,
10146 print_one_catch_exception_unhandled
,
10147 print_mention_catch_exception_unhandled
10150 /* Virtual table for "catch assert" breakpoints. */
10152 static enum print_stop_action
10153 print_it_catch_assert (struct breakpoint
*b
)
10155 return print_it_exception (ex_catch_assert
, b
);
10159 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10161 print_one_exception (ex_catch_assert
, b
, last_addr
);
10165 print_mention_catch_assert (struct breakpoint
*b
)
10167 print_mention_exception (ex_catch_assert
, b
);
10170 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10171 print_it_catch_assert
,
10172 print_one_catch_assert
,
10173 print_mention_catch_assert
10176 /* Return non-zero if B is an Ada exception catchpoint. */
10179 ada_exception_catchpoint_p (struct breakpoint
*b
)
10181 return (b
->ops
== &catch_exception_breakpoint_ops
10182 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10183 || b
->ops
== &catch_assert_breakpoint_ops
);
10186 /* Return a newly allocated copy of the first space-separated token
10187 in ARGSP, and then adjust ARGSP to point immediately after that
10190 Return NULL if ARGPS does not contain any more tokens. */
10193 ada_get_next_arg (char **argsp
)
10195 char *args
= *argsp
;
10199 /* Skip any leading white space. */
10201 while (isspace (*args
))
10204 if (args
[0] == '\0')
10205 return NULL
; /* No more arguments. */
10207 /* Find the end of the current argument. */
10210 while (*end
!= '\0' && !isspace (*end
))
10213 /* Adjust ARGSP to point to the start of the next argument. */
10217 /* Make a copy of the current argument and return it. */
10219 result
= xmalloc (end
- args
+ 1);
10220 strncpy (result
, args
, end
- args
);
10221 result
[end
- args
] = '\0';
10226 /* Split the arguments specified in a "catch exception" command.
10227 Set EX to the appropriate catchpoint type.
10228 Set EXP_STRING to the name of the specific exception if
10229 specified by the user. */
10232 catch_ada_exception_command_split (char *args
,
10233 enum exception_catchpoint_kind
*ex
,
10236 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10237 char *exception_name
;
10239 exception_name
= ada_get_next_arg (&args
);
10240 make_cleanup (xfree
, exception_name
);
10242 /* Check that we do not have any more arguments. Anything else
10245 while (isspace (*args
))
10248 if (args
[0] != '\0')
10249 error (_("Junk at end of expression"));
10251 discard_cleanups (old_chain
);
10253 if (exception_name
== NULL
)
10255 /* Catch all exceptions. */
10256 *ex
= ex_catch_exception
;
10257 *exp_string
= NULL
;
10259 else if (strcmp (exception_name
, "unhandled") == 0)
10261 /* Catch unhandled exceptions. */
10262 *ex
= ex_catch_exception_unhandled
;
10263 *exp_string
= NULL
;
10267 /* Catch a specific exception. */
10268 *ex
= ex_catch_exception
;
10269 *exp_string
= exception_name
;
10273 /* Return the name of the symbol on which we should break in order to
10274 implement a catchpoint of the EX kind. */
10276 static const char *
10277 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10279 gdb_assert (exception_info
!= NULL
);
10283 case ex_catch_exception
:
10284 return (exception_info
->catch_exception_sym
);
10286 case ex_catch_exception_unhandled
:
10287 return (exception_info
->catch_exception_unhandled_sym
);
10289 case ex_catch_assert
:
10290 return (exception_info
->catch_assert_sym
);
10293 internal_error (__FILE__
, __LINE__
,
10294 _("unexpected catchpoint kind (%d)"), ex
);
10298 /* Return the breakpoint ops "virtual table" used for catchpoints
10301 static struct breakpoint_ops
*
10302 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10306 case ex_catch_exception
:
10307 return (&catch_exception_breakpoint_ops
);
10309 case ex_catch_exception_unhandled
:
10310 return (&catch_exception_unhandled_breakpoint_ops
);
10312 case ex_catch_assert
:
10313 return (&catch_assert_breakpoint_ops
);
10316 internal_error (__FILE__
, __LINE__
,
10317 _("unexpected catchpoint kind (%d)"), ex
);
10321 /* Return the condition that will be used to match the current exception
10322 being raised with the exception that the user wants to catch. This
10323 assumes that this condition is used when the inferior just triggered
10324 an exception catchpoint.
10326 The string returned is a newly allocated string that needs to be
10327 deallocated later. */
10330 ada_exception_catchpoint_cond_string (const char *exp_string
)
10332 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10335 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10337 static struct expression
*
10338 ada_parse_catchpoint_condition (char *cond_string
,
10339 struct symtab_and_line sal
)
10341 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10344 /* Return the symtab_and_line that should be used to insert an exception
10345 catchpoint of the TYPE kind.
10347 EX_STRING should contain the name of a specific exception
10348 that the catchpoint should catch, or NULL otherwise.
10350 The idea behind all the remaining parameters is that their names match
10351 the name of certain fields in the breakpoint structure that are used to
10352 handle exception catchpoints. This function returns the value to which
10353 these fields should be set, depending on the type of catchpoint we need
10356 If COND and COND_STRING are both non-NULL, any value they might
10357 hold will be free'ed, and then replaced by newly allocated ones.
10358 These parameters are left untouched otherwise. */
10360 static struct symtab_and_line
10361 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10362 char **addr_string
, char **cond_string
,
10363 struct expression
**cond
, struct breakpoint_ops
**ops
)
10365 const char *sym_name
;
10366 struct symbol
*sym
;
10367 struct symtab_and_line sal
;
10369 /* First, find out which exception support info to use. */
10370 ada_exception_support_info_sniffer ();
10372 /* Then lookup the function on which we will break in order to catch
10373 the Ada exceptions requested by the user. */
10375 sym_name
= ada_exception_sym_name (ex
);
10376 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10378 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10379 that should be compiled with debugging information. As a result, we
10380 expect to find that symbol in the symtabs. If we don't find it, then
10381 the target most likely does not support Ada exceptions, or we cannot
10382 insert exception breakpoints yet, because the GNAT runtime hasn't been
10385 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10386 in such a way that no debugging information is produced for the symbol
10387 we are looking for. In this case, we could search the minimal symbols
10388 as a fall-back mechanism. This would still be operating in degraded
10389 mode, however, as we would still be missing the debugging information
10390 that is needed in order to extract the name of the exception being
10391 raised (this name is printed in the catchpoint message, and is also
10392 used when trying to catch a specific exception). We do not handle
10393 this case for now. */
10396 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10398 /* Make sure that the symbol we found corresponds to a function. */
10399 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10400 error (_("Symbol \"%s\" is not a function (class = %d)"),
10401 sym_name
, SYMBOL_CLASS (sym
));
10403 sal
= find_function_start_sal (sym
, 1);
10405 /* Set ADDR_STRING. */
10407 *addr_string
= xstrdup (sym_name
);
10409 /* Set the COND and COND_STRING (if not NULL). */
10411 if (cond_string
!= NULL
&& cond
!= NULL
)
10413 if (*cond_string
!= NULL
)
10415 xfree (*cond_string
);
10416 *cond_string
= NULL
;
10423 if (exp_string
!= NULL
)
10425 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10426 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10431 *ops
= ada_exception_breakpoint_ops (ex
);
10436 /* Parse the arguments (ARGS) of the "catch exception" command.
10438 Set TYPE to the appropriate exception catchpoint type.
10439 If the user asked the catchpoint to catch only a specific
10440 exception, then save the exception name in ADDR_STRING.
10442 See ada_exception_sal for a description of all the remaining
10443 function arguments of this function. */
10445 struct symtab_and_line
10446 ada_decode_exception_location (char *args
, char **addr_string
,
10447 char **exp_string
, char **cond_string
,
10448 struct expression
**cond
,
10449 struct breakpoint_ops
**ops
)
10451 enum exception_catchpoint_kind ex
;
10453 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10454 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10458 struct symtab_and_line
10459 ada_decode_assert_location (char *args
, char **addr_string
,
10460 struct breakpoint_ops
**ops
)
10462 /* Check that no argument where provided at the end of the command. */
10466 while (isspace (*args
))
10469 error (_("Junk at end of arguments."));
10472 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10477 /* Information about operators given special treatment in functions
10479 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10481 #define ADA_OPERATORS \
10482 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10483 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10484 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10485 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10486 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10487 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10488 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10489 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10490 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10491 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10492 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10493 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10494 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10495 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10496 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10497 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10498 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10499 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10500 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10503 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10505 switch (exp
->elts
[pc
- 1].opcode
)
10508 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10511 #define OP_DEFN(op, len, args, binop) \
10512 case op: *oplenp = len; *argsp = args; break;
10518 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10523 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10529 ada_op_name (enum exp_opcode opcode
)
10534 return op_name_standard (opcode
);
10536 #define OP_DEFN(op, len, args, binop) case op: return #op;
10541 return "OP_AGGREGATE";
10543 return "OP_CHOICES";
10549 /* As for operator_length, but assumes PC is pointing at the first
10550 element of the operator, and gives meaningful results only for the
10551 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10554 ada_forward_operator_length (struct expression
*exp
, int pc
,
10555 int *oplenp
, int *argsp
)
10557 switch (exp
->elts
[pc
].opcode
)
10560 *oplenp
= *argsp
= 0;
10563 #define OP_DEFN(op, len, args, binop) \
10564 case op: *oplenp = len; *argsp = args; break;
10570 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10575 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10581 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10582 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10590 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10592 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10597 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10601 /* Ada attributes ('Foo). */
10604 case OP_ATR_LENGTH
:
10608 case OP_ATR_MODULUS
:
10615 case UNOP_IN_RANGE
:
10617 /* XXX: gdb_sprint_host_address, type_sprint */
10618 fprintf_filtered (stream
, _("Type @"));
10619 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10620 fprintf_filtered (stream
, " (");
10621 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10622 fprintf_filtered (stream
, ")");
10624 case BINOP_IN_BOUNDS
:
10625 fprintf_filtered (stream
, " (%d)",
10626 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10628 case TERNOP_IN_RANGE
:
10633 case OP_DISCRETE_RANGE
:
10634 case OP_POSITIONAL
:
10641 char *name
= &exp
->elts
[elt
+ 2].string
;
10642 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10643 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10648 return dump_subexp_body_standard (exp
, stream
, elt
);
10652 for (i
= 0; i
< nargs
; i
+= 1)
10653 elt
= dump_subexp (exp
, stream
, elt
);
10658 /* The Ada extension of print_subexp (q.v.). */
10661 ada_print_subexp (struct expression
*exp
, int *pos
,
10662 struct ui_file
*stream
, enum precedence prec
)
10664 int oplen
, nargs
, i
;
10666 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10668 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10675 print_subexp_standard (exp
, pos
, stream
, prec
);
10679 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10682 case BINOP_IN_BOUNDS
:
10683 /* XXX: sprint_subexp */
10684 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10685 fputs_filtered (" in ", stream
);
10686 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10687 fputs_filtered ("'range", stream
);
10688 if (exp
->elts
[pc
+ 1].longconst
> 1)
10689 fprintf_filtered (stream
, "(%ld)",
10690 (long) exp
->elts
[pc
+ 1].longconst
);
10693 case TERNOP_IN_RANGE
:
10694 if (prec
>= PREC_EQUAL
)
10695 fputs_filtered ("(", stream
);
10696 /* XXX: sprint_subexp */
10697 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10698 fputs_filtered (" in ", stream
);
10699 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10700 fputs_filtered (" .. ", stream
);
10701 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10702 if (prec
>= PREC_EQUAL
)
10703 fputs_filtered (")", stream
);
10708 case OP_ATR_LENGTH
:
10712 case OP_ATR_MODULUS
:
10717 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10719 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10720 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10724 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10725 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10729 for (tem
= 1; tem
< nargs
; tem
+= 1)
10731 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10732 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10734 fputs_filtered (")", stream
);
10739 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10740 fputs_filtered ("'(", stream
);
10741 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10742 fputs_filtered (")", stream
);
10745 case UNOP_IN_RANGE
:
10746 /* XXX: sprint_subexp */
10747 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10748 fputs_filtered (" in ", stream
);
10749 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10752 case OP_DISCRETE_RANGE
:
10753 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10754 fputs_filtered ("..", stream
);
10755 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10759 fputs_filtered ("others => ", stream
);
10760 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10764 for (i
= 0; i
< nargs
-1; i
+= 1)
10767 fputs_filtered ("|", stream
);
10768 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10770 fputs_filtered (" => ", stream
);
10771 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10774 case OP_POSITIONAL
:
10775 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10779 fputs_filtered ("(", stream
);
10780 for (i
= 0; i
< nargs
; i
+= 1)
10783 fputs_filtered (", ", stream
);
10784 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10786 fputs_filtered (")", stream
);
10791 /* Table mapping opcodes into strings for printing operators
10792 and precedences of the operators. */
10794 static const struct op_print ada_op_print_tab
[] = {
10795 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10796 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10797 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10798 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10799 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10800 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10801 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10802 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10803 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10804 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10805 {">", BINOP_GTR
, PREC_ORDER
, 0},
10806 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10807 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10808 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10809 {"+", BINOP_ADD
, PREC_ADD
, 0},
10810 {"-", BINOP_SUB
, PREC_ADD
, 0},
10811 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10812 {"*", BINOP_MUL
, PREC_MUL
, 0},
10813 {"/", BINOP_DIV
, PREC_MUL
, 0},
10814 {"rem", BINOP_REM
, PREC_MUL
, 0},
10815 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10816 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10817 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10818 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10819 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10820 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10821 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10822 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10823 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10824 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10825 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10829 enum ada_primitive_types
{
10830 ada_primitive_type_int
,
10831 ada_primitive_type_long
,
10832 ada_primitive_type_short
,
10833 ada_primitive_type_char
,
10834 ada_primitive_type_float
,
10835 ada_primitive_type_double
,
10836 ada_primitive_type_void
,
10837 ada_primitive_type_long_long
,
10838 ada_primitive_type_long_double
,
10839 ada_primitive_type_natural
,
10840 ada_primitive_type_positive
,
10841 ada_primitive_type_system_address
,
10842 nr_ada_primitive_types
10846 ada_language_arch_info (struct gdbarch
*gdbarch
,
10847 struct language_arch_info
*lai
)
10849 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10850 lai
->primitive_type_vector
10851 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10853 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10854 init_type (TYPE_CODE_INT
,
10855 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10856 0, "integer", (struct objfile
*) NULL
);
10857 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10858 init_type (TYPE_CODE_INT
,
10859 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10860 0, "long_integer", (struct objfile
*) NULL
);
10861 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10862 init_type (TYPE_CODE_INT
,
10863 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10864 0, "short_integer", (struct objfile
*) NULL
);
10865 lai
->string_char_type
=
10866 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10867 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10868 0, "character", (struct objfile
*) NULL
);
10869 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10870 init_type (TYPE_CODE_FLT
,
10871 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10872 0, "float", (struct objfile
*) NULL
);
10873 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10874 init_type (TYPE_CODE_FLT
,
10875 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10876 0, "long_float", (struct objfile
*) NULL
);
10877 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10878 init_type (TYPE_CODE_INT
,
10879 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10880 0, "long_long_integer", (struct objfile
*) NULL
);
10881 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10882 init_type (TYPE_CODE_FLT
,
10883 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10884 0, "long_long_float", (struct objfile
*) NULL
);
10885 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10886 init_type (TYPE_CODE_INT
,
10887 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10888 0, "natural", (struct objfile
*) NULL
);
10889 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10890 init_type (TYPE_CODE_INT
,
10891 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10892 0, "positive", (struct objfile
*) NULL
);
10893 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10895 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10896 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10897 (struct objfile
*) NULL
));
10898 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10899 = "system__address";
10902 /* Language vector */
10904 /* Not really used, but needed in the ada_language_defn. */
10907 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10909 ada_emit_char (c
, stream
, quoter
, 1);
10915 warnings_issued
= 0;
10916 return ada_parse ();
10919 static const struct exp_descriptor ada_exp_descriptor
= {
10921 ada_operator_length
,
10923 ada_dump_subexp_body
,
10924 ada_evaluate_subexp
10927 const struct language_defn ada_language_defn
= {
10928 "ada", /* Language name */
10932 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10933 that's not quite what this means. */
10935 &ada_exp_descriptor
,
10939 ada_printchar
, /* Print a character constant */
10940 ada_printstr
, /* Function to print string constant */
10941 emit_char
, /* Function to print single char (not used) */
10942 ada_print_type
, /* Print a type using appropriate syntax */
10943 ada_val_print
, /* Print a value using appropriate syntax */
10944 ada_value_print
, /* Print a top-level value */
10945 NULL
, /* Language specific skip_trampoline */
10946 NULL
, /* name_of_this */
10947 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10948 basic_lookup_transparent_type
, /* lookup_transparent_type */
10949 ada_la_decode
, /* Language specific symbol demangler */
10950 NULL
, /* Language specific class_name_from_physname */
10951 ada_op_print_tab
, /* expression operators for printing */
10952 0, /* c-style arrays */
10953 1, /* String lower bound */
10954 ada_get_gdb_completer_word_break_characters
,
10955 ada_make_symbol_completion_list
,
10956 ada_language_arch_info
,
10957 ada_print_array_index
,
10958 default_pass_by_reference
,
10963 _initialize_ada_language (void)
10965 add_language (&ada_language_defn
);
10967 varsize_limit
= 65536;
10969 obstack_init (&symbol_list_obstack
);
10971 decoded_names_store
= htab_create_alloc
10972 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10973 NULL
, xcalloc
, xfree
);
10975 observer_attach_executable_changed (ada_executable_changed_observer
);