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
))
2894 case LOC_REGPARM_ADDR
:
2897 case LOC_BASEREG_ARG
:
2899 case LOC_COMPUTED_ARG
:
2905 if (j
< n_candidates
)
2908 while (j
< n_candidates
)
2910 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2912 candidates
[j
] = candidates
[n_candidates
- 1];
2921 if (n_candidates
== 0)
2922 error (_("No definition found for %s"),
2923 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2924 else if (n_candidates
== 1)
2926 else if (deprocedure_p
2927 && !is_nonfunction (candidates
, n_candidates
))
2929 i
= ada_resolve_function
2930 (candidates
, n_candidates
, NULL
, 0,
2931 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2934 error (_("Could not find a match for %s"),
2935 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2939 printf_filtered (_("Multiple matches for %s\n"),
2940 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2941 user_select_syms (candidates
, n_candidates
, 1);
2945 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2946 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2947 if (innermost_block
== NULL
2948 || contained_in (candidates
[i
].block
, innermost_block
))
2949 innermost_block
= candidates
[i
].block
;
2953 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2956 replace_operator_with_call (expp
, pc
, 0, 0,
2957 exp
->elts
[pc
+ 2].symbol
,
2958 exp
->elts
[pc
+ 1].block
);
2965 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2966 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2968 struct ada_symbol_info
*candidates
;
2972 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2973 (exp
->elts
[pc
+ 5].symbol
),
2974 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2976 if (n_candidates
== 1)
2980 i
= ada_resolve_function
2981 (candidates
, n_candidates
,
2983 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2986 error (_("Could not find a match for %s"),
2987 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2990 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2991 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2992 if (innermost_block
== NULL
2993 || contained_in (candidates
[i
].block
, innermost_block
))
2994 innermost_block
= candidates
[i
].block
;
3005 case BINOP_BITWISE_AND
:
3006 case BINOP_BITWISE_IOR
:
3007 case BINOP_BITWISE_XOR
:
3009 case BINOP_NOTEQUAL
:
3017 case UNOP_LOGICAL_NOT
:
3019 if (possible_user_operator_p (op
, argvec
))
3021 struct ada_symbol_info
*candidates
;
3025 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3026 (struct block
*) NULL
, VAR_DOMAIN
,
3028 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3029 ada_decoded_op_name (op
), NULL
);
3033 replace_operator_with_call (expp
, pc
, nargs
, 1,
3034 candidates
[i
].sym
, candidates
[i
].block
);
3045 return evaluate_subexp_type (exp
, pos
);
3048 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3049 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3050 a non-pointer. A type of 'void' (which is never a valid expression type)
3051 by convention matches anything. */
3052 /* The term "match" here is rather loose. The match is heuristic and
3053 liberal. FIXME: TOO liberal, in fact. */
3056 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3058 ftype
= ada_check_typedef (ftype
);
3059 atype
= ada_check_typedef (atype
);
3061 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3062 ftype
= TYPE_TARGET_TYPE (ftype
);
3063 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3064 atype
= TYPE_TARGET_TYPE (atype
);
3066 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3067 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3070 switch (TYPE_CODE (ftype
))
3075 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3076 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3077 TYPE_TARGET_TYPE (atype
), 0);
3080 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3082 case TYPE_CODE_ENUM
:
3083 case TYPE_CODE_RANGE
:
3084 switch (TYPE_CODE (atype
))
3087 case TYPE_CODE_ENUM
:
3088 case TYPE_CODE_RANGE
:
3094 case TYPE_CODE_ARRAY
:
3095 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3096 || ada_is_array_descriptor_type (atype
));
3098 case TYPE_CODE_STRUCT
:
3099 if (ada_is_array_descriptor_type (ftype
))
3100 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3101 || ada_is_array_descriptor_type (atype
));
3103 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3104 && !ada_is_array_descriptor_type (atype
));
3106 case TYPE_CODE_UNION
:
3108 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3112 /* Return non-zero if the formals of FUNC "sufficiently match" the
3113 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3114 may also be an enumeral, in which case it is treated as a 0-
3115 argument function. */
3118 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3121 struct type
*func_type
= SYMBOL_TYPE (func
);
3123 if (SYMBOL_CLASS (func
) == LOC_CONST
3124 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3125 return (n_actuals
== 0);
3126 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3129 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3132 for (i
= 0; i
< n_actuals
; i
+= 1)
3134 if (actuals
[i
] == NULL
)
3138 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3139 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3141 if (!ada_type_match (ftype
, atype
, 1))
3148 /* False iff function type FUNC_TYPE definitely does not produce a value
3149 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3150 FUNC_TYPE is not a valid function type with a non-null return type
3151 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3154 return_match (struct type
*func_type
, struct type
*context_type
)
3156 struct type
*return_type
;
3158 if (func_type
== NULL
)
3161 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3162 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3164 return_type
= base_type (func_type
);
3165 if (return_type
== NULL
)
3168 context_type
= base_type (context_type
);
3170 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3171 return context_type
== NULL
|| return_type
== context_type
;
3172 else if (context_type
== NULL
)
3173 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3175 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3179 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3180 function (if any) that matches the types of the NARGS arguments in
3181 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3182 that returns that type, then eliminate matches that don't. If
3183 CONTEXT_TYPE is void and there is at least one match that does not
3184 return void, eliminate all matches that do.
3186 Asks the user if there is more than one match remaining. Returns -1
3187 if there is no such symbol or none is selected. NAME is used
3188 solely for messages. May re-arrange and modify SYMS in
3189 the process; the index returned is for the modified vector. */
3192 ada_resolve_function (struct ada_symbol_info syms
[],
3193 int nsyms
, struct value
**args
, int nargs
,
3194 const char *name
, struct type
*context_type
)
3197 int m
; /* Number of hits */
3198 struct type
*fallback
;
3199 struct type
*return_type
;
3201 return_type
= context_type
;
3202 if (context_type
== NULL
)
3203 fallback
= builtin_type_void
;
3210 for (k
= 0; k
< nsyms
; k
+= 1)
3212 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3214 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3215 && return_match (type
, return_type
))
3221 if (m
> 0 || return_type
== fallback
)
3224 return_type
= fallback
;
3231 printf_filtered (_("Multiple matches for %s\n"), name
);
3232 user_select_syms (syms
, m
, 1);
3238 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3239 in a listing of choices during disambiguation (see sort_choices, below).
3240 The idea is that overloadings of a subprogram name from the
3241 same package should sort in their source order. We settle for ordering
3242 such symbols by their trailing number (__N or $N). */
3245 encoded_ordered_before (char *N0
, char *N1
)
3249 else if (N0
== NULL
)
3254 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3256 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3258 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3259 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3263 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3266 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3268 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3269 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3271 return (strcmp (N0
, N1
) < 0);
3275 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3279 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3282 for (i
= 1; i
< nsyms
; i
+= 1)
3284 struct ada_symbol_info sym
= syms
[i
];
3287 for (j
= i
- 1; j
>= 0; j
-= 1)
3289 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3290 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3292 syms
[j
+ 1] = syms
[j
];
3298 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3299 by asking the user (if necessary), returning the number selected,
3300 and setting the first elements of SYMS items. Error if no symbols
3303 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3304 to be re-integrated one of these days. */
3307 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3310 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3312 int first_choice
= (max_results
== 1) ? 1 : 2;
3313 const char *select_mode
= multiple_symbols_select_mode ();
3315 if (max_results
< 1)
3316 error (_("Request to select 0 symbols!"));
3320 if (select_mode
== multiple_symbols_cancel
)
3322 canceled because the command is ambiguous\n\
3323 See set/show multiple-symbol."));
3325 /* If select_mode is "all", then return all possible symbols.
3326 Only do that if more than one symbol can be selected, of course.
3327 Otherwise, display the menu as usual. */
3328 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3331 printf_unfiltered (_("[0] cancel\n"));
3332 if (max_results
> 1)
3333 printf_unfiltered (_("[1] all\n"));
3335 sort_choices (syms
, nsyms
);
3337 for (i
= 0; i
< nsyms
; i
+= 1)
3339 if (syms
[i
].sym
== NULL
)
3342 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3344 struct symtab_and_line sal
=
3345 find_function_start_sal (syms
[i
].sym
, 1);
3346 if (sal
.symtab
== NULL
)
3347 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3349 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3352 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3353 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3354 sal
.symtab
->filename
, sal
.line
);
3360 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3361 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3362 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3363 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3365 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3366 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3368 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3369 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3370 else if (is_enumeral
3371 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3373 printf_unfiltered (("[%d] "), i
+ first_choice
);
3374 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3376 printf_unfiltered (_("'(%s) (enumeral)\n"),
3377 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3379 else if (symtab
!= NULL
)
3380 printf_unfiltered (is_enumeral
3381 ? _("[%d] %s in %s (enumeral)\n")
3382 : _("[%d] %s at %s:?\n"),
3384 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3387 printf_unfiltered (is_enumeral
3388 ? _("[%d] %s (enumeral)\n")
3389 : _("[%d] %s at ?\n"),
3391 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3395 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3398 for (i
= 0; i
< n_chosen
; i
+= 1)
3399 syms
[i
] = syms
[chosen
[i
]];
3404 /* Read and validate a set of numeric choices from the user in the
3405 range 0 .. N_CHOICES-1. Place the results in increasing
3406 order in CHOICES[0 .. N-1], and return N.
3408 The user types choices as a sequence of numbers on one line
3409 separated by blanks, encoding them as follows:
3411 + A choice of 0 means to cancel the selection, throwing an error.
3412 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3413 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3415 The user is not allowed to choose more than MAX_RESULTS values.
3417 ANNOTATION_SUFFIX, if present, is used to annotate the input
3418 prompts (for use with the -f switch). */
3421 get_selections (int *choices
, int n_choices
, int max_results
,
3422 int is_all_choice
, char *annotation_suffix
)
3427 int first_choice
= is_all_choice
? 2 : 1;
3429 prompt
= getenv ("PS2");
3433 args
= command_line_input (prompt
, 0, annotation_suffix
);
3436 error_no_arg (_("one or more choice numbers"));
3440 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3441 order, as given in args. Choices are validated. */
3447 while (isspace (*args
))
3449 if (*args
== '\0' && n_chosen
== 0)
3450 error_no_arg (_("one or more choice numbers"));
3451 else if (*args
== '\0')
3454 choice
= strtol (args
, &args2
, 10);
3455 if (args
== args2
|| choice
< 0
3456 || choice
> n_choices
+ first_choice
- 1)
3457 error (_("Argument must be choice number"));
3461 error (_("cancelled"));
3463 if (choice
< first_choice
)
3465 n_chosen
= n_choices
;
3466 for (j
= 0; j
< n_choices
; j
+= 1)
3470 choice
-= first_choice
;
3472 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3476 if (j
< 0 || choice
!= choices
[j
])
3479 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3480 choices
[k
+ 1] = choices
[k
];
3481 choices
[j
+ 1] = choice
;
3486 if (n_chosen
> max_results
)
3487 error (_("Select no more than %d of the above"), max_results
);
3492 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3493 on the function identified by SYM and BLOCK, and taking NARGS
3494 arguments. Update *EXPP as needed to hold more space. */
3497 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3498 int oplen
, struct symbol
*sym
,
3499 struct block
*block
)
3501 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3502 symbol, -oplen for operator being replaced). */
3503 struct expression
*newexp
= (struct expression
*)
3504 xmalloc (sizeof (struct expression
)
3505 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3506 struct expression
*exp
= *expp
;
3508 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3509 newexp
->language_defn
= exp
->language_defn
;
3510 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3511 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3512 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3514 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3515 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3517 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3518 newexp
->elts
[pc
+ 4].block
= block
;
3519 newexp
->elts
[pc
+ 5].symbol
= sym
;
3525 /* Type-class predicates */
3527 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3531 numeric_type_p (struct type
*type
)
3537 switch (TYPE_CODE (type
))
3542 case TYPE_CODE_RANGE
:
3543 return (type
== TYPE_TARGET_TYPE (type
)
3544 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3551 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3554 integer_type_p (struct type
*type
)
3560 switch (TYPE_CODE (type
))
3564 case TYPE_CODE_RANGE
:
3565 return (type
== TYPE_TARGET_TYPE (type
)
3566 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3573 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3576 scalar_type_p (struct type
*type
)
3582 switch (TYPE_CODE (type
))
3585 case TYPE_CODE_RANGE
:
3586 case TYPE_CODE_ENUM
:
3595 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3598 discrete_type_p (struct type
*type
)
3604 switch (TYPE_CODE (type
))
3607 case TYPE_CODE_RANGE
:
3608 case TYPE_CODE_ENUM
:
3616 /* Returns non-zero if OP with operands in the vector ARGS could be
3617 a user-defined function. Errs on the side of pre-defined operators
3618 (i.e., result 0). */
3621 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3623 struct type
*type0
=
3624 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3625 struct type
*type1
=
3626 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3640 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3644 case BINOP_BITWISE_AND
:
3645 case BINOP_BITWISE_IOR
:
3646 case BINOP_BITWISE_XOR
:
3647 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3650 case BINOP_NOTEQUAL
:
3655 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3658 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3661 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3665 case UNOP_LOGICAL_NOT
:
3667 return (!numeric_type_p (type0
));
3676 1. In the following, we assume that a renaming type's name may
3677 have an ___XD suffix. It would be nice if this went away at some
3679 2. We handle both the (old) purely type-based representation of
3680 renamings and the (new) variable-based encoding. At some point,
3681 it is devoutly to be hoped that the former goes away
3682 (FIXME: hilfinger-2007-07-09).
3683 3. Subprogram renamings are not implemented, although the XRS
3684 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3686 /* If SYM encodes a renaming,
3688 <renaming> renames <renamed entity>,
3690 sets *LEN to the length of the renamed entity's name,
3691 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3692 the string describing the subcomponent selected from the renamed
3693 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3694 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3695 are undefined). Otherwise, returns a value indicating the category
3696 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3697 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3698 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3699 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3700 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3701 may be NULL, in which case they are not assigned.
3703 [Currently, however, GCC does not generate subprogram renamings.] */
3705 enum ada_renaming_category
3706 ada_parse_renaming (struct symbol
*sym
,
3707 const char **renamed_entity
, int *len
,
3708 const char **renaming_expr
)
3710 enum ada_renaming_category kind
;
3715 return ADA_NOT_RENAMING
;
3716 switch (SYMBOL_CLASS (sym
))
3719 return ADA_NOT_RENAMING
;
3721 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3722 renamed_entity
, len
, renaming_expr
);
3726 case LOC_OPTIMIZED_OUT
:
3727 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3729 return ADA_NOT_RENAMING
;
3733 kind
= ADA_OBJECT_RENAMING
;
3737 kind
= ADA_EXCEPTION_RENAMING
;
3741 kind
= ADA_PACKAGE_RENAMING
;
3745 kind
= ADA_SUBPROGRAM_RENAMING
;
3749 return ADA_NOT_RENAMING
;
3753 if (renamed_entity
!= NULL
)
3754 *renamed_entity
= info
;
3755 suffix
= strstr (info
, "___XE");
3756 if (suffix
== NULL
|| suffix
== info
)
3757 return ADA_NOT_RENAMING
;
3759 *len
= strlen (info
) - strlen (suffix
);
3761 if (renaming_expr
!= NULL
)
3762 *renaming_expr
= suffix
;
3766 /* Assuming TYPE encodes a renaming according to the old encoding in
3767 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3768 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3769 ADA_NOT_RENAMING otherwise. */
3770 static enum ada_renaming_category
3771 parse_old_style_renaming (struct type
*type
,
3772 const char **renamed_entity
, int *len
,
3773 const char **renaming_expr
)
3775 enum ada_renaming_category kind
;
3780 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3781 || TYPE_NFIELDS (type
) != 1)
3782 return ADA_NOT_RENAMING
;
3784 name
= type_name_no_tag (type
);
3786 return ADA_NOT_RENAMING
;
3788 name
= strstr (name
, "___XR");
3790 return ADA_NOT_RENAMING
;
3795 kind
= ADA_OBJECT_RENAMING
;
3798 kind
= ADA_EXCEPTION_RENAMING
;
3801 kind
= ADA_PACKAGE_RENAMING
;
3804 kind
= ADA_SUBPROGRAM_RENAMING
;
3807 return ADA_NOT_RENAMING
;
3810 info
= TYPE_FIELD_NAME (type
, 0);
3812 return ADA_NOT_RENAMING
;
3813 if (renamed_entity
!= NULL
)
3814 *renamed_entity
= info
;
3815 suffix
= strstr (info
, "___XE");
3816 if (renaming_expr
!= NULL
)
3817 *renaming_expr
= suffix
+ 5;
3818 if (suffix
== NULL
|| suffix
== info
)
3819 return ADA_NOT_RENAMING
;
3821 *len
= suffix
- info
;
3827 /* Evaluation: Function Calls */
3829 /* Return an lvalue containing the value VAL. This is the identity on
3830 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3831 on the stack, using and updating *SP as the stack pointer, and
3832 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3834 static struct value
*
3835 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3837 if (! VALUE_LVAL (val
))
3839 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3841 /* The following is taken from the structure-return code in
3842 call_function_by_hand. FIXME: Therefore, some refactoring seems
3844 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3846 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3847 reserving sufficient space. */
3849 if (gdbarch_frame_align_p (current_gdbarch
))
3850 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3851 VALUE_ADDRESS (val
) = *sp
;
3855 /* Stack grows upward. Align the frame, allocate space, and
3856 then again, re-align the frame. */
3857 if (gdbarch_frame_align_p (current_gdbarch
))
3858 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3859 VALUE_ADDRESS (val
) = *sp
;
3861 if (gdbarch_frame_align_p (current_gdbarch
))
3862 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3864 VALUE_LVAL (val
) = lval_memory
;
3866 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3872 /* Return the value ACTUAL, converted to be an appropriate value for a
3873 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3874 allocating any necessary descriptors (fat pointers), or copies of
3875 values not residing in memory, updating it as needed. */
3878 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3881 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3882 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3883 struct type
*formal_target
=
3884 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3885 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3886 struct type
*actual_target
=
3887 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3888 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3890 if (ada_is_array_descriptor_type (formal_target
)
3891 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3892 return make_array_descriptor (formal_type
, actual
, sp
);
3893 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3894 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3896 struct value
*result
;
3897 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3898 && ada_is_array_descriptor_type (actual_target
))
3899 result
= desc_data (actual
);
3900 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3902 if (VALUE_LVAL (actual
) != lval_memory
)
3905 actual_type
= ada_check_typedef (value_type (actual
));
3906 val
= allocate_value (actual_type
);
3907 memcpy ((char *) value_contents_raw (val
),
3908 (char *) value_contents (actual
),
3909 TYPE_LENGTH (actual_type
));
3910 actual
= ensure_lval (val
, sp
);
3912 result
= value_addr (actual
);
3916 return value_cast_pointers (formal_type
, result
);
3918 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3919 return ada_value_ind (actual
);
3925 /* Push a descriptor of type TYPE for array value ARR on the stack at
3926 *SP, updating *SP to reflect the new descriptor. Return either
3927 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3928 to-descriptor type rather than a descriptor type), a struct value *
3929 representing a pointer to this descriptor. */
3931 static struct value
*
3932 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3934 struct type
*bounds_type
= desc_bounds_type (type
);
3935 struct type
*desc_type
= desc_base_type (type
);
3936 struct value
*descriptor
= allocate_value (desc_type
);
3937 struct value
*bounds
= allocate_value (bounds_type
);
3940 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3942 modify_general_field (value_contents_writeable (bounds
),
3943 value_as_long (ada_array_bound (arr
, i
, 0)),
3944 desc_bound_bitpos (bounds_type
, i
, 0),
3945 desc_bound_bitsize (bounds_type
, i
, 0));
3946 modify_general_field (value_contents_writeable (bounds
),
3947 value_as_long (ada_array_bound (arr
, i
, 1)),
3948 desc_bound_bitpos (bounds_type
, i
, 1),
3949 desc_bound_bitsize (bounds_type
, i
, 1));
3952 bounds
= ensure_lval (bounds
, sp
);
3954 modify_general_field (value_contents_writeable (descriptor
),
3955 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3956 fat_pntr_data_bitpos (desc_type
),
3957 fat_pntr_data_bitsize (desc_type
));
3959 modify_general_field (value_contents_writeable (descriptor
),
3960 VALUE_ADDRESS (bounds
),
3961 fat_pntr_bounds_bitpos (desc_type
),
3962 fat_pntr_bounds_bitsize (desc_type
));
3964 descriptor
= ensure_lval (descriptor
, sp
);
3966 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3967 return value_addr (descriptor
);
3972 /* Dummy definitions for an experimental caching module that is not
3973 * used in the public sources. */
3976 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3977 struct symbol
**sym
, struct block
**block
)
3983 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3984 struct block
*block
)
3990 /* Return the result of a standard (literal, C-like) lookup of NAME in
3991 given DOMAIN, visible from lexical block BLOCK. */
3993 static struct symbol
*
3994 standard_lookup (const char *name
, const struct block
*block
,
3999 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
4001 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4002 cache_symbol (name
, domain
, sym
, block_found
);
4007 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4008 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4009 since they contend in overloading in the same way. */
4011 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4015 for (i
= 0; i
< n
; i
+= 1)
4016 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4017 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4018 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4024 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4025 struct types. Otherwise, they may not. */
4028 equiv_types (struct type
*type0
, struct type
*type1
)
4032 if (type0
== NULL
|| type1
== NULL
4033 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4035 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4036 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4037 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4038 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4044 /* True iff SYM0 represents the same entity as SYM1, or one that is
4045 no more defined than that of SYM1. */
4048 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4052 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4053 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4056 switch (SYMBOL_CLASS (sym0
))
4062 struct type
*type0
= SYMBOL_TYPE (sym0
);
4063 struct type
*type1
= SYMBOL_TYPE (sym1
);
4064 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4065 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4066 int len0
= strlen (name0
);
4068 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4069 && (equiv_types (type0
, type1
)
4070 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4071 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4074 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4075 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4081 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4082 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4085 add_defn_to_vec (struct obstack
*obstackp
,
4087 struct block
*block
)
4091 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4093 /* Do not try to complete stub types, as the debugger is probably
4094 already scanning all symbols matching a certain name at the
4095 time when this function is called. Trying to replace the stub
4096 type by its associated full type will cause us to restart a scan
4097 which may lead to an infinite recursion. Instead, the client
4098 collecting the matching symbols will end up collecting several
4099 matches, with at least one of them complete. It can then filter
4100 out the stub ones if needed. */
4102 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4104 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4106 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4108 prevDefns
[i
].sym
= sym
;
4109 prevDefns
[i
].block
= block
;
4115 struct ada_symbol_info info
;
4119 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4123 /* Number of ada_symbol_info structures currently collected in
4124 current vector in *OBSTACKP. */
4127 num_defns_collected (struct obstack
*obstackp
)
4129 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4132 /* Vector of ada_symbol_info structures currently collected in current
4133 vector in *OBSTACKP. If FINISH, close off the vector and return
4134 its final address. */
4136 static struct ada_symbol_info
*
4137 defns_collected (struct obstack
*obstackp
, int finish
)
4140 return obstack_finish (obstackp
);
4142 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4145 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4146 Check the global symbols if GLOBAL, the static symbols if not.
4147 Do wild-card match if WILD. */
4149 static struct partial_symbol
*
4150 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4151 int global
, domain_enum
namespace, int wild
)
4153 struct partial_symbol
**start
;
4154 int name_len
= strlen (name
);
4155 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4164 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4165 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4169 for (i
= 0; i
< length
; i
+= 1)
4171 struct partial_symbol
*psym
= start
[i
];
4173 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4174 SYMBOL_DOMAIN (psym
), namespace)
4175 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4189 int M
= (U
+ i
) >> 1;
4190 struct partial_symbol
*psym
= start
[M
];
4191 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4193 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4195 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4206 struct partial_symbol
*psym
= start
[i
];
4208 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4209 SYMBOL_DOMAIN (psym
), namespace))
4211 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4219 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4233 int M
= (U
+ i
) >> 1;
4234 struct partial_symbol
*psym
= start
[M
];
4235 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4237 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4239 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4250 struct partial_symbol
*psym
= start
[i
];
4252 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4253 SYMBOL_DOMAIN (psym
), namespace))
4257 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4260 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4262 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4272 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4282 /* Find a symbol table containing symbol SYM or NULL if none. */
4284 static struct symtab
*
4285 symtab_for_sym (struct symbol
*sym
)
4288 struct objfile
*objfile
;
4290 struct symbol
*tmp_sym
;
4291 struct dict_iterator iter
;
4294 ALL_PRIMARY_SYMTABS (objfile
, s
)
4296 switch (SYMBOL_CLASS (sym
))
4304 case LOC_CONST_BYTES
:
4305 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4306 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4308 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4309 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4315 switch (SYMBOL_CLASS (sym
))
4321 case LOC_REGPARM_ADDR
:
4325 case LOC_BASEREG_ARG
:
4327 case LOC_COMPUTED_ARG
:
4328 for (j
= FIRST_LOCAL_BLOCK
;
4329 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4331 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4332 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4343 /* Return a minimal symbol matching NAME according to Ada decoding
4344 rules. Returns NULL if there is no such minimal symbol. Names
4345 prefixed with "standard__" are handled specially: "standard__" is
4346 first stripped off, and only static and global symbols are searched. */
4348 struct minimal_symbol
*
4349 ada_lookup_simple_minsym (const char *name
)
4351 struct objfile
*objfile
;
4352 struct minimal_symbol
*msymbol
;
4355 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4357 name
+= sizeof ("standard__") - 1;
4361 wild_match
= (strstr (name
, "__") == NULL
);
4363 ALL_MSYMBOLS (objfile
, msymbol
)
4365 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4366 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4373 /* For all subprograms that statically enclose the subprogram of the
4374 selected frame, add symbols matching identifier NAME in DOMAIN
4375 and their blocks to the list of data in OBSTACKP, as for
4376 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4380 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4381 const char *name
, domain_enum
namespace,
4386 /* True if TYPE is definitely an artificial type supplied to a symbol
4387 for which no debugging information was given in the symbol file. */
4390 is_nondebugging_type (struct type
*type
)
4392 char *name
= ada_type_name (type
);
4393 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4396 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4397 duplicate other symbols in the list (The only case I know of where
4398 this happens is when object files containing stabs-in-ecoff are
4399 linked with files containing ordinary ecoff debugging symbols (or no
4400 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4401 Returns the number of items in the modified list. */
4404 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4411 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4412 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4413 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4415 for (j
= 0; j
< nsyms
; j
+= 1)
4418 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4419 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4420 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4421 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4422 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4423 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4426 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4427 syms
[k
- 1] = syms
[k
];
4440 /* Given a type that corresponds to a renaming entity, use the type name
4441 to extract the scope (package name or function name, fully qualified,
4442 and following the GNAT encoding convention) where this renaming has been
4443 defined. The string returned needs to be deallocated after use. */
4446 xget_renaming_scope (struct type
*renaming_type
)
4448 /* The renaming types adhere to the following convention:
4449 <scope>__<rename>___<XR extension>.
4450 So, to extract the scope, we search for the "___XR" extension,
4451 and then backtrack until we find the first "__". */
4453 const char *name
= type_name_no_tag (renaming_type
);
4454 char *suffix
= strstr (name
, "___XR");
4459 /* Now, backtrack a bit until we find the first "__". Start looking
4460 at suffix - 3, as the <rename> part is at least one character long. */
4462 for (last
= suffix
- 3; last
> name
; last
--)
4463 if (last
[0] == '_' && last
[1] == '_')
4466 /* Make a copy of scope and return it. */
4468 scope_len
= last
- name
;
4469 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4471 strncpy (scope
, name
, scope_len
);
4472 scope
[scope_len
] = '\0';
4477 /* Return nonzero if NAME corresponds to a package name. */
4480 is_package_name (const char *name
)
4482 /* Here, We take advantage of the fact that no symbols are generated
4483 for packages, while symbols are generated for each function.
4484 So the condition for NAME represent a package becomes equivalent
4485 to NAME not existing in our list of symbols. There is only one
4486 small complication with library-level functions (see below). */
4490 /* If it is a function that has not been defined at library level,
4491 then we should be able to look it up in the symbols. */
4492 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4495 /* Library-level function names start with "_ada_". See if function
4496 "_ada_" followed by NAME can be found. */
4498 /* Do a quick check that NAME does not contain "__", since library-level
4499 functions names cannot contain "__" in them. */
4500 if (strstr (name
, "__") != NULL
)
4503 fun_name
= xstrprintf ("_ada_%s", name
);
4505 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4508 /* Return nonzero if SYM corresponds to a renaming entity that is
4509 not visible from FUNCTION_NAME. */
4512 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4516 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4519 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4521 make_cleanup (xfree
, scope
);
4523 /* If the rename has been defined in a package, then it is visible. */
4524 if (is_package_name (scope
))
4527 /* Check that the rename is in the current function scope by checking
4528 that its name starts with SCOPE. */
4530 /* If the function name starts with "_ada_", it means that it is
4531 a library-level function. Strip this prefix before doing the
4532 comparison, as the encoding for the renaming does not contain
4534 if (strncmp (function_name
, "_ada_", 5) == 0)
4537 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4540 /* Remove entries from SYMS that corresponds to a renaming entity that
4541 is not visible from the function associated with CURRENT_BLOCK or
4542 that is superfluous due to the presence of more specific renaming
4543 information. Places surviving symbols in the initial entries of
4544 SYMS and returns the number of surviving symbols.
4547 First, in cases where an object renaming is implemented as a
4548 reference variable, GNAT may produce both the actual reference
4549 variable and the renaming encoding. In this case, we discard the
4552 Second, GNAT emits a type following a specified encoding for each renaming
4553 entity. Unfortunately, STABS currently does not support the definition
4554 of types that are local to a given lexical block, so all renamings types
4555 are emitted at library level. As a consequence, if an application
4556 contains two renaming entities using the same name, and a user tries to
4557 print the value of one of these entities, the result of the ada symbol
4558 lookup will also contain the wrong renaming type.
4560 This function partially covers for this limitation by attempting to
4561 remove from the SYMS list renaming symbols that should be visible
4562 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4563 method with the current information available. The implementation
4564 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4566 - When the user tries to print a rename in a function while there
4567 is another rename entity defined in a package: Normally, the
4568 rename in the function has precedence over the rename in the
4569 package, so the latter should be removed from the list. This is
4570 currently not the case.
4572 - This function will incorrectly remove valid renames if
4573 the CURRENT_BLOCK corresponds to a function which symbol name
4574 has been changed by an "Export" pragma. As a consequence,
4575 the user will be unable to print such rename entities. */
4578 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4579 int nsyms
, const struct block
*current_block
)
4581 struct symbol
*current_function
;
4582 char *current_function_name
;
4584 int is_new_style_renaming
;
4586 /* If there is both a renaming foo___XR... encoded as a variable and
4587 a simple variable foo in the same block, discard the latter.
4588 First, zero out such symbols, then compress. */
4589 is_new_style_renaming
= 0;
4590 for (i
= 0; i
< nsyms
; i
+= 1)
4592 struct symbol
*sym
= syms
[i
].sym
;
4593 struct block
*block
= syms
[i
].block
;
4597 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4599 name
= SYMBOL_LINKAGE_NAME (sym
);
4600 suffix
= strstr (name
, "___XR");
4604 int name_len
= suffix
- name
;
4606 is_new_style_renaming
= 1;
4607 for (j
= 0; j
< nsyms
; j
+= 1)
4608 if (i
!= j
&& syms
[j
].sym
!= NULL
4609 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4611 && block
== syms
[j
].block
)
4615 if (is_new_style_renaming
)
4619 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4620 if (syms
[j
].sym
!= NULL
)
4628 /* Extract the function name associated to CURRENT_BLOCK.
4629 Abort if unable to do so. */
4631 if (current_block
== NULL
)
4634 current_function
= block_function (current_block
);
4635 if (current_function
== NULL
)
4638 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4639 if (current_function_name
== NULL
)
4642 /* Check each of the symbols, and remove it from the list if it is
4643 a type corresponding to a renaming that is out of the scope of
4644 the current block. */
4649 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4650 == ADA_OBJECT_RENAMING
4651 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4654 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4655 syms
[j
- 1] = syms
[j
];
4665 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4666 scope and in global scopes, returning the number of matches. Sets
4667 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4668 indicating the symbols found and the blocks and symbol tables (if
4669 any) in which they were found. This vector are transient---good only to
4670 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4671 symbol match within the nest of blocks whose innermost member is BLOCK0,
4672 is the one match returned (no other matches in that or
4673 enclosing blocks is returned). If there are any matches in or
4674 surrounding BLOCK0, then these alone are returned. Otherwise, the
4675 search extends to global and file-scope (static) symbol tables.
4676 Names prefixed with "standard__" are handled specially: "standard__"
4677 is first stripped off, and only static and global symbols are searched. */
4680 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4681 domain_enum
namespace,
4682 struct ada_symbol_info
**results
)
4686 struct partial_symtab
*ps
;
4687 struct blockvector
*bv
;
4688 struct objfile
*objfile
;
4689 struct block
*block
;
4691 struct minimal_symbol
*msymbol
;
4697 obstack_free (&symbol_list_obstack
, NULL
);
4698 obstack_init (&symbol_list_obstack
);
4702 /* Search specified block and its superiors. */
4704 wild_match
= (strstr (name0
, "__") == NULL
);
4706 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4707 needed, but adding const will
4708 have a cascade effect. */
4709 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4713 name
= name0
+ sizeof ("standard__") - 1;
4717 while (block
!= NULL
)
4720 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4721 namespace, NULL
, wild_match
);
4723 /* If we found a non-function match, assume that's the one. */
4724 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4725 num_defns_collected (&symbol_list_obstack
)))
4728 block
= BLOCK_SUPERBLOCK (block
);
4731 /* If no luck so far, try to find NAME as a local symbol in some lexically
4732 enclosing subprogram. */
4733 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4734 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4735 name
, namespace, wild_match
);
4737 /* If we found ANY matches among non-global symbols, we're done. */
4739 if (num_defns_collected (&symbol_list_obstack
) > 0)
4743 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4746 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4750 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4751 tables, and psymtab's. */
4753 ALL_PRIMARY_SYMTABS (objfile
, s
)
4756 bv
= BLOCKVECTOR (s
);
4757 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4758 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4759 objfile
, wild_match
);
4762 if (namespace == VAR_DOMAIN
)
4764 ALL_MSYMBOLS (objfile
, msymbol
)
4766 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4768 switch (MSYMBOL_TYPE (msymbol
))
4770 case mst_solib_trampoline
:
4773 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4776 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4778 bv
= BLOCKVECTOR (s
);
4779 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4780 ada_add_block_symbols (&symbol_list_obstack
, block
,
4781 SYMBOL_LINKAGE_NAME (msymbol
),
4782 namespace, objfile
, wild_match
);
4784 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4786 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4787 ada_add_block_symbols (&symbol_list_obstack
, block
,
4788 SYMBOL_LINKAGE_NAME (msymbol
),
4798 ALL_PSYMTABS (objfile
, ps
)
4802 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4804 s
= PSYMTAB_TO_SYMTAB (ps
);
4807 bv
= BLOCKVECTOR (s
);
4808 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4809 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4810 namespace, objfile
, wild_match
);
4814 /* Now add symbols from all per-file blocks if we've gotten no hits
4815 (Not strictly correct, but perhaps better than an error).
4816 Do the symtabs first, then check the psymtabs. */
4818 if (num_defns_collected (&symbol_list_obstack
) == 0)
4821 ALL_PRIMARY_SYMTABS (objfile
, s
)
4824 bv
= BLOCKVECTOR (s
);
4825 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4826 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4827 objfile
, wild_match
);
4830 ALL_PSYMTABS (objfile
, ps
)
4834 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4836 s
= PSYMTAB_TO_SYMTAB (ps
);
4837 bv
= BLOCKVECTOR (s
);
4840 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4841 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4842 namespace, objfile
, wild_match
);
4848 ndefns
= num_defns_collected (&symbol_list_obstack
);
4849 *results
= defns_collected (&symbol_list_obstack
, 1);
4851 ndefns
= remove_extra_symbols (*results
, ndefns
);
4854 cache_symbol (name0
, namespace, NULL
, NULL
);
4856 if (ndefns
== 1 && cacheIfUnique
)
4857 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4859 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4865 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4866 domain_enum
namespace, struct block
**block_found
)
4868 struct ada_symbol_info
*candidates
;
4871 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4873 if (n_candidates
== 0)
4876 if (block_found
!= NULL
)
4877 *block_found
= candidates
[0].block
;
4879 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4882 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4883 scope and in global scopes, or NULL if none. NAME is folded and
4884 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4885 choosing the first symbol if there are multiple choices.
4886 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4887 table in which the symbol was found (in both cases, these
4888 assignments occur only if the pointers are non-null). */
4890 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4891 domain_enum
namespace, int *is_a_field_of_this
)
4893 if (is_a_field_of_this
!= NULL
)
4894 *is_a_field_of_this
= 0;
4897 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4898 block0
, namespace, NULL
);
4901 static struct symbol
*
4902 ada_lookup_symbol_nonlocal (const char *name
,
4903 const char *linkage_name
,
4904 const struct block
*block
,
4905 const domain_enum domain
)
4907 if (linkage_name
== NULL
)
4908 linkage_name
= name
;
4909 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4914 /* True iff STR is a possible encoded suffix of a normal Ada name
4915 that is to be ignored for matching purposes. Suffixes of parallel
4916 names (e.g., XVE) are not included here. Currently, the possible suffixes
4917 are given by either of the regular expression:
4919 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4920 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4921 _E[0-9]+[bs]$ [protected object entry suffixes]
4922 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4924 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4925 match is performed. This sequence is used to differentiate homonyms,
4926 is an optional part of a valid name suffix. */
4929 is_name_suffix (const char *str
)
4932 const char *matching
;
4933 const int len
= strlen (str
);
4935 /* Skip optional leading __[0-9]+. */
4937 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4940 while (isdigit (str
[0]))
4946 if (str
[0] == '.' || str
[0] == '$')
4949 while (isdigit (matching
[0]))
4951 if (matching
[0] == '\0')
4957 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4960 while (isdigit (matching
[0]))
4962 if (matching
[0] == '\0')
4967 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4968 with a N at the end. Unfortunately, the compiler uses the same
4969 convention for other internal types it creates. So treating
4970 all entity names that end with an "N" as a name suffix causes
4971 some regressions. For instance, consider the case of an enumerated
4972 type. To support the 'Image attribute, it creates an array whose
4974 Having a single character like this as a suffix carrying some
4975 information is a bit risky. Perhaps we should change the encoding
4976 to be something like "_N" instead. In the meantime, do not do
4977 the following check. */
4978 /* Protected Object Subprograms */
4979 if (len
== 1 && str
[0] == 'N')
4984 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4987 while (isdigit (matching
[0]))
4989 if ((matching
[0] == 'b' || matching
[0] == 's')
4990 && matching
[1] == '\0')
4994 /* ??? We should not modify STR directly, as we are doing below. This
4995 is fine in this case, but may become problematic later if we find
4996 that this alternative did not work, and want to try matching
4997 another one from the begining of STR. Since we modified it, we
4998 won't be able to find the begining of the string anymore! */
5002 while (str
[0] != '_' && str
[0] != '\0')
5004 if (str
[0] != 'n' && str
[0] != 'b')
5010 if (str
[0] == '\000')
5015 if (str
[1] != '_' || str
[2] == '\000')
5019 if (strcmp (str
+ 3, "JM") == 0)
5021 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5022 the LJM suffix in favor of the JM one. But we will
5023 still accept LJM as a valid suffix for a reasonable
5024 amount of time, just to allow ourselves to debug programs
5025 compiled using an older version of GNAT. */
5026 if (strcmp (str
+ 3, "LJM") == 0)
5030 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5031 || str
[4] == 'U' || str
[4] == 'P')
5033 if (str
[4] == 'R' && str
[5] != 'T')
5037 if (!isdigit (str
[2]))
5039 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5040 if (!isdigit (str
[k
]) && str
[k
] != '_')
5044 if (str
[0] == '$' && isdigit (str
[1]))
5046 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5047 if (!isdigit (str
[k
]) && str
[k
] != '_')
5054 /* Return nonzero if the given string starts with a dot ('.')
5055 followed by zero or more digits.
5057 Note: brobecker/2003-11-10: A forward declaration has not been
5058 added at the begining of this file yet, because this function
5059 is only used to work around a problem found during wild matching
5060 when trying to match minimal symbol names against symbol names
5061 obtained from dwarf-2 data. This function is therefore currently
5062 only used in wild_match() and is likely to be deleted when the
5063 problem in dwarf-2 is fixed. */
5066 is_dot_digits_suffix (const char *str
)
5072 while (isdigit (str
[0]))
5074 return (str
[0] == '\0');
5077 /* Return non-zero if the string starting at NAME and ending before
5078 NAME_END contains no capital letters. */
5081 is_valid_name_for_wild_match (const char *name0
)
5083 const char *decoded_name
= ada_decode (name0
);
5086 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5087 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5093 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5094 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5095 informational suffixes of NAME (i.e., for which is_name_suffix is
5099 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5106 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5107 stored in the symbol table for nested function names is sometimes
5108 different from the name of the associated entity stored in
5109 the dwarf-2 data: This is the case for nested subprograms, where
5110 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5111 while the symbol name from the dwarf-2 data does not.
5113 Although the DWARF-2 standard documents that entity names stored
5114 in the dwarf-2 data should be identical to the name as seen in
5115 the source code, GNAT takes a different approach as we already use
5116 a special encoding mechanism to convey the information so that
5117 a C debugger can still use the information generated to debug
5118 Ada programs. A corollary is that the symbol names in the dwarf-2
5119 data should match the names found in the symbol table. I therefore
5120 consider this issue as a compiler defect.
5122 Until the compiler is properly fixed, we work-around the problem
5123 by ignoring such suffixes during the match. We do so by making
5124 a copy of PATN0 and NAME0, and then by stripping such a suffix
5125 if present. We then perform the match on the resulting strings. */
5128 name_len
= strlen (name0
);
5130 name
= name_start
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5131 strcpy (name
, name0
);
5132 dot
= strrchr (name
, '.');
5133 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5136 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5137 strncpy (patn
, patn0
, patn_len
);
5138 patn
[patn_len
] = '\0';
5139 dot
= strrchr (patn
, '.');
5140 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5143 patn_len
= dot
- patn
;
5147 /* Now perform the wild match. */
5149 name_len
= strlen (name
);
5150 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5151 && strncmp (patn
, name
+ 5, patn_len
) == 0
5152 && is_name_suffix (name
+ patn_len
+ 5))
5155 while (name_len
>= patn_len
)
5157 if (strncmp (patn
, name
, patn_len
) == 0
5158 && is_name_suffix (name
+ patn_len
))
5159 return (name
== name_start
|| is_valid_name_for_wild_match (name0
));
5166 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5171 if (!islower (name
[2]))
5178 if (!islower (name
[1]))
5189 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5190 vector *defn_symbols, updating the list of symbols in OBSTACKP
5191 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5192 OBJFILE is the section containing BLOCK.
5193 SYMTAB is recorded with each symbol added. */
5196 ada_add_block_symbols (struct obstack
*obstackp
,
5197 struct block
*block
, const char *name
,
5198 domain_enum domain
, struct objfile
*objfile
,
5201 struct dict_iterator iter
;
5202 int name_len
= strlen (name
);
5203 /* A matching argument symbol, if any. */
5204 struct symbol
*arg_sym
;
5205 /* Set true when we find a matching non-argument symbol. */
5214 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5216 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5217 SYMBOL_DOMAIN (sym
), domain
)
5218 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5220 switch (SYMBOL_CLASS (sym
))
5225 case LOC_REGPARM_ADDR
:
5226 case LOC_BASEREG_ARG
:
5227 case LOC_COMPUTED_ARG
:
5230 case LOC_UNRESOLVED
:
5234 add_defn_to_vec (obstackp
,
5235 fixup_symbol_section (sym
, objfile
),
5244 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5246 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5247 SYMBOL_DOMAIN (sym
), domain
))
5249 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5251 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5253 switch (SYMBOL_CLASS (sym
))
5258 case LOC_REGPARM_ADDR
:
5259 case LOC_BASEREG_ARG
:
5260 case LOC_COMPUTED_ARG
:
5263 case LOC_UNRESOLVED
:
5267 add_defn_to_vec (obstackp
,
5268 fixup_symbol_section (sym
, objfile
),
5277 if (!found_sym
&& arg_sym
!= NULL
)
5279 add_defn_to_vec (obstackp
,
5280 fixup_symbol_section (arg_sym
, objfile
),
5289 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5291 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5292 SYMBOL_DOMAIN (sym
), domain
))
5296 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5299 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5301 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5306 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5308 switch (SYMBOL_CLASS (sym
))
5313 case LOC_REGPARM_ADDR
:
5314 case LOC_BASEREG_ARG
:
5315 case LOC_COMPUTED_ARG
:
5318 case LOC_UNRESOLVED
:
5322 add_defn_to_vec (obstackp
,
5323 fixup_symbol_section (sym
, objfile
),
5331 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5332 They aren't parameters, right? */
5333 if (!found_sym
&& arg_sym
!= NULL
)
5335 add_defn_to_vec (obstackp
,
5336 fixup_symbol_section (arg_sym
, objfile
),
5343 /* Symbol Completion */
5345 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5346 name in a form that's appropriate for the completion. The result
5347 does not need to be deallocated, but is only good until the next call.
5349 TEXT_LEN is equal to the length of TEXT.
5350 Perform a wild match if WILD_MATCH is set.
5351 ENCODED should be set if TEXT represents the start of a symbol name
5352 in its encoded form. */
5355 symbol_completion_match (const char *sym_name
,
5356 const char *text
, int text_len
,
5357 int wild_match
, int encoded
)
5360 const int verbatim_match
= (text
[0] == '<');
5365 /* Strip the leading angle bracket. */
5370 /* First, test against the fully qualified name of the symbol. */
5372 if (strncmp (sym_name
, text
, text_len
) == 0)
5375 if (match
&& !encoded
)
5377 /* One needed check before declaring a positive match is to verify
5378 that iff we are doing a verbatim match, the decoded version
5379 of the symbol name starts with '<'. Otherwise, this symbol name
5380 is not a suitable completion. */
5381 const char *sym_name_copy
= sym_name
;
5382 int has_angle_bracket
;
5384 sym_name
= ada_decode (sym_name
);
5385 has_angle_bracket
= (sym_name
[0] == '<');
5386 match
= (has_angle_bracket
== verbatim_match
);
5387 sym_name
= sym_name_copy
;
5390 if (match
&& !verbatim_match
)
5392 /* When doing non-verbatim match, another check that needs to
5393 be done is to verify that the potentially matching symbol name
5394 does not include capital letters, because the ada-mode would
5395 not be able to understand these symbol names without the
5396 angle bracket notation. */
5399 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5404 /* Second: Try wild matching... */
5406 if (!match
&& wild_match
)
5408 /* Since we are doing wild matching, this means that TEXT
5409 may represent an unqualified symbol name. We therefore must
5410 also compare TEXT against the unqualified name of the symbol. */
5411 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5413 if (strncmp (sym_name
, text
, text_len
) == 0)
5417 /* Finally: If we found a mach, prepare the result to return. */
5423 sym_name
= add_angle_brackets (sym_name
);
5426 sym_name
= ada_decode (sym_name
);
5431 typedef char *char_ptr
;
5432 DEF_VEC_P (char_ptr
);
5434 /* A companion function to ada_make_symbol_completion_list().
5435 Check if SYM_NAME represents a symbol which name would be suitable
5436 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5437 it is appended at the end of the given string vector SV.
5439 ORIG_TEXT is the string original string from the user command
5440 that needs to be completed. WORD is the entire command on which
5441 completion should be performed. These two parameters are used to
5442 determine which part of the symbol name should be added to the
5444 if WILD_MATCH is set, then wild matching is performed.
5445 ENCODED should be set if TEXT represents a symbol name in its
5446 encoded formed (in which case the completion should also be
5450 symbol_completion_add (VEC(char_ptr
) **sv
,
5451 const char *sym_name
,
5452 const char *text
, int text_len
,
5453 const char *orig_text
, const char *word
,
5454 int wild_match
, int encoded
)
5456 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5457 wild_match
, encoded
);
5463 /* We found a match, so add the appropriate completion to the given
5466 if (word
== orig_text
)
5468 completion
= xmalloc (strlen (match
) + 5);
5469 strcpy (completion
, match
);
5471 else if (word
> orig_text
)
5473 /* Return some portion of sym_name. */
5474 completion
= xmalloc (strlen (match
) + 5);
5475 strcpy (completion
, match
+ (word
- orig_text
));
5479 /* Return some of ORIG_TEXT plus sym_name. */
5480 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5481 strncpy (completion
, word
, orig_text
- word
);
5482 completion
[orig_text
- word
] = '\0';
5483 strcat (completion
, match
);
5486 VEC_safe_push (char_ptr
, *sv
, completion
);
5489 /* Return a list of possible symbol names completing TEXT0. The list
5490 is NULL terminated. WORD is the entire command on which completion
5494 ada_make_symbol_completion_list (char *text0
, char *word
)
5500 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5503 struct partial_symtab
*ps
;
5504 struct minimal_symbol
*msymbol
;
5505 struct objfile
*objfile
;
5506 struct block
*b
, *surrounding_static_block
= 0;
5508 struct dict_iterator iter
;
5510 if (text0
[0] == '<')
5512 text
= xstrdup (text0
);
5513 make_cleanup (xfree
, text
);
5514 text_len
= strlen (text
);
5520 text
= xstrdup (ada_encode (text0
));
5521 make_cleanup (xfree
, text
);
5522 text_len
= strlen (text
);
5523 for (i
= 0; i
< text_len
; i
++)
5524 text
[i
] = tolower (text
[i
]);
5526 encoded
= (strstr (text0
, "__") != NULL
);
5527 /* If the name contains a ".", then the user is entering a fully
5528 qualified entity name, and the match must not be done in wild
5529 mode. Similarly, if the user wants to complete what looks like
5530 an encoded name, the match must not be done in wild mode. */
5531 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5534 /* First, look at the partial symtab symbols. */
5535 ALL_PSYMTABS (objfile
, ps
)
5537 struct partial_symbol
**psym
;
5539 /* If the psymtab's been read in we'll get it when we search
5540 through the blockvector. */
5544 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5545 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5546 + ps
->n_global_syms
); psym
++)
5549 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5550 text
, text_len
, text0
, word
,
5551 wild_match
, encoded
);
5554 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5555 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5556 + ps
->n_static_syms
); psym
++)
5559 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5560 text
, text_len
, text0
, word
,
5561 wild_match
, encoded
);
5565 /* At this point scan through the misc symbol vectors and add each
5566 symbol you find to the list. Eventually we want to ignore
5567 anything that isn't a text symbol (everything else will be
5568 handled by the psymtab code above). */
5570 ALL_MSYMBOLS (objfile
, msymbol
)
5573 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5574 text
, text_len
, text0
, word
, wild_match
, encoded
);
5577 /* Search upwards from currently selected frame (so that we can
5578 complete on local vars. */
5580 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5582 if (!BLOCK_SUPERBLOCK (b
))
5583 surrounding_static_block
= b
; /* For elmin of dups */
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 /* Go through the symtabs and check the externs and statics for
5594 symbols which match. */
5596 ALL_SYMTABS (objfile
, s
)
5599 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5600 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5602 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5603 text
, text_len
, text0
, word
,
5604 wild_match
, encoded
);
5608 ALL_SYMTABS (objfile
, s
)
5611 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5612 /* Don't do this block twice. */
5613 if (b
== surrounding_static_block
)
5615 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5617 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5618 text
, text_len
, text0
, word
,
5619 wild_match
, encoded
);
5623 /* Append the closing NULL entry. */
5624 VEC_safe_push (char_ptr
, completions
, NULL
);
5626 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5627 return the copy. It's unfortunate that we have to make a copy
5628 of an array that we're about to destroy, but there is nothing much
5629 we can do about it. Fortunately, it's typically not a very large
5632 const size_t completions_size
=
5633 VEC_length (char_ptr
, completions
) * sizeof (char *);
5634 char **result
= malloc (completions_size
);
5636 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5638 VEC_free (char_ptr
, completions
);
5645 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5646 for tagged types. */
5649 ada_is_dispatch_table_ptr_type (struct type
*type
)
5653 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5656 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5660 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5663 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5664 to be invisible to users. */
5667 ada_is_ignored_field (struct type
*type
, int field_num
)
5669 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5672 /* Check the name of that field. */
5674 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5676 /* Anonymous field names should not be printed.
5677 brobecker/2007-02-20: I don't think this can actually happen
5678 but we don't want to print the value of annonymous fields anyway. */
5682 /* A field named "_parent" is internally generated by GNAT for
5683 tagged types, and should not be printed either. */
5684 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5688 /* If this is the dispatch table of a tagged type, then ignore. */
5689 if (ada_is_tagged_type (type
, 1)
5690 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5693 /* Not a special field, so it should not be ignored. */
5697 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5698 pointer or reference type whose ultimate target has a tag field. */
5701 ada_is_tagged_type (struct type
*type
, int refok
)
5703 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5706 /* True iff TYPE represents the type of X'Tag */
5709 ada_is_tag_type (struct type
*type
)
5711 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5715 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5716 return (name
!= NULL
5717 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5721 /* The type of the tag on VAL. */
5724 ada_tag_type (struct value
*val
)
5726 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5729 /* The value of the tag on VAL. */
5732 ada_value_tag (struct value
*val
)
5734 return ada_value_struct_elt (val
, "_tag", 0);
5737 /* The value of the tag on the object of type TYPE whose contents are
5738 saved at VALADDR, if it is non-null, or is at memory address
5741 static struct value
*
5742 value_tag_from_contents_and_address (struct type
*type
,
5743 const gdb_byte
*valaddr
,
5746 int tag_byte_offset
, dummy1
, dummy2
;
5747 struct type
*tag_type
;
5748 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5751 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5753 : valaddr
+ tag_byte_offset
);
5754 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5756 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5761 static struct type
*
5762 type_from_tag (struct value
*tag
)
5764 const char *type_name
= ada_tag_name (tag
);
5765 if (type_name
!= NULL
)
5766 return ada_find_any_type (ada_encode (type_name
));
5777 static int ada_tag_name_1 (void *);
5778 static int ada_tag_name_2 (struct tag_args
*);
5780 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5781 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5782 The value stored in ARGS->name is valid until the next call to
5786 ada_tag_name_1 (void *args0
)
5788 struct tag_args
*args
= (struct tag_args
*) args0
;
5789 static char name
[1024];
5793 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5795 return ada_tag_name_2 (args
);
5796 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5799 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5800 for (p
= name
; *p
!= '\0'; p
+= 1)
5807 /* Utility function for ada_tag_name_1 that tries the second
5808 representation for the dispatch table (in which there is no
5809 explicit 'tsd' field in the referent of the tag pointer, and instead
5810 the tsd pointer is stored just before the dispatch table. */
5813 ada_tag_name_2 (struct tag_args
*args
)
5815 struct type
*info_type
;
5816 static char name
[1024];
5818 struct value
*val
, *valp
;
5821 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5822 if (info_type
== NULL
)
5824 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5825 valp
= value_cast (info_type
, args
->tag
);
5828 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5831 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5834 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5835 for (p
= name
; *p
!= '\0'; p
+= 1)
5842 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5846 ada_tag_name (struct value
*tag
)
5848 struct tag_args args
;
5849 if (!ada_is_tag_type (value_type (tag
)))
5853 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5857 /* The parent type of TYPE, or NULL if none. */
5860 ada_parent_type (struct type
*type
)
5864 type
= ada_check_typedef (type
);
5866 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5869 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5870 if (ada_is_parent_field (type
, i
))
5871 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5876 /* True iff field number FIELD_NUM of structure type TYPE contains the
5877 parent-type (inherited) fields of a derived type. Assumes TYPE is
5878 a structure type with at least FIELD_NUM+1 fields. */
5881 ada_is_parent_field (struct type
*type
, int field_num
)
5883 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5884 return (name
!= NULL
5885 && (strncmp (name
, "PARENT", 6) == 0
5886 || strncmp (name
, "_parent", 7) == 0));
5889 /* True iff field number FIELD_NUM of structure type TYPE is a
5890 transparent wrapper field (which should be silently traversed when doing
5891 field selection and flattened when printing). Assumes TYPE is a
5892 structure type with at least FIELD_NUM+1 fields. Such fields are always
5896 ada_is_wrapper_field (struct type
*type
, int field_num
)
5898 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5899 return (name
!= NULL
5900 && (strncmp (name
, "PARENT", 6) == 0
5901 || strcmp (name
, "REP") == 0
5902 || strncmp (name
, "_parent", 7) == 0
5903 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5906 /* True iff field number FIELD_NUM of structure or union type TYPE
5907 is a variant wrapper. Assumes TYPE is a structure type with at least
5908 FIELD_NUM+1 fields. */
5911 ada_is_variant_part (struct type
*type
, int field_num
)
5913 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5914 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5915 || (is_dynamic_field (type
, field_num
)
5916 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5917 == TYPE_CODE_UNION
)));
5920 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5921 whose discriminants are contained in the record type OUTER_TYPE,
5922 returns the type of the controlling discriminant for the variant. */
5925 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5927 char *name
= ada_variant_discrim_name (var_type
);
5929 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5931 return builtin_type_int
;
5936 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5937 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5938 represents a 'when others' clause; otherwise 0. */
5941 ada_is_others_clause (struct type
*type
, int field_num
)
5943 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5944 return (name
!= NULL
&& name
[0] == 'O');
5947 /* Assuming that TYPE0 is the type of the variant part of a record,
5948 returns the name of the discriminant controlling the variant.
5949 The value is valid until the next call to ada_variant_discrim_name. */
5952 ada_variant_discrim_name (struct type
*type0
)
5954 static char *result
= NULL
;
5955 static size_t result_len
= 0;
5958 const char *discrim_end
;
5959 const char *discrim_start
;
5961 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5962 type
= TYPE_TARGET_TYPE (type0
);
5966 name
= ada_type_name (type
);
5968 if (name
== NULL
|| name
[0] == '\000')
5971 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5974 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5977 if (discrim_end
== name
)
5980 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5983 if (discrim_start
== name
+ 1)
5985 if ((discrim_start
> name
+ 3
5986 && strncmp (discrim_start
- 3, "___", 3) == 0)
5987 || discrim_start
[-1] == '.')
5991 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5992 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5993 result
[discrim_end
- discrim_start
] = '\0';
5997 /* Scan STR for a subtype-encoded number, beginning at position K.
5998 Put the position of the character just past the number scanned in
5999 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
6000 Return 1 if there was a valid number at the given position, and 0
6001 otherwise. A "subtype-encoded" number consists of the absolute value
6002 in decimal, followed by the letter 'm' to indicate a negative number.
6003 Assumes 0m does not occur. */
6006 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6010 if (!isdigit (str
[k
]))
6013 /* Do it the hard way so as not to make any assumption about
6014 the relationship of unsigned long (%lu scan format code) and
6017 while (isdigit (str
[k
]))
6019 RU
= RU
* 10 + (str
[k
] - '0');
6026 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6032 /* NOTE on the above: Technically, C does not say what the results of
6033 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6034 number representable as a LONGEST (although either would probably work
6035 in most implementations). When RU>0, the locution in the then branch
6036 above is always equivalent to the negative of RU. */
6043 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6044 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6045 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6048 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6050 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6063 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6072 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6073 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6075 if (val
>= L
&& val
<= U
)
6087 /* FIXME: Lots of redundancy below. Try to consolidate. */
6089 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6090 ARG_TYPE, extract and return the value of one of its (non-static)
6091 fields. FIELDNO says which field. Differs from value_primitive_field
6092 only in that it can handle packed values of arbitrary type. */
6094 static struct value
*
6095 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6096 struct type
*arg_type
)
6100 arg_type
= ada_check_typedef (arg_type
);
6101 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6103 /* Handle packed fields. */
6105 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6107 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6108 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6110 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6111 offset
+ bit_pos
/ 8,
6112 bit_pos
% 8, bit_size
, type
);
6115 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6118 /* Find field with name NAME in object of type TYPE. If found,
6119 set the following for each argument that is non-null:
6120 - *FIELD_TYPE_P to the field's type;
6121 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6122 an object of that type;
6123 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6124 - *BIT_SIZE_P to its size in bits if the field is packed, and
6126 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6127 fields up to but not including the desired field, or by the total
6128 number of fields if not found. A NULL value of NAME never
6129 matches; the function just counts visible fields in this case.
6131 Returns 1 if found, 0 otherwise. */
6134 find_struct_field (char *name
, struct type
*type
, int offset
,
6135 struct type
**field_type_p
,
6136 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6141 type
= ada_check_typedef (type
);
6143 if (field_type_p
!= NULL
)
6144 *field_type_p
= NULL
;
6145 if (byte_offset_p
!= NULL
)
6147 if (bit_offset_p
!= NULL
)
6149 if (bit_size_p
!= NULL
)
6152 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6154 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6155 int fld_offset
= offset
+ bit_pos
/ 8;
6156 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6158 if (t_field_name
== NULL
)
6161 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6163 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6164 if (field_type_p
!= NULL
)
6165 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6166 if (byte_offset_p
!= NULL
)
6167 *byte_offset_p
= fld_offset
;
6168 if (bit_offset_p
!= NULL
)
6169 *bit_offset_p
= bit_pos
% 8;
6170 if (bit_size_p
!= NULL
)
6171 *bit_size_p
= bit_size
;
6174 else if (ada_is_wrapper_field (type
, i
))
6176 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6177 field_type_p
, byte_offset_p
, bit_offset_p
,
6178 bit_size_p
, index_p
))
6181 else if (ada_is_variant_part (type
, i
))
6183 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6186 struct type
*field_type
6187 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6189 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6191 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6193 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6194 field_type_p
, byte_offset_p
,
6195 bit_offset_p
, bit_size_p
, index_p
))
6199 else if (index_p
!= NULL
)
6205 /* Number of user-visible fields in record type TYPE. */
6208 num_visible_fields (struct type
*type
)
6212 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6216 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6217 and search in it assuming it has (class) type TYPE.
6218 If found, return value, else return NULL.
6220 Searches recursively through wrapper fields (e.g., '_parent'). */
6222 static struct value
*
6223 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6227 type
= ada_check_typedef (type
);
6229 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6231 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6233 if (t_field_name
== NULL
)
6236 else if (field_name_match (t_field_name
, name
))
6237 return ada_value_primitive_field (arg
, offset
, i
, type
);
6239 else if (ada_is_wrapper_field (type
, i
))
6241 struct value
*v
= /* Do not let indent join lines here. */
6242 ada_search_struct_field (name
, arg
,
6243 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6244 TYPE_FIELD_TYPE (type
, i
));
6249 else if (ada_is_variant_part (type
, i
))
6251 /* PNH: Do we ever get here? See find_struct_field. */
6253 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6254 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6256 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6258 struct value
*v
= ada_search_struct_field
/* Force line break. */
6260 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6261 TYPE_FIELD_TYPE (field_type
, j
));
6270 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6271 int, struct type
*);
6274 /* Return field #INDEX in ARG, where the index is that returned by
6275 * find_struct_field through its INDEX_P argument. Adjust the address
6276 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6277 * If found, return value, else return NULL. */
6279 static struct value
*
6280 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6283 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6287 /* Auxiliary function for ada_index_struct_field. Like
6288 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6291 static struct value
*
6292 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6296 type
= ada_check_typedef (type
);
6298 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6300 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6302 else if (ada_is_wrapper_field (type
, i
))
6304 struct value
*v
= /* Do not let indent join lines here. */
6305 ada_index_struct_field_1 (index_p
, arg
,
6306 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6307 TYPE_FIELD_TYPE (type
, i
));
6312 else if (ada_is_variant_part (type
, i
))
6314 /* PNH: Do we ever get here? See ada_search_struct_field,
6315 find_struct_field. */
6316 error (_("Cannot assign this kind of variant record"));
6318 else if (*index_p
== 0)
6319 return ada_value_primitive_field (arg
, offset
, i
, type
);
6326 /* Given ARG, a value of type (pointer or reference to a)*
6327 structure/union, extract the component named NAME from the ultimate
6328 target structure/union and return it as a value with its
6329 appropriate type. If ARG is a pointer or reference and the field
6330 is not packed, returns a reference to the field, otherwise the
6331 value of the field (an lvalue if ARG is an lvalue).
6333 The routine searches for NAME among all members of the structure itself
6334 and (recursively) among all members of any wrapper members
6337 If NO_ERR, then simply return NULL in case of error, rather than
6341 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6343 struct type
*t
, *t1
;
6347 t1
= t
= ada_check_typedef (value_type (arg
));
6348 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6350 t1
= TYPE_TARGET_TYPE (t
);
6353 t1
= ada_check_typedef (t1
);
6354 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6356 arg
= coerce_ref (arg
);
6361 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6363 t1
= TYPE_TARGET_TYPE (t
);
6366 t1
= ada_check_typedef (t1
);
6367 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6369 arg
= value_ind (arg
);
6376 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6380 v
= ada_search_struct_field (name
, arg
, 0, t
);
6383 int bit_offset
, bit_size
, byte_offset
;
6384 struct type
*field_type
;
6387 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6388 address
= value_as_address (arg
);
6390 address
= unpack_pointer (t
, value_contents (arg
));
6392 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6393 if (find_struct_field (name
, t1
, 0,
6394 &field_type
, &byte_offset
, &bit_offset
,
6399 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6400 arg
= ada_coerce_ref (arg
);
6402 arg
= ada_value_ind (arg
);
6403 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6404 bit_offset
, bit_size
,
6408 v
= value_from_pointer (lookup_reference_type (field_type
),
6409 address
+ byte_offset
);
6413 if (v
!= NULL
|| no_err
)
6416 error (_("There is no member named %s."), name
);
6422 error (_("Attempt to extract a component of a value that is not a record."));
6425 /* Given a type TYPE, look up the type of the component of type named NAME.
6426 If DISPP is non-null, add its byte displacement from the beginning of a
6427 structure (pointed to by a value) of type TYPE to *DISPP (does not
6428 work for packed fields).
6430 Matches any field whose name has NAME as a prefix, possibly
6433 TYPE can be either a struct or union. If REFOK, TYPE may also
6434 be a (pointer or reference)+ to a struct or union, and the
6435 ultimate target type will be searched.
6437 Looks recursively into variant clauses and parent types.
6439 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6440 TYPE is not a type of the right kind. */
6442 static struct type
*
6443 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6444 int noerr
, int *dispp
)
6451 if (refok
&& type
!= NULL
)
6454 type
= ada_check_typedef (type
);
6455 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6456 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6458 type
= TYPE_TARGET_TYPE (type
);
6462 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6463 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6469 target_terminal_ours ();
6470 gdb_flush (gdb_stdout
);
6472 error (_("Type (null) is not a structure or union type"));
6475 /* XXX: type_sprint */
6476 fprintf_unfiltered (gdb_stderr
, _("Type "));
6477 type_print (type
, "", gdb_stderr
, -1);
6478 error (_(" is not a structure or union type"));
6483 type
= to_static_fixed_type (type
);
6485 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6487 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6491 if (t_field_name
== NULL
)
6494 else if (field_name_match (t_field_name
, name
))
6497 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6498 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6501 else if (ada_is_wrapper_field (type
, i
))
6504 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6509 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6514 else if (ada_is_variant_part (type
, i
))
6517 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6519 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6522 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6527 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6538 target_terminal_ours ();
6539 gdb_flush (gdb_stdout
);
6542 /* XXX: type_sprint */
6543 fprintf_unfiltered (gdb_stderr
, _("Type "));
6544 type_print (type
, "", gdb_stderr
, -1);
6545 error (_(" has no component named <null>"));
6549 /* XXX: type_sprint */
6550 fprintf_unfiltered (gdb_stderr
, _("Type "));
6551 type_print (type
, "", gdb_stderr
, -1);
6552 error (_(" has no component named %s"), name
);
6559 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6560 within a value of type OUTER_TYPE that is stored in GDB at
6561 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6562 numbering from 0) is applicable. Returns -1 if none are. */
6565 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6566 const gdb_byte
*outer_valaddr
)
6570 char *discrim_name
= ada_variant_discrim_name (var_type
);
6571 struct value
*outer
;
6572 struct value
*discrim
;
6573 LONGEST discrim_val
;
6575 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6576 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6577 if (discrim
== NULL
)
6579 discrim_val
= value_as_long (discrim
);
6582 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6584 if (ada_is_others_clause (var_type
, i
))
6586 else if (ada_in_variant (discrim_val
, var_type
, i
))
6590 return others_clause
;
6595 /* Dynamic-Sized Records */
6597 /* Strategy: The type ostensibly attached to a value with dynamic size
6598 (i.e., a size that is not statically recorded in the debugging
6599 data) does not accurately reflect the size or layout of the value.
6600 Our strategy is to convert these values to values with accurate,
6601 conventional types that are constructed on the fly. */
6603 /* There is a subtle and tricky problem here. In general, we cannot
6604 determine the size of dynamic records without its data. However,
6605 the 'struct value' data structure, which GDB uses to represent
6606 quantities in the inferior process (the target), requires the size
6607 of the type at the time of its allocation in order to reserve space
6608 for GDB's internal copy of the data. That's why the
6609 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6610 rather than struct value*s.
6612 However, GDB's internal history variables ($1, $2, etc.) are
6613 struct value*s containing internal copies of the data that are not, in
6614 general, the same as the data at their corresponding addresses in
6615 the target. Fortunately, the types we give to these values are all
6616 conventional, fixed-size types (as per the strategy described
6617 above), so that we don't usually have to perform the
6618 'to_fixed_xxx_type' conversions to look at their values.
6619 Unfortunately, there is one exception: if one of the internal
6620 history variables is an array whose elements are unconstrained
6621 records, then we will need to create distinct fixed types for each
6622 element selected. */
6624 /* The upshot of all of this is that many routines take a (type, host
6625 address, target address) triple as arguments to represent a value.
6626 The host address, if non-null, is supposed to contain an internal
6627 copy of the relevant data; otherwise, the program is to consult the
6628 target at the target address. */
6630 /* Assuming that VAL0 represents a pointer value, the result of
6631 dereferencing it. Differs from value_ind in its treatment of
6632 dynamic-sized types. */
6635 ada_value_ind (struct value
*val0
)
6637 struct value
*val
= unwrap_value (value_ind (val0
));
6638 return ada_to_fixed_value (val
);
6641 /* The value resulting from dereferencing any "reference to"
6642 qualifiers on VAL0. */
6644 static struct value
*
6645 ada_coerce_ref (struct value
*val0
)
6647 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6649 struct value
*val
= val0
;
6650 val
= coerce_ref (val
);
6651 val
= unwrap_value (val
);
6652 return ada_to_fixed_value (val
);
6658 /* Return OFF rounded upward if necessary to a multiple of
6659 ALIGNMENT (a power of 2). */
6662 align_value (unsigned int off
, unsigned int alignment
)
6664 return (off
+ alignment
- 1) & ~(alignment
- 1);
6667 /* Return the bit alignment required for field #F of template type TYPE. */
6670 field_alignment (struct type
*type
, int f
)
6672 const char *name
= TYPE_FIELD_NAME (type
, f
);
6676 /* The field name should never be null, unless the debugging information
6677 is somehow malformed. In this case, we assume the field does not
6678 require any alignment. */
6682 len
= strlen (name
);
6684 if (!isdigit (name
[len
- 1]))
6687 if (isdigit (name
[len
- 2]))
6688 align_offset
= len
- 2;
6690 align_offset
= len
- 1;
6692 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6693 return TARGET_CHAR_BIT
;
6695 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6698 /* Find a symbol named NAME. Ignores ambiguity. */
6701 ada_find_any_symbol (const char *name
)
6705 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6706 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6709 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6713 /* Find a type named NAME. Ignores ambiguity. */
6716 ada_find_any_type (const char *name
)
6718 struct symbol
*sym
= ada_find_any_symbol (name
);
6721 return SYMBOL_TYPE (sym
);
6726 /* Given NAME and an associated BLOCK, search all symbols for
6727 NAME suffixed with "___XR", which is the ``renaming'' symbol
6728 associated to NAME. Return this symbol if found, return
6732 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6736 sym
= find_old_style_renaming_symbol (name
, block
);
6741 /* Not right yet. FIXME pnh 7/20/2007. */
6742 sym
= ada_find_any_symbol (name
);
6743 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6749 static struct symbol
*
6750 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6752 const struct symbol
*function_sym
= block_function (block
);
6755 if (function_sym
!= NULL
)
6757 /* If the symbol is defined inside a function, NAME is not fully
6758 qualified. This means we need to prepend the function name
6759 as well as adding the ``___XR'' suffix to build the name of
6760 the associated renaming symbol. */
6761 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6762 /* Function names sometimes contain suffixes used
6763 for instance to qualify nested subprograms. When building
6764 the XR type name, we need to make sure that this suffix is
6765 not included. So do not include any suffix in the function
6766 name length below. */
6767 const int function_name_len
= ada_name_prefix_len (function_name
);
6768 const int rename_len
= function_name_len
+ 2 /* "__" */
6769 + strlen (name
) + 6 /* "___XR\0" */ ;
6771 /* Strip the suffix if necessary. */
6772 function_name
[function_name_len
] = '\0';
6774 /* Library-level functions are a special case, as GNAT adds
6775 a ``_ada_'' prefix to the function name to avoid namespace
6776 pollution. However, the renaming symbols themselves do not
6777 have this prefix, so we need to skip this prefix if present. */
6778 if (function_name_len
> 5 /* "_ada_" */
6779 && strstr (function_name
, "_ada_") == function_name
)
6780 function_name
= function_name
+ 5;
6782 rename
= (char *) alloca (rename_len
* sizeof (char));
6783 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6787 const int rename_len
= strlen (name
) + 6;
6788 rename
= (char *) alloca (rename_len
* sizeof (char));
6789 sprintf (rename
, "%s___XR", name
);
6792 return ada_find_any_symbol (rename
);
6795 /* Because of GNAT encoding conventions, several GDB symbols may match a
6796 given type name. If the type denoted by TYPE0 is to be preferred to
6797 that of TYPE1 for purposes of type printing, return non-zero;
6798 otherwise return 0. */
6801 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6805 else if (type0
== NULL
)
6807 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6809 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6811 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6813 else if (ada_is_packed_array_type (type0
))
6815 else if (ada_is_array_descriptor_type (type0
)
6816 && !ada_is_array_descriptor_type (type1
))
6820 const char *type0_name
= type_name_no_tag (type0
);
6821 const char *type1_name
= type_name_no_tag (type1
);
6823 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6824 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6830 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6831 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6834 ada_type_name (struct type
*type
)
6838 else if (TYPE_NAME (type
) != NULL
)
6839 return TYPE_NAME (type
);
6841 return TYPE_TAG_NAME (type
);
6844 /* Find a parallel type to TYPE whose name is formed by appending
6845 SUFFIX to the name of TYPE. */
6848 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6851 static size_t name_len
= 0;
6853 char *typename
= ada_type_name (type
);
6855 if (typename
== NULL
)
6858 len
= strlen (typename
);
6860 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6862 strcpy (name
, typename
);
6863 strcpy (name
+ len
, suffix
);
6865 return ada_find_any_type (name
);
6869 /* If TYPE is a variable-size record type, return the corresponding template
6870 type describing its fields. Otherwise, return NULL. */
6872 static struct type
*
6873 dynamic_template_type (struct type
*type
)
6875 type
= ada_check_typedef (type
);
6877 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6878 || ada_type_name (type
) == NULL
)
6882 int len
= strlen (ada_type_name (type
));
6883 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6886 return ada_find_parallel_type (type
, "___XVE");
6890 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6891 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6894 is_dynamic_field (struct type
*templ_type
, int field_num
)
6896 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6898 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6899 && strstr (name
, "___XVL") != NULL
;
6902 /* The index of the variant field of TYPE, or -1 if TYPE does not
6903 represent a variant record type. */
6906 variant_field_index (struct type
*type
)
6910 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6913 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6915 if (ada_is_variant_part (type
, f
))
6921 /* A record type with no fields. */
6923 static struct type
*
6924 empty_record (struct objfile
*objfile
)
6926 struct type
*type
= alloc_type (objfile
);
6927 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6928 TYPE_NFIELDS (type
) = 0;
6929 TYPE_FIELDS (type
) = NULL
;
6930 TYPE_NAME (type
) = "<empty>";
6931 TYPE_TAG_NAME (type
) = NULL
;
6932 TYPE_FLAGS (type
) = 0;
6933 TYPE_LENGTH (type
) = 0;
6937 /* An ordinary record type (with fixed-length fields) that describes
6938 the value of type TYPE at VALADDR or ADDRESS (see comments at
6939 the beginning of this section) VAL according to GNAT conventions.
6940 DVAL0 should describe the (portion of a) record that contains any
6941 necessary discriminants. It should be NULL if value_type (VAL) is
6942 an outer-level type (i.e., as opposed to a branch of a variant.) A
6943 variant field (unless unchecked) is replaced by a particular branch
6946 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6947 length are not statically known are discarded. As a consequence,
6948 VALADDR, ADDRESS and DVAL0 are ignored.
6950 NOTE: Limitations: For now, we assume that dynamic fields and
6951 variants occupy whole numbers of bytes. However, they need not be
6955 ada_template_to_fixed_record_type_1 (struct type
*type
,
6956 const gdb_byte
*valaddr
,
6957 CORE_ADDR address
, struct value
*dval0
,
6958 int keep_dynamic_fields
)
6960 struct value
*mark
= value_mark ();
6963 int nfields
, bit_len
;
6966 int fld_bit_len
, bit_incr
;
6969 /* Compute the number of fields in this record type that are going
6970 to be processed: unless keep_dynamic_fields, this includes only
6971 fields whose position and length are static will be processed. */
6972 if (keep_dynamic_fields
)
6973 nfields
= TYPE_NFIELDS (type
);
6977 while (nfields
< TYPE_NFIELDS (type
)
6978 && !ada_is_variant_part (type
, nfields
)
6979 && !is_dynamic_field (type
, nfields
))
6983 rtype
= alloc_type (TYPE_OBJFILE (type
));
6984 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6985 INIT_CPLUS_SPECIFIC (rtype
);
6986 TYPE_NFIELDS (rtype
) = nfields
;
6987 TYPE_FIELDS (rtype
) = (struct field
*)
6988 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6989 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6990 TYPE_NAME (rtype
) = ada_type_name (type
);
6991 TYPE_TAG_NAME (rtype
) = NULL
;
6992 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6998 for (f
= 0; f
< nfields
; f
+= 1)
7000 off
= align_value (off
, field_alignment (type
, f
))
7001 + TYPE_FIELD_BITPOS (type
, f
);
7002 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
7003 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
7005 if (ada_is_variant_part (type
, f
))
7008 fld_bit_len
= bit_incr
= 0;
7010 else if (is_dynamic_field (type
, f
))
7013 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7017 /* Get the fixed type of the field. Note that, in this case, we
7018 do not want to get the real type out of the tag: if the current
7019 field is the parent part of a tagged record, we will get the
7020 tag of the object. Clearly wrong: the real type of the parent
7021 is not the real type of the child. We would end up in an infinite
7023 TYPE_FIELD_TYPE (rtype
, f
) =
7026 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
7027 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7028 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
7029 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7030 bit_incr
= fld_bit_len
=
7031 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7035 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7036 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7037 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7038 bit_incr
= fld_bit_len
=
7039 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7041 bit_incr
= fld_bit_len
=
7042 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
7044 if (off
+ fld_bit_len
> bit_len
)
7045 bit_len
= off
+ fld_bit_len
;
7047 TYPE_LENGTH (rtype
) =
7048 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7051 /* We handle the variant part, if any, at the end because of certain
7052 odd cases in which it is re-ordered so as NOT the last field of
7053 the record. This can happen in the presence of representation
7055 if (variant_field
>= 0)
7057 struct type
*branch_type
;
7059 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7062 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7067 to_fixed_variant_branch_type
7068 (TYPE_FIELD_TYPE (type
, variant_field
),
7069 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7070 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7071 if (branch_type
== NULL
)
7073 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7074 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7075 TYPE_NFIELDS (rtype
) -= 1;
7079 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7080 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7082 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7084 if (off
+ fld_bit_len
> bit_len
)
7085 bit_len
= off
+ fld_bit_len
;
7086 TYPE_LENGTH (rtype
) =
7087 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7091 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7092 should contain the alignment of that record, which should be a strictly
7093 positive value. If null or negative, then something is wrong, most
7094 probably in the debug info. In that case, we don't round up the size
7095 of the resulting type. If this record is not part of another structure,
7096 the current RTYPE length might be good enough for our purposes. */
7097 if (TYPE_LENGTH (type
) <= 0)
7099 if (TYPE_NAME (rtype
))
7100 warning (_("Invalid type size for `%s' detected: %d."),
7101 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7103 warning (_("Invalid type size for <unnamed> detected: %d."),
7104 TYPE_LENGTH (type
));
7108 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7109 TYPE_LENGTH (type
));
7112 value_free_to_mark (mark
);
7113 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7114 error (_("record type with dynamic size is larger than varsize-limit"));
7118 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7121 static struct type
*
7122 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7123 CORE_ADDR address
, struct value
*dval0
)
7125 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7129 /* An ordinary record type in which ___XVL-convention fields and
7130 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7131 static approximations, containing all possible fields. Uses
7132 no runtime values. Useless for use in values, but that's OK,
7133 since the results are used only for type determinations. Works on both
7134 structs and unions. Representation note: to save space, we memorize
7135 the result of this function in the TYPE_TARGET_TYPE of the
7138 static struct type
*
7139 template_to_static_fixed_type (struct type
*type0
)
7145 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7146 return TYPE_TARGET_TYPE (type0
);
7148 nfields
= TYPE_NFIELDS (type0
);
7151 for (f
= 0; f
< nfields
; f
+= 1)
7153 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7154 struct type
*new_type
;
7156 if (is_dynamic_field (type0
, f
))
7157 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7159 new_type
= static_unwrap_type (field_type
);
7160 if (type
== type0
&& new_type
!= field_type
)
7162 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
7163 TYPE_CODE (type
) = TYPE_CODE (type0
);
7164 INIT_CPLUS_SPECIFIC (type
);
7165 TYPE_NFIELDS (type
) = nfields
;
7166 TYPE_FIELDS (type
) = (struct field
*)
7167 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7168 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7169 sizeof (struct field
) * nfields
);
7170 TYPE_NAME (type
) = ada_type_name (type0
);
7171 TYPE_TAG_NAME (type
) = NULL
;
7172 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
7173 TYPE_LENGTH (type
) = 0;
7175 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7176 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7181 /* Given an object of type TYPE whose contents are at VALADDR and
7182 whose address in memory is ADDRESS, returns a revision of TYPE --
7183 a non-dynamic-sized record with a variant part -- in which
7184 the variant part is replaced with the appropriate branch. Looks
7185 for discriminant values in DVAL0, which can be NULL if the record
7186 contains the necessary discriminant values. */
7188 static struct type
*
7189 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7190 CORE_ADDR address
, struct value
*dval0
)
7192 struct value
*mark
= value_mark ();
7195 struct type
*branch_type
;
7196 int nfields
= TYPE_NFIELDS (type
);
7197 int variant_field
= variant_field_index (type
);
7199 if (variant_field
== -1)
7203 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7207 rtype
= alloc_type (TYPE_OBJFILE (type
));
7208 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7209 INIT_CPLUS_SPECIFIC (rtype
);
7210 TYPE_NFIELDS (rtype
) = nfields
;
7211 TYPE_FIELDS (rtype
) =
7212 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7213 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7214 sizeof (struct field
) * nfields
);
7215 TYPE_NAME (rtype
) = ada_type_name (type
);
7216 TYPE_TAG_NAME (rtype
) = NULL
;
7217 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
7218 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7220 branch_type
= to_fixed_variant_branch_type
7221 (TYPE_FIELD_TYPE (type
, variant_field
),
7222 cond_offset_host (valaddr
,
7223 TYPE_FIELD_BITPOS (type
, variant_field
)
7225 cond_offset_target (address
,
7226 TYPE_FIELD_BITPOS (type
, variant_field
)
7227 / TARGET_CHAR_BIT
), dval
);
7228 if (branch_type
== NULL
)
7231 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7232 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7233 TYPE_NFIELDS (rtype
) -= 1;
7237 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7238 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7239 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7240 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7242 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7244 value_free_to_mark (mark
);
7248 /* An ordinary record type (with fixed-length fields) that describes
7249 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7250 beginning of this section]. Any necessary discriminants' values
7251 should be in DVAL, a record value; it may be NULL if the object
7252 at ADDR itself contains any necessary discriminant values.
7253 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7254 values from the record are needed. Except in the case that DVAL,
7255 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7256 unchecked) is replaced by a particular branch of the variant.
7258 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7259 is questionable and may be removed. It can arise during the
7260 processing of an unconstrained-array-of-record type where all the
7261 variant branches have exactly the same size. This is because in
7262 such cases, the compiler does not bother to use the XVS convention
7263 when encoding the record. I am currently dubious of this
7264 shortcut and suspect the compiler should be altered. FIXME. */
7266 static struct type
*
7267 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7268 CORE_ADDR address
, struct value
*dval
)
7270 struct type
*templ_type
;
7272 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7275 templ_type
= dynamic_template_type (type0
);
7277 if (templ_type
!= NULL
)
7278 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7279 else if (variant_field_index (type0
) >= 0)
7281 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7283 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7288 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
7294 /* An ordinary record type (with fixed-length fields) that describes
7295 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7296 union type. Any necessary discriminants' values should be in DVAL,
7297 a record value. That is, this routine selects the appropriate
7298 branch of the union at ADDR according to the discriminant value
7299 indicated in the union's type name. */
7301 static struct type
*
7302 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7303 CORE_ADDR address
, struct value
*dval
)
7306 struct type
*templ_type
;
7307 struct type
*var_type
;
7309 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7310 var_type
= TYPE_TARGET_TYPE (var_type0
);
7312 var_type
= var_type0
;
7314 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7316 if (templ_type
!= NULL
)
7317 var_type
= templ_type
;
7320 ada_which_variant_applies (var_type
,
7321 value_type (dval
), value_contents (dval
));
7324 return empty_record (TYPE_OBJFILE (var_type
));
7325 else if (is_dynamic_field (var_type
, which
))
7326 return to_fixed_record_type
7327 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7328 valaddr
, address
, dval
);
7329 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7331 to_fixed_record_type
7332 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7334 return TYPE_FIELD_TYPE (var_type
, which
);
7337 /* Assuming that TYPE0 is an array type describing the type of a value
7338 at ADDR, and that DVAL describes a record containing any
7339 discriminants used in TYPE0, returns a type for the value that
7340 contains no dynamic components (that is, no components whose sizes
7341 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7342 true, gives an error message if the resulting type's size is over
7345 static struct type
*
7346 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7349 struct type
*index_type_desc
;
7350 struct type
*result
;
7352 if (ada_is_packed_array_type (type0
) /* revisit? */
7353 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7356 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7357 if (index_type_desc
== NULL
)
7359 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7360 /* NOTE: elt_type---the fixed version of elt_type0---should never
7361 depend on the contents of the array in properly constructed
7363 /* Create a fixed version of the array element type.
7364 We're not providing the address of an element here,
7365 and thus the actual object value cannot be inspected to do
7366 the conversion. This should not be a problem, since arrays of
7367 unconstrained objects are not allowed. In particular, all
7368 the elements of an array of a tagged type should all be of
7369 the same type specified in the debugging info. No need to
7370 consult the object tag. */
7371 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7373 if (elt_type0
== elt_type
)
7376 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7377 elt_type
, TYPE_INDEX_TYPE (type0
));
7382 struct type
*elt_type0
;
7385 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7386 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7388 /* NOTE: result---the fixed version of elt_type0---should never
7389 depend on the contents of the array in properly constructed
7391 /* Create a fixed version of the array element type.
7392 We're not providing the address of an element here,
7393 and thus the actual object value cannot be inspected to do
7394 the conversion. This should not be a problem, since arrays of
7395 unconstrained objects are not allowed. In particular, all
7396 the elements of an array of a tagged type should all be of
7397 the same type specified in the debugging info. No need to
7398 consult the object tag. */
7400 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7401 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7403 struct type
*range_type
=
7404 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7405 dval
, TYPE_OBJFILE (type0
));
7406 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7407 result
, range_type
);
7409 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7410 error (_("array type with dynamic size is larger than varsize-limit"));
7413 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7418 /* A standard type (containing no dynamically sized components)
7419 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7420 DVAL describes a record containing any discriminants used in TYPE0,
7421 and may be NULL if there are none, or if the object of type TYPE at
7422 ADDRESS or in VALADDR contains these discriminants.
7424 If CHECK_TAG is not null, in the case of tagged types, this function
7425 attempts to locate the object's tag and use it to compute the actual
7426 type. However, when ADDRESS is null, we cannot use it to determine the
7427 location of the tag, and therefore compute the tagged type's actual type.
7428 So we return the tagged type without consulting the tag. */
7430 static struct type
*
7431 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7432 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7434 type
= ada_check_typedef (type
);
7435 switch (TYPE_CODE (type
))
7439 case TYPE_CODE_STRUCT
:
7441 struct type
*static_type
= to_static_fixed_type (type
);
7442 struct type
*fixed_record_type
=
7443 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7444 /* If STATIC_TYPE is a tagged type and we know the object's address,
7445 then we can determine its tag, and compute the object's actual
7446 type from there. Note that we have to use the fixed record
7447 type (the parent part of the record may have dynamic fields
7448 and the way the location of _tag is expressed may depend on
7451 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7453 struct type
*real_type
=
7454 type_from_tag (value_tag_from_contents_and_address
7458 if (real_type
!= NULL
)
7459 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7461 return fixed_record_type
;
7463 case TYPE_CODE_ARRAY
:
7464 return to_fixed_array_type (type
, dval
, 1);
7465 case TYPE_CODE_UNION
:
7469 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7473 /* The same as ada_to_fixed_type_1, except that it preserves the type
7474 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7475 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7478 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7479 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7482 struct type
*fixed_type
=
7483 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7485 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7486 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7492 /* A standard (static-sized) type corresponding as well as possible to
7493 TYPE0, but based on no runtime data. */
7495 static struct type
*
7496 to_static_fixed_type (struct type
*type0
)
7503 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7506 type0
= ada_check_typedef (type0
);
7508 switch (TYPE_CODE (type0
))
7512 case TYPE_CODE_STRUCT
:
7513 type
= dynamic_template_type (type0
);
7515 return template_to_static_fixed_type (type
);
7517 return template_to_static_fixed_type (type0
);
7518 case TYPE_CODE_UNION
:
7519 type
= ada_find_parallel_type (type0
, "___XVU");
7521 return template_to_static_fixed_type (type
);
7523 return template_to_static_fixed_type (type0
);
7527 /* A static approximation of TYPE with all type wrappers removed. */
7529 static struct type
*
7530 static_unwrap_type (struct type
*type
)
7532 if (ada_is_aligner_type (type
))
7534 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7535 if (ada_type_name (type1
) == NULL
)
7536 TYPE_NAME (type1
) = ada_type_name (type
);
7538 return static_unwrap_type (type1
);
7542 struct type
*raw_real_type
= ada_get_base_type (type
);
7543 if (raw_real_type
== type
)
7546 return to_static_fixed_type (raw_real_type
);
7550 /* In some cases, incomplete and private types require
7551 cross-references that are not resolved as records (for example,
7553 type FooP is access Foo;
7555 type Foo is array ...;
7556 ). In these cases, since there is no mechanism for producing
7557 cross-references to such types, we instead substitute for FooP a
7558 stub enumeration type that is nowhere resolved, and whose tag is
7559 the name of the actual type. Call these types "non-record stubs". */
7561 /* A type equivalent to TYPE that is not a non-record stub, if one
7562 exists, otherwise TYPE. */
7565 ada_check_typedef (struct type
*type
)
7570 CHECK_TYPEDEF (type
);
7571 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7572 || !TYPE_STUB (type
)
7573 || TYPE_TAG_NAME (type
) == NULL
)
7577 char *name
= TYPE_TAG_NAME (type
);
7578 struct type
*type1
= ada_find_any_type (name
);
7579 return (type1
== NULL
) ? type
: type1
;
7583 /* A value representing the data at VALADDR/ADDRESS as described by
7584 type TYPE0, but with a standard (static-sized) type that correctly
7585 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7586 type, then return VAL0 [this feature is simply to avoid redundant
7587 creation of struct values]. */
7589 static struct value
*
7590 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7593 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7594 if (type
== type0
&& val0
!= NULL
)
7597 return value_from_contents_and_address (type
, 0, address
);
7600 /* A value representing VAL, but with a standard (static-sized) type
7601 that correctly describes it. Does not necessarily create a new
7604 static struct value
*
7605 ada_to_fixed_value (struct value
*val
)
7607 return ada_to_fixed_value_create (value_type (val
),
7608 VALUE_ADDRESS (val
) + value_offset (val
),
7612 /* A value representing VAL, but with a standard (static-sized) type
7613 chosen to approximate the real type of VAL as well as possible, but
7614 without consulting any runtime values. For Ada dynamic-sized
7615 types, therefore, the type of the result is likely to be inaccurate. */
7618 ada_to_static_fixed_value (struct value
*val
)
7621 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7622 if (type
== value_type (val
))
7625 return coerce_unspec_val_to_type (val
, type
);
7631 /* Table mapping attribute numbers to names.
7632 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7634 static const char *attribute_names
[] = {
7652 ada_attribute_name (enum exp_opcode n
)
7654 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7655 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7657 return attribute_names
[0];
7660 /* Evaluate the 'POS attribute applied to ARG. */
7663 pos_atr (struct value
*arg
)
7665 struct type
*type
= value_type (arg
);
7667 if (!discrete_type_p (type
))
7668 error (_("'POS only defined on discrete types"));
7670 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7673 LONGEST v
= value_as_long (arg
);
7675 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7677 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7680 error (_("enumeration value is invalid: can't find 'POS"));
7683 return value_as_long (arg
);
7686 static struct value
*
7687 value_pos_atr (struct value
*arg
)
7689 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7692 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7694 static struct value
*
7695 value_val_atr (struct type
*type
, struct value
*arg
)
7697 if (!discrete_type_p (type
))
7698 error (_("'VAL only defined on discrete types"));
7699 if (!integer_type_p (value_type (arg
)))
7700 error (_("'VAL requires integral argument"));
7702 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7704 long pos
= value_as_long (arg
);
7705 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7706 error (_("argument to 'VAL out of range"));
7707 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7710 return value_from_longest (type
, value_as_long (arg
));
7716 /* True if TYPE appears to be an Ada character type.
7717 [At the moment, this is true only for Character and Wide_Character;
7718 It is a heuristic test that could stand improvement]. */
7721 ada_is_character_type (struct type
*type
)
7725 /* If the type code says it's a character, then assume it really is,
7726 and don't check any further. */
7727 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7730 /* Otherwise, assume it's a character type iff it is a discrete type
7731 with a known character type name. */
7732 name
= ada_type_name (type
);
7733 return (name
!= NULL
7734 && (TYPE_CODE (type
) == TYPE_CODE_INT
7735 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7736 && (strcmp (name
, "character") == 0
7737 || strcmp (name
, "wide_character") == 0
7738 || strcmp (name
, "wide_wide_character") == 0
7739 || strcmp (name
, "unsigned char") == 0));
7742 /* True if TYPE appears to be an Ada string type. */
7745 ada_is_string_type (struct type
*type
)
7747 type
= ada_check_typedef (type
);
7749 && TYPE_CODE (type
) != TYPE_CODE_PTR
7750 && (ada_is_simple_array_type (type
)
7751 || ada_is_array_descriptor_type (type
))
7752 && ada_array_arity (type
) == 1)
7754 struct type
*elttype
= ada_array_element_type (type
, 1);
7756 return ada_is_character_type (elttype
);
7763 /* True if TYPE is a struct type introduced by the compiler to force the
7764 alignment of a value. Such types have a single field with a
7765 distinctive name. */
7768 ada_is_aligner_type (struct type
*type
)
7770 type
= ada_check_typedef (type
);
7772 /* If we can find a parallel XVS type, then the XVS type should
7773 be used instead of this type. And hence, this is not an aligner
7775 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7778 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7779 && TYPE_NFIELDS (type
) == 1
7780 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7783 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7784 the parallel type. */
7787 ada_get_base_type (struct type
*raw_type
)
7789 struct type
*real_type_namer
;
7790 struct type
*raw_real_type
;
7792 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7795 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7796 if (real_type_namer
== NULL
7797 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7798 || TYPE_NFIELDS (real_type_namer
) != 1)
7801 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7802 if (raw_real_type
== NULL
)
7805 return raw_real_type
;
7808 /* The type of value designated by TYPE, with all aligners removed. */
7811 ada_aligned_type (struct type
*type
)
7813 if (ada_is_aligner_type (type
))
7814 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7816 return ada_get_base_type (type
);
7820 /* The address of the aligned value in an object at address VALADDR
7821 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7824 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7826 if (ada_is_aligner_type (type
))
7827 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7829 TYPE_FIELD_BITPOS (type
,
7830 0) / TARGET_CHAR_BIT
);
7837 /* The printed representation of an enumeration literal with encoded
7838 name NAME. The value is good to the next call of ada_enum_name. */
7840 ada_enum_name (const char *name
)
7842 static char *result
;
7843 static size_t result_len
= 0;
7846 /* First, unqualify the enumeration name:
7847 1. Search for the last '.' character. If we find one, then skip
7848 all the preceeding characters, the unqualified name starts
7849 right after that dot.
7850 2. Otherwise, we may be debugging on a target where the compiler
7851 translates dots into "__". Search forward for double underscores,
7852 but stop searching when we hit an overloading suffix, which is
7853 of the form "__" followed by digits. */
7855 tmp
= strrchr (name
, '.');
7860 while ((tmp
= strstr (name
, "__")) != NULL
)
7862 if (isdigit (tmp
[2]))
7872 if (name
[1] == 'U' || name
[1] == 'W')
7874 if (sscanf (name
+ 2, "%x", &v
) != 1)
7880 GROW_VECT (result
, result_len
, 16);
7881 if (isascii (v
) && isprint (v
))
7882 sprintf (result
, "'%c'", v
);
7883 else if (name
[1] == 'U')
7884 sprintf (result
, "[\"%02x\"]", v
);
7886 sprintf (result
, "[\"%04x\"]", v
);
7892 tmp
= strstr (name
, "__");
7894 tmp
= strstr (name
, "$");
7897 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7898 strncpy (result
, name
, tmp
- name
);
7899 result
[tmp
- name
] = '\0';
7907 static struct value
*
7908 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7911 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7912 (expect_type
, exp
, pos
, noside
);
7915 /* Evaluate the subexpression of EXP starting at *POS as for
7916 evaluate_type, updating *POS to point just past the evaluated
7919 static struct value
*
7920 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7922 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7923 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7926 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7929 static struct value
*
7930 unwrap_value (struct value
*val
)
7932 struct type
*type
= ada_check_typedef (value_type (val
));
7933 if (ada_is_aligner_type (type
))
7935 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7936 struct type
*val_type
= ada_check_typedef (value_type (v
));
7937 if (ada_type_name (val_type
) == NULL
)
7938 TYPE_NAME (val_type
) = ada_type_name (type
);
7940 return unwrap_value (v
);
7944 struct type
*raw_real_type
=
7945 ada_check_typedef (ada_get_base_type (type
));
7947 if (type
== raw_real_type
)
7951 coerce_unspec_val_to_type
7952 (val
, ada_to_fixed_type (raw_real_type
, 0,
7953 VALUE_ADDRESS (val
) + value_offset (val
),
7958 static struct value
*
7959 cast_to_fixed (struct type
*type
, struct value
*arg
)
7963 if (type
== value_type (arg
))
7965 else if (ada_is_fixed_point_type (value_type (arg
)))
7966 val
= ada_float_to_fixed (type
,
7967 ada_fixed_to_float (value_type (arg
),
7968 value_as_long (arg
)));
7972 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7973 val
= ada_float_to_fixed (type
, argd
);
7976 return value_from_longest (type
, val
);
7979 static struct value
*
7980 cast_from_fixed_to_double (struct value
*arg
)
7982 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7983 value_as_long (arg
));
7984 return value_from_double (builtin_type_double
, val
);
7987 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7988 return the converted value. */
7990 static struct value
*
7991 coerce_for_assign (struct type
*type
, struct value
*val
)
7993 struct type
*type2
= value_type (val
);
7997 type2
= ada_check_typedef (type2
);
7998 type
= ada_check_typedef (type
);
8000 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
8001 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8003 val
= ada_value_ind (val
);
8004 type2
= value_type (val
);
8007 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8008 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8010 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8011 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8012 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8013 error (_("Incompatible types in assignment"));
8014 deprecated_set_value_type (val
, type
);
8019 static struct value
*
8020 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8023 struct type
*type1
, *type2
;
8026 arg1
= coerce_ref (arg1
);
8027 arg2
= coerce_ref (arg2
);
8028 type1
= base_type (ada_check_typedef (value_type (arg1
)));
8029 type2
= base_type (ada_check_typedef (value_type (arg2
)));
8031 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8032 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8033 return value_binop (arg1
, arg2
, op
);
8042 return value_binop (arg1
, arg2
, op
);
8045 v2
= value_as_long (arg2
);
8047 error (_("second operand of %s must not be zero."), op_string (op
));
8049 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8050 return value_binop (arg1
, arg2
, op
);
8052 v1
= value_as_long (arg1
);
8057 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8058 v
+= v
> 0 ? -1 : 1;
8066 /* Should not reach this point. */
8070 val
= allocate_value (type1
);
8071 store_unsigned_integer (value_contents_raw (val
),
8072 TYPE_LENGTH (value_type (val
)), v
);
8077 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8079 if (ada_is_direct_array_type (value_type (arg1
))
8080 || ada_is_direct_array_type (value_type (arg2
)))
8082 /* Automatically dereference any array reference before
8083 we attempt to perform the comparison. */
8084 arg1
= ada_coerce_ref (arg1
);
8085 arg2
= ada_coerce_ref (arg2
);
8087 arg1
= ada_coerce_to_simple_array (arg1
);
8088 arg2
= ada_coerce_to_simple_array (arg2
);
8089 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8090 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8091 error (_("Attempt to compare array with non-array"));
8092 /* FIXME: The following works only for types whose
8093 representations use all bits (no padding or undefined bits)
8094 and do not have user-defined equality. */
8096 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8097 && memcmp (value_contents (arg1
), value_contents (arg2
),
8098 TYPE_LENGTH (value_type (arg1
))) == 0;
8100 return value_equal (arg1
, arg2
);
8103 /* Total number of component associations in the aggregate starting at
8104 index PC in EXP. Assumes that index PC is the start of an
8108 num_component_specs (struct expression
*exp
, int pc
)
8111 m
= exp
->elts
[pc
+ 1].longconst
;
8114 for (i
= 0; i
< m
; i
+= 1)
8116 switch (exp
->elts
[pc
].opcode
)
8122 n
+= exp
->elts
[pc
+ 1].longconst
;
8125 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8130 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8131 component of LHS (a simple array or a record), updating *POS past
8132 the expression, assuming that LHS is contained in CONTAINER. Does
8133 not modify the inferior's memory, nor does it modify LHS (unless
8134 LHS == CONTAINER). */
8137 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8138 struct expression
*exp
, int *pos
)
8140 struct value
*mark
= value_mark ();
8142 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8144 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
8145 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8149 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8150 elt
= ada_to_fixed_value (unwrap_value (elt
));
8153 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8154 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8156 value_assign_to_component (container
, elt
,
8157 ada_evaluate_subexp (NULL
, exp
, pos
,
8160 value_free_to_mark (mark
);
8163 /* Assuming that LHS represents an lvalue having a record or array
8164 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8165 of that aggregate's value to LHS, advancing *POS past the
8166 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8167 lvalue containing LHS (possibly LHS itself). Does not modify
8168 the inferior's memory, nor does it modify the contents of
8169 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8171 static struct value
*
8172 assign_aggregate (struct value
*container
,
8173 struct value
*lhs
, struct expression
*exp
,
8174 int *pos
, enum noside noside
)
8176 struct type
*lhs_type
;
8177 int n
= exp
->elts
[*pos
+1].longconst
;
8178 LONGEST low_index
, high_index
;
8181 int max_indices
, num_indices
;
8182 int is_array_aggregate
;
8184 struct value
*mark
= value_mark ();
8187 if (noside
!= EVAL_NORMAL
)
8190 for (i
= 0; i
< n
; i
+= 1)
8191 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8195 container
= ada_coerce_ref (container
);
8196 if (ada_is_direct_array_type (value_type (container
)))
8197 container
= ada_coerce_to_simple_array (container
);
8198 lhs
= ada_coerce_ref (lhs
);
8199 if (!deprecated_value_modifiable (lhs
))
8200 error (_("Left operand of assignment is not a modifiable lvalue."));
8202 lhs_type
= value_type (lhs
);
8203 if (ada_is_direct_array_type (lhs_type
))
8205 lhs
= ada_coerce_to_simple_array (lhs
);
8206 lhs_type
= value_type (lhs
);
8207 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8208 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8209 is_array_aggregate
= 1;
8211 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8214 high_index
= num_visible_fields (lhs_type
) - 1;
8215 is_array_aggregate
= 0;
8218 error (_("Left-hand side must be array or record."));
8220 num_specs
= num_component_specs (exp
, *pos
- 3);
8221 max_indices
= 4 * num_specs
+ 4;
8222 indices
= alloca (max_indices
* sizeof (indices
[0]));
8223 indices
[0] = indices
[1] = low_index
- 1;
8224 indices
[2] = indices
[3] = high_index
+ 1;
8227 for (i
= 0; i
< n
; i
+= 1)
8229 switch (exp
->elts
[*pos
].opcode
)
8232 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8233 &num_indices
, max_indices
,
8234 low_index
, high_index
);
8237 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8238 &num_indices
, max_indices
,
8239 low_index
, high_index
);
8243 error (_("Misplaced 'others' clause"));
8244 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8245 num_indices
, low_index
, high_index
);
8248 error (_("Internal error: bad aggregate clause"));
8255 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8256 construct at *POS, updating *POS past the construct, given that
8257 the positions are relative to lower bound LOW, where HIGH is the
8258 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8259 updating *NUM_INDICES as needed. CONTAINER is as for
8260 assign_aggregate. */
8262 aggregate_assign_positional (struct value
*container
,
8263 struct value
*lhs
, struct expression
*exp
,
8264 int *pos
, LONGEST
*indices
, int *num_indices
,
8265 int max_indices
, LONGEST low
, LONGEST high
)
8267 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8269 if (ind
- 1 == high
)
8270 warning (_("Extra components in aggregate ignored."));
8273 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8275 assign_component (container
, lhs
, ind
, exp
, pos
);
8278 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8281 /* Assign into the components of LHS indexed by the OP_CHOICES
8282 construct at *POS, updating *POS past the construct, given that
8283 the allowable indices are LOW..HIGH. Record the indices assigned
8284 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8285 needed. CONTAINER is as for assign_aggregate. */
8287 aggregate_assign_from_choices (struct value
*container
,
8288 struct value
*lhs
, struct expression
*exp
,
8289 int *pos
, LONGEST
*indices
, int *num_indices
,
8290 int max_indices
, LONGEST low
, LONGEST high
)
8293 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8294 int choice_pos
, expr_pc
;
8295 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8297 choice_pos
= *pos
+= 3;
8299 for (j
= 0; j
< n_choices
; j
+= 1)
8300 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8302 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8304 for (j
= 0; j
< n_choices
; j
+= 1)
8306 LONGEST lower
, upper
;
8307 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8308 if (op
== OP_DISCRETE_RANGE
)
8311 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8313 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8318 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8329 name
= &exp
->elts
[choice_pos
+ 2].string
;
8332 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8335 error (_("Invalid record component association."));
8337 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8339 if (! find_struct_field (name
, value_type (lhs
), 0,
8340 NULL
, NULL
, NULL
, NULL
, &ind
))
8341 error (_("Unknown component name: %s."), name
);
8342 lower
= upper
= ind
;
8345 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8346 error (_("Index in component association out of bounds."));
8348 add_component_interval (lower
, upper
, indices
, num_indices
,
8350 while (lower
<= upper
)
8354 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8360 /* Assign the value of the expression in the OP_OTHERS construct in
8361 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8362 have not been previously assigned. The index intervals already assigned
8363 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8364 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8366 aggregate_assign_others (struct value
*container
,
8367 struct value
*lhs
, struct expression
*exp
,
8368 int *pos
, LONGEST
*indices
, int num_indices
,
8369 LONGEST low
, LONGEST high
)
8372 int expr_pc
= *pos
+1;
8374 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8377 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8381 assign_component (container
, lhs
, ind
, exp
, &pos
);
8384 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8387 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8388 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8389 modifying *SIZE as needed. It is an error if *SIZE exceeds
8390 MAX_SIZE. The resulting intervals do not overlap. */
8392 add_component_interval (LONGEST low
, LONGEST high
,
8393 LONGEST
* indices
, int *size
, int max_size
)
8396 for (i
= 0; i
< *size
; i
+= 2) {
8397 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8400 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8401 if (high
< indices
[kh
])
8403 if (low
< indices
[i
])
8405 indices
[i
+ 1] = indices
[kh
- 1];
8406 if (high
> indices
[i
+ 1])
8407 indices
[i
+ 1] = high
;
8408 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8409 *size
-= kh
- i
- 2;
8412 else if (high
< indices
[i
])
8416 if (*size
== max_size
)
8417 error (_("Internal error: miscounted aggregate components."));
8419 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8420 indices
[j
] = indices
[j
- 2];
8422 indices
[i
+ 1] = high
;
8425 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8428 static struct value
*
8429 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8431 if (type
== ada_check_typedef (value_type (arg2
)))
8434 if (ada_is_fixed_point_type (type
))
8435 return (cast_to_fixed (type
, arg2
));
8437 if (ada_is_fixed_point_type (value_type (arg2
)))
8438 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8440 return value_cast (type
, arg2
);
8443 static struct value
*
8444 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8445 int *pos
, enum noside noside
)
8448 int tem
, tem2
, tem3
;
8450 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8453 struct value
**argvec
;
8457 op
= exp
->elts
[pc
].opcode
;
8463 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8464 arg1
= unwrap_value (arg1
);
8466 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8467 then we need to perform the conversion manually, because
8468 evaluate_subexp_standard doesn't do it. This conversion is
8469 necessary in Ada because the different kinds of float/fixed
8470 types in Ada have different representations.
8472 Similarly, we need to perform the conversion from OP_LONG
8474 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8475 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8481 struct value
*result
;
8483 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8484 /* The result type will have code OP_STRING, bashed there from
8485 OP_ARRAY. Bash it back. */
8486 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8487 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8493 type
= exp
->elts
[pc
+ 1].type
;
8494 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8495 if (noside
== EVAL_SKIP
)
8497 arg1
= ada_value_cast (type
, arg1
, noside
);
8502 type
= exp
->elts
[pc
+ 1].type
;
8503 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8506 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8507 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8509 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8510 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8512 return ada_value_assign (arg1
, arg1
);
8514 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8515 except if the lhs of our assignment is a convenience variable.
8516 In the case of assigning to a convenience variable, the lhs
8517 should be exactly the result of the evaluation of the rhs. */
8518 type
= value_type (arg1
);
8519 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8521 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8522 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8524 if (ada_is_fixed_point_type (value_type (arg1
)))
8525 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8526 else if (ada_is_fixed_point_type (value_type (arg2
)))
8528 (_("Fixed-point values must be assigned to fixed-point variables"));
8530 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8531 return ada_value_assign (arg1
, arg2
);
8534 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8535 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8536 if (noside
== EVAL_SKIP
)
8538 if ((ada_is_fixed_point_type (value_type (arg1
))
8539 || ada_is_fixed_point_type (value_type (arg2
)))
8540 && value_type (arg1
) != value_type (arg2
))
8541 error (_("Operands of fixed-point addition must have the same type"));
8542 /* Do the addition, and cast the result to the type of the first
8543 argument. We cannot cast the result to a reference type, so if
8544 ARG1 is a reference type, find its underlying type. */
8545 type
= value_type (arg1
);
8546 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8547 type
= TYPE_TARGET_TYPE (type
);
8548 return value_cast (type
, value_add (arg1
, arg2
));
8551 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8552 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8553 if (noside
== EVAL_SKIP
)
8555 if ((ada_is_fixed_point_type (value_type (arg1
))
8556 || ada_is_fixed_point_type (value_type (arg2
)))
8557 && value_type (arg1
) != value_type (arg2
))
8558 error (_("Operands of fixed-point subtraction must have the same type"));
8559 /* Do the substraction, and cast the result to the type of the first
8560 argument. We cannot cast the result to a reference type, so if
8561 ARG1 is a reference type, find its underlying type. */
8562 type
= value_type (arg1
);
8563 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8564 type
= TYPE_TARGET_TYPE (type
);
8565 return value_cast (type
, value_sub (arg1
, arg2
));
8569 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8570 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8571 if (noside
== EVAL_SKIP
)
8573 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8574 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8575 return value_zero (value_type (arg1
), not_lval
);
8578 if (ada_is_fixed_point_type (value_type (arg1
)))
8579 arg1
= cast_from_fixed_to_double (arg1
);
8580 if (ada_is_fixed_point_type (value_type (arg2
)))
8581 arg2
= cast_from_fixed_to_double (arg2
);
8582 return ada_value_binop (arg1
, arg2
, op
);
8587 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8588 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8589 if (noside
== EVAL_SKIP
)
8591 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8592 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8593 return value_zero (value_type (arg1
), not_lval
);
8595 return ada_value_binop (arg1
, arg2
, op
);
8598 case BINOP_NOTEQUAL
:
8599 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8600 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8601 if (noside
== EVAL_SKIP
)
8603 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8606 tem
= ada_value_equal (arg1
, arg2
);
8607 if (op
== BINOP_NOTEQUAL
)
8609 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8612 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8613 if (noside
== EVAL_SKIP
)
8615 else if (ada_is_fixed_point_type (value_type (arg1
)))
8616 return value_cast (value_type (arg1
), value_neg (arg1
));
8618 return value_neg (arg1
);
8620 case BINOP_LOGICAL_AND
:
8621 case BINOP_LOGICAL_OR
:
8622 case UNOP_LOGICAL_NOT
:
8627 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8628 return value_cast (LA_BOOL_TYPE
, val
);
8631 case BINOP_BITWISE_AND
:
8632 case BINOP_BITWISE_IOR
:
8633 case BINOP_BITWISE_XOR
:
8637 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8639 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8641 return value_cast (value_type (arg1
), val
);
8647 /* Tagged types are a little special in the fact that the real type
8648 is dynamic and can only be determined by inspecting the object
8649 value. So even if we're support to do an EVAL_AVOID_SIDE_EFFECTS
8650 evaluation, we force an EVAL_NORMAL evaluation for tagged types. */
8651 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8652 && ada_is_tagged_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
), 1))
8653 noside
= EVAL_NORMAL
;
8655 if (noside
== EVAL_SKIP
)
8660 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8661 /* Only encountered when an unresolved symbol occurs in a
8662 context other than a function call, in which case, it is
8664 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8665 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8666 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8670 (to_static_fixed_type
8671 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8677 unwrap_value (evaluate_subexp_standard
8678 (expect_type
, exp
, pos
, noside
));
8679 return ada_to_fixed_value (arg1
);
8685 /* Allocate arg vector, including space for the function to be
8686 called in argvec[0] and a terminating NULL. */
8687 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8689 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8691 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8692 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8693 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8694 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8697 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8698 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8701 if (noside
== EVAL_SKIP
)
8705 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8706 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8707 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8708 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8709 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8710 argvec
[0] = value_addr (argvec
[0]);
8712 type
= ada_check_typedef (value_type (argvec
[0]));
8713 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8715 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8717 case TYPE_CODE_FUNC
:
8718 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8720 case TYPE_CODE_ARRAY
:
8722 case TYPE_CODE_STRUCT
:
8723 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8724 argvec
[0] = ada_value_ind (argvec
[0]);
8725 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8728 error (_("cannot subscript or call something of type `%s'"),
8729 ada_type_name (value_type (argvec
[0])));
8734 switch (TYPE_CODE (type
))
8736 case TYPE_CODE_FUNC
:
8737 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8738 return allocate_value (TYPE_TARGET_TYPE (type
));
8739 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8740 case TYPE_CODE_STRUCT
:
8744 arity
= ada_array_arity (type
);
8745 type
= ada_array_element_type (type
, nargs
);
8747 error (_("cannot subscript or call a record"));
8749 error (_("wrong number of subscripts; expecting %d"), arity
);
8750 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8751 return value_zero (ada_aligned_type (type
), lval_memory
);
8753 unwrap_value (ada_value_subscript
8754 (argvec
[0], nargs
, argvec
+ 1));
8756 case TYPE_CODE_ARRAY
:
8757 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8759 type
= ada_array_element_type (type
, nargs
);
8761 error (_("element type of array unknown"));
8763 return value_zero (ada_aligned_type (type
), lval_memory
);
8766 unwrap_value (ada_value_subscript
8767 (ada_coerce_to_simple_array (argvec
[0]),
8768 nargs
, argvec
+ 1));
8769 case TYPE_CODE_PTR
: /* Pointer to array */
8770 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8771 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8773 type
= ada_array_element_type (type
, nargs
);
8775 error (_("element type of array unknown"));
8777 return value_zero (ada_aligned_type (type
), lval_memory
);
8780 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8781 nargs
, argvec
+ 1));
8784 error (_("Attempt to index or call something other than an "
8785 "array or function"));
8790 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8791 struct value
*low_bound_val
=
8792 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8793 struct value
*high_bound_val
=
8794 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8797 low_bound_val
= coerce_ref (low_bound_val
);
8798 high_bound_val
= coerce_ref (high_bound_val
);
8799 low_bound
= pos_atr (low_bound_val
);
8800 high_bound
= pos_atr (high_bound_val
);
8802 if (noside
== EVAL_SKIP
)
8805 /* If this is a reference to an aligner type, then remove all
8807 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8808 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8809 TYPE_TARGET_TYPE (value_type (array
)) =
8810 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8812 if (ada_is_packed_array_type (value_type (array
)))
8813 error (_("cannot slice a packed array"));
8815 /* If this is a reference to an array or an array lvalue,
8816 convert to a pointer. */
8817 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8818 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8819 && VALUE_LVAL (array
) == lval_memory
))
8820 array
= value_addr (array
);
8822 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8823 && ada_is_array_descriptor_type (ada_check_typedef
8824 (value_type (array
))))
8825 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8827 array
= ada_coerce_to_simple_array_ptr (array
);
8829 /* If we have more than one level of pointer indirection,
8830 dereference the value until we get only one level. */
8831 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8832 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8834 array
= value_ind (array
);
8836 /* Make sure we really do have an array type before going further,
8837 to avoid a SEGV when trying to get the index type or the target
8838 type later down the road if the debug info generated by
8839 the compiler is incorrect or incomplete. */
8840 if (!ada_is_simple_array_type (value_type (array
)))
8841 error (_("cannot take slice of non-array"));
8843 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8845 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8846 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8850 struct type
*arr_type0
=
8851 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8853 return ada_value_slice_ptr (array
, arr_type0
,
8854 longest_to_int (low_bound
),
8855 longest_to_int (high_bound
));
8858 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8860 else if (high_bound
< low_bound
)
8861 return empty_array (value_type (array
), low_bound
);
8863 return ada_value_slice (array
, longest_to_int (low_bound
),
8864 longest_to_int (high_bound
));
8869 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8870 type
= exp
->elts
[pc
+ 1].type
;
8872 if (noside
== EVAL_SKIP
)
8875 switch (TYPE_CODE (type
))
8878 lim_warning (_("Membership test incompletely implemented; "
8879 "always returns true"));
8880 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8882 case TYPE_CODE_RANGE
:
8883 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8884 arg3
= value_from_longest (builtin_type_int
,
8885 TYPE_HIGH_BOUND (type
));
8887 value_from_longest (builtin_type_int
,
8888 (value_less (arg1
, arg3
)
8889 || value_equal (arg1
, arg3
))
8890 && (value_less (arg2
, arg1
)
8891 || value_equal (arg2
, arg1
)));
8894 case BINOP_IN_BOUNDS
:
8896 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8897 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8899 if (noside
== EVAL_SKIP
)
8902 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8903 return value_zero (builtin_type_int
, not_lval
);
8905 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8907 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8908 error (_("invalid dimension number to 'range"));
8910 arg3
= ada_array_bound (arg2
, tem
, 1);
8911 arg2
= ada_array_bound (arg2
, tem
, 0);
8914 value_from_longest (builtin_type_int
,
8915 (value_less (arg1
, arg3
)
8916 || value_equal (arg1
, arg3
))
8917 && (value_less (arg2
, arg1
)
8918 || value_equal (arg2
, arg1
)));
8920 case TERNOP_IN_RANGE
:
8921 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8922 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8923 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8925 if (noside
== EVAL_SKIP
)
8929 value_from_longest (builtin_type_int
,
8930 (value_less (arg1
, arg3
)
8931 || value_equal (arg1
, arg3
))
8932 && (value_less (arg2
, arg1
)
8933 || value_equal (arg2
, arg1
)));
8939 struct type
*type_arg
;
8940 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8942 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8944 type_arg
= exp
->elts
[pc
+ 2].type
;
8948 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8952 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8953 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8954 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8957 if (noside
== EVAL_SKIP
)
8960 if (type_arg
== NULL
)
8962 arg1
= ada_coerce_ref (arg1
);
8964 if (ada_is_packed_array_type (value_type (arg1
)))
8965 arg1
= ada_coerce_to_simple_array (arg1
);
8967 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8968 error (_("invalid dimension number to '%s"),
8969 ada_attribute_name (op
));
8971 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8973 type
= ada_index_type (value_type (arg1
), tem
);
8976 (_("attempt to take bound of something that is not an array"));
8977 return allocate_value (type
);
8982 default: /* Should never happen. */
8983 error (_("unexpected attribute encountered"));
8985 return ada_array_bound (arg1
, tem
, 0);
8987 return ada_array_bound (arg1
, tem
, 1);
8989 return ada_array_length (arg1
, tem
);
8992 else if (discrete_type_p (type_arg
))
8994 struct type
*range_type
;
8995 char *name
= ada_type_name (type_arg
);
8997 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8999 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
9000 if (range_type
== NULL
)
9001 range_type
= type_arg
;
9005 error (_("unexpected attribute encountered"));
9007 return discrete_type_low_bound (range_type
);
9009 return discrete_type_high_bound (range_type
);
9011 error (_("the 'length attribute applies only to array types"));
9014 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9015 error (_("unimplemented type attribute"));
9020 if (ada_is_packed_array_type (type_arg
))
9021 type_arg
= decode_packed_array_type (type_arg
);
9023 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
9024 error (_("invalid dimension number to '%s"),
9025 ada_attribute_name (op
));
9027 type
= ada_index_type (type_arg
, tem
);
9030 (_("attempt to take bound of something that is not an array"));
9031 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9032 return allocate_value (type
);
9037 error (_("unexpected attribute encountered"));
9039 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9040 return value_from_longest (type
, low
);
9042 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
9043 return value_from_longest (type
, high
);
9045 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9046 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
9047 return value_from_longest (type
, high
- low
+ 1);
9053 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9054 if (noside
== EVAL_SKIP
)
9057 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9058 return value_zero (ada_tag_type (arg1
), not_lval
);
9060 return ada_value_tag (arg1
);
9064 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9065 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9066 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9067 if (noside
== EVAL_SKIP
)
9069 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9070 return value_zero (value_type (arg1
), not_lval
);
9072 return value_binop (arg1
, arg2
,
9073 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9075 case OP_ATR_MODULUS
:
9077 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9078 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9080 if (noside
== EVAL_SKIP
)
9083 if (!ada_is_modular_type (type_arg
))
9084 error (_("'modulus must be applied to modular type"));
9086 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9087 ada_modulus (type_arg
));
9092 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9093 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9094 if (noside
== EVAL_SKIP
)
9096 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9097 return value_zero (builtin_type_int
, not_lval
);
9099 return value_pos_atr (arg1
);
9102 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9103 if (noside
== EVAL_SKIP
)
9105 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9106 return value_zero (builtin_type_int
, not_lval
);
9108 return value_from_longest (builtin_type_int
,
9110 * TYPE_LENGTH (value_type (arg1
)));
9113 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9114 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9115 type
= exp
->elts
[pc
+ 2].type
;
9116 if (noside
== EVAL_SKIP
)
9118 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9119 return value_zero (type
, not_lval
);
9121 return value_val_atr (type
, arg1
);
9124 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9125 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9126 if (noside
== EVAL_SKIP
)
9128 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9129 return value_zero (value_type (arg1
), not_lval
);
9131 return value_binop (arg1
, arg2
, op
);
9134 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9135 if (noside
== EVAL_SKIP
)
9141 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9142 if (noside
== EVAL_SKIP
)
9144 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9145 return value_neg (arg1
);
9150 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
9151 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
9152 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
9153 if (noside
== EVAL_SKIP
)
9155 type
= ada_check_typedef (value_type (arg1
));
9156 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9158 if (ada_is_array_descriptor_type (type
))
9159 /* GDB allows dereferencing GNAT array descriptors. */
9161 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9162 if (arrType
== NULL
)
9163 error (_("Attempt to dereference null array pointer."));
9164 return value_at_lazy (arrType
, 0);
9166 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9167 || TYPE_CODE (type
) == TYPE_CODE_REF
9168 /* In C you can dereference an array to get the 1st elt. */
9169 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9171 type
= to_static_fixed_type
9173 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9175 return value_zero (type
, lval_memory
);
9177 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9178 /* GDB allows dereferencing an int. */
9179 return value_zero (builtin_type_int
, lval_memory
);
9181 error (_("Attempt to take contents of a non-pointer value."));
9183 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9184 type
= ada_check_typedef (value_type (arg1
));
9186 if (ada_is_array_descriptor_type (type
))
9187 /* GDB allows dereferencing GNAT array descriptors. */
9188 return ada_coerce_to_simple_array (arg1
);
9190 return ada_value_ind (arg1
);
9192 case STRUCTOP_STRUCT
:
9193 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9194 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9195 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9196 if (noside
== EVAL_SKIP
)
9198 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9200 struct type
*type1
= value_type (arg1
);
9201 if (ada_is_tagged_type (type1
, 1))
9203 type
= ada_lookup_struct_elt_type (type1
,
9204 &exp
->elts
[pc
+ 2].string
,
9207 /* In this case, we assume that the field COULD exist
9208 in some extension of the type. Return an object of
9209 "type" void, which will match any formal
9210 (see ada_type_match). */
9211 return value_zero (builtin_type_void
, lval_memory
);
9215 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9218 return value_zero (ada_aligned_type (type
), lval_memory
);
9222 ada_to_fixed_value (unwrap_value
9223 (ada_value_struct_elt
9224 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9226 /* The value is not supposed to be used. This is here to make it
9227 easier to accommodate expressions that contain types. */
9229 if (noside
== EVAL_SKIP
)
9231 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9232 return allocate_value (exp
->elts
[pc
+ 1].type
);
9234 error (_("Attempt to use a type name as an expression"));
9239 case OP_DISCRETE_RANGE
:
9242 if (noside
== EVAL_NORMAL
)
9246 error (_("Undefined name, ambiguous name, or renaming used in "
9247 "component association: %s."), &exp
->elts
[pc
+2].string
);
9249 error (_("Aggregates only allowed on the right of an assignment"));
9251 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9254 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9256 for (tem
= 0; tem
< nargs
; tem
+= 1)
9257 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9262 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
9268 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9269 type name that encodes the 'small and 'delta information.
9270 Otherwise, return NULL. */
9273 fixed_type_info (struct type
*type
)
9275 const char *name
= ada_type_name (type
);
9276 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9278 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9280 const char *tail
= strstr (name
, "___XF_");
9286 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9287 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9292 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9295 ada_is_fixed_point_type (struct type
*type
)
9297 return fixed_type_info (type
) != NULL
;
9300 /* Return non-zero iff TYPE represents a System.Address type. */
9303 ada_is_system_address_type (struct type
*type
)
9305 return (TYPE_NAME (type
)
9306 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9309 /* Assuming that TYPE is the representation of an Ada fixed-point
9310 type, return its delta, or -1 if the type is malformed and the
9311 delta cannot be determined. */
9314 ada_delta (struct type
*type
)
9316 const char *encoding
= fixed_type_info (type
);
9319 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9322 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9325 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9326 factor ('SMALL value) associated with the type. */
9329 scaling_factor (struct type
*type
)
9331 const char *encoding
= fixed_type_info (type
);
9332 unsigned long num0
, den0
, num1
, den1
;
9335 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9340 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9342 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9346 /* Assuming that X is the representation of a value of fixed-point
9347 type TYPE, return its floating-point equivalent. */
9350 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9352 return (DOUBLEST
) x
*scaling_factor (type
);
9355 /* The representation of a fixed-point value of type TYPE
9356 corresponding to the value X. */
9359 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9361 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9365 /* VAX floating formats */
9367 /* Non-zero iff TYPE represents one of the special VAX floating-point
9371 ada_is_vax_floating_type (struct type
*type
)
9374 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9377 && (TYPE_CODE (type
) == TYPE_CODE_INT
9378 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9379 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9382 /* The type of special VAX floating-point type this is, assuming
9383 ada_is_vax_floating_point. */
9386 ada_vax_float_type_suffix (struct type
*type
)
9388 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9391 /* A value representing the special debugging function that outputs
9392 VAX floating-point values of the type represented by TYPE. Assumes
9393 ada_is_vax_floating_type (TYPE). */
9396 ada_vax_float_print_function (struct type
*type
)
9398 switch (ada_vax_float_type_suffix (type
))
9401 return get_var_value ("DEBUG_STRING_F", 0);
9403 return get_var_value ("DEBUG_STRING_D", 0);
9405 return get_var_value ("DEBUG_STRING_G", 0);
9407 error (_("invalid VAX floating-point type"));
9414 /* Scan STR beginning at position K for a discriminant name, and
9415 return the value of that discriminant field of DVAL in *PX. If
9416 PNEW_K is not null, put the position of the character beyond the
9417 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9418 not alter *PX and *PNEW_K if unsuccessful. */
9421 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9424 static char *bound_buffer
= NULL
;
9425 static size_t bound_buffer_len
= 0;
9428 struct value
*bound_val
;
9430 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9433 pend
= strstr (str
+ k
, "__");
9437 k
+= strlen (bound
);
9441 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9442 bound
= bound_buffer
;
9443 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9444 bound
[pend
- (str
+ k
)] = '\0';
9448 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9449 if (bound_val
== NULL
)
9452 *px
= value_as_long (bound_val
);
9458 /* Value of variable named NAME in the current environment. If
9459 no such variable found, then if ERR_MSG is null, returns 0, and
9460 otherwise causes an error with message ERR_MSG. */
9462 static struct value
*
9463 get_var_value (char *name
, char *err_msg
)
9465 struct ada_symbol_info
*syms
;
9468 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9473 if (err_msg
== NULL
)
9476 error (("%s"), err_msg
);
9479 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9482 /* Value of integer variable named NAME in the current environment. If
9483 no such variable found, returns 0, and sets *FLAG to 0. If
9484 successful, sets *FLAG to 1. */
9487 get_int_var_value (char *name
, int *flag
)
9489 struct value
*var_val
= get_var_value (name
, 0);
9501 return value_as_long (var_val
);
9506 /* Return a range type whose base type is that of the range type named
9507 NAME in the current environment, and whose bounds are calculated
9508 from NAME according to the GNAT range encoding conventions.
9509 Extract discriminant values, if needed, from DVAL. If a new type
9510 must be created, allocate in OBJFILE's space. The bounds
9511 information, in general, is encoded in NAME, the base type given in
9512 the named range type. */
9514 static struct type
*
9515 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9517 struct type
*raw_type
= ada_find_any_type (name
);
9518 struct type
*base_type
;
9521 if (raw_type
== NULL
)
9522 base_type
= builtin_type_int
;
9523 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9524 base_type
= TYPE_TARGET_TYPE (raw_type
);
9526 base_type
= raw_type
;
9528 subtype_info
= strstr (name
, "___XD");
9529 if (subtype_info
== NULL
)
9533 static char *name_buf
= NULL
;
9534 static size_t name_len
= 0;
9535 int prefix_len
= subtype_info
- name
;
9541 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9542 strncpy (name_buf
, name
, prefix_len
);
9543 name_buf
[prefix_len
] = '\0';
9546 bounds_str
= strchr (subtype_info
, '_');
9549 if (*subtype_info
== 'L')
9551 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9552 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9554 if (bounds_str
[n
] == '_')
9556 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9563 strcpy (name_buf
+ prefix_len
, "___L");
9564 L
= get_int_var_value (name_buf
, &ok
);
9567 lim_warning (_("Unknown lower bound, using 1."));
9572 if (*subtype_info
== 'U')
9574 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9575 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9581 strcpy (name_buf
+ prefix_len
, "___U");
9582 U
= get_int_var_value (name_buf
, &ok
);
9585 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9590 if (objfile
== NULL
)
9591 objfile
= TYPE_OBJFILE (base_type
);
9592 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9593 TYPE_NAME (type
) = name
;
9598 /* True iff NAME is the name of a range type. */
9601 ada_is_range_type_name (const char *name
)
9603 return (name
!= NULL
&& strstr (name
, "___XD"));
9609 /* True iff TYPE is an Ada modular type. */
9612 ada_is_modular_type (struct type
*type
)
9614 struct type
*subranged_type
= base_type (type
);
9616 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9617 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9618 && TYPE_UNSIGNED (subranged_type
));
9621 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9624 ada_modulus (struct type
* type
)
9626 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9630 /* Ada exception catchpoint support:
9631 ---------------------------------
9633 We support 3 kinds of exception catchpoints:
9634 . catchpoints on Ada exceptions
9635 . catchpoints on unhandled Ada exceptions
9636 . catchpoints on failed assertions
9638 Exceptions raised during failed assertions, or unhandled exceptions
9639 could perfectly be caught with the general catchpoint on Ada exceptions.
9640 However, we can easily differentiate these two special cases, and having
9641 the option to distinguish these two cases from the rest can be useful
9642 to zero-in on certain situations.
9644 Exception catchpoints are a specialized form of breakpoint,
9645 since they rely on inserting breakpoints inside known routines
9646 of the GNAT runtime. The implementation therefore uses a standard
9647 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9650 Support in the runtime for exception catchpoints have been changed
9651 a few times already, and these changes affect the implementation
9652 of these catchpoints. In order to be able to support several
9653 variants of the runtime, we use a sniffer that will determine
9654 the runtime variant used by the program being debugged.
9656 At this time, we do not support the use of conditions on Ada exception
9657 catchpoints. The COND and COND_STRING fields are therefore set
9658 to NULL (most of the time, see below).
9660 Conditions where EXP_STRING, COND, and COND_STRING are used:
9662 When a user specifies the name of a specific exception in the case
9663 of catchpoints on Ada exceptions, we store the name of that exception
9664 in the EXP_STRING. We then translate this request into an actual
9665 condition stored in COND_STRING, and then parse it into an expression
9668 /* The different types of catchpoints that we introduced for catching
9671 enum exception_catchpoint_kind
9674 ex_catch_exception_unhandled
,
9678 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9680 /* A structure that describes how to support exception catchpoints
9681 for a given executable. */
9683 struct exception_support_info
9685 /* The name of the symbol to break on in order to insert
9686 a catchpoint on exceptions. */
9687 const char *catch_exception_sym
;
9689 /* The name of the symbol to break on in order to insert
9690 a catchpoint on unhandled exceptions. */
9691 const char *catch_exception_unhandled_sym
;
9693 /* The name of the symbol to break on in order to insert
9694 a catchpoint on failed assertions. */
9695 const char *catch_assert_sym
;
9697 /* Assuming that the inferior just triggered an unhandled exception
9698 catchpoint, this function is responsible for returning the address
9699 in inferior memory where the name of that exception is stored.
9700 Return zero if the address could not be computed. */
9701 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9704 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9705 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9707 /* The following exception support info structure describes how to
9708 implement exception catchpoints with the latest version of the
9709 Ada runtime (as of 2007-03-06). */
9711 static const struct exception_support_info default_exception_support_info
=
9713 "__gnat_debug_raise_exception", /* catch_exception_sym */
9714 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9715 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9716 ada_unhandled_exception_name_addr
9719 /* The following exception support info structure describes how to
9720 implement exception catchpoints with a slightly older version
9721 of the Ada runtime. */
9723 static const struct exception_support_info exception_support_info_fallback
=
9725 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9726 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9727 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9728 ada_unhandled_exception_name_addr_from_raise
9731 /* For each executable, we sniff which exception info structure to use
9732 and cache it in the following global variable. */
9734 static const struct exception_support_info
*exception_info
= NULL
;
9736 /* Inspect the Ada runtime and determine which exception info structure
9737 should be used to provide support for exception catchpoints.
9739 This function will always set exception_info, or raise an error. */
9742 ada_exception_support_info_sniffer (void)
9746 /* If the exception info is already known, then no need to recompute it. */
9747 if (exception_info
!= NULL
)
9750 /* Check the latest (default) exception support info. */
9751 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9755 exception_info
= &default_exception_support_info
;
9759 /* Try our fallback exception suport info. */
9760 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9764 exception_info
= &exception_support_info_fallback
;
9768 /* Sometimes, it is normal for us to not be able to find the routine
9769 we are looking for. This happens when the program is linked with
9770 the shared version of the GNAT runtime, and the program has not been
9771 started yet. Inform the user of these two possible causes if
9774 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9775 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9777 /* If the symbol does not exist, then check that the program is
9778 already started, to make sure that shared libraries have been
9779 loaded. If it is not started, this may mean that the symbol is
9780 in a shared library. */
9782 if (ptid_get_pid (inferior_ptid
) == 0)
9783 error (_("Unable to insert catchpoint. Try to start the program first."));
9785 /* At this point, we know that we are debugging an Ada program and
9786 that the inferior has been started, but we still are not able to
9787 find the run-time symbols. That can mean that we are in
9788 configurable run time mode, or that a-except as been optimized
9789 out by the linker... In any case, at this point it is not worth
9790 supporting this feature. */
9792 error (_("Cannot insert catchpoints in this configuration."));
9795 /* An observer of "executable_changed" events.
9796 Its role is to clear certain cached values that need to be recomputed
9797 each time a new executable is loaded by GDB. */
9800 ada_executable_changed_observer (void *unused
)
9802 /* If the executable changed, then it is possible that the Ada runtime
9803 is different. So we need to invalidate the exception support info
9805 exception_info
= NULL
;
9808 /* Return the name of the function at PC, NULL if could not find it.
9809 This function only checks the debugging information, not the symbol
9813 function_name_from_pc (CORE_ADDR pc
)
9817 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9823 /* True iff FRAME is very likely to be that of a function that is
9824 part of the runtime system. This is all very heuristic, but is
9825 intended to be used as advice as to what frames are uninteresting
9829 is_known_support_routine (struct frame_info
*frame
)
9831 struct symtab_and_line sal
;
9835 /* If this code does not have any debugging information (no symtab),
9836 This cannot be any user code. */
9838 find_frame_sal (frame
, &sal
);
9839 if (sal
.symtab
== NULL
)
9842 /* If there is a symtab, but the associated source file cannot be
9843 located, then assume this is not user code: Selecting a frame
9844 for which we cannot display the code would not be very helpful
9845 for the user. This should also take care of case such as VxWorks
9846 where the kernel has some debugging info provided for a few units. */
9848 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9851 /* Check the unit filename againt the Ada runtime file naming.
9852 We also check the name of the objfile against the name of some
9853 known system libraries that sometimes come with debugging info
9856 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9858 re_comp (known_runtime_file_name_patterns
[i
]);
9859 if (re_exec (sal
.symtab
->filename
))
9861 if (sal
.symtab
->objfile
!= NULL
9862 && re_exec (sal
.symtab
->objfile
->name
))
9866 /* Check whether the function is a GNAT-generated entity. */
9868 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9869 if (func_name
== NULL
)
9872 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9874 re_comp (known_auxiliary_function_name_patterns
[i
]);
9875 if (re_exec (func_name
))
9882 /* Find the first frame that contains debugging information and that is not
9883 part of the Ada run-time, starting from FI and moving upward. */
9886 ada_find_printable_frame (struct frame_info
*fi
)
9888 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9890 if (!is_known_support_routine (fi
))
9899 /* Assuming that the inferior just triggered an unhandled exception
9900 catchpoint, return the address in inferior memory where the name
9901 of the exception is stored.
9903 Return zero if the address could not be computed. */
9906 ada_unhandled_exception_name_addr (void)
9908 return parse_and_eval_address ("e.full_name");
9911 /* Same as ada_unhandled_exception_name_addr, except that this function
9912 should be used when the inferior uses an older version of the runtime,
9913 where the exception name needs to be extracted from a specific frame
9914 several frames up in the callstack. */
9917 ada_unhandled_exception_name_addr_from_raise (void)
9920 struct frame_info
*fi
;
9922 /* To determine the name of this exception, we need to select
9923 the frame corresponding to RAISE_SYM_NAME. This frame is
9924 at least 3 levels up, so we simply skip the first 3 frames
9925 without checking the name of their associated function. */
9926 fi
= get_current_frame ();
9927 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9929 fi
= get_prev_frame (fi
);
9933 const char *func_name
=
9934 function_name_from_pc (get_frame_address_in_block (fi
));
9935 if (func_name
!= NULL
9936 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9937 break; /* We found the frame we were looking for... */
9938 fi
= get_prev_frame (fi
);
9945 return parse_and_eval_address ("id.full_name");
9948 /* Assuming the inferior just triggered an Ada exception catchpoint
9949 (of any type), return the address in inferior memory where the name
9950 of the exception is stored, if applicable.
9952 Return zero if the address could not be computed, or if not relevant. */
9955 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9956 struct breakpoint
*b
)
9960 case ex_catch_exception
:
9961 return (parse_and_eval_address ("e.full_name"));
9964 case ex_catch_exception_unhandled
:
9965 return exception_info
->unhandled_exception_name_addr ();
9968 case ex_catch_assert
:
9969 return 0; /* Exception name is not relevant in this case. */
9973 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9977 return 0; /* Should never be reached. */
9980 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9981 any error that ada_exception_name_addr_1 might cause to be thrown.
9982 When an error is intercepted, a warning with the error message is printed,
9983 and zero is returned. */
9986 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9987 struct breakpoint
*b
)
9989 struct gdb_exception e
;
9990 CORE_ADDR result
= 0;
9992 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9994 result
= ada_exception_name_addr_1 (ex
, b
);
9999 warning (_("failed to get exception name: %s"), e
.message
);
10006 /* Implement the PRINT_IT method in the breakpoint_ops structure
10007 for all exception catchpoint kinds. */
10009 static enum print_stop_action
10010 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10012 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10013 char exception_name
[256];
10017 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10018 exception_name
[sizeof (exception_name
) - 1] = '\0';
10021 ada_find_printable_frame (get_current_frame ());
10023 annotate_catchpoint (b
->number
);
10026 case ex_catch_exception
:
10028 printf_filtered (_("\nCatchpoint %d, %s at "),
10029 b
->number
, exception_name
);
10031 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10033 case ex_catch_exception_unhandled
:
10035 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10036 b
->number
, exception_name
);
10038 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10041 case ex_catch_assert
:
10042 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10047 return PRINT_SRC_AND_LOC
;
10050 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10051 for all exception catchpoint kinds. */
10054 print_one_exception (enum exception_catchpoint_kind ex
,
10055 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10059 annotate_field (4);
10060 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10063 annotate_field (5);
10064 *last_addr
= b
->loc
->address
;
10067 case ex_catch_exception
:
10068 if (b
->exp_string
!= NULL
)
10070 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10072 ui_out_field_string (uiout
, "what", msg
);
10076 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10080 case ex_catch_exception_unhandled
:
10081 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10084 case ex_catch_assert
:
10085 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10089 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10094 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10095 for all exception catchpoint kinds. */
10098 print_mention_exception (enum exception_catchpoint_kind ex
,
10099 struct breakpoint
*b
)
10103 case ex_catch_exception
:
10104 if (b
->exp_string
!= NULL
)
10105 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10106 b
->number
, b
->exp_string
);
10108 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10112 case ex_catch_exception_unhandled
:
10113 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10117 case ex_catch_assert
:
10118 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10122 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10127 /* Virtual table for "catch exception" breakpoints. */
10129 static enum print_stop_action
10130 print_it_catch_exception (struct breakpoint
*b
)
10132 return print_it_exception (ex_catch_exception
, b
);
10136 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10138 print_one_exception (ex_catch_exception
, b
, last_addr
);
10142 print_mention_catch_exception (struct breakpoint
*b
)
10144 print_mention_exception (ex_catch_exception
, b
);
10147 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10149 print_it_catch_exception
,
10150 print_one_catch_exception
,
10151 print_mention_catch_exception
10154 /* Virtual table for "catch exception unhandled" breakpoints. */
10156 static enum print_stop_action
10157 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10159 return print_it_exception (ex_catch_exception_unhandled
, b
);
10163 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10165 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10169 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10171 print_mention_exception (ex_catch_exception_unhandled
, b
);
10174 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10175 print_it_catch_exception_unhandled
,
10176 print_one_catch_exception_unhandled
,
10177 print_mention_catch_exception_unhandled
10180 /* Virtual table for "catch assert" breakpoints. */
10182 static enum print_stop_action
10183 print_it_catch_assert (struct breakpoint
*b
)
10185 return print_it_exception (ex_catch_assert
, b
);
10189 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10191 print_one_exception (ex_catch_assert
, b
, last_addr
);
10195 print_mention_catch_assert (struct breakpoint
*b
)
10197 print_mention_exception (ex_catch_assert
, b
);
10200 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10201 print_it_catch_assert
,
10202 print_one_catch_assert
,
10203 print_mention_catch_assert
10206 /* Return non-zero if B is an Ada exception catchpoint. */
10209 ada_exception_catchpoint_p (struct breakpoint
*b
)
10211 return (b
->ops
== &catch_exception_breakpoint_ops
10212 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10213 || b
->ops
== &catch_assert_breakpoint_ops
);
10216 /* Return a newly allocated copy of the first space-separated token
10217 in ARGSP, and then adjust ARGSP to point immediately after that
10220 Return NULL if ARGPS does not contain any more tokens. */
10223 ada_get_next_arg (char **argsp
)
10225 char *args
= *argsp
;
10229 /* Skip any leading white space. */
10231 while (isspace (*args
))
10234 if (args
[0] == '\0')
10235 return NULL
; /* No more arguments. */
10237 /* Find the end of the current argument. */
10240 while (*end
!= '\0' && !isspace (*end
))
10243 /* Adjust ARGSP to point to the start of the next argument. */
10247 /* Make a copy of the current argument and return it. */
10249 result
= xmalloc (end
- args
+ 1);
10250 strncpy (result
, args
, end
- args
);
10251 result
[end
- args
] = '\0';
10256 /* Split the arguments specified in a "catch exception" command.
10257 Set EX to the appropriate catchpoint type.
10258 Set EXP_STRING to the name of the specific exception if
10259 specified by the user. */
10262 catch_ada_exception_command_split (char *args
,
10263 enum exception_catchpoint_kind
*ex
,
10266 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10267 char *exception_name
;
10269 exception_name
= ada_get_next_arg (&args
);
10270 make_cleanup (xfree
, exception_name
);
10272 /* Check that we do not have any more arguments. Anything else
10275 while (isspace (*args
))
10278 if (args
[0] != '\0')
10279 error (_("Junk at end of expression"));
10281 discard_cleanups (old_chain
);
10283 if (exception_name
== NULL
)
10285 /* Catch all exceptions. */
10286 *ex
= ex_catch_exception
;
10287 *exp_string
= NULL
;
10289 else if (strcmp (exception_name
, "unhandled") == 0)
10291 /* Catch unhandled exceptions. */
10292 *ex
= ex_catch_exception_unhandled
;
10293 *exp_string
= NULL
;
10297 /* Catch a specific exception. */
10298 *ex
= ex_catch_exception
;
10299 *exp_string
= exception_name
;
10303 /* Return the name of the symbol on which we should break in order to
10304 implement a catchpoint of the EX kind. */
10306 static const char *
10307 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10309 gdb_assert (exception_info
!= NULL
);
10313 case ex_catch_exception
:
10314 return (exception_info
->catch_exception_sym
);
10316 case ex_catch_exception_unhandled
:
10317 return (exception_info
->catch_exception_unhandled_sym
);
10319 case ex_catch_assert
:
10320 return (exception_info
->catch_assert_sym
);
10323 internal_error (__FILE__
, __LINE__
,
10324 _("unexpected catchpoint kind (%d)"), ex
);
10328 /* Return the breakpoint ops "virtual table" used for catchpoints
10331 static struct breakpoint_ops
*
10332 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10336 case ex_catch_exception
:
10337 return (&catch_exception_breakpoint_ops
);
10339 case ex_catch_exception_unhandled
:
10340 return (&catch_exception_unhandled_breakpoint_ops
);
10342 case ex_catch_assert
:
10343 return (&catch_assert_breakpoint_ops
);
10346 internal_error (__FILE__
, __LINE__
,
10347 _("unexpected catchpoint kind (%d)"), ex
);
10351 /* Return the condition that will be used to match the current exception
10352 being raised with the exception that the user wants to catch. This
10353 assumes that this condition is used when the inferior just triggered
10354 an exception catchpoint.
10356 The string returned is a newly allocated string that needs to be
10357 deallocated later. */
10360 ada_exception_catchpoint_cond_string (const char *exp_string
)
10362 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10365 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10367 static struct expression
*
10368 ada_parse_catchpoint_condition (char *cond_string
,
10369 struct symtab_and_line sal
)
10371 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10374 /* Return the symtab_and_line that should be used to insert an exception
10375 catchpoint of the TYPE kind.
10377 EX_STRING should contain the name of a specific exception
10378 that the catchpoint should catch, or NULL otherwise.
10380 The idea behind all the remaining parameters is that their names match
10381 the name of certain fields in the breakpoint structure that are used to
10382 handle exception catchpoints. This function returns the value to which
10383 these fields should be set, depending on the type of catchpoint we need
10386 If COND and COND_STRING are both non-NULL, any value they might
10387 hold will be free'ed, and then replaced by newly allocated ones.
10388 These parameters are left untouched otherwise. */
10390 static struct symtab_and_line
10391 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10392 char **addr_string
, char **cond_string
,
10393 struct expression
**cond
, struct breakpoint_ops
**ops
)
10395 const char *sym_name
;
10396 struct symbol
*sym
;
10397 struct symtab_and_line sal
;
10399 /* First, find out which exception support info to use. */
10400 ada_exception_support_info_sniffer ();
10402 /* Then lookup the function on which we will break in order to catch
10403 the Ada exceptions requested by the user. */
10405 sym_name
= ada_exception_sym_name (ex
);
10406 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10408 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10409 that should be compiled with debugging information. As a result, we
10410 expect to find that symbol in the symtabs. If we don't find it, then
10411 the target most likely does not support Ada exceptions, or we cannot
10412 insert exception breakpoints yet, because the GNAT runtime hasn't been
10415 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10416 in such a way that no debugging information is produced for the symbol
10417 we are looking for. In this case, we could search the minimal symbols
10418 as a fall-back mechanism. This would still be operating in degraded
10419 mode, however, as we would still be missing the debugging information
10420 that is needed in order to extract the name of the exception being
10421 raised (this name is printed in the catchpoint message, and is also
10422 used when trying to catch a specific exception). We do not handle
10423 this case for now. */
10426 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10428 /* Make sure that the symbol we found corresponds to a function. */
10429 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10430 error (_("Symbol \"%s\" is not a function (class = %d)"),
10431 sym_name
, SYMBOL_CLASS (sym
));
10433 sal
= find_function_start_sal (sym
, 1);
10435 /* Set ADDR_STRING. */
10437 *addr_string
= xstrdup (sym_name
);
10439 /* Set the COND and COND_STRING (if not NULL). */
10441 if (cond_string
!= NULL
&& cond
!= NULL
)
10443 if (*cond_string
!= NULL
)
10445 xfree (*cond_string
);
10446 *cond_string
= NULL
;
10453 if (exp_string
!= NULL
)
10455 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10456 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10461 *ops
= ada_exception_breakpoint_ops (ex
);
10466 /* Parse the arguments (ARGS) of the "catch exception" command.
10468 Set TYPE to the appropriate exception catchpoint type.
10469 If the user asked the catchpoint to catch only a specific
10470 exception, then save the exception name in ADDR_STRING.
10472 See ada_exception_sal for a description of all the remaining
10473 function arguments of this function. */
10475 struct symtab_and_line
10476 ada_decode_exception_location (char *args
, char **addr_string
,
10477 char **exp_string
, char **cond_string
,
10478 struct expression
**cond
,
10479 struct breakpoint_ops
**ops
)
10481 enum exception_catchpoint_kind ex
;
10483 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10484 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10488 struct symtab_and_line
10489 ada_decode_assert_location (char *args
, char **addr_string
,
10490 struct breakpoint_ops
**ops
)
10492 /* Check that no argument where provided at the end of the command. */
10496 while (isspace (*args
))
10499 error (_("Junk at end of arguments."));
10502 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10507 /* Information about operators given special treatment in functions
10509 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10511 #define ADA_OPERATORS \
10512 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10513 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10514 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10515 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10516 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10517 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10518 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10519 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10520 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10521 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10522 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10523 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10524 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10525 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10526 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10527 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10528 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10529 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10530 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10533 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10535 switch (exp
->elts
[pc
- 1].opcode
)
10538 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10541 #define OP_DEFN(op, len, args, binop) \
10542 case op: *oplenp = len; *argsp = args; break;
10548 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10553 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10559 ada_op_name (enum exp_opcode opcode
)
10564 return op_name_standard (opcode
);
10566 #define OP_DEFN(op, len, args, binop) case op: return #op;
10571 return "OP_AGGREGATE";
10573 return "OP_CHOICES";
10579 /* As for operator_length, but assumes PC is pointing at the first
10580 element of the operator, and gives meaningful results only for the
10581 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10584 ada_forward_operator_length (struct expression
*exp
, int pc
,
10585 int *oplenp
, int *argsp
)
10587 switch (exp
->elts
[pc
].opcode
)
10590 *oplenp
= *argsp
= 0;
10593 #define OP_DEFN(op, len, args, binop) \
10594 case op: *oplenp = len; *argsp = args; break;
10600 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10605 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10611 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10612 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10620 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10622 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10627 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10631 /* Ada attributes ('Foo). */
10634 case OP_ATR_LENGTH
:
10638 case OP_ATR_MODULUS
:
10645 case UNOP_IN_RANGE
:
10647 /* XXX: gdb_sprint_host_address, type_sprint */
10648 fprintf_filtered (stream
, _("Type @"));
10649 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10650 fprintf_filtered (stream
, " (");
10651 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10652 fprintf_filtered (stream
, ")");
10654 case BINOP_IN_BOUNDS
:
10655 fprintf_filtered (stream
, " (%d)",
10656 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10658 case TERNOP_IN_RANGE
:
10663 case OP_DISCRETE_RANGE
:
10664 case OP_POSITIONAL
:
10671 char *name
= &exp
->elts
[elt
+ 2].string
;
10672 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10673 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10678 return dump_subexp_body_standard (exp
, stream
, elt
);
10682 for (i
= 0; i
< nargs
; i
+= 1)
10683 elt
= dump_subexp (exp
, stream
, elt
);
10688 /* The Ada extension of print_subexp (q.v.). */
10691 ada_print_subexp (struct expression
*exp
, int *pos
,
10692 struct ui_file
*stream
, enum precedence prec
)
10694 int oplen
, nargs
, i
;
10696 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10698 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10705 print_subexp_standard (exp
, pos
, stream
, prec
);
10709 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10712 case BINOP_IN_BOUNDS
:
10713 /* XXX: sprint_subexp */
10714 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10715 fputs_filtered (" in ", stream
);
10716 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10717 fputs_filtered ("'range", stream
);
10718 if (exp
->elts
[pc
+ 1].longconst
> 1)
10719 fprintf_filtered (stream
, "(%ld)",
10720 (long) exp
->elts
[pc
+ 1].longconst
);
10723 case TERNOP_IN_RANGE
:
10724 if (prec
>= PREC_EQUAL
)
10725 fputs_filtered ("(", stream
);
10726 /* XXX: sprint_subexp */
10727 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10728 fputs_filtered (" in ", stream
);
10729 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10730 fputs_filtered (" .. ", stream
);
10731 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10732 if (prec
>= PREC_EQUAL
)
10733 fputs_filtered (")", stream
);
10738 case OP_ATR_LENGTH
:
10742 case OP_ATR_MODULUS
:
10747 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10749 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10750 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10754 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10755 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10759 for (tem
= 1; tem
< nargs
; tem
+= 1)
10761 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10762 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10764 fputs_filtered (")", stream
);
10769 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10770 fputs_filtered ("'(", stream
);
10771 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10772 fputs_filtered (")", stream
);
10775 case UNOP_IN_RANGE
:
10776 /* XXX: sprint_subexp */
10777 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10778 fputs_filtered (" in ", stream
);
10779 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10782 case OP_DISCRETE_RANGE
:
10783 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10784 fputs_filtered ("..", stream
);
10785 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10789 fputs_filtered ("others => ", stream
);
10790 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10794 for (i
= 0; i
< nargs
-1; i
+= 1)
10797 fputs_filtered ("|", stream
);
10798 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10800 fputs_filtered (" => ", stream
);
10801 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10804 case OP_POSITIONAL
:
10805 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10809 fputs_filtered ("(", stream
);
10810 for (i
= 0; i
< nargs
; i
+= 1)
10813 fputs_filtered (", ", stream
);
10814 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10816 fputs_filtered (")", stream
);
10821 /* Table mapping opcodes into strings for printing operators
10822 and precedences of the operators. */
10824 static const struct op_print ada_op_print_tab
[] = {
10825 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10826 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10827 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10828 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10829 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10830 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10831 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10832 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10833 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10834 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10835 {">", BINOP_GTR
, PREC_ORDER
, 0},
10836 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10837 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10838 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10839 {"+", BINOP_ADD
, PREC_ADD
, 0},
10840 {"-", BINOP_SUB
, PREC_ADD
, 0},
10841 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10842 {"*", BINOP_MUL
, PREC_MUL
, 0},
10843 {"/", BINOP_DIV
, PREC_MUL
, 0},
10844 {"rem", BINOP_REM
, PREC_MUL
, 0},
10845 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10846 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10847 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10848 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10849 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10850 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10851 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10852 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10853 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10854 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10855 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10859 enum ada_primitive_types
{
10860 ada_primitive_type_int
,
10861 ada_primitive_type_long
,
10862 ada_primitive_type_short
,
10863 ada_primitive_type_char
,
10864 ada_primitive_type_float
,
10865 ada_primitive_type_double
,
10866 ada_primitive_type_void
,
10867 ada_primitive_type_long_long
,
10868 ada_primitive_type_long_double
,
10869 ada_primitive_type_natural
,
10870 ada_primitive_type_positive
,
10871 ada_primitive_type_system_address
,
10872 nr_ada_primitive_types
10876 ada_language_arch_info (struct gdbarch
*gdbarch
,
10877 struct language_arch_info
*lai
)
10879 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10880 lai
->primitive_type_vector
10881 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10883 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10884 init_type (TYPE_CODE_INT
,
10885 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10886 0, "integer", (struct objfile
*) NULL
);
10887 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10888 init_type (TYPE_CODE_INT
,
10889 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10890 0, "long_integer", (struct objfile
*) NULL
);
10891 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10892 init_type (TYPE_CODE_INT
,
10893 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10894 0, "short_integer", (struct objfile
*) NULL
);
10895 lai
->string_char_type
=
10896 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10897 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10898 0, "character", (struct objfile
*) NULL
);
10899 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10900 init_type (TYPE_CODE_FLT
,
10901 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10902 0, "float", (struct objfile
*) NULL
);
10903 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10904 init_type (TYPE_CODE_FLT
,
10905 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10906 0, "long_float", (struct objfile
*) NULL
);
10907 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10908 init_type (TYPE_CODE_INT
,
10909 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10910 0, "long_long_integer", (struct objfile
*) NULL
);
10911 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10912 init_type (TYPE_CODE_FLT
,
10913 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10914 0, "long_long_float", (struct objfile
*) NULL
);
10915 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10916 init_type (TYPE_CODE_INT
,
10917 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10918 0, "natural", (struct objfile
*) NULL
);
10919 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10920 init_type (TYPE_CODE_INT
,
10921 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10922 0, "positive", (struct objfile
*) NULL
);
10923 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10925 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10926 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10927 (struct objfile
*) NULL
));
10928 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10929 = "system__address";
10932 /* Language vector */
10934 /* Not really used, but needed in the ada_language_defn. */
10937 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10939 ada_emit_char (c
, stream
, quoter
, 1);
10945 warnings_issued
= 0;
10946 return ada_parse ();
10949 static const struct exp_descriptor ada_exp_descriptor
= {
10951 ada_operator_length
,
10953 ada_dump_subexp_body
,
10954 ada_evaluate_subexp
10957 const struct language_defn ada_language_defn
= {
10958 "ada", /* Language name */
10962 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10963 that's not quite what this means. */
10965 &ada_exp_descriptor
,
10969 ada_printchar
, /* Print a character constant */
10970 ada_printstr
, /* Function to print string constant */
10971 emit_char
, /* Function to print single char (not used) */
10972 ada_print_type
, /* Print a type using appropriate syntax */
10973 ada_val_print
, /* Print a value using appropriate syntax */
10974 ada_value_print
, /* Print a top-level value */
10975 NULL
, /* Language specific skip_trampoline */
10976 NULL
, /* name_of_this */
10977 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10978 basic_lookup_transparent_type
, /* lookup_transparent_type */
10979 ada_la_decode
, /* Language specific symbol demangler */
10980 NULL
, /* Language specific class_name_from_physname */
10981 ada_op_print_tab
, /* expression operators for printing */
10982 0, /* c-style arrays */
10983 1, /* String lower bound */
10984 ada_get_gdb_completer_word_break_characters
,
10985 ada_make_symbol_completion_list
,
10986 ada_language_arch_info
,
10987 ada_print_array_index
,
10988 default_pass_by_reference
,
10993 _initialize_ada_language (void)
10995 add_language (&ada_language_defn
);
10997 varsize_limit
= 65536;
10999 obstack_init (&symbol_list_obstack
);
11001 decoded_names_store
= htab_create_alloc
11002 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11003 NULL
, xcalloc
, xfree
);
11005 observer_attach_executable_changed (ada_executable_changed_observer
);