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_COMPUTED_ARG
:
2903 if (j
< n_candidates
)
2906 while (j
< n_candidates
)
2908 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2910 candidates
[j
] = candidates
[n_candidates
- 1];
2919 if (n_candidates
== 0)
2920 error (_("No definition found for %s"),
2921 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2922 else if (n_candidates
== 1)
2924 else if (deprocedure_p
2925 && !is_nonfunction (candidates
, n_candidates
))
2927 i
= ada_resolve_function
2928 (candidates
, n_candidates
, NULL
, 0,
2929 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2932 error (_("Could not find a match for %s"),
2933 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2937 printf_filtered (_("Multiple matches for %s\n"),
2938 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2939 user_select_syms (candidates
, n_candidates
, 1);
2943 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2944 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2945 if (innermost_block
== NULL
2946 || contained_in (candidates
[i
].block
, innermost_block
))
2947 innermost_block
= candidates
[i
].block
;
2951 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2954 replace_operator_with_call (expp
, pc
, 0, 0,
2955 exp
->elts
[pc
+ 2].symbol
,
2956 exp
->elts
[pc
+ 1].block
);
2963 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2964 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2966 struct ada_symbol_info
*candidates
;
2970 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2971 (exp
->elts
[pc
+ 5].symbol
),
2972 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2974 if (n_candidates
== 1)
2978 i
= ada_resolve_function
2979 (candidates
, n_candidates
,
2981 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2984 error (_("Could not find a match for %s"),
2985 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2988 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2989 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2990 if (innermost_block
== NULL
2991 || contained_in (candidates
[i
].block
, innermost_block
))
2992 innermost_block
= candidates
[i
].block
;
3003 case BINOP_BITWISE_AND
:
3004 case BINOP_BITWISE_IOR
:
3005 case BINOP_BITWISE_XOR
:
3007 case BINOP_NOTEQUAL
:
3015 case UNOP_LOGICAL_NOT
:
3017 if (possible_user_operator_p (op
, argvec
))
3019 struct ada_symbol_info
*candidates
;
3023 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
3024 (struct block
*) NULL
, VAR_DOMAIN
,
3026 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
3027 ada_decoded_op_name (op
), NULL
);
3031 replace_operator_with_call (expp
, pc
, nargs
, 1,
3032 candidates
[i
].sym
, candidates
[i
].block
);
3043 return evaluate_subexp_type (exp
, pos
);
3046 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3047 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3048 a non-pointer. A type of 'void' (which is never a valid expression type)
3049 by convention matches anything. */
3050 /* The term "match" here is rather loose. The match is heuristic and
3051 liberal. FIXME: TOO liberal, in fact. */
3054 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3056 ftype
= ada_check_typedef (ftype
);
3057 atype
= ada_check_typedef (atype
);
3059 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3060 ftype
= TYPE_TARGET_TYPE (ftype
);
3061 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3062 atype
= TYPE_TARGET_TYPE (atype
);
3064 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3065 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3068 switch (TYPE_CODE (ftype
))
3073 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3074 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3075 TYPE_TARGET_TYPE (atype
), 0);
3078 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3080 case TYPE_CODE_ENUM
:
3081 case TYPE_CODE_RANGE
:
3082 switch (TYPE_CODE (atype
))
3085 case TYPE_CODE_ENUM
:
3086 case TYPE_CODE_RANGE
:
3092 case TYPE_CODE_ARRAY
:
3093 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3094 || ada_is_array_descriptor_type (atype
));
3096 case TYPE_CODE_STRUCT
:
3097 if (ada_is_array_descriptor_type (ftype
))
3098 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3099 || ada_is_array_descriptor_type (atype
));
3101 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3102 && !ada_is_array_descriptor_type (atype
));
3104 case TYPE_CODE_UNION
:
3106 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3110 /* Return non-zero if the formals of FUNC "sufficiently match" the
3111 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3112 may also be an enumeral, in which case it is treated as a 0-
3113 argument function. */
3116 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3119 struct type
*func_type
= SYMBOL_TYPE (func
);
3121 if (SYMBOL_CLASS (func
) == LOC_CONST
3122 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3123 return (n_actuals
== 0);
3124 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3127 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3130 for (i
= 0; i
< n_actuals
; i
+= 1)
3132 if (actuals
[i
] == NULL
)
3136 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3137 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3139 if (!ada_type_match (ftype
, atype
, 1))
3146 /* False iff function type FUNC_TYPE definitely does not produce a value
3147 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3148 FUNC_TYPE is not a valid function type with a non-null return type
3149 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3152 return_match (struct type
*func_type
, struct type
*context_type
)
3154 struct type
*return_type
;
3156 if (func_type
== NULL
)
3159 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3160 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3162 return_type
= base_type (func_type
);
3163 if (return_type
== NULL
)
3166 context_type
= base_type (context_type
);
3168 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3169 return context_type
== NULL
|| return_type
== context_type
;
3170 else if (context_type
== NULL
)
3171 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3173 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3177 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3178 function (if any) that matches the types of the NARGS arguments in
3179 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3180 that returns that type, then eliminate matches that don't. If
3181 CONTEXT_TYPE is void and there is at least one match that does not
3182 return void, eliminate all matches that do.
3184 Asks the user if there is more than one match remaining. Returns -1
3185 if there is no such symbol or none is selected. NAME is used
3186 solely for messages. May re-arrange and modify SYMS in
3187 the process; the index returned is for the modified vector. */
3190 ada_resolve_function (struct ada_symbol_info syms
[],
3191 int nsyms
, struct value
**args
, int nargs
,
3192 const char *name
, struct type
*context_type
)
3195 int m
; /* Number of hits */
3196 struct type
*fallback
;
3197 struct type
*return_type
;
3199 return_type
= context_type
;
3200 if (context_type
== NULL
)
3201 fallback
= builtin_type_void
;
3208 for (k
= 0; k
< nsyms
; k
+= 1)
3210 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3212 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3213 && return_match (type
, return_type
))
3219 if (m
> 0 || return_type
== fallback
)
3222 return_type
= fallback
;
3229 printf_filtered (_("Multiple matches for %s\n"), name
);
3230 user_select_syms (syms
, m
, 1);
3236 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3237 in a listing of choices during disambiguation (see sort_choices, below).
3238 The idea is that overloadings of a subprogram name from the
3239 same package should sort in their source order. We settle for ordering
3240 such symbols by their trailing number (__N or $N). */
3243 encoded_ordered_before (char *N0
, char *N1
)
3247 else if (N0
== NULL
)
3252 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3254 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3256 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3257 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3261 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3264 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3266 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3267 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3269 return (strcmp (N0
, N1
) < 0);
3273 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3277 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3280 for (i
= 1; i
< nsyms
; i
+= 1)
3282 struct ada_symbol_info sym
= syms
[i
];
3285 for (j
= i
- 1; j
>= 0; j
-= 1)
3287 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3288 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3290 syms
[j
+ 1] = syms
[j
];
3296 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3297 by asking the user (if necessary), returning the number selected,
3298 and setting the first elements of SYMS items. Error if no symbols
3301 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3302 to be re-integrated one of these days. */
3305 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3308 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3310 int first_choice
= (max_results
== 1) ? 1 : 2;
3311 const char *select_mode
= multiple_symbols_select_mode ();
3313 if (max_results
< 1)
3314 error (_("Request to select 0 symbols!"));
3318 if (select_mode
== multiple_symbols_cancel
)
3320 canceled because the command is ambiguous\n\
3321 See set/show multiple-symbol."));
3323 /* If select_mode is "all", then return all possible symbols.
3324 Only do that if more than one symbol can be selected, of course.
3325 Otherwise, display the menu as usual. */
3326 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3329 printf_unfiltered (_("[0] cancel\n"));
3330 if (max_results
> 1)
3331 printf_unfiltered (_("[1] all\n"));
3333 sort_choices (syms
, nsyms
);
3335 for (i
= 0; i
< nsyms
; i
+= 1)
3337 if (syms
[i
].sym
== NULL
)
3340 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3342 struct symtab_and_line sal
=
3343 find_function_start_sal (syms
[i
].sym
, 1);
3344 if (sal
.symtab
== NULL
)
3345 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3347 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3350 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3351 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3352 sal
.symtab
->filename
, sal
.line
);
3358 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3359 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3360 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3361 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3363 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3364 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3366 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3367 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3368 else if (is_enumeral
3369 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3371 printf_unfiltered (("[%d] "), i
+ first_choice
);
3372 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3374 printf_unfiltered (_("'(%s) (enumeral)\n"),
3375 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3377 else if (symtab
!= NULL
)
3378 printf_unfiltered (is_enumeral
3379 ? _("[%d] %s in %s (enumeral)\n")
3380 : _("[%d] %s at %s:?\n"),
3382 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3385 printf_unfiltered (is_enumeral
3386 ? _("[%d] %s (enumeral)\n")
3387 : _("[%d] %s at ?\n"),
3389 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3393 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3396 for (i
= 0; i
< n_chosen
; i
+= 1)
3397 syms
[i
] = syms
[chosen
[i
]];
3402 /* Read and validate a set of numeric choices from the user in the
3403 range 0 .. N_CHOICES-1. Place the results in increasing
3404 order in CHOICES[0 .. N-1], and return N.
3406 The user types choices as a sequence of numbers on one line
3407 separated by blanks, encoding them as follows:
3409 + A choice of 0 means to cancel the selection, throwing an error.
3410 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3411 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3413 The user is not allowed to choose more than MAX_RESULTS values.
3415 ANNOTATION_SUFFIX, if present, is used to annotate the input
3416 prompts (for use with the -f switch). */
3419 get_selections (int *choices
, int n_choices
, int max_results
,
3420 int is_all_choice
, char *annotation_suffix
)
3425 int first_choice
= is_all_choice
? 2 : 1;
3427 prompt
= getenv ("PS2");
3431 args
= command_line_input (prompt
, 0, annotation_suffix
);
3434 error_no_arg (_("one or more choice numbers"));
3438 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3439 order, as given in args. Choices are validated. */
3445 while (isspace (*args
))
3447 if (*args
== '\0' && n_chosen
== 0)
3448 error_no_arg (_("one or more choice numbers"));
3449 else if (*args
== '\0')
3452 choice
= strtol (args
, &args2
, 10);
3453 if (args
== args2
|| choice
< 0
3454 || choice
> n_choices
+ first_choice
- 1)
3455 error (_("Argument must be choice number"));
3459 error (_("cancelled"));
3461 if (choice
< first_choice
)
3463 n_chosen
= n_choices
;
3464 for (j
= 0; j
< n_choices
; j
+= 1)
3468 choice
-= first_choice
;
3470 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3474 if (j
< 0 || choice
!= choices
[j
])
3477 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3478 choices
[k
+ 1] = choices
[k
];
3479 choices
[j
+ 1] = choice
;
3484 if (n_chosen
> max_results
)
3485 error (_("Select no more than %d of the above"), max_results
);
3490 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3491 on the function identified by SYM and BLOCK, and taking NARGS
3492 arguments. Update *EXPP as needed to hold more space. */
3495 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3496 int oplen
, struct symbol
*sym
,
3497 struct block
*block
)
3499 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3500 symbol, -oplen for operator being replaced). */
3501 struct expression
*newexp
= (struct expression
*)
3502 xmalloc (sizeof (struct expression
)
3503 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3504 struct expression
*exp
= *expp
;
3506 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3507 newexp
->language_defn
= exp
->language_defn
;
3508 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3509 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3510 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3512 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3513 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3515 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3516 newexp
->elts
[pc
+ 4].block
= block
;
3517 newexp
->elts
[pc
+ 5].symbol
= sym
;
3523 /* Type-class predicates */
3525 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3529 numeric_type_p (struct type
*type
)
3535 switch (TYPE_CODE (type
))
3540 case TYPE_CODE_RANGE
:
3541 return (type
== TYPE_TARGET_TYPE (type
)
3542 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3549 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3552 integer_type_p (struct type
*type
)
3558 switch (TYPE_CODE (type
))
3562 case TYPE_CODE_RANGE
:
3563 return (type
== TYPE_TARGET_TYPE (type
)
3564 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3571 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3574 scalar_type_p (struct type
*type
)
3580 switch (TYPE_CODE (type
))
3583 case TYPE_CODE_RANGE
:
3584 case TYPE_CODE_ENUM
:
3593 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3596 discrete_type_p (struct type
*type
)
3602 switch (TYPE_CODE (type
))
3605 case TYPE_CODE_RANGE
:
3606 case TYPE_CODE_ENUM
:
3614 /* Returns non-zero if OP with operands in the vector ARGS could be
3615 a user-defined function. Errs on the side of pre-defined operators
3616 (i.e., result 0). */
3619 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3621 struct type
*type0
=
3622 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3623 struct type
*type1
=
3624 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3638 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3642 case BINOP_BITWISE_AND
:
3643 case BINOP_BITWISE_IOR
:
3644 case BINOP_BITWISE_XOR
:
3645 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3648 case BINOP_NOTEQUAL
:
3653 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3656 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3659 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3663 case UNOP_LOGICAL_NOT
:
3665 return (!numeric_type_p (type0
));
3674 1. In the following, we assume that a renaming type's name may
3675 have an ___XD suffix. It would be nice if this went away at some
3677 2. We handle both the (old) purely type-based representation of
3678 renamings and the (new) variable-based encoding. At some point,
3679 it is devoutly to be hoped that the former goes away
3680 (FIXME: hilfinger-2007-07-09).
3681 3. Subprogram renamings are not implemented, although the XRS
3682 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3684 /* If SYM encodes a renaming,
3686 <renaming> renames <renamed entity>,
3688 sets *LEN to the length of the renamed entity's name,
3689 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3690 the string describing the subcomponent selected from the renamed
3691 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3692 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3693 are undefined). Otherwise, returns a value indicating the category
3694 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3695 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3696 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3697 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3698 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3699 may be NULL, in which case they are not assigned.
3701 [Currently, however, GCC does not generate subprogram renamings.] */
3703 enum ada_renaming_category
3704 ada_parse_renaming (struct symbol
*sym
,
3705 const char **renamed_entity
, int *len
,
3706 const char **renaming_expr
)
3708 enum ada_renaming_category kind
;
3713 return ADA_NOT_RENAMING
;
3714 switch (SYMBOL_CLASS (sym
))
3717 return ADA_NOT_RENAMING
;
3719 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3720 renamed_entity
, len
, renaming_expr
);
3724 case LOC_OPTIMIZED_OUT
:
3725 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3727 return ADA_NOT_RENAMING
;
3731 kind
= ADA_OBJECT_RENAMING
;
3735 kind
= ADA_EXCEPTION_RENAMING
;
3739 kind
= ADA_PACKAGE_RENAMING
;
3743 kind
= ADA_SUBPROGRAM_RENAMING
;
3747 return ADA_NOT_RENAMING
;
3751 if (renamed_entity
!= NULL
)
3752 *renamed_entity
= info
;
3753 suffix
= strstr (info
, "___XE");
3754 if (suffix
== NULL
|| suffix
== info
)
3755 return ADA_NOT_RENAMING
;
3757 *len
= strlen (info
) - strlen (suffix
);
3759 if (renaming_expr
!= NULL
)
3760 *renaming_expr
= suffix
;
3764 /* Assuming TYPE encodes a renaming according to the old encoding in
3765 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3766 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3767 ADA_NOT_RENAMING otherwise. */
3768 static enum ada_renaming_category
3769 parse_old_style_renaming (struct type
*type
,
3770 const char **renamed_entity
, int *len
,
3771 const char **renaming_expr
)
3773 enum ada_renaming_category kind
;
3778 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3779 || TYPE_NFIELDS (type
) != 1)
3780 return ADA_NOT_RENAMING
;
3782 name
= type_name_no_tag (type
);
3784 return ADA_NOT_RENAMING
;
3786 name
= strstr (name
, "___XR");
3788 return ADA_NOT_RENAMING
;
3793 kind
= ADA_OBJECT_RENAMING
;
3796 kind
= ADA_EXCEPTION_RENAMING
;
3799 kind
= ADA_PACKAGE_RENAMING
;
3802 kind
= ADA_SUBPROGRAM_RENAMING
;
3805 return ADA_NOT_RENAMING
;
3808 info
= TYPE_FIELD_NAME (type
, 0);
3810 return ADA_NOT_RENAMING
;
3811 if (renamed_entity
!= NULL
)
3812 *renamed_entity
= info
;
3813 suffix
= strstr (info
, "___XE");
3814 if (renaming_expr
!= NULL
)
3815 *renaming_expr
= suffix
+ 5;
3816 if (suffix
== NULL
|| suffix
== info
)
3817 return ADA_NOT_RENAMING
;
3819 *len
= suffix
- info
;
3825 /* Evaluation: Function Calls */
3827 /* Return an lvalue containing the value VAL. This is the identity on
3828 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3829 on the stack, using and updating *SP as the stack pointer, and
3830 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3832 static struct value
*
3833 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3835 if (! VALUE_LVAL (val
))
3837 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3839 /* The following is taken from the structure-return code in
3840 call_function_by_hand. FIXME: Therefore, some refactoring seems
3842 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3844 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3845 reserving sufficient space. */
3847 if (gdbarch_frame_align_p (current_gdbarch
))
3848 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3849 VALUE_ADDRESS (val
) = *sp
;
3853 /* Stack grows upward. Align the frame, allocate space, and
3854 then again, re-align the frame. */
3855 if (gdbarch_frame_align_p (current_gdbarch
))
3856 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3857 VALUE_ADDRESS (val
) = *sp
;
3859 if (gdbarch_frame_align_p (current_gdbarch
))
3860 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3862 VALUE_LVAL (val
) = lval_memory
;
3864 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3870 /* Return the value ACTUAL, converted to be an appropriate value for a
3871 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3872 allocating any necessary descriptors (fat pointers), or copies of
3873 values not residing in memory, updating it as needed. */
3876 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3879 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3880 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3881 struct type
*formal_target
=
3882 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3883 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3884 struct type
*actual_target
=
3885 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3886 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3888 if (ada_is_array_descriptor_type (formal_target
)
3889 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3890 return make_array_descriptor (formal_type
, actual
, sp
);
3891 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3892 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3894 struct value
*result
;
3895 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3896 && ada_is_array_descriptor_type (actual_target
))
3897 result
= desc_data (actual
);
3898 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3900 if (VALUE_LVAL (actual
) != lval_memory
)
3903 actual_type
= ada_check_typedef (value_type (actual
));
3904 val
= allocate_value (actual_type
);
3905 memcpy ((char *) value_contents_raw (val
),
3906 (char *) value_contents (actual
),
3907 TYPE_LENGTH (actual_type
));
3908 actual
= ensure_lval (val
, sp
);
3910 result
= value_addr (actual
);
3914 return value_cast_pointers (formal_type
, result
);
3916 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3917 return ada_value_ind (actual
);
3923 /* Push a descriptor of type TYPE for array value ARR on the stack at
3924 *SP, updating *SP to reflect the new descriptor. Return either
3925 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3926 to-descriptor type rather than a descriptor type), a struct value *
3927 representing a pointer to this descriptor. */
3929 static struct value
*
3930 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3932 struct type
*bounds_type
= desc_bounds_type (type
);
3933 struct type
*desc_type
= desc_base_type (type
);
3934 struct value
*descriptor
= allocate_value (desc_type
);
3935 struct value
*bounds
= allocate_value (bounds_type
);
3938 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3940 modify_general_field (value_contents_writeable (bounds
),
3941 value_as_long (ada_array_bound (arr
, i
, 0)),
3942 desc_bound_bitpos (bounds_type
, i
, 0),
3943 desc_bound_bitsize (bounds_type
, i
, 0));
3944 modify_general_field (value_contents_writeable (bounds
),
3945 value_as_long (ada_array_bound (arr
, i
, 1)),
3946 desc_bound_bitpos (bounds_type
, i
, 1),
3947 desc_bound_bitsize (bounds_type
, i
, 1));
3950 bounds
= ensure_lval (bounds
, sp
);
3952 modify_general_field (value_contents_writeable (descriptor
),
3953 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3954 fat_pntr_data_bitpos (desc_type
),
3955 fat_pntr_data_bitsize (desc_type
));
3957 modify_general_field (value_contents_writeable (descriptor
),
3958 VALUE_ADDRESS (bounds
),
3959 fat_pntr_bounds_bitpos (desc_type
),
3960 fat_pntr_bounds_bitsize (desc_type
));
3962 descriptor
= ensure_lval (descriptor
, sp
);
3964 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3965 return value_addr (descriptor
);
3970 /* Dummy definitions for an experimental caching module that is not
3971 * used in the public sources. */
3974 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3975 struct symbol
**sym
, struct block
**block
)
3981 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3982 struct block
*block
)
3988 /* Return the result of a standard (literal, C-like) lookup of NAME in
3989 given DOMAIN, visible from lexical block BLOCK. */
3991 static struct symbol
*
3992 standard_lookup (const char *name
, const struct block
*block
,
3997 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3999 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
4000 cache_symbol (name
, domain
, sym
, block_found
);
4005 /* Non-zero iff there is at least one non-function/non-enumeral symbol
4006 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
4007 since they contend in overloading in the same way. */
4009 is_nonfunction (struct ada_symbol_info syms
[], int n
)
4013 for (i
= 0; i
< n
; i
+= 1)
4014 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
4015 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
4016 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
4022 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
4023 struct types. Otherwise, they may not. */
4026 equiv_types (struct type
*type0
, struct type
*type1
)
4030 if (type0
== NULL
|| type1
== NULL
4031 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4033 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4034 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4035 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4036 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4042 /* True iff SYM0 represents the same entity as SYM1, or one that is
4043 no more defined than that of SYM1. */
4046 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4050 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4051 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4054 switch (SYMBOL_CLASS (sym0
))
4060 struct type
*type0
= SYMBOL_TYPE (sym0
);
4061 struct type
*type1
= SYMBOL_TYPE (sym1
);
4062 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4063 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4064 int len0
= strlen (name0
);
4066 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4067 && (equiv_types (type0
, type1
)
4068 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4069 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4072 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4073 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4079 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4080 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4083 add_defn_to_vec (struct obstack
*obstackp
,
4085 struct block
*block
)
4089 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4091 /* Do not try to complete stub types, as the debugger is probably
4092 already scanning all symbols matching a certain name at the
4093 time when this function is called. Trying to replace the stub
4094 type by its associated full type will cause us to restart a scan
4095 which may lead to an infinite recursion. Instead, the client
4096 collecting the matching symbols will end up collecting several
4097 matches, with at least one of them complete. It can then filter
4098 out the stub ones if needed. */
4100 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4102 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4104 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4106 prevDefns
[i
].sym
= sym
;
4107 prevDefns
[i
].block
= block
;
4113 struct ada_symbol_info info
;
4117 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4121 /* Number of ada_symbol_info structures currently collected in
4122 current vector in *OBSTACKP. */
4125 num_defns_collected (struct obstack
*obstackp
)
4127 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4130 /* Vector of ada_symbol_info structures currently collected in current
4131 vector in *OBSTACKP. If FINISH, close off the vector and return
4132 its final address. */
4134 static struct ada_symbol_info
*
4135 defns_collected (struct obstack
*obstackp
, int finish
)
4138 return obstack_finish (obstackp
);
4140 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4143 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4144 Check the global symbols if GLOBAL, the static symbols if not.
4145 Do wild-card match if WILD. */
4147 static struct partial_symbol
*
4148 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4149 int global
, domain_enum
namespace, int wild
)
4151 struct partial_symbol
**start
;
4152 int name_len
= strlen (name
);
4153 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4162 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4163 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4167 for (i
= 0; i
< length
; i
+= 1)
4169 struct partial_symbol
*psym
= start
[i
];
4171 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4172 SYMBOL_DOMAIN (psym
), namespace)
4173 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4187 int M
= (U
+ i
) >> 1;
4188 struct partial_symbol
*psym
= start
[M
];
4189 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4191 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4193 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4204 struct partial_symbol
*psym
= start
[i
];
4206 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4207 SYMBOL_DOMAIN (psym
), namespace))
4209 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4217 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4231 int M
= (U
+ i
) >> 1;
4232 struct partial_symbol
*psym
= start
[M
];
4233 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4235 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4237 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4248 struct partial_symbol
*psym
= start
[i
];
4250 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4251 SYMBOL_DOMAIN (psym
), namespace))
4255 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4258 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4260 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4270 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4280 /* Find a symbol table containing symbol SYM or NULL if none. */
4282 static struct symtab
*
4283 symtab_for_sym (struct symbol
*sym
)
4286 struct objfile
*objfile
;
4288 struct symbol
*tmp_sym
;
4289 struct dict_iterator iter
;
4292 ALL_PRIMARY_SYMTABS (objfile
, s
)
4294 switch (SYMBOL_CLASS (sym
))
4302 case LOC_CONST_BYTES
:
4303 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4304 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4306 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4307 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4313 switch (SYMBOL_CLASS (sym
))
4319 case LOC_REGPARM_ADDR
:
4323 case LOC_COMPUTED_ARG
:
4324 for (j
= FIRST_LOCAL_BLOCK
;
4325 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4327 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4328 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4339 /* Return a minimal symbol matching NAME according to Ada decoding
4340 rules. Returns NULL if there is no such minimal symbol. Names
4341 prefixed with "standard__" are handled specially: "standard__" is
4342 first stripped off, and only static and global symbols are searched. */
4344 struct minimal_symbol
*
4345 ada_lookup_simple_minsym (const char *name
)
4347 struct objfile
*objfile
;
4348 struct minimal_symbol
*msymbol
;
4351 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4353 name
+= sizeof ("standard__") - 1;
4357 wild_match
= (strstr (name
, "__") == NULL
);
4359 ALL_MSYMBOLS (objfile
, msymbol
)
4361 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4362 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4369 /* For all subprograms that statically enclose the subprogram of the
4370 selected frame, add symbols matching identifier NAME in DOMAIN
4371 and their blocks to the list of data in OBSTACKP, as for
4372 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4376 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4377 const char *name
, domain_enum
namespace,
4382 /* True if TYPE is definitely an artificial type supplied to a symbol
4383 for which no debugging information was given in the symbol file. */
4386 is_nondebugging_type (struct type
*type
)
4388 char *name
= ada_type_name (type
);
4389 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4392 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4393 duplicate other symbols in the list (The only case I know of where
4394 this happens is when object files containing stabs-in-ecoff are
4395 linked with files containing ordinary ecoff debugging symbols (or no
4396 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4397 Returns the number of items in the modified list. */
4400 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4407 if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4408 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4409 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4411 for (j
= 0; j
< nsyms
; j
+= 1)
4414 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4415 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4416 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4417 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4418 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4419 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4422 for (k
= i
+ 1; k
< nsyms
; k
+= 1)
4423 syms
[k
- 1] = syms
[k
];
4436 /* Given a type that corresponds to a renaming entity, use the type name
4437 to extract the scope (package name or function name, fully qualified,
4438 and following the GNAT encoding convention) where this renaming has been
4439 defined. The string returned needs to be deallocated after use. */
4442 xget_renaming_scope (struct type
*renaming_type
)
4444 /* The renaming types adhere to the following convention:
4445 <scope>__<rename>___<XR extension>.
4446 So, to extract the scope, we search for the "___XR" extension,
4447 and then backtrack until we find the first "__". */
4449 const char *name
= type_name_no_tag (renaming_type
);
4450 char *suffix
= strstr (name
, "___XR");
4455 /* Now, backtrack a bit until we find the first "__". Start looking
4456 at suffix - 3, as the <rename> part is at least one character long. */
4458 for (last
= suffix
- 3; last
> name
; last
--)
4459 if (last
[0] == '_' && last
[1] == '_')
4462 /* Make a copy of scope and return it. */
4464 scope_len
= last
- name
;
4465 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4467 strncpy (scope
, name
, scope_len
);
4468 scope
[scope_len
] = '\0';
4473 /* Return nonzero if NAME corresponds to a package name. */
4476 is_package_name (const char *name
)
4478 /* Here, We take advantage of the fact that no symbols are generated
4479 for packages, while symbols are generated for each function.
4480 So the condition for NAME represent a package becomes equivalent
4481 to NAME not existing in our list of symbols. There is only one
4482 small complication with library-level functions (see below). */
4486 /* If it is a function that has not been defined at library level,
4487 then we should be able to look it up in the symbols. */
4488 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4491 /* Library-level function names start with "_ada_". See if function
4492 "_ada_" followed by NAME can be found. */
4494 /* Do a quick check that NAME does not contain "__", since library-level
4495 functions names cannot contain "__" in them. */
4496 if (strstr (name
, "__") != NULL
)
4499 fun_name
= xstrprintf ("_ada_%s", name
);
4501 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4504 /* Return nonzero if SYM corresponds to a renaming entity that is
4505 not visible from FUNCTION_NAME. */
4508 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4512 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4515 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4517 make_cleanup (xfree
, scope
);
4519 /* If the rename has been defined in a package, then it is visible. */
4520 if (is_package_name (scope
))
4523 /* Check that the rename is in the current function scope by checking
4524 that its name starts with SCOPE. */
4526 /* If the function name starts with "_ada_", it means that it is
4527 a library-level function. Strip this prefix before doing the
4528 comparison, as the encoding for the renaming does not contain
4530 if (strncmp (function_name
, "_ada_", 5) == 0)
4533 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4536 /* Remove entries from SYMS that corresponds to a renaming entity that
4537 is not visible from the function associated with CURRENT_BLOCK or
4538 that is superfluous due to the presence of more specific renaming
4539 information. Places surviving symbols in the initial entries of
4540 SYMS and returns the number of surviving symbols.
4543 First, in cases where an object renaming is implemented as a
4544 reference variable, GNAT may produce both the actual reference
4545 variable and the renaming encoding. In this case, we discard the
4548 Second, GNAT emits a type following a specified encoding for each renaming
4549 entity. Unfortunately, STABS currently does not support the definition
4550 of types that are local to a given lexical block, so all renamings types
4551 are emitted at library level. As a consequence, if an application
4552 contains two renaming entities using the same name, and a user tries to
4553 print the value of one of these entities, the result of the ada symbol
4554 lookup will also contain the wrong renaming type.
4556 This function partially covers for this limitation by attempting to
4557 remove from the SYMS list renaming symbols that should be visible
4558 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4559 method with the current information available. The implementation
4560 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4562 - When the user tries to print a rename in a function while there
4563 is another rename entity defined in a package: Normally, the
4564 rename in the function has precedence over the rename in the
4565 package, so the latter should be removed from the list. This is
4566 currently not the case.
4568 - This function will incorrectly remove valid renames if
4569 the CURRENT_BLOCK corresponds to a function which symbol name
4570 has been changed by an "Export" pragma. As a consequence,
4571 the user will be unable to print such rename entities. */
4574 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4575 int nsyms
, const struct block
*current_block
)
4577 struct symbol
*current_function
;
4578 char *current_function_name
;
4580 int is_new_style_renaming
;
4582 /* If there is both a renaming foo___XR... encoded as a variable and
4583 a simple variable foo in the same block, discard the latter.
4584 First, zero out such symbols, then compress. */
4585 is_new_style_renaming
= 0;
4586 for (i
= 0; i
< nsyms
; i
+= 1)
4588 struct symbol
*sym
= syms
[i
].sym
;
4589 struct block
*block
= syms
[i
].block
;
4593 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4595 name
= SYMBOL_LINKAGE_NAME (sym
);
4596 suffix
= strstr (name
, "___XR");
4600 int name_len
= suffix
- name
;
4602 is_new_style_renaming
= 1;
4603 for (j
= 0; j
< nsyms
; j
+= 1)
4604 if (i
!= j
&& syms
[j
].sym
!= NULL
4605 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4607 && block
== syms
[j
].block
)
4611 if (is_new_style_renaming
)
4615 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4616 if (syms
[j
].sym
!= NULL
)
4624 /* Extract the function name associated to CURRENT_BLOCK.
4625 Abort if unable to do so. */
4627 if (current_block
== NULL
)
4630 current_function
= block_function (current_block
);
4631 if (current_function
== NULL
)
4634 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4635 if (current_function_name
== NULL
)
4638 /* Check each of the symbols, and remove it from the list if it is
4639 a type corresponding to a renaming that is out of the scope of
4640 the current block. */
4645 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4646 == ADA_OBJECT_RENAMING
4647 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4650 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4651 syms
[j
- 1] = syms
[j
];
4661 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4662 scope and in global scopes, returning the number of matches. Sets
4663 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4664 indicating the symbols found and the blocks and symbol tables (if
4665 any) in which they were found. This vector are transient---good only to
4666 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4667 symbol match within the nest of blocks whose innermost member is BLOCK0,
4668 is the one match returned (no other matches in that or
4669 enclosing blocks is returned). If there are any matches in or
4670 surrounding BLOCK0, then these alone are returned. Otherwise, the
4671 search extends to global and file-scope (static) symbol tables.
4672 Names prefixed with "standard__" are handled specially: "standard__"
4673 is first stripped off, and only static and global symbols are searched. */
4676 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4677 domain_enum
namespace,
4678 struct ada_symbol_info
**results
)
4682 struct partial_symtab
*ps
;
4683 struct blockvector
*bv
;
4684 struct objfile
*objfile
;
4685 struct block
*block
;
4687 struct minimal_symbol
*msymbol
;
4693 obstack_free (&symbol_list_obstack
, NULL
);
4694 obstack_init (&symbol_list_obstack
);
4698 /* Search specified block and its superiors. */
4700 wild_match
= (strstr (name0
, "__") == NULL
);
4702 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4703 needed, but adding const will
4704 have a cascade effect. */
4705 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4709 name
= name0
+ sizeof ("standard__") - 1;
4713 while (block
!= NULL
)
4716 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4717 namespace, NULL
, wild_match
);
4719 /* If we found a non-function match, assume that's the one. */
4720 if (is_nonfunction (defns_collected (&symbol_list_obstack
, 0),
4721 num_defns_collected (&symbol_list_obstack
)))
4724 block
= BLOCK_SUPERBLOCK (block
);
4727 /* If no luck so far, try to find NAME as a local symbol in some lexically
4728 enclosing subprogram. */
4729 if (num_defns_collected (&symbol_list_obstack
) == 0 && block_depth
> 2)
4730 add_symbols_from_enclosing_procs (&symbol_list_obstack
,
4731 name
, namespace, wild_match
);
4733 /* If we found ANY matches among non-global symbols, we're done. */
4735 if (num_defns_collected (&symbol_list_obstack
) > 0)
4739 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4742 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4746 /* Now add symbols from all global blocks: symbol tables, minimal symbol
4747 tables, and psymtab's. */
4749 ALL_PRIMARY_SYMTABS (objfile
, s
)
4752 bv
= BLOCKVECTOR (s
);
4753 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4754 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4755 objfile
, wild_match
);
4758 if (namespace == VAR_DOMAIN
)
4760 ALL_MSYMBOLS (objfile
, msymbol
)
4762 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
))
4764 switch (MSYMBOL_TYPE (msymbol
))
4766 case mst_solib_trampoline
:
4769 s
= find_pc_symtab (SYMBOL_VALUE_ADDRESS (msymbol
));
4772 int ndefns0
= num_defns_collected (&symbol_list_obstack
);
4774 bv
= BLOCKVECTOR (s
);
4775 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4776 ada_add_block_symbols (&symbol_list_obstack
, block
,
4777 SYMBOL_LINKAGE_NAME (msymbol
),
4778 namespace, objfile
, wild_match
);
4780 if (num_defns_collected (&symbol_list_obstack
) == ndefns0
)
4782 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4783 ada_add_block_symbols (&symbol_list_obstack
, block
,
4784 SYMBOL_LINKAGE_NAME (msymbol
),
4794 ALL_PSYMTABS (objfile
, ps
)
4798 && ada_lookup_partial_symbol (ps
, name
, 1, namespace, wild_match
))
4800 s
= PSYMTAB_TO_SYMTAB (ps
);
4803 bv
= BLOCKVECTOR (s
);
4804 block
= BLOCKVECTOR_BLOCK (bv
, GLOBAL_BLOCK
);
4805 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4806 namespace, objfile
, wild_match
);
4810 /* Now add symbols from all per-file blocks if we've gotten no hits
4811 (Not strictly correct, but perhaps better than an error).
4812 Do the symtabs first, then check the psymtabs. */
4814 if (num_defns_collected (&symbol_list_obstack
) == 0)
4817 ALL_PRIMARY_SYMTABS (objfile
, s
)
4820 bv
= BLOCKVECTOR (s
);
4821 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4822 ada_add_block_symbols (&symbol_list_obstack
, block
, name
, namespace,
4823 objfile
, wild_match
);
4826 ALL_PSYMTABS (objfile
, ps
)
4830 && ada_lookup_partial_symbol (ps
, name
, 0, namespace, wild_match
))
4832 s
= PSYMTAB_TO_SYMTAB (ps
);
4833 bv
= BLOCKVECTOR (s
);
4836 block
= BLOCKVECTOR_BLOCK (bv
, STATIC_BLOCK
);
4837 ada_add_block_symbols (&symbol_list_obstack
, block
, name
,
4838 namespace, objfile
, wild_match
);
4844 ndefns
= num_defns_collected (&symbol_list_obstack
);
4845 *results
= defns_collected (&symbol_list_obstack
, 1);
4847 ndefns
= remove_extra_symbols (*results
, ndefns
);
4850 cache_symbol (name0
, namespace, NULL
, NULL
);
4852 if (ndefns
== 1 && cacheIfUnique
)
4853 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4855 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4861 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4862 domain_enum
namespace, struct block
**block_found
)
4864 struct ada_symbol_info
*candidates
;
4867 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4869 if (n_candidates
== 0)
4872 if (block_found
!= NULL
)
4873 *block_found
= candidates
[0].block
;
4875 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4878 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4879 scope and in global scopes, or NULL if none. NAME is folded and
4880 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4881 choosing the first symbol if there are multiple choices.
4882 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4883 table in which the symbol was found (in both cases, these
4884 assignments occur only if the pointers are non-null). */
4886 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4887 domain_enum
namespace, int *is_a_field_of_this
)
4889 if (is_a_field_of_this
!= NULL
)
4890 *is_a_field_of_this
= 0;
4893 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4894 block0
, namespace, NULL
);
4897 static struct symbol
*
4898 ada_lookup_symbol_nonlocal (const char *name
,
4899 const char *linkage_name
,
4900 const struct block
*block
,
4901 const domain_enum domain
)
4903 if (linkage_name
== NULL
)
4904 linkage_name
= name
;
4905 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4910 /* True iff STR is a possible encoded suffix of a normal Ada name
4911 that is to be ignored for matching purposes. Suffixes of parallel
4912 names (e.g., XVE) are not included here. Currently, the possible suffixes
4913 are given by either of the regular expression:
4915 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4916 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4917 _E[0-9]+[bs]$ [protected object entry suffixes]
4918 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4920 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4921 match is performed. This sequence is used to differentiate homonyms,
4922 is an optional part of a valid name suffix. */
4925 is_name_suffix (const char *str
)
4928 const char *matching
;
4929 const int len
= strlen (str
);
4931 /* Skip optional leading __[0-9]+. */
4933 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4936 while (isdigit (str
[0]))
4942 if (str
[0] == '.' || str
[0] == '$')
4945 while (isdigit (matching
[0]))
4947 if (matching
[0] == '\0')
4953 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4956 while (isdigit (matching
[0]))
4958 if (matching
[0] == '\0')
4963 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4964 with a N at the end. Unfortunately, the compiler uses the same
4965 convention for other internal types it creates. So treating
4966 all entity names that end with an "N" as a name suffix causes
4967 some regressions. For instance, consider the case of an enumerated
4968 type. To support the 'Image attribute, it creates an array whose
4970 Having a single character like this as a suffix carrying some
4971 information is a bit risky. Perhaps we should change the encoding
4972 to be something like "_N" instead. In the meantime, do not do
4973 the following check. */
4974 /* Protected Object Subprograms */
4975 if (len
== 1 && str
[0] == 'N')
4980 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4983 while (isdigit (matching
[0]))
4985 if ((matching
[0] == 'b' || matching
[0] == 's')
4986 && matching
[1] == '\0')
4990 /* ??? We should not modify STR directly, as we are doing below. This
4991 is fine in this case, but may become problematic later if we find
4992 that this alternative did not work, and want to try matching
4993 another one from the begining of STR. Since we modified it, we
4994 won't be able to find the begining of the string anymore! */
4998 while (str
[0] != '_' && str
[0] != '\0')
5000 if (str
[0] != 'n' && str
[0] != 'b')
5006 if (str
[0] == '\000')
5011 if (str
[1] != '_' || str
[2] == '\000')
5015 if (strcmp (str
+ 3, "JM") == 0)
5017 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
5018 the LJM suffix in favor of the JM one. But we will
5019 still accept LJM as a valid suffix for a reasonable
5020 amount of time, just to allow ourselves to debug programs
5021 compiled using an older version of GNAT. */
5022 if (strcmp (str
+ 3, "LJM") == 0)
5026 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
5027 || str
[4] == 'U' || str
[4] == 'P')
5029 if (str
[4] == 'R' && str
[5] != 'T')
5033 if (!isdigit (str
[2]))
5035 for (k
= 3; str
[k
] != '\0'; k
+= 1)
5036 if (!isdigit (str
[k
]) && str
[k
] != '_')
5040 if (str
[0] == '$' && isdigit (str
[1]))
5042 for (k
= 2; str
[k
] != '\0'; k
+= 1)
5043 if (!isdigit (str
[k
]) && str
[k
] != '_')
5050 /* Return nonzero if the given string starts with a dot ('.')
5051 followed by zero or more digits.
5053 Note: brobecker/2003-11-10: A forward declaration has not been
5054 added at the begining of this file yet, because this function
5055 is only used to work around a problem found during wild matching
5056 when trying to match minimal symbol names against symbol names
5057 obtained from dwarf-2 data. This function is therefore currently
5058 only used in wild_match() and is likely to be deleted when the
5059 problem in dwarf-2 is fixed. */
5062 is_dot_digits_suffix (const char *str
)
5068 while (isdigit (str
[0]))
5070 return (str
[0] == '\0');
5073 /* Return non-zero if the string starting at NAME and ending before
5074 NAME_END contains no capital letters. */
5077 is_valid_name_for_wild_match (const char *name0
)
5079 const char *decoded_name
= ada_decode (name0
);
5082 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5083 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5089 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5090 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5091 informational suffixes of NAME (i.e., for which is_name_suffix is
5095 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5102 /* FIXME: brobecker/2003-11-10: For some reason, the symbol name
5103 stored in the symbol table for nested function names is sometimes
5104 different from the name of the associated entity stored in
5105 the dwarf-2 data: This is the case for nested subprograms, where
5106 the minimal symbol name contains a trailing ".[:digit:]+" suffix,
5107 while the symbol name from the dwarf-2 data does not.
5109 Although the DWARF-2 standard documents that entity names stored
5110 in the dwarf-2 data should be identical to the name as seen in
5111 the source code, GNAT takes a different approach as we already use
5112 a special encoding mechanism to convey the information so that
5113 a C debugger can still use the information generated to debug
5114 Ada programs. A corollary is that the symbol names in the dwarf-2
5115 data should match the names found in the symbol table. I therefore
5116 consider this issue as a compiler defect.
5118 Until the compiler is properly fixed, we work-around the problem
5119 by ignoring such suffixes during the match. We do so by making
5120 a copy of PATN0 and NAME0, and then by stripping such a suffix
5121 if present. We then perform the match on the resulting strings. */
5124 name_len
= strlen (name0
);
5126 name
= name_start
= (char *) alloca ((name_len
+ 1) * sizeof (char));
5127 strcpy (name
, name0
);
5128 dot
= strrchr (name
, '.');
5129 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5132 patn
= (char *) alloca ((patn_len
+ 1) * sizeof (char));
5133 strncpy (patn
, patn0
, patn_len
);
5134 patn
[patn_len
] = '\0';
5135 dot
= strrchr (patn
, '.');
5136 if (dot
!= NULL
&& is_dot_digits_suffix (dot
))
5139 patn_len
= dot
- patn
;
5143 /* Now perform the wild match. */
5145 name_len
= strlen (name
);
5146 if (name_len
>= patn_len
+ 5 && strncmp (name
, "_ada_", 5) == 0
5147 && strncmp (patn
, name
+ 5, patn_len
) == 0
5148 && is_name_suffix (name
+ patn_len
+ 5))
5151 while (name_len
>= patn_len
)
5153 if (strncmp (patn
, name
, patn_len
) == 0
5154 && is_name_suffix (name
+ patn_len
))
5155 return (name
== name_start
|| is_valid_name_for_wild_match (name0
));
5162 && name
[0] != '.' && (name
[0] != '_' || name
[1] != '_'));
5167 if (!islower (name
[2]))
5174 if (!islower (name
[1]))
5185 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5186 vector *defn_symbols, updating the list of symbols in OBSTACKP
5187 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5188 OBJFILE is the section containing BLOCK.
5189 SYMTAB is recorded with each symbol added. */
5192 ada_add_block_symbols (struct obstack
*obstackp
,
5193 struct block
*block
, const char *name
,
5194 domain_enum domain
, struct objfile
*objfile
,
5197 struct dict_iterator iter
;
5198 int name_len
= strlen (name
);
5199 /* A matching argument symbol, if any. */
5200 struct symbol
*arg_sym
;
5201 /* Set true when we find a matching non-argument symbol. */
5210 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5212 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5213 SYMBOL_DOMAIN (sym
), domain
)
5214 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5216 switch (SYMBOL_CLASS (sym
))
5221 case LOC_REGPARM_ADDR
:
5222 case LOC_COMPUTED_ARG
:
5225 case LOC_UNRESOLVED
:
5229 add_defn_to_vec (obstackp
,
5230 fixup_symbol_section (sym
, objfile
),
5239 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5241 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5242 SYMBOL_DOMAIN (sym
), domain
))
5244 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5246 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5248 switch (SYMBOL_CLASS (sym
))
5253 case LOC_REGPARM_ADDR
:
5254 case LOC_COMPUTED_ARG
:
5257 case LOC_UNRESOLVED
:
5261 add_defn_to_vec (obstackp
,
5262 fixup_symbol_section (sym
, objfile
),
5271 if (!found_sym
&& arg_sym
!= NULL
)
5273 add_defn_to_vec (obstackp
,
5274 fixup_symbol_section (arg_sym
, objfile
),
5283 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5285 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5286 SYMBOL_DOMAIN (sym
), domain
))
5290 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5293 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5295 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5300 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5302 switch (SYMBOL_CLASS (sym
))
5307 case LOC_REGPARM_ADDR
:
5308 case LOC_COMPUTED_ARG
:
5311 case LOC_UNRESOLVED
:
5315 add_defn_to_vec (obstackp
,
5316 fixup_symbol_section (sym
, objfile
),
5324 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5325 They aren't parameters, right? */
5326 if (!found_sym
&& arg_sym
!= NULL
)
5328 add_defn_to_vec (obstackp
,
5329 fixup_symbol_section (arg_sym
, objfile
),
5336 /* Symbol Completion */
5338 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5339 name in a form that's appropriate for the completion. The result
5340 does not need to be deallocated, but is only good until the next call.
5342 TEXT_LEN is equal to the length of TEXT.
5343 Perform a wild match if WILD_MATCH is set.
5344 ENCODED should be set if TEXT represents the start of a symbol name
5345 in its encoded form. */
5348 symbol_completion_match (const char *sym_name
,
5349 const char *text
, int text_len
,
5350 int wild_match
, int encoded
)
5353 const int verbatim_match
= (text
[0] == '<');
5358 /* Strip the leading angle bracket. */
5363 /* First, test against the fully qualified name of the symbol. */
5365 if (strncmp (sym_name
, text
, text_len
) == 0)
5368 if (match
&& !encoded
)
5370 /* One needed check before declaring a positive match is to verify
5371 that iff we are doing a verbatim match, the decoded version
5372 of the symbol name starts with '<'. Otherwise, this symbol name
5373 is not a suitable completion. */
5374 const char *sym_name_copy
= sym_name
;
5375 int has_angle_bracket
;
5377 sym_name
= ada_decode (sym_name
);
5378 has_angle_bracket
= (sym_name
[0] == '<');
5379 match
= (has_angle_bracket
== verbatim_match
);
5380 sym_name
= sym_name_copy
;
5383 if (match
&& !verbatim_match
)
5385 /* When doing non-verbatim match, another check that needs to
5386 be done is to verify that the potentially matching symbol name
5387 does not include capital letters, because the ada-mode would
5388 not be able to understand these symbol names without the
5389 angle bracket notation. */
5392 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5397 /* Second: Try wild matching... */
5399 if (!match
&& wild_match
)
5401 /* Since we are doing wild matching, this means that TEXT
5402 may represent an unqualified symbol name. We therefore must
5403 also compare TEXT against the unqualified name of the symbol. */
5404 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5406 if (strncmp (sym_name
, text
, text_len
) == 0)
5410 /* Finally: If we found a mach, prepare the result to return. */
5416 sym_name
= add_angle_brackets (sym_name
);
5419 sym_name
= ada_decode (sym_name
);
5424 typedef char *char_ptr
;
5425 DEF_VEC_P (char_ptr
);
5427 /* A companion function to ada_make_symbol_completion_list().
5428 Check if SYM_NAME represents a symbol which name would be suitable
5429 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5430 it is appended at the end of the given string vector SV.
5432 ORIG_TEXT is the string original string from the user command
5433 that needs to be completed. WORD is the entire command on which
5434 completion should be performed. These two parameters are used to
5435 determine which part of the symbol name should be added to the
5437 if WILD_MATCH is set, then wild matching is performed.
5438 ENCODED should be set if TEXT represents a symbol name in its
5439 encoded formed (in which case the completion should also be
5443 symbol_completion_add (VEC(char_ptr
) **sv
,
5444 const char *sym_name
,
5445 const char *text
, int text_len
,
5446 const char *orig_text
, const char *word
,
5447 int wild_match
, int encoded
)
5449 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5450 wild_match
, encoded
);
5456 /* We found a match, so add the appropriate completion to the given
5459 if (word
== orig_text
)
5461 completion
= xmalloc (strlen (match
) + 5);
5462 strcpy (completion
, match
);
5464 else if (word
> orig_text
)
5466 /* Return some portion of sym_name. */
5467 completion
= xmalloc (strlen (match
) + 5);
5468 strcpy (completion
, match
+ (word
- orig_text
));
5472 /* Return some of ORIG_TEXT plus sym_name. */
5473 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5474 strncpy (completion
, word
, orig_text
- word
);
5475 completion
[orig_text
- word
] = '\0';
5476 strcat (completion
, match
);
5479 VEC_safe_push (char_ptr
, *sv
, completion
);
5482 /* Return a list of possible symbol names completing TEXT0. The list
5483 is NULL terminated. WORD is the entire command on which completion
5487 ada_make_symbol_completion_list (char *text0
, char *word
)
5493 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5496 struct partial_symtab
*ps
;
5497 struct minimal_symbol
*msymbol
;
5498 struct objfile
*objfile
;
5499 struct block
*b
, *surrounding_static_block
= 0;
5501 struct dict_iterator iter
;
5503 if (text0
[0] == '<')
5505 text
= xstrdup (text0
);
5506 make_cleanup (xfree
, text
);
5507 text_len
= strlen (text
);
5513 text
= xstrdup (ada_encode (text0
));
5514 make_cleanup (xfree
, text
);
5515 text_len
= strlen (text
);
5516 for (i
= 0; i
< text_len
; i
++)
5517 text
[i
] = tolower (text
[i
]);
5519 encoded
= (strstr (text0
, "__") != NULL
);
5520 /* If the name contains a ".", then the user is entering a fully
5521 qualified entity name, and the match must not be done in wild
5522 mode. Similarly, if the user wants to complete what looks like
5523 an encoded name, the match must not be done in wild mode. */
5524 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5527 /* First, look at the partial symtab symbols. */
5528 ALL_PSYMTABS (objfile
, ps
)
5530 struct partial_symbol
**psym
;
5532 /* If the psymtab's been read in we'll get it when we search
5533 through the blockvector. */
5537 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5538 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5539 + ps
->n_global_syms
); psym
++)
5542 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5543 text
, text_len
, text0
, word
,
5544 wild_match
, encoded
);
5547 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5548 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5549 + ps
->n_static_syms
); psym
++)
5552 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5553 text
, text_len
, text0
, word
,
5554 wild_match
, encoded
);
5558 /* At this point scan through the misc symbol vectors and add each
5559 symbol you find to the list. Eventually we want to ignore
5560 anything that isn't a text symbol (everything else will be
5561 handled by the psymtab code above). */
5563 ALL_MSYMBOLS (objfile
, msymbol
)
5566 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5567 text
, text_len
, text0
, word
, wild_match
, encoded
);
5570 /* Search upwards from currently selected frame (so that we can
5571 complete on local vars. */
5573 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5575 if (!BLOCK_SUPERBLOCK (b
))
5576 surrounding_static_block
= b
; /* For elmin of dups */
5578 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5580 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5581 text
, text_len
, text0
, word
,
5582 wild_match
, encoded
);
5586 /* Go through the symtabs and check the externs and statics for
5587 symbols which match. */
5589 ALL_SYMTABS (objfile
, s
)
5592 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5593 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5595 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5596 text
, text_len
, text0
, word
,
5597 wild_match
, encoded
);
5601 ALL_SYMTABS (objfile
, s
)
5604 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5605 /* Don't do this block twice. */
5606 if (b
== surrounding_static_block
)
5608 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5610 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5611 text
, text_len
, text0
, word
,
5612 wild_match
, encoded
);
5616 /* Append the closing NULL entry. */
5617 VEC_safe_push (char_ptr
, completions
, NULL
);
5619 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5620 return the copy. It's unfortunate that we have to make a copy
5621 of an array that we're about to destroy, but there is nothing much
5622 we can do about it. Fortunately, it's typically not a very large
5625 const size_t completions_size
=
5626 VEC_length (char_ptr
, completions
) * sizeof (char *);
5627 char **result
= malloc (completions_size
);
5629 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5631 VEC_free (char_ptr
, completions
);
5638 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5639 for tagged types. */
5642 ada_is_dispatch_table_ptr_type (struct type
*type
)
5646 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5649 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5653 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5656 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5657 to be invisible to users. */
5660 ada_is_ignored_field (struct type
*type
, int field_num
)
5662 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5665 /* Check the name of that field. */
5667 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5669 /* Anonymous field names should not be printed.
5670 brobecker/2007-02-20: I don't think this can actually happen
5671 but we don't want to print the value of annonymous fields anyway. */
5675 /* A field named "_parent" is internally generated by GNAT for
5676 tagged types, and should not be printed either. */
5677 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5681 /* If this is the dispatch table of a tagged type, then ignore. */
5682 if (ada_is_tagged_type (type
, 1)
5683 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5686 /* Not a special field, so it should not be ignored. */
5690 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5691 pointer or reference type whose ultimate target has a tag field. */
5694 ada_is_tagged_type (struct type
*type
, int refok
)
5696 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5699 /* True iff TYPE represents the type of X'Tag */
5702 ada_is_tag_type (struct type
*type
)
5704 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5708 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5709 return (name
!= NULL
5710 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5714 /* The type of the tag on VAL. */
5717 ada_tag_type (struct value
*val
)
5719 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5722 /* The value of the tag on VAL. */
5725 ada_value_tag (struct value
*val
)
5727 return ada_value_struct_elt (val
, "_tag", 0);
5730 /* The value of the tag on the object of type TYPE whose contents are
5731 saved at VALADDR, if it is non-null, or is at memory address
5734 static struct value
*
5735 value_tag_from_contents_and_address (struct type
*type
,
5736 const gdb_byte
*valaddr
,
5739 int tag_byte_offset
, dummy1
, dummy2
;
5740 struct type
*tag_type
;
5741 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5744 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5746 : valaddr
+ tag_byte_offset
);
5747 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5749 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5754 static struct type
*
5755 type_from_tag (struct value
*tag
)
5757 const char *type_name
= ada_tag_name (tag
);
5758 if (type_name
!= NULL
)
5759 return ada_find_any_type (ada_encode (type_name
));
5770 static int ada_tag_name_1 (void *);
5771 static int ada_tag_name_2 (struct tag_args
*);
5773 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5774 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5775 The value stored in ARGS->name is valid until the next call to
5779 ada_tag_name_1 (void *args0
)
5781 struct tag_args
*args
= (struct tag_args
*) args0
;
5782 static char name
[1024];
5786 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5788 return ada_tag_name_2 (args
);
5789 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5792 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5793 for (p
= name
; *p
!= '\0'; p
+= 1)
5800 /* Utility function for ada_tag_name_1 that tries the second
5801 representation for the dispatch table (in which there is no
5802 explicit 'tsd' field in the referent of the tag pointer, and instead
5803 the tsd pointer is stored just before the dispatch table. */
5806 ada_tag_name_2 (struct tag_args
*args
)
5808 struct type
*info_type
;
5809 static char name
[1024];
5811 struct value
*val
, *valp
;
5814 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5815 if (info_type
== NULL
)
5817 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5818 valp
= value_cast (info_type
, args
->tag
);
5821 val
= value_ind (value_add (valp
, value_from_longest (builtin_type_int
, -1)));
5824 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5827 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5828 for (p
= name
; *p
!= '\0'; p
+= 1)
5835 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5839 ada_tag_name (struct value
*tag
)
5841 struct tag_args args
;
5842 if (!ada_is_tag_type (value_type (tag
)))
5846 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5850 /* The parent type of TYPE, or NULL if none. */
5853 ada_parent_type (struct type
*type
)
5857 type
= ada_check_typedef (type
);
5859 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5862 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5863 if (ada_is_parent_field (type
, i
))
5864 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5869 /* True iff field number FIELD_NUM of structure type TYPE contains the
5870 parent-type (inherited) fields of a derived type. Assumes TYPE is
5871 a structure type with at least FIELD_NUM+1 fields. */
5874 ada_is_parent_field (struct type
*type
, int field_num
)
5876 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5877 return (name
!= NULL
5878 && (strncmp (name
, "PARENT", 6) == 0
5879 || strncmp (name
, "_parent", 7) == 0));
5882 /* True iff field number FIELD_NUM of structure type TYPE is a
5883 transparent wrapper field (which should be silently traversed when doing
5884 field selection and flattened when printing). Assumes TYPE is a
5885 structure type with at least FIELD_NUM+1 fields. Such fields are always
5889 ada_is_wrapper_field (struct type
*type
, int field_num
)
5891 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5892 return (name
!= NULL
5893 && (strncmp (name
, "PARENT", 6) == 0
5894 || strcmp (name
, "REP") == 0
5895 || strncmp (name
, "_parent", 7) == 0
5896 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5899 /* True iff field number FIELD_NUM of structure or union type TYPE
5900 is a variant wrapper. Assumes TYPE is a structure type with at least
5901 FIELD_NUM+1 fields. */
5904 ada_is_variant_part (struct type
*type
, int field_num
)
5906 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5907 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5908 || (is_dynamic_field (type
, field_num
)
5909 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5910 == TYPE_CODE_UNION
)));
5913 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5914 whose discriminants are contained in the record type OUTER_TYPE,
5915 returns the type of the controlling discriminant for the variant. */
5918 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5920 char *name
= ada_variant_discrim_name (var_type
);
5922 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5924 return builtin_type_int
;
5929 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5930 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5931 represents a 'when others' clause; otherwise 0. */
5934 ada_is_others_clause (struct type
*type
, int field_num
)
5936 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5937 return (name
!= NULL
&& name
[0] == 'O');
5940 /* Assuming that TYPE0 is the type of the variant part of a record,
5941 returns the name of the discriminant controlling the variant.
5942 The value is valid until the next call to ada_variant_discrim_name. */
5945 ada_variant_discrim_name (struct type
*type0
)
5947 static char *result
= NULL
;
5948 static size_t result_len
= 0;
5951 const char *discrim_end
;
5952 const char *discrim_start
;
5954 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5955 type
= TYPE_TARGET_TYPE (type0
);
5959 name
= ada_type_name (type
);
5961 if (name
== NULL
|| name
[0] == '\000')
5964 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5967 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5970 if (discrim_end
== name
)
5973 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5976 if (discrim_start
== name
+ 1)
5978 if ((discrim_start
> name
+ 3
5979 && strncmp (discrim_start
- 3, "___", 3) == 0)
5980 || discrim_start
[-1] == '.')
5984 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5985 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5986 result
[discrim_end
- discrim_start
] = '\0';
5990 /* Scan STR for a subtype-encoded number, beginning at position K.
5991 Put the position of the character just past the number scanned in
5992 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5993 Return 1 if there was a valid number at the given position, and 0
5994 otherwise. A "subtype-encoded" number consists of the absolute value
5995 in decimal, followed by the letter 'm' to indicate a negative number.
5996 Assumes 0m does not occur. */
5999 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
6003 if (!isdigit (str
[k
]))
6006 /* Do it the hard way so as not to make any assumption about
6007 the relationship of unsigned long (%lu scan format code) and
6010 while (isdigit (str
[k
]))
6012 RU
= RU
* 10 + (str
[k
] - '0');
6019 *R
= (-(LONGEST
) (RU
- 1)) - 1;
6025 /* NOTE on the above: Technically, C does not say what the results of
6026 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
6027 number representable as a LONGEST (although either would probably work
6028 in most implementations). When RU>0, the locution in the then branch
6029 above is always equivalent to the negative of RU. */
6036 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
6037 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
6038 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
6041 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
6043 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
6056 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
6065 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
6066 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
6068 if (val
>= L
&& val
<= U
)
6080 /* FIXME: Lots of redundancy below. Try to consolidate. */
6082 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
6083 ARG_TYPE, extract and return the value of one of its (non-static)
6084 fields. FIELDNO says which field. Differs from value_primitive_field
6085 only in that it can handle packed values of arbitrary type. */
6087 static struct value
*
6088 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
6089 struct type
*arg_type
)
6093 arg_type
= ada_check_typedef (arg_type
);
6094 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
6096 /* Handle packed fields. */
6098 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
6100 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
6101 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
6103 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
6104 offset
+ bit_pos
/ 8,
6105 bit_pos
% 8, bit_size
, type
);
6108 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
6111 /* Find field with name NAME in object of type TYPE. If found,
6112 set the following for each argument that is non-null:
6113 - *FIELD_TYPE_P to the field's type;
6114 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
6115 an object of that type;
6116 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
6117 - *BIT_SIZE_P to its size in bits if the field is packed, and
6119 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
6120 fields up to but not including the desired field, or by the total
6121 number of fields if not found. A NULL value of NAME never
6122 matches; the function just counts visible fields in this case.
6124 Returns 1 if found, 0 otherwise. */
6127 find_struct_field (char *name
, struct type
*type
, int offset
,
6128 struct type
**field_type_p
,
6129 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
6134 type
= ada_check_typedef (type
);
6136 if (field_type_p
!= NULL
)
6137 *field_type_p
= NULL
;
6138 if (byte_offset_p
!= NULL
)
6140 if (bit_offset_p
!= NULL
)
6142 if (bit_size_p
!= NULL
)
6145 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6147 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6148 int fld_offset
= offset
+ bit_pos
/ 8;
6149 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6151 if (t_field_name
== NULL
)
6154 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6156 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6157 if (field_type_p
!= NULL
)
6158 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6159 if (byte_offset_p
!= NULL
)
6160 *byte_offset_p
= fld_offset
;
6161 if (bit_offset_p
!= NULL
)
6162 *bit_offset_p
= bit_pos
% 8;
6163 if (bit_size_p
!= NULL
)
6164 *bit_size_p
= bit_size
;
6167 else if (ada_is_wrapper_field (type
, i
))
6169 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6170 field_type_p
, byte_offset_p
, bit_offset_p
,
6171 bit_size_p
, index_p
))
6174 else if (ada_is_variant_part (type
, i
))
6176 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6179 struct type
*field_type
6180 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6182 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6184 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6186 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6187 field_type_p
, byte_offset_p
,
6188 bit_offset_p
, bit_size_p
, index_p
))
6192 else if (index_p
!= NULL
)
6198 /* Number of user-visible fields in record type TYPE. */
6201 num_visible_fields (struct type
*type
)
6205 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6209 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6210 and search in it assuming it has (class) type TYPE.
6211 If found, return value, else return NULL.
6213 Searches recursively through wrapper fields (e.g., '_parent'). */
6215 static struct value
*
6216 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6220 type
= ada_check_typedef (type
);
6222 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6224 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6226 if (t_field_name
== NULL
)
6229 else if (field_name_match (t_field_name
, name
))
6230 return ada_value_primitive_field (arg
, offset
, i
, type
);
6232 else if (ada_is_wrapper_field (type
, i
))
6234 struct value
*v
= /* Do not let indent join lines here. */
6235 ada_search_struct_field (name
, arg
,
6236 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6237 TYPE_FIELD_TYPE (type
, i
));
6242 else if (ada_is_variant_part (type
, i
))
6244 /* PNH: Do we ever get here? See find_struct_field. */
6246 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6247 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6249 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6251 struct value
*v
= ada_search_struct_field
/* Force line break. */
6253 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6254 TYPE_FIELD_TYPE (field_type
, j
));
6263 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6264 int, struct type
*);
6267 /* Return field #INDEX in ARG, where the index is that returned by
6268 * find_struct_field through its INDEX_P argument. Adjust the address
6269 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6270 * If found, return value, else return NULL. */
6272 static struct value
*
6273 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6276 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6280 /* Auxiliary function for ada_index_struct_field. Like
6281 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6284 static struct value
*
6285 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6289 type
= ada_check_typedef (type
);
6291 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6293 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6295 else if (ada_is_wrapper_field (type
, i
))
6297 struct value
*v
= /* Do not let indent join lines here. */
6298 ada_index_struct_field_1 (index_p
, arg
,
6299 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6300 TYPE_FIELD_TYPE (type
, i
));
6305 else if (ada_is_variant_part (type
, i
))
6307 /* PNH: Do we ever get here? See ada_search_struct_field,
6308 find_struct_field. */
6309 error (_("Cannot assign this kind of variant record"));
6311 else if (*index_p
== 0)
6312 return ada_value_primitive_field (arg
, offset
, i
, type
);
6319 /* Given ARG, a value of type (pointer or reference to a)*
6320 structure/union, extract the component named NAME from the ultimate
6321 target structure/union and return it as a value with its
6322 appropriate type. If ARG is a pointer or reference and the field
6323 is not packed, returns a reference to the field, otherwise the
6324 value of the field (an lvalue if ARG is an lvalue).
6326 The routine searches for NAME among all members of the structure itself
6327 and (recursively) among all members of any wrapper members
6330 If NO_ERR, then simply return NULL in case of error, rather than
6334 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6336 struct type
*t
, *t1
;
6340 t1
= t
= ada_check_typedef (value_type (arg
));
6341 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6343 t1
= TYPE_TARGET_TYPE (t
);
6346 t1
= ada_check_typedef (t1
);
6347 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6349 arg
= coerce_ref (arg
);
6354 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6356 t1
= TYPE_TARGET_TYPE (t
);
6359 t1
= ada_check_typedef (t1
);
6360 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6362 arg
= value_ind (arg
);
6369 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6373 v
= ada_search_struct_field (name
, arg
, 0, t
);
6376 int bit_offset
, bit_size
, byte_offset
;
6377 struct type
*field_type
;
6380 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6381 address
= value_as_address (arg
);
6383 address
= unpack_pointer (t
, value_contents (arg
));
6385 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6386 if (find_struct_field (name
, t1
, 0,
6387 &field_type
, &byte_offset
, &bit_offset
,
6392 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6393 arg
= ada_coerce_ref (arg
);
6395 arg
= ada_value_ind (arg
);
6396 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6397 bit_offset
, bit_size
,
6401 v
= value_from_pointer (lookup_reference_type (field_type
),
6402 address
+ byte_offset
);
6406 if (v
!= NULL
|| no_err
)
6409 error (_("There is no member named %s."), name
);
6415 error (_("Attempt to extract a component of a value that is not a record."));
6418 /* Given a type TYPE, look up the type of the component of type named NAME.
6419 If DISPP is non-null, add its byte displacement from the beginning of a
6420 structure (pointed to by a value) of type TYPE to *DISPP (does not
6421 work for packed fields).
6423 Matches any field whose name has NAME as a prefix, possibly
6426 TYPE can be either a struct or union. If REFOK, TYPE may also
6427 be a (pointer or reference)+ to a struct or union, and the
6428 ultimate target type will be searched.
6430 Looks recursively into variant clauses and parent types.
6432 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6433 TYPE is not a type of the right kind. */
6435 static struct type
*
6436 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6437 int noerr
, int *dispp
)
6444 if (refok
&& type
!= NULL
)
6447 type
= ada_check_typedef (type
);
6448 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6449 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6451 type
= TYPE_TARGET_TYPE (type
);
6455 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6456 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6462 target_terminal_ours ();
6463 gdb_flush (gdb_stdout
);
6465 error (_("Type (null) is not a structure or union type"));
6468 /* XXX: type_sprint */
6469 fprintf_unfiltered (gdb_stderr
, _("Type "));
6470 type_print (type
, "", gdb_stderr
, -1);
6471 error (_(" is not a structure or union type"));
6476 type
= to_static_fixed_type (type
);
6478 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6480 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6484 if (t_field_name
== NULL
)
6487 else if (field_name_match (t_field_name
, name
))
6490 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6491 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6494 else if (ada_is_wrapper_field (type
, i
))
6497 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6502 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6507 else if (ada_is_variant_part (type
, i
))
6510 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6512 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6515 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6520 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6531 target_terminal_ours ();
6532 gdb_flush (gdb_stdout
);
6535 /* XXX: type_sprint */
6536 fprintf_unfiltered (gdb_stderr
, _("Type "));
6537 type_print (type
, "", gdb_stderr
, -1);
6538 error (_(" has no component named <null>"));
6542 /* XXX: type_sprint */
6543 fprintf_unfiltered (gdb_stderr
, _("Type "));
6544 type_print (type
, "", gdb_stderr
, -1);
6545 error (_(" has no component named %s"), name
);
6552 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6553 within a value of type OUTER_TYPE that is stored in GDB at
6554 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6555 numbering from 0) is applicable. Returns -1 if none are. */
6558 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6559 const gdb_byte
*outer_valaddr
)
6563 char *discrim_name
= ada_variant_discrim_name (var_type
);
6564 struct value
*outer
;
6565 struct value
*discrim
;
6566 LONGEST discrim_val
;
6568 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6569 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6570 if (discrim
== NULL
)
6572 discrim_val
= value_as_long (discrim
);
6575 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6577 if (ada_is_others_clause (var_type
, i
))
6579 else if (ada_in_variant (discrim_val
, var_type
, i
))
6583 return others_clause
;
6588 /* Dynamic-Sized Records */
6590 /* Strategy: The type ostensibly attached to a value with dynamic size
6591 (i.e., a size that is not statically recorded in the debugging
6592 data) does not accurately reflect the size or layout of the value.
6593 Our strategy is to convert these values to values with accurate,
6594 conventional types that are constructed on the fly. */
6596 /* There is a subtle and tricky problem here. In general, we cannot
6597 determine the size of dynamic records without its data. However,
6598 the 'struct value' data structure, which GDB uses to represent
6599 quantities in the inferior process (the target), requires the size
6600 of the type at the time of its allocation in order to reserve space
6601 for GDB's internal copy of the data. That's why the
6602 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6603 rather than struct value*s.
6605 However, GDB's internal history variables ($1, $2, etc.) are
6606 struct value*s containing internal copies of the data that are not, in
6607 general, the same as the data at their corresponding addresses in
6608 the target. Fortunately, the types we give to these values are all
6609 conventional, fixed-size types (as per the strategy described
6610 above), so that we don't usually have to perform the
6611 'to_fixed_xxx_type' conversions to look at their values.
6612 Unfortunately, there is one exception: if one of the internal
6613 history variables is an array whose elements are unconstrained
6614 records, then we will need to create distinct fixed types for each
6615 element selected. */
6617 /* The upshot of all of this is that many routines take a (type, host
6618 address, target address) triple as arguments to represent a value.
6619 The host address, if non-null, is supposed to contain an internal
6620 copy of the relevant data; otherwise, the program is to consult the
6621 target at the target address. */
6623 /* Assuming that VAL0 represents a pointer value, the result of
6624 dereferencing it. Differs from value_ind in its treatment of
6625 dynamic-sized types. */
6628 ada_value_ind (struct value
*val0
)
6630 struct value
*val
= unwrap_value (value_ind (val0
));
6631 return ada_to_fixed_value (val
);
6634 /* The value resulting from dereferencing any "reference to"
6635 qualifiers on VAL0. */
6637 static struct value
*
6638 ada_coerce_ref (struct value
*val0
)
6640 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6642 struct value
*val
= val0
;
6643 val
= coerce_ref (val
);
6644 val
= unwrap_value (val
);
6645 return ada_to_fixed_value (val
);
6651 /* Return OFF rounded upward if necessary to a multiple of
6652 ALIGNMENT (a power of 2). */
6655 align_value (unsigned int off
, unsigned int alignment
)
6657 return (off
+ alignment
- 1) & ~(alignment
- 1);
6660 /* Return the bit alignment required for field #F of template type TYPE. */
6663 field_alignment (struct type
*type
, int f
)
6665 const char *name
= TYPE_FIELD_NAME (type
, f
);
6669 /* The field name should never be null, unless the debugging information
6670 is somehow malformed. In this case, we assume the field does not
6671 require any alignment. */
6675 len
= strlen (name
);
6677 if (!isdigit (name
[len
- 1]))
6680 if (isdigit (name
[len
- 2]))
6681 align_offset
= len
- 2;
6683 align_offset
= len
- 1;
6685 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6686 return TARGET_CHAR_BIT
;
6688 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6691 /* Find a symbol named NAME. Ignores ambiguity. */
6694 ada_find_any_symbol (const char *name
)
6698 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6699 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6702 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6706 /* Find a type named NAME. Ignores ambiguity. */
6709 ada_find_any_type (const char *name
)
6711 struct symbol
*sym
= ada_find_any_symbol (name
);
6714 return SYMBOL_TYPE (sym
);
6719 /* Given NAME and an associated BLOCK, search all symbols for
6720 NAME suffixed with "___XR", which is the ``renaming'' symbol
6721 associated to NAME. Return this symbol if found, return
6725 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6729 sym
= find_old_style_renaming_symbol (name
, block
);
6734 /* Not right yet. FIXME pnh 7/20/2007. */
6735 sym
= ada_find_any_symbol (name
);
6736 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6742 static struct symbol
*
6743 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6745 const struct symbol
*function_sym
= block_function (block
);
6748 if (function_sym
!= NULL
)
6750 /* If the symbol is defined inside a function, NAME is not fully
6751 qualified. This means we need to prepend the function name
6752 as well as adding the ``___XR'' suffix to build the name of
6753 the associated renaming symbol. */
6754 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6755 /* Function names sometimes contain suffixes used
6756 for instance to qualify nested subprograms. When building
6757 the XR type name, we need to make sure that this suffix is
6758 not included. So do not include any suffix in the function
6759 name length below. */
6760 const int function_name_len
= ada_name_prefix_len (function_name
);
6761 const int rename_len
= function_name_len
+ 2 /* "__" */
6762 + strlen (name
) + 6 /* "___XR\0" */ ;
6764 /* Strip the suffix if necessary. */
6765 function_name
[function_name_len
] = '\0';
6767 /* Library-level functions are a special case, as GNAT adds
6768 a ``_ada_'' prefix to the function name to avoid namespace
6769 pollution. However, the renaming symbols themselves do not
6770 have this prefix, so we need to skip this prefix if present. */
6771 if (function_name_len
> 5 /* "_ada_" */
6772 && strstr (function_name
, "_ada_") == function_name
)
6773 function_name
= function_name
+ 5;
6775 rename
= (char *) alloca (rename_len
* sizeof (char));
6776 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6780 const int rename_len
= strlen (name
) + 6;
6781 rename
= (char *) alloca (rename_len
* sizeof (char));
6782 sprintf (rename
, "%s___XR", name
);
6785 return ada_find_any_symbol (rename
);
6788 /* Because of GNAT encoding conventions, several GDB symbols may match a
6789 given type name. If the type denoted by TYPE0 is to be preferred to
6790 that of TYPE1 for purposes of type printing, return non-zero;
6791 otherwise return 0. */
6794 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6798 else if (type0
== NULL
)
6800 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6802 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6804 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6806 else if (ada_is_packed_array_type (type0
))
6808 else if (ada_is_array_descriptor_type (type0
)
6809 && !ada_is_array_descriptor_type (type1
))
6813 const char *type0_name
= type_name_no_tag (type0
);
6814 const char *type1_name
= type_name_no_tag (type1
);
6816 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6817 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6823 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6824 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6827 ada_type_name (struct type
*type
)
6831 else if (TYPE_NAME (type
) != NULL
)
6832 return TYPE_NAME (type
);
6834 return TYPE_TAG_NAME (type
);
6837 /* Find a parallel type to TYPE whose name is formed by appending
6838 SUFFIX to the name of TYPE. */
6841 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6844 static size_t name_len
= 0;
6846 char *typename
= ada_type_name (type
);
6848 if (typename
== NULL
)
6851 len
= strlen (typename
);
6853 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6855 strcpy (name
, typename
);
6856 strcpy (name
+ len
, suffix
);
6858 return ada_find_any_type (name
);
6862 /* If TYPE is a variable-size record type, return the corresponding template
6863 type describing its fields. Otherwise, return NULL. */
6865 static struct type
*
6866 dynamic_template_type (struct type
*type
)
6868 type
= ada_check_typedef (type
);
6870 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6871 || ada_type_name (type
) == NULL
)
6875 int len
= strlen (ada_type_name (type
));
6876 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6879 return ada_find_parallel_type (type
, "___XVE");
6883 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6884 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6887 is_dynamic_field (struct type
*templ_type
, int field_num
)
6889 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6891 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6892 && strstr (name
, "___XVL") != NULL
;
6895 /* The index of the variant field of TYPE, or -1 if TYPE does not
6896 represent a variant record type. */
6899 variant_field_index (struct type
*type
)
6903 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6906 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6908 if (ada_is_variant_part (type
, f
))
6914 /* A record type with no fields. */
6916 static struct type
*
6917 empty_record (struct objfile
*objfile
)
6919 struct type
*type
= alloc_type (objfile
);
6920 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6921 TYPE_NFIELDS (type
) = 0;
6922 TYPE_FIELDS (type
) = NULL
;
6923 TYPE_NAME (type
) = "<empty>";
6924 TYPE_TAG_NAME (type
) = NULL
;
6925 TYPE_FLAGS (type
) = 0;
6926 TYPE_LENGTH (type
) = 0;
6930 /* An ordinary record type (with fixed-length fields) that describes
6931 the value of type TYPE at VALADDR or ADDRESS (see comments at
6932 the beginning of this section) VAL according to GNAT conventions.
6933 DVAL0 should describe the (portion of a) record that contains any
6934 necessary discriminants. It should be NULL if value_type (VAL) is
6935 an outer-level type (i.e., as opposed to a branch of a variant.) A
6936 variant field (unless unchecked) is replaced by a particular branch
6939 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6940 length are not statically known are discarded. As a consequence,
6941 VALADDR, ADDRESS and DVAL0 are ignored.
6943 NOTE: Limitations: For now, we assume that dynamic fields and
6944 variants occupy whole numbers of bytes. However, they need not be
6948 ada_template_to_fixed_record_type_1 (struct type
*type
,
6949 const gdb_byte
*valaddr
,
6950 CORE_ADDR address
, struct value
*dval0
,
6951 int keep_dynamic_fields
)
6953 struct value
*mark
= value_mark ();
6956 int nfields
, bit_len
;
6959 int fld_bit_len
, bit_incr
;
6962 /* Compute the number of fields in this record type that are going
6963 to be processed: unless keep_dynamic_fields, this includes only
6964 fields whose position and length are static will be processed. */
6965 if (keep_dynamic_fields
)
6966 nfields
= TYPE_NFIELDS (type
);
6970 while (nfields
< TYPE_NFIELDS (type
)
6971 && !ada_is_variant_part (type
, nfields
)
6972 && !is_dynamic_field (type
, nfields
))
6976 rtype
= alloc_type (TYPE_OBJFILE (type
));
6977 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6978 INIT_CPLUS_SPECIFIC (rtype
);
6979 TYPE_NFIELDS (rtype
) = nfields
;
6980 TYPE_FIELDS (rtype
) = (struct field
*)
6981 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6982 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6983 TYPE_NAME (rtype
) = ada_type_name (type
);
6984 TYPE_TAG_NAME (rtype
) = NULL
;
6985 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
6991 for (f
= 0; f
< nfields
; f
+= 1)
6993 off
= align_value (off
, field_alignment (type
, f
))
6994 + TYPE_FIELD_BITPOS (type
, f
);
6995 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6996 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6998 if (ada_is_variant_part (type
, f
))
7001 fld_bit_len
= bit_incr
= 0;
7003 else if (is_dynamic_field (type
, f
))
7006 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7010 /* Get the fixed type of the field. Note that, in this case, we
7011 do not want to get the real type out of the tag: if the current
7012 field is the parent part of a tagged record, we will get the
7013 tag of the object. Clearly wrong: the real type of the parent
7014 is not the real type of the child. We would end up in an infinite
7016 TYPE_FIELD_TYPE (rtype
, f
) =
7019 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
7020 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7021 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
7022 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7023 bit_incr
= fld_bit_len
=
7024 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
7028 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
7029 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
7030 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
7031 bit_incr
= fld_bit_len
=
7032 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
7034 bit_incr
= fld_bit_len
=
7035 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
7037 if (off
+ fld_bit_len
> bit_len
)
7038 bit_len
= off
+ fld_bit_len
;
7040 TYPE_LENGTH (rtype
) =
7041 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7044 /* We handle the variant part, if any, at the end because of certain
7045 odd cases in which it is re-ordered so as NOT the last field of
7046 the record. This can happen in the presence of representation
7048 if (variant_field
>= 0)
7050 struct type
*branch_type
;
7052 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
7055 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
7060 to_fixed_variant_branch_type
7061 (TYPE_FIELD_TYPE (type
, variant_field
),
7062 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
7063 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
7064 if (branch_type
== NULL
)
7066 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
7067 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7068 TYPE_NFIELDS (rtype
) -= 1;
7072 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7073 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7075 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
7077 if (off
+ fld_bit_len
> bit_len
)
7078 bit_len
= off
+ fld_bit_len
;
7079 TYPE_LENGTH (rtype
) =
7080 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
7084 /* According to exp_dbug.ads, the size of TYPE for variable-size records
7085 should contain the alignment of that record, which should be a strictly
7086 positive value. If null or negative, then something is wrong, most
7087 probably in the debug info. In that case, we don't round up the size
7088 of the resulting type. If this record is not part of another structure,
7089 the current RTYPE length might be good enough for our purposes. */
7090 if (TYPE_LENGTH (type
) <= 0)
7092 if (TYPE_NAME (rtype
))
7093 warning (_("Invalid type size for `%s' detected: %d."),
7094 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
7096 warning (_("Invalid type size for <unnamed> detected: %d."),
7097 TYPE_LENGTH (type
));
7101 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
7102 TYPE_LENGTH (type
));
7105 value_free_to_mark (mark
);
7106 if (TYPE_LENGTH (rtype
) > varsize_limit
)
7107 error (_("record type with dynamic size is larger than varsize-limit"));
7111 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
7114 static struct type
*
7115 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
7116 CORE_ADDR address
, struct value
*dval0
)
7118 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7122 /* An ordinary record type in which ___XVL-convention fields and
7123 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7124 static approximations, containing all possible fields. Uses
7125 no runtime values. Useless for use in values, but that's OK,
7126 since the results are used only for type determinations. Works on both
7127 structs and unions. Representation note: to save space, we memorize
7128 the result of this function in the TYPE_TARGET_TYPE of the
7131 static struct type
*
7132 template_to_static_fixed_type (struct type
*type0
)
7138 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7139 return TYPE_TARGET_TYPE (type0
);
7141 nfields
= TYPE_NFIELDS (type0
);
7144 for (f
= 0; f
< nfields
; f
+= 1)
7146 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7147 struct type
*new_type
;
7149 if (is_dynamic_field (type0
, f
))
7150 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7152 new_type
= static_unwrap_type (field_type
);
7153 if (type
== type0
&& new_type
!= field_type
)
7155 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
7156 TYPE_CODE (type
) = TYPE_CODE (type0
);
7157 INIT_CPLUS_SPECIFIC (type
);
7158 TYPE_NFIELDS (type
) = nfields
;
7159 TYPE_FIELDS (type
) = (struct field
*)
7160 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7161 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7162 sizeof (struct field
) * nfields
);
7163 TYPE_NAME (type
) = ada_type_name (type0
);
7164 TYPE_TAG_NAME (type
) = NULL
;
7165 TYPE_FLAGS (type
) |= TYPE_FLAG_FIXED_INSTANCE
;
7166 TYPE_LENGTH (type
) = 0;
7168 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7169 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7174 /* Given an object of type TYPE whose contents are at VALADDR and
7175 whose address in memory is ADDRESS, returns a revision of TYPE --
7176 a non-dynamic-sized record with a variant part -- in which
7177 the variant part is replaced with the appropriate branch. Looks
7178 for discriminant values in DVAL0, which can be NULL if the record
7179 contains the necessary discriminant values. */
7181 static struct type
*
7182 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7183 CORE_ADDR address
, struct value
*dval0
)
7185 struct value
*mark
= value_mark ();
7188 struct type
*branch_type
;
7189 int nfields
= TYPE_NFIELDS (type
);
7190 int variant_field
= variant_field_index (type
);
7192 if (variant_field
== -1)
7196 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7200 rtype
= alloc_type (TYPE_OBJFILE (type
));
7201 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7202 INIT_CPLUS_SPECIFIC (rtype
);
7203 TYPE_NFIELDS (rtype
) = nfields
;
7204 TYPE_FIELDS (rtype
) =
7205 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7206 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7207 sizeof (struct field
) * nfields
);
7208 TYPE_NAME (rtype
) = ada_type_name (type
);
7209 TYPE_TAG_NAME (rtype
) = NULL
;
7210 TYPE_FLAGS (rtype
) |= TYPE_FLAG_FIXED_INSTANCE
;
7211 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7213 branch_type
= to_fixed_variant_branch_type
7214 (TYPE_FIELD_TYPE (type
, variant_field
),
7215 cond_offset_host (valaddr
,
7216 TYPE_FIELD_BITPOS (type
, variant_field
)
7218 cond_offset_target (address
,
7219 TYPE_FIELD_BITPOS (type
, variant_field
)
7220 / TARGET_CHAR_BIT
), dval
);
7221 if (branch_type
== NULL
)
7224 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7225 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7226 TYPE_NFIELDS (rtype
) -= 1;
7230 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7231 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7232 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7233 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7235 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7237 value_free_to_mark (mark
);
7241 /* An ordinary record type (with fixed-length fields) that describes
7242 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7243 beginning of this section]. Any necessary discriminants' values
7244 should be in DVAL, a record value; it may be NULL if the object
7245 at ADDR itself contains any necessary discriminant values.
7246 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7247 values from the record are needed. Except in the case that DVAL,
7248 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7249 unchecked) is replaced by a particular branch of the variant.
7251 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7252 is questionable and may be removed. It can arise during the
7253 processing of an unconstrained-array-of-record type where all the
7254 variant branches have exactly the same size. This is because in
7255 such cases, the compiler does not bother to use the XVS convention
7256 when encoding the record. I am currently dubious of this
7257 shortcut and suspect the compiler should be altered. FIXME. */
7259 static struct type
*
7260 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7261 CORE_ADDR address
, struct value
*dval
)
7263 struct type
*templ_type
;
7265 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7268 templ_type
= dynamic_template_type (type0
);
7270 if (templ_type
!= NULL
)
7271 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7272 else if (variant_field_index (type0
) >= 0)
7274 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7276 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7281 TYPE_FLAGS (type0
) |= TYPE_FLAG_FIXED_INSTANCE
;
7287 /* An ordinary record type (with fixed-length fields) that describes
7288 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7289 union type. Any necessary discriminants' values should be in DVAL,
7290 a record value. That is, this routine selects the appropriate
7291 branch of the union at ADDR according to the discriminant value
7292 indicated in the union's type name. */
7294 static struct type
*
7295 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7296 CORE_ADDR address
, struct value
*dval
)
7299 struct type
*templ_type
;
7300 struct type
*var_type
;
7302 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7303 var_type
= TYPE_TARGET_TYPE (var_type0
);
7305 var_type
= var_type0
;
7307 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7309 if (templ_type
!= NULL
)
7310 var_type
= templ_type
;
7313 ada_which_variant_applies (var_type
,
7314 value_type (dval
), value_contents (dval
));
7317 return empty_record (TYPE_OBJFILE (var_type
));
7318 else if (is_dynamic_field (var_type
, which
))
7319 return to_fixed_record_type
7320 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7321 valaddr
, address
, dval
);
7322 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7324 to_fixed_record_type
7325 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7327 return TYPE_FIELD_TYPE (var_type
, which
);
7330 /* Assuming that TYPE0 is an array type describing the type of a value
7331 at ADDR, and that DVAL describes a record containing any
7332 discriminants used in TYPE0, returns a type for the value that
7333 contains no dynamic components (that is, no components whose sizes
7334 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7335 true, gives an error message if the resulting type's size is over
7338 static struct type
*
7339 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7342 struct type
*index_type_desc
;
7343 struct type
*result
;
7345 if (ada_is_packed_array_type (type0
) /* revisit? */
7346 || (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
))
7349 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7350 if (index_type_desc
== NULL
)
7352 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7353 /* NOTE: elt_type---the fixed version of elt_type0---should never
7354 depend on the contents of the array in properly constructed
7356 /* Create a fixed version of the array element type.
7357 We're not providing the address of an element here,
7358 and thus the actual object value cannot be inspected to do
7359 the conversion. This should not be a problem, since arrays of
7360 unconstrained objects are not allowed. In particular, all
7361 the elements of an array of a tagged type should all be of
7362 the same type specified in the debugging info. No need to
7363 consult the object tag. */
7364 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7366 if (elt_type0
== elt_type
)
7369 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7370 elt_type
, TYPE_INDEX_TYPE (type0
));
7375 struct type
*elt_type0
;
7378 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7379 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7381 /* NOTE: result---the fixed version of elt_type0---should never
7382 depend on the contents of the array in properly constructed
7384 /* Create a fixed version of the array element type.
7385 We're not providing the address of an element here,
7386 and thus the actual object value cannot be inspected to do
7387 the conversion. This should not be a problem, since arrays of
7388 unconstrained objects are not allowed. In particular, all
7389 the elements of an array of a tagged type should all be of
7390 the same type specified in the debugging info. No need to
7391 consult the object tag. */
7393 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7394 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7396 struct type
*range_type
=
7397 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7398 dval
, TYPE_OBJFILE (type0
));
7399 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7400 result
, range_type
);
7402 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7403 error (_("array type with dynamic size is larger than varsize-limit"));
7406 TYPE_FLAGS (result
) |= TYPE_FLAG_FIXED_INSTANCE
;
7411 /* A standard type (containing no dynamically sized components)
7412 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7413 DVAL describes a record containing any discriminants used in TYPE0,
7414 and may be NULL if there are none, or if the object of type TYPE at
7415 ADDRESS or in VALADDR contains these discriminants.
7417 If CHECK_TAG is not null, in the case of tagged types, this function
7418 attempts to locate the object's tag and use it to compute the actual
7419 type. However, when ADDRESS is null, we cannot use it to determine the
7420 location of the tag, and therefore compute the tagged type's actual type.
7421 So we return the tagged type without consulting the tag. */
7423 static struct type
*
7424 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7425 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7427 type
= ada_check_typedef (type
);
7428 switch (TYPE_CODE (type
))
7432 case TYPE_CODE_STRUCT
:
7434 struct type
*static_type
= to_static_fixed_type (type
);
7435 struct type
*fixed_record_type
=
7436 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7437 /* If STATIC_TYPE is a tagged type and we know the object's address,
7438 then we can determine its tag, and compute the object's actual
7439 type from there. Note that we have to use the fixed record
7440 type (the parent part of the record may have dynamic fields
7441 and the way the location of _tag is expressed may depend on
7444 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7446 struct type
*real_type
=
7447 type_from_tag (value_tag_from_contents_and_address
7451 if (real_type
!= NULL
)
7452 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7454 return fixed_record_type
;
7456 case TYPE_CODE_ARRAY
:
7457 return to_fixed_array_type (type
, dval
, 1);
7458 case TYPE_CODE_UNION
:
7462 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7466 /* The same as ada_to_fixed_type_1, except that it preserves the type
7467 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7468 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7471 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7472 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7475 struct type
*fixed_type
=
7476 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7478 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7479 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7485 /* A standard (static-sized) type corresponding as well as possible to
7486 TYPE0, but based on no runtime data. */
7488 static struct type
*
7489 to_static_fixed_type (struct type
*type0
)
7496 if (TYPE_FLAGS (type0
) & TYPE_FLAG_FIXED_INSTANCE
)
7499 type0
= ada_check_typedef (type0
);
7501 switch (TYPE_CODE (type0
))
7505 case TYPE_CODE_STRUCT
:
7506 type
= dynamic_template_type (type0
);
7508 return template_to_static_fixed_type (type
);
7510 return template_to_static_fixed_type (type0
);
7511 case TYPE_CODE_UNION
:
7512 type
= ada_find_parallel_type (type0
, "___XVU");
7514 return template_to_static_fixed_type (type
);
7516 return template_to_static_fixed_type (type0
);
7520 /* A static approximation of TYPE with all type wrappers removed. */
7522 static struct type
*
7523 static_unwrap_type (struct type
*type
)
7525 if (ada_is_aligner_type (type
))
7527 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7528 if (ada_type_name (type1
) == NULL
)
7529 TYPE_NAME (type1
) = ada_type_name (type
);
7531 return static_unwrap_type (type1
);
7535 struct type
*raw_real_type
= ada_get_base_type (type
);
7536 if (raw_real_type
== type
)
7539 return to_static_fixed_type (raw_real_type
);
7543 /* In some cases, incomplete and private types require
7544 cross-references that are not resolved as records (for example,
7546 type FooP is access Foo;
7548 type Foo is array ...;
7549 ). In these cases, since there is no mechanism for producing
7550 cross-references to such types, we instead substitute for FooP a
7551 stub enumeration type that is nowhere resolved, and whose tag is
7552 the name of the actual type. Call these types "non-record stubs". */
7554 /* A type equivalent to TYPE that is not a non-record stub, if one
7555 exists, otherwise TYPE. */
7558 ada_check_typedef (struct type
*type
)
7563 CHECK_TYPEDEF (type
);
7564 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7565 || !TYPE_STUB (type
)
7566 || TYPE_TAG_NAME (type
) == NULL
)
7570 char *name
= TYPE_TAG_NAME (type
);
7571 struct type
*type1
= ada_find_any_type (name
);
7572 return (type1
== NULL
) ? type
: type1
;
7576 /* A value representing the data at VALADDR/ADDRESS as described by
7577 type TYPE0, but with a standard (static-sized) type that correctly
7578 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7579 type, then return VAL0 [this feature is simply to avoid redundant
7580 creation of struct values]. */
7582 static struct value
*
7583 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7586 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7587 if (type
== type0
&& val0
!= NULL
)
7590 return value_from_contents_and_address (type
, 0, address
);
7593 /* A value representing VAL, but with a standard (static-sized) type
7594 that correctly describes it. Does not necessarily create a new
7597 static struct value
*
7598 ada_to_fixed_value (struct value
*val
)
7600 return ada_to_fixed_value_create (value_type (val
),
7601 VALUE_ADDRESS (val
) + value_offset (val
),
7605 /* A value representing VAL, but with a standard (static-sized) type
7606 chosen to approximate the real type of VAL as well as possible, but
7607 without consulting any runtime values. For Ada dynamic-sized
7608 types, therefore, the type of the result is likely to be inaccurate. */
7611 ada_to_static_fixed_value (struct value
*val
)
7614 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7615 if (type
== value_type (val
))
7618 return coerce_unspec_val_to_type (val
, type
);
7624 /* Table mapping attribute numbers to names.
7625 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7627 static const char *attribute_names
[] = {
7645 ada_attribute_name (enum exp_opcode n
)
7647 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7648 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7650 return attribute_names
[0];
7653 /* Evaluate the 'POS attribute applied to ARG. */
7656 pos_atr (struct value
*arg
)
7658 struct type
*type
= value_type (arg
);
7660 if (!discrete_type_p (type
))
7661 error (_("'POS only defined on discrete types"));
7663 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7666 LONGEST v
= value_as_long (arg
);
7668 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7670 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7673 error (_("enumeration value is invalid: can't find 'POS"));
7676 return value_as_long (arg
);
7679 static struct value
*
7680 value_pos_atr (struct value
*arg
)
7682 return value_from_longest (builtin_type_int
, pos_atr (arg
));
7685 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7687 static struct value
*
7688 value_val_atr (struct type
*type
, struct value
*arg
)
7690 if (!discrete_type_p (type
))
7691 error (_("'VAL only defined on discrete types"));
7692 if (!integer_type_p (value_type (arg
)))
7693 error (_("'VAL requires integral argument"));
7695 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7697 long pos
= value_as_long (arg
);
7698 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7699 error (_("argument to 'VAL out of range"));
7700 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7703 return value_from_longest (type
, value_as_long (arg
));
7709 /* True if TYPE appears to be an Ada character type.
7710 [At the moment, this is true only for Character and Wide_Character;
7711 It is a heuristic test that could stand improvement]. */
7714 ada_is_character_type (struct type
*type
)
7718 /* If the type code says it's a character, then assume it really is,
7719 and don't check any further. */
7720 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7723 /* Otherwise, assume it's a character type iff it is a discrete type
7724 with a known character type name. */
7725 name
= ada_type_name (type
);
7726 return (name
!= NULL
7727 && (TYPE_CODE (type
) == TYPE_CODE_INT
7728 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7729 && (strcmp (name
, "character") == 0
7730 || strcmp (name
, "wide_character") == 0
7731 || strcmp (name
, "wide_wide_character") == 0
7732 || strcmp (name
, "unsigned char") == 0));
7735 /* True if TYPE appears to be an Ada string type. */
7738 ada_is_string_type (struct type
*type
)
7740 type
= ada_check_typedef (type
);
7742 && TYPE_CODE (type
) != TYPE_CODE_PTR
7743 && (ada_is_simple_array_type (type
)
7744 || ada_is_array_descriptor_type (type
))
7745 && ada_array_arity (type
) == 1)
7747 struct type
*elttype
= ada_array_element_type (type
, 1);
7749 return ada_is_character_type (elttype
);
7756 /* True if TYPE is a struct type introduced by the compiler to force the
7757 alignment of a value. Such types have a single field with a
7758 distinctive name. */
7761 ada_is_aligner_type (struct type
*type
)
7763 type
= ada_check_typedef (type
);
7765 /* If we can find a parallel XVS type, then the XVS type should
7766 be used instead of this type. And hence, this is not an aligner
7768 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7771 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7772 && TYPE_NFIELDS (type
) == 1
7773 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7776 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7777 the parallel type. */
7780 ada_get_base_type (struct type
*raw_type
)
7782 struct type
*real_type_namer
;
7783 struct type
*raw_real_type
;
7785 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7788 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7789 if (real_type_namer
== NULL
7790 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7791 || TYPE_NFIELDS (real_type_namer
) != 1)
7794 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7795 if (raw_real_type
== NULL
)
7798 return raw_real_type
;
7801 /* The type of value designated by TYPE, with all aligners removed. */
7804 ada_aligned_type (struct type
*type
)
7806 if (ada_is_aligner_type (type
))
7807 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7809 return ada_get_base_type (type
);
7813 /* The address of the aligned value in an object at address VALADDR
7814 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7817 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7819 if (ada_is_aligner_type (type
))
7820 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7822 TYPE_FIELD_BITPOS (type
,
7823 0) / TARGET_CHAR_BIT
);
7830 /* The printed representation of an enumeration literal with encoded
7831 name NAME. The value is good to the next call of ada_enum_name. */
7833 ada_enum_name (const char *name
)
7835 static char *result
;
7836 static size_t result_len
= 0;
7839 /* First, unqualify the enumeration name:
7840 1. Search for the last '.' character. If we find one, then skip
7841 all the preceeding characters, the unqualified name starts
7842 right after that dot.
7843 2. Otherwise, we may be debugging on a target where the compiler
7844 translates dots into "__". Search forward for double underscores,
7845 but stop searching when we hit an overloading suffix, which is
7846 of the form "__" followed by digits. */
7848 tmp
= strrchr (name
, '.');
7853 while ((tmp
= strstr (name
, "__")) != NULL
)
7855 if (isdigit (tmp
[2]))
7865 if (name
[1] == 'U' || name
[1] == 'W')
7867 if (sscanf (name
+ 2, "%x", &v
) != 1)
7873 GROW_VECT (result
, result_len
, 16);
7874 if (isascii (v
) && isprint (v
))
7875 sprintf (result
, "'%c'", v
);
7876 else if (name
[1] == 'U')
7877 sprintf (result
, "[\"%02x\"]", v
);
7879 sprintf (result
, "[\"%04x\"]", v
);
7885 tmp
= strstr (name
, "__");
7887 tmp
= strstr (name
, "$");
7890 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7891 strncpy (result
, name
, tmp
- name
);
7892 result
[tmp
- name
] = '\0';
7900 static struct value
*
7901 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7904 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7905 (expect_type
, exp
, pos
, noside
);
7908 /* Evaluate the subexpression of EXP starting at *POS as for
7909 evaluate_type, updating *POS to point just past the evaluated
7912 static struct value
*
7913 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7915 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7916 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7919 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7922 static struct value
*
7923 unwrap_value (struct value
*val
)
7925 struct type
*type
= ada_check_typedef (value_type (val
));
7926 if (ada_is_aligner_type (type
))
7928 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7929 struct type
*val_type
= ada_check_typedef (value_type (v
));
7930 if (ada_type_name (val_type
) == NULL
)
7931 TYPE_NAME (val_type
) = ada_type_name (type
);
7933 return unwrap_value (v
);
7937 struct type
*raw_real_type
=
7938 ada_check_typedef (ada_get_base_type (type
));
7940 if (type
== raw_real_type
)
7944 coerce_unspec_val_to_type
7945 (val
, ada_to_fixed_type (raw_real_type
, 0,
7946 VALUE_ADDRESS (val
) + value_offset (val
),
7951 static struct value
*
7952 cast_to_fixed (struct type
*type
, struct value
*arg
)
7956 if (type
== value_type (arg
))
7958 else if (ada_is_fixed_point_type (value_type (arg
)))
7959 val
= ada_float_to_fixed (type
,
7960 ada_fixed_to_float (value_type (arg
),
7961 value_as_long (arg
)));
7965 value_as_double (value_cast (builtin_type_double
, value_copy (arg
)));
7966 val
= ada_float_to_fixed (type
, argd
);
7969 return value_from_longest (type
, val
);
7972 static struct value
*
7973 cast_from_fixed_to_double (struct value
*arg
)
7975 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7976 value_as_long (arg
));
7977 return value_from_double (builtin_type_double
, val
);
7980 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7981 return the converted value. */
7983 static struct value
*
7984 coerce_for_assign (struct type
*type
, struct value
*val
)
7986 struct type
*type2
= value_type (val
);
7990 type2
= ada_check_typedef (type2
);
7991 type
= ada_check_typedef (type
);
7993 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7994 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7996 val
= ada_value_ind (val
);
7997 type2
= value_type (val
);
8000 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
8001 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
8003 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
8004 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
8005 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
8006 error (_("Incompatible types in assignment"));
8007 deprecated_set_value_type (val
, type
);
8012 static struct value
*
8013 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
8016 struct type
*type1
, *type2
;
8019 arg1
= coerce_ref (arg1
);
8020 arg2
= coerce_ref (arg2
);
8021 type1
= base_type (ada_check_typedef (value_type (arg1
)));
8022 type2
= base_type (ada_check_typedef (value_type (arg2
)));
8024 if (TYPE_CODE (type1
) != TYPE_CODE_INT
8025 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
8026 return value_binop (arg1
, arg2
, op
);
8035 return value_binop (arg1
, arg2
, op
);
8038 v2
= value_as_long (arg2
);
8040 error (_("second operand of %s must not be zero."), op_string (op
));
8042 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
8043 return value_binop (arg1
, arg2
, op
);
8045 v1
= value_as_long (arg1
);
8050 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
8051 v
+= v
> 0 ? -1 : 1;
8059 /* Should not reach this point. */
8063 val
= allocate_value (type1
);
8064 store_unsigned_integer (value_contents_raw (val
),
8065 TYPE_LENGTH (value_type (val
)), v
);
8070 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
8072 if (ada_is_direct_array_type (value_type (arg1
))
8073 || ada_is_direct_array_type (value_type (arg2
)))
8075 /* Automatically dereference any array reference before
8076 we attempt to perform the comparison. */
8077 arg1
= ada_coerce_ref (arg1
);
8078 arg2
= ada_coerce_ref (arg2
);
8080 arg1
= ada_coerce_to_simple_array (arg1
);
8081 arg2
= ada_coerce_to_simple_array (arg2
);
8082 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8083 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8084 error (_("Attempt to compare array with non-array"));
8085 /* FIXME: The following works only for types whose
8086 representations use all bits (no padding or undefined bits)
8087 and do not have user-defined equality. */
8089 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8090 && memcmp (value_contents (arg1
), value_contents (arg2
),
8091 TYPE_LENGTH (value_type (arg1
))) == 0;
8093 return value_equal (arg1
, arg2
);
8096 /* Total number of component associations in the aggregate starting at
8097 index PC in EXP. Assumes that index PC is the start of an
8101 num_component_specs (struct expression
*exp
, int pc
)
8104 m
= exp
->elts
[pc
+ 1].longconst
;
8107 for (i
= 0; i
< m
; i
+= 1)
8109 switch (exp
->elts
[pc
].opcode
)
8115 n
+= exp
->elts
[pc
+ 1].longconst
;
8118 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8123 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8124 component of LHS (a simple array or a record), updating *POS past
8125 the expression, assuming that LHS is contained in CONTAINER. Does
8126 not modify the inferior's memory, nor does it modify LHS (unless
8127 LHS == CONTAINER). */
8130 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8131 struct expression
*exp
, int *pos
)
8133 struct value
*mark
= value_mark ();
8135 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8137 struct value
*index_val
= value_from_longest (builtin_type_int
, index
);
8138 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8142 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8143 elt
= ada_to_fixed_value (unwrap_value (elt
));
8146 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8147 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8149 value_assign_to_component (container
, elt
,
8150 ada_evaluate_subexp (NULL
, exp
, pos
,
8153 value_free_to_mark (mark
);
8156 /* Assuming that LHS represents an lvalue having a record or array
8157 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8158 of that aggregate's value to LHS, advancing *POS past the
8159 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8160 lvalue containing LHS (possibly LHS itself). Does not modify
8161 the inferior's memory, nor does it modify the contents of
8162 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8164 static struct value
*
8165 assign_aggregate (struct value
*container
,
8166 struct value
*lhs
, struct expression
*exp
,
8167 int *pos
, enum noside noside
)
8169 struct type
*lhs_type
;
8170 int n
= exp
->elts
[*pos
+1].longconst
;
8171 LONGEST low_index
, high_index
;
8174 int max_indices
, num_indices
;
8175 int is_array_aggregate
;
8177 struct value
*mark
= value_mark ();
8180 if (noside
!= EVAL_NORMAL
)
8183 for (i
= 0; i
< n
; i
+= 1)
8184 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8188 container
= ada_coerce_ref (container
);
8189 if (ada_is_direct_array_type (value_type (container
)))
8190 container
= ada_coerce_to_simple_array (container
);
8191 lhs
= ada_coerce_ref (lhs
);
8192 if (!deprecated_value_modifiable (lhs
))
8193 error (_("Left operand of assignment is not a modifiable lvalue."));
8195 lhs_type
= value_type (lhs
);
8196 if (ada_is_direct_array_type (lhs_type
))
8198 lhs
= ada_coerce_to_simple_array (lhs
);
8199 lhs_type
= value_type (lhs
);
8200 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8201 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8202 is_array_aggregate
= 1;
8204 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8207 high_index
= num_visible_fields (lhs_type
) - 1;
8208 is_array_aggregate
= 0;
8211 error (_("Left-hand side must be array or record."));
8213 num_specs
= num_component_specs (exp
, *pos
- 3);
8214 max_indices
= 4 * num_specs
+ 4;
8215 indices
= alloca (max_indices
* sizeof (indices
[0]));
8216 indices
[0] = indices
[1] = low_index
- 1;
8217 indices
[2] = indices
[3] = high_index
+ 1;
8220 for (i
= 0; i
< n
; i
+= 1)
8222 switch (exp
->elts
[*pos
].opcode
)
8225 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8226 &num_indices
, max_indices
,
8227 low_index
, high_index
);
8230 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8231 &num_indices
, max_indices
,
8232 low_index
, high_index
);
8236 error (_("Misplaced 'others' clause"));
8237 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8238 num_indices
, low_index
, high_index
);
8241 error (_("Internal error: bad aggregate clause"));
8248 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8249 construct at *POS, updating *POS past the construct, given that
8250 the positions are relative to lower bound LOW, where HIGH is the
8251 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8252 updating *NUM_INDICES as needed. CONTAINER is as for
8253 assign_aggregate. */
8255 aggregate_assign_positional (struct value
*container
,
8256 struct value
*lhs
, struct expression
*exp
,
8257 int *pos
, LONGEST
*indices
, int *num_indices
,
8258 int max_indices
, LONGEST low
, LONGEST high
)
8260 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8262 if (ind
- 1 == high
)
8263 warning (_("Extra components in aggregate ignored."));
8266 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8268 assign_component (container
, lhs
, ind
, exp
, pos
);
8271 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8274 /* Assign into the components of LHS indexed by the OP_CHOICES
8275 construct at *POS, updating *POS past the construct, given that
8276 the allowable indices are LOW..HIGH. Record the indices assigned
8277 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8278 needed. CONTAINER is as for assign_aggregate. */
8280 aggregate_assign_from_choices (struct value
*container
,
8281 struct value
*lhs
, struct expression
*exp
,
8282 int *pos
, LONGEST
*indices
, int *num_indices
,
8283 int max_indices
, LONGEST low
, LONGEST high
)
8286 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8287 int choice_pos
, expr_pc
;
8288 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8290 choice_pos
= *pos
+= 3;
8292 for (j
= 0; j
< n_choices
; j
+= 1)
8293 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8295 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8297 for (j
= 0; j
< n_choices
; j
+= 1)
8299 LONGEST lower
, upper
;
8300 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8301 if (op
== OP_DISCRETE_RANGE
)
8304 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8306 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8311 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8322 name
= &exp
->elts
[choice_pos
+ 2].string
;
8325 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8328 error (_("Invalid record component association."));
8330 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8332 if (! find_struct_field (name
, value_type (lhs
), 0,
8333 NULL
, NULL
, NULL
, NULL
, &ind
))
8334 error (_("Unknown component name: %s."), name
);
8335 lower
= upper
= ind
;
8338 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8339 error (_("Index in component association out of bounds."));
8341 add_component_interval (lower
, upper
, indices
, num_indices
,
8343 while (lower
<= upper
)
8347 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8353 /* Assign the value of the expression in the OP_OTHERS construct in
8354 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8355 have not been previously assigned. The index intervals already assigned
8356 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8357 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8359 aggregate_assign_others (struct value
*container
,
8360 struct value
*lhs
, struct expression
*exp
,
8361 int *pos
, LONGEST
*indices
, int num_indices
,
8362 LONGEST low
, LONGEST high
)
8365 int expr_pc
= *pos
+1;
8367 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8370 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8374 assign_component (container
, lhs
, ind
, exp
, &pos
);
8377 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8380 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8381 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8382 modifying *SIZE as needed. It is an error if *SIZE exceeds
8383 MAX_SIZE. The resulting intervals do not overlap. */
8385 add_component_interval (LONGEST low
, LONGEST high
,
8386 LONGEST
* indices
, int *size
, int max_size
)
8389 for (i
= 0; i
< *size
; i
+= 2) {
8390 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8393 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8394 if (high
< indices
[kh
])
8396 if (low
< indices
[i
])
8398 indices
[i
+ 1] = indices
[kh
- 1];
8399 if (high
> indices
[i
+ 1])
8400 indices
[i
+ 1] = high
;
8401 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8402 *size
-= kh
- i
- 2;
8405 else if (high
< indices
[i
])
8409 if (*size
== max_size
)
8410 error (_("Internal error: miscounted aggregate components."));
8412 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8413 indices
[j
] = indices
[j
- 2];
8415 indices
[i
+ 1] = high
;
8418 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8421 static struct value
*
8422 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8424 if (type
== ada_check_typedef (value_type (arg2
)))
8427 if (ada_is_fixed_point_type (type
))
8428 return (cast_to_fixed (type
, arg2
));
8430 if (ada_is_fixed_point_type (value_type (arg2
)))
8431 return value_cast (type
, cast_from_fixed_to_double (arg2
));
8433 return value_cast (type
, arg2
);
8436 static struct value
*
8437 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8438 int *pos
, enum noside noside
)
8441 int tem
, tem2
, tem3
;
8443 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8446 struct value
**argvec
;
8450 op
= exp
->elts
[pc
].opcode
;
8456 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8457 arg1
= unwrap_value (arg1
);
8459 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8460 then we need to perform the conversion manually, because
8461 evaluate_subexp_standard doesn't do it. This conversion is
8462 necessary in Ada because the different kinds of float/fixed
8463 types in Ada have different representations.
8465 Similarly, we need to perform the conversion from OP_LONG
8467 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8468 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8474 struct value
*result
;
8476 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8477 /* The result type will have code OP_STRING, bashed there from
8478 OP_ARRAY. Bash it back. */
8479 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8480 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8486 type
= exp
->elts
[pc
+ 1].type
;
8487 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8488 if (noside
== EVAL_SKIP
)
8490 arg1
= ada_value_cast (type
, arg1
, noside
);
8495 type
= exp
->elts
[pc
+ 1].type
;
8496 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8499 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8500 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8502 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8503 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8505 return ada_value_assign (arg1
, arg1
);
8507 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8508 except if the lhs of our assignment is a convenience variable.
8509 In the case of assigning to a convenience variable, the lhs
8510 should be exactly the result of the evaluation of the rhs. */
8511 type
= value_type (arg1
);
8512 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8514 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8515 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8517 if (ada_is_fixed_point_type (value_type (arg1
)))
8518 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8519 else if (ada_is_fixed_point_type (value_type (arg2
)))
8521 (_("Fixed-point values must be assigned to fixed-point variables"));
8523 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8524 return ada_value_assign (arg1
, arg2
);
8527 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8528 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8529 if (noside
== EVAL_SKIP
)
8531 if ((ada_is_fixed_point_type (value_type (arg1
))
8532 || ada_is_fixed_point_type (value_type (arg2
)))
8533 && value_type (arg1
) != value_type (arg2
))
8534 error (_("Operands of fixed-point addition must have the same type"));
8535 /* Do the addition, and cast the result to the type of the first
8536 argument. We cannot cast the result to a reference type, so if
8537 ARG1 is a reference type, find its underlying type. */
8538 type
= value_type (arg1
);
8539 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8540 type
= TYPE_TARGET_TYPE (type
);
8541 return value_cast (type
, value_add (arg1
, arg2
));
8544 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8545 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8546 if (noside
== EVAL_SKIP
)
8548 if ((ada_is_fixed_point_type (value_type (arg1
))
8549 || ada_is_fixed_point_type (value_type (arg2
)))
8550 && value_type (arg1
) != value_type (arg2
))
8551 error (_("Operands of fixed-point subtraction must have the same type"));
8552 /* Do the substraction, and cast the result to the type of the first
8553 argument. We cannot cast the result to a reference type, so if
8554 ARG1 is a reference type, find its underlying type. */
8555 type
= value_type (arg1
);
8556 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8557 type
= TYPE_TARGET_TYPE (type
);
8558 return value_cast (type
, value_sub (arg1
, arg2
));
8562 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8563 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8564 if (noside
== EVAL_SKIP
)
8566 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8567 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8568 return value_zero (value_type (arg1
), not_lval
);
8571 if (ada_is_fixed_point_type (value_type (arg1
)))
8572 arg1
= cast_from_fixed_to_double (arg1
);
8573 if (ada_is_fixed_point_type (value_type (arg2
)))
8574 arg2
= cast_from_fixed_to_double (arg2
);
8575 return ada_value_binop (arg1
, arg2
, op
);
8580 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8581 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8582 if (noside
== EVAL_SKIP
)
8584 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8585 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8586 return value_zero (value_type (arg1
), not_lval
);
8588 return ada_value_binop (arg1
, arg2
, op
);
8591 case BINOP_NOTEQUAL
:
8592 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8593 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8594 if (noside
== EVAL_SKIP
)
8596 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8599 tem
= ada_value_equal (arg1
, arg2
);
8600 if (op
== BINOP_NOTEQUAL
)
8602 return value_from_longest (LA_BOOL_TYPE
, (LONGEST
) tem
);
8605 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8606 if (noside
== EVAL_SKIP
)
8608 else if (ada_is_fixed_point_type (value_type (arg1
)))
8609 return value_cast (value_type (arg1
), value_neg (arg1
));
8611 return value_neg (arg1
);
8613 case BINOP_LOGICAL_AND
:
8614 case BINOP_LOGICAL_OR
:
8615 case UNOP_LOGICAL_NOT
:
8620 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8621 return value_cast (LA_BOOL_TYPE
, val
);
8624 case BINOP_BITWISE_AND
:
8625 case BINOP_BITWISE_IOR
:
8626 case BINOP_BITWISE_XOR
:
8630 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8632 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8634 return value_cast (value_type (arg1
), val
);
8640 /* Tagged types are a little special in the fact that the real type
8641 is dynamic and can only be determined by inspecting the object
8642 value. So even if we're support to do an EVAL_AVOID_SIDE_EFFECTS
8643 evaluation, we force an EVAL_NORMAL evaluation for tagged types. */
8644 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8645 && ada_is_tagged_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
), 1))
8646 noside
= EVAL_NORMAL
;
8648 if (noside
== EVAL_SKIP
)
8653 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8654 /* Only encountered when an unresolved symbol occurs in a
8655 context other than a function call, in which case, it is
8657 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8658 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8659 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8663 (to_static_fixed_type
8664 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8670 unwrap_value (evaluate_subexp_standard
8671 (expect_type
, exp
, pos
, noside
));
8672 return ada_to_fixed_value (arg1
);
8678 /* Allocate arg vector, including space for the function to be
8679 called in argvec[0] and a terminating NULL. */
8680 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8682 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8684 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8685 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8686 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8687 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8690 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8691 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8694 if (noside
== EVAL_SKIP
)
8698 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8699 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8700 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8701 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8702 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8703 argvec
[0] = value_addr (argvec
[0]);
8705 type
= ada_check_typedef (value_type (argvec
[0]));
8706 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8708 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8710 case TYPE_CODE_FUNC
:
8711 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8713 case TYPE_CODE_ARRAY
:
8715 case TYPE_CODE_STRUCT
:
8716 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8717 argvec
[0] = ada_value_ind (argvec
[0]);
8718 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8721 error (_("cannot subscript or call something of type `%s'"),
8722 ada_type_name (value_type (argvec
[0])));
8727 switch (TYPE_CODE (type
))
8729 case TYPE_CODE_FUNC
:
8730 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8731 return allocate_value (TYPE_TARGET_TYPE (type
));
8732 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8733 case TYPE_CODE_STRUCT
:
8737 arity
= ada_array_arity (type
);
8738 type
= ada_array_element_type (type
, nargs
);
8740 error (_("cannot subscript or call a record"));
8742 error (_("wrong number of subscripts; expecting %d"), arity
);
8743 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8744 return value_zero (ada_aligned_type (type
), lval_memory
);
8746 unwrap_value (ada_value_subscript
8747 (argvec
[0], nargs
, argvec
+ 1));
8749 case TYPE_CODE_ARRAY
:
8750 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8752 type
= ada_array_element_type (type
, nargs
);
8754 error (_("element type of array unknown"));
8756 return value_zero (ada_aligned_type (type
), lval_memory
);
8759 unwrap_value (ada_value_subscript
8760 (ada_coerce_to_simple_array (argvec
[0]),
8761 nargs
, argvec
+ 1));
8762 case TYPE_CODE_PTR
: /* Pointer to array */
8763 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8764 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8766 type
= ada_array_element_type (type
, nargs
);
8768 error (_("element type of array unknown"));
8770 return value_zero (ada_aligned_type (type
), lval_memory
);
8773 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8774 nargs
, argvec
+ 1));
8777 error (_("Attempt to index or call something other than an "
8778 "array or function"));
8783 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8784 struct value
*low_bound_val
=
8785 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8786 struct value
*high_bound_val
=
8787 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8790 low_bound_val
= coerce_ref (low_bound_val
);
8791 high_bound_val
= coerce_ref (high_bound_val
);
8792 low_bound
= pos_atr (low_bound_val
);
8793 high_bound
= pos_atr (high_bound_val
);
8795 if (noside
== EVAL_SKIP
)
8798 /* If this is a reference to an aligner type, then remove all
8800 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8801 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8802 TYPE_TARGET_TYPE (value_type (array
)) =
8803 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8805 if (ada_is_packed_array_type (value_type (array
)))
8806 error (_("cannot slice a packed array"));
8808 /* If this is a reference to an array or an array lvalue,
8809 convert to a pointer. */
8810 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8811 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8812 && VALUE_LVAL (array
) == lval_memory
))
8813 array
= value_addr (array
);
8815 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8816 && ada_is_array_descriptor_type (ada_check_typedef
8817 (value_type (array
))))
8818 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8820 array
= ada_coerce_to_simple_array_ptr (array
);
8822 /* If we have more than one level of pointer indirection,
8823 dereference the value until we get only one level. */
8824 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8825 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8827 array
= value_ind (array
);
8829 /* Make sure we really do have an array type before going further,
8830 to avoid a SEGV when trying to get the index type or the target
8831 type later down the road if the debug info generated by
8832 the compiler is incorrect or incomplete. */
8833 if (!ada_is_simple_array_type (value_type (array
)))
8834 error (_("cannot take slice of non-array"));
8836 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8838 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8839 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8843 struct type
*arr_type0
=
8844 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8846 return ada_value_slice_ptr (array
, arr_type0
,
8847 longest_to_int (low_bound
),
8848 longest_to_int (high_bound
));
8851 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8853 else if (high_bound
< low_bound
)
8854 return empty_array (value_type (array
), low_bound
);
8856 return ada_value_slice (array
, longest_to_int (low_bound
),
8857 longest_to_int (high_bound
));
8862 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8863 type
= exp
->elts
[pc
+ 1].type
;
8865 if (noside
== EVAL_SKIP
)
8868 switch (TYPE_CODE (type
))
8871 lim_warning (_("Membership test incompletely implemented; "
8872 "always returns true"));
8873 return value_from_longest (builtin_type_int
, (LONGEST
) 1);
8875 case TYPE_CODE_RANGE
:
8876 arg2
= value_from_longest (builtin_type_int
, TYPE_LOW_BOUND (type
));
8877 arg3
= value_from_longest (builtin_type_int
,
8878 TYPE_HIGH_BOUND (type
));
8880 value_from_longest (builtin_type_int
,
8881 (value_less (arg1
, arg3
)
8882 || value_equal (arg1
, arg3
))
8883 && (value_less (arg2
, arg1
)
8884 || value_equal (arg2
, arg1
)));
8887 case BINOP_IN_BOUNDS
:
8889 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8890 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8892 if (noside
== EVAL_SKIP
)
8895 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8896 return value_zero (builtin_type_int
, not_lval
);
8898 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8900 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8901 error (_("invalid dimension number to 'range"));
8903 arg3
= ada_array_bound (arg2
, tem
, 1);
8904 arg2
= ada_array_bound (arg2
, tem
, 0);
8907 value_from_longest (builtin_type_int
,
8908 (value_less (arg1
, arg3
)
8909 || value_equal (arg1
, arg3
))
8910 && (value_less (arg2
, arg1
)
8911 || value_equal (arg2
, arg1
)));
8913 case TERNOP_IN_RANGE
:
8914 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8915 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8916 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8918 if (noside
== EVAL_SKIP
)
8922 value_from_longest (builtin_type_int
,
8923 (value_less (arg1
, arg3
)
8924 || value_equal (arg1
, arg3
))
8925 && (value_less (arg2
, arg1
)
8926 || value_equal (arg2
, arg1
)));
8932 struct type
*type_arg
;
8933 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8935 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8937 type_arg
= exp
->elts
[pc
+ 2].type
;
8941 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8945 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8946 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8947 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8950 if (noside
== EVAL_SKIP
)
8953 if (type_arg
== NULL
)
8955 arg1
= ada_coerce_ref (arg1
);
8957 if (ada_is_packed_array_type (value_type (arg1
)))
8958 arg1
= ada_coerce_to_simple_array (arg1
);
8960 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8961 error (_("invalid dimension number to '%s"),
8962 ada_attribute_name (op
));
8964 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8966 type
= ada_index_type (value_type (arg1
), tem
);
8969 (_("attempt to take bound of something that is not an array"));
8970 return allocate_value (type
);
8975 default: /* Should never happen. */
8976 error (_("unexpected attribute encountered"));
8978 return ada_array_bound (arg1
, tem
, 0);
8980 return ada_array_bound (arg1
, tem
, 1);
8982 return ada_array_length (arg1
, tem
);
8985 else if (discrete_type_p (type_arg
))
8987 struct type
*range_type
;
8988 char *name
= ada_type_name (type_arg
);
8990 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8992 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8993 if (range_type
== NULL
)
8994 range_type
= type_arg
;
8998 error (_("unexpected attribute encountered"));
9000 return discrete_type_low_bound (range_type
);
9002 return discrete_type_high_bound (range_type
);
9004 error (_("the 'length attribute applies only to array types"));
9007 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9008 error (_("unimplemented type attribute"));
9013 if (ada_is_packed_array_type (type_arg
))
9014 type_arg
= decode_packed_array_type (type_arg
);
9016 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
9017 error (_("invalid dimension number to '%s"),
9018 ada_attribute_name (op
));
9020 type
= ada_index_type (type_arg
, tem
);
9023 (_("attempt to take bound of something that is not an array"));
9024 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9025 return allocate_value (type
);
9030 error (_("unexpected attribute encountered"));
9032 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9033 return value_from_longest (type
, low
);
9035 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
9036 return value_from_longest (type
, high
);
9038 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9039 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
9040 return value_from_longest (type
, high
- low
+ 1);
9046 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9047 if (noside
== EVAL_SKIP
)
9050 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9051 return value_zero (ada_tag_type (arg1
), not_lval
);
9053 return ada_value_tag (arg1
);
9057 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9058 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9059 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9060 if (noside
== EVAL_SKIP
)
9062 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9063 return value_zero (value_type (arg1
), not_lval
);
9065 return value_binop (arg1
, arg2
,
9066 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9068 case OP_ATR_MODULUS
:
9070 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9071 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9073 if (noside
== EVAL_SKIP
)
9076 if (!ada_is_modular_type (type_arg
))
9077 error (_("'modulus must be applied to modular type"));
9079 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9080 ada_modulus (type_arg
));
9085 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9086 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9087 if (noside
== EVAL_SKIP
)
9089 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9090 return value_zero (builtin_type_int
, not_lval
);
9092 return value_pos_atr (arg1
);
9095 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9096 if (noside
== EVAL_SKIP
)
9098 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9099 return value_zero (builtin_type_int
, not_lval
);
9101 return value_from_longest (builtin_type_int
,
9103 * TYPE_LENGTH (value_type (arg1
)));
9106 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9107 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9108 type
= exp
->elts
[pc
+ 2].type
;
9109 if (noside
== EVAL_SKIP
)
9111 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9112 return value_zero (type
, not_lval
);
9114 return value_val_atr (type
, arg1
);
9117 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9118 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9119 if (noside
== EVAL_SKIP
)
9121 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9122 return value_zero (value_type (arg1
), not_lval
);
9124 return value_binop (arg1
, arg2
, op
);
9127 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9128 if (noside
== EVAL_SKIP
)
9134 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9135 if (noside
== EVAL_SKIP
)
9137 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9138 return value_neg (arg1
);
9143 if (expect_type
&& TYPE_CODE (expect_type
) == TYPE_CODE_PTR
)
9144 expect_type
= TYPE_TARGET_TYPE (ada_check_typedef (expect_type
));
9145 arg1
= evaluate_subexp (expect_type
, exp
, pos
, noside
);
9146 if (noside
== EVAL_SKIP
)
9148 type
= ada_check_typedef (value_type (arg1
));
9149 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9151 if (ada_is_array_descriptor_type (type
))
9152 /* GDB allows dereferencing GNAT array descriptors. */
9154 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9155 if (arrType
== NULL
)
9156 error (_("Attempt to dereference null array pointer."));
9157 return value_at_lazy (arrType
, 0);
9159 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9160 || TYPE_CODE (type
) == TYPE_CODE_REF
9161 /* In C you can dereference an array to get the 1st elt. */
9162 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9164 type
= to_static_fixed_type
9166 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9168 return value_zero (type
, lval_memory
);
9170 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9171 /* GDB allows dereferencing an int. */
9172 return value_zero (builtin_type_int
, lval_memory
);
9174 error (_("Attempt to take contents of a non-pointer value."));
9176 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9177 type
= ada_check_typedef (value_type (arg1
));
9179 if (ada_is_array_descriptor_type (type
))
9180 /* GDB allows dereferencing GNAT array descriptors. */
9181 return ada_coerce_to_simple_array (arg1
);
9183 return ada_value_ind (arg1
);
9185 case STRUCTOP_STRUCT
:
9186 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9187 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9188 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9189 if (noside
== EVAL_SKIP
)
9191 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9193 struct type
*type1
= value_type (arg1
);
9194 if (ada_is_tagged_type (type1
, 1))
9196 type
= ada_lookup_struct_elt_type (type1
,
9197 &exp
->elts
[pc
+ 2].string
,
9200 /* In this case, we assume that the field COULD exist
9201 in some extension of the type. Return an object of
9202 "type" void, which will match any formal
9203 (see ada_type_match). */
9204 return value_zero (builtin_type_void
, lval_memory
);
9208 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9211 return value_zero (ada_aligned_type (type
), lval_memory
);
9215 ada_to_fixed_value (unwrap_value
9216 (ada_value_struct_elt
9217 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9219 /* The value is not supposed to be used. This is here to make it
9220 easier to accommodate expressions that contain types. */
9222 if (noside
== EVAL_SKIP
)
9224 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9225 return allocate_value (exp
->elts
[pc
+ 1].type
);
9227 error (_("Attempt to use a type name as an expression"));
9232 case OP_DISCRETE_RANGE
:
9235 if (noside
== EVAL_NORMAL
)
9239 error (_("Undefined name, ambiguous name, or renaming used in "
9240 "component association: %s."), &exp
->elts
[pc
+2].string
);
9242 error (_("Aggregates only allowed on the right of an assignment"));
9244 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9247 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9249 for (tem
= 0; tem
< nargs
; tem
+= 1)
9250 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9255 return value_from_longest (builtin_type_long
, (LONGEST
) 1);
9261 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9262 type name that encodes the 'small and 'delta information.
9263 Otherwise, return NULL. */
9266 fixed_type_info (struct type
*type
)
9268 const char *name
= ada_type_name (type
);
9269 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9271 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9273 const char *tail
= strstr (name
, "___XF_");
9279 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9280 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9285 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9288 ada_is_fixed_point_type (struct type
*type
)
9290 return fixed_type_info (type
) != NULL
;
9293 /* Return non-zero iff TYPE represents a System.Address type. */
9296 ada_is_system_address_type (struct type
*type
)
9298 return (TYPE_NAME (type
)
9299 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9302 /* Assuming that TYPE is the representation of an Ada fixed-point
9303 type, return its delta, or -1 if the type is malformed and the
9304 delta cannot be determined. */
9307 ada_delta (struct type
*type
)
9309 const char *encoding
= fixed_type_info (type
);
9312 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9315 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9318 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9319 factor ('SMALL value) associated with the type. */
9322 scaling_factor (struct type
*type
)
9324 const char *encoding
= fixed_type_info (type
);
9325 unsigned long num0
, den0
, num1
, den1
;
9328 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9333 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9335 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9339 /* Assuming that X is the representation of a value of fixed-point
9340 type TYPE, return its floating-point equivalent. */
9343 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9345 return (DOUBLEST
) x
*scaling_factor (type
);
9348 /* The representation of a fixed-point value of type TYPE
9349 corresponding to the value X. */
9352 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9354 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9358 /* VAX floating formats */
9360 /* Non-zero iff TYPE represents one of the special VAX floating-point
9364 ada_is_vax_floating_type (struct type
*type
)
9367 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9370 && (TYPE_CODE (type
) == TYPE_CODE_INT
9371 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9372 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9375 /* The type of special VAX floating-point type this is, assuming
9376 ada_is_vax_floating_point. */
9379 ada_vax_float_type_suffix (struct type
*type
)
9381 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9384 /* A value representing the special debugging function that outputs
9385 VAX floating-point values of the type represented by TYPE. Assumes
9386 ada_is_vax_floating_type (TYPE). */
9389 ada_vax_float_print_function (struct type
*type
)
9391 switch (ada_vax_float_type_suffix (type
))
9394 return get_var_value ("DEBUG_STRING_F", 0);
9396 return get_var_value ("DEBUG_STRING_D", 0);
9398 return get_var_value ("DEBUG_STRING_G", 0);
9400 error (_("invalid VAX floating-point type"));
9407 /* Scan STR beginning at position K for a discriminant name, and
9408 return the value of that discriminant field of DVAL in *PX. If
9409 PNEW_K is not null, put the position of the character beyond the
9410 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9411 not alter *PX and *PNEW_K if unsuccessful. */
9414 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9417 static char *bound_buffer
= NULL
;
9418 static size_t bound_buffer_len
= 0;
9421 struct value
*bound_val
;
9423 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9426 pend
= strstr (str
+ k
, "__");
9430 k
+= strlen (bound
);
9434 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9435 bound
= bound_buffer
;
9436 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9437 bound
[pend
- (str
+ k
)] = '\0';
9441 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9442 if (bound_val
== NULL
)
9445 *px
= value_as_long (bound_val
);
9451 /* Value of variable named NAME in the current environment. If
9452 no such variable found, then if ERR_MSG is null, returns 0, and
9453 otherwise causes an error with message ERR_MSG. */
9455 static struct value
*
9456 get_var_value (char *name
, char *err_msg
)
9458 struct ada_symbol_info
*syms
;
9461 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9466 if (err_msg
== NULL
)
9469 error (("%s"), err_msg
);
9472 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9475 /* Value of integer variable named NAME in the current environment. If
9476 no such variable found, returns 0, and sets *FLAG to 0. If
9477 successful, sets *FLAG to 1. */
9480 get_int_var_value (char *name
, int *flag
)
9482 struct value
*var_val
= get_var_value (name
, 0);
9494 return value_as_long (var_val
);
9499 /* Return a range type whose base type is that of the range type named
9500 NAME in the current environment, and whose bounds are calculated
9501 from NAME according to the GNAT range encoding conventions.
9502 Extract discriminant values, if needed, from DVAL. If a new type
9503 must be created, allocate in OBJFILE's space. The bounds
9504 information, in general, is encoded in NAME, the base type given in
9505 the named range type. */
9507 static struct type
*
9508 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9510 struct type
*raw_type
= ada_find_any_type (name
);
9511 struct type
*base_type
;
9514 if (raw_type
== NULL
)
9515 base_type
= builtin_type_int
;
9516 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9517 base_type
= TYPE_TARGET_TYPE (raw_type
);
9519 base_type
= raw_type
;
9521 subtype_info
= strstr (name
, "___XD");
9522 if (subtype_info
== NULL
)
9526 static char *name_buf
= NULL
;
9527 static size_t name_len
= 0;
9528 int prefix_len
= subtype_info
- name
;
9534 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9535 strncpy (name_buf
, name
, prefix_len
);
9536 name_buf
[prefix_len
] = '\0';
9539 bounds_str
= strchr (subtype_info
, '_');
9542 if (*subtype_info
== 'L')
9544 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9545 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9547 if (bounds_str
[n
] == '_')
9549 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9556 strcpy (name_buf
+ prefix_len
, "___L");
9557 L
= get_int_var_value (name_buf
, &ok
);
9560 lim_warning (_("Unknown lower bound, using 1."));
9565 if (*subtype_info
== 'U')
9567 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9568 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9574 strcpy (name_buf
+ prefix_len
, "___U");
9575 U
= get_int_var_value (name_buf
, &ok
);
9578 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9583 if (objfile
== NULL
)
9584 objfile
= TYPE_OBJFILE (base_type
);
9585 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9586 TYPE_NAME (type
) = name
;
9591 /* True iff NAME is the name of a range type. */
9594 ada_is_range_type_name (const char *name
)
9596 return (name
!= NULL
&& strstr (name
, "___XD"));
9602 /* True iff TYPE is an Ada modular type. */
9605 ada_is_modular_type (struct type
*type
)
9607 struct type
*subranged_type
= base_type (type
);
9609 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9610 && TYPE_CODE (subranged_type
) != TYPE_CODE_ENUM
9611 && TYPE_UNSIGNED (subranged_type
));
9614 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9617 ada_modulus (struct type
* type
)
9619 return (ULONGEST
) TYPE_HIGH_BOUND (type
) + 1;
9623 /* Ada exception catchpoint support:
9624 ---------------------------------
9626 We support 3 kinds of exception catchpoints:
9627 . catchpoints on Ada exceptions
9628 . catchpoints on unhandled Ada exceptions
9629 . catchpoints on failed assertions
9631 Exceptions raised during failed assertions, or unhandled exceptions
9632 could perfectly be caught with the general catchpoint on Ada exceptions.
9633 However, we can easily differentiate these two special cases, and having
9634 the option to distinguish these two cases from the rest can be useful
9635 to zero-in on certain situations.
9637 Exception catchpoints are a specialized form of breakpoint,
9638 since they rely on inserting breakpoints inside known routines
9639 of the GNAT runtime. The implementation therefore uses a standard
9640 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9643 Support in the runtime for exception catchpoints have been changed
9644 a few times already, and these changes affect the implementation
9645 of these catchpoints. In order to be able to support several
9646 variants of the runtime, we use a sniffer that will determine
9647 the runtime variant used by the program being debugged.
9649 At this time, we do not support the use of conditions on Ada exception
9650 catchpoints. The COND and COND_STRING fields are therefore set
9651 to NULL (most of the time, see below).
9653 Conditions where EXP_STRING, COND, and COND_STRING are used:
9655 When a user specifies the name of a specific exception in the case
9656 of catchpoints on Ada exceptions, we store the name of that exception
9657 in the EXP_STRING. We then translate this request into an actual
9658 condition stored in COND_STRING, and then parse it into an expression
9661 /* The different types of catchpoints that we introduced for catching
9664 enum exception_catchpoint_kind
9667 ex_catch_exception_unhandled
,
9671 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9673 /* A structure that describes how to support exception catchpoints
9674 for a given executable. */
9676 struct exception_support_info
9678 /* The name of the symbol to break on in order to insert
9679 a catchpoint on exceptions. */
9680 const char *catch_exception_sym
;
9682 /* The name of the symbol to break on in order to insert
9683 a catchpoint on unhandled exceptions. */
9684 const char *catch_exception_unhandled_sym
;
9686 /* The name of the symbol to break on in order to insert
9687 a catchpoint on failed assertions. */
9688 const char *catch_assert_sym
;
9690 /* Assuming that the inferior just triggered an unhandled exception
9691 catchpoint, this function is responsible for returning the address
9692 in inferior memory where the name of that exception is stored.
9693 Return zero if the address could not be computed. */
9694 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9697 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9698 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9700 /* The following exception support info structure describes how to
9701 implement exception catchpoints with the latest version of the
9702 Ada runtime (as of 2007-03-06). */
9704 static const struct exception_support_info default_exception_support_info
=
9706 "__gnat_debug_raise_exception", /* catch_exception_sym */
9707 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9708 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9709 ada_unhandled_exception_name_addr
9712 /* The following exception support info structure describes how to
9713 implement exception catchpoints with a slightly older version
9714 of the Ada runtime. */
9716 static const struct exception_support_info exception_support_info_fallback
=
9718 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9719 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9720 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9721 ada_unhandled_exception_name_addr_from_raise
9724 /* For each executable, we sniff which exception info structure to use
9725 and cache it in the following global variable. */
9727 static const struct exception_support_info
*exception_info
= NULL
;
9729 /* Inspect the Ada runtime and determine which exception info structure
9730 should be used to provide support for exception catchpoints.
9732 This function will always set exception_info, or raise an error. */
9735 ada_exception_support_info_sniffer (void)
9739 /* If the exception info is already known, then no need to recompute it. */
9740 if (exception_info
!= NULL
)
9743 /* Check the latest (default) exception support info. */
9744 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9748 exception_info
= &default_exception_support_info
;
9752 /* Try our fallback exception suport info. */
9753 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9757 exception_info
= &exception_support_info_fallback
;
9761 /* Sometimes, it is normal for us to not be able to find the routine
9762 we are looking for. This happens when the program is linked with
9763 the shared version of the GNAT runtime, and the program has not been
9764 started yet. Inform the user of these two possible causes if
9767 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9768 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9770 /* If the symbol does not exist, then check that the program is
9771 already started, to make sure that shared libraries have been
9772 loaded. If it is not started, this may mean that the symbol is
9773 in a shared library. */
9775 if (ptid_get_pid (inferior_ptid
) == 0)
9776 error (_("Unable to insert catchpoint. Try to start the program first."));
9778 /* At this point, we know that we are debugging an Ada program and
9779 that the inferior has been started, but we still are not able to
9780 find the run-time symbols. That can mean that we are in
9781 configurable run time mode, or that a-except as been optimized
9782 out by the linker... In any case, at this point it is not worth
9783 supporting this feature. */
9785 error (_("Cannot insert catchpoints in this configuration."));
9788 /* An observer of "executable_changed" events.
9789 Its role is to clear certain cached values that need to be recomputed
9790 each time a new executable is loaded by GDB. */
9793 ada_executable_changed_observer (void *unused
)
9795 /* If the executable changed, then it is possible that the Ada runtime
9796 is different. So we need to invalidate the exception support info
9798 exception_info
= NULL
;
9801 /* Return the name of the function at PC, NULL if could not find it.
9802 This function only checks the debugging information, not the symbol
9806 function_name_from_pc (CORE_ADDR pc
)
9810 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9816 /* True iff FRAME is very likely to be that of a function that is
9817 part of the runtime system. This is all very heuristic, but is
9818 intended to be used as advice as to what frames are uninteresting
9822 is_known_support_routine (struct frame_info
*frame
)
9824 struct symtab_and_line sal
;
9828 /* If this code does not have any debugging information (no symtab),
9829 This cannot be any user code. */
9831 find_frame_sal (frame
, &sal
);
9832 if (sal
.symtab
== NULL
)
9835 /* If there is a symtab, but the associated source file cannot be
9836 located, then assume this is not user code: Selecting a frame
9837 for which we cannot display the code would not be very helpful
9838 for the user. This should also take care of case such as VxWorks
9839 where the kernel has some debugging info provided for a few units. */
9841 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9844 /* Check the unit filename againt the Ada runtime file naming.
9845 We also check the name of the objfile against the name of some
9846 known system libraries that sometimes come with debugging info
9849 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9851 re_comp (known_runtime_file_name_patterns
[i
]);
9852 if (re_exec (sal
.symtab
->filename
))
9854 if (sal
.symtab
->objfile
!= NULL
9855 && re_exec (sal
.symtab
->objfile
->name
))
9859 /* Check whether the function is a GNAT-generated entity. */
9861 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9862 if (func_name
== NULL
)
9865 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9867 re_comp (known_auxiliary_function_name_patterns
[i
]);
9868 if (re_exec (func_name
))
9875 /* Find the first frame that contains debugging information and that is not
9876 part of the Ada run-time, starting from FI and moving upward. */
9879 ada_find_printable_frame (struct frame_info
*fi
)
9881 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9883 if (!is_known_support_routine (fi
))
9892 /* Assuming that the inferior just triggered an unhandled exception
9893 catchpoint, return the address in inferior memory where the name
9894 of the exception is stored.
9896 Return zero if the address could not be computed. */
9899 ada_unhandled_exception_name_addr (void)
9901 return parse_and_eval_address ("e.full_name");
9904 /* Same as ada_unhandled_exception_name_addr, except that this function
9905 should be used when the inferior uses an older version of the runtime,
9906 where the exception name needs to be extracted from a specific frame
9907 several frames up in the callstack. */
9910 ada_unhandled_exception_name_addr_from_raise (void)
9913 struct frame_info
*fi
;
9915 /* To determine the name of this exception, we need to select
9916 the frame corresponding to RAISE_SYM_NAME. This frame is
9917 at least 3 levels up, so we simply skip the first 3 frames
9918 without checking the name of their associated function. */
9919 fi
= get_current_frame ();
9920 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9922 fi
= get_prev_frame (fi
);
9926 const char *func_name
=
9927 function_name_from_pc (get_frame_address_in_block (fi
));
9928 if (func_name
!= NULL
9929 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9930 break; /* We found the frame we were looking for... */
9931 fi
= get_prev_frame (fi
);
9938 return parse_and_eval_address ("id.full_name");
9941 /* Assuming the inferior just triggered an Ada exception catchpoint
9942 (of any type), return the address in inferior memory where the name
9943 of the exception is stored, if applicable.
9945 Return zero if the address could not be computed, or if not relevant. */
9948 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9949 struct breakpoint
*b
)
9953 case ex_catch_exception
:
9954 return (parse_and_eval_address ("e.full_name"));
9957 case ex_catch_exception_unhandled
:
9958 return exception_info
->unhandled_exception_name_addr ();
9961 case ex_catch_assert
:
9962 return 0; /* Exception name is not relevant in this case. */
9966 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9970 return 0; /* Should never be reached. */
9973 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9974 any error that ada_exception_name_addr_1 might cause to be thrown.
9975 When an error is intercepted, a warning with the error message is printed,
9976 and zero is returned. */
9979 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9980 struct breakpoint
*b
)
9982 struct gdb_exception e
;
9983 CORE_ADDR result
= 0;
9985 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9987 result
= ada_exception_name_addr_1 (ex
, b
);
9992 warning (_("failed to get exception name: %s"), e
.message
);
9999 /* Implement the PRINT_IT method in the breakpoint_ops structure
10000 for all exception catchpoint kinds. */
10002 static enum print_stop_action
10003 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10005 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10006 char exception_name
[256];
10010 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10011 exception_name
[sizeof (exception_name
) - 1] = '\0';
10014 ada_find_printable_frame (get_current_frame ());
10016 annotate_catchpoint (b
->number
);
10019 case ex_catch_exception
:
10021 printf_filtered (_("\nCatchpoint %d, %s at "),
10022 b
->number
, exception_name
);
10024 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10026 case ex_catch_exception_unhandled
:
10028 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10029 b
->number
, exception_name
);
10031 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10034 case ex_catch_assert
:
10035 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10040 return PRINT_SRC_AND_LOC
;
10043 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10044 for all exception catchpoint kinds. */
10047 print_one_exception (enum exception_catchpoint_kind ex
,
10048 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10052 annotate_field (4);
10053 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10056 annotate_field (5);
10057 *last_addr
= b
->loc
->address
;
10060 case ex_catch_exception
:
10061 if (b
->exp_string
!= NULL
)
10063 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10065 ui_out_field_string (uiout
, "what", msg
);
10069 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10073 case ex_catch_exception_unhandled
:
10074 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10077 case ex_catch_assert
:
10078 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10082 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10087 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10088 for all exception catchpoint kinds. */
10091 print_mention_exception (enum exception_catchpoint_kind ex
,
10092 struct breakpoint
*b
)
10096 case ex_catch_exception
:
10097 if (b
->exp_string
!= NULL
)
10098 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10099 b
->number
, b
->exp_string
);
10101 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10105 case ex_catch_exception_unhandled
:
10106 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10110 case ex_catch_assert
:
10111 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10115 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10120 /* Virtual table for "catch exception" breakpoints. */
10122 static enum print_stop_action
10123 print_it_catch_exception (struct breakpoint
*b
)
10125 return print_it_exception (ex_catch_exception
, b
);
10129 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10131 print_one_exception (ex_catch_exception
, b
, last_addr
);
10135 print_mention_catch_exception (struct breakpoint
*b
)
10137 print_mention_exception (ex_catch_exception
, b
);
10140 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10142 print_it_catch_exception
,
10143 print_one_catch_exception
,
10144 print_mention_catch_exception
10147 /* Virtual table for "catch exception unhandled" breakpoints. */
10149 static enum print_stop_action
10150 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10152 return print_it_exception (ex_catch_exception_unhandled
, b
);
10156 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10158 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10162 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10164 print_mention_exception (ex_catch_exception_unhandled
, b
);
10167 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10168 print_it_catch_exception_unhandled
,
10169 print_one_catch_exception_unhandled
,
10170 print_mention_catch_exception_unhandled
10173 /* Virtual table for "catch assert" breakpoints. */
10175 static enum print_stop_action
10176 print_it_catch_assert (struct breakpoint
*b
)
10178 return print_it_exception (ex_catch_assert
, b
);
10182 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10184 print_one_exception (ex_catch_assert
, b
, last_addr
);
10188 print_mention_catch_assert (struct breakpoint
*b
)
10190 print_mention_exception (ex_catch_assert
, b
);
10193 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10194 print_it_catch_assert
,
10195 print_one_catch_assert
,
10196 print_mention_catch_assert
10199 /* Return non-zero if B is an Ada exception catchpoint. */
10202 ada_exception_catchpoint_p (struct breakpoint
*b
)
10204 return (b
->ops
== &catch_exception_breakpoint_ops
10205 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10206 || b
->ops
== &catch_assert_breakpoint_ops
);
10209 /* Return a newly allocated copy of the first space-separated token
10210 in ARGSP, and then adjust ARGSP to point immediately after that
10213 Return NULL if ARGPS does not contain any more tokens. */
10216 ada_get_next_arg (char **argsp
)
10218 char *args
= *argsp
;
10222 /* Skip any leading white space. */
10224 while (isspace (*args
))
10227 if (args
[0] == '\0')
10228 return NULL
; /* No more arguments. */
10230 /* Find the end of the current argument. */
10233 while (*end
!= '\0' && !isspace (*end
))
10236 /* Adjust ARGSP to point to the start of the next argument. */
10240 /* Make a copy of the current argument and return it. */
10242 result
= xmalloc (end
- args
+ 1);
10243 strncpy (result
, args
, end
- args
);
10244 result
[end
- args
] = '\0';
10249 /* Split the arguments specified in a "catch exception" command.
10250 Set EX to the appropriate catchpoint type.
10251 Set EXP_STRING to the name of the specific exception if
10252 specified by the user. */
10255 catch_ada_exception_command_split (char *args
,
10256 enum exception_catchpoint_kind
*ex
,
10259 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10260 char *exception_name
;
10262 exception_name
= ada_get_next_arg (&args
);
10263 make_cleanup (xfree
, exception_name
);
10265 /* Check that we do not have any more arguments. Anything else
10268 while (isspace (*args
))
10271 if (args
[0] != '\0')
10272 error (_("Junk at end of expression"));
10274 discard_cleanups (old_chain
);
10276 if (exception_name
== NULL
)
10278 /* Catch all exceptions. */
10279 *ex
= ex_catch_exception
;
10280 *exp_string
= NULL
;
10282 else if (strcmp (exception_name
, "unhandled") == 0)
10284 /* Catch unhandled exceptions. */
10285 *ex
= ex_catch_exception_unhandled
;
10286 *exp_string
= NULL
;
10290 /* Catch a specific exception. */
10291 *ex
= ex_catch_exception
;
10292 *exp_string
= exception_name
;
10296 /* Return the name of the symbol on which we should break in order to
10297 implement a catchpoint of the EX kind. */
10299 static const char *
10300 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10302 gdb_assert (exception_info
!= NULL
);
10306 case ex_catch_exception
:
10307 return (exception_info
->catch_exception_sym
);
10309 case ex_catch_exception_unhandled
:
10310 return (exception_info
->catch_exception_unhandled_sym
);
10312 case ex_catch_assert
:
10313 return (exception_info
->catch_assert_sym
);
10316 internal_error (__FILE__
, __LINE__
,
10317 _("unexpected catchpoint kind (%d)"), ex
);
10321 /* Return the breakpoint ops "virtual table" used for catchpoints
10324 static struct breakpoint_ops
*
10325 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10329 case ex_catch_exception
:
10330 return (&catch_exception_breakpoint_ops
);
10332 case ex_catch_exception_unhandled
:
10333 return (&catch_exception_unhandled_breakpoint_ops
);
10335 case ex_catch_assert
:
10336 return (&catch_assert_breakpoint_ops
);
10339 internal_error (__FILE__
, __LINE__
,
10340 _("unexpected catchpoint kind (%d)"), ex
);
10344 /* Return the condition that will be used to match the current exception
10345 being raised with the exception that the user wants to catch. This
10346 assumes that this condition is used when the inferior just triggered
10347 an exception catchpoint.
10349 The string returned is a newly allocated string that needs to be
10350 deallocated later. */
10353 ada_exception_catchpoint_cond_string (const char *exp_string
)
10355 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10358 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10360 static struct expression
*
10361 ada_parse_catchpoint_condition (char *cond_string
,
10362 struct symtab_and_line sal
)
10364 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10367 /* Return the symtab_and_line that should be used to insert an exception
10368 catchpoint of the TYPE kind.
10370 EX_STRING should contain the name of a specific exception
10371 that the catchpoint should catch, or NULL otherwise.
10373 The idea behind all the remaining parameters is that their names match
10374 the name of certain fields in the breakpoint structure that are used to
10375 handle exception catchpoints. This function returns the value to which
10376 these fields should be set, depending on the type of catchpoint we need
10379 If COND and COND_STRING are both non-NULL, any value they might
10380 hold will be free'ed, and then replaced by newly allocated ones.
10381 These parameters are left untouched otherwise. */
10383 static struct symtab_and_line
10384 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10385 char **addr_string
, char **cond_string
,
10386 struct expression
**cond
, struct breakpoint_ops
**ops
)
10388 const char *sym_name
;
10389 struct symbol
*sym
;
10390 struct symtab_and_line sal
;
10392 /* First, find out which exception support info to use. */
10393 ada_exception_support_info_sniffer ();
10395 /* Then lookup the function on which we will break in order to catch
10396 the Ada exceptions requested by the user. */
10398 sym_name
= ada_exception_sym_name (ex
);
10399 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10401 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10402 that should be compiled with debugging information. As a result, we
10403 expect to find that symbol in the symtabs. If we don't find it, then
10404 the target most likely does not support Ada exceptions, or we cannot
10405 insert exception breakpoints yet, because the GNAT runtime hasn't been
10408 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10409 in such a way that no debugging information is produced for the symbol
10410 we are looking for. In this case, we could search the minimal symbols
10411 as a fall-back mechanism. This would still be operating in degraded
10412 mode, however, as we would still be missing the debugging information
10413 that is needed in order to extract the name of the exception being
10414 raised (this name is printed in the catchpoint message, and is also
10415 used when trying to catch a specific exception). We do not handle
10416 this case for now. */
10419 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10421 /* Make sure that the symbol we found corresponds to a function. */
10422 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10423 error (_("Symbol \"%s\" is not a function (class = %d)"),
10424 sym_name
, SYMBOL_CLASS (sym
));
10426 sal
= find_function_start_sal (sym
, 1);
10428 /* Set ADDR_STRING. */
10430 *addr_string
= xstrdup (sym_name
);
10432 /* Set the COND and COND_STRING (if not NULL). */
10434 if (cond_string
!= NULL
&& cond
!= NULL
)
10436 if (*cond_string
!= NULL
)
10438 xfree (*cond_string
);
10439 *cond_string
= NULL
;
10446 if (exp_string
!= NULL
)
10448 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10449 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10454 *ops
= ada_exception_breakpoint_ops (ex
);
10459 /* Parse the arguments (ARGS) of the "catch exception" command.
10461 Set TYPE to the appropriate exception catchpoint type.
10462 If the user asked the catchpoint to catch only a specific
10463 exception, then save the exception name in ADDR_STRING.
10465 See ada_exception_sal for a description of all the remaining
10466 function arguments of this function. */
10468 struct symtab_and_line
10469 ada_decode_exception_location (char *args
, char **addr_string
,
10470 char **exp_string
, char **cond_string
,
10471 struct expression
**cond
,
10472 struct breakpoint_ops
**ops
)
10474 enum exception_catchpoint_kind ex
;
10476 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10477 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10481 struct symtab_and_line
10482 ada_decode_assert_location (char *args
, char **addr_string
,
10483 struct breakpoint_ops
**ops
)
10485 /* Check that no argument where provided at the end of the command. */
10489 while (isspace (*args
))
10492 error (_("Junk at end of arguments."));
10495 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10500 /* Information about operators given special treatment in functions
10502 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10504 #define ADA_OPERATORS \
10505 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10506 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10507 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10508 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10509 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10510 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10511 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10512 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10513 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10514 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10515 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10516 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10517 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10518 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10519 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10520 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10521 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10522 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10523 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10526 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10528 switch (exp
->elts
[pc
- 1].opcode
)
10531 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10534 #define OP_DEFN(op, len, args, binop) \
10535 case op: *oplenp = len; *argsp = args; break;
10541 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10546 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10552 ada_op_name (enum exp_opcode opcode
)
10557 return op_name_standard (opcode
);
10559 #define OP_DEFN(op, len, args, binop) case op: return #op;
10564 return "OP_AGGREGATE";
10566 return "OP_CHOICES";
10572 /* As for operator_length, but assumes PC is pointing at the first
10573 element of the operator, and gives meaningful results only for the
10574 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10577 ada_forward_operator_length (struct expression
*exp
, int pc
,
10578 int *oplenp
, int *argsp
)
10580 switch (exp
->elts
[pc
].opcode
)
10583 *oplenp
= *argsp
= 0;
10586 #define OP_DEFN(op, len, args, binop) \
10587 case op: *oplenp = len; *argsp = args; break;
10593 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10598 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10604 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10605 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10613 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10615 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10620 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10624 /* Ada attributes ('Foo). */
10627 case OP_ATR_LENGTH
:
10631 case OP_ATR_MODULUS
:
10638 case UNOP_IN_RANGE
:
10640 /* XXX: gdb_sprint_host_address, type_sprint */
10641 fprintf_filtered (stream
, _("Type @"));
10642 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10643 fprintf_filtered (stream
, " (");
10644 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10645 fprintf_filtered (stream
, ")");
10647 case BINOP_IN_BOUNDS
:
10648 fprintf_filtered (stream
, " (%d)",
10649 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10651 case TERNOP_IN_RANGE
:
10656 case OP_DISCRETE_RANGE
:
10657 case OP_POSITIONAL
:
10664 char *name
= &exp
->elts
[elt
+ 2].string
;
10665 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10666 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10671 return dump_subexp_body_standard (exp
, stream
, elt
);
10675 for (i
= 0; i
< nargs
; i
+= 1)
10676 elt
= dump_subexp (exp
, stream
, elt
);
10681 /* The Ada extension of print_subexp (q.v.). */
10684 ada_print_subexp (struct expression
*exp
, int *pos
,
10685 struct ui_file
*stream
, enum precedence prec
)
10687 int oplen
, nargs
, i
;
10689 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10691 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10698 print_subexp_standard (exp
, pos
, stream
, prec
);
10702 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10705 case BINOP_IN_BOUNDS
:
10706 /* XXX: sprint_subexp */
10707 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10708 fputs_filtered (" in ", stream
);
10709 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10710 fputs_filtered ("'range", stream
);
10711 if (exp
->elts
[pc
+ 1].longconst
> 1)
10712 fprintf_filtered (stream
, "(%ld)",
10713 (long) exp
->elts
[pc
+ 1].longconst
);
10716 case TERNOP_IN_RANGE
:
10717 if (prec
>= PREC_EQUAL
)
10718 fputs_filtered ("(", stream
);
10719 /* XXX: sprint_subexp */
10720 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10721 fputs_filtered (" in ", stream
);
10722 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10723 fputs_filtered (" .. ", stream
);
10724 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10725 if (prec
>= PREC_EQUAL
)
10726 fputs_filtered (")", stream
);
10731 case OP_ATR_LENGTH
:
10735 case OP_ATR_MODULUS
:
10740 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10742 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10743 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10747 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10748 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10752 for (tem
= 1; tem
< nargs
; tem
+= 1)
10754 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10755 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10757 fputs_filtered (")", stream
);
10762 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10763 fputs_filtered ("'(", stream
);
10764 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10765 fputs_filtered (")", stream
);
10768 case UNOP_IN_RANGE
:
10769 /* XXX: sprint_subexp */
10770 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10771 fputs_filtered (" in ", stream
);
10772 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10775 case OP_DISCRETE_RANGE
:
10776 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10777 fputs_filtered ("..", stream
);
10778 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10782 fputs_filtered ("others => ", stream
);
10783 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10787 for (i
= 0; i
< nargs
-1; i
+= 1)
10790 fputs_filtered ("|", stream
);
10791 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10793 fputs_filtered (" => ", stream
);
10794 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10797 case OP_POSITIONAL
:
10798 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10802 fputs_filtered ("(", stream
);
10803 for (i
= 0; i
< nargs
; i
+= 1)
10806 fputs_filtered (", ", stream
);
10807 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10809 fputs_filtered (")", stream
);
10814 /* Table mapping opcodes into strings for printing operators
10815 and precedences of the operators. */
10817 static const struct op_print ada_op_print_tab
[] = {
10818 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10819 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10820 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10821 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10822 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10823 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10824 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10825 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10826 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10827 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10828 {">", BINOP_GTR
, PREC_ORDER
, 0},
10829 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10830 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10831 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10832 {"+", BINOP_ADD
, PREC_ADD
, 0},
10833 {"-", BINOP_SUB
, PREC_ADD
, 0},
10834 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10835 {"*", BINOP_MUL
, PREC_MUL
, 0},
10836 {"/", BINOP_DIV
, PREC_MUL
, 0},
10837 {"rem", BINOP_REM
, PREC_MUL
, 0},
10838 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10839 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10840 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10841 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10842 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10843 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10844 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10845 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10846 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10847 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10848 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10852 enum ada_primitive_types
{
10853 ada_primitive_type_int
,
10854 ada_primitive_type_long
,
10855 ada_primitive_type_short
,
10856 ada_primitive_type_char
,
10857 ada_primitive_type_float
,
10858 ada_primitive_type_double
,
10859 ada_primitive_type_void
,
10860 ada_primitive_type_long_long
,
10861 ada_primitive_type_long_double
,
10862 ada_primitive_type_natural
,
10863 ada_primitive_type_positive
,
10864 ada_primitive_type_system_address
,
10865 nr_ada_primitive_types
10869 ada_language_arch_info (struct gdbarch
*gdbarch
,
10870 struct language_arch_info
*lai
)
10872 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10873 lai
->primitive_type_vector
10874 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10876 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10877 init_type (TYPE_CODE_INT
,
10878 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10879 0, "integer", (struct objfile
*) NULL
);
10880 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10881 init_type (TYPE_CODE_INT
,
10882 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10883 0, "long_integer", (struct objfile
*) NULL
);
10884 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10885 init_type (TYPE_CODE_INT
,
10886 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10887 0, "short_integer", (struct objfile
*) NULL
);
10888 lai
->string_char_type
=
10889 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10890 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10891 0, "character", (struct objfile
*) NULL
);
10892 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10893 init_type (TYPE_CODE_FLT
,
10894 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10895 0, "float", (struct objfile
*) NULL
);
10896 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10897 init_type (TYPE_CODE_FLT
,
10898 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10899 0, "long_float", (struct objfile
*) NULL
);
10900 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10901 init_type (TYPE_CODE_INT
,
10902 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10903 0, "long_long_integer", (struct objfile
*) NULL
);
10904 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10905 init_type (TYPE_CODE_FLT
,
10906 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10907 0, "long_long_float", (struct objfile
*) NULL
);
10908 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10909 init_type (TYPE_CODE_INT
,
10910 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10911 0, "natural", (struct objfile
*) NULL
);
10912 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10913 init_type (TYPE_CODE_INT
,
10914 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10915 0, "positive", (struct objfile
*) NULL
);
10916 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10918 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10919 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10920 (struct objfile
*) NULL
));
10921 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10922 = "system__address";
10925 /* Language vector */
10927 /* Not really used, but needed in the ada_language_defn. */
10930 emit_char (int c
, struct ui_file
*stream
, int quoter
)
10932 ada_emit_char (c
, stream
, quoter
, 1);
10938 warnings_issued
= 0;
10939 return ada_parse ();
10942 static const struct exp_descriptor ada_exp_descriptor
= {
10944 ada_operator_length
,
10946 ada_dump_subexp_body
,
10947 ada_evaluate_subexp
10950 const struct language_defn ada_language_defn
= {
10951 "ada", /* Language name */
10955 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10956 that's not quite what this means. */
10958 &ada_exp_descriptor
,
10962 ada_printchar
, /* Print a character constant */
10963 ada_printstr
, /* Function to print string constant */
10964 emit_char
, /* Function to print single char (not used) */
10965 ada_print_type
, /* Print a type using appropriate syntax */
10966 ada_val_print
, /* Print a value using appropriate syntax */
10967 ada_value_print
, /* Print a top-level value */
10968 NULL
, /* Language specific skip_trampoline */
10969 NULL
, /* name_of_this */
10970 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
10971 basic_lookup_transparent_type
, /* lookup_transparent_type */
10972 ada_la_decode
, /* Language specific symbol demangler */
10973 NULL
, /* Language specific class_name_from_physname */
10974 ada_op_print_tab
, /* expression operators for printing */
10975 0, /* c-style arrays */
10976 1, /* String lower bound */
10977 ada_get_gdb_completer_word_break_characters
,
10978 ada_make_symbol_completion_list
,
10979 ada_language_arch_info
,
10980 ada_print_array_index
,
10981 default_pass_by_reference
,
10986 _initialize_ada_language (void)
10988 add_language (&ada_language_defn
);
10990 varsize_limit
= 65536;
10992 obstack_init (&symbol_list_obstack
);
10994 decoded_names_store
= htab_create_alloc
10995 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
10996 NULL
, xcalloc
, xfree
);
10998 observer_attach_executable_changed (ada_executable_changed_observer
);