1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 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 /* Define whether or not the C operator '/' truncates towards zero for
61 differently signed operands (truncation direction is undefined in C).
62 Copied from valarith.c. */
64 #ifndef TRUNCATION_TOWARDS_ZERO
65 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
68 static void extract_string (CORE_ADDR addr
, char *buf
);
70 static void modify_general_field (char *, LONGEST
, int, int);
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_type (struct type
*);
84 static struct value
*desc_data (struct value
*);
86 static int fat_pntr_data_bitpos (struct type
*);
88 static int fat_pntr_data_bitsize (struct type
*);
90 static struct value
*desc_one_bound (struct value
*, int, int);
92 static int desc_bound_bitpos (struct type
*, int, int);
94 static int desc_bound_bitsize (struct type
*, int, int);
96 static struct type
*desc_index_type (struct type
*, int);
98 static int desc_arity (struct type
*);
100 static int ada_type_match (struct type
*, struct type
*, int);
102 static int ada_args_match (struct symbol
*, struct value
**, int);
104 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
106 static struct value
*convert_actual (struct value
*, struct type
*,
109 static struct value
*make_array_descriptor (struct type
*, struct value
*,
112 static void ada_add_block_symbols (struct obstack
*,
113 struct block
*, const char *,
114 domain_enum
, struct objfile
*, int);
116 static int is_nonfunction (struct ada_symbol_info
*, int);
118 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
121 static int num_defns_collected (struct obstack
*);
123 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
125 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
126 *, const char *, int,
129 static struct symtab
*symtab_for_sym (struct symbol
*);
131 static struct value
*resolve_subexp (struct expression
**, int *, int,
134 static void replace_operator_with_call (struct expression
**, int, int, int,
135 struct symbol
*, struct block
*);
137 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
139 static char *ada_op_name (enum exp_opcode
);
141 static const char *ada_decoded_op_name (enum exp_opcode
);
143 static int numeric_type_p (struct type
*);
145 static int integer_type_p (struct type
*);
147 static int scalar_type_p (struct type
*);
149 static int discrete_type_p (struct type
*);
151 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
156 static struct symbol
*find_old_style_renaming_symbol (const char *,
159 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
162 static struct value
*evaluate_subexp (struct type
*, struct expression
*,
165 static struct value
*evaluate_subexp_type (struct expression
*, int *);
167 static int is_dynamic_field (struct type
*, int);
169 static struct type
*to_fixed_variant_branch_type (struct type
*,
171 CORE_ADDR
, struct value
*);
173 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
175 static struct type
*to_fixed_range_type (char *, struct value
*,
178 static struct type
*to_static_fixed_type (struct type
*);
179 static struct type
*static_unwrap_type (struct type
*type
);
181 static struct value
*unwrap_value (struct value
*);
183 static struct type
*packed_array_type (struct type
*, long *);
185 static struct type
*decode_packed_array_type (struct type
*);
187 static struct value
*decode_packed_array (struct value
*);
189 static struct value
*value_subscript_packed (struct value
*, int,
192 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
194 static struct value
*coerce_unspec_val_to_type (struct value
*,
197 static struct value
*get_var_value (char *, char *);
199 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
201 static int equiv_types (struct type
*, struct type
*);
203 static int is_name_suffix (const char *);
205 static int wild_match (const char *, int, const char *);
207 static struct value
*ada_coerce_ref (struct value
*);
209 static LONGEST
pos_atr (struct value
*);
211 static struct value
*value_pos_atr (struct type
*, struct value
*);
213 static struct value
*value_val_atr (struct type
*, struct value
*);
215 static struct symbol
*standard_lookup (const char *, const struct block
*,
218 static struct value
*ada_search_struct_field (char *, struct value
*, int,
221 static struct value
*ada_value_primitive_field (struct value
*, int, int,
224 static int find_struct_field (char *, struct type
*, int,
225 struct type
**, int *, int *, int *, int *);
227 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
230 static struct value
*ada_to_fixed_value (struct value
*);
232 static int ada_resolve_function (struct ada_symbol_info
*, int,
233 struct value
**, int, const char *,
236 static struct value
*ada_coerce_to_simple_array (struct value
*);
238 static int ada_is_direct_array_type (struct type
*);
240 static void ada_language_arch_info (struct gdbarch
*,
241 struct language_arch_info
*);
243 static void check_size (const struct type
*);
245 static struct value
*ada_index_struct_field (int, struct value
*, int,
248 static struct value
*assign_aggregate (struct value
*, struct value
*,
249 struct expression
*, int *, enum noside
);
251 static void aggregate_assign_from_choices (struct value
*, struct value
*,
253 int *, LONGEST
*, int *,
254 int, LONGEST
, LONGEST
);
256 static void aggregate_assign_positional (struct value
*, struct value
*,
258 int *, LONGEST
*, int *, int,
262 static void aggregate_assign_others (struct value
*, struct value
*,
264 int *, LONGEST
*, int, LONGEST
, LONGEST
);
267 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
270 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
273 static void ada_forward_operator_length (struct expression
*, int, int *,
278 /* Maximum-sized dynamic type. */
279 static unsigned int varsize_limit
;
281 /* FIXME: brobecker/2003-09-17: No longer a const because it is
282 returned by a function that does not return a const char *. */
283 static char *ada_completer_word_break_characters
=
285 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
287 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
290 /* The name of the symbol to use to get the name of the main subprogram. */
291 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
292 = "__gnat_ada_main_program_name";
294 /* Limit on the number of warnings to raise per expression evaluation. */
295 static int warning_limit
= 2;
297 /* Number of warning messages issued; reset to 0 by cleanups after
298 expression evaluation. */
299 static int warnings_issued
= 0;
301 static const char *known_runtime_file_name_patterns
[] = {
302 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
305 static const char *known_auxiliary_function_name_patterns
[] = {
306 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
309 /* Space for allocating results of ada_lookup_symbol_list. */
310 static struct obstack symbol_list_obstack
;
314 /* Given DECODED_NAME a string holding a symbol name in its
315 decoded form (ie using the Ada dotted notation), returns
316 its unqualified name. */
319 ada_unqualified_name (const char *decoded_name
)
321 const char *result
= strrchr (decoded_name
, '.');
324 result
++; /* Skip the dot... */
326 result
= decoded_name
;
331 /* Return a string starting with '<', followed by STR, and '>'.
332 The result is good until the next call. */
335 add_angle_brackets (const char *str
)
337 static char *result
= NULL
;
340 result
= (char *) xmalloc ((strlen (str
) + 3) * sizeof (char));
342 sprintf (result
, "<%s>", str
);
347 ada_get_gdb_completer_word_break_characters (void)
349 return ada_completer_word_break_characters
;
352 /* Print an array element index using the Ada syntax. */
355 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
356 const struct value_print_options
*options
)
358 LA_VALUE_PRINT (index_value
, stream
, options
);
359 fprintf_filtered (stream
, " => ");
362 /* Read the string located at ADDR from the inferior and store the
366 extract_string (CORE_ADDR addr
, char *buf
)
370 /* Loop, reading one byte at a time, until we reach the '\000'
371 end-of-string marker. */
374 target_read_memory (addr
+ char_index
* sizeof (char),
375 buf
+ char_index
* sizeof (char), sizeof (char));
378 while (buf
[char_index
- 1] != '\000');
381 /* Assuming VECT points to an array of *SIZE objects of size
382 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
383 updating *SIZE as necessary and returning the (new) array. */
386 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
388 if (*size
< min_size
)
391 if (*size
< min_size
)
393 vect
= xrealloc (vect
, *size
* element_size
);
398 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
399 suffix of FIELD_NAME beginning "___". */
402 field_name_match (const char *field_name
, const char *target
)
404 int len
= strlen (target
);
406 (strncmp (field_name
, target
, len
) == 0
407 && (field_name
[len
] == '\0'
408 || (strncmp (field_name
+ len
, "___", 3) == 0
409 && strcmp (field_name
+ strlen (field_name
) - 6,
414 /* Assuming TYPE is a TYPE_CODE_STRUCT, find the field whose name matches
415 FIELD_NAME, and return its index. This function also handles fields
416 whose name have ___ suffixes because the compiler sometimes alters
417 their name by adding such a suffix to represent fields with certain
418 constraints. If the field could not be found, return a negative
419 number if MAYBE_MISSING is set. Otherwise raise an error. */
422 ada_get_field_index (const struct type
*type
, const char *field_name
,
426 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (type
); fieldno
++)
427 if (field_name_match (TYPE_FIELD_NAME (type
, fieldno
), field_name
))
431 error (_("Unable to find field %s in struct %s. Aborting"),
432 field_name
, TYPE_NAME (type
));
437 /* The length of the prefix of NAME prior to any "___" suffix. */
440 ada_name_prefix_len (const char *name
)
446 const char *p
= strstr (name
, "___");
448 return strlen (name
);
454 /* Return non-zero if SUFFIX is a suffix of STR.
455 Return zero if STR is null. */
458 is_suffix (const char *str
, const char *suffix
)
464 len2
= strlen (suffix
);
465 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
468 /* The contents of value VAL, treated as a value of type TYPE. The
469 result is an lval in memory if VAL is. */
471 static struct value
*
472 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
474 type
= ada_check_typedef (type
);
475 if (value_type (val
) == type
)
479 struct value
*result
;
481 /* Make sure that the object size is not unreasonable before
482 trying to allocate some memory for it. */
485 result
= allocate_value (type
);
486 set_value_component_location (result
, val
);
487 set_value_bitsize (result
, value_bitsize (val
));
488 set_value_bitpos (result
, value_bitpos (val
));
489 VALUE_ADDRESS (result
) += value_offset (val
);
491 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
492 set_value_lazy (result
, 1);
494 memcpy (value_contents_raw (result
), value_contents (val
),
500 static const gdb_byte
*
501 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
506 return valaddr
+ offset
;
510 cond_offset_target (CORE_ADDR address
, long offset
)
515 return address
+ offset
;
518 /* Issue a warning (as for the definition of warning in utils.c, but
519 with exactly one argument rather than ...), unless the limit on the
520 number of warnings has passed during the evaluation of the current
523 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
524 provided by "complaint". */
525 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
528 lim_warning (const char *format
, ...)
531 va_start (args
, format
);
533 warnings_issued
+= 1;
534 if (warnings_issued
<= warning_limit
)
535 vwarning (format
, args
);
540 /* Issue an error if the size of an object of type T is unreasonable,
541 i.e. if it would be a bad idea to allocate a value of this type in
545 check_size (const struct type
*type
)
547 if (TYPE_LENGTH (type
) > varsize_limit
)
548 error (_("object size is larger than varsize-limit"));
552 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
553 gdbtypes.h, but some of the necessary definitions in that file
554 seem to have gone missing. */
556 /* Maximum value of a SIZE-byte signed integer type. */
558 max_of_size (int size
)
560 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
561 return top_bit
| (top_bit
- 1);
564 /* Minimum value of a SIZE-byte signed integer type. */
566 min_of_size (int size
)
568 return -max_of_size (size
) - 1;
571 /* Maximum value of a SIZE-byte unsigned integer type. */
573 umax_of_size (int size
)
575 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
576 return top_bit
| (top_bit
- 1);
579 /* Maximum value of integral type T, as a signed quantity. */
581 max_of_type (struct type
*t
)
583 if (TYPE_UNSIGNED (t
))
584 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
586 return max_of_size (TYPE_LENGTH (t
));
589 /* Minimum value of integral type T, as a signed quantity. */
591 min_of_type (struct type
*t
)
593 if (TYPE_UNSIGNED (t
))
596 return min_of_size (TYPE_LENGTH (t
));
599 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
601 discrete_type_high_bound (struct type
*type
)
603 switch (TYPE_CODE (type
))
605 case TYPE_CODE_RANGE
:
606 return TYPE_HIGH_BOUND (type
);
608 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
613 return max_of_type (type
);
615 error (_("Unexpected type in discrete_type_high_bound."));
619 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
621 discrete_type_low_bound (struct type
*type
)
623 switch (TYPE_CODE (type
))
625 case TYPE_CODE_RANGE
:
626 return TYPE_LOW_BOUND (type
);
628 return TYPE_FIELD_BITPOS (type
, 0);
633 return min_of_type (type
);
635 error (_("Unexpected type in discrete_type_low_bound."));
639 /* The identity on non-range types. For range types, the underlying
640 non-range scalar type. */
643 base_type (struct type
*type
)
645 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
647 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
649 type
= TYPE_TARGET_TYPE (type
);
655 /* Language Selection */
657 /* If the main program is in Ada, return language_ada, otherwise return LANG
658 (the main program is in Ada iif the adainit symbol is found).
660 MAIN_PST is not used. */
663 ada_update_initial_language (enum language lang
,
664 struct partial_symtab
*main_pst
)
666 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
667 (struct objfile
*) NULL
) != NULL
)
673 /* If the main procedure is written in Ada, then return its name.
674 The result is good until the next call. Return NULL if the main
675 procedure doesn't appear to be in Ada. */
680 struct minimal_symbol
*msym
;
681 CORE_ADDR main_program_name_addr
;
682 static char main_program_name
[1024];
684 /* For Ada, the name of the main procedure is stored in a specific
685 string constant, generated by the binder. Look for that symbol,
686 extract its address, and then read that string. If we didn't find
687 that string, then most probably the main procedure is not written
689 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
693 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
694 if (main_program_name_addr
== 0)
695 error (_("Invalid address for Ada main program name."));
697 extract_string (main_program_name_addr
, main_program_name
);
698 return main_program_name
;
701 /* The main procedure doesn't seem to be in Ada. */
707 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
710 const struct ada_opname_map ada_opname_table
[] = {
711 {"Oadd", "\"+\"", BINOP_ADD
},
712 {"Osubtract", "\"-\"", BINOP_SUB
},
713 {"Omultiply", "\"*\"", BINOP_MUL
},
714 {"Odivide", "\"/\"", BINOP_DIV
},
715 {"Omod", "\"mod\"", BINOP_MOD
},
716 {"Orem", "\"rem\"", BINOP_REM
},
717 {"Oexpon", "\"**\"", BINOP_EXP
},
718 {"Olt", "\"<\"", BINOP_LESS
},
719 {"Ole", "\"<=\"", BINOP_LEQ
},
720 {"Ogt", "\">\"", BINOP_GTR
},
721 {"Oge", "\">=\"", BINOP_GEQ
},
722 {"Oeq", "\"=\"", BINOP_EQUAL
},
723 {"One", "\"/=\"", BINOP_NOTEQUAL
},
724 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
725 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
726 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
727 {"Oconcat", "\"&\"", BINOP_CONCAT
},
728 {"Oabs", "\"abs\"", UNOP_ABS
},
729 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
730 {"Oadd", "\"+\"", UNOP_PLUS
},
731 {"Osubtract", "\"-\"", UNOP_NEG
},
735 /* The "encoded" form of DECODED, according to GNAT conventions.
736 The result is valid until the next call to ada_encode. */
739 ada_encode (const char *decoded
)
741 static char *encoding_buffer
= NULL
;
742 static size_t encoding_buffer_size
= 0;
749 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
750 2 * strlen (decoded
) + 10);
753 for (p
= decoded
; *p
!= '\0'; p
+= 1)
757 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
762 const struct ada_opname_map
*mapping
;
764 for (mapping
= ada_opname_table
;
765 mapping
->encoded
!= NULL
766 && strncmp (mapping
->decoded
, p
,
767 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
769 if (mapping
->encoded
== NULL
)
770 error (_("invalid Ada operator name: %s"), p
);
771 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
772 k
+= strlen (mapping
->encoded
);
777 encoding_buffer
[k
] = *p
;
782 encoding_buffer
[k
] = '\0';
783 return encoding_buffer
;
786 /* Return NAME folded to lower case, or, if surrounded by single
787 quotes, unfolded, but with the quotes stripped away. Result good
791 ada_fold_name (const char *name
)
793 static char *fold_buffer
= NULL
;
794 static size_t fold_buffer_size
= 0;
796 int len
= strlen (name
);
797 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
801 strncpy (fold_buffer
, name
+ 1, len
- 2);
802 fold_buffer
[len
- 2] = '\000';
807 for (i
= 0; i
<= len
; i
+= 1)
808 fold_buffer
[i
] = tolower (name
[i
]);
814 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
817 is_lower_alphanum (const char c
)
819 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
822 /* Remove either of these suffixes:
827 These are suffixes introduced by the compiler for entities such as
828 nested subprogram for instance, in order to avoid name clashes.
829 They do not serve any purpose for the debugger. */
832 ada_remove_trailing_digits (const char *encoded
, int *len
)
834 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
837 while (i
> 0 && isdigit (encoded
[i
]))
839 if (i
>= 0 && encoded
[i
] == '.')
841 else if (i
>= 0 && encoded
[i
] == '$')
843 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
845 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
850 /* Remove the suffix introduced by the compiler for protected object
854 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
856 /* Remove trailing N. */
858 /* Protected entry subprograms are broken into two
859 separate subprograms: The first one is unprotected, and has
860 a 'N' suffix; the second is the protected version, and has
861 the 'P' suffix. The second calls the first one after handling
862 the protection. Since the P subprograms are internally generated,
863 we leave these names undecoded, giving the user a clue that this
864 entity is internal. */
867 && encoded
[*len
- 1] == 'N'
868 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
872 /* If ENCODED follows the GNAT entity encoding conventions, then return
873 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
876 The resulting string is valid until the next call of ada_decode.
877 If the string is unchanged by decoding, the original string pointer
881 ada_decode (const char *encoded
)
888 static char *decoding_buffer
= NULL
;
889 static size_t decoding_buffer_size
= 0;
891 /* The name of the Ada main procedure starts with "_ada_".
892 This prefix is not part of the decoded name, so skip this part
893 if we see this prefix. */
894 if (strncmp (encoded
, "_ada_", 5) == 0)
897 /* If the name starts with '_', then it is not a properly encoded
898 name, so do not attempt to decode it. Similarly, if the name
899 starts with '<', the name should not be decoded. */
900 if (encoded
[0] == '_' || encoded
[0] == '<')
903 len0
= strlen (encoded
);
905 ada_remove_trailing_digits (encoded
, &len0
);
906 ada_remove_po_subprogram_suffix (encoded
, &len0
);
908 /* Remove the ___X.* suffix if present. Do not forget to verify that
909 the suffix is located before the current "end" of ENCODED. We want
910 to avoid re-matching parts of ENCODED that have previously been
911 marked as discarded (by decrementing LEN0). */
912 p
= strstr (encoded
, "___");
913 if (p
!= NULL
&& p
- encoded
< len0
- 3)
921 /* Remove any trailing TKB suffix. It tells us that this symbol
922 is for the body of a task, but that information does not actually
923 appear in the decoded name. */
925 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
928 /* Remove trailing "B" suffixes. */
929 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
931 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
934 /* Make decoded big enough for possible expansion by operator name. */
936 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
937 decoded
= decoding_buffer
;
939 /* Remove trailing __{digit}+ or trailing ${digit}+. */
941 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
944 while ((i
>= 0 && isdigit (encoded
[i
]))
945 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
947 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
949 else if (encoded
[i
] == '$')
953 /* The first few characters that are not alphabetic are not part
954 of any encoding we use, so we can copy them over verbatim. */
956 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
957 decoded
[j
] = encoded
[i
];
962 /* Is this a symbol function? */
963 if (at_start_name
&& encoded
[i
] == 'O')
966 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
968 int op_len
= strlen (ada_opname_table
[k
].encoded
);
969 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
971 && !isalnum (encoded
[i
+ op_len
]))
973 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
976 j
+= strlen (ada_opname_table
[k
].decoded
);
980 if (ada_opname_table
[k
].encoded
!= NULL
)
985 /* Replace "TK__" with "__", which will eventually be translated
986 into "." (just below). */
988 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
991 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
992 be translated into "." (just below). These are internal names
993 generated for anonymous blocks inside which our symbol is nested. */
995 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
996 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
997 && isdigit (encoded
[i
+4]))
1001 while (k
< len0
&& isdigit (encoded
[k
]))
1002 k
++; /* Skip any extra digit. */
1004 /* Double-check that the "__B_{DIGITS}+" sequence we found
1005 is indeed followed by "__". */
1006 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1010 /* Remove _E{DIGITS}+[sb] */
1012 /* Just as for protected object subprograms, there are 2 categories
1013 of subprograms created by the compiler for each entry. The first
1014 one implements the actual entry code, and has a suffix following
1015 the convention above; the second one implements the barrier and
1016 uses the same convention as above, except that the 'E' is replaced
1019 Just as above, we do not decode the name of barrier functions
1020 to give the user a clue that the code he is debugging has been
1021 internally generated. */
1023 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1024 && isdigit (encoded
[i
+2]))
1028 while (k
< len0
&& isdigit (encoded
[k
]))
1032 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1035 /* Just as an extra precaution, make sure that if this
1036 suffix is followed by anything else, it is a '_'.
1037 Otherwise, we matched this sequence by accident. */
1039 || (k
< len0
&& encoded
[k
] == '_'))
1044 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1045 the GNAT front-end in protected object subprograms. */
1048 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1050 /* Backtrack a bit up until we reach either the begining of
1051 the encoded name, or "__". Make sure that we only find
1052 digits or lowercase characters. */
1053 const char *ptr
= encoded
+ i
- 1;
1055 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1058 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1062 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1064 /* This is a X[bn]* sequence not separated from the previous
1065 part of the name with a non-alpha-numeric character (in other
1066 words, immediately following an alpha-numeric character), then
1067 verify that it is placed at the end of the encoded name. If
1068 not, then the encoding is not valid and we should abort the
1069 decoding. Otherwise, just skip it, it is used in body-nested
1073 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1077 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1079 /* Replace '__' by '.'. */
1087 /* It's a character part of the decoded name, so just copy it
1089 decoded
[j
] = encoded
[i
];
1094 decoded
[j
] = '\000';
1096 /* Decoded names should never contain any uppercase character.
1097 Double-check this, and abort the decoding if we find one. */
1099 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1100 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1103 if (strcmp (decoded
, encoded
) == 0)
1109 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1110 decoded
= decoding_buffer
;
1111 if (encoded
[0] == '<')
1112 strcpy (decoded
, encoded
);
1114 sprintf (decoded
, "<%s>", encoded
);
1119 /* Table for keeping permanent unique copies of decoded names. Once
1120 allocated, names in this table are never released. While this is a
1121 storage leak, it should not be significant unless there are massive
1122 changes in the set of decoded names in successive versions of a
1123 symbol table loaded during a single session. */
1124 static struct htab
*decoded_names_store
;
1126 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1127 in the language-specific part of GSYMBOL, if it has not been
1128 previously computed. Tries to save the decoded name in the same
1129 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1130 in any case, the decoded symbol has a lifetime at least that of
1132 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1133 const, but nevertheless modified to a semantically equivalent form
1134 when a decoded name is cached in it.
1138 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1141 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1142 if (*resultp
== NULL
)
1144 const char *decoded
= ada_decode (gsymbol
->name
);
1145 if (gsymbol
->obj_section
!= NULL
)
1147 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1148 *resultp
= obsavestring (decoded
, strlen (decoded
),
1149 &objf
->objfile_obstack
);
1151 /* Sometimes, we can't find a corresponding objfile, in which
1152 case, we put the result on the heap. Since we only decode
1153 when needed, we hope this usually does not cause a
1154 significant memory leak (FIXME). */
1155 if (*resultp
== NULL
)
1157 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1160 *slot
= xstrdup (decoded
);
1169 ada_la_decode (const char *encoded
, int options
)
1171 return xstrdup (ada_decode (encoded
));
1174 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1175 suffixes that encode debugging information or leading _ada_ on
1176 SYM_NAME (see is_name_suffix commentary for the debugging
1177 information that is ignored). If WILD, then NAME need only match a
1178 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1179 either argument is NULL. */
1182 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1184 if (sym_name
== NULL
|| name
== NULL
)
1187 return wild_match (name
, strlen (name
), sym_name
);
1190 int len_name
= strlen (name
);
1191 return (strncmp (sym_name
, name
, len_name
) == 0
1192 && is_name_suffix (sym_name
+ len_name
))
1193 || (strncmp (sym_name
, "_ada_", 5) == 0
1194 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1195 && is_name_suffix (sym_name
+ len_name
+ 5));
1202 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1204 static char *bound_name
[] = {
1205 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1206 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1209 /* Maximum number of array dimensions we are prepared to handle. */
1211 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1213 /* Like modify_field, but allows bitpos > wordlength. */
1216 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1218 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1222 /* The desc_* routines return primitive portions of array descriptors
1225 /* The descriptor or array type, if any, indicated by TYPE; removes
1226 level of indirection, if needed. */
1228 static struct type
*
1229 desc_base_type (struct type
*type
)
1233 type
= ada_check_typedef (type
);
1235 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1236 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1237 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1242 /* True iff TYPE indicates a "thin" array pointer type. */
1245 is_thin_pntr (struct type
*type
)
1248 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1249 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1252 /* The descriptor type for thin pointer type TYPE. */
1254 static struct type
*
1255 thin_descriptor_type (struct type
*type
)
1257 struct type
*base_type
= desc_base_type (type
);
1258 if (base_type
== NULL
)
1260 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1264 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1265 if (alt_type
== NULL
)
1272 /* A pointer to the array data for thin-pointer value VAL. */
1274 static struct value
*
1275 thin_data_pntr (struct value
*val
)
1277 struct type
*type
= value_type (val
);
1278 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1279 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1282 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1283 VALUE_ADDRESS (val
) + value_offset (val
));
1286 /* True iff TYPE indicates a "thick" array pointer type. */
1289 is_thick_pntr (struct type
*type
)
1291 type
= desc_base_type (type
);
1292 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1293 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1296 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1297 pointer to one, the type of its bounds data; otherwise, NULL. */
1299 static struct type
*
1300 desc_bounds_type (struct type
*type
)
1304 type
= desc_base_type (type
);
1308 else if (is_thin_pntr (type
))
1310 type
= thin_descriptor_type (type
);
1313 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1315 return ada_check_typedef (r
);
1317 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1319 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1321 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1326 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1327 one, a pointer to its bounds data. Otherwise NULL. */
1329 static struct value
*
1330 desc_bounds (struct value
*arr
)
1332 struct type
*type
= ada_check_typedef (value_type (arr
));
1333 if (is_thin_pntr (type
))
1335 struct type
*bounds_type
=
1336 desc_bounds_type (thin_descriptor_type (type
));
1339 if (bounds_type
== NULL
)
1340 error (_("Bad GNAT array descriptor"));
1342 /* NOTE: The following calculation is not really kosher, but
1343 since desc_type is an XVE-encoded type (and shouldn't be),
1344 the correct calculation is a real pain. FIXME (and fix GCC). */
1345 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1346 addr
= value_as_long (arr
);
1348 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1351 value_from_longest (lookup_pointer_type (bounds_type
),
1352 addr
- TYPE_LENGTH (bounds_type
));
1355 else if (is_thick_pntr (type
))
1356 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1357 _("Bad GNAT array descriptor"));
1362 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1363 position of the field containing the address of the bounds data. */
1366 fat_pntr_bounds_bitpos (struct type
*type
)
1368 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1371 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1372 size of the field containing the address of the bounds data. */
1375 fat_pntr_bounds_bitsize (struct type
*type
)
1377 type
= desc_base_type (type
);
1379 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1380 return TYPE_FIELD_BITSIZE (type
, 1);
1382 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1385 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1386 pointer to one, the type of its array data (a
1387 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1388 ada_type_of_array to get an array type with bounds data. */
1390 static struct type
*
1391 desc_data_type (struct type
*type
)
1393 type
= desc_base_type (type
);
1395 /* NOTE: The following is bogus; see comment in desc_bounds. */
1396 if (is_thin_pntr (type
))
1397 return lookup_pointer_type
1398 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1399 else if (is_thick_pntr (type
))
1400 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1405 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1408 static struct value
*
1409 desc_data (struct value
*arr
)
1411 struct type
*type
= value_type (arr
);
1412 if (is_thin_pntr (type
))
1413 return thin_data_pntr (arr
);
1414 else if (is_thick_pntr (type
))
1415 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1416 _("Bad GNAT array descriptor"));
1422 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1423 position of the field containing the address of the data. */
1426 fat_pntr_data_bitpos (struct type
*type
)
1428 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1431 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1432 size of the field containing the address of the data. */
1435 fat_pntr_data_bitsize (struct type
*type
)
1437 type
= desc_base_type (type
);
1439 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1440 return TYPE_FIELD_BITSIZE (type
, 0);
1442 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1445 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1446 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1447 bound, if WHICH is 1. The first bound is I=1. */
1449 static struct value
*
1450 desc_one_bound (struct value
*bounds
, int i
, int which
)
1452 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1453 _("Bad GNAT array descriptor bounds"));
1456 /* If BOUNDS is an array-bounds structure type, return the bit position
1457 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1458 bound, if WHICH is 1. The first bound is I=1. */
1461 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1463 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1466 /* If BOUNDS is an array-bounds structure type, return the bit field size
1467 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1468 bound, if WHICH is 1. The first bound is I=1. */
1471 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1473 type
= desc_base_type (type
);
1475 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1476 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1478 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1481 /* If TYPE is the type of an array-bounds structure, the type of its
1482 Ith bound (numbering from 1). Otherwise, NULL. */
1484 static struct type
*
1485 desc_index_type (struct type
*type
, int i
)
1487 type
= desc_base_type (type
);
1489 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1490 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1495 /* The number of index positions in the array-bounds type TYPE.
1496 Return 0 if TYPE is NULL. */
1499 desc_arity (struct type
*type
)
1501 type
= desc_base_type (type
);
1504 return TYPE_NFIELDS (type
) / 2;
1508 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1509 an array descriptor type (representing an unconstrained array
1513 ada_is_direct_array_type (struct type
*type
)
1517 type
= ada_check_typedef (type
);
1518 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1519 || ada_is_array_descriptor_type (type
));
1522 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1526 ada_is_array_type (struct type
*type
)
1529 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1530 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1531 type
= TYPE_TARGET_TYPE (type
);
1532 return ada_is_direct_array_type (type
);
1535 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1538 ada_is_simple_array_type (struct type
*type
)
1542 type
= ada_check_typedef (type
);
1543 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1544 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1545 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1548 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1551 ada_is_array_descriptor_type (struct type
*type
)
1553 struct type
*data_type
= desc_data_type (type
);
1557 type
= ada_check_typedef (type
);
1560 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1561 && TYPE_TARGET_TYPE (data_type
) != NULL
1562 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1563 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1564 && desc_arity (desc_bounds_type (type
)) > 0;
1567 /* Non-zero iff type is a partially mal-formed GNAT array
1568 descriptor. FIXME: This is to compensate for some problems with
1569 debugging output from GNAT. Re-examine periodically to see if it
1573 ada_is_bogus_array_descriptor (struct type
*type
)
1577 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1578 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1579 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1580 && !ada_is_array_descriptor_type (type
);
1584 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1585 (fat pointer) returns the type of the array data described---specifically,
1586 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1587 in from the descriptor; otherwise, they are left unspecified. If
1588 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1589 returns NULL. The result is simply the type of ARR if ARR is not
1592 ada_type_of_array (struct value
*arr
, int bounds
)
1594 if (ada_is_packed_array_type (value_type (arr
)))
1595 return decode_packed_array_type (value_type (arr
));
1597 if (!ada_is_array_descriptor_type (value_type (arr
)))
1598 return value_type (arr
);
1602 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1605 struct type
*elt_type
;
1607 struct value
*descriptor
;
1608 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1610 elt_type
= ada_array_element_type (value_type (arr
), -1);
1611 arity
= ada_array_arity (value_type (arr
));
1613 if (elt_type
== NULL
|| arity
== 0)
1614 return ada_check_typedef (value_type (arr
));
1616 descriptor
= desc_bounds (arr
);
1617 if (value_as_long (descriptor
) == 0)
1621 struct type
*range_type
= alloc_type (objf
);
1622 struct type
*array_type
= alloc_type (objf
);
1623 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1624 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1627 create_range_type (range_type
, value_type (low
),
1628 longest_to_int (value_as_long (low
)),
1629 longest_to_int (value_as_long (high
)));
1630 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1633 return lookup_pointer_type (elt_type
);
1637 /* If ARR does not represent an array, returns ARR unchanged.
1638 Otherwise, returns either a standard GDB array with bounds set
1639 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1640 GDB array. Returns NULL if ARR is a null fat pointer. */
1643 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1645 if (ada_is_array_descriptor_type (value_type (arr
)))
1647 struct type
*arrType
= ada_type_of_array (arr
, 1);
1648 if (arrType
== NULL
)
1650 return value_cast (arrType
, value_copy (desc_data (arr
)));
1652 else if (ada_is_packed_array_type (value_type (arr
)))
1653 return decode_packed_array (arr
);
1658 /* If ARR does not represent an array, returns ARR unchanged.
1659 Otherwise, returns a standard GDB array describing ARR (which may
1660 be ARR itself if it already is in the proper form). */
1662 static struct value
*
1663 ada_coerce_to_simple_array (struct value
*arr
)
1665 if (ada_is_array_descriptor_type (value_type (arr
)))
1667 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1669 error (_("Bounds unavailable for null array pointer."));
1670 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1671 return value_ind (arrVal
);
1673 else if (ada_is_packed_array_type (value_type (arr
)))
1674 return decode_packed_array (arr
);
1679 /* If TYPE represents a GNAT array type, return it translated to an
1680 ordinary GDB array type (possibly with BITSIZE fields indicating
1681 packing). For other types, is the identity. */
1684 ada_coerce_to_simple_array_type (struct type
*type
)
1686 struct value
*mark
= value_mark ();
1687 struct value
*dummy
= value_from_longest (builtin_type_int32
, 0);
1688 struct type
*result
;
1689 deprecated_set_value_type (dummy
, type
);
1690 result
= ada_type_of_array (dummy
, 0);
1691 value_free_to_mark (mark
);
1695 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1698 ada_is_packed_array_type (struct type
*type
)
1702 type
= desc_base_type (type
);
1703 type
= ada_check_typedef (type
);
1705 ada_type_name (type
) != NULL
1706 && strstr (ada_type_name (type
), "___XP") != NULL
;
1709 /* Given that TYPE is a standard GDB array type with all bounds filled
1710 in, and that the element size of its ultimate scalar constituents
1711 (that is, either its elements, or, if it is an array of arrays, its
1712 elements' elements, etc.) is *ELT_BITS, return an identical type,
1713 but with the bit sizes of its elements (and those of any
1714 constituent arrays) recorded in the BITSIZE components of its
1715 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1718 static struct type
*
1719 packed_array_type (struct type
*type
, long *elt_bits
)
1721 struct type
*new_elt_type
;
1722 struct type
*new_type
;
1723 LONGEST low_bound
, high_bound
;
1725 type
= ada_check_typedef (type
);
1726 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1729 new_type
= alloc_type (TYPE_OBJFILE (type
));
1730 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1732 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1733 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1734 TYPE_NAME (new_type
) = ada_type_name (type
);
1736 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1737 &low_bound
, &high_bound
) < 0)
1738 low_bound
= high_bound
= 0;
1739 if (high_bound
< low_bound
)
1740 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1743 *elt_bits
*= (high_bound
- low_bound
+ 1);
1744 TYPE_LENGTH (new_type
) =
1745 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1748 TYPE_FIXED_INSTANCE (new_type
) = 1;
1752 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1754 static struct type
*
1755 decode_packed_array_type (struct type
*type
)
1758 struct block
**blocks
;
1759 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1762 struct type
*shadow_type
;
1767 raw_name
= ada_type_name (desc_base_type (type
));
1772 name
= (char *) alloca (strlen (raw_name
) + 1);
1773 tail
= strstr (raw_name
, "___XP");
1774 type
= desc_base_type (type
);
1776 memcpy (name
, raw_name
, tail
- raw_name
);
1777 name
[tail
- raw_name
] = '\000';
1779 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1780 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1782 lim_warning (_("could not find bounds information on packed array"));
1785 shadow_type
= SYMBOL_TYPE (sym
);
1786 CHECK_TYPEDEF (shadow_type
);
1788 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1790 lim_warning (_("could not understand bounds information on packed array"));
1794 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1797 (_("could not understand bit size information on packed array"));
1801 return packed_array_type (shadow_type
, &bits
);
1804 /* Given that ARR is a struct value *indicating a GNAT packed array,
1805 returns a simple array that denotes that array. Its type is a
1806 standard GDB array type except that the BITSIZEs of the array
1807 target types are set to the number of bits in each element, and the
1808 type length is set appropriately. */
1810 static struct value
*
1811 decode_packed_array (struct value
*arr
)
1815 arr
= ada_coerce_ref (arr
);
1816 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1817 arr
= ada_value_ind (arr
);
1819 type
= decode_packed_array_type (value_type (arr
));
1822 error (_("can't unpack array"));
1826 if (gdbarch_bits_big_endian (current_gdbarch
)
1827 && ada_is_modular_type (value_type (arr
)))
1829 /* This is a (right-justified) modular type representing a packed
1830 array with no wrapper. In order to interpret the value through
1831 the (left-justified) packed array type we just built, we must
1832 first left-justify it. */
1833 int bit_size
, bit_pos
;
1836 mod
= ada_modulus (value_type (arr
)) - 1;
1843 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1844 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1845 bit_pos
/ HOST_CHAR_BIT
,
1846 bit_pos
% HOST_CHAR_BIT
,
1851 return coerce_unspec_val_to_type (arr
, type
);
1855 /* The value of the element of packed array ARR at the ARITY indices
1856 given in IND. ARR must be a simple array. */
1858 static struct value
*
1859 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1862 int bits
, elt_off
, bit_off
;
1863 long elt_total_bit_offset
;
1864 struct type
*elt_type
;
1868 elt_total_bit_offset
= 0;
1869 elt_type
= ada_check_typedef (value_type (arr
));
1870 for (i
= 0; i
< arity
; i
+= 1)
1872 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1873 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1875 (_("attempt to do packed indexing of something other than a packed array"));
1878 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1879 LONGEST lowerbound
, upperbound
;
1882 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1884 lim_warning (_("don't know bounds of array"));
1885 lowerbound
= upperbound
= 0;
1888 idx
= pos_atr (ind
[i
]);
1889 if (idx
< lowerbound
|| idx
> upperbound
)
1890 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1891 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1892 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1893 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1896 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1897 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1899 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1904 /* Non-zero iff TYPE includes negative integer values. */
1907 has_negatives (struct type
*type
)
1909 switch (TYPE_CODE (type
))
1914 return !TYPE_UNSIGNED (type
);
1915 case TYPE_CODE_RANGE
:
1916 return TYPE_LOW_BOUND (type
) < 0;
1921 /* Create a new value of type TYPE from the contents of OBJ starting
1922 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1923 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1924 assigning through the result will set the field fetched from.
1925 VALADDR is ignored unless OBJ is NULL, in which case,
1926 VALADDR+OFFSET must address the start of storage containing the
1927 packed value. The value returned in this case is never an lval.
1928 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1931 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1932 long offset
, int bit_offset
, int bit_size
,
1936 int src
, /* Index into the source area */
1937 targ
, /* Index into the target area */
1938 srcBitsLeft
, /* Number of source bits left to move */
1939 nsrc
, ntarg
, /* Number of source and target bytes */
1940 unusedLS
, /* Number of bits in next significant
1941 byte of source that are unused */
1942 accumSize
; /* Number of meaningful bits in accum */
1943 unsigned char *bytes
; /* First byte containing data to unpack */
1944 unsigned char *unpacked
;
1945 unsigned long accum
; /* Staging area for bits being transferred */
1947 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1948 /* Transmit bytes from least to most significant; delta is the direction
1949 the indices move. */
1950 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
1952 type
= ada_check_typedef (type
);
1956 v
= allocate_value (type
);
1957 bytes
= (unsigned char *) (valaddr
+ offset
);
1959 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
1962 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
1963 bytes
= (unsigned char *) alloca (len
);
1964 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
1968 v
= allocate_value (type
);
1969 bytes
= (unsigned char *) value_contents (obj
) + offset
;
1974 set_value_component_location (v
, obj
);
1975 VALUE_ADDRESS (v
) += value_offset (obj
) + offset
;
1976 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
1977 set_value_bitsize (v
, bit_size
);
1978 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
1980 VALUE_ADDRESS (v
) += 1;
1981 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
1985 set_value_bitsize (v
, bit_size
);
1986 unpacked
= (unsigned char *) value_contents (v
);
1988 srcBitsLeft
= bit_size
;
1990 ntarg
= TYPE_LENGTH (type
);
1994 memset (unpacked
, 0, TYPE_LENGTH (type
));
1997 else if (gdbarch_bits_big_endian (current_gdbarch
))
2000 if (has_negatives (type
)
2001 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2005 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2008 switch (TYPE_CODE (type
))
2010 case TYPE_CODE_ARRAY
:
2011 case TYPE_CODE_UNION
:
2012 case TYPE_CODE_STRUCT
:
2013 /* Non-scalar values must be aligned at a byte boundary... */
2015 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2016 /* ... And are placed at the beginning (most-significant) bytes
2018 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2023 targ
= TYPE_LENGTH (type
) - 1;
2029 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2032 unusedLS
= bit_offset
;
2035 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2042 /* Mask for removing bits of the next source byte that are not
2043 part of the value. */
2044 unsigned int unusedMSMask
=
2045 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2047 /* Sign-extend bits for this byte. */
2048 unsigned int signMask
= sign
& ~unusedMSMask
;
2050 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2051 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2052 if (accumSize
>= HOST_CHAR_BIT
)
2054 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2055 accumSize
-= HOST_CHAR_BIT
;
2056 accum
>>= HOST_CHAR_BIT
;
2060 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2067 accum
|= sign
<< accumSize
;
2068 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2069 accumSize
-= HOST_CHAR_BIT
;
2070 accum
>>= HOST_CHAR_BIT
;
2078 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2079 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2082 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2083 int src_offset
, int n
)
2085 unsigned int accum
, mask
;
2086 int accum_bits
, chunk_size
;
2088 target
+= targ_offset
/ HOST_CHAR_BIT
;
2089 targ_offset
%= HOST_CHAR_BIT
;
2090 source
+= src_offset
/ HOST_CHAR_BIT
;
2091 src_offset
%= HOST_CHAR_BIT
;
2092 if (gdbarch_bits_big_endian (current_gdbarch
))
2094 accum
= (unsigned char) *source
;
2096 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2101 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2102 accum_bits
+= HOST_CHAR_BIT
;
2104 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2107 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2108 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2111 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2113 accum_bits
-= chunk_size
;
2120 accum
= (unsigned char) *source
>> src_offset
;
2122 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2126 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2127 accum_bits
+= HOST_CHAR_BIT
;
2129 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2132 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2133 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2135 accum_bits
-= chunk_size
;
2136 accum
>>= chunk_size
;
2143 /* Store the contents of FROMVAL into the location of TOVAL.
2144 Return a new value with the location of TOVAL and contents of
2145 FROMVAL. Handles assignment into packed fields that have
2146 floating-point or non-scalar types. */
2148 static struct value
*
2149 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2151 struct type
*type
= value_type (toval
);
2152 int bits
= value_bitsize (toval
);
2154 toval
= ada_coerce_ref (toval
);
2155 fromval
= ada_coerce_ref (fromval
);
2157 if (ada_is_direct_array_type (value_type (toval
)))
2158 toval
= ada_coerce_to_simple_array (toval
);
2159 if (ada_is_direct_array_type (value_type (fromval
)))
2160 fromval
= ada_coerce_to_simple_array (fromval
);
2162 if (!deprecated_value_modifiable (toval
))
2163 error (_("Left operand of assignment is not a modifiable lvalue."));
2165 if (VALUE_LVAL (toval
) == lval_memory
2167 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2168 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2170 int len
= (value_bitpos (toval
)
2171 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2173 char *buffer
= (char *) alloca (len
);
2175 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2177 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2178 fromval
= value_cast (type
, fromval
);
2180 read_memory (to_addr
, buffer
, len
);
2181 from_size
= value_bitsize (fromval
);
2183 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2184 if (gdbarch_bits_big_endian (current_gdbarch
))
2185 move_bits (buffer
, value_bitpos (toval
),
2186 value_contents (fromval
), from_size
- bits
, bits
);
2188 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2190 write_memory (to_addr
, buffer
, len
);
2191 if (deprecated_memory_changed_hook
)
2192 deprecated_memory_changed_hook (to_addr
, len
);
2194 val
= value_copy (toval
);
2195 memcpy (value_contents_raw (val
), value_contents (fromval
),
2196 TYPE_LENGTH (type
));
2197 deprecated_set_value_type (val
, type
);
2202 return value_assign (toval
, fromval
);
2206 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2207 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2208 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2209 * COMPONENT, and not the inferior's memory. The current contents
2210 * of COMPONENT are ignored. */
2212 value_assign_to_component (struct value
*container
, struct value
*component
,
2215 LONGEST offset_in_container
=
2216 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2217 - VALUE_ADDRESS (container
) - value_offset (container
));
2218 int bit_offset_in_container
=
2219 value_bitpos (component
) - value_bitpos (container
);
2222 val
= value_cast (value_type (component
), val
);
2224 if (value_bitsize (component
) == 0)
2225 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2227 bits
= value_bitsize (component
);
2229 if (gdbarch_bits_big_endian (current_gdbarch
))
2230 move_bits (value_contents_writeable (container
) + offset_in_container
,
2231 value_bitpos (container
) + bit_offset_in_container
,
2232 value_contents (val
),
2233 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2236 move_bits (value_contents_writeable (container
) + offset_in_container
,
2237 value_bitpos (container
) + bit_offset_in_container
,
2238 value_contents (val
), 0, bits
);
2241 /* The value of the element of array ARR at the ARITY indices given in IND.
2242 ARR may be either a simple array, GNAT array descriptor, or pointer
2246 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2250 struct type
*elt_type
;
2252 elt
= ada_coerce_to_simple_array (arr
);
2254 elt_type
= ada_check_typedef (value_type (elt
));
2255 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2256 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2257 return value_subscript_packed (elt
, arity
, ind
);
2259 for (k
= 0; k
< arity
; k
+= 1)
2261 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2262 error (_("too many subscripts (%d expected)"), k
);
2263 elt
= value_subscript (elt
, value_pos_atr (builtin_type_int32
, ind
[k
]));
2268 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2269 value of the element of *ARR at the ARITY indices given in
2270 IND. Does not read the entire array into memory. */
2272 static struct value
*
2273 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2278 for (k
= 0; k
< arity
; k
+= 1)
2283 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2284 error (_("too many subscripts (%d expected)"), k
);
2285 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2287 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2288 idx
= value_pos_atr (builtin_type_int32
, ind
[k
]);
2290 idx
= value_binop (idx
, value_from_longest (value_type (idx
), lwb
),
2293 arr
= value_ptradd (arr
, idx
);
2294 type
= TYPE_TARGET_TYPE (type
);
2297 return value_ind (arr
);
2300 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2301 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2302 elements starting at index LOW. The lower bound of this array is LOW, as
2304 static struct value
*
2305 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2308 CORE_ADDR base
= value_as_address (array_ptr
)
2309 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2310 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2311 struct type
*index_type
=
2312 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2314 struct type
*slice_type
=
2315 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2316 return value_at_lazy (slice_type
, base
);
2320 static struct value
*
2321 ada_value_slice (struct value
*array
, int low
, int high
)
2323 struct type
*type
= value_type (array
);
2324 struct type
*index_type
=
2325 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2326 struct type
*slice_type
=
2327 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2328 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2331 /* If type is a record type in the form of a standard GNAT array
2332 descriptor, returns the number of dimensions for type. If arr is a
2333 simple array, returns the number of "array of"s that prefix its
2334 type designation. Otherwise, returns 0. */
2337 ada_array_arity (struct type
*type
)
2344 type
= desc_base_type (type
);
2347 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2348 return desc_arity (desc_bounds_type (type
));
2350 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2353 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2359 /* If TYPE is a record type in the form of a standard GNAT array
2360 descriptor or a simple array type, returns the element type for
2361 TYPE after indexing by NINDICES indices, or by all indices if
2362 NINDICES is -1. Otherwise, returns NULL. */
2365 ada_array_element_type (struct type
*type
, int nindices
)
2367 type
= desc_base_type (type
);
2369 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2372 struct type
*p_array_type
;
2374 p_array_type
= desc_data_type (type
);
2376 k
= ada_array_arity (type
);
2380 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2381 if (nindices
>= 0 && k
> nindices
)
2383 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2384 while (k
> 0 && p_array_type
!= NULL
)
2386 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2389 return p_array_type
;
2391 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2393 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2395 type
= TYPE_TARGET_TYPE (type
);
2404 /* The type of nth index in arrays of given type (n numbering from 1).
2405 Does not examine memory. */
2408 ada_index_type (struct type
*type
, int n
)
2410 struct type
*result_type
;
2412 type
= desc_base_type (type
);
2414 if (n
> ada_array_arity (type
))
2417 if (ada_is_simple_array_type (type
))
2421 for (i
= 1; i
< n
; i
+= 1)
2422 type
= TYPE_TARGET_TYPE (type
);
2423 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2424 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2425 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2426 perhaps stabsread.c would make more sense. */
2427 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2428 result_type
= builtin_type_int32
;
2433 return desc_index_type (desc_bounds_type (type
), n
);
2436 /* Given that arr is an array type, returns the lower bound of the
2437 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2438 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2439 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2440 bounds type. It works for other arrays with bounds supplied by
2441 run-time quantities other than discriminants. */
2444 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2445 struct type
** typep
)
2447 struct type
*type
, *index_type_desc
, *index_type
;
2450 gdb_assert (which
== 0 || which
== 1);
2452 if (ada_is_packed_array_type (arr_type
))
2453 arr_type
= decode_packed_array_type (arr_type
);
2455 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2458 *typep
= builtin_type_int32
;
2459 return (LONGEST
) - which
;
2462 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2463 type
= TYPE_TARGET_TYPE (arr_type
);
2467 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2468 if (index_type_desc
!= NULL
)
2469 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2470 NULL
, TYPE_OBJFILE (arr_type
));
2475 type
= TYPE_TARGET_TYPE (type
);
2479 index_type
= TYPE_INDEX_TYPE (type
);
2482 switch (TYPE_CODE (index_type
))
2484 case TYPE_CODE_RANGE
:
2485 retval
= which
== 0 ? TYPE_LOW_BOUND (index_type
)
2486 : TYPE_HIGH_BOUND (index_type
);
2488 case TYPE_CODE_ENUM
:
2489 retval
= which
== 0 ? TYPE_FIELD_BITPOS (index_type
, 0)
2490 : TYPE_FIELD_BITPOS (index_type
,
2491 TYPE_NFIELDS (index_type
) - 1);
2494 internal_error (__FILE__
, __LINE__
, _("invalid type code of index type"));
2498 *typep
= index_type
;
2503 /* Given that arr is an array value, returns the lower bound of the
2504 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2505 WHICH is 1. This routine will also work for arrays with bounds
2506 supplied by run-time quantities other than discriminants. */
2509 ada_array_bound (struct value
*arr
, int n
, int which
)
2511 struct type
*arr_type
= value_type (arr
);
2513 if (ada_is_packed_array_type (arr_type
))
2514 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2515 else if (ada_is_simple_array_type (arr_type
))
2518 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2519 return value_from_longest (type
, v
);
2522 return desc_one_bound (desc_bounds (arr
), n
, which
);
2525 /* Given that arr is an array value, returns the length of the
2526 nth index. This routine will also work for arrays with bounds
2527 supplied by run-time quantities other than discriminants.
2528 Does not work for arrays indexed by enumeration types with representation
2529 clauses at the moment. */
2531 static struct value
*
2532 ada_array_length (struct value
*arr
, int n
)
2534 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2536 if (ada_is_packed_array_type (arr_type
))
2537 return ada_array_length (decode_packed_array (arr
), n
);
2539 if (ada_is_simple_array_type (arr_type
))
2543 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2544 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2545 return value_from_longest (type
, v
);
2549 value_from_longest (builtin_type_int32
,
2550 value_as_long (desc_one_bound (desc_bounds (arr
),
2552 - value_as_long (desc_one_bound (desc_bounds (arr
),
2556 /* An empty array whose type is that of ARR_TYPE (an array type),
2557 with bounds LOW to LOW-1. */
2559 static struct value
*
2560 empty_array (struct type
*arr_type
, int low
)
2562 struct type
*index_type
=
2563 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2565 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2566 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2570 /* Name resolution */
2572 /* The "decoded" name for the user-definable Ada operator corresponding
2576 ada_decoded_op_name (enum exp_opcode op
)
2580 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2582 if (ada_opname_table
[i
].op
== op
)
2583 return ada_opname_table
[i
].decoded
;
2585 error (_("Could not find operator name for opcode"));
2589 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2590 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2591 undefined namespace) and converts operators that are
2592 user-defined into appropriate function calls. If CONTEXT_TYPE is
2593 non-null, it provides a preferred result type [at the moment, only
2594 type void has any effect---causing procedures to be preferred over
2595 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2596 return type is preferred. May change (expand) *EXP. */
2599 resolve (struct expression
**expp
, int void_context_p
)
2603 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2606 /* Resolve the operator of the subexpression beginning at
2607 position *POS of *EXPP. "Resolving" consists of replacing
2608 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2609 with their resolutions, replacing built-in operators with
2610 function calls to user-defined operators, where appropriate, and,
2611 when DEPROCEDURE_P is non-zero, converting function-valued variables
2612 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2613 are as in ada_resolve, above. */
2615 static struct value
*
2616 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2617 struct type
*context_type
)
2621 struct expression
*exp
; /* Convenience: == *expp. */
2622 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2623 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2624 int nargs
; /* Number of operands. */
2631 /* Pass one: resolve operands, saving their types and updating *pos,
2636 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2637 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2642 resolve_subexp (expp
, pos
, 0, NULL
);
2644 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2649 resolve_subexp (expp
, pos
, 0, NULL
);
2654 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2657 case OP_ATR_MODULUS
:
2667 case TERNOP_IN_RANGE
:
2668 case BINOP_IN_BOUNDS
:
2674 case OP_DISCRETE_RANGE
:
2676 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2685 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2687 resolve_subexp (expp
, pos
, 1, NULL
);
2689 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2706 case BINOP_LOGICAL_AND
:
2707 case BINOP_LOGICAL_OR
:
2708 case BINOP_BITWISE_AND
:
2709 case BINOP_BITWISE_IOR
:
2710 case BINOP_BITWISE_XOR
:
2713 case BINOP_NOTEQUAL
:
2720 case BINOP_SUBSCRIPT
:
2728 case UNOP_LOGICAL_NOT
:
2744 case OP_INTERNALVAR
:
2754 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2757 case STRUCTOP_STRUCT
:
2758 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2771 error (_("Unexpected operator during name resolution"));
2774 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2775 for (i
= 0; i
< nargs
; i
+= 1)
2776 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2780 /* Pass two: perform any resolution on principal operator. */
2787 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2789 struct ada_symbol_info
*candidates
;
2793 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2794 (exp
->elts
[pc
+ 2].symbol
),
2795 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2798 if (n_candidates
> 1)
2800 /* Types tend to get re-introduced locally, so if there
2801 are any local symbols that are not types, first filter
2804 for (j
= 0; j
< n_candidates
; j
+= 1)
2805 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2810 case LOC_REGPARM_ADDR
:
2818 if (j
< n_candidates
)
2821 while (j
< n_candidates
)
2823 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2825 candidates
[j
] = candidates
[n_candidates
- 1];
2834 if (n_candidates
== 0)
2835 error (_("No definition found for %s"),
2836 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2837 else if (n_candidates
== 1)
2839 else if (deprocedure_p
2840 && !is_nonfunction (candidates
, n_candidates
))
2842 i
= ada_resolve_function
2843 (candidates
, n_candidates
, NULL
, 0,
2844 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2847 error (_("Could not find a match for %s"),
2848 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2852 printf_filtered (_("Multiple matches for %s\n"),
2853 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2854 user_select_syms (candidates
, n_candidates
, 1);
2858 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2859 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2860 if (innermost_block
== NULL
2861 || contained_in (candidates
[i
].block
, innermost_block
))
2862 innermost_block
= candidates
[i
].block
;
2866 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2869 replace_operator_with_call (expp
, pc
, 0, 0,
2870 exp
->elts
[pc
+ 2].symbol
,
2871 exp
->elts
[pc
+ 1].block
);
2878 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2879 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2881 struct ada_symbol_info
*candidates
;
2885 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2886 (exp
->elts
[pc
+ 5].symbol
),
2887 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2889 if (n_candidates
== 1)
2893 i
= ada_resolve_function
2894 (candidates
, n_candidates
,
2896 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2899 error (_("Could not find a match for %s"),
2900 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2903 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2904 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2905 if (innermost_block
== NULL
2906 || contained_in (candidates
[i
].block
, innermost_block
))
2907 innermost_block
= candidates
[i
].block
;
2918 case BINOP_BITWISE_AND
:
2919 case BINOP_BITWISE_IOR
:
2920 case BINOP_BITWISE_XOR
:
2922 case BINOP_NOTEQUAL
:
2930 case UNOP_LOGICAL_NOT
:
2932 if (possible_user_operator_p (op
, argvec
))
2934 struct ada_symbol_info
*candidates
;
2938 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2939 (struct block
*) NULL
, VAR_DOMAIN
,
2941 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2942 ada_decoded_op_name (op
), NULL
);
2946 replace_operator_with_call (expp
, pc
, nargs
, 1,
2947 candidates
[i
].sym
, candidates
[i
].block
);
2958 return evaluate_subexp_type (exp
, pos
);
2961 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2962 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2963 a non-pointer. A type of 'void' (which is never a valid expression type)
2964 by convention matches anything. */
2965 /* The term "match" here is rather loose. The match is heuristic and
2966 liberal. FIXME: TOO liberal, in fact. */
2969 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
2971 ftype
= ada_check_typedef (ftype
);
2972 atype
= ada_check_typedef (atype
);
2974 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
2975 ftype
= TYPE_TARGET_TYPE (ftype
);
2976 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
2977 atype
= TYPE_TARGET_TYPE (atype
);
2979 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
2980 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
2983 switch (TYPE_CODE (ftype
))
2988 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
2989 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
2990 TYPE_TARGET_TYPE (atype
), 0);
2993 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
2995 case TYPE_CODE_ENUM
:
2996 case TYPE_CODE_RANGE
:
2997 switch (TYPE_CODE (atype
))
3000 case TYPE_CODE_ENUM
:
3001 case TYPE_CODE_RANGE
:
3007 case TYPE_CODE_ARRAY
:
3008 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3009 || ada_is_array_descriptor_type (atype
));
3011 case TYPE_CODE_STRUCT
:
3012 if (ada_is_array_descriptor_type (ftype
))
3013 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3014 || ada_is_array_descriptor_type (atype
));
3016 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3017 && !ada_is_array_descriptor_type (atype
));
3019 case TYPE_CODE_UNION
:
3021 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3025 /* Return non-zero if the formals of FUNC "sufficiently match" the
3026 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3027 may also be an enumeral, in which case it is treated as a 0-
3028 argument function. */
3031 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3034 struct type
*func_type
= SYMBOL_TYPE (func
);
3036 if (SYMBOL_CLASS (func
) == LOC_CONST
3037 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3038 return (n_actuals
== 0);
3039 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3042 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3045 for (i
= 0; i
< n_actuals
; i
+= 1)
3047 if (actuals
[i
] == NULL
)
3051 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3052 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3054 if (!ada_type_match (ftype
, atype
, 1))
3061 /* False iff function type FUNC_TYPE definitely does not produce a value
3062 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3063 FUNC_TYPE is not a valid function type with a non-null return type
3064 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3067 return_match (struct type
*func_type
, struct type
*context_type
)
3069 struct type
*return_type
;
3071 if (func_type
== NULL
)
3074 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3075 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3077 return_type
= base_type (func_type
);
3078 if (return_type
== NULL
)
3081 context_type
= base_type (context_type
);
3083 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3084 return context_type
== NULL
|| return_type
== context_type
;
3085 else if (context_type
== NULL
)
3086 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3088 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3092 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3093 function (if any) that matches the types of the NARGS arguments in
3094 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3095 that returns that type, then eliminate matches that don't. If
3096 CONTEXT_TYPE is void and there is at least one match that does not
3097 return void, eliminate all matches that do.
3099 Asks the user if there is more than one match remaining. Returns -1
3100 if there is no such symbol or none is selected. NAME is used
3101 solely for messages. May re-arrange and modify SYMS in
3102 the process; the index returned is for the modified vector. */
3105 ada_resolve_function (struct ada_symbol_info syms
[],
3106 int nsyms
, struct value
**args
, int nargs
,
3107 const char *name
, struct type
*context_type
)
3110 int m
; /* Number of hits */
3111 struct type
*fallback
;
3112 struct type
*return_type
;
3114 return_type
= context_type
;
3115 if (context_type
== NULL
)
3116 fallback
= builtin_type_void
;
3123 for (k
= 0; k
< nsyms
; k
+= 1)
3125 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3127 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3128 && return_match (type
, return_type
))
3134 if (m
> 0 || return_type
== fallback
)
3137 return_type
= fallback
;
3144 printf_filtered (_("Multiple matches for %s\n"), name
);
3145 user_select_syms (syms
, m
, 1);
3151 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3152 in a listing of choices during disambiguation (see sort_choices, below).
3153 The idea is that overloadings of a subprogram name from the
3154 same package should sort in their source order. We settle for ordering
3155 such symbols by their trailing number (__N or $N). */
3158 encoded_ordered_before (char *N0
, char *N1
)
3162 else if (N0
== NULL
)
3167 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3169 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3171 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3172 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3176 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3179 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3181 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3182 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3184 return (strcmp (N0
, N1
) < 0);
3188 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3192 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3195 for (i
= 1; i
< nsyms
; i
+= 1)
3197 struct ada_symbol_info sym
= syms
[i
];
3200 for (j
= i
- 1; j
>= 0; j
-= 1)
3202 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3203 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3205 syms
[j
+ 1] = syms
[j
];
3211 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3212 by asking the user (if necessary), returning the number selected,
3213 and setting the first elements of SYMS items. Error if no symbols
3216 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3217 to be re-integrated one of these days. */
3220 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3223 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3225 int first_choice
= (max_results
== 1) ? 1 : 2;
3226 const char *select_mode
= multiple_symbols_select_mode ();
3228 if (max_results
< 1)
3229 error (_("Request to select 0 symbols!"));
3233 if (select_mode
== multiple_symbols_cancel
)
3235 canceled because the command is ambiguous\n\
3236 See set/show multiple-symbol."));
3238 /* If select_mode is "all", then return all possible symbols.
3239 Only do that if more than one symbol can be selected, of course.
3240 Otherwise, display the menu as usual. */
3241 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3244 printf_unfiltered (_("[0] cancel\n"));
3245 if (max_results
> 1)
3246 printf_unfiltered (_("[1] all\n"));
3248 sort_choices (syms
, nsyms
);
3250 for (i
= 0; i
< nsyms
; i
+= 1)
3252 if (syms
[i
].sym
== NULL
)
3255 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3257 struct symtab_and_line sal
=
3258 find_function_start_sal (syms
[i
].sym
, 1);
3259 if (sal
.symtab
== NULL
)
3260 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3262 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3265 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3266 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3267 sal
.symtab
->filename
, sal
.line
);
3273 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3274 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3275 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3276 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3278 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3279 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3281 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3282 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3283 else if (is_enumeral
3284 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3286 printf_unfiltered (("[%d] "), i
+ first_choice
);
3287 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3289 printf_unfiltered (_("'(%s) (enumeral)\n"),
3290 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3292 else if (symtab
!= NULL
)
3293 printf_unfiltered (is_enumeral
3294 ? _("[%d] %s in %s (enumeral)\n")
3295 : _("[%d] %s at %s:?\n"),
3297 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3300 printf_unfiltered (is_enumeral
3301 ? _("[%d] %s (enumeral)\n")
3302 : _("[%d] %s at ?\n"),
3304 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3308 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3311 for (i
= 0; i
< n_chosen
; i
+= 1)
3312 syms
[i
] = syms
[chosen
[i
]];
3317 /* Read and validate a set of numeric choices from the user in the
3318 range 0 .. N_CHOICES-1. Place the results in increasing
3319 order in CHOICES[0 .. N-1], and return N.
3321 The user types choices as a sequence of numbers on one line
3322 separated by blanks, encoding them as follows:
3324 + A choice of 0 means to cancel the selection, throwing an error.
3325 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3326 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3328 The user is not allowed to choose more than MAX_RESULTS values.
3330 ANNOTATION_SUFFIX, if present, is used to annotate the input
3331 prompts (for use with the -f switch). */
3334 get_selections (int *choices
, int n_choices
, int max_results
,
3335 int is_all_choice
, char *annotation_suffix
)
3340 int first_choice
= is_all_choice
? 2 : 1;
3342 prompt
= getenv ("PS2");
3346 args
= command_line_input (prompt
, 0, annotation_suffix
);
3349 error_no_arg (_("one or more choice numbers"));
3353 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3354 order, as given in args. Choices are validated. */
3360 while (isspace (*args
))
3362 if (*args
== '\0' && n_chosen
== 0)
3363 error_no_arg (_("one or more choice numbers"));
3364 else if (*args
== '\0')
3367 choice
= strtol (args
, &args2
, 10);
3368 if (args
== args2
|| choice
< 0
3369 || choice
> n_choices
+ first_choice
- 1)
3370 error (_("Argument must be choice number"));
3374 error (_("cancelled"));
3376 if (choice
< first_choice
)
3378 n_chosen
= n_choices
;
3379 for (j
= 0; j
< n_choices
; j
+= 1)
3383 choice
-= first_choice
;
3385 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3389 if (j
< 0 || choice
!= choices
[j
])
3392 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3393 choices
[k
+ 1] = choices
[k
];
3394 choices
[j
+ 1] = choice
;
3399 if (n_chosen
> max_results
)
3400 error (_("Select no more than %d of the above"), max_results
);
3405 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3406 on the function identified by SYM and BLOCK, and taking NARGS
3407 arguments. Update *EXPP as needed to hold more space. */
3410 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3411 int oplen
, struct symbol
*sym
,
3412 struct block
*block
)
3414 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3415 symbol, -oplen for operator being replaced). */
3416 struct expression
*newexp
= (struct expression
*)
3417 xmalloc (sizeof (struct expression
)
3418 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3419 struct expression
*exp
= *expp
;
3421 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3422 newexp
->language_defn
= exp
->language_defn
;
3423 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3424 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3425 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3427 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3428 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3430 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3431 newexp
->elts
[pc
+ 4].block
= block
;
3432 newexp
->elts
[pc
+ 5].symbol
= sym
;
3438 /* Type-class predicates */
3440 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3444 numeric_type_p (struct type
*type
)
3450 switch (TYPE_CODE (type
))
3455 case TYPE_CODE_RANGE
:
3456 return (type
== TYPE_TARGET_TYPE (type
)
3457 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3464 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3467 integer_type_p (struct type
*type
)
3473 switch (TYPE_CODE (type
))
3477 case TYPE_CODE_RANGE
:
3478 return (type
== TYPE_TARGET_TYPE (type
)
3479 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3486 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3489 scalar_type_p (struct type
*type
)
3495 switch (TYPE_CODE (type
))
3498 case TYPE_CODE_RANGE
:
3499 case TYPE_CODE_ENUM
:
3508 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3511 discrete_type_p (struct type
*type
)
3517 switch (TYPE_CODE (type
))
3520 case TYPE_CODE_RANGE
:
3521 case TYPE_CODE_ENUM
:
3529 /* Returns non-zero if OP with operands in the vector ARGS could be
3530 a user-defined function. Errs on the side of pre-defined operators
3531 (i.e., result 0). */
3534 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3536 struct type
*type0
=
3537 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3538 struct type
*type1
=
3539 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3553 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3557 case BINOP_BITWISE_AND
:
3558 case BINOP_BITWISE_IOR
:
3559 case BINOP_BITWISE_XOR
:
3560 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3563 case BINOP_NOTEQUAL
:
3568 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3571 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3574 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3578 case UNOP_LOGICAL_NOT
:
3580 return (!numeric_type_p (type0
));
3589 1. In the following, we assume that a renaming type's name may
3590 have an ___XD suffix. It would be nice if this went away at some
3592 2. We handle both the (old) purely type-based representation of
3593 renamings and the (new) variable-based encoding. At some point,
3594 it is devoutly to be hoped that the former goes away
3595 (FIXME: hilfinger-2007-07-09).
3596 3. Subprogram renamings are not implemented, although the XRS
3597 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3599 /* If SYM encodes a renaming,
3601 <renaming> renames <renamed entity>,
3603 sets *LEN to the length of the renamed entity's name,
3604 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3605 the string describing the subcomponent selected from the renamed
3606 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3607 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3608 are undefined). Otherwise, returns a value indicating the category
3609 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3610 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3611 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3612 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3613 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3614 may be NULL, in which case they are not assigned.
3616 [Currently, however, GCC does not generate subprogram renamings.] */
3618 enum ada_renaming_category
3619 ada_parse_renaming (struct symbol
*sym
,
3620 const char **renamed_entity
, int *len
,
3621 const char **renaming_expr
)
3623 enum ada_renaming_category kind
;
3628 return ADA_NOT_RENAMING
;
3629 switch (SYMBOL_CLASS (sym
))
3632 return ADA_NOT_RENAMING
;
3634 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3635 renamed_entity
, len
, renaming_expr
);
3639 case LOC_OPTIMIZED_OUT
:
3640 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3642 return ADA_NOT_RENAMING
;
3646 kind
= ADA_OBJECT_RENAMING
;
3650 kind
= ADA_EXCEPTION_RENAMING
;
3654 kind
= ADA_PACKAGE_RENAMING
;
3658 kind
= ADA_SUBPROGRAM_RENAMING
;
3662 return ADA_NOT_RENAMING
;
3666 if (renamed_entity
!= NULL
)
3667 *renamed_entity
= info
;
3668 suffix
= strstr (info
, "___XE");
3669 if (suffix
== NULL
|| suffix
== info
)
3670 return ADA_NOT_RENAMING
;
3672 *len
= strlen (info
) - strlen (suffix
);
3674 if (renaming_expr
!= NULL
)
3675 *renaming_expr
= suffix
;
3679 /* Assuming TYPE encodes a renaming according to the old encoding in
3680 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3681 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3682 ADA_NOT_RENAMING otherwise. */
3683 static enum ada_renaming_category
3684 parse_old_style_renaming (struct type
*type
,
3685 const char **renamed_entity
, int *len
,
3686 const char **renaming_expr
)
3688 enum ada_renaming_category kind
;
3693 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3694 || TYPE_NFIELDS (type
) != 1)
3695 return ADA_NOT_RENAMING
;
3697 name
= type_name_no_tag (type
);
3699 return ADA_NOT_RENAMING
;
3701 name
= strstr (name
, "___XR");
3703 return ADA_NOT_RENAMING
;
3708 kind
= ADA_OBJECT_RENAMING
;
3711 kind
= ADA_EXCEPTION_RENAMING
;
3714 kind
= ADA_PACKAGE_RENAMING
;
3717 kind
= ADA_SUBPROGRAM_RENAMING
;
3720 return ADA_NOT_RENAMING
;
3723 info
= TYPE_FIELD_NAME (type
, 0);
3725 return ADA_NOT_RENAMING
;
3726 if (renamed_entity
!= NULL
)
3727 *renamed_entity
= info
;
3728 suffix
= strstr (info
, "___XE");
3729 if (renaming_expr
!= NULL
)
3730 *renaming_expr
= suffix
+ 5;
3731 if (suffix
== NULL
|| suffix
== info
)
3732 return ADA_NOT_RENAMING
;
3734 *len
= suffix
- info
;
3740 /* Evaluation: Function Calls */
3742 /* Return an lvalue containing the value VAL. This is the identity on
3743 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3744 on the stack, using and updating *SP as the stack pointer, and
3745 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3747 static struct value
*
3748 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3750 if (! VALUE_LVAL (val
))
3752 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3754 /* The following is taken from the structure-return code in
3755 call_function_by_hand. FIXME: Therefore, some refactoring seems
3757 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3759 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3760 reserving sufficient space. */
3762 if (gdbarch_frame_align_p (current_gdbarch
))
3763 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3764 VALUE_ADDRESS (val
) = *sp
;
3768 /* Stack grows upward. Align the frame, allocate space, and
3769 then again, re-align the frame. */
3770 if (gdbarch_frame_align_p (current_gdbarch
))
3771 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3772 VALUE_ADDRESS (val
) = *sp
;
3774 if (gdbarch_frame_align_p (current_gdbarch
))
3775 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3777 VALUE_LVAL (val
) = lval_memory
;
3779 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3785 /* Return the value ACTUAL, converted to be an appropriate value for a
3786 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3787 allocating any necessary descriptors (fat pointers), or copies of
3788 values not residing in memory, updating it as needed. */
3791 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3794 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3795 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3796 struct type
*formal_target
=
3797 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3798 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3799 struct type
*actual_target
=
3800 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3801 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3803 if (ada_is_array_descriptor_type (formal_target
)
3804 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3805 return make_array_descriptor (formal_type
, actual
, sp
);
3806 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3807 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3809 struct value
*result
;
3810 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3811 && ada_is_array_descriptor_type (actual_target
))
3812 result
= desc_data (actual
);
3813 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3815 if (VALUE_LVAL (actual
) != lval_memory
)
3818 actual_type
= ada_check_typedef (value_type (actual
));
3819 val
= allocate_value (actual_type
);
3820 memcpy ((char *) value_contents_raw (val
),
3821 (char *) value_contents (actual
),
3822 TYPE_LENGTH (actual_type
));
3823 actual
= ensure_lval (val
, sp
);
3825 result
= value_addr (actual
);
3829 return value_cast_pointers (formal_type
, result
);
3831 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3832 return ada_value_ind (actual
);
3838 /* Push a descriptor of type TYPE for array value ARR on the stack at
3839 *SP, updating *SP to reflect the new descriptor. Return either
3840 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3841 to-descriptor type rather than a descriptor type), a struct value *
3842 representing a pointer to this descriptor. */
3844 static struct value
*
3845 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3847 struct type
*bounds_type
= desc_bounds_type (type
);
3848 struct type
*desc_type
= desc_base_type (type
);
3849 struct value
*descriptor
= allocate_value (desc_type
);
3850 struct value
*bounds
= allocate_value (bounds_type
);
3853 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3855 modify_general_field (value_contents_writeable (bounds
),
3856 value_as_long (ada_array_bound (arr
, i
, 0)),
3857 desc_bound_bitpos (bounds_type
, i
, 0),
3858 desc_bound_bitsize (bounds_type
, i
, 0));
3859 modify_general_field (value_contents_writeable (bounds
),
3860 value_as_long (ada_array_bound (arr
, i
, 1)),
3861 desc_bound_bitpos (bounds_type
, i
, 1),
3862 desc_bound_bitsize (bounds_type
, i
, 1));
3865 bounds
= ensure_lval (bounds
, sp
);
3867 modify_general_field (value_contents_writeable (descriptor
),
3868 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3869 fat_pntr_data_bitpos (desc_type
),
3870 fat_pntr_data_bitsize (desc_type
));
3872 modify_general_field (value_contents_writeable (descriptor
),
3873 VALUE_ADDRESS (bounds
),
3874 fat_pntr_bounds_bitpos (desc_type
),
3875 fat_pntr_bounds_bitsize (desc_type
));
3877 descriptor
= ensure_lval (descriptor
, sp
);
3879 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3880 return value_addr (descriptor
);
3885 /* Dummy definitions for an experimental caching module that is not
3886 * used in the public sources. */
3889 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3890 struct symbol
**sym
, struct block
**block
)
3896 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3897 struct block
*block
)
3903 /* Return the result of a standard (literal, C-like) lookup of NAME in
3904 given DOMAIN, visible from lexical block BLOCK. */
3906 static struct symbol
*
3907 standard_lookup (const char *name
, const struct block
*block
,
3912 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3914 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3915 cache_symbol (name
, domain
, sym
, block_found
);
3920 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3921 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3922 since they contend in overloading in the same way. */
3924 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3928 for (i
= 0; i
< n
; i
+= 1)
3929 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3930 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3931 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3937 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3938 struct types. Otherwise, they may not. */
3941 equiv_types (struct type
*type0
, struct type
*type1
)
3945 if (type0
== NULL
|| type1
== NULL
3946 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3948 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3949 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3950 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3951 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3957 /* True iff SYM0 represents the same entity as SYM1, or one that is
3958 no more defined than that of SYM1. */
3961 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
3965 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
3966 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
3969 switch (SYMBOL_CLASS (sym0
))
3975 struct type
*type0
= SYMBOL_TYPE (sym0
);
3976 struct type
*type1
= SYMBOL_TYPE (sym1
);
3977 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
3978 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
3979 int len0
= strlen (name0
);
3981 TYPE_CODE (type0
) == TYPE_CODE (type1
)
3982 && (equiv_types (type0
, type1
)
3983 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
3984 && strncmp (name1
+ len0
, "___XV", 5) == 0));
3987 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
3988 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
3994 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
3995 records in OBSTACKP. Do nothing if SYM is a duplicate. */
3998 add_defn_to_vec (struct obstack
*obstackp
,
4000 struct block
*block
)
4004 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4006 /* Do not try to complete stub types, as the debugger is probably
4007 already scanning all symbols matching a certain name at the
4008 time when this function is called. Trying to replace the stub
4009 type by its associated full type will cause us to restart a scan
4010 which may lead to an infinite recursion. Instead, the client
4011 collecting the matching symbols will end up collecting several
4012 matches, with at least one of them complete. It can then filter
4013 out the stub ones if needed. */
4015 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4017 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4019 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4021 prevDefns
[i
].sym
= sym
;
4022 prevDefns
[i
].block
= block
;
4028 struct ada_symbol_info info
;
4032 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4036 /* Number of ada_symbol_info structures currently collected in
4037 current vector in *OBSTACKP. */
4040 num_defns_collected (struct obstack
*obstackp
)
4042 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4045 /* Vector of ada_symbol_info structures currently collected in current
4046 vector in *OBSTACKP. If FINISH, close off the vector and return
4047 its final address. */
4049 static struct ada_symbol_info
*
4050 defns_collected (struct obstack
*obstackp
, int finish
)
4053 return obstack_finish (obstackp
);
4055 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4058 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4059 Check the global symbols if GLOBAL, the static symbols if not.
4060 Do wild-card match if WILD. */
4062 static struct partial_symbol
*
4063 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4064 int global
, domain_enum
namespace, int wild
)
4066 struct partial_symbol
**start
;
4067 int name_len
= strlen (name
);
4068 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4077 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4078 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4082 for (i
= 0; i
< length
; i
+= 1)
4084 struct partial_symbol
*psym
= start
[i
];
4086 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4087 SYMBOL_DOMAIN (psym
), namespace)
4088 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4102 int M
= (U
+ i
) >> 1;
4103 struct partial_symbol
*psym
= start
[M
];
4104 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4106 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4108 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4119 struct partial_symbol
*psym
= start
[i
];
4121 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4122 SYMBOL_DOMAIN (psym
), namespace))
4124 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4132 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4146 int M
= (U
+ i
) >> 1;
4147 struct partial_symbol
*psym
= start
[M
];
4148 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4150 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4152 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4163 struct partial_symbol
*psym
= start
[i
];
4165 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4166 SYMBOL_DOMAIN (psym
), namespace))
4170 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4173 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4175 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4185 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4195 /* Find a symbol table containing symbol SYM or NULL if none. */
4197 static struct symtab
*
4198 symtab_for_sym (struct symbol
*sym
)
4201 struct objfile
*objfile
;
4203 struct symbol
*tmp_sym
;
4204 struct dict_iterator iter
;
4207 ALL_PRIMARY_SYMTABS (objfile
, s
)
4209 switch (SYMBOL_CLASS (sym
))
4217 case LOC_CONST_BYTES
:
4218 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4219 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4221 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4222 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4228 switch (SYMBOL_CLASS (sym
))
4233 case LOC_REGPARM_ADDR
:
4237 for (j
= FIRST_LOCAL_BLOCK
;
4238 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4240 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4241 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4252 /* Return a minimal symbol matching NAME according to Ada decoding
4253 rules. Returns NULL if there is no such minimal symbol. Names
4254 prefixed with "standard__" are handled specially: "standard__" is
4255 first stripped off, and only static and global symbols are searched. */
4257 struct minimal_symbol
*
4258 ada_lookup_simple_minsym (const char *name
)
4260 struct objfile
*objfile
;
4261 struct minimal_symbol
*msymbol
;
4264 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4266 name
+= sizeof ("standard__") - 1;
4270 wild_match
= (strstr (name
, "__") == NULL
);
4272 ALL_MSYMBOLS (objfile
, msymbol
)
4274 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4275 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4282 /* For all subprograms that statically enclose the subprogram of the
4283 selected frame, add symbols matching identifier NAME in DOMAIN
4284 and their blocks to the list of data in OBSTACKP, as for
4285 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4289 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4290 const char *name
, domain_enum
namespace,
4295 /* True if TYPE is definitely an artificial type supplied to a symbol
4296 for which no debugging information was given in the symbol file. */
4299 is_nondebugging_type (struct type
*type
)
4301 char *name
= ada_type_name (type
);
4302 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4305 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4306 duplicate other symbols in the list (The only case I know of where
4307 this happens is when object files containing stabs-in-ecoff are
4308 linked with files containing ordinary ecoff debugging symbols (or no
4309 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4310 Returns the number of items in the modified list. */
4313 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4322 /* If two symbols have the same name and one of them is a stub type,
4323 the get rid of the stub. */
4325 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4326 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4328 for (j
= 0; j
< nsyms
; j
++)
4331 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4332 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4333 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4334 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4339 /* Two symbols with the same name, same class and same address
4340 should be identical. */
4342 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4343 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4344 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4346 for (j
= 0; j
< nsyms
; j
+= 1)
4349 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4350 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4351 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4352 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4353 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4354 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4361 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4362 syms
[j
- 1] = syms
[j
];
4371 /* Given a type that corresponds to a renaming entity, use the type name
4372 to extract the scope (package name or function name, fully qualified,
4373 and following the GNAT encoding convention) where this renaming has been
4374 defined. The string returned needs to be deallocated after use. */
4377 xget_renaming_scope (struct type
*renaming_type
)
4379 /* The renaming types adhere to the following convention:
4380 <scope>__<rename>___<XR extension>.
4381 So, to extract the scope, we search for the "___XR" extension,
4382 and then backtrack until we find the first "__". */
4384 const char *name
= type_name_no_tag (renaming_type
);
4385 char *suffix
= strstr (name
, "___XR");
4390 /* Now, backtrack a bit until we find the first "__". Start looking
4391 at suffix - 3, as the <rename> part is at least one character long. */
4393 for (last
= suffix
- 3; last
> name
; last
--)
4394 if (last
[0] == '_' && last
[1] == '_')
4397 /* Make a copy of scope and return it. */
4399 scope_len
= last
- name
;
4400 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4402 strncpy (scope
, name
, scope_len
);
4403 scope
[scope_len
] = '\0';
4408 /* Return nonzero if NAME corresponds to a package name. */
4411 is_package_name (const char *name
)
4413 /* Here, We take advantage of the fact that no symbols are generated
4414 for packages, while symbols are generated for each function.
4415 So the condition for NAME represent a package becomes equivalent
4416 to NAME not existing in our list of symbols. There is only one
4417 small complication with library-level functions (see below). */
4421 /* If it is a function that has not been defined at library level,
4422 then we should be able to look it up in the symbols. */
4423 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4426 /* Library-level function names start with "_ada_". See if function
4427 "_ada_" followed by NAME can be found. */
4429 /* Do a quick check that NAME does not contain "__", since library-level
4430 functions names cannot contain "__" in them. */
4431 if (strstr (name
, "__") != NULL
)
4434 fun_name
= xstrprintf ("_ada_%s", name
);
4436 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4439 /* Return nonzero if SYM corresponds to a renaming entity that is
4440 not visible from FUNCTION_NAME. */
4443 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4447 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4450 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4452 make_cleanup (xfree
, scope
);
4454 /* If the rename has been defined in a package, then it is visible. */
4455 if (is_package_name (scope
))
4458 /* Check that the rename is in the current function scope by checking
4459 that its name starts with SCOPE. */
4461 /* If the function name starts with "_ada_", it means that it is
4462 a library-level function. Strip this prefix before doing the
4463 comparison, as the encoding for the renaming does not contain
4465 if (strncmp (function_name
, "_ada_", 5) == 0)
4468 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4471 /* Remove entries from SYMS that corresponds to a renaming entity that
4472 is not visible from the function associated with CURRENT_BLOCK or
4473 that is superfluous due to the presence of more specific renaming
4474 information. Places surviving symbols in the initial entries of
4475 SYMS and returns the number of surviving symbols.
4478 First, in cases where an object renaming is implemented as a
4479 reference variable, GNAT may produce both the actual reference
4480 variable and the renaming encoding. In this case, we discard the
4483 Second, GNAT emits a type following a specified encoding for each renaming
4484 entity. Unfortunately, STABS currently does not support the definition
4485 of types that are local to a given lexical block, so all renamings types
4486 are emitted at library level. As a consequence, if an application
4487 contains two renaming entities using the same name, and a user tries to
4488 print the value of one of these entities, the result of the ada symbol
4489 lookup will also contain the wrong renaming type.
4491 This function partially covers for this limitation by attempting to
4492 remove from the SYMS list renaming symbols that should be visible
4493 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4494 method with the current information available. The implementation
4495 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4497 - When the user tries to print a rename in a function while there
4498 is another rename entity defined in a package: Normally, the
4499 rename in the function has precedence over the rename in the
4500 package, so the latter should be removed from the list. This is
4501 currently not the case.
4503 - This function will incorrectly remove valid renames if
4504 the CURRENT_BLOCK corresponds to a function which symbol name
4505 has been changed by an "Export" pragma. As a consequence,
4506 the user will be unable to print such rename entities. */
4509 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4510 int nsyms
, const struct block
*current_block
)
4512 struct symbol
*current_function
;
4513 char *current_function_name
;
4515 int is_new_style_renaming
;
4517 /* If there is both a renaming foo___XR... encoded as a variable and
4518 a simple variable foo in the same block, discard the latter.
4519 First, zero out such symbols, then compress. */
4520 is_new_style_renaming
= 0;
4521 for (i
= 0; i
< nsyms
; i
+= 1)
4523 struct symbol
*sym
= syms
[i
].sym
;
4524 struct block
*block
= syms
[i
].block
;
4528 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4530 name
= SYMBOL_LINKAGE_NAME (sym
);
4531 suffix
= strstr (name
, "___XR");
4535 int name_len
= suffix
- name
;
4537 is_new_style_renaming
= 1;
4538 for (j
= 0; j
< nsyms
; j
+= 1)
4539 if (i
!= j
&& syms
[j
].sym
!= NULL
4540 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4542 && block
== syms
[j
].block
)
4546 if (is_new_style_renaming
)
4550 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4551 if (syms
[j
].sym
!= NULL
)
4559 /* Extract the function name associated to CURRENT_BLOCK.
4560 Abort if unable to do so. */
4562 if (current_block
== NULL
)
4565 current_function
= block_linkage_function (current_block
);
4566 if (current_function
== NULL
)
4569 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4570 if (current_function_name
== NULL
)
4573 /* Check each of the symbols, and remove it from the list if it is
4574 a type corresponding to a renaming that is out of the scope of
4575 the current block. */
4580 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4581 == ADA_OBJECT_RENAMING
4582 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4585 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4586 syms
[j
- 1] = syms
[j
];
4596 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4597 whose name and domain match NAME and DOMAIN respectively.
4598 If no match was found, then extend the search to "enclosing"
4599 routines (in other words, if we're inside a nested function,
4600 search the symbols defined inside the enclosing functions).
4602 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4605 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4606 struct block
*block
, domain_enum domain
,
4609 int block_depth
= 0;
4611 while (block
!= NULL
)
4614 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4616 /* If we found a non-function match, assume that's the one. */
4617 if (is_nonfunction (defns_collected (obstackp
, 0),
4618 num_defns_collected (obstackp
)))
4621 block
= BLOCK_SUPERBLOCK (block
);
4624 /* If no luck so far, try to find NAME as a local symbol in some lexically
4625 enclosing subprogram. */
4626 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4627 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4630 /* Add to OBSTACKP all non-local symbols whose name and domain match
4631 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4632 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4635 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4636 domain_enum domain
, int global
,
4639 struct objfile
*objfile
;
4640 struct partial_symtab
*ps
;
4642 ALL_PSYMTABS (objfile
, ps
)
4646 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4648 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4649 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4651 if (s
== NULL
|| !s
->primary
)
4653 ada_add_block_symbols (obstackp
,
4654 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4655 name
, domain
, objfile
, wild_match
);
4660 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4661 scope and in global scopes, returning the number of matches. Sets
4662 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4663 indicating the symbols found and the blocks and symbol tables (if
4664 any) in which they were found. This vector are transient---good only to
4665 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4666 symbol match within the nest of blocks whose innermost member is BLOCK0,
4667 is the one match returned (no other matches in that or
4668 enclosing blocks is returned). If there are any matches in or
4669 surrounding BLOCK0, then these alone are returned. Otherwise, the
4670 search extends to global and file-scope (static) symbol tables.
4671 Names prefixed with "standard__" are handled specially: "standard__"
4672 is first stripped off, and only static and global symbols are searched. */
4675 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4676 domain_enum
namespace,
4677 struct ada_symbol_info
**results
)
4680 struct block
*block
;
4686 obstack_free (&symbol_list_obstack
, NULL
);
4687 obstack_init (&symbol_list_obstack
);
4691 /* Search specified block and its superiors. */
4693 wild_match
= (strstr (name0
, "__") == NULL
);
4695 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4696 needed, but adding const will
4697 have a cascade effect. */
4699 /* Special case: If the user specifies a symbol name inside package
4700 Standard, do a non-wild matching of the symbol name without
4701 the "standard__" prefix. This was primarily introduced in order
4702 to allow the user to specifically access the standard exceptions
4703 using, for instance, Standard.Constraint_Error when Constraint_Error
4704 is ambiguous (due to the user defining its own Constraint_Error
4705 entity inside its program). */
4706 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4710 name
= name0
+ sizeof ("standard__") - 1;
4713 /* Check the non-global symbols. If we have ANY match, then we're done. */
4715 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4717 if (num_defns_collected (&symbol_list_obstack
) > 0)
4720 /* No non-global symbols found. Check our cache to see if we have
4721 already performed this search before. If we have, then return
4725 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4728 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4732 /* Search symbols from all global blocks. */
4734 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4737 /* Now add symbols from all per-file blocks if we've gotten no hits
4738 (not strictly correct, but perhaps better than an error). */
4740 if (num_defns_collected (&symbol_list_obstack
) == 0)
4741 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4745 ndefns
= num_defns_collected (&symbol_list_obstack
);
4746 *results
= defns_collected (&symbol_list_obstack
, 1);
4748 ndefns
= remove_extra_symbols (*results
, ndefns
);
4751 cache_symbol (name0
, namespace, NULL
, NULL
);
4753 if (ndefns
== 1 && cacheIfUnique
)
4754 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4756 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4762 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4763 domain_enum
namespace, struct block
**block_found
)
4765 struct ada_symbol_info
*candidates
;
4768 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4770 if (n_candidates
== 0)
4773 if (block_found
!= NULL
)
4774 *block_found
= candidates
[0].block
;
4776 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4779 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4780 scope and in global scopes, or NULL if none. NAME is folded and
4781 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4782 choosing the first symbol if there are multiple choices.
4783 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4784 table in which the symbol was found (in both cases, these
4785 assignments occur only if the pointers are non-null). */
4787 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4788 domain_enum
namespace, int *is_a_field_of_this
)
4790 if (is_a_field_of_this
!= NULL
)
4791 *is_a_field_of_this
= 0;
4794 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4795 block0
, namespace, NULL
);
4798 static struct symbol
*
4799 ada_lookup_symbol_nonlocal (const char *name
,
4800 const char *linkage_name
,
4801 const struct block
*block
,
4802 const domain_enum domain
)
4804 if (linkage_name
== NULL
)
4805 linkage_name
= name
;
4806 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4811 /* True iff STR is a possible encoded suffix of a normal Ada name
4812 that is to be ignored for matching purposes. Suffixes of parallel
4813 names (e.g., XVE) are not included here. Currently, the possible suffixes
4814 are given by any of the regular expressions:
4816 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4817 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4818 _E[0-9]+[bs]$ [protected object entry suffixes]
4819 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4821 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4822 match is performed. This sequence is used to differentiate homonyms,
4823 is an optional part of a valid name suffix. */
4826 is_name_suffix (const char *str
)
4829 const char *matching
;
4830 const int len
= strlen (str
);
4832 /* Skip optional leading __[0-9]+. */
4834 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4837 while (isdigit (str
[0]))
4843 if (str
[0] == '.' || str
[0] == '$')
4846 while (isdigit (matching
[0]))
4848 if (matching
[0] == '\0')
4854 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4857 while (isdigit (matching
[0]))
4859 if (matching
[0] == '\0')
4864 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4865 with a N at the end. Unfortunately, the compiler uses the same
4866 convention for other internal types it creates. So treating
4867 all entity names that end with an "N" as a name suffix causes
4868 some regressions. For instance, consider the case of an enumerated
4869 type. To support the 'Image attribute, it creates an array whose
4871 Having a single character like this as a suffix carrying some
4872 information is a bit risky. Perhaps we should change the encoding
4873 to be something like "_N" instead. In the meantime, do not do
4874 the following check. */
4875 /* Protected Object Subprograms */
4876 if (len
== 1 && str
[0] == 'N')
4881 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4884 while (isdigit (matching
[0]))
4886 if ((matching
[0] == 'b' || matching
[0] == 's')
4887 && matching
[1] == '\0')
4891 /* ??? We should not modify STR directly, as we are doing below. This
4892 is fine in this case, but may become problematic later if we find
4893 that this alternative did not work, and want to try matching
4894 another one from the begining of STR. Since we modified it, we
4895 won't be able to find the begining of the string anymore! */
4899 while (str
[0] != '_' && str
[0] != '\0')
4901 if (str
[0] != 'n' && str
[0] != 'b')
4907 if (str
[0] == '\000')
4912 if (str
[1] != '_' || str
[2] == '\000')
4916 if (strcmp (str
+ 3, "JM") == 0)
4918 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4919 the LJM suffix in favor of the JM one. But we will
4920 still accept LJM as a valid suffix for a reasonable
4921 amount of time, just to allow ourselves to debug programs
4922 compiled using an older version of GNAT. */
4923 if (strcmp (str
+ 3, "LJM") == 0)
4927 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4928 || str
[4] == 'U' || str
[4] == 'P')
4930 if (str
[4] == 'R' && str
[5] != 'T')
4934 if (!isdigit (str
[2]))
4936 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4937 if (!isdigit (str
[k
]) && str
[k
] != '_')
4941 if (str
[0] == '$' && isdigit (str
[1]))
4943 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4944 if (!isdigit (str
[k
]) && str
[k
] != '_')
4951 /* Return non-zero if the string starting at NAME and ending before
4952 NAME_END contains no capital letters. */
4955 is_valid_name_for_wild_match (const char *name0
)
4957 const char *decoded_name
= ada_decode (name0
);
4960 /* If the decoded name starts with an angle bracket, it means that
4961 NAME0 does not follow the GNAT encoding format. It should then
4962 not be allowed as a possible wild match. */
4963 if (decoded_name
[0] == '<')
4966 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4967 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4973 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4974 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4975 informational suffixes of NAME (i.e., for which is_name_suffix is
4979 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4986 match
= strstr (start
, patn0
);
4991 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4992 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4993 && is_name_suffix (match
+ patn_len
))
4994 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
5000 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5001 vector *defn_symbols, updating the list of symbols in OBSTACKP
5002 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5003 OBJFILE is the section containing BLOCK.
5004 SYMTAB is recorded with each symbol added. */
5007 ada_add_block_symbols (struct obstack
*obstackp
,
5008 struct block
*block
, const char *name
,
5009 domain_enum domain
, struct objfile
*objfile
,
5012 struct dict_iterator iter
;
5013 int name_len
= strlen (name
);
5014 /* A matching argument symbol, if any. */
5015 struct symbol
*arg_sym
;
5016 /* Set true when we find a matching non-argument symbol. */
5025 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5027 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5028 SYMBOL_DOMAIN (sym
), domain
)
5029 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5031 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5033 else if (SYMBOL_IS_ARGUMENT (sym
))
5038 add_defn_to_vec (obstackp
,
5039 fixup_symbol_section (sym
, objfile
),
5047 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5049 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5050 SYMBOL_DOMAIN (sym
), domain
))
5052 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5054 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5056 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5058 if (SYMBOL_IS_ARGUMENT (sym
))
5063 add_defn_to_vec (obstackp
,
5064 fixup_symbol_section (sym
, objfile
),
5073 if (!found_sym
&& arg_sym
!= NULL
)
5075 add_defn_to_vec (obstackp
,
5076 fixup_symbol_section (arg_sym
, objfile
),
5085 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5087 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5088 SYMBOL_DOMAIN (sym
), domain
))
5092 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5095 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5097 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5102 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5104 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5106 if (SYMBOL_IS_ARGUMENT (sym
))
5111 add_defn_to_vec (obstackp
,
5112 fixup_symbol_section (sym
, objfile
),
5120 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5121 They aren't parameters, right? */
5122 if (!found_sym
&& arg_sym
!= NULL
)
5124 add_defn_to_vec (obstackp
,
5125 fixup_symbol_section (arg_sym
, objfile
),
5132 /* Symbol Completion */
5134 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5135 name in a form that's appropriate for the completion. The result
5136 does not need to be deallocated, but is only good until the next call.
5138 TEXT_LEN is equal to the length of TEXT.
5139 Perform a wild match if WILD_MATCH is set.
5140 ENCODED should be set if TEXT represents the start of a symbol name
5141 in its encoded form. */
5144 symbol_completion_match (const char *sym_name
,
5145 const char *text
, int text_len
,
5146 int wild_match
, int encoded
)
5149 const int verbatim_match
= (text
[0] == '<');
5154 /* Strip the leading angle bracket. */
5159 /* First, test against the fully qualified name of the symbol. */
5161 if (strncmp (sym_name
, text
, text_len
) == 0)
5164 if (match
&& !encoded
)
5166 /* One needed check before declaring a positive match is to verify
5167 that iff we are doing a verbatim match, the decoded version
5168 of the symbol name starts with '<'. Otherwise, this symbol name
5169 is not a suitable completion. */
5170 const char *sym_name_copy
= sym_name
;
5171 int has_angle_bracket
;
5173 sym_name
= ada_decode (sym_name
);
5174 has_angle_bracket
= (sym_name
[0] == '<');
5175 match
= (has_angle_bracket
== verbatim_match
);
5176 sym_name
= sym_name_copy
;
5179 if (match
&& !verbatim_match
)
5181 /* When doing non-verbatim match, another check that needs to
5182 be done is to verify that the potentially matching symbol name
5183 does not include capital letters, because the ada-mode would
5184 not be able to understand these symbol names without the
5185 angle bracket notation. */
5188 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5193 /* Second: Try wild matching... */
5195 if (!match
&& wild_match
)
5197 /* Since we are doing wild matching, this means that TEXT
5198 may represent an unqualified symbol name. We therefore must
5199 also compare TEXT against the unqualified name of the symbol. */
5200 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5202 if (strncmp (sym_name
, text
, text_len
) == 0)
5206 /* Finally: If we found a mach, prepare the result to return. */
5212 sym_name
= add_angle_brackets (sym_name
);
5215 sym_name
= ada_decode (sym_name
);
5220 typedef char *char_ptr
;
5221 DEF_VEC_P (char_ptr
);
5223 /* A companion function to ada_make_symbol_completion_list().
5224 Check if SYM_NAME represents a symbol which name would be suitable
5225 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5226 it is appended at the end of the given string vector SV.
5228 ORIG_TEXT is the string original string from the user command
5229 that needs to be completed. WORD is the entire command on which
5230 completion should be performed. These two parameters are used to
5231 determine which part of the symbol name should be added to the
5233 if WILD_MATCH is set, then wild matching is performed.
5234 ENCODED should be set if TEXT represents a symbol name in its
5235 encoded formed (in which case the completion should also be
5239 symbol_completion_add (VEC(char_ptr
) **sv
,
5240 const char *sym_name
,
5241 const char *text
, int text_len
,
5242 const char *orig_text
, const char *word
,
5243 int wild_match
, int encoded
)
5245 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5246 wild_match
, encoded
);
5252 /* We found a match, so add the appropriate completion to the given
5255 if (word
== orig_text
)
5257 completion
= xmalloc (strlen (match
) + 5);
5258 strcpy (completion
, match
);
5260 else if (word
> orig_text
)
5262 /* Return some portion of sym_name. */
5263 completion
= xmalloc (strlen (match
) + 5);
5264 strcpy (completion
, match
+ (word
- orig_text
));
5268 /* Return some of ORIG_TEXT plus sym_name. */
5269 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5270 strncpy (completion
, word
, orig_text
- word
);
5271 completion
[orig_text
- word
] = '\0';
5272 strcat (completion
, match
);
5275 VEC_safe_push (char_ptr
, *sv
, completion
);
5278 /* Return a list of possible symbol names completing TEXT0. The list
5279 is NULL terminated. WORD is the entire command on which completion
5283 ada_make_symbol_completion_list (char *text0
, char *word
)
5289 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5292 struct partial_symtab
*ps
;
5293 struct minimal_symbol
*msymbol
;
5294 struct objfile
*objfile
;
5295 struct block
*b
, *surrounding_static_block
= 0;
5297 struct dict_iterator iter
;
5299 if (text0
[0] == '<')
5301 text
= xstrdup (text0
);
5302 make_cleanup (xfree
, text
);
5303 text_len
= strlen (text
);
5309 text
= xstrdup (ada_encode (text0
));
5310 make_cleanup (xfree
, text
);
5311 text_len
= strlen (text
);
5312 for (i
= 0; i
< text_len
; i
++)
5313 text
[i
] = tolower (text
[i
]);
5315 encoded
= (strstr (text0
, "__") != NULL
);
5316 /* If the name contains a ".", then the user is entering a fully
5317 qualified entity name, and the match must not be done in wild
5318 mode. Similarly, if the user wants to complete what looks like
5319 an encoded name, the match must not be done in wild mode. */
5320 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5323 /* First, look at the partial symtab symbols. */
5324 ALL_PSYMTABS (objfile
, ps
)
5326 struct partial_symbol
**psym
;
5328 /* If the psymtab's been read in we'll get it when we search
5329 through the blockvector. */
5333 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5334 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5335 + ps
->n_global_syms
); psym
++)
5338 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5339 text
, text_len
, text0
, word
,
5340 wild_match
, encoded
);
5343 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5344 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5345 + ps
->n_static_syms
); psym
++)
5348 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5349 text
, text_len
, text0
, word
,
5350 wild_match
, encoded
);
5354 /* At this point scan through the misc symbol vectors and add each
5355 symbol you find to the list. Eventually we want to ignore
5356 anything that isn't a text symbol (everything else will be
5357 handled by the psymtab code above). */
5359 ALL_MSYMBOLS (objfile
, msymbol
)
5362 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5363 text
, text_len
, text0
, word
, wild_match
, encoded
);
5366 /* Search upwards from currently selected frame (so that we can
5367 complete on local vars. */
5369 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5371 if (!BLOCK_SUPERBLOCK (b
))
5372 surrounding_static_block
= b
; /* For elmin of dups */
5374 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5376 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5377 text
, text_len
, text0
, word
,
5378 wild_match
, encoded
);
5382 /* Go through the symtabs and check the externs and statics for
5383 symbols which match. */
5385 ALL_SYMTABS (objfile
, s
)
5388 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5389 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5391 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5392 text
, text_len
, text0
, word
,
5393 wild_match
, encoded
);
5397 ALL_SYMTABS (objfile
, s
)
5400 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5401 /* Don't do this block twice. */
5402 if (b
== surrounding_static_block
)
5404 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5406 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5407 text
, text_len
, text0
, word
,
5408 wild_match
, encoded
);
5412 /* Append the closing NULL entry. */
5413 VEC_safe_push (char_ptr
, completions
, NULL
);
5415 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5416 return the copy. It's unfortunate that we have to make a copy
5417 of an array that we're about to destroy, but there is nothing much
5418 we can do about it. Fortunately, it's typically not a very large
5421 const size_t completions_size
=
5422 VEC_length (char_ptr
, completions
) * sizeof (char *);
5423 char **result
= malloc (completions_size
);
5425 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5427 VEC_free (char_ptr
, completions
);
5434 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5435 for tagged types. */
5438 ada_is_dispatch_table_ptr_type (struct type
*type
)
5442 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5445 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5449 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5452 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5453 to be invisible to users. */
5456 ada_is_ignored_field (struct type
*type
, int field_num
)
5458 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5461 /* Check the name of that field. */
5463 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5465 /* Anonymous field names should not be printed.
5466 brobecker/2007-02-20: I don't think this can actually happen
5467 but we don't want to print the value of annonymous fields anyway. */
5471 /* A field named "_parent" is internally generated by GNAT for
5472 tagged types, and should not be printed either. */
5473 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5477 /* If this is the dispatch table of a tagged type, then ignore. */
5478 if (ada_is_tagged_type (type
, 1)
5479 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5482 /* Not a special field, so it should not be ignored. */
5486 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5487 pointer or reference type whose ultimate target has a tag field. */
5490 ada_is_tagged_type (struct type
*type
, int refok
)
5492 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5495 /* True iff TYPE represents the type of X'Tag */
5498 ada_is_tag_type (struct type
*type
)
5500 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5504 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5505 return (name
!= NULL
5506 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5510 /* The type of the tag on VAL. */
5513 ada_tag_type (struct value
*val
)
5515 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5518 /* The value of the tag on VAL. */
5521 ada_value_tag (struct value
*val
)
5523 return ada_value_struct_elt (val
, "_tag", 0);
5526 /* The value of the tag on the object of type TYPE whose contents are
5527 saved at VALADDR, if it is non-null, or is at memory address
5530 static struct value
*
5531 value_tag_from_contents_and_address (struct type
*type
,
5532 const gdb_byte
*valaddr
,
5535 int tag_byte_offset
, dummy1
, dummy2
;
5536 struct type
*tag_type
;
5537 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5540 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5542 : valaddr
+ tag_byte_offset
);
5543 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5545 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5550 static struct type
*
5551 type_from_tag (struct value
*tag
)
5553 const char *type_name
= ada_tag_name (tag
);
5554 if (type_name
!= NULL
)
5555 return ada_find_any_type (ada_encode (type_name
));
5566 static int ada_tag_name_1 (void *);
5567 static int ada_tag_name_2 (struct tag_args
*);
5569 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5570 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5571 The value stored in ARGS->name is valid until the next call to
5575 ada_tag_name_1 (void *args0
)
5577 struct tag_args
*args
= (struct tag_args
*) args0
;
5578 static char name
[1024];
5582 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5584 return ada_tag_name_2 (args
);
5585 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5588 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5589 for (p
= name
; *p
!= '\0'; p
+= 1)
5596 /* Utility function for ada_tag_name_1 that tries the second
5597 representation for the dispatch table (in which there is no
5598 explicit 'tsd' field in the referent of the tag pointer, and instead
5599 the tsd pointer is stored just before the dispatch table. */
5602 ada_tag_name_2 (struct tag_args
*args
)
5604 struct type
*info_type
;
5605 static char name
[1024];
5607 struct value
*val
, *valp
;
5610 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5611 if (info_type
== NULL
)
5613 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5614 valp
= value_cast (info_type
, args
->tag
);
5617 val
= value_ind (value_ptradd (valp
,
5618 value_from_longest (builtin_type_int8
, -1)));
5621 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5624 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5625 for (p
= name
; *p
!= '\0'; p
+= 1)
5632 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5636 ada_tag_name (struct value
*tag
)
5638 struct tag_args args
;
5639 if (!ada_is_tag_type (value_type (tag
)))
5643 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5647 /* The parent type of TYPE, or NULL if none. */
5650 ada_parent_type (struct type
*type
)
5654 type
= ada_check_typedef (type
);
5656 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5659 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5660 if (ada_is_parent_field (type
, i
))
5662 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5664 /* If the _parent field is a pointer, then dereference it. */
5665 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5666 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5667 /* If there is a parallel XVS type, get the actual base type. */
5668 parent_type
= ada_get_base_type (parent_type
);
5670 return ada_check_typedef (parent_type
);
5676 /* True iff field number FIELD_NUM of structure type TYPE contains the
5677 parent-type (inherited) fields of a derived type. Assumes TYPE is
5678 a structure type with at least FIELD_NUM+1 fields. */
5681 ada_is_parent_field (struct type
*type
, int field_num
)
5683 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5684 return (name
!= NULL
5685 && (strncmp (name
, "PARENT", 6) == 0
5686 || strncmp (name
, "_parent", 7) == 0));
5689 /* True iff field number FIELD_NUM of structure type TYPE is a
5690 transparent wrapper field (which should be silently traversed when doing
5691 field selection and flattened when printing). Assumes TYPE is a
5692 structure type with at least FIELD_NUM+1 fields. Such fields are always
5696 ada_is_wrapper_field (struct type
*type
, int field_num
)
5698 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5699 return (name
!= NULL
5700 && (strncmp (name
, "PARENT", 6) == 0
5701 || strcmp (name
, "REP") == 0
5702 || strncmp (name
, "_parent", 7) == 0
5703 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5706 /* True iff field number FIELD_NUM of structure or union type TYPE
5707 is a variant wrapper. Assumes TYPE is a structure type with at least
5708 FIELD_NUM+1 fields. */
5711 ada_is_variant_part (struct type
*type
, int field_num
)
5713 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5714 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5715 || (is_dynamic_field (type
, field_num
)
5716 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5717 == TYPE_CODE_UNION
)));
5720 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5721 whose discriminants are contained in the record type OUTER_TYPE,
5722 returns the type of the controlling discriminant for the variant. */
5725 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5727 char *name
= ada_variant_discrim_name (var_type
);
5729 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5731 return builtin_type_int32
;
5736 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5737 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5738 represents a 'when others' clause; otherwise 0. */
5741 ada_is_others_clause (struct type
*type
, int field_num
)
5743 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5744 return (name
!= NULL
&& name
[0] == 'O');
5747 /* Assuming that TYPE0 is the type of the variant part of a record,
5748 returns the name of the discriminant controlling the variant.
5749 The value is valid until the next call to ada_variant_discrim_name. */
5752 ada_variant_discrim_name (struct type
*type0
)
5754 static char *result
= NULL
;
5755 static size_t result_len
= 0;
5758 const char *discrim_end
;
5759 const char *discrim_start
;
5761 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5762 type
= TYPE_TARGET_TYPE (type0
);
5766 name
= ada_type_name (type
);
5768 if (name
== NULL
|| name
[0] == '\000')
5771 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5774 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5777 if (discrim_end
== name
)
5780 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5783 if (discrim_start
== name
+ 1)
5785 if ((discrim_start
> name
+ 3
5786 && strncmp (discrim_start
- 3, "___", 3) == 0)
5787 || discrim_start
[-1] == '.')
5791 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5792 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5793 result
[discrim_end
- discrim_start
] = '\0';
5797 /* Scan STR for a subtype-encoded number, beginning at position K.
5798 Put the position of the character just past the number scanned in
5799 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5800 Return 1 if there was a valid number at the given position, and 0
5801 otherwise. A "subtype-encoded" number consists of the absolute value
5802 in decimal, followed by the letter 'm' to indicate a negative number.
5803 Assumes 0m does not occur. */
5806 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5810 if (!isdigit (str
[k
]))
5813 /* Do it the hard way so as not to make any assumption about
5814 the relationship of unsigned long (%lu scan format code) and
5817 while (isdigit (str
[k
]))
5819 RU
= RU
* 10 + (str
[k
] - '0');
5826 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5832 /* NOTE on the above: Technically, C does not say what the results of
5833 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5834 number representable as a LONGEST (although either would probably work
5835 in most implementations). When RU>0, the locution in the then branch
5836 above is always equivalent to the negative of RU. */
5843 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5844 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5845 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5848 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5850 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5863 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5872 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5873 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5875 if (val
>= L
&& val
<= U
)
5887 /* FIXME: Lots of redundancy below. Try to consolidate. */
5889 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5890 ARG_TYPE, extract and return the value of one of its (non-static)
5891 fields. FIELDNO says which field. Differs from value_primitive_field
5892 only in that it can handle packed values of arbitrary type. */
5894 static struct value
*
5895 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5896 struct type
*arg_type
)
5900 arg_type
= ada_check_typedef (arg_type
);
5901 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5903 /* Handle packed fields. */
5905 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5907 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5908 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5910 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5911 offset
+ bit_pos
/ 8,
5912 bit_pos
% 8, bit_size
, type
);
5915 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5918 /* Find field with name NAME in object of type TYPE. If found,
5919 set the following for each argument that is non-null:
5920 - *FIELD_TYPE_P to the field's type;
5921 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5922 an object of that type;
5923 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5924 - *BIT_SIZE_P to its size in bits if the field is packed, and
5926 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5927 fields up to but not including the desired field, or by the total
5928 number of fields if not found. A NULL value of NAME never
5929 matches; the function just counts visible fields in this case.
5931 Returns 1 if found, 0 otherwise. */
5934 find_struct_field (char *name
, struct type
*type
, int offset
,
5935 struct type
**field_type_p
,
5936 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5941 type
= ada_check_typedef (type
);
5943 if (field_type_p
!= NULL
)
5944 *field_type_p
= NULL
;
5945 if (byte_offset_p
!= NULL
)
5947 if (bit_offset_p
!= NULL
)
5949 if (bit_size_p
!= NULL
)
5952 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5954 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5955 int fld_offset
= offset
+ bit_pos
/ 8;
5956 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5958 if (t_field_name
== NULL
)
5961 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5963 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5964 if (field_type_p
!= NULL
)
5965 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5966 if (byte_offset_p
!= NULL
)
5967 *byte_offset_p
= fld_offset
;
5968 if (bit_offset_p
!= NULL
)
5969 *bit_offset_p
= bit_pos
% 8;
5970 if (bit_size_p
!= NULL
)
5971 *bit_size_p
= bit_size
;
5974 else if (ada_is_wrapper_field (type
, i
))
5976 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5977 field_type_p
, byte_offset_p
, bit_offset_p
,
5978 bit_size_p
, index_p
))
5981 else if (ada_is_variant_part (type
, i
))
5983 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5986 struct type
*field_type
5987 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5989 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5991 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5993 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5994 field_type_p
, byte_offset_p
,
5995 bit_offset_p
, bit_size_p
, index_p
))
5999 else if (index_p
!= NULL
)
6005 /* Number of user-visible fields in record type TYPE. */
6008 num_visible_fields (struct type
*type
)
6012 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6016 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6017 and search in it assuming it has (class) type TYPE.
6018 If found, return value, else return NULL.
6020 Searches recursively through wrapper fields (e.g., '_parent'). */
6022 static struct value
*
6023 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6027 type
= ada_check_typedef (type
);
6029 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6031 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6033 if (t_field_name
== NULL
)
6036 else if (field_name_match (t_field_name
, name
))
6037 return ada_value_primitive_field (arg
, offset
, i
, type
);
6039 else if (ada_is_wrapper_field (type
, i
))
6041 struct value
*v
= /* Do not let indent join lines here. */
6042 ada_search_struct_field (name
, arg
,
6043 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6044 TYPE_FIELD_TYPE (type
, i
));
6049 else if (ada_is_variant_part (type
, i
))
6051 /* PNH: Do we ever get here? See find_struct_field. */
6053 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6054 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6056 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6058 struct value
*v
= ada_search_struct_field
/* Force line break. */
6060 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6061 TYPE_FIELD_TYPE (field_type
, j
));
6070 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6071 int, struct type
*);
6074 /* Return field #INDEX in ARG, where the index is that returned by
6075 * find_struct_field through its INDEX_P argument. Adjust the address
6076 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6077 * If found, return value, else return NULL. */
6079 static struct value
*
6080 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6083 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6087 /* Auxiliary function for ada_index_struct_field. Like
6088 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6091 static struct value
*
6092 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6096 type
= ada_check_typedef (type
);
6098 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6100 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6102 else if (ada_is_wrapper_field (type
, i
))
6104 struct value
*v
= /* Do not let indent join lines here. */
6105 ada_index_struct_field_1 (index_p
, arg
,
6106 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6107 TYPE_FIELD_TYPE (type
, i
));
6112 else if (ada_is_variant_part (type
, i
))
6114 /* PNH: Do we ever get here? See ada_search_struct_field,
6115 find_struct_field. */
6116 error (_("Cannot assign this kind of variant record"));
6118 else if (*index_p
== 0)
6119 return ada_value_primitive_field (arg
, offset
, i
, type
);
6126 /* Given ARG, a value of type (pointer or reference to a)*
6127 structure/union, extract the component named NAME from the ultimate
6128 target structure/union and return it as a value with its
6131 The routine searches for NAME among all members of the structure itself
6132 and (recursively) among all members of any wrapper members
6135 If NO_ERR, then simply return NULL in case of error, rather than
6139 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6141 struct type
*t
, *t1
;
6145 t1
= t
= ada_check_typedef (value_type (arg
));
6146 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6148 t1
= TYPE_TARGET_TYPE (t
);
6151 t1
= ada_check_typedef (t1
);
6152 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6154 arg
= coerce_ref (arg
);
6159 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6161 t1
= TYPE_TARGET_TYPE (t
);
6164 t1
= ada_check_typedef (t1
);
6165 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6167 arg
= value_ind (arg
);
6174 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6178 v
= ada_search_struct_field (name
, arg
, 0, t
);
6181 int bit_offset
, bit_size
, byte_offset
;
6182 struct type
*field_type
;
6185 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6186 address
= value_as_address (arg
);
6188 address
= unpack_pointer (t
, value_contents (arg
));
6190 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6191 if (find_struct_field (name
, t1
, 0,
6192 &field_type
, &byte_offset
, &bit_offset
,
6197 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6198 arg
= ada_coerce_ref (arg
);
6200 arg
= ada_value_ind (arg
);
6201 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6202 bit_offset
, bit_size
,
6206 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6210 if (v
!= NULL
|| no_err
)
6213 error (_("There is no member named %s."), name
);
6219 error (_("Attempt to extract a component of a value that is not a record."));
6222 /* Given a type TYPE, look up the type of the component of type named NAME.
6223 If DISPP is non-null, add its byte displacement from the beginning of a
6224 structure (pointed to by a value) of type TYPE to *DISPP (does not
6225 work for packed fields).
6227 Matches any field whose name has NAME as a prefix, possibly
6230 TYPE can be either a struct or union. If REFOK, TYPE may also
6231 be a (pointer or reference)+ to a struct or union, and the
6232 ultimate target type will be searched.
6234 Looks recursively into variant clauses and parent types.
6236 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6237 TYPE is not a type of the right kind. */
6239 static struct type
*
6240 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6241 int noerr
, int *dispp
)
6248 if (refok
&& type
!= NULL
)
6251 type
= ada_check_typedef (type
);
6252 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6253 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6255 type
= TYPE_TARGET_TYPE (type
);
6259 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6260 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6266 target_terminal_ours ();
6267 gdb_flush (gdb_stdout
);
6269 error (_("Type (null) is not a structure or union type"));
6272 /* XXX: type_sprint */
6273 fprintf_unfiltered (gdb_stderr
, _("Type "));
6274 type_print (type
, "", gdb_stderr
, -1);
6275 error (_(" is not a structure or union type"));
6280 type
= to_static_fixed_type (type
);
6282 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6284 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6288 if (t_field_name
== NULL
)
6291 else if (field_name_match (t_field_name
, name
))
6294 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6295 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6298 else if (ada_is_wrapper_field (type
, i
))
6301 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6306 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6311 else if (ada_is_variant_part (type
, i
))
6314 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6316 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6318 /* FIXME pnh 2008/01/26: We check for a field that is
6319 NOT wrapped in a struct, since the compiler sometimes
6320 generates these for unchecked variant types. Revisit
6321 if the compiler changes this practice. */
6322 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6324 if (v_field_name
!= NULL
6325 && field_name_match (v_field_name
, name
))
6326 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6328 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6334 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6345 target_terminal_ours ();
6346 gdb_flush (gdb_stdout
);
6349 /* XXX: type_sprint */
6350 fprintf_unfiltered (gdb_stderr
, _("Type "));
6351 type_print (type
, "", gdb_stderr
, -1);
6352 error (_(" has no component named <null>"));
6356 /* XXX: type_sprint */
6357 fprintf_unfiltered (gdb_stderr
, _("Type "));
6358 type_print (type
, "", gdb_stderr
, -1);
6359 error (_(" has no component named %s"), name
);
6366 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6367 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6368 represents an unchecked union (that is, the variant part of a
6369 record that is named in an Unchecked_Union pragma). */
6372 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6374 char *discrim_name
= ada_variant_discrim_name (var_type
);
6375 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6380 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6381 within a value of type OUTER_TYPE that is stored in GDB at
6382 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6383 numbering from 0) is applicable. Returns -1 if none are. */
6386 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6387 const gdb_byte
*outer_valaddr
)
6391 char *discrim_name
= ada_variant_discrim_name (var_type
);
6392 struct value
*outer
;
6393 struct value
*discrim
;
6394 LONGEST discrim_val
;
6396 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6397 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6398 if (discrim
== NULL
)
6400 discrim_val
= value_as_long (discrim
);
6403 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6405 if (ada_is_others_clause (var_type
, i
))
6407 else if (ada_in_variant (discrim_val
, var_type
, i
))
6411 return others_clause
;
6416 /* Dynamic-Sized Records */
6418 /* Strategy: The type ostensibly attached to a value with dynamic size
6419 (i.e., a size that is not statically recorded in the debugging
6420 data) does not accurately reflect the size or layout of the value.
6421 Our strategy is to convert these values to values with accurate,
6422 conventional types that are constructed on the fly. */
6424 /* There is a subtle and tricky problem here. In general, we cannot
6425 determine the size of dynamic records without its data. However,
6426 the 'struct value' data structure, which GDB uses to represent
6427 quantities in the inferior process (the target), requires the size
6428 of the type at the time of its allocation in order to reserve space
6429 for GDB's internal copy of the data. That's why the
6430 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6431 rather than struct value*s.
6433 However, GDB's internal history variables ($1, $2, etc.) are
6434 struct value*s containing internal copies of the data that are not, in
6435 general, the same as the data at their corresponding addresses in
6436 the target. Fortunately, the types we give to these values are all
6437 conventional, fixed-size types (as per the strategy described
6438 above), so that we don't usually have to perform the
6439 'to_fixed_xxx_type' conversions to look at their values.
6440 Unfortunately, there is one exception: if one of the internal
6441 history variables is an array whose elements are unconstrained
6442 records, then we will need to create distinct fixed types for each
6443 element selected. */
6445 /* The upshot of all of this is that many routines take a (type, host
6446 address, target address) triple as arguments to represent a value.
6447 The host address, if non-null, is supposed to contain an internal
6448 copy of the relevant data; otherwise, the program is to consult the
6449 target at the target address. */
6451 /* Assuming that VAL0 represents a pointer value, the result of
6452 dereferencing it. Differs from value_ind in its treatment of
6453 dynamic-sized types. */
6456 ada_value_ind (struct value
*val0
)
6458 struct value
*val
= unwrap_value (value_ind (val0
));
6459 return ada_to_fixed_value (val
);
6462 /* The value resulting from dereferencing any "reference to"
6463 qualifiers on VAL0. */
6465 static struct value
*
6466 ada_coerce_ref (struct value
*val0
)
6468 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6470 struct value
*val
= val0
;
6471 val
= coerce_ref (val
);
6472 val
= unwrap_value (val
);
6473 return ada_to_fixed_value (val
);
6479 /* Return OFF rounded upward if necessary to a multiple of
6480 ALIGNMENT (a power of 2). */
6483 align_value (unsigned int off
, unsigned int alignment
)
6485 return (off
+ alignment
- 1) & ~(alignment
- 1);
6488 /* Return the bit alignment required for field #F of template type TYPE. */
6491 field_alignment (struct type
*type
, int f
)
6493 const char *name
= TYPE_FIELD_NAME (type
, f
);
6497 /* The field name should never be null, unless the debugging information
6498 is somehow malformed. In this case, we assume the field does not
6499 require any alignment. */
6503 len
= strlen (name
);
6505 if (!isdigit (name
[len
- 1]))
6508 if (isdigit (name
[len
- 2]))
6509 align_offset
= len
- 2;
6511 align_offset
= len
- 1;
6513 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6514 return TARGET_CHAR_BIT
;
6516 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6519 /* Find a symbol named NAME. Ignores ambiguity. */
6522 ada_find_any_symbol (const char *name
)
6526 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6527 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6530 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6534 /* Find a type named NAME. Ignores ambiguity. */
6537 ada_find_any_type (const char *name
)
6539 struct symbol
*sym
= ada_find_any_symbol (name
);
6540 struct type
*type
= NULL
;
6543 type
= SYMBOL_TYPE (sym
);
6546 type
= language_lookup_primitive_type_by_name
6547 (language_def (language_ada
), current_gdbarch
, name
);
6552 /* Given NAME and an associated BLOCK, search all symbols for
6553 NAME suffixed with "___XR", which is the ``renaming'' symbol
6554 associated to NAME. Return this symbol if found, return
6558 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6562 sym
= find_old_style_renaming_symbol (name
, block
);
6567 /* Not right yet. FIXME pnh 7/20/2007. */
6568 sym
= ada_find_any_symbol (name
);
6569 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6575 static struct symbol
*
6576 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6578 const struct symbol
*function_sym
= block_linkage_function (block
);
6581 if (function_sym
!= NULL
)
6583 /* If the symbol is defined inside a function, NAME is not fully
6584 qualified. This means we need to prepend the function name
6585 as well as adding the ``___XR'' suffix to build the name of
6586 the associated renaming symbol. */
6587 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6588 /* Function names sometimes contain suffixes used
6589 for instance to qualify nested subprograms. When building
6590 the XR type name, we need to make sure that this suffix is
6591 not included. So do not include any suffix in the function
6592 name length below. */
6593 const int function_name_len
= ada_name_prefix_len (function_name
);
6594 const int rename_len
= function_name_len
+ 2 /* "__" */
6595 + strlen (name
) + 6 /* "___XR\0" */ ;
6597 /* Strip the suffix if necessary. */
6598 function_name
[function_name_len
] = '\0';
6600 /* Library-level functions are a special case, as GNAT adds
6601 a ``_ada_'' prefix to the function name to avoid namespace
6602 pollution. However, the renaming symbols themselves do not
6603 have this prefix, so we need to skip this prefix if present. */
6604 if (function_name_len
> 5 /* "_ada_" */
6605 && strstr (function_name
, "_ada_") == function_name
)
6606 function_name
= function_name
+ 5;
6608 rename
= (char *) alloca (rename_len
* sizeof (char));
6609 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6613 const int rename_len
= strlen (name
) + 6;
6614 rename
= (char *) alloca (rename_len
* sizeof (char));
6615 sprintf (rename
, "%s___XR", name
);
6618 return ada_find_any_symbol (rename
);
6621 /* Because of GNAT encoding conventions, several GDB symbols may match a
6622 given type name. If the type denoted by TYPE0 is to be preferred to
6623 that of TYPE1 for purposes of type printing, return non-zero;
6624 otherwise return 0. */
6627 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6631 else if (type0
== NULL
)
6633 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6635 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6637 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6639 else if (ada_is_packed_array_type (type0
))
6641 else if (ada_is_array_descriptor_type (type0
)
6642 && !ada_is_array_descriptor_type (type1
))
6646 const char *type0_name
= type_name_no_tag (type0
);
6647 const char *type1_name
= type_name_no_tag (type1
);
6649 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6650 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6656 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6657 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6660 ada_type_name (struct type
*type
)
6664 else if (TYPE_NAME (type
) != NULL
)
6665 return TYPE_NAME (type
);
6667 return TYPE_TAG_NAME (type
);
6670 /* Find a parallel type to TYPE whose name is formed by appending
6671 SUFFIX to the name of TYPE. */
6674 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6677 static size_t name_len
= 0;
6679 char *typename
= ada_type_name (type
);
6681 if (typename
== NULL
)
6684 len
= strlen (typename
);
6686 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6688 strcpy (name
, typename
);
6689 strcpy (name
+ len
, suffix
);
6691 return ada_find_any_type (name
);
6695 /* If TYPE is a variable-size record type, return the corresponding template
6696 type describing its fields. Otherwise, return NULL. */
6698 static struct type
*
6699 dynamic_template_type (struct type
*type
)
6701 type
= ada_check_typedef (type
);
6703 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6704 || ada_type_name (type
) == NULL
)
6708 int len
= strlen (ada_type_name (type
));
6709 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6712 return ada_find_parallel_type (type
, "___XVE");
6716 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6717 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6720 is_dynamic_field (struct type
*templ_type
, int field_num
)
6722 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6724 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6725 && strstr (name
, "___XVL") != NULL
;
6728 /* The index of the variant field of TYPE, or -1 if TYPE does not
6729 represent a variant record type. */
6732 variant_field_index (struct type
*type
)
6736 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6739 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6741 if (ada_is_variant_part (type
, f
))
6747 /* A record type with no fields. */
6749 static struct type
*
6750 empty_record (struct objfile
*objfile
)
6752 struct type
*type
= alloc_type (objfile
);
6753 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6754 TYPE_NFIELDS (type
) = 0;
6755 TYPE_FIELDS (type
) = NULL
;
6756 INIT_CPLUS_SPECIFIC (type
);
6757 TYPE_NAME (type
) = "<empty>";
6758 TYPE_TAG_NAME (type
) = NULL
;
6759 TYPE_LENGTH (type
) = 0;
6763 /* An ordinary record type (with fixed-length fields) that describes
6764 the value of type TYPE at VALADDR or ADDRESS (see comments at
6765 the beginning of this section) VAL according to GNAT conventions.
6766 DVAL0 should describe the (portion of a) record that contains any
6767 necessary discriminants. It should be NULL if value_type (VAL) is
6768 an outer-level type (i.e., as opposed to a branch of a variant.) A
6769 variant field (unless unchecked) is replaced by a particular branch
6772 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6773 length are not statically known are discarded. As a consequence,
6774 VALADDR, ADDRESS and DVAL0 are ignored.
6776 NOTE: Limitations: For now, we assume that dynamic fields and
6777 variants occupy whole numbers of bytes. However, they need not be
6781 ada_template_to_fixed_record_type_1 (struct type
*type
,
6782 const gdb_byte
*valaddr
,
6783 CORE_ADDR address
, struct value
*dval0
,
6784 int keep_dynamic_fields
)
6786 struct value
*mark
= value_mark ();
6789 int nfields
, bit_len
;
6792 int fld_bit_len
, bit_incr
;
6795 /* Compute the number of fields in this record type that are going
6796 to be processed: unless keep_dynamic_fields, this includes only
6797 fields whose position and length are static will be processed. */
6798 if (keep_dynamic_fields
)
6799 nfields
= TYPE_NFIELDS (type
);
6803 while (nfields
< TYPE_NFIELDS (type
)
6804 && !ada_is_variant_part (type
, nfields
)
6805 && !is_dynamic_field (type
, nfields
))
6809 rtype
= alloc_type (TYPE_OBJFILE (type
));
6810 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6811 INIT_CPLUS_SPECIFIC (rtype
);
6812 TYPE_NFIELDS (rtype
) = nfields
;
6813 TYPE_FIELDS (rtype
) = (struct field
*)
6814 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6815 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6816 TYPE_NAME (rtype
) = ada_type_name (type
);
6817 TYPE_TAG_NAME (rtype
) = NULL
;
6818 TYPE_FIXED_INSTANCE (rtype
) = 1;
6824 for (f
= 0; f
< nfields
; f
+= 1)
6826 off
= align_value (off
, field_alignment (type
, f
))
6827 + TYPE_FIELD_BITPOS (type
, f
);
6828 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6829 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6831 if (ada_is_variant_part (type
, f
))
6834 fld_bit_len
= bit_incr
= 0;
6836 else if (is_dynamic_field (type
, f
))
6840 /* rtype's length is computed based on the run-time
6841 value of discriminants. If the discriminants are not
6842 initialized, the type size may be completely bogus and
6843 GDB may fail to allocate a value for it. So check the
6844 size first before creating the value. */
6846 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6851 /* Get the fixed type of the field. Note that, in this case, we
6852 do not want to get the real type out of the tag: if the current
6853 field is the parent part of a tagged record, we will get the
6854 tag of the object. Clearly wrong: the real type of the parent
6855 is not the real type of the child. We would end up in an infinite
6857 TYPE_FIELD_TYPE (rtype
, f
) =
6860 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6861 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6862 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6863 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6864 bit_incr
= fld_bit_len
=
6865 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6869 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6870 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6871 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6872 bit_incr
= fld_bit_len
=
6873 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6875 bit_incr
= fld_bit_len
=
6876 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6878 if (off
+ fld_bit_len
> bit_len
)
6879 bit_len
= off
+ fld_bit_len
;
6881 TYPE_LENGTH (rtype
) =
6882 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6885 /* We handle the variant part, if any, at the end because of certain
6886 odd cases in which it is re-ordered so as NOT to be the last field of
6887 the record. This can happen in the presence of representation
6889 if (variant_field
>= 0)
6891 struct type
*branch_type
;
6893 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6896 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6901 to_fixed_variant_branch_type
6902 (TYPE_FIELD_TYPE (type
, variant_field
),
6903 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6904 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6905 if (branch_type
== NULL
)
6907 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6908 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6909 TYPE_NFIELDS (rtype
) -= 1;
6913 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6914 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6916 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6918 if (off
+ fld_bit_len
> bit_len
)
6919 bit_len
= off
+ fld_bit_len
;
6920 TYPE_LENGTH (rtype
) =
6921 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6925 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6926 should contain the alignment of that record, which should be a strictly
6927 positive value. If null or negative, then something is wrong, most
6928 probably in the debug info. In that case, we don't round up the size
6929 of the resulting type. If this record is not part of another structure,
6930 the current RTYPE length might be good enough for our purposes. */
6931 if (TYPE_LENGTH (type
) <= 0)
6933 if (TYPE_NAME (rtype
))
6934 warning (_("Invalid type size for `%s' detected: %d."),
6935 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6937 warning (_("Invalid type size for <unnamed> detected: %d."),
6938 TYPE_LENGTH (type
));
6942 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6943 TYPE_LENGTH (type
));
6946 value_free_to_mark (mark
);
6947 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6948 error (_("record type with dynamic size is larger than varsize-limit"));
6952 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6955 static struct type
*
6956 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6957 CORE_ADDR address
, struct value
*dval0
)
6959 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6963 /* An ordinary record type in which ___XVL-convention fields and
6964 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6965 static approximations, containing all possible fields. Uses
6966 no runtime values. Useless for use in values, but that's OK,
6967 since the results are used only for type determinations. Works on both
6968 structs and unions. Representation note: to save space, we memorize
6969 the result of this function in the TYPE_TARGET_TYPE of the
6972 static struct type
*
6973 template_to_static_fixed_type (struct type
*type0
)
6979 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6980 return TYPE_TARGET_TYPE (type0
);
6982 nfields
= TYPE_NFIELDS (type0
);
6985 for (f
= 0; f
< nfields
; f
+= 1)
6987 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6988 struct type
*new_type
;
6990 if (is_dynamic_field (type0
, f
))
6991 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6993 new_type
= static_unwrap_type (field_type
);
6994 if (type
== type0
&& new_type
!= field_type
)
6996 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6997 TYPE_CODE (type
) = TYPE_CODE (type0
);
6998 INIT_CPLUS_SPECIFIC (type
);
6999 TYPE_NFIELDS (type
) = nfields
;
7000 TYPE_FIELDS (type
) = (struct field
*)
7001 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7002 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7003 sizeof (struct field
) * nfields
);
7004 TYPE_NAME (type
) = ada_type_name (type0
);
7005 TYPE_TAG_NAME (type
) = NULL
;
7006 TYPE_FIXED_INSTANCE (type
) = 1;
7007 TYPE_LENGTH (type
) = 0;
7009 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7010 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7015 /* Given an object of type TYPE whose contents are at VALADDR and
7016 whose address in memory is ADDRESS, returns a revision of TYPE,
7017 which should be a non-dynamic-sized record, in which the variant
7018 part, if any, is replaced with the appropriate branch. Looks
7019 for discriminant values in DVAL0, which can be NULL if the record
7020 contains the necessary discriminant values. */
7022 static struct type
*
7023 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7024 CORE_ADDR address
, struct value
*dval0
)
7026 struct value
*mark
= value_mark ();
7029 struct type
*branch_type
;
7030 int nfields
= TYPE_NFIELDS (type
);
7031 int variant_field
= variant_field_index (type
);
7033 if (variant_field
== -1)
7037 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7041 rtype
= alloc_type (TYPE_OBJFILE (type
));
7042 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7043 INIT_CPLUS_SPECIFIC (rtype
);
7044 TYPE_NFIELDS (rtype
) = nfields
;
7045 TYPE_FIELDS (rtype
) =
7046 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7047 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7048 sizeof (struct field
) * nfields
);
7049 TYPE_NAME (rtype
) = ada_type_name (type
);
7050 TYPE_TAG_NAME (rtype
) = NULL
;
7051 TYPE_FIXED_INSTANCE (rtype
) = 1;
7052 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7054 branch_type
= to_fixed_variant_branch_type
7055 (TYPE_FIELD_TYPE (type
, variant_field
),
7056 cond_offset_host (valaddr
,
7057 TYPE_FIELD_BITPOS (type
, variant_field
)
7059 cond_offset_target (address
,
7060 TYPE_FIELD_BITPOS (type
, variant_field
)
7061 / TARGET_CHAR_BIT
), dval
);
7062 if (branch_type
== NULL
)
7065 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7066 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7067 TYPE_NFIELDS (rtype
) -= 1;
7071 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7072 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7073 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7074 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7076 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7078 value_free_to_mark (mark
);
7082 /* An ordinary record type (with fixed-length fields) that describes
7083 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7084 beginning of this section]. Any necessary discriminants' values
7085 should be in DVAL, a record value; it may be NULL if the object
7086 at ADDR itself contains any necessary discriminant values.
7087 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7088 values from the record are needed. Except in the case that DVAL,
7089 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7090 unchecked) is replaced by a particular branch of the variant.
7092 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7093 is questionable and may be removed. It can arise during the
7094 processing of an unconstrained-array-of-record type where all the
7095 variant branches have exactly the same size. This is because in
7096 such cases, the compiler does not bother to use the XVS convention
7097 when encoding the record. I am currently dubious of this
7098 shortcut and suspect the compiler should be altered. FIXME. */
7100 static struct type
*
7101 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7102 CORE_ADDR address
, struct value
*dval
)
7104 struct type
*templ_type
;
7106 if (TYPE_FIXED_INSTANCE (type0
))
7109 templ_type
= dynamic_template_type (type0
);
7111 if (templ_type
!= NULL
)
7112 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7113 else if (variant_field_index (type0
) >= 0)
7115 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7117 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7122 TYPE_FIXED_INSTANCE (type0
) = 1;
7128 /* An ordinary record type (with fixed-length fields) that describes
7129 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7130 union type. Any necessary discriminants' values should be in DVAL,
7131 a record value. That is, this routine selects the appropriate
7132 branch of the union at ADDR according to the discriminant value
7133 indicated in the union's type name. Returns VAR_TYPE0 itself if
7134 it represents a variant subject to a pragma Unchecked_Union. */
7136 static struct type
*
7137 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7138 CORE_ADDR address
, struct value
*dval
)
7141 struct type
*templ_type
;
7142 struct type
*var_type
;
7144 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7145 var_type
= TYPE_TARGET_TYPE (var_type0
);
7147 var_type
= var_type0
;
7149 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7151 if (templ_type
!= NULL
)
7152 var_type
= templ_type
;
7154 if (is_unchecked_variant (var_type
, value_type (dval
)))
7157 ada_which_variant_applies (var_type
,
7158 value_type (dval
), value_contents (dval
));
7161 return empty_record (TYPE_OBJFILE (var_type
));
7162 else if (is_dynamic_field (var_type
, which
))
7163 return to_fixed_record_type
7164 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7165 valaddr
, address
, dval
);
7166 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7168 to_fixed_record_type
7169 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7171 return TYPE_FIELD_TYPE (var_type
, which
);
7174 /* Assuming that TYPE0 is an array type describing the type of a value
7175 at ADDR, and that DVAL describes a record containing any
7176 discriminants used in TYPE0, returns a type for the value that
7177 contains no dynamic components (that is, no components whose sizes
7178 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7179 true, gives an error message if the resulting type's size is over
7182 static struct type
*
7183 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7186 struct type
*index_type_desc
;
7187 struct type
*result
;
7189 if (ada_is_packed_array_type (type0
) /* revisit? */
7190 || TYPE_FIXED_INSTANCE (type0
))
7193 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7194 if (index_type_desc
== NULL
)
7196 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7197 /* NOTE: elt_type---the fixed version of elt_type0---should never
7198 depend on the contents of the array in properly constructed
7200 /* Create a fixed version of the array element type.
7201 We're not providing the address of an element here,
7202 and thus the actual object value cannot be inspected to do
7203 the conversion. This should not be a problem, since arrays of
7204 unconstrained objects are not allowed. In particular, all
7205 the elements of an array of a tagged type should all be of
7206 the same type specified in the debugging info. No need to
7207 consult the object tag. */
7208 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7210 if (elt_type0
== elt_type
)
7213 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7214 elt_type
, TYPE_INDEX_TYPE (type0
));
7219 struct type
*elt_type0
;
7222 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7223 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7225 /* NOTE: result---the fixed version of elt_type0---should never
7226 depend on the contents of the array in properly constructed
7228 /* Create a fixed version of the array element type.
7229 We're not providing the address of an element here,
7230 and thus the actual object value cannot be inspected to do
7231 the conversion. This should not be a problem, since arrays of
7232 unconstrained objects are not allowed. In particular, all
7233 the elements of an array of a tagged type should all be of
7234 the same type specified in the debugging info. No need to
7235 consult the object tag. */
7237 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7238 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7240 struct type
*range_type
=
7241 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7242 dval
, TYPE_OBJFILE (type0
));
7243 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7244 result
, range_type
);
7246 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7247 error (_("array type with dynamic size is larger than varsize-limit"));
7250 TYPE_FIXED_INSTANCE (result
) = 1;
7255 /* A standard type (containing no dynamically sized components)
7256 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7257 DVAL describes a record containing any discriminants used in TYPE0,
7258 and may be NULL if there are none, or if the object of type TYPE at
7259 ADDRESS or in VALADDR contains these discriminants.
7261 If CHECK_TAG is not null, in the case of tagged types, this function
7262 attempts to locate the object's tag and use it to compute the actual
7263 type. However, when ADDRESS is null, we cannot use it to determine the
7264 location of the tag, and therefore compute the tagged type's actual type.
7265 So we return the tagged type without consulting the tag. */
7267 static struct type
*
7268 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7269 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7271 type
= ada_check_typedef (type
);
7272 switch (TYPE_CODE (type
))
7276 case TYPE_CODE_STRUCT
:
7278 struct type
*static_type
= to_static_fixed_type (type
);
7279 struct type
*fixed_record_type
=
7280 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7281 /* If STATIC_TYPE is a tagged type and we know the object's address,
7282 then we can determine its tag, and compute the object's actual
7283 type from there. Note that we have to use the fixed record
7284 type (the parent part of the record may have dynamic fields
7285 and the way the location of _tag is expressed may depend on
7288 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7290 struct type
*real_type
=
7291 type_from_tag (value_tag_from_contents_and_address
7295 if (real_type
!= NULL
)
7296 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7299 /* Check to see if there is a parallel ___XVZ variable.
7300 If there is, then it provides the actual size of our type. */
7301 else if (ada_type_name (fixed_record_type
) != NULL
)
7303 char *name
= ada_type_name (fixed_record_type
);
7304 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7308 sprintf (xvz_name
, "%s___XVZ", name
);
7309 size
= get_int_var_value (xvz_name
, &xvz_found
);
7310 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7312 fixed_record_type
= copy_type (fixed_record_type
);
7313 TYPE_LENGTH (fixed_record_type
) = size
;
7315 /* The FIXED_RECORD_TYPE may have be a stub. We have
7316 observed this when the debugging info is STABS, and
7317 apparently it is something that is hard to fix.
7319 In practice, we don't need the actual type definition
7320 at all, because the presence of the XVZ variable allows us
7321 to assume that there must be a XVS type as well, which we
7322 should be able to use later, when we need the actual type
7325 In the meantime, pretend that the "fixed" type we are
7326 returning is NOT a stub, because this can cause trouble
7327 when using this type to create new types targeting it.
7328 Indeed, the associated creation routines often check
7329 whether the target type is a stub and will try to replace
7330 it, thus using a type with the wrong size. This, in turn,
7331 might cause the new type to have the wrong size too.
7332 Consider the case of an array, for instance, where the size
7333 of the array is computed from the number of elements in
7334 our array multiplied by the size of its element. */
7335 TYPE_STUB (fixed_record_type
) = 0;
7338 return fixed_record_type
;
7340 case TYPE_CODE_ARRAY
:
7341 return to_fixed_array_type (type
, dval
, 1);
7342 case TYPE_CODE_UNION
:
7346 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7350 /* The same as ada_to_fixed_type_1, except that it preserves the type
7351 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7352 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7355 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7356 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7359 struct type
*fixed_type
=
7360 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7362 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7363 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7369 /* A standard (static-sized) type corresponding as well as possible to
7370 TYPE0, but based on no runtime data. */
7372 static struct type
*
7373 to_static_fixed_type (struct type
*type0
)
7380 if (TYPE_FIXED_INSTANCE (type0
))
7383 type0
= ada_check_typedef (type0
);
7385 switch (TYPE_CODE (type0
))
7389 case TYPE_CODE_STRUCT
:
7390 type
= dynamic_template_type (type0
);
7392 return template_to_static_fixed_type (type
);
7394 return template_to_static_fixed_type (type0
);
7395 case TYPE_CODE_UNION
:
7396 type
= ada_find_parallel_type (type0
, "___XVU");
7398 return template_to_static_fixed_type (type
);
7400 return template_to_static_fixed_type (type0
);
7404 /* A static approximation of TYPE with all type wrappers removed. */
7406 static struct type
*
7407 static_unwrap_type (struct type
*type
)
7409 if (ada_is_aligner_type (type
))
7411 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7412 if (ada_type_name (type1
) == NULL
)
7413 TYPE_NAME (type1
) = ada_type_name (type
);
7415 return static_unwrap_type (type1
);
7419 struct type
*raw_real_type
= ada_get_base_type (type
);
7420 if (raw_real_type
== type
)
7423 return to_static_fixed_type (raw_real_type
);
7427 /* In some cases, incomplete and private types require
7428 cross-references that are not resolved as records (for example,
7430 type FooP is access Foo;
7432 type Foo is array ...;
7433 ). In these cases, since there is no mechanism for producing
7434 cross-references to such types, we instead substitute for FooP a
7435 stub enumeration type that is nowhere resolved, and whose tag is
7436 the name of the actual type. Call these types "non-record stubs". */
7438 /* A type equivalent to TYPE that is not a non-record stub, if one
7439 exists, otherwise TYPE. */
7442 ada_check_typedef (struct type
*type
)
7447 CHECK_TYPEDEF (type
);
7448 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7449 || !TYPE_STUB (type
)
7450 || TYPE_TAG_NAME (type
) == NULL
)
7454 char *name
= TYPE_TAG_NAME (type
);
7455 struct type
*type1
= ada_find_any_type (name
);
7456 return (type1
== NULL
) ? type
: type1
;
7460 /* A value representing the data at VALADDR/ADDRESS as described by
7461 type TYPE0, but with a standard (static-sized) type that correctly
7462 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7463 type, then return VAL0 [this feature is simply to avoid redundant
7464 creation of struct values]. */
7466 static struct value
*
7467 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7470 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7471 if (type
== type0
&& val0
!= NULL
)
7474 return value_from_contents_and_address (type
, 0, address
);
7477 /* A value representing VAL, but with a standard (static-sized) type
7478 that correctly describes it. Does not necessarily create a new
7481 static struct value
*
7482 ada_to_fixed_value (struct value
*val
)
7484 return ada_to_fixed_value_create (value_type (val
),
7485 VALUE_ADDRESS (val
) + value_offset (val
),
7489 /* A value representing VAL, but with a standard (static-sized) type
7490 chosen to approximate the real type of VAL as well as possible, but
7491 without consulting any runtime values. For Ada dynamic-sized
7492 types, therefore, the type of the result is likely to be inaccurate. */
7494 static struct value
*
7495 ada_to_static_fixed_value (struct value
*val
)
7498 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7499 if (type
== value_type (val
))
7502 return coerce_unspec_val_to_type (val
, type
);
7508 /* Table mapping attribute numbers to names.
7509 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7511 static const char *attribute_names
[] = {
7529 ada_attribute_name (enum exp_opcode n
)
7531 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7532 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7534 return attribute_names
[0];
7537 /* Evaluate the 'POS attribute applied to ARG. */
7540 pos_atr (struct value
*arg
)
7542 struct value
*val
= coerce_ref (arg
);
7543 struct type
*type
= value_type (val
);
7545 if (!discrete_type_p (type
))
7546 error (_("'POS only defined on discrete types"));
7548 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7551 LONGEST v
= value_as_long (val
);
7553 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7555 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7558 error (_("enumeration value is invalid: can't find 'POS"));
7561 return value_as_long (val
);
7564 static struct value
*
7565 value_pos_atr (struct type
*type
, struct value
*arg
)
7567 return value_from_longest (type
, pos_atr (arg
));
7570 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7572 static struct value
*
7573 value_val_atr (struct type
*type
, struct value
*arg
)
7575 if (!discrete_type_p (type
))
7576 error (_("'VAL only defined on discrete types"));
7577 if (!integer_type_p (value_type (arg
)))
7578 error (_("'VAL requires integral argument"));
7580 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7582 long pos
= value_as_long (arg
);
7583 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7584 error (_("argument to 'VAL out of range"));
7585 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7588 return value_from_longest (type
, value_as_long (arg
));
7594 /* True if TYPE appears to be an Ada character type.
7595 [At the moment, this is true only for Character and Wide_Character;
7596 It is a heuristic test that could stand improvement]. */
7599 ada_is_character_type (struct type
*type
)
7603 /* If the type code says it's a character, then assume it really is,
7604 and don't check any further. */
7605 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7608 /* Otherwise, assume it's a character type iff it is a discrete type
7609 with a known character type name. */
7610 name
= ada_type_name (type
);
7611 return (name
!= NULL
7612 && (TYPE_CODE (type
) == TYPE_CODE_INT
7613 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7614 && (strcmp (name
, "character") == 0
7615 || strcmp (name
, "wide_character") == 0
7616 || strcmp (name
, "wide_wide_character") == 0
7617 || strcmp (name
, "unsigned char") == 0));
7620 /* True if TYPE appears to be an Ada string type. */
7623 ada_is_string_type (struct type
*type
)
7625 type
= ada_check_typedef (type
);
7627 && TYPE_CODE (type
) != TYPE_CODE_PTR
7628 && (ada_is_simple_array_type (type
)
7629 || ada_is_array_descriptor_type (type
))
7630 && ada_array_arity (type
) == 1)
7632 struct type
*elttype
= ada_array_element_type (type
, 1);
7634 return ada_is_character_type (elttype
);
7641 /* True if TYPE is a struct type introduced by the compiler to force the
7642 alignment of a value. Such types have a single field with a
7643 distinctive name. */
7646 ada_is_aligner_type (struct type
*type
)
7648 type
= ada_check_typedef (type
);
7650 /* If we can find a parallel XVS type, then the XVS type should
7651 be used instead of this type. And hence, this is not an aligner
7653 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7656 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7657 && TYPE_NFIELDS (type
) == 1
7658 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7661 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7662 the parallel type. */
7665 ada_get_base_type (struct type
*raw_type
)
7667 struct type
*real_type_namer
;
7668 struct type
*raw_real_type
;
7670 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7673 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7674 if (real_type_namer
== NULL
7675 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7676 || TYPE_NFIELDS (real_type_namer
) != 1)
7679 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7680 if (raw_real_type
== NULL
)
7683 return raw_real_type
;
7686 /* The type of value designated by TYPE, with all aligners removed. */
7689 ada_aligned_type (struct type
*type
)
7691 if (ada_is_aligner_type (type
))
7692 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7694 return ada_get_base_type (type
);
7698 /* The address of the aligned value in an object at address VALADDR
7699 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7702 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7704 if (ada_is_aligner_type (type
))
7705 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7707 TYPE_FIELD_BITPOS (type
,
7708 0) / TARGET_CHAR_BIT
);
7715 /* The printed representation of an enumeration literal with encoded
7716 name NAME. The value is good to the next call of ada_enum_name. */
7718 ada_enum_name (const char *name
)
7720 static char *result
;
7721 static size_t result_len
= 0;
7724 /* First, unqualify the enumeration name:
7725 1. Search for the last '.' character. If we find one, then skip
7726 all the preceeding characters, the unqualified name starts
7727 right after that dot.
7728 2. Otherwise, we may be debugging on a target where the compiler
7729 translates dots into "__". Search forward for double underscores,
7730 but stop searching when we hit an overloading suffix, which is
7731 of the form "__" followed by digits. */
7733 tmp
= strrchr (name
, '.');
7738 while ((tmp
= strstr (name
, "__")) != NULL
)
7740 if (isdigit (tmp
[2]))
7750 if (name
[1] == 'U' || name
[1] == 'W')
7752 if (sscanf (name
+ 2, "%x", &v
) != 1)
7758 GROW_VECT (result
, result_len
, 16);
7759 if (isascii (v
) && isprint (v
))
7760 sprintf (result
, "'%c'", v
);
7761 else if (name
[1] == 'U')
7762 sprintf (result
, "[\"%02x\"]", v
);
7764 sprintf (result
, "[\"%04x\"]", v
);
7770 tmp
= strstr (name
, "__");
7772 tmp
= strstr (name
, "$");
7775 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7776 strncpy (result
, name
, tmp
- name
);
7777 result
[tmp
- name
] = '\0';
7785 static struct value
*
7786 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7789 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7790 (expect_type
, exp
, pos
, noside
);
7793 /* Evaluate the subexpression of EXP starting at *POS as for
7794 evaluate_type, updating *POS to point just past the evaluated
7797 static struct value
*
7798 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7800 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7801 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7804 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7807 static struct value
*
7808 unwrap_value (struct value
*val
)
7810 struct type
*type
= ada_check_typedef (value_type (val
));
7811 if (ada_is_aligner_type (type
))
7813 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7814 struct type
*val_type
= ada_check_typedef (value_type (v
));
7815 if (ada_type_name (val_type
) == NULL
)
7816 TYPE_NAME (val_type
) = ada_type_name (type
);
7818 return unwrap_value (v
);
7822 struct type
*raw_real_type
=
7823 ada_check_typedef (ada_get_base_type (type
));
7825 if (type
== raw_real_type
)
7829 coerce_unspec_val_to_type
7830 (val
, ada_to_fixed_type (raw_real_type
, 0,
7831 VALUE_ADDRESS (val
) + value_offset (val
),
7836 static struct value
*
7837 cast_to_fixed (struct type
*type
, struct value
*arg
)
7841 if (type
== value_type (arg
))
7843 else if (ada_is_fixed_point_type (value_type (arg
)))
7844 val
= ada_float_to_fixed (type
,
7845 ada_fixed_to_float (value_type (arg
),
7846 value_as_long (arg
)));
7849 DOUBLEST argd
= value_as_double (arg
);
7850 val
= ada_float_to_fixed (type
, argd
);
7853 return value_from_longest (type
, val
);
7856 static struct value
*
7857 cast_from_fixed (struct type
*type
, struct value
*arg
)
7859 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7860 value_as_long (arg
));
7861 return value_from_double (type
, val
);
7864 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7865 return the converted value. */
7867 static struct value
*
7868 coerce_for_assign (struct type
*type
, struct value
*val
)
7870 struct type
*type2
= value_type (val
);
7874 type2
= ada_check_typedef (type2
);
7875 type
= ada_check_typedef (type
);
7877 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7878 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7880 val
= ada_value_ind (val
);
7881 type2
= value_type (val
);
7884 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7885 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7887 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7888 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7889 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7890 error (_("Incompatible types in assignment"));
7891 deprecated_set_value_type (val
, type
);
7896 static struct value
*
7897 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7900 struct type
*type1
, *type2
;
7903 arg1
= coerce_ref (arg1
);
7904 arg2
= coerce_ref (arg2
);
7905 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7906 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7908 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7909 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7910 return value_binop (arg1
, arg2
, op
);
7919 return value_binop (arg1
, arg2
, op
);
7922 v2
= value_as_long (arg2
);
7924 error (_("second operand of %s must not be zero."), op_string (op
));
7926 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7927 return value_binop (arg1
, arg2
, op
);
7929 v1
= value_as_long (arg1
);
7934 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7935 v
+= v
> 0 ? -1 : 1;
7943 /* Should not reach this point. */
7947 val
= allocate_value (type1
);
7948 store_unsigned_integer (value_contents_raw (val
),
7949 TYPE_LENGTH (value_type (val
)), v
);
7954 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7956 if (ada_is_direct_array_type (value_type (arg1
))
7957 || ada_is_direct_array_type (value_type (arg2
)))
7959 /* Automatically dereference any array reference before
7960 we attempt to perform the comparison. */
7961 arg1
= ada_coerce_ref (arg1
);
7962 arg2
= ada_coerce_ref (arg2
);
7964 arg1
= ada_coerce_to_simple_array (arg1
);
7965 arg2
= ada_coerce_to_simple_array (arg2
);
7966 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7967 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7968 error (_("Attempt to compare array with non-array"));
7969 /* FIXME: The following works only for types whose
7970 representations use all bits (no padding or undefined bits)
7971 and do not have user-defined equality. */
7973 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7974 && memcmp (value_contents (arg1
), value_contents (arg2
),
7975 TYPE_LENGTH (value_type (arg1
))) == 0;
7977 return value_equal (arg1
, arg2
);
7980 /* Total number of component associations in the aggregate starting at
7981 index PC in EXP. Assumes that index PC is the start of an
7985 num_component_specs (struct expression
*exp
, int pc
)
7988 m
= exp
->elts
[pc
+ 1].longconst
;
7991 for (i
= 0; i
< m
; i
+= 1)
7993 switch (exp
->elts
[pc
].opcode
)
7999 n
+= exp
->elts
[pc
+ 1].longconst
;
8002 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8007 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8008 component of LHS (a simple array or a record), updating *POS past
8009 the expression, assuming that LHS is contained in CONTAINER. Does
8010 not modify the inferior's memory, nor does it modify LHS (unless
8011 LHS == CONTAINER). */
8014 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8015 struct expression
*exp
, int *pos
)
8017 struct value
*mark
= value_mark ();
8019 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8021 struct value
*index_val
= value_from_longest (builtin_type_int32
, index
);
8022 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8026 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8027 elt
= ada_to_fixed_value (unwrap_value (elt
));
8030 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8031 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8033 value_assign_to_component (container
, elt
,
8034 ada_evaluate_subexp (NULL
, exp
, pos
,
8037 value_free_to_mark (mark
);
8040 /* Assuming that LHS represents an lvalue having a record or array
8041 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8042 of that aggregate's value to LHS, advancing *POS past the
8043 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8044 lvalue containing LHS (possibly LHS itself). Does not modify
8045 the inferior's memory, nor does it modify the contents of
8046 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8048 static struct value
*
8049 assign_aggregate (struct value
*container
,
8050 struct value
*lhs
, struct expression
*exp
,
8051 int *pos
, enum noside noside
)
8053 struct type
*lhs_type
;
8054 int n
= exp
->elts
[*pos
+1].longconst
;
8055 LONGEST low_index
, high_index
;
8058 int max_indices
, num_indices
;
8059 int is_array_aggregate
;
8061 struct value
*mark
= value_mark ();
8064 if (noside
!= EVAL_NORMAL
)
8067 for (i
= 0; i
< n
; i
+= 1)
8068 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8072 container
= ada_coerce_ref (container
);
8073 if (ada_is_direct_array_type (value_type (container
)))
8074 container
= ada_coerce_to_simple_array (container
);
8075 lhs
= ada_coerce_ref (lhs
);
8076 if (!deprecated_value_modifiable (lhs
))
8077 error (_("Left operand of assignment is not a modifiable lvalue."));
8079 lhs_type
= value_type (lhs
);
8080 if (ada_is_direct_array_type (lhs_type
))
8082 lhs
= ada_coerce_to_simple_array (lhs
);
8083 lhs_type
= value_type (lhs
);
8084 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8085 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8086 is_array_aggregate
= 1;
8088 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8091 high_index
= num_visible_fields (lhs_type
) - 1;
8092 is_array_aggregate
= 0;
8095 error (_("Left-hand side must be array or record."));
8097 num_specs
= num_component_specs (exp
, *pos
- 3);
8098 max_indices
= 4 * num_specs
+ 4;
8099 indices
= alloca (max_indices
* sizeof (indices
[0]));
8100 indices
[0] = indices
[1] = low_index
- 1;
8101 indices
[2] = indices
[3] = high_index
+ 1;
8104 for (i
= 0; i
< n
; i
+= 1)
8106 switch (exp
->elts
[*pos
].opcode
)
8109 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8110 &num_indices
, max_indices
,
8111 low_index
, high_index
);
8114 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8115 &num_indices
, max_indices
,
8116 low_index
, high_index
);
8120 error (_("Misplaced 'others' clause"));
8121 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8122 num_indices
, low_index
, high_index
);
8125 error (_("Internal error: bad aggregate clause"));
8132 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8133 construct at *POS, updating *POS past the construct, given that
8134 the positions are relative to lower bound LOW, where HIGH is the
8135 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8136 updating *NUM_INDICES as needed. CONTAINER is as for
8137 assign_aggregate. */
8139 aggregate_assign_positional (struct value
*container
,
8140 struct value
*lhs
, struct expression
*exp
,
8141 int *pos
, LONGEST
*indices
, int *num_indices
,
8142 int max_indices
, LONGEST low
, LONGEST high
)
8144 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8146 if (ind
- 1 == high
)
8147 warning (_("Extra components in aggregate ignored."));
8150 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8152 assign_component (container
, lhs
, ind
, exp
, pos
);
8155 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8158 /* Assign into the components of LHS indexed by the OP_CHOICES
8159 construct at *POS, updating *POS past the construct, given that
8160 the allowable indices are LOW..HIGH. Record the indices assigned
8161 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8162 needed. CONTAINER is as for assign_aggregate. */
8164 aggregate_assign_from_choices (struct value
*container
,
8165 struct value
*lhs
, struct expression
*exp
,
8166 int *pos
, LONGEST
*indices
, int *num_indices
,
8167 int max_indices
, LONGEST low
, LONGEST high
)
8170 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8171 int choice_pos
, expr_pc
;
8172 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8174 choice_pos
= *pos
+= 3;
8176 for (j
= 0; j
< n_choices
; j
+= 1)
8177 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8179 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8181 for (j
= 0; j
< n_choices
; j
+= 1)
8183 LONGEST lower
, upper
;
8184 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8185 if (op
== OP_DISCRETE_RANGE
)
8188 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8190 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8195 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8206 name
= &exp
->elts
[choice_pos
+ 2].string
;
8209 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8212 error (_("Invalid record component association."));
8214 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8216 if (! find_struct_field (name
, value_type (lhs
), 0,
8217 NULL
, NULL
, NULL
, NULL
, &ind
))
8218 error (_("Unknown component name: %s."), name
);
8219 lower
= upper
= ind
;
8222 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8223 error (_("Index in component association out of bounds."));
8225 add_component_interval (lower
, upper
, indices
, num_indices
,
8227 while (lower
<= upper
)
8231 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8237 /* Assign the value of the expression in the OP_OTHERS construct in
8238 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8239 have not been previously assigned. The index intervals already assigned
8240 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8241 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8243 aggregate_assign_others (struct value
*container
,
8244 struct value
*lhs
, struct expression
*exp
,
8245 int *pos
, LONGEST
*indices
, int num_indices
,
8246 LONGEST low
, LONGEST high
)
8249 int expr_pc
= *pos
+1;
8251 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8254 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8258 assign_component (container
, lhs
, ind
, exp
, &pos
);
8261 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8264 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8265 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8266 modifying *SIZE as needed. It is an error if *SIZE exceeds
8267 MAX_SIZE. The resulting intervals do not overlap. */
8269 add_component_interval (LONGEST low
, LONGEST high
,
8270 LONGEST
* indices
, int *size
, int max_size
)
8273 for (i
= 0; i
< *size
; i
+= 2) {
8274 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8277 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8278 if (high
< indices
[kh
])
8280 if (low
< indices
[i
])
8282 indices
[i
+ 1] = indices
[kh
- 1];
8283 if (high
> indices
[i
+ 1])
8284 indices
[i
+ 1] = high
;
8285 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8286 *size
-= kh
- i
- 2;
8289 else if (high
< indices
[i
])
8293 if (*size
== max_size
)
8294 error (_("Internal error: miscounted aggregate components."));
8296 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8297 indices
[j
] = indices
[j
- 2];
8299 indices
[i
+ 1] = high
;
8302 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8305 static struct value
*
8306 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8308 if (type
== ada_check_typedef (value_type (arg2
)))
8311 if (ada_is_fixed_point_type (type
))
8312 return (cast_to_fixed (type
, arg2
));
8314 if (ada_is_fixed_point_type (value_type (arg2
)))
8315 return cast_from_fixed (type
, arg2
);
8317 return value_cast (type
, arg2
);
8320 static struct value
*
8321 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8322 int *pos
, enum noside noside
)
8325 int tem
, tem2
, tem3
;
8327 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8330 struct value
**argvec
;
8334 op
= exp
->elts
[pc
].opcode
;
8340 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8341 arg1
= unwrap_value (arg1
);
8343 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8344 then we need to perform the conversion manually, because
8345 evaluate_subexp_standard doesn't do it. This conversion is
8346 necessary in Ada because the different kinds of float/fixed
8347 types in Ada have different representations.
8349 Similarly, we need to perform the conversion from OP_LONG
8351 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8352 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8358 struct value
*result
;
8360 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8361 /* The result type will have code OP_STRING, bashed there from
8362 OP_ARRAY. Bash it back. */
8363 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8364 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8370 type
= exp
->elts
[pc
+ 1].type
;
8371 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8372 if (noside
== EVAL_SKIP
)
8374 arg1
= ada_value_cast (type
, arg1
, noside
);
8379 type
= exp
->elts
[pc
+ 1].type
;
8380 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8383 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8384 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8386 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8387 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8389 return ada_value_assign (arg1
, arg1
);
8391 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8392 except if the lhs of our assignment is a convenience variable.
8393 In the case of assigning to a convenience variable, the lhs
8394 should be exactly the result of the evaluation of the rhs. */
8395 type
= value_type (arg1
);
8396 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8398 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8399 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8401 if (ada_is_fixed_point_type (value_type (arg1
)))
8402 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8403 else if (ada_is_fixed_point_type (value_type (arg2
)))
8405 (_("Fixed-point values must be assigned to fixed-point variables"));
8407 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8408 return ada_value_assign (arg1
, arg2
);
8411 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8412 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8413 if (noside
== EVAL_SKIP
)
8415 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8416 return (value_from_longest
8418 value_as_long (arg1
) + value_as_long (arg2
)));
8419 if ((ada_is_fixed_point_type (value_type (arg1
))
8420 || ada_is_fixed_point_type (value_type (arg2
)))
8421 && value_type (arg1
) != value_type (arg2
))
8422 error (_("Operands of fixed-point addition must have the same type"));
8423 /* Do the addition, and cast the result to the type of the first
8424 argument. We cannot cast the result to a reference type, so if
8425 ARG1 is a reference type, find its underlying type. */
8426 type
= value_type (arg1
);
8427 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8428 type
= TYPE_TARGET_TYPE (type
);
8429 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8430 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8433 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8434 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8435 if (noside
== EVAL_SKIP
)
8437 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8438 return (value_from_longest
8440 value_as_long (arg1
) - value_as_long (arg2
)));
8441 if ((ada_is_fixed_point_type (value_type (arg1
))
8442 || ada_is_fixed_point_type (value_type (arg2
)))
8443 && value_type (arg1
) != value_type (arg2
))
8444 error (_("Operands of fixed-point subtraction must have the same type"));
8445 /* Do the substraction, and cast the result to the type of the first
8446 argument. We cannot cast the result to a reference type, so if
8447 ARG1 is a reference type, find its underlying type. */
8448 type
= value_type (arg1
);
8449 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8450 type
= TYPE_TARGET_TYPE (type
);
8451 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8452 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8458 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8459 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8460 if (noside
== EVAL_SKIP
)
8462 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8464 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8465 return value_zero (value_type (arg1
), not_lval
);
8469 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8470 if (ada_is_fixed_point_type (value_type (arg1
)))
8471 arg1
= cast_from_fixed (type
, arg1
);
8472 if (ada_is_fixed_point_type (value_type (arg2
)))
8473 arg2
= cast_from_fixed (type
, arg2
);
8474 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8475 return ada_value_binop (arg1
, arg2
, op
);
8479 case BINOP_NOTEQUAL
:
8480 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8481 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8482 if (noside
== EVAL_SKIP
)
8484 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8488 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8489 tem
= ada_value_equal (arg1
, arg2
);
8491 if (op
== BINOP_NOTEQUAL
)
8493 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8494 return value_from_longest (type
, (LONGEST
) tem
);
8497 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8498 if (noside
== EVAL_SKIP
)
8500 else if (ada_is_fixed_point_type (value_type (arg1
)))
8501 return value_cast (value_type (arg1
), value_neg (arg1
));
8504 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8505 return value_neg (arg1
);
8508 case BINOP_LOGICAL_AND
:
8509 case BINOP_LOGICAL_OR
:
8510 case UNOP_LOGICAL_NOT
:
8515 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8516 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8517 return value_cast (type
, val
);
8520 case BINOP_BITWISE_AND
:
8521 case BINOP_BITWISE_IOR
:
8522 case BINOP_BITWISE_XOR
:
8526 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8528 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8530 return value_cast (value_type (arg1
), val
);
8536 if (noside
== EVAL_SKIP
)
8541 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8542 /* Only encountered when an unresolved symbol occurs in a
8543 context other than a function call, in which case, it is
8545 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8546 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8547 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8549 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8550 if (ada_is_tagged_type (type
, 0))
8552 /* Tagged types are a little special in the fact that the real
8553 type is dynamic and can only be determined by inspecting the
8554 object's tag. This means that we need to get the object's
8555 value first (EVAL_NORMAL) and then extract the actual object
8558 Note that we cannot skip the final step where we extract
8559 the object type from its tag, because the EVAL_NORMAL phase
8560 results in dynamic components being resolved into fixed ones.
8561 This can cause problems when trying to print the type
8562 description of tagged types whose parent has a dynamic size:
8563 We use the type name of the "_parent" component in order
8564 to print the name of the ancestor type in the type description.
8565 If that component had a dynamic size, the resolution into
8566 a fixed type would result in the loss of that type name,
8567 thus preventing us from printing the name of the ancestor
8568 type in the type description. */
8569 struct type
*actual_type
;
8571 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8572 actual_type
= type_from_tag (ada_value_tag (arg1
));
8573 if (actual_type
== NULL
)
8574 /* If, for some reason, we were unable to determine
8575 the actual type from the tag, then use the static
8576 approximation that we just computed as a fallback.
8577 This can happen if the debugging information is
8578 incomplete, for instance. */
8581 return value_zero (actual_type
, not_lval
);
8586 (to_static_fixed_type
8587 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8593 unwrap_value (evaluate_subexp_standard
8594 (expect_type
, exp
, pos
, noside
));
8595 return ada_to_fixed_value (arg1
);
8601 /* Allocate arg vector, including space for the function to be
8602 called in argvec[0] and a terminating NULL. */
8603 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8605 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8607 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8608 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8609 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8610 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8613 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8614 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8617 if (noside
== EVAL_SKIP
)
8621 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8622 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8623 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8624 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8625 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8626 argvec
[0] = value_addr (argvec
[0]);
8628 type
= ada_check_typedef (value_type (argvec
[0]));
8629 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8631 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8633 case TYPE_CODE_FUNC
:
8634 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8636 case TYPE_CODE_ARRAY
:
8638 case TYPE_CODE_STRUCT
:
8639 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8640 argvec
[0] = ada_value_ind (argvec
[0]);
8641 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8644 error (_("cannot subscript or call something of type `%s'"),
8645 ada_type_name (value_type (argvec
[0])));
8650 switch (TYPE_CODE (type
))
8652 case TYPE_CODE_FUNC
:
8653 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8654 return allocate_value (TYPE_TARGET_TYPE (type
));
8655 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8656 case TYPE_CODE_STRUCT
:
8660 arity
= ada_array_arity (type
);
8661 type
= ada_array_element_type (type
, nargs
);
8663 error (_("cannot subscript or call a record"));
8665 error (_("wrong number of subscripts; expecting %d"), arity
);
8666 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8667 return value_zero (ada_aligned_type (type
), lval_memory
);
8669 unwrap_value (ada_value_subscript
8670 (argvec
[0], nargs
, argvec
+ 1));
8672 case TYPE_CODE_ARRAY
:
8673 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8675 type
= ada_array_element_type (type
, nargs
);
8677 error (_("element type of array unknown"));
8679 return value_zero (ada_aligned_type (type
), lval_memory
);
8682 unwrap_value (ada_value_subscript
8683 (ada_coerce_to_simple_array (argvec
[0]),
8684 nargs
, argvec
+ 1));
8685 case TYPE_CODE_PTR
: /* Pointer to array */
8686 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8687 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8689 type
= ada_array_element_type (type
, nargs
);
8691 error (_("element type of array unknown"));
8693 return value_zero (ada_aligned_type (type
), lval_memory
);
8696 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8697 nargs
, argvec
+ 1));
8700 error (_("Attempt to index or call something other than an "
8701 "array or function"));
8706 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8707 struct value
*low_bound_val
=
8708 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8709 struct value
*high_bound_val
=
8710 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8713 low_bound_val
= coerce_ref (low_bound_val
);
8714 high_bound_val
= coerce_ref (high_bound_val
);
8715 low_bound
= pos_atr (low_bound_val
);
8716 high_bound
= pos_atr (high_bound_val
);
8718 if (noside
== EVAL_SKIP
)
8721 /* If this is a reference to an aligner type, then remove all
8723 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8724 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8725 TYPE_TARGET_TYPE (value_type (array
)) =
8726 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8728 if (ada_is_packed_array_type (value_type (array
)))
8729 error (_("cannot slice a packed array"));
8731 /* If this is a reference to an array or an array lvalue,
8732 convert to a pointer. */
8733 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8734 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8735 && VALUE_LVAL (array
) == lval_memory
))
8736 array
= value_addr (array
);
8738 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8739 && ada_is_array_descriptor_type (ada_check_typedef
8740 (value_type (array
))))
8741 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8743 array
= ada_coerce_to_simple_array_ptr (array
);
8745 /* If we have more than one level of pointer indirection,
8746 dereference the value until we get only one level. */
8747 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8748 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8750 array
= value_ind (array
);
8752 /* Make sure we really do have an array type before going further,
8753 to avoid a SEGV when trying to get the index type or the target
8754 type later down the road if the debug info generated by
8755 the compiler is incorrect or incomplete. */
8756 if (!ada_is_simple_array_type (value_type (array
)))
8757 error (_("cannot take slice of non-array"));
8759 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8761 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8762 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8766 struct type
*arr_type0
=
8767 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8769 return ada_value_slice_from_ptr (array
, arr_type0
,
8770 longest_to_int (low_bound
),
8771 longest_to_int (high_bound
));
8774 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8776 else if (high_bound
< low_bound
)
8777 return empty_array (value_type (array
), low_bound
);
8779 return ada_value_slice (array
, longest_to_int (low_bound
),
8780 longest_to_int (high_bound
));
8785 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8786 type
= exp
->elts
[pc
+ 1].type
;
8788 if (noside
== EVAL_SKIP
)
8791 switch (TYPE_CODE (type
))
8794 lim_warning (_("Membership test incompletely implemented; "
8795 "always returns true"));
8796 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8797 return value_from_longest (type
, (LONGEST
) 1);
8799 case TYPE_CODE_RANGE
:
8800 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
8801 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
8802 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8803 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8804 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8806 value_from_longest (type
,
8807 (value_less (arg1
, arg3
)
8808 || value_equal (arg1
, arg3
))
8809 && (value_less (arg2
, arg1
)
8810 || value_equal (arg2
, arg1
)));
8813 case BINOP_IN_BOUNDS
:
8815 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8816 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8818 if (noside
== EVAL_SKIP
)
8821 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8823 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8824 return value_zero (type
, not_lval
);
8827 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8829 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8830 error (_("invalid dimension number to 'range"));
8832 arg3
= ada_array_bound (arg2
, tem
, 1);
8833 arg2
= ada_array_bound (arg2
, tem
, 0);
8835 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8836 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8837 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8839 value_from_longest (type
,
8840 (value_less (arg1
, arg3
)
8841 || value_equal (arg1
, arg3
))
8842 && (value_less (arg2
, arg1
)
8843 || value_equal (arg2
, arg1
)));
8845 case TERNOP_IN_RANGE
:
8846 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8847 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8848 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8850 if (noside
== EVAL_SKIP
)
8853 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8854 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8855 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8857 value_from_longest (type
,
8858 (value_less (arg1
, arg3
)
8859 || value_equal (arg1
, arg3
))
8860 && (value_less (arg2
, arg1
)
8861 || value_equal (arg2
, arg1
)));
8867 struct type
*type_arg
;
8868 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8870 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8872 type_arg
= exp
->elts
[pc
+ 2].type
;
8876 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8880 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8881 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8882 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8885 if (noside
== EVAL_SKIP
)
8888 if (type_arg
== NULL
)
8890 arg1
= ada_coerce_ref (arg1
);
8892 if (ada_is_packed_array_type (value_type (arg1
)))
8893 arg1
= ada_coerce_to_simple_array (arg1
);
8895 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8896 error (_("invalid dimension number to '%s"),
8897 ada_attribute_name (op
));
8899 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8901 type
= ada_index_type (value_type (arg1
), tem
);
8904 (_("attempt to take bound of something that is not an array"));
8905 return allocate_value (type
);
8910 default: /* Should never happen. */
8911 error (_("unexpected attribute encountered"));
8913 return ada_array_bound (arg1
, tem
, 0);
8915 return ada_array_bound (arg1
, tem
, 1);
8917 return ada_array_length (arg1
, tem
);
8920 else if (discrete_type_p (type_arg
))
8922 struct type
*range_type
;
8923 char *name
= ada_type_name (type_arg
);
8925 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8927 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8928 if (range_type
== NULL
)
8929 range_type
= type_arg
;
8933 error (_("unexpected attribute encountered"));
8935 return value_from_longest
8936 (range_type
, discrete_type_low_bound (range_type
));
8938 return value_from_longest
8939 (range_type
, discrete_type_high_bound (range_type
));
8941 error (_("the 'length attribute applies only to array types"));
8944 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8945 error (_("unimplemented type attribute"));
8950 if (ada_is_packed_array_type (type_arg
))
8951 type_arg
= decode_packed_array_type (type_arg
);
8953 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8954 error (_("invalid dimension number to '%s"),
8955 ada_attribute_name (op
));
8957 type
= ada_index_type (type_arg
, tem
);
8960 (_("attempt to take bound of something that is not an array"));
8961 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8962 return allocate_value (type
);
8967 error (_("unexpected attribute encountered"));
8969 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8970 return value_from_longest (type
, low
);
8972 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8973 return value_from_longest (type
, high
);
8975 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8976 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8977 return value_from_longest (type
, high
- low
+ 1);
8983 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8984 if (noside
== EVAL_SKIP
)
8987 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8988 return value_zero (ada_tag_type (arg1
), not_lval
);
8990 return ada_value_tag (arg1
);
8994 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8995 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8996 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8997 if (noside
== EVAL_SKIP
)
8999 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9000 return value_zero (value_type (arg1
), not_lval
);
9003 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9004 return value_binop (arg1
, arg2
,
9005 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9008 case OP_ATR_MODULUS
:
9010 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9011 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9013 if (noside
== EVAL_SKIP
)
9016 if (!ada_is_modular_type (type_arg
))
9017 error (_("'modulus must be applied to modular type"));
9019 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9020 ada_modulus (type_arg
));
9025 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9026 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9027 if (noside
== EVAL_SKIP
)
9029 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9030 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9031 return value_zero (type
, not_lval
);
9033 return value_pos_atr (type
, arg1
);
9036 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9037 type
= value_type (arg1
);
9039 /* If the argument is a reference, then dereference its type, since
9040 the user is really asking for the size of the actual object,
9041 not the size of the pointer. */
9042 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9043 type
= TYPE_TARGET_TYPE (type
);
9045 if (noside
== EVAL_SKIP
)
9047 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9048 return value_zero (builtin_type_int32
, not_lval
);
9050 return value_from_longest (builtin_type_int32
,
9051 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9054 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9055 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9056 type
= exp
->elts
[pc
+ 2].type
;
9057 if (noside
== EVAL_SKIP
)
9059 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9060 return value_zero (type
, not_lval
);
9062 return value_val_atr (type
, arg1
);
9065 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9066 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9067 if (noside
== EVAL_SKIP
)
9069 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9070 return value_zero (value_type (arg1
), not_lval
);
9073 /* For integer exponentiation operations,
9074 only promote the first argument. */
9075 if (is_integral_type (value_type (arg2
)))
9076 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9078 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9080 return value_binop (arg1
, arg2
, op
);
9084 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9085 if (noside
== EVAL_SKIP
)
9091 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9092 if (noside
== EVAL_SKIP
)
9094 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9095 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9096 return value_neg (arg1
);
9101 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9102 if (noside
== EVAL_SKIP
)
9104 type
= ada_check_typedef (value_type (arg1
));
9105 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9107 if (ada_is_array_descriptor_type (type
))
9108 /* GDB allows dereferencing GNAT array descriptors. */
9110 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9111 if (arrType
== NULL
)
9112 error (_("Attempt to dereference null array pointer."));
9113 return value_at_lazy (arrType
, 0);
9115 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9116 || TYPE_CODE (type
) == TYPE_CODE_REF
9117 /* In C you can dereference an array to get the 1st elt. */
9118 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9120 type
= to_static_fixed_type
9122 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9124 return value_zero (type
, lval_memory
);
9126 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9128 /* GDB allows dereferencing an int. */
9129 if (expect_type
== NULL
)
9130 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9135 to_static_fixed_type (ada_aligned_type (expect_type
));
9136 return value_zero (expect_type
, lval_memory
);
9140 error (_("Attempt to take contents of a non-pointer value."));
9142 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9143 type
= ada_check_typedef (value_type (arg1
));
9145 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9146 /* GDB allows dereferencing an int. If we were given
9147 the expect_type, then use that as the target type.
9148 Otherwise, assume that the target type is an int. */
9150 if (expect_type
!= NULL
)
9151 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9154 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9155 (CORE_ADDR
) value_as_address (arg1
));
9158 if (ada_is_array_descriptor_type (type
))
9159 /* GDB allows dereferencing GNAT array descriptors. */
9160 return ada_coerce_to_simple_array (arg1
);
9162 return ada_value_ind (arg1
);
9164 case STRUCTOP_STRUCT
:
9165 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9166 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9167 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9168 if (noside
== EVAL_SKIP
)
9170 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9172 struct type
*type1
= value_type (arg1
);
9173 if (ada_is_tagged_type (type1
, 1))
9175 type
= ada_lookup_struct_elt_type (type1
,
9176 &exp
->elts
[pc
+ 2].string
,
9179 /* In this case, we assume that the field COULD exist
9180 in some extension of the type. Return an object of
9181 "type" void, which will match any formal
9182 (see ada_type_match). */
9183 return value_zero (builtin_type_void
, lval_memory
);
9187 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9190 return value_zero (ada_aligned_type (type
), lval_memory
);
9194 ada_to_fixed_value (unwrap_value
9195 (ada_value_struct_elt
9196 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9198 /* The value is not supposed to be used. This is here to make it
9199 easier to accommodate expressions that contain types. */
9201 if (noside
== EVAL_SKIP
)
9203 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9204 return allocate_value (exp
->elts
[pc
+ 1].type
);
9206 error (_("Attempt to use a type name as an expression"));
9211 case OP_DISCRETE_RANGE
:
9214 if (noside
== EVAL_NORMAL
)
9218 error (_("Undefined name, ambiguous name, or renaming used in "
9219 "component association: %s."), &exp
->elts
[pc
+2].string
);
9221 error (_("Aggregates only allowed on the right of an assignment"));
9223 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9226 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9228 for (tem
= 0; tem
< nargs
; tem
+= 1)
9229 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9234 return value_from_longest (builtin_type_int8
, (LONGEST
) 1);
9240 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9241 type name that encodes the 'small and 'delta information.
9242 Otherwise, return NULL. */
9245 fixed_type_info (struct type
*type
)
9247 const char *name
= ada_type_name (type
);
9248 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9250 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9252 const char *tail
= strstr (name
, "___XF_");
9258 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9259 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9264 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9267 ada_is_fixed_point_type (struct type
*type
)
9269 return fixed_type_info (type
) != NULL
;
9272 /* Return non-zero iff TYPE represents a System.Address type. */
9275 ada_is_system_address_type (struct type
*type
)
9277 return (TYPE_NAME (type
)
9278 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9281 /* Assuming that TYPE is the representation of an Ada fixed-point
9282 type, return its delta, or -1 if the type is malformed and the
9283 delta cannot be determined. */
9286 ada_delta (struct type
*type
)
9288 const char *encoding
= fixed_type_info (type
);
9291 /* Strictly speaking, num and den are encoded as integer. However,
9292 they may not fit into a long, and they will have to be converted
9293 to DOUBLEST anyway. So scan them as DOUBLEST. */
9294 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9301 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9302 factor ('SMALL value) associated with the type. */
9305 scaling_factor (struct type
*type
)
9307 const char *encoding
= fixed_type_info (type
);
9308 DOUBLEST num0
, den0
, num1
, den1
;
9311 /* Strictly speaking, num's and den's are encoded as integer. However,
9312 they may not fit into a long, and they will have to be converted
9313 to DOUBLEST anyway. So scan them as DOUBLEST. */
9314 n
= sscanf (encoding
,
9315 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9316 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9317 &num0
, &den0
, &num1
, &den1
);
9328 /* Assuming that X is the representation of a value of fixed-point
9329 type TYPE, return its floating-point equivalent. */
9332 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9334 return (DOUBLEST
) x
*scaling_factor (type
);
9337 /* The representation of a fixed-point value of type TYPE
9338 corresponding to the value X. */
9341 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9343 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9347 /* VAX floating formats */
9349 /* Non-zero iff TYPE represents one of the special VAX floating-point
9353 ada_is_vax_floating_type (struct type
*type
)
9356 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9359 && (TYPE_CODE (type
) == TYPE_CODE_INT
9360 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9361 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9364 /* The type of special VAX floating-point type this is, assuming
9365 ada_is_vax_floating_point. */
9368 ada_vax_float_type_suffix (struct type
*type
)
9370 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9373 /* A value representing the special debugging function that outputs
9374 VAX floating-point values of the type represented by TYPE. Assumes
9375 ada_is_vax_floating_type (TYPE). */
9378 ada_vax_float_print_function (struct type
*type
)
9380 switch (ada_vax_float_type_suffix (type
))
9383 return get_var_value ("DEBUG_STRING_F", 0);
9385 return get_var_value ("DEBUG_STRING_D", 0);
9387 return get_var_value ("DEBUG_STRING_G", 0);
9389 error (_("invalid VAX floating-point type"));
9396 /* Scan STR beginning at position K for a discriminant name, and
9397 return the value of that discriminant field of DVAL in *PX. If
9398 PNEW_K is not null, put the position of the character beyond the
9399 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9400 not alter *PX and *PNEW_K if unsuccessful. */
9403 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9406 static char *bound_buffer
= NULL
;
9407 static size_t bound_buffer_len
= 0;
9410 struct value
*bound_val
;
9412 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9415 pend
= strstr (str
+ k
, "__");
9419 k
+= strlen (bound
);
9423 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9424 bound
= bound_buffer
;
9425 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9426 bound
[pend
- (str
+ k
)] = '\0';
9430 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9431 if (bound_val
== NULL
)
9434 *px
= value_as_long (bound_val
);
9440 /* Value of variable named NAME in the current environment. If
9441 no such variable found, then if ERR_MSG is null, returns 0, and
9442 otherwise causes an error with message ERR_MSG. */
9444 static struct value
*
9445 get_var_value (char *name
, char *err_msg
)
9447 struct ada_symbol_info
*syms
;
9450 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9455 if (err_msg
== NULL
)
9458 error (("%s"), err_msg
);
9461 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9464 /* Value of integer variable named NAME in the current environment. If
9465 no such variable found, returns 0, and sets *FLAG to 0. If
9466 successful, sets *FLAG to 1. */
9469 get_int_var_value (char *name
, int *flag
)
9471 struct value
*var_val
= get_var_value (name
, 0);
9483 return value_as_long (var_val
);
9488 /* Return a range type whose base type is that of the range type named
9489 NAME in the current environment, and whose bounds are calculated
9490 from NAME according to the GNAT range encoding conventions.
9491 Extract discriminant values, if needed, from DVAL. If a new type
9492 must be created, allocate in OBJFILE's space. The bounds
9493 information, in general, is encoded in NAME, the base type given in
9494 the named range type. */
9496 static struct type
*
9497 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9499 struct type
*raw_type
= ada_find_any_type (name
);
9500 struct type
*base_type
;
9503 if (raw_type
== NULL
)
9504 base_type
= builtin_type_int32
;
9505 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9506 base_type
= TYPE_TARGET_TYPE (raw_type
);
9508 base_type
= raw_type
;
9510 subtype_info
= strstr (name
, "___XD");
9511 if (subtype_info
== NULL
)
9513 LONGEST L
= discrete_type_low_bound (raw_type
);
9514 LONGEST U
= discrete_type_high_bound (raw_type
);
9515 if (L
< INT_MIN
|| U
> INT_MAX
)
9518 return create_range_type (alloc_type (objfile
), raw_type
,
9519 discrete_type_low_bound (raw_type
),
9520 discrete_type_high_bound (raw_type
));
9524 static char *name_buf
= NULL
;
9525 static size_t name_len
= 0;
9526 int prefix_len
= subtype_info
- name
;
9532 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9533 strncpy (name_buf
, name
, prefix_len
);
9534 name_buf
[prefix_len
] = '\0';
9537 bounds_str
= strchr (subtype_info
, '_');
9540 if (*subtype_info
== 'L')
9542 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9543 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9545 if (bounds_str
[n
] == '_')
9547 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9554 strcpy (name_buf
+ prefix_len
, "___L");
9555 L
= get_int_var_value (name_buf
, &ok
);
9558 lim_warning (_("Unknown lower bound, using 1."));
9563 if (*subtype_info
== 'U')
9565 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9566 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9572 strcpy (name_buf
+ prefix_len
, "___U");
9573 U
= get_int_var_value (name_buf
, &ok
);
9576 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9581 if (objfile
== NULL
)
9582 objfile
= TYPE_OBJFILE (base_type
);
9583 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9584 TYPE_NAME (type
) = name
;
9589 /* True iff NAME is the name of a range type. */
9592 ada_is_range_type_name (const char *name
)
9594 return (name
!= NULL
&& strstr (name
, "___XD"));
9600 /* True iff TYPE is an Ada modular type. */
9603 ada_is_modular_type (struct type
*type
)
9605 struct type
*subranged_type
= base_type (type
);
9607 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9608 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9609 && TYPE_UNSIGNED (subranged_type
));
9612 /* Try to determine the lower and upper bounds of the given modular type
9613 using the type name only. Return non-zero and set L and U as the lower
9614 and upper bounds (respectively) if successful. */
9617 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9619 char *name
= ada_type_name (type
);
9627 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9628 we are looking for static bounds, which means an __XDLU suffix.
9629 Moreover, we know that the lower bound of modular types is always
9630 zero, so the actual suffix should start with "__XDLU_0__", and
9631 then be followed by the upper bound value. */
9632 suffix
= strstr (name
, "__XDLU_0__");
9636 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9639 *modulus
= (ULONGEST
) U
+ 1;
9643 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9646 ada_modulus (struct type
*type
)
9650 /* Normally, the modulus of a modular type is equal to the value of
9651 its upper bound + 1. However, the upper bound is currently stored
9652 as an int, which is not always big enough to hold the actual bound
9653 value. To workaround this, try to take advantage of the encoding
9654 that GNAT uses with with discrete types. To avoid some unnecessary
9655 parsing, we do this only when the size of TYPE is greater than
9656 the size of the field holding the bound. */
9657 if (TYPE_LENGTH (type
) > sizeof (TYPE_HIGH_BOUND (type
))
9658 && ada_modulus_from_name (type
, &modulus
))
9661 return (ULONGEST
) (unsigned int) TYPE_HIGH_BOUND (type
) + 1;
9665 /* Ada exception catchpoint support:
9666 ---------------------------------
9668 We support 3 kinds of exception catchpoints:
9669 . catchpoints on Ada exceptions
9670 . catchpoints on unhandled Ada exceptions
9671 . catchpoints on failed assertions
9673 Exceptions raised during failed assertions, or unhandled exceptions
9674 could perfectly be caught with the general catchpoint on Ada exceptions.
9675 However, we can easily differentiate these two special cases, and having
9676 the option to distinguish these two cases from the rest can be useful
9677 to zero-in on certain situations.
9679 Exception catchpoints are a specialized form of breakpoint,
9680 since they rely on inserting breakpoints inside known routines
9681 of the GNAT runtime. The implementation therefore uses a standard
9682 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9685 Support in the runtime for exception catchpoints have been changed
9686 a few times already, and these changes affect the implementation
9687 of these catchpoints. In order to be able to support several
9688 variants of the runtime, we use a sniffer that will determine
9689 the runtime variant used by the program being debugged.
9691 At this time, we do not support the use of conditions on Ada exception
9692 catchpoints. The COND and COND_STRING fields are therefore set
9693 to NULL (most of the time, see below).
9695 Conditions where EXP_STRING, COND, and COND_STRING are used:
9697 When a user specifies the name of a specific exception in the case
9698 of catchpoints on Ada exceptions, we store the name of that exception
9699 in the EXP_STRING. We then translate this request into an actual
9700 condition stored in COND_STRING, and then parse it into an expression
9703 /* The different types of catchpoints that we introduced for catching
9706 enum exception_catchpoint_kind
9709 ex_catch_exception_unhandled
,
9713 /* Ada's standard exceptions. */
9715 static char *standard_exc
[] = {
9722 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9724 /* A structure that describes how to support exception catchpoints
9725 for a given executable. */
9727 struct exception_support_info
9729 /* The name of the symbol to break on in order to insert
9730 a catchpoint on exceptions. */
9731 const char *catch_exception_sym
;
9733 /* The name of the symbol to break on in order to insert
9734 a catchpoint on unhandled exceptions. */
9735 const char *catch_exception_unhandled_sym
;
9737 /* The name of the symbol to break on in order to insert
9738 a catchpoint on failed assertions. */
9739 const char *catch_assert_sym
;
9741 /* Assuming that the inferior just triggered an unhandled exception
9742 catchpoint, this function is responsible for returning the address
9743 in inferior memory where the name of that exception is stored.
9744 Return zero if the address could not be computed. */
9745 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9748 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9749 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9751 /* The following exception support info structure describes how to
9752 implement exception catchpoints with the latest version of the
9753 Ada runtime (as of 2007-03-06). */
9755 static const struct exception_support_info default_exception_support_info
=
9757 "__gnat_debug_raise_exception", /* catch_exception_sym */
9758 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9759 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9760 ada_unhandled_exception_name_addr
9763 /* The following exception support info structure describes how to
9764 implement exception catchpoints with a slightly older version
9765 of the Ada runtime. */
9767 static const struct exception_support_info exception_support_info_fallback
=
9769 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9770 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9771 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9772 ada_unhandled_exception_name_addr_from_raise
9775 /* For each executable, we sniff which exception info structure to use
9776 and cache it in the following global variable. */
9778 static const struct exception_support_info
*exception_info
= NULL
;
9780 /* Inspect the Ada runtime and determine which exception info structure
9781 should be used to provide support for exception catchpoints.
9783 This function will always set exception_info, or raise an error. */
9786 ada_exception_support_info_sniffer (void)
9790 /* If the exception info is already known, then no need to recompute it. */
9791 if (exception_info
!= NULL
)
9794 /* Check the latest (default) exception support info. */
9795 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9799 exception_info
= &default_exception_support_info
;
9803 /* Try our fallback exception suport info. */
9804 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9808 exception_info
= &exception_support_info_fallback
;
9812 /* Sometimes, it is normal for us to not be able to find the routine
9813 we are looking for. This happens when the program is linked with
9814 the shared version of the GNAT runtime, and the program has not been
9815 started yet. Inform the user of these two possible causes if
9818 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9819 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9821 /* If the symbol does not exist, then check that the program is
9822 already started, to make sure that shared libraries have been
9823 loaded. If it is not started, this may mean that the symbol is
9824 in a shared library. */
9826 if (ptid_get_pid (inferior_ptid
) == 0)
9827 error (_("Unable to insert catchpoint. Try to start the program first."));
9829 /* At this point, we know that we are debugging an Ada program and
9830 that the inferior has been started, but we still are not able to
9831 find the run-time symbols. That can mean that we are in
9832 configurable run time mode, or that a-except as been optimized
9833 out by the linker... In any case, at this point it is not worth
9834 supporting this feature. */
9836 error (_("Cannot insert catchpoints in this configuration."));
9839 /* An observer of "executable_changed" events.
9840 Its role is to clear certain cached values that need to be recomputed
9841 each time a new executable is loaded by GDB. */
9844 ada_executable_changed_observer (void)
9846 /* If the executable changed, then it is possible that the Ada runtime
9847 is different. So we need to invalidate the exception support info
9849 exception_info
= NULL
;
9852 /* Return the name of the function at PC, NULL if could not find it.
9853 This function only checks the debugging information, not the symbol
9857 function_name_from_pc (CORE_ADDR pc
)
9861 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9867 /* True iff FRAME is very likely to be that of a function that is
9868 part of the runtime system. This is all very heuristic, but is
9869 intended to be used as advice as to what frames are uninteresting
9873 is_known_support_routine (struct frame_info
*frame
)
9875 struct symtab_and_line sal
;
9879 /* If this code does not have any debugging information (no symtab),
9880 This cannot be any user code. */
9882 find_frame_sal (frame
, &sal
);
9883 if (sal
.symtab
== NULL
)
9886 /* If there is a symtab, but the associated source file cannot be
9887 located, then assume this is not user code: Selecting a frame
9888 for which we cannot display the code would not be very helpful
9889 for the user. This should also take care of case such as VxWorks
9890 where the kernel has some debugging info provided for a few units. */
9892 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9895 /* Check the unit filename againt the Ada runtime file naming.
9896 We also check the name of the objfile against the name of some
9897 known system libraries that sometimes come with debugging info
9900 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9902 re_comp (known_runtime_file_name_patterns
[i
]);
9903 if (re_exec (sal
.symtab
->filename
))
9905 if (sal
.symtab
->objfile
!= NULL
9906 && re_exec (sal
.symtab
->objfile
->name
))
9910 /* Check whether the function is a GNAT-generated entity. */
9912 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9913 if (func_name
== NULL
)
9916 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9918 re_comp (known_auxiliary_function_name_patterns
[i
]);
9919 if (re_exec (func_name
))
9926 /* Find the first frame that contains debugging information and that is not
9927 part of the Ada run-time, starting from FI and moving upward. */
9930 ada_find_printable_frame (struct frame_info
*fi
)
9932 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9934 if (!is_known_support_routine (fi
))
9943 /* Assuming that the inferior just triggered an unhandled exception
9944 catchpoint, return the address in inferior memory where the name
9945 of the exception is stored.
9947 Return zero if the address could not be computed. */
9950 ada_unhandled_exception_name_addr (void)
9952 return parse_and_eval_address ("e.full_name");
9955 /* Same as ada_unhandled_exception_name_addr, except that this function
9956 should be used when the inferior uses an older version of the runtime,
9957 where the exception name needs to be extracted from a specific frame
9958 several frames up in the callstack. */
9961 ada_unhandled_exception_name_addr_from_raise (void)
9964 struct frame_info
*fi
;
9966 /* To determine the name of this exception, we need to select
9967 the frame corresponding to RAISE_SYM_NAME. This frame is
9968 at least 3 levels up, so we simply skip the first 3 frames
9969 without checking the name of their associated function. */
9970 fi
= get_current_frame ();
9971 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9973 fi
= get_prev_frame (fi
);
9977 const char *func_name
=
9978 function_name_from_pc (get_frame_address_in_block (fi
));
9979 if (func_name
!= NULL
9980 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9981 break; /* We found the frame we were looking for... */
9982 fi
= get_prev_frame (fi
);
9989 return parse_and_eval_address ("id.full_name");
9992 /* Assuming the inferior just triggered an Ada exception catchpoint
9993 (of any type), return the address in inferior memory where the name
9994 of the exception is stored, if applicable.
9996 Return zero if the address could not be computed, or if not relevant. */
9999 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10000 struct breakpoint
*b
)
10004 case ex_catch_exception
:
10005 return (parse_and_eval_address ("e.full_name"));
10008 case ex_catch_exception_unhandled
:
10009 return exception_info
->unhandled_exception_name_addr ();
10012 case ex_catch_assert
:
10013 return 0; /* Exception name is not relevant in this case. */
10017 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10021 return 0; /* Should never be reached. */
10024 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10025 any error that ada_exception_name_addr_1 might cause to be thrown.
10026 When an error is intercepted, a warning with the error message is printed,
10027 and zero is returned. */
10030 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10031 struct breakpoint
*b
)
10033 struct gdb_exception e
;
10034 CORE_ADDR result
= 0;
10036 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10038 result
= ada_exception_name_addr_1 (ex
, b
);
10043 warning (_("failed to get exception name: %s"), e
.message
);
10050 /* Implement the PRINT_IT method in the breakpoint_ops structure
10051 for all exception catchpoint kinds. */
10053 static enum print_stop_action
10054 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10056 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10057 char exception_name
[256];
10061 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10062 exception_name
[sizeof (exception_name
) - 1] = '\0';
10065 ada_find_printable_frame (get_current_frame ());
10067 annotate_catchpoint (b
->number
);
10070 case ex_catch_exception
:
10072 printf_filtered (_("\nCatchpoint %d, %s at "),
10073 b
->number
, exception_name
);
10075 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10077 case ex_catch_exception_unhandled
:
10079 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10080 b
->number
, exception_name
);
10082 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10085 case ex_catch_assert
:
10086 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10091 return PRINT_SRC_AND_LOC
;
10094 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10095 for all exception catchpoint kinds. */
10098 print_one_exception (enum exception_catchpoint_kind ex
,
10099 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10101 struct value_print_options opts
;
10103 get_user_print_options (&opts
);
10104 if (opts
.addressprint
)
10106 annotate_field (4);
10107 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10110 annotate_field (5);
10111 *last_addr
= b
->loc
->address
;
10114 case ex_catch_exception
:
10115 if (b
->exp_string
!= NULL
)
10117 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10119 ui_out_field_string (uiout
, "what", msg
);
10123 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10127 case ex_catch_exception_unhandled
:
10128 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10131 case ex_catch_assert
:
10132 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10136 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10141 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10142 for all exception catchpoint kinds. */
10145 print_mention_exception (enum exception_catchpoint_kind ex
,
10146 struct breakpoint
*b
)
10150 case ex_catch_exception
:
10151 if (b
->exp_string
!= NULL
)
10152 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10153 b
->number
, b
->exp_string
);
10155 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10159 case ex_catch_exception_unhandled
:
10160 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10164 case ex_catch_assert
:
10165 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10169 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10174 /* Virtual table for "catch exception" breakpoints. */
10176 static enum print_stop_action
10177 print_it_catch_exception (struct breakpoint
*b
)
10179 return print_it_exception (ex_catch_exception
, b
);
10183 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10185 print_one_exception (ex_catch_exception
, b
, last_addr
);
10189 print_mention_catch_exception (struct breakpoint
*b
)
10191 print_mention_exception (ex_catch_exception
, b
);
10194 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10198 NULL
, /* breakpoint_hit */
10199 print_it_catch_exception
,
10200 print_one_catch_exception
,
10201 print_mention_catch_exception
10204 /* Virtual table for "catch exception unhandled" breakpoints. */
10206 static enum print_stop_action
10207 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10209 return print_it_exception (ex_catch_exception_unhandled
, b
);
10213 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10215 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10219 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10221 print_mention_exception (ex_catch_exception_unhandled
, b
);
10224 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10227 NULL
, /* breakpoint_hit */
10228 print_it_catch_exception_unhandled
,
10229 print_one_catch_exception_unhandled
,
10230 print_mention_catch_exception_unhandled
10233 /* Virtual table for "catch assert" breakpoints. */
10235 static enum print_stop_action
10236 print_it_catch_assert (struct breakpoint
*b
)
10238 return print_it_exception (ex_catch_assert
, b
);
10242 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10244 print_one_exception (ex_catch_assert
, b
, last_addr
);
10248 print_mention_catch_assert (struct breakpoint
*b
)
10250 print_mention_exception (ex_catch_assert
, b
);
10253 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10256 NULL
, /* breakpoint_hit */
10257 print_it_catch_assert
,
10258 print_one_catch_assert
,
10259 print_mention_catch_assert
10262 /* Return non-zero if B is an Ada exception catchpoint. */
10265 ada_exception_catchpoint_p (struct breakpoint
*b
)
10267 return (b
->ops
== &catch_exception_breakpoint_ops
10268 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10269 || b
->ops
== &catch_assert_breakpoint_ops
);
10272 /* Return a newly allocated copy of the first space-separated token
10273 in ARGSP, and then adjust ARGSP to point immediately after that
10276 Return NULL if ARGPS does not contain any more tokens. */
10279 ada_get_next_arg (char **argsp
)
10281 char *args
= *argsp
;
10285 /* Skip any leading white space. */
10287 while (isspace (*args
))
10290 if (args
[0] == '\0')
10291 return NULL
; /* No more arguments. */
10293 /* Find the end of the current argument. */
10296 while (*end
!= '\0' && !isspace (*end
))
10299 /* Adjust ARGSP to point to the start of the next argument. */
10303 /* Make a copy of the current argument and return it. */
10305 result
= xmalloc (end
- args
+ 1);
10306 strncpy (result
, args
, end
- args
);
10307 result
[end
- args
] = '\0';
10312 /* Split the arguments specified in a "catch exception" command.
10313 Set EX to the appropriate catchpoint type.
10314 Set EXP_STRING to the name of the specific exception if
10315 specified by the user. */
10318 catch_ada_exception_command_split (char *args
,
10319 enum exception_catchpoint_kind
*ex
,
10322 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10323 char *exception_name
;
10325 exception_name
= ada_get_next_arg (&args
);
10326 make_cleanup (xfree
, exception_name
);
10328 /* Check that we do not have any more arguments. Anything else
10331 while (isspace (*args
))
10334 if (args
[0] != '\0')
10335 error (_("Junk at end of expression"));
10337 discard_cleanups (old_chain
);
10339 if (exception_name
== NULL
)
10341 /* Catch all exceptions. */
10342 *ex
= ex_catch_exception
;
10343 *exp_string
= NULL
;
10345 else if (strcmp (exception_name
, "unhandled") == 0)
10347 /* Catch unhandled exceptions. */
10348 *ex
= ex_catch_exception_unhandled
;
10349 *exp_string
= NULL
;
10353 /* Catch a specific exception. */
10354 *ex
= ex_catch_exception
;
10355 *exp_string
= exception_name
;
10359 /* Return the name of the symbol on which we should break in order to
10360 implement a catchpoint of the EX kind. */
10362 static const char *
10363 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10365 gdb_assert (exception_info
!= NULL
);
10369 case ex_catch_exception
:
10370 return (exception_info
->catch_exception_sym
);
10372 case ex_catch_exception_unhandled
:
10373 return (exception_info
->catch_exception_unhandled_sym
);
10375 case ex_catch_assert
:
10376 return (exception_info
->catch_assert_sym
);
10379 internal_error (__FILE__
, __LINE__
,
10380 _("unexpected catchpoint kind (%d)"), ex
);
10384 /* Return the breakpoint ops "virtual table" used for catchpoints
10387 static struct breakpoint_ops
*
10388 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10392 case ex_catch_exception
:
10393 return (&catch_exception_breakpoint_ops
);
10395 case ex_catch_exception_unhandled
:
10396 return (&catch_exception_unhandled_breakpoint_ops
);
10398 case ex_catch_assert
:
10399 return (&catch_assert_breakpoint_ops
);
10402 internal_error (__FILE__
, __LINE__
,
10403 _("unexpected catchpoint kind (%d)"), ex
);
10407 /* Return the condition that will be used to match the current exception
10408 being raised with the exception that the user wants to catch. This
10409 assumes that this condition is used when the inferior just triggered
10410 an exception catchpoint.
10412 The string returned is a newly allocated string that needs to be
10413 deallocated later. */
10416 ada_exception_catchpoint_cond_string (const char *exp_string
)
10420 /* The standard exceptions are a special case. They are defined in
10421 runtime units that have been compiled without debugging info; if
10422 EXP_STRING is the not-fully-qualified name of a standard
10423 exception (e.g. "constraint_error") then, during the evaluation
10424 of the condition expression, the symbol lookup on this name would
10425 *not* return this standard exception. The catchpoint condition
10426 may then be set only on user-defined exceptions which have the
10427 same not-fully-qualified name (e.g. my_package.constraint_error).
10429 To avoid this unexcepted behavior, these standard exceptions are
10430 systematically prefixed by "standard". This means that "catch
10431 exception constraint_error" is rewritten into "catch exception
10432 standard.constraint_error".
10434 If an exception named contraint_error is defined in another package of
10435 the inferior program, then the only way to specify this exception as a
10436 breakpoint condition is to use its fully-qualified named:
10437 e.g. my_package.constraint_error. */
10439 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10441 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10443 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10447 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10450 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10452 static struct expression
*
10453 ada_parse_catchpoint_condition (char *cond_string
,
10454 struct symtab_and_line sal
)
10456 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10459 /* Return the symtab_and_line that should be used to insert an exception
10460 catchpoint of the TYPE kind.
10462 EX_STRING should contain the name of a specific exception
10463 that the catchpoint should catch, or NULL otherwise.
10465 The idea behind all the remaining parameters is that their names match
10466 the name of certain fields in the breakpoint structure that are used to
10467 handle exception catchpoints. This function returns the value to which
10468 these fields should be set, depending on the type of catchpoint we need
10471 If COND and COND_STRING are both non-NULL, any value they might
10472 hold will be free'ed, and then replaced by newly allocated ones.
10473 These parameters are left untouched otherwise. */
10475 static struct symtab_and_line
10476 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10477 char **addr_string
, char **cond_string
,
10478 struct expression
**cond
, struct breakpoint_ops
**ops
)
10480 const char *sym_name
;
10481 struct symbol
*sym
;
10482 struct symtab_and_line sal
;
10484 /* First, find out which exception support info to use. */
10485 ada_exception_support_info_sniffer ();
10487 /* Then lookup the function on which we will break in order to catch
10488 the Ada exceptions requested by the user. */
10490 sym_name
= ada_exception_sym_name (ex
);
10491 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10493 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10494 that should be compiled with debugging information. As a result, we
10495 expect to find that symbol in the symtabs. If we don't find it, then
10496 the target most likely does not support Ada exceptions, or we cannot
10497 insert exception breakpoints yet, because the GNAT runtime hasn't been
10500 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10501 in such a way that no debugging information is produced for the symbol
10502 we are looking for. In this case, we could search the minimal symbols
10503 as a fall-back mechanism. This would still be operating in degraded
10504 mode, however, as we would still be missing the debugging information
10505 that is needed in order to extract the name of the exception being
10506 raised (this name is printed in the catchpoint message, and is also
10507 used when trying to catch a specific exception). We do not handle
10508 this case for now. */
10511 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10513 /* Make sure that the symbol we found corresponds to a function. */
10514 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10515 error (_("Symbol \"%s\" is not a function (class = %d)"),
10516 sym_name
, SYMBOL_CLASS (sym
));
10518 sal
= find_function_start_sal (sym
, 1);
10520 /* Set ADDR_STRING. */
10522 *addr_string
= xstrdup (sym_name
);
10524 /* Set the COND and COND_STRING (if not NULL). */
10526 if (cond_string
!= NULL
&& cond
!= NULL
)
10528 if (*cond_string
!= NULL
)
10530 xfree (*cond_string
);
10531 *cond_string
= NULL
;
10538 if (exp_string
!= NULL
)
10540 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10541 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10546 *ops
= ada_exception_breakpoint_ops (ex
);
10551 /* Parse the arguments (ARGS) of the "catch exception" command.
10553 Set TYPE to the appropriate exception catchpoint type.
10554 If the user asked the catchpoint to catch only a specific
10555 exception, then save the exception name in ADDR_STRING.
10557 See ada_exception_sal for a description of all the remaining
10558 function arguments of this function. */
10560 struct symtab_and_line
10561 ada_decode_exception_location (char *args
, char **addr_string
,
10562 char **exp_string
, char **cond_string
,
10563 struct expression
**cond
,
10564 struct breakpoint_ops
**ops
)
10566 enum exception_catchpoint_kind ex
;
10568 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10569 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10573 struct symtab_and_line
10574 ada_decode_assert_location (char *args
, char **addr_string
,
10575 struct breakpoint_ops
**ops
)
10577 /* Check that no argument where provided at the end of the command. */
10581 while (isspace (*args
))
10584 error (_("Junk at end of arguments."));
10587 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10592 /* Information about operators given special treatment in functions
10594 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10596 #define ADA_OPERATORS \
10597 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10598 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10599 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10600 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10601 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10602 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10603 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10604 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10605 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10606 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10607 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10608 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10609 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10610 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10611 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10612 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10613 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10614 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10615 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10618 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10620 switch (exp
->elts
[pc
- 1].opcode
)
10623 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10626 #define OP_DEFN(op, len, args, binop) \
10627 case op: *oplenp = len; *argsp = args; break;
10633 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10638 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10644 ada_op_name (enum exp_opcode opcode
)
10649 return op_name_standard (opcode
);
10651 #define OP_DEFN(op, len, args, binop) case op: return #op;
10656 return "OP_AGGREGATE";
10658 return "OP_CHOICES";
10664 /* As for operator_length, but assumes PC is pointing at the first
10665 element of the operator, and gives meaningful results only for the
10666 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10669 ada_forward_operator_length (struct expression
*exp
, int pc
,
10670 int *oplenp
, int *argsp
)
10672 switch (exp
->elts
[pc
].opcode
)
10675 *oplenp
= *argsp
= 0;
10678 #define OP_DEFN(op, len, args, binop) \
10679 case op: *oplenp = len; *argsp = args; break;
10685 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10690 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10696 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10697 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10705 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10707 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10712 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10716 /* Ada attributes ('Foo). */
10719 case OP_ATR_LENGTH
:
10723 case OP_ATR_MODULUS
:
10730 case UNOP_IN_RANGE
:
10732 /* XXX: gdb_sprint_host_address, type_sprint */
10733 fprintf_filtered (stream
, _("Type @"));
10734 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10735 fprintf_filtered (stream
, " (");
10736 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10737 fprintf_filtered (stream
, ")");
10739 case BINOP_IN_BOUNDS
:
10740 fprintf_filtered (stream
, " (%d)",
10741 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10743 case TERNOP_IN_RANGE
:
10748 case OP_DISCRETE_RANGE
:
10749 case OP_POSITIONAL
:
10756 char *name
= &exp
->elts
[elt
+ 2].string
;
10757 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10758 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10763 return dump_subexp_body_standard (exp
, stream
, elt
);
10767 for (i
= 0; i
< nargs
; i
+= 1)
10768 elt
= dump_subexp (exp
, stream
, elt
);
10773 /* The Ada extension of print_subexp (q.v.). */
10776 ada_print_subexp (struct expression
*exp
, int *pos
,
10777 struct ui_file
*stream
, enum precedence prec
)
10779 int oplen
, nargs
, i
;
10781 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10783 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10790 print_subexp_standard (exp
, pos
, stream
, prec
);
10794 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10797 case BINOP_IN_BOUNDS
:
10798 /* XXX: sprint_subexp */
10799 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10800 fputs_filtered (" in ", stream
);
10801 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10802 fputs_filtered ("'range", stream
);
10803 if (exp
->elts
[pc
+ 1].longconst
> 1)
10804 fprintf_filtered (stream
, "(%ld)",
10805 (long) exp
->elts
[pc
+ 1].longconst
);
10808 case TERNOP_IN_RANGE
:
10809 if (prec
>= PREC_EQUAL
)
10810 fputs_filtered ("(", stream
);
10811 /* XXX: sprint_subexp */
10812 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10813 fputs_filtered (" in ", stream
);
10814 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10815 fputs_filtered (" .. ", stream
);
10816 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10817 if (prec
>= PREC_EQUAL
)
10818 fputs_filtered (")", stream
);
10823 case OP_ATR_LENGTH
:
10827 case OP_ATR_MODULUS
:
10832 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10834 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10835 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10839 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10840 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10844 for (tem
= 1; tem
< nargs
; tem
+= 1)
10846 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10847 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10849 fputs_filtered (")", stream
);
10854 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10855 fputs_filtered ("'(", stream
);
10856 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10857 fputs_filtered (")", stream
);
10860 case UNOP_IN_RANGE
:
10861 /* XXX: sprint_subexp */
10862 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10863 fputs_filtered (" in ", stream
);
10864 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10867 case OP_DISCRETE_RANGE
:
10868 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10869 fputs_filtered ("..", stream
);
10870 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10874 fputs_filtered ("others => ", stream
);
10875 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10879 for (i
= 0; i
< nargs
-1; i
+= 1)
10882 fputs_filtered ("|", stream
);
10883 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10885 fputs_filtered (" => ", stream
);
10886 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10889 case OP_POSITIONAL
:
10890 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10894 fputs_filtered ("(", stream
);
10895 for (i
= 0; i
< nargs
; i
+= 1)
10898 fputs_filtered (", ", stream
);
10899 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10901 fputs_filtered (")", stream
);
10906 /* Table mapping opcodes into strings for printing operators
10907 and precedences of the operators. */
10909 static const struct op_print ada_op_print_tab
[] = {
10910 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10911 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10912 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10913 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10914 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10915 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10916 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10917 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10918 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10919 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10920 {">", BINOP_GTR
, PREC_ORDER
, 0},
10921 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10922 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10923 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10924 {"+", BINOP_ADD
, PREC_ADD
, 0},
10925 {"-", BINOP_SUB
, PREC_ADD
, 0},
10926 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10927 {"*", BINOP_MUL
, PREC_MUL
, 0},
10928 {"/", BINOP_DIV
, PREC_MUL
, 0},
10929 {"rem", BINOP_REM
, PREC_MUL
, 0},
10930 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10931 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10932 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10933 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10934 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10935 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10936 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10937 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10938 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10939 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10940 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10944 enum ada_primitive_types
{
10945 ada_primitive_type_int
,
10946 ada_primitive_type_long
,
10947 ada_primitive_type_short
,
10948 ada_primitive_type_char
,
10949 ada_primitive_type_float
,
10950 ada_primitive_type_double
,
10951 ada_primitive_type_void
,
10952 ada_primitive_type_long_long
,
10953 ada_primitive_type_long_double
,
10954 ada_primitive_type_natural
,
10955 ada_primitive_type_positive
,
10956 ada_primitive_type_system_address
,
10957 nr_ada_primitive_types
10961 ada_language_arch_info (struct gdbarch
*gdbarch
,
10962 struct language_arch_info
*lai
)
10964 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10965 lai
->primitive_type_vector
10966 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10968 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10969 init_type (TYPE_CODE_INT
,
10970 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10971 0, "integer", (struct objfile
*) NULL
);
10972 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10973 init_type (TYPE_CODE_INT
,
10974 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10975 0, "long_integer", (struct objfile
*) NULL
);
10976 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10977 init_type (TYPE_CODE_INT
,
10978 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10979 0, "short_integer", (struct objfile
*) NULL
);
10980 lai
->string_char_type
=
10981 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10982 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10983 0, "character", (struct objfile
*) NULL
);
10984 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10985 init_type (TYPE_CODE_FLT
,
10986 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10987 0, "float", (struct objfile
*) NULL
);
10988 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10989 init_type (TYPE_CODE_FLT
,
10990 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10991 0, "long_float", (struct objfile
*) NULL
);
10992 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10993 init_type (TYPE_CODE_INT
,
10994 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10995 0, "long_long_integer", (struct objfile
*) NULL
);
10996 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10997 init_type (TYPE_CODE_FLT
,
10998 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10999 0, "long_long_float", (struct objfile
*) NULL
);
11000 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
11001 init_type (TYPE_CODE_INT
,
11002 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
11003 0, "natural", (struct objfile
*) NULL
);
11004 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
11005 init_type (TYPE_CODE_INT
,
11006 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
11007 0, "positive", (struct objfile
*) NULL
);
11008 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
11010 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
11011 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
11012 (struct objfile
*) NULL
));
11013 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11014 = "system__address";
11016 lai
->bool_type_symbol
= NULL
;
11017 lai
->bool_type_default
= builtin
->builtin_bool
;
11020 /* Language vector */
11022 /* Not really used, but needed in the ada_language_defn. */
11025 emit_char (int c
, struct ui_file
*stream
, int quoter
)
11027 ada_emit_char (c
, stream
, quoter
, 1);
11033 warnings_issued
= 0;
11034 return ada_parse ();
11037 static const struct exp_descriptor ada_exp_descriptor
= {
11039 ada_operator_length
,
11041 ada_dump_subexp_body
,
11042 ada_evaluate_subexp
11045 const struct language_defn ada_language_defn
= {
11046 "ada", /* Language name */
11050 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11051 that's not quite what this means. */
11053 macro_expansion_no
,
11054 &ada_exp_descriptor
,
11058 ada_printchar
, /* Print a character constant */
11059 ada_printstr
, /* Function to print string constant */
11060 emit_char
, /* Function to print single char (not used) */
11061 ada_print_type
, /* Print a type using appropriate syntax */
11062 default_print_typedef
, /* Print a typedef using appropriate syntax */
11063 ada_val_print
, /* Print a value using appropriate syntax */
11064 ada_value_print
, /* Print a top-level value */
11065 NULL
, /* Language specific skip_trampoline */
11066 NULL
, /* name_of_this */
11067 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11068 basic_lookup_transparent_type
, /* lookup_transparent_type */
11069 ada_la_decode
, /* Language specific symbol demangler */
11070 NULL
, /* Language specific class_name_from_physname */
11071 ada_op_print_tab
, /* expression operators for printing */
11072 0, /* c-style arrays */
11073 1, /* String lower bound */
11074 ada_get_gdb_completer_word_break_characters
,
11075 ada_make_symbol_completion_list
,
11076 ada_language_arch_info
,
11077 ada_print_array_index
,
11078 default_pass_by_reference
,
11083 /* Provide a prototype to silence -Wmissing-prototypes. */
11084 extern initialize_file_ftype _initialize_ada_language
;
11087 _initialize_ada_language (void)
11089 add_language (&ada_language_defn
);
11091 varsize_limit
= 65536;
11093 obstack_init (&symbol_list_obstack
);
11095 decoded_names_store
= htab_create_alloc
11096 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11097 NULL
, xcalloc
, xfree
);
11099 observer_attach_executable_changed (ada_executable_changed_observer
);