1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007
4 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
60 /* 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 VALUE_LVAL (result
) = VALUE_LVAL (val
);
487 set_value_bitsize (result
, value_bitsize (val
));
488 set_value_bitpos (result
, value_bitpos (val
));
489 VALUE_ADDRESS (result
) = VALUE_ADDRESS (val
) + 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 /* Return non-zero if STR should be suppressed in info listings. */
738 is_suppressed_name (const char *str
)
740 if (strncmp (str
, "_ada_", 5) == 0)
742 if (str
[0] == '_' || str
[0] == '\000')
747 const char *suffix
= strstr (str
, "___");
748 if (suffix
!= NULL
&& suffix
[3] != 'X')
751 suffix
= str
+ strlen (str
);
752 for (p
= suffix
- 1; p
!= str
; p
-= 1)
756 if (p
[0] == 'X' && p
[-1] != '_')
760 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
761 if (strncmp (ada_opname_table
[i
].encoded
, p
,
762 strlen (ada_opname_table
[i
].encoded
)) == 0)
771 /* The "encoded" form of DECODED, according to GNAT conventions.
772 The result is valid until the next call to ada_encode. */
775 ada_encode (const char *decoded
)
777 static char *encoding_buffer
= NULL
;
778 static size_t encoding_buffer_size
= 0;
785 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
786 2 * strlen (decoded
) + 10);
789 for (p
= decoded
; *p
!= '\0'; p
+= 1)
793 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
798 const struct ada_opname_map
*mapping
;
800 for (mapping
= ada_opname_table
;
801 mapping
->encoded
!= NULL
802 && strncmp (mapping
->decoded
, p
,
803 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
805 if (mapping
->encoded
== NULL
)
806 error (_("invalid Ada operator name: %s"), p
);
807 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
808 k
+= strlen (mapping
->encoded
);
813 encoding_buffer
[k
] = *p
;
818 encoding_buffer
[k
] = '\0';
819 return encoding_buffer
;
822 /* Return NAME folded to lower case, or, if surrounded by single
823 quotes, unfolded, but with the quotes stripped away. Result good
827 ada_fold_name (const char *name
)
829 static char *fold_buffer
= NULL
;
830 static size_t fold_buffer_size
= 0;
832 int len
= strlen (name
);
833 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
837 strncpy (fold_buffer
, name
+ 1, len
- 2);
838 fold_buffer
[len
- 2] = '\000';
843 for (i
= 0; i
<= len
; i
+= 1)
844 fold_buffer
[i
] = tolower (name
[i
]);
850 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
853 is_lower_alphanum (const char c
)
855 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
858 /* Remove either of these suffixes:
863 These are suffixes introduced by the compiler for entities such as
864 nested subprogram for instance, in order to avoid name clashes.
865 They do not serve any purpose for the debugger. */
868 ada_remove_trailing_digits (const char *encoded
, int *len
)
870 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
873 while (i
> 0 && isdigit (encoded
[i
]))
875 if (i
>= 0 && encoded
[i
] == '.')
877 else if (i
>= 0 && encoded
[i
] == '$')
879 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
881 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
886 /* Remove the suffix introduced by the compiler for protected object
890 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
892 /* Remove trailing N. */
894 /* Protected entry subprograms are broken into two
895 separate subprograms: The first one is unprotected, and has
896 a 'N' suffix; the second is the protected version, and has
897 the 'P' suffix. The second calls the first one after handling
898 the protection. Since the P subprograms are internally generated,
899 we leave these names undecoded, giving the user a clue that this
900 entity is internal. */
903 && encoded
[*len
- 1] == 'N'
904 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
908 /* If ENCODED follows the GNAT entity encoding conventions, then return
909 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
912 The resulting string is valid until the next call of ada_decode.
913 If the string is unchanged by decoding, the original string pointer
917 ada_decode (const char *encoded
)
924 static char *decoding_buffer
= NULL
;
925 static size_t decoding_buffer_size
= 0;
927 /* The name of the Ada main procedure starts with "_ada_".
928 This prefix is not part of the decoded name, so skip this part
929 if we see this prefix. */
930 if (strncmp (encoded
, "_ada_", 5) == 0)
933 /* If the name starts with '_', then it is not a properly encoded
934 name, so do not attempt to decode it. Similarly, if the name
935 starts with '<', the name should not be decoded. */
936 if (encoded
[0] == '_' || encoded
[0] == '<')
939 len0
= strlen (encoded
);
941 ada_remove_trailing_digits (encoded
, &len0
);
942 ada_remove_po_subprogram_suffix (encoded
, &len0
);
944 /* Remove the ___X.* suffix if present. Do not forget to verify that
945 the suffix is located before the current "end" of ENCODED. We want
946 to avoid re-matching parts of ENCODED that have previously been
947 marked as discarded (by decrementing LEN0). */
948 p
= strstr (encoded
, "___");
949 if (p
!= NULL
&& p
- encoded
< len0
- 3)
957 /* Remove any trailing TKB suffix. It tells us that this symbol
958 is for the body of a task, but that information does not actually
959 appear in the decoded name. */
961 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
964 /* Remove trailing "B" suffixes. */
965 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
967 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
970 /* Make decoded big enough for possible expansion by operator name. */
972 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
973 decoded
= decoding_buffer
;
975 /* Remove trailing __{digit}+ or trailing ${digit}+. */
977 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
980 while ((i
>= 0 && isdigit (encoded
[i
]))
981 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
983 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
985 else if (encoded
[i
] == '$')
989 /* The first few characters that are not alphabetic are not part
990 of any encoding we use, so we can copy them over verbatim. */
992 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
993 decoded
[j
] = encoded
[i
];
998 /* Is this a symbol function? */
999 if (at_start_name
&& encoded
[i
] == 'O')
1002 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
1004 int op_len
= strlen (ada_opname_table
[k
].encoded
);
1005 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
1007 && !isalnum (encoded
[i
+ op_len
]))
1009 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
1012 j
+= strlen (ada_opname_table
[k
].decoded
);
1016 if (ada_opname_table
[k
].encoded
!= NULL
)
1021 /* Replace "TK__" with "__", which will eventually be translated
1022 into "." (just below). */
1024 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
1027 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
1028 be translated into "." (just below). These are internal names
1029 generated for anonymous blocks inside which our symbol is nested. */
1031 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1032 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1033 && isdigit (encoded
[i
+4]))
1037 while (k
< len0
&& isdigit (encoded
[k
]))
1038 k
++; /* Skip any extra digit. */
1040 /* Double-check that the "__B_{DIGITS}+" sequence we found
1041 is indeed followed by "__". */
1042 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1046 /* Remove _E{DIGITS}+[sb] */
1048 /* Just as for protected object subprograms, there are 2 categories
1049 of subprograms created by the compiler for each entry. The first
1050 one implements the actual entry code, and has a suffix following
1051 the convention above; the second one implements the barrier and
1052 uses the same convention as above, except that the 'E' is replaced
1055 Just as above, we do not decode the name of barrier functions
1056 to give the user a clue that the code he is debugging has been
1057 internally generated. */
1059 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1060 && isdigit (encoded
[i
+2]))
1064 while (k
< len0
&& isdigit (encoded
[k
]))
1068 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1071 /* Just as an extra precaution, make sure that if this
1072 suffix is followed by anything else, it is a '_'.
1073 Otherwise, we matched this sequence by accident. */
1075 || (k
< len0
&& encoded
[k
] == '_'))
1080 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1081 the GNAT front-end in protected object subprograms. */
1084 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1086 /* Backtrack a bit up until we reach either the begining of
1087 the encoded name, or "__". Make sure that we only find
1088 digits or lowercase characters. */
1089 const char *ptr
= encoded
+ i
- 1;
1091 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1094 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1098 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1100 /* This is a X[bn]* sequence not separated from the previous
1101 part of the name with a non-alpha-numeric character (in other
1102 words, immediately following an alpha-numeric character), then
1103 verify that it is placed at the end of the encoded name. If
1104 not, then the encoding is not valid and we should abort the
1105 decoding. Otherwise, just skip it, it is used in body-nested
1109 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1113 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1115 /* Replace '__' by '.'. */
1123 /* It's a character part of the decoded name, so just copy it
1125 decoded
[j
] = encoded
[i
];
1130 decoded
[j
] = '\000';
1132 /* Decoded names should never contain any uppercase character.
1133 Double-check this, and abort the decoding if we find one. */
1135 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1136 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1139 if (strcmp (decoded
, encoded
) == 0)
1145 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1146 decoded
= decoding_buffer
;
1147 if (encoded
[0] == '<')
1148 strcpy (decoded
, encoded
);
1150 sprintf (decoded
, "<%s>", encoded
);
1155 /* Table for keeping permanent unique copies of decoded names. Once
1156 allocated, names in this table are never released. While this is a
1157 storage leak, it should not be significant unless there are massive
1158 changes in the set of decoded names in successive versions of a
1159 symbol table loaded during a single session. */
1160 static struct htab
*decoded_names_store
;
1162 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1163 in the language-specific part of GSYMBOL, if it has not been
1164 previously computed. Tries to save the decoded name in the same
1165 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1166 in any case, the decoded symbol has a lifetime at least that of
1168 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1169 const, but nevertheless modified to a semantically equivalent form
1170 when a decoded name is cached in it.
1174 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1177 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1178 if (*resultp
== NULL
)
1180 const char *decoded
= ada_decode (gsymbol
->name
);
1181 if (gsymbol
->obj_section
!= NULL
)
1183 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1184 *resultp
= obsavestring (decoded
, strlen (decoded
),
1185 &objf
->objfile_obstack
);
1187 /* Sometimes, we can't find a corresponding objfile, in which
1188 case, we put the result on the heap. Since we only decode
1189 when needed, we hope this usually does not cause a
1190 significant memory leak (FIXME). */
1191 if (*resultp
== NULL
)
1193 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1196 *slot
= xstrdup (decoded
);
1205 ada_la_decode (const char *encoded
, int options
)
1207 return xstrdup (ada_decode (encoded
));
1210 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1211 suffixes that encode debugging information or leading _ada_ on
1212 SYM_NAME (see is_name_suffix commentary for the debugging
1213 information that is ignored). If WILD, then NAME need only match a
1214 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1215 either argument is NULL. */
1218 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1220 if (sym_name
== NULL
|| name
== NULL
)
1223 return wild_match (name
, strlen (name
), sym_name
);
1226 int len_name
= strlen (name
);
1227 return (strncmp (sym_name
, name
, len_name
) == 0
1228 && is_name_suffix (sym_name
+ len_name
))
1229 || (strncmp (sym_name
, "_ada_", 5) == 0
1230 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1231 && is_name_suffix (sym_name
+ len_name
+ 5));
1235 /* True (non-zero) iff, in Ada mode, the symbol SYM should be
1236 suppressed in info listings. */
1239 ada_suppress_symbol_printing (struct symbol
*sym
)
1241 if (SYMBOL_DOMAIN (sym
) == STRUCT_DOMAIN
)
1244 return is_suppressed_name (SYMBOL_LINKAGE_NAME (sym
));
1250 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1252 static char *bound_name
[] = {
1253 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1254 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1257 /* Maximum number of array dimensions we are prepared to handle. */
1259 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1261 /* Like modify_field, but allows bitpos > wordlength. */
1264 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1266 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1270 /* The desc_* routines return primitive portions of array descriptors
1273 /* The descriptor or array type, if any, indicated by TYPE; removes
1274 level of indirection, if needed. */
1276 static struct type
*
1277 desc_base_type (struct type
*type
)
1281 type
= ada_check_typedef (type
);
1283 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1284 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1285 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1290 /* True iff TYPE indicates a "thin" array pointer type. */
1293 is_thin_pntr (struct type
*type
)
1296 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1297 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1300 /* The descriptor type for thin pointer type TYPE. */
1302 static struct type
*
1303 thin_descriptor_type (struct type
*type
)
1305 struct type
*base_type
= desc_base_type (type
);
1306 if (base_type
== NULL
)
1308 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1312 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1313 if (alt_type
== NULL
)
1320 /* A pointer to the array data for thin-pointer value VAL. */
1322 static struct value
*
1323 thin_data_pntr (struct value
*val
)
1325 struct type
*type
= value_type (val
);
1326 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1327 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1330 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1331 VALUE_ADDRESS (val
) + value_offset (val
));
1334 /* True iff TYPE indicates a "thick" array pointer type. */
1337 is_thick_pntr (struct type
*type
)
1339 type
= desc_base_type (type
);
1340 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1341 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1344 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1345 pointer to one, the type of its bounds data; otherwise, NULL. */
1347 static struct type
*
1348 desc_bounds_type (struct type
*type
)
1352 type
= desc_base_type (type
);
1356 else if (is_thin_pntr (type
))
1358 type
= thin_descriptor_type (type
);
1361 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1363 return ada_check_typedef (r
);
1365 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1367 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1369 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1374 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1375 one, a pointer to its bounds data. Otherwise NULL. */
1377 static struct value
*
1378 desc_bounds (struct value
*arr
)
1380 struct type
*type
= ada_check_typedef (value_type (arr
));
1381 if (is_thin_pntr (type
))
1383 struct type
*bounds_type
=
1384 desc_bounds_type (thin_descriptor_type (type
));
1387 if (bounds_type
== NULL
)
1388 error (_("Bad GNAT array descriptor"));
1390 /* NOTE: The following calculation is not really kosher, but
1391 since desc_type is an XVE-encoded type (and shouldn't be),
1392 the correct calculation is a real pain. FIXME (and fix GCC). */
1393 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1394 addr
= value_as_long (arr
);
1396 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1399 value_from_longest (lookup_pointer_type (bounds_type
),
1400 addr
- TYPE_LENGTH (bounds_type
));
1403 else if (is_thick_pntr (type
))
1404 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1405 _("Bad GNAT array descriptor"));
1410 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1411 position of the field containing the address of the bounds data. */
1414 fat_pntr_bounds_bitpos (struct type
*type
)
1416 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1419 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1420 size of the field containing the address of the bounds data. */
1423 fat_pntr_bounds_bitsize (struct type
*type
)
1425 type
= desc_base_type (type
);
1427 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1428 return TYPE_FIELD_BITSIZE (type
, 1);
1430 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1433 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1434 pointer to one, the type of its array data (a
1435 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1436 ada_type_of_array to get an array type with bounds data. */
1438 static struct type
*
1439 desc_data_type (struct type
*type
)
1441 type
= desc_base_type (type
);
1443 /* NOTE: The following is bogus; see comment in desc_bounds. */
1444 if (is_thin_pntr (type
))
1445 return lookup_pointer_type
1446 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1447 else if (is_thick_pntr (type
))
1448 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1453 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1456 static struct value
*
1457 desc_data (struct value
*arr
)
1459 struct type
*type
= value_type (arr
);
1460 if (is_thin_pntr (type
))
1461 return thin_data_pntr (arr
);
1462 else if (is_thick_pntr (type
))
1463 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1464 _("Bad GNAT array descriptor"));
1470 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1471 position of the field containing the address of the data. */
1474 fat_pntr_data_bitpos (struct type
*type
)
1476 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1479 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1480 size of the field containing the address of the data. */
1483 fat_pntr_data_bitsize (struct type
*type
)
1485 type
= desc_base_type (type
);
1487 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1488 return TYPE_FIELD_BITSIZE (type
, 0);
1490 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1493 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1494 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1495 bound, if WHICH is 1. The first bound is I=1. */
1497 static struct value
*
1498 desc_one_bound (struct value
*bounds
, int i
, int which
)
1500 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1501 _("Bad GNAT array descriptor bounds"));
1504 /* If BOUNDS is an array-bounds structure type, return the bit position
1505 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1506 bound, if WHICH is 1. The first bound is I=1. */
1509 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1511 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1514 /* If BOUNDS is an array-bounds structure type, return the bit field size
1515 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1516 bound, if WHICH is 1. The first bound is I=1. */
1519 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1521 type
= desc_base_type (type
);
1523 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1524 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1526 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1529 /* If TYPE is the type of an array-bounds structure, the type of its
1530 Ith bound (numbering from 1). Otherwise, NULL. */
1532 static struct type
*
1533 desc_index_type (struct type
*type
, int i
)
1535 type
= desc_base_type (type
);
1537 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1538 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1543 /* The number of index positions in the array-bounds type TYPE.
1544 Return 0 if TYPE is NULL. */
1547 desc_arity (struct type
*type
)
1549 type
= desc_base_type (type
);
1552 return TYPE_NFIELDS (type
) / 2;
1556 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1557 an array descriptor type (representing an unconstrained array
1561 ada_is_direct_array_type (struct type
*type
)
1565 type
= ada_check_typedef (type
);
1566 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1567 || ada_is_array_descriptor_type (type
));
1570 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1574 ada_is_array_type (struct type
*type
)
1577 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1578 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1579 type
= TYPE_TARGET_TYPE (type
);
1580 return ada_is_direct_array_type (type
);
1583 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1586 ada_is_simple_array_type (struct type
*type
)
1590 type
= ada_check_typedef (type
);
1591 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1592 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1593 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1596 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1599 ada_is_array_descriptor_type (struct type
*type
)
1601 struct type
*data_type
= desc_data_type (type
);
1605 type
= ada_check_typedef (type
);
1608 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1609 && TYPE_TARGET_TYPE (data_type
) != NULL
1610 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1611 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1612 && desc_arity (desc_bounds_type (type
)) > 0;
1615 /* Non-zero iff type is a partially mal-formed GNAT array
1616 descriptor. FIXME: This is to compensate for some problems with
1617 debugging output from GNAT. Re-examine periodically to see if it
1621 ada_is_bogus_array_descriptor (struct type
*type
)
1625 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1626 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1627 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1628 && !ada_is_array_descriptor_type (type
);
1632 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1633 (fat pointer) returns the type of the array data described---specifically,
1634 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1635 in from the descriptor; otherwise, they are left unspecified. If
1636 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1637 returns NULL. The result is simply the type of ARR if ARR is not
1640 ada_type_of_array (struct value
*arr
, int bounds
)
1642 if (ada_is_packed_array_type (value_type (arr
)))
1643 return decode_packed_array_type (value_type (arr
));
1645 if (!ada_is_array_descriptor_type (value_type (arr
)))
1646 return value_type (arr
);
1650 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1653 struct type
*elt_type
;
1655 struct value
*descriptor
;
1656 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1658 elt_type
= ada_array_element_type (value_type (arr
), -1);
1659 arity
= ada_array_arity (value_type (arr
));
1661 if (elt_type
== NULL
|| arity
== 0)
1662 return ada_check_typedef (value_type (arr
));
1664 descriptor
= desc_bounds (arr
);
1665 if (value_as_long (descriptor
) == 0)
1669 struct type
*range_type
= alloc_type (objf
);
1670 struct type
*array_type
= alloc_type (objf
);
1671 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1672 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1675 create_range_type (range_type
, value_type (low
),
1676 longest_to_int (value_as_long (low
)),
1677 longest_to_int (value_as_long (high
)));
1678 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1681 return lookup_pointer_type (elt_type
);
1685 /* If ARR does not represent an array, returns ARR unchanged.
1686 Otherwise, returns either a standard GDB array with bounds set
1687 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1688 GDB array. Returns NULL if ARR is a null fat pointer. */
1691 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1693 if (ada_is_array_descriptor_type (value_type (arr
)))
1695 struct type
*arrType
= ada_type_of_array (arr
, 1);
1696 if (arrType
== NULL
)
1698 return value_cast (arrType
, value_copy (desc_data (arr
)));
1700 else if (ada_is_packed_array_type (value_type (arr
)))
1701 return decode_packed_array (arr
);
1706 /* If ARR does not represent an array, returns ARR unchanged.
1707 Otherwise, returns a standard GDB array describing ARR (which may
1708 be ARR itself if it already is in the proper form). */
1710 static struct value
*
1711 ada_coerce_to_simple_array (struct value
*arr
)
1713 if (ada_is_array_descriptor_type (value_type (arr
)))
1715 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1717 error (_("Bounds unavailable for null array pointer."));
1718 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1719 return value_ind (arrVal
);
1721 else if (ada_is_packed_array_type (value_type (arr
)))
1722 return decode_packed_array (arr
);
1727 /* If TYPE represents a GNAT array type, return it translated to an
1728 ordinary GDB array type (possibly with BITSIZE fields indicating
1729 packing). For other types, is the identity. */
1732 ada_coerce_to_simple_array_type (struct type
*type
)
1734 struct value
*mark
= value_mark ();
1735 struct value
*dummy
= value_from_longest (builtin_type_int32
, 0);
1736 struct type
*result
;
1737 deprecated_set_value_type (dummy
, type
);
1738 result
= ada_type_of_array (dummy
, 0);
1739 value_free_to_mark (mark
);
1743 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1746 ada_is_packed_array_type (struct type
*type
)
1750 type
= desc_base_type (type
);
1751 type
= ada_check_typedef (type
);
1753 ada_type_name (type
) != NULL
1754 && strstr (ada_type_name (type
), "___XP") != NULL
;
1757 /* Given that TYPE is a standard GDB array type with all bounds filled
1758 in, and that the element size of its ultimate scalar constituents
1759 (that is, either its elements, or, if it is an array of arrays, its
1760 elements' elements, etc.) is *ELT_BITS, return an identical type,
1761 but with the bit sizes of its elements (and those of any
1762 constituent arrays) recorded in the BITSIZE components of its
1763 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1766 static struct type
*
1767 packed_array_type (struct type
*type
, long *elt_bits
)
1769 struct type
*new_elt_type
;
1770 struct type
*new_type
;
1771 LONGEST low_bound
, high_bound
;
1773 type
= ada_check_typedef (type
);
1774 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1777 new_type
= alloc_type (TYPE_OBJFILE (type
));
1778 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1780 create_array_type (new_type
, new_elt_type
, TYPE_FIELD_TYPE (type
, 0));
1781 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1782 TYPE_NAME (new_type
) = ada_type_name (type
);
1784 if (get_discrete_bounds (TYPE_FIELD_TYPE (type
, 0),
1785 &low_bound
, &high_bound
) < 0)
1786 low_bound
= high_bound
= 0;
1787 if (high_bound
< low_bound
)
1788 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1791 *elt_bits
*= (high_bound
- low_bound
+ 1);
1792 TYPE_LENGTH (new_type
) =
1793 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1796 TYPE_FIXED_INSTANCE (new_type
) = 1;
1800 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1802 static struct type
*
1803 decode_packed_array_type (struct type
*type
)
1806 struct block
**blocks
;
1807 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1810 struct type
*shadow_type
;
1815 raw_name
= ada_type_name (desc_base_type (type
));
1820 name
= (char *) alloca (strlen (raw_name
) + 1);
1821 tail
= strstr (raw_name
, "___XP");
1822 type
= desc_base_type (type
);
1824 memcpy (name
, raw_name
, tail
- raw_name
);
1825 name
[tail
- raw_name
] = '\000';
1827 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1828 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1830 lim_warning (_("could not find bounds information on packed array"));
1833 shadow_type
= SYMBOL_TYPE (sym
);
1835 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1837 lim_warning (_("could not understand bounds information on packed array"));
1841 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1844 (_("could not understand bit size information on packed array"));
1848 return packed_array_type (shadow_type
, &bits
);
1851 /* Given that ARR is a struct value *indicating a GNAT packed array,
1852 returns a simple array that denotes that array. Its type is a
1853 standard GDB array type except that the BITSIZEs of the array
1854 target types are set to the number of bits in each element, and the
1855 type length is set appropriately. */
1857 static struct value
*
1858 decode_packed_array (struct value
*arr
)
1862 arr
= ada_coerce_ref (arr
);
1863 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1864 arr
= ada_value_ind (arr
);
1866 type
= decode_packed_array_type (value_type (arr
));
1869 error (_("can't unpack array"));
1873 if (gdbarch_bits_big_endian (current_gdbarch
)
1874 && ada_is_modular_type (value_type (arr
)))
1876 /* This is a (right-justified) modular type representing a packed
1877 array with no wrapper. In order to interpret the value through
1878 the (left-justified) packed array type we just built, we must
1879 first left-justify it. */
1880 int bit_size
, bit_pos
;
1883 mod
= ada_modulus (value_type (arr
)) - 1;
1890 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1891 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1892 bit_pos
/ HOST_CHAR_BIT
,
1893 bit_pos
% HOST_CHAR_BIT
,
1898 return coerce_unspec_val_to_type (arr
, type
);
1902 /* The value of the element of packed array ARR at the ARITY indices
1903 given in IND. ARR must be a simple array. */
1905 static struct value
*
1906 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1909 int bits
, elt_off
, bit_off
;
1910 long elt_total_bit_offset
;
1911 struct type
*elt_type
;
1915 elt_total_bit_offset
= 0;
1916 elt_type
= ada_check_typedef (value_type (arr
));
1917 for (i
= 0; i
< arity
; i
+= 1)
1919 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1920 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1922 (_("attempt to do packed indexing of something other than a packed array"));
1925 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1926 LONGEST lowerbound
, upperbound
;
1929 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1931 lim_warning (_("don't know bounds of array"));
1932 lowerbound
= upperbound
= 0;
1935 idx
= pos_atr (ind
[i
]);
1936 if (idx
< lowerbound
|| idx
> upperbound
)
1937 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1938 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1939 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1940 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1943 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1944 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1946 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1951 /* Non-zero iff TYPE includes negative integer values. */
1954 has_negatives (struct type
*type
)
1956 switch (TYPE_CODE (type
))
1961 return !TYPE_UNSIGNED (type
);
1962 case TYPE_CODE_RANGE
:
1963 return TYPE_LOW_BOUND (type
) < 0;
1968 /* Create a new value of type TYPE from the contents of OBJ starting
1969 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1970 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1971 assigning through the result will set the field fetched from.
1972 VALADDR is ignored unless OBJ is NULL, in which case,
1973 VALADDR+OFFSET must address the start of storage containing the
1974 packed value. The value returned in this case is never an lval.
1975 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1978 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1979 long offset
, int bit_offset
, int bit_size
,
1983 int src
, /* Index into the source area */
1984 targ
, /* Index into the target area */
1985 srcBitsLeft
, /* Number of source bits left to move */
1986 nsrc
, ntarg
, /* Number of source and target bytes */
1987 unusedLS
, /* Number of bits in next significant
1988 byte of source that are unused */
1989 accumSize
; /* Number of meaningful bits in accum */
1990 unsigned char *bytes
; /* First byte containing data to unpack */
1991 unsigned char *unpacked
;
1992 unsigned long accum
; /* Staging area for bits being transferred */
1994 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1995 /* Transmit bytes from least to most significant; delta is the direction
1996 the indices move. */
1997 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
1999 type
= ada_check_typedef (type
);
2003 v
= allocate_value (type
);
2004 bytes
= (unsigned char *) (valaddr
+ offset
);
2006 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
2009 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
2010 bytes
= (unsigned char *) alloca (len
);
2011 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
2015 v
= allocate_value (type
);
2016 bytes
= (unsigned char *) value_contents (obj
) + offset
;
2021 VALUE_LVAL (v
) = VALUE_LVAL (obj
);
2022 if (VALUE_LVAL (obj
) == lval_internalvar
)
2023 VALUE_LVAL (v
) = lval_internalvar_component
;
2024 VALUE_ADDRESS (v
) = VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
;
2025 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
2026 set_value_bitsize (v
, bit_size
);
2027 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
2029 VALUE_ADDRESS (v
) += 1;
2030 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
2034 set_value_bitsize (v
, bit_size
);
2035 unpacked
= (unsigned char *) value_contents (v
);
2037 srcBitsLeft
= bit_size
;
2039 ntarg
= TYPE_LENGTH (type
);
2043 memset (unpacked
, 0, TYPE_LENGTH (type
));
2046 else if (gdbarch_bits_big_endian (current_gdbarch
))
2049 if (has_negatives (type
)
2050 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2054 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2057 switch (TYPE_CODE (type
))
2059 case TYPE_CODE_ARRAY
:
2060 case TYPE_CODE_UNION
:
2061 case TYPE_CODE_STRUCT
:
2062 /* Non-scalar values must be aligned at a byte boundary... */
2064 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2065 /* ... And are placed at the beginning (most-significant) bytes
2067 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2071 targ
= TYPE_LENGTH (type
) - 1;
2077 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2080 unusedLS
= bit_offset
;
2083 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2090 /* Mask for removing bits of the next source byte that are not
2091 part of the value. */
2092 unsigned int unusedMSMask
=
2093 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2095 /* Sign-extend bits for this byte. */
2096 unsigned int signMask
= sign
& ~unusedMSMask
;
2098 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2099 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2100 if (accumSize
>= HOST_CHAR_BIT
)
2102 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2103 accumSize
-= HOST_CHAR_BIT
;
2104 accum
>>= HOST_CHAR_BIT
;
2108 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2115 accum
|= sign
<< accumSize
;
2116 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2117 accumSize
-= HOST_CHAR_BIT
;
2118 accum
>>= HOST_CHAR_BIT
;
2126 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2127 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2130 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2131 int src_offset
, int n
)
2133 unsigned int accum
, mask
;
2134 int accum_bits
, chunk_size
;
2136 target
+= targ_offset
/ HOST_CHAR_BIT
;
2137 targ_offset
%= HOST_CHAR_BIT
;
2138 source
+= src_offset
/ HOST_CHAR_BIT
;
2139 src_offset
%= HOST_CHAR_BIT
;
2140 if (gdbarch_bits_big_endian (current_gdbarch
))
2142 accum
= (unsigned char) *source
;
2144 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2149 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2150 accum_bits
+= HOST_CHAR_BIT
;
2152 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2155 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2156 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2159 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2161 accum_bits
-= chunk_size
;
2168 accum
= (unsigned char) *source
>> src_offset
;
2170 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2174 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2175 accum_bits
+= HOST_CHAR_BIT
;
2177 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2180 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2181 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2183 accum_bits
-= chunk_size
;
2184 accum
>>= chunk_size
;
2191 /* Store the contents of FROMVAL into the location of TOVAL.
2192 Return a new value with the location of TOVAL and contents of
2193 FROMVAL. Handles assignment into packed fields that have
2194 floating-point or non-scalar types. */
2196 static struct value
*
2197 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2199 struct type
*type
= value_type (toval
);
2200 int bits
= value_bitsize (toval
);
2202 toval
= ada_coerce_ref (toval
);
2203 fromval
= ada_coerce_ref (fromval
);
2205 if (ada_is_direct_array_type (value_type (toval
)))
2206 toval
= ada_coerce_to_simple_array (toval
);
2207 if (ada_is_direct_array_type (value_type (fromval
)))
2208 fromval
= ada_coerce_to_simple_array (fromval
);
2210 if (!deprecated_value_modifiable (toval
))
2211 error (_("Left operand of assignment is not a modifiable lvalue."));
2213 if (VALUE_LVAL (toval
) == lval_memory
2215 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2216 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2218 int len
= (value_bitpos (toval
)
2219 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2221 char *buffer
= (char *) alloca (len
);
2223 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2225 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2226 fromval
= value_cast (type
, fromval
);
2228 read_memory (to_addr
, buffer
, len
);
2229 from_size
= value_bitsize (fromval
);
2231 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2232 if (gdbarch_bits_big_endian (current_gdbarch
))
2233 move_bits (buffer
, value_bitpos (toval
),
2234 value_contents (fromval
), from_size
- bits
, bits
);
2236 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2238 write_memory (to_addr
, buffer
, len
);
2239 if (deprecated_memory_changed_hook
)
2240 deprecated_memory_changed_hook (to_addr
, len
);
2242 val
= value_copy (toval
);
2243 memcpy (value_contents_raw (val
), value_contents (fromval
),
2244 TYPE_LENGTH (type
));
2245 deprecated_set_value_type (val
, type
);
2250 return value_assign (toval
, fromval
);
2254 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2255 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2256 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2257 * COMPONENT, and not the inferior's memory. The current contents
2258 * of COMPONENT are ignored. */
2260 value_assign_to_component (struct value
*container
, struct value
*component
,
2263 LONGEST offset_in_container
=
2264 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2265 - VALUE_ADDRESS (container
) - value_offset (container
));
2266 int bit_offset_in_container
=
2267 value_bitpos (component
) - value_bitpos (container
);
2270 val
= value_cast (value_type (component
), val
);
2272 if (value_bitsize (component
) == 0)
2273 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2275 bits
= value_bitsize (component
);
2277 if (gdbarch_bits_big_endian (current_gdbarch
))
2278 move_bits (value_contents_writeable (container
) + offset_in_container
,
2279 value_bitpos (container
) + bit_offset_in_container
,
2280 value_contents (val
),
2281 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2284 move_bits (value_contents_writeable (container
) + offset_in_container
,
2285 value_bitpos (container
) + bit_offset_in_container
,
2286 value_contents (val
), 0, bits
);
2289 /* The value of the element of array ARR at the ARITY indices given in IND.
2290 ARR may be either a simple array, GNAT array descriptor, or pointer
2294 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2298 struct type
*elt_type
;
2300 elt
= ada_coerce_to_simple_array (arr
);
2302 elt_type
= ada_check_typedef (value_type (elt
));
2303 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2304 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2305 return value_subscript_packed (elt
, arity
, ind
);
2307 for (k
= 0; k
< arity
; k
+= 1)
2309 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2310 error (_("too many subscripts (%d expected)"), k
);
2311 elt
= value_subscript (elt
, value_pos_atr (builtin_type_int32
, ind
[k
]));
2316 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2317 value of the element of *ARR at the ARITY indices given in
2318 IND. Does not read the entire array into memory. */
2321 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2326 for (k
= 0; k
< arity
; k
+= 1)
2331 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2332 error (_("too many subscripts (%d expected)"), k
);
2333 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2335 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2336 idx
= value_pos_atr (builtin_type_int32
, ind
[k
]);
2338 idx
= value_binop (idx
, value_from_longest (value_type (idx
), lwb
),
2341 arr
= value_ptradd (arr
, idx
);
2342 type
= TYPE_TARGET_TYPE (type
);
2345 return value_ind (arr
);
2348 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2349 actual type of ARRAY_PTR is ignored), returns a reference to
2350 the Ada slice of HIGH-LOW+1 elements starting at index LOW. The lower
2351 bound of this array is LOW, as per Ada rules. */
2352 static struct value
*
2353 ada_value_slice_ptr (struct value
*array_ptr
, struct type
*type
,
2356 CORE_ADDR base
= value_as_address (array_ptr
)
2357 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2358 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2359 struct type
*index_type
=
2360 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2362 struct type
*slice_type
=
2363 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2364 return value_from_pointer (lookup_reference_type (slice_type
), base
);
2368 static struct value
*
2369 ada_value_slice (struct value
*array
, int low
, int high
)
2371 struct type
*type
= value_type (array
);
2372 struct type
*index_type
=
2373 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2374 struct type
*slice_type
=
2375 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2376 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2379 /* If type is a record type in the form of a standard GNAT array
2380 descriptor, returns the number of dimensions for type. If arr is a
2381 simple array, returns the number of "array of"s that prefix its
2382 type designation. Otherwise, returns 0. */
2385 ada_array_arity (struct type
*type
)
2392 type
= desc_base_type (type
);
2395 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2396 return desc_arity (desc_bounds_type (type
));
2398 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2401 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2407 /* If TYPE is a record type in the form of a standard GNAT array
2408 descriptor or a simple array type, returns the element type for
2409 TYPE after indexing by NINDICES indices, or by all indices if
2410 NINDICES is -1. Otherwise, returns NULL. */
2413 ada_array_element_type (struct type
*type
, int nindices
)
2415 type
= desc_base_type (type
);
2417 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2420 struct type
*p_array_type
;
2422 p_array_type
= desc_data_type (type
);
2424 k
= ada_array_arity (type
);
2428 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2429 if (nindices
>= 0 && k
> nindices
)
2431 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2432 while (k
> 0 && p_array_type
!= NULL
)
2434 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2437 return p_array_type
;
2439 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2441 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2443 type
= TYPE_TARGET_TYPE (type
);
2452 /* The type of nth index in arrays of given type (n numbering from 1).
2453 Does not examine memory. */
2456 ada_index_type (struct type
*type
, int n
)
2458 struct type
*result_type
;
2460 type
= desc_base_type (type
);
2462 if (n
> ada_array_arity (type
))
2465 if (ada_is_simple_array_type (type
))
2469 for (i
= 1; i
< n
; i
+= 1)
2470 type
= TYPE_TARGET_TYPE (type
);
2471 result_type
= TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, 0));
2472 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2473 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2474 perhaps stabsread.c would make more sense. */
2475 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2476 result_type
= builtin_type_int32
;
2481 return desc_index_type (desc_bounds_type (type
), n
);
2484 /* Given that arr is an array type, returns the lower bound of the
2485 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2486 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2487 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2488 bounds type. It works for other arrays with bounds supplied by
2489 run-time quantities other than discriminants. */
2492 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2493 struct type
** typep
)
2496 struct type
*index_type_desc
;
2498 if (ada_is_packed_array_type (arr_type
))
2499 arr_type
= decode_packed_array_type (arr_type
);
2501 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2504 *typep
= builtin_type_int32
;
2505 return (LONGEST
) - which
;
2508 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2509 type
= TYPE_TARGET_TYPE (arr_type
);
2513 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2514 if (index_type_desc
== NULL
)
2516 struct type
*index_type
;
2520 type
= TYPE_TARGET_TYPE (type
);
2524 index_type
= TYPE_INDEX_TYPE (type
);
2526 *typep
= index_type
;
2528 /* The index type is either a range type or an enumerated type.
2529 For the range type, we have some macros that allow us to
2530 extract the value of the low and high bounds. But they
2531 do now work for enumerated types. The expressions used
2532 below work for both range and enum types. */
2534 (LONGEST
) (which
== 0
2535 ? TYPE_FIELD_BITPOS (index_type
, 0)
2536 : TYPE_FIELD_BITPOS (index_type
,
2537 TYPE_NFIELDS (index_type
) - 1));
2541 struct type
*index_type
=
2542 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2543 NULL
, TYPE_OBJFILE (arr_type
));
2546 *typep
= index_type
;
2549 (LONGEST
) (which
== 0
2550 ? TYPE_LOW_BOUND (index_type
)
2551 : TYPE_HIGH_BOUND (index_type
));
2555 /* Given that arr is an array value, returns the lower bound of the
2556 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2557 WHICH is 1. This routine will also work for arrays with bounds
2558 supplied by run-time quantities other than discriminants. */
2561 ada_array_bound (struct value
*arr
, int n
, int which
)
2563 struct type
*arr_type
= value_type (arr
);
2565 if (ada_is_packed_array_type (arr_type
))
2566 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2567 else if (ada_is_simple_array_type (arr_type
))
2570 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2571 return value_from_longest (type
, v
);
2574 return desc_one_bound (desc_bounds (arr
), n
, which
);
2577 /* Given that arr is an array value, returns the length of the
2578 nth index. This routine will also work for arrays with bounds
2579 supplied by run-time quantities other than discriminants.
2580 Does not work for arrays indexed by enumeration types with representation
2581 clauses at the moment. */
2584 ada_array_length (struct value
*arr
, int n
)
2586 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2588 if (ada_is_packed_array_type (arr_type
))
2589 return ada_array_length (decode_packed_array (arr
), n
);
2591 if (ada_is_simple_array_type (arr_type
))
2595 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2596 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2597 return value_from_longest (type
, v
);
2601 value_from_longest (builtin_type_int32
,
2602 value_as_long (desc_one_bound (desc_bounds (arr
),
2604 - value_as_long (desc_one_bound (desc_bounds (arr
),
2608 /* An empty array whose type is that of ARR_TYPE (an array type),
2609 with bounds LOW to LOW-1. */
2611 static struct value
*
2612 empty_array (struct type
*arr_type
, int low
)
2614 struct type
*index_type
=
2615 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2617 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2618 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2622 /* Name resolution */
2624 /* The "decoded" name for the user-definable Ada operator corresponding
2628 ada_decoded_op_name (enum exp_opcode op
)
2632 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2634 if (ada_opname_table
[i
].op
== op
)
2635 return ada_opname_table
[i
].decoded
;
2637 error (_("Could not find operator name for opcode"));
2641 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2642 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2643 undefined namespace) and converts operators that are
2644 user-defined into appropriate function calls. If CONTEXT_TYPE is
2645 non-null, it provides a preferred result type [at the moment, only
2646 type void has any effect---causing procedures to be preferred over
2647 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2648 return type is preferred. May change (expand) *EXP. */
2651 resolve (struct expression
**expp
, int void_context_p
)
2655 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2658 /* Resolve the operator of the subexpression beginning at
2659 position *POS of *EXPP. "Resolving" consists of replacing
2660 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2661 with their resolutions, replacing built-in operators with
2662 function calls to user-defined operators, where appropriate, and,
2663 when DEPROCEDURE_P is non-zero, converting function-valued variables
2664 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2665 are as in ada_resolve, above. */
2667 static struct value
*
2668 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2669 struct type
*context_type
)
2673 struct expression
*exp
; /* Convenience: == *expp. */
2674 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2675 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2676 int nargs
; /* Number of operands. */
2683 /* Pass one: resolve operands, saving their types and updating *pos,
2688 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2689 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2694 resolve_subexp (expp
, pos
, 0, NULL
);
2696 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2701 resolve_subexp (expp
, pos
, 0, NULL
);
2706 resolve_subexp (expp
, pos
, 1, exp
->elts
[pc
+ 1].type
);
2709 case OP_ATR_MODULUS
:
2719 case TERNOP_IN_RANGE
:
2720 case BINOP_IN_BOUNDS
:
2726 case OP_DISCRETE_RANGE
:
2728 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2737 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2739 resolve_subexp (expp
, pos
, 1, NULL
);
2741 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2758 case BINOP_LOGICAL_AND
:
2759 case BINOP_LOGICAL_OR
:
2760 case BINOP_BITWISE_AND
:
2761 case BINOP_BITWISE_IOR
:
2762 case BINOP_BITWISE_XOR
:
2765 case BINOP_NOTEQUAL
:
2772 case BINOP_SUBSCRIPT
:
2780 case UNOP_LOGICAL_NOT
:
2796 case OP_INTERNALVAR
:
2806 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2809 case STRUCTOP_STRUCT
:
2810 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2823 error (_("Unexpected operator during name resolution"));
2826 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2827 for (i
= 0; i
< nargs
; i
+= 1)
2828 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2832 /* Pass two: perform any resolution on principal operator. */
2839 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2841 struct ada_symbol_info
*candidates
;
2845 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2846 (exp
->elts
[pc
+ 2].symbol
),
2847 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2850 if (n_candidates
> 1)
2852 /* Types tend to get re-introduced locally, so if there
2853 are any local symbols that are not types, first filter
2856 for (j
= 0; j
< n_candidates
; j
+= 1)
2857 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2862 case LOC_REGPARM_ADDR
:
2870 if (j
< n_candidates
)
2873 while (j
< n_candidates
)
2875 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2877 candidates
[j
] = candidates
[n_candidates
- 1];
2886 if (n_candidates
== 0)
2887 error (_("No definition found for %s"),
2888 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2889 else if (n_candidates
== 1)
2891 else if (deprocedure_p
2892 && !is_nonfunction (candidates
, n_candidates
))
2894 i
= ada_resolve_function
2895 (candidates
, n_candidates
, NULL
, 0,
2896 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2899 error (_("Could not find a match for %s"),
2900 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2904 printf_filtered (_("Multiple matches for %s\n"),
2905 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2906 user_select_syms (candidates
, n_candidates
, 1);
2910 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2911 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2912 if (innermost_block
== NULL
2913 || contained_in (candidates
[i
].block
, innermost_block
))
2914 innermost_block
= candidates
[i
].block
;
2918 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2921 replace_operator_with_call (expp
, pc
, 0, 0,
2922 exp
->elts
[pc
+ 2].symbol
,
2923 exp
->elts
[pc
+ 1].block
);
2930 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2931 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2933 struct ada_symbol_info
*candidates
;
2937 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2938 (exp
->elts
[pc
+ 5].symbol
),
2939 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2941 if (n_candidates
== 1)
2945 i
= ada_resolve_function
2946 (candidates
, n_candidates
,
2948 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2951 error (_("Could not find a match for %s"),
2952 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2955 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2956 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2957 if (innermost_block
== NULL
2958 || contained_in (candidates
[i
].block
, innermost_block
))
2959 innermost_block
= candidates
[i
].block
;
2970 case BINOP_BITWISE_AND
:
2971 case BINOP_BITWISE_IOR
:
2972 case BINOP_BITWISE_XOR
:
2974 case BINOP_NOTEQUAL
:
2982 case UNOP_LOGICAL_NOT
:
2984 if (possible_user_operator_p (op
, argvec
))
2986 struct ada_symbol_info
*candidates
;
2990 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2991 (struct block
*) NULL
, VAR_DOMAIN
,
2993 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2994 ada_decoded_op_name (op
), NULL
);
2998 replace_operator_with_call (expp
, pc
, nargs
, 1,
2999 candidates
[i
].sym
, candidates
[i
].block
);
3010 return evaluate_subexp_type (exp
, pos
);
3013 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
3014 MAY_DEREF is non-zero, the formal may be a pointer and the actual
3015 a non-pointer. A type of 'void' (which is never a valid expression type)
3016 by convention matches anything. */
3017 /* The term "match" here is rather loose. The match is heuristic and
3018 liberal. FIXME: TOO liberal, in fact. */
3021 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
3023 ftype
= ada_check_typedef (ftype
);
3024 atype
= ada_check_typedef (atype
);
3026 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
3027 ftype
= TYPE_TARGET_TYPE (ftype
);
3028 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
3029 atype
= TYPE_TARGET_TYPE (atype
);
3031 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
3032 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
3035 switch (TYPE_CODE (ftype
))
3040 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3041 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3042 TYPE_TARGET_TYPE (atype
), 0);
3045 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3047 case TYPE_CODE_ENUM
:
3048 case TYPE_CODE_RANGE
:
3049 switch (TYPE_CODE (atype
))
3052 case TYPE_CODE_ENUM
:
3053 case TYPE_CODE_RANGE
:
3059 case TYPE_CODE_ARRAY
:
3060 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3061 || ada_is_array_descriptor_type (atype
));
3063 case TYPE_CODE_STRUCT
:
3064 if (ada_is_array_descriptor_type (ftype
))
3065 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3066 || ada_is_array_descriptor_type (atype
));
3068 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3069 && !ada_is_array_descriptor_type (atype
));
3071 case TYPE_CODE_UNION
:
3073 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3077 /* Return non-zero if the formals of FUNC "sufficiently match" the
3078 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3079 may also be an enumeral, in which case it is treated as a 0-
3080 argument function. */
3083 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3086 struct type
*func_type
= SYMBOL_TYPE (func
);
3088 if (SYMBOL_CLASS (func
) == LOC_CONST
3089 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3090 return (n_actuals
== 0);
3091 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3094 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3097 for (i
= 0; i
< n_actuals
; i
+= 1)
3099 if (actuals
[i
] == NULL
)
3103 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3104 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3106 if (!ada_type_match (ftype
, atype
, 1))
3113 /* False iff function type FUNC_TYPE definitely does not produce a value
3114 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3115 FUNC_TYPE is not a valid function type with a non-null return type
3116 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3119 return_match (struct type
*func_type
, struct type
*context_type
)
3121 struct type
*return_type
;
3123 if (func_type
== NULL
)
3126 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3127 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3129 return_type
= base_type (func_type
);
3130 if (return_type
== NULL
)
3133 context_type
= base_type (context_type
);
3135 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3136 return context_type
== NULL
|| return_type
== context_type
;
3137 else if (context_type
== NULL
)
3138 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3140 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3144 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3145 function (if any) that matches the types of the NARGS arguments in
3146 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3147 that returns that type, then eliminate matches that don't. If
3148 CONTEXT_TYPE is void and there is at least one match that does not
3149 return void, eliminate all matches that do.
3151 Asks the user if there is more than one match remaining. Returns -1
3152 if there is no such symbol or none is selected. NAME is used
3153 solely for messages. May re-arrange and modify SYMS in
3154 the process; the index returned is for the modified vector. */
3157 ada_resolve_function (struct ada_symbol_info syms
[],
3158 int nsyms
, struct value
**args
, int nargs
,
3159 const char *name
, struct type
*context_type
)
3162 int m
; /* Number of hits */
3163 struct type
*fallback
;
3164 struct type
*return_type
;
3166 return_type
= context_type
;
3167 if (context_type
== NULL
)
3168 fallback
= builtin_type_void
;
3175 for (k
= 0; k
< nsyms
; k
+= 1)
3177 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3179 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3180 && return_match (type
, return_type
))
3186 if (m
> 0 || return_type
== fallback
)
3189 return_type
= fallback
;
3196 printf_filtered (_("Multiple matches for %s\n"), name
);
3197 user_select_syms (syms
, m
, 1);
3203 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3204 in a listing of choices during disambiguation (see sort_choices, below).
3205 The idea is that overloadings of a subprogram name from the
3206 same package should sort in their source order. We settle for ordering
3207 such symbols by their trailing number (__N or $N). */
3210 encoded_ordered_before (char *N0
, char *N1
)
3214 else if (N0
== NULL
)
3219 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3221 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3223 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3224 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3228 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3231 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3233 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3234 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3236 return (strcmp (N0
, N1
) < 0);
3240 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3244 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3247 for (i
= 1; i
< nsyms
; i
+= 1)
3249 struct ada_symbol_info sym
= syms
[i
];
3252 for (j
= i
- 1; j
>= 0; j
-= 1)
3254 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3255 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3257 syms
[j
+ 1] = syms
[j
];
3263 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3264 by asking the user (if necessary), returning the number selected,
3265 and setting the first elements of SYMS items. Error if no symbols
3268 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3269 to be re-integrated one of these days. */
3272 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3275 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3277 int first_choice
= (max_results
== 1) ? 1 : 2;
3278 const char *select_mode
= multiple_symbols_select_mode ();
3280 if (max_results
< 1)
3281 error (_("Request to select 0 symbols!"));
3285 if (select_mode
== multiple_symbols_cancel
)
3287 canceled because the command is ambiguous\n\
3288 See set/show multiple-symbol."));
3290 /* If select_mode is "all", then return all possible symbols.
3291 Only do that if more than one symbol can be selected, of course.
3292 Otherwise, display the menu as usual. */
3293 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3296 printf_unfiltered (_("[0] cancel\n"));
3297 if (max_results
> 1)
3298 printf_unfiltered (_("[1] all\n"));
3300 sort_choices (syms
, nsyms
);
3302 for (i
= 0; i
< nsyms
; i
+= 1)
3304 if (syms
[i
].sym
== NULL
)
3307 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3309 struct symtab_and_line sal
=
3310 find_function_start_sal (syms
[i
].sym
, 1);
3311 if (sal
.symtab
== NULL
)
3312 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3314 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3317 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3318 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3319 sal
.symtab
->filename
, sal
.line
);
3325 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3326 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3327 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3328 struct symtab
*symtab
= symtab_for_sym (syms
[i
].sym
);
3330 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3331 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3333 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3334 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3335 else if (is_enumeral
3336 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3338 printf_unfiltered (("[%d] "), i
+ first_choice
);
3339 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3341 printf_unfiltered (_("'(%s) (enumeral)\n"),
3342 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3344 else if (symtab
!= NULL
)
3345 printf_unfiltered (is_enumeral
3346 ? _("[%d] %s in %s (enumeral)\n")
3347 : _("[%d] %s at %s:?\n"),
3349 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3352 printf_unfiltered (is_enumeral
3353 ? _("[%d] %s (enumeral)\n")
3354 : _("[%d] %s at ?\n"),
3356 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3360 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3363 for (i
= 0; i
< n_chosen
; i
+= 1)
3364 syms
[i
] = syms
[chosen
[i
]];
3369 /* Read and validate a set of numeric choices from the user in the
3370 range 0 .. N_CHOICES-1. Place the results in increasing
3371 order in CHOICES[0 .. N-1], and return N.
3373 The user types choices as a sequence of numbers on one line
3374 separated by blanks, encoding them as follows:
3376 + A choice of 0 means to cancel the selection, throwing an error.
3377 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3378 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3380 The user is not allowed to choose more than MAX_RESULTS values.
3382 ANNOTATION_SUFFIX, if present, is used to annotate the input
3383 prompts (for use with the -f switch). */
3386 get_selections (int *choices
, int n_choices
, int max_results
,
3387 int is_all_choice
, char *annotation_suffix
)
3392 int first_choice
= is_all_choice
? 2 : 1;
3394 prompt
= getenv ("PS2");
3398 args
= command_line_input (prompt
, 0, annotation_suffix
);
3401 error_no_arg (_("one or more choice numbers"));
3405 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3406 order, as given in args. Choices are validated. */
3412 while (isspace (*args
))
3414 if (*args
== '\0' && n_chosen
== 0)
3415 error_no_arg (_("one or more choice numbers"));
3416 else if (*args
== '\0')
3419 choice
= strtol (args
, &args2
, 10);
3420 if (args
== args2
|| choice
< 0
3421 || choice
> n_choices
+ first_choice
- 1)
3422 error (_("Argument must be choice number"));
3426 error (_("cancelled"));
3428 if (choice
< first_choice
)
3430 n_chosen
= n_choices
;
3431 for (j
= 0; j
< n_choices
; j
+= 1)
3435 choice
-= first_choice
;
3437 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3441 if (j
< 0 || choice
!= choices
[j
])
3444 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3445 choices
[k
+ 1] = choices
[k
];
3446 choices
[j
+ 1] = choice
;
3451 if (n_chosen
> max_results
)
3452 error (_("Select no more than %d of the above"), max_results
);
3457 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3458 on the function identified by SYM and BLOCK, and taking NARGS
3459 arguments. Update *EXPP as needed to hold more space. */
3462 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3463 int oplen
, struct symbol
*sym
,
3464 struct block
*block
)
3466 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3467 symbol, -oplen for operator being replaced). */
3468 struct expression
*newexp
= (struct expression
*)
3469 xmalloc (sizeof (struct expression
)
3470 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3471 struct expression
*exp
= *expp
;
3473 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3474 newexp
->language_defn
= exp
->language_defn
;
3475 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3476 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3477 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3479 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3480 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3482 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3483 newexp
->elts
[pc
+ 4].block
= block
;
3484 newexp
->elts
[pc
+ 5].symbol
= sym
;
3490 /* Type-class predicates */
3492 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3496 numeric_type_p (struct type
*type
)
3502 switch (TYPE_CODE (type
))
3507 case TYPE_CODE_RANGE
:
3508 return (type
== TYPE_TARGET_TYPE (type
)
3509 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3516 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3519 integer_type_p (struct type
*type
)
3525 switch (TYPE_CODE (type
))
3529 case TYPE_CODE_RANGE
:
3530 return (type
== TYPE_TARGET_TYPE (type
)
3531 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3538 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3541 scalar_type_p (struct type
*type
)
3547 switch (TYPE_CODE (type
))
3550 case TYPE_CODE_RANGE
:
3551 case TYPE_CODE_ENUM
:
3560 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3563 discrete_type_p (struct type
*type
)
3569 switch (TYPE_CODE (type
))
3572 case TYPE_CODE_RANGE
:
3573 case TYPE_CODE_ENUM
:
3581 /* Returns non-zero if OP with operands in the vector ARGS could be
3582 a user-defined function. Errs on the side of pre-defined operators
3583 (i.e., result 0). */
3586 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3588 struct type
*type0
=
3589 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3590 struct type
*type1
=
3591 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3605 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3609 case BINOP_BITWISE_AND
:
3610 case BINOP_BITWISE_IOR
:
3611 case BINOP_BITWISE_XOR
:
3612 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3615 case BINOP_NOTEQUAL
:
3620 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3623 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3626 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3630 case UNOP_LOGICAL_NOT
:
3632 return (!numeric_type_p (type0
));
3641 1. In the following, we assume that a renaming type's name may
3642 have an ___XD suffix. It would be nice if this went away at some
3644 2. We handle both the (old) purely type-based representation of
3645 renamings and the (new) variable-based encoding. At some point,
3646 it is devoutly to be hoped that the former goes away
3647 (FIXME: hilfinger-2007-07-09).
3648 3. Subprogram renamings are not implemented, although the XRS
3649 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3651 /* If SYM encodes a renaming,
3653 <renaming> renames <renamed entity>,
3655 sets *LEN to the length of the renamed entity's name,
3656 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3657 the string describing the subcomponent selected from the renamed
3658 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3659 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3660 are undefined). Otherwise, returns a value indicating the category
3661 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3662 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3663 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3664 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3665 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3666 may be NULL, in which case they are not assigned.
3668 [Currently, however, GCC does not generate subprogram renamings.] */
3670 enum ada_renaming_category
3671 ada_parse_renaming (struct symbol
*sym
,
3672 const char **renamed_entity
, int *len
,
3673 const char **renaming_expr
)
3675 enum ada_renaming_category kind
;
3680 return ADA_NOT_RENAMING
;
3681 switch (SYMBOL_CLASS (sym
))
3684 return ADA_NOT_RENAMING
;
3686 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3687 renamed_entity
, len
, renaming_expr
);
3691 case LOC_OPTIMIZED_OUT
:
3692 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3694 return ADA_NOT_RENAMING
;
3698 kind
= ADA_OBJECT_RENAMING
;
3702 kind
= ADA_EXCEPTION_RENAMING
;
3706 kind
= ADA_PACKAGE_RENAMING
;
3710 kind
= ADA_SUBPROGRAM_RENAMING
;
3714 return ADA_NOT_RENAMING
;
3718 if (renamed_entity
!= NULL
)
3719 *renamed_entity
= info
;
3720 suffix
= strstr (info
, "___XE");
3721 if (suffix
== NULL
|| suffix
== info
)
3722 return ADA_NOT_RENAMING
;
3724 *len
= strlen (info
) - strlen (suffix
);
3726 if (renaming_expr
!= NULL
)
3727 *renaming_expr
= suffix
;
3731 /* Assuming TYPE encodes a renaming according to the old encoding in
3732 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3733 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3734 ADA_NOT_RENAMING otherwise. */
3735 static enum ada_renaming_category
3736 parse_old_style_renaming (struct type
*type
,
3737 const char **renamed_entity
, int *len
,
3738 const char **renaming_expr
)
3740 enum ada_renaming_category kind
;
3745 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3746 || TYPE_NFIELDS (type
) != 1)
3747 return ADA_NOT_RENAMING
;
3749 name
= type_name_no_tag (type
);
3751 return ADA_NOT_RENAMING
;
3753 name
= strstr (name
, "___XR");
3755 return ADA_NOT_RENAMING
;
3760 kind
= ADA_OBJECT_RENAMING
;
3763 kind
= ADA_EXCEPTION_RENAMING
;
3766 kind
= ADA_PACKAGE_RENAMING
;
3769 kind
= ADA_SUBPROGRAM_RENAMING
;
3772 return ADA_NOT_RENAMING
;
3775 info
= TYPE_FIELD_NAME (type
, 0);
3777 return ADA_NOT_RENAMING
;
3778 if (renamed_entity
!= NULL
)
3779 *renamed_entity
= info
;
3780 suffix
= strstr (info
, "___XE");
3781 if (renaming_expr
!= NULL
)
3782 *renaming_expr
= suffix
+ 5;
3783 if (suffix
== NULL
|| suffix
== info
)
3784 return ADA_NOT_RENAMING
;
3786 *len
= suffix
- info
;
3792 /* Evaluation: Function Calls */
3794 /* Return an lvalue containing the value VAL. This is the identity on
3795 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3796 on the stack, using and updating *SP as the stack pointer, and
3797 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3799 static struct value
*
3800 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3802 if (! VALUE_LVAL (val
))
3804 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3806 /* The following is taken from the structure-return code in
3807 call_function_by_hand. FIXME: Therefore, some refactoring seems
3809 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3811 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3812 reserving sufficient space. */
3814 if (gdbarch_frame_align_p (current_gdbarch
))
3815 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3816 VALUE_ADDRESS (val
) = *sp
;
3820 /* Stack grows upward. Align the frame, allocate space, and
3821 then again, re-align the frame. */
3822 if (gdbarch_frame_align_p (current_gdbarch
))
3823 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3824 VALUE_ADDRESS (val
) = *sp
;
3826 if (gdbarch_frame_align_p (current_gdbarch
))
3827 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3829 VALUE_LVAL (val
) = lval_memory
;
3831 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3837 /* Return the value ACTUAL, converted to be an appropriate value for a
3838 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3839 allocating any necessary descriptors (fat pointers), or copies of
3840 values not residing in memory, updating it as needed. */
3843 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3846 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3847 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3848 struct type
*formal_target
=
3849 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3850 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3851 struct type
*actual_target
=
3852 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3853 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3855 if (ada_is_array_descriptor_type (formal_target
)
3856 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3857 return make_array_descriptor (formal_type
, actual
, sp
);
3858 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3859 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3861 struct value
*result
;
3862 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3863 && ada_is_array_descriptor_type (actual_target
))
3864 result
= desc_data (actual
);
3865 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3867 if (VALUE_LVAL (actual
) != lval_memory
)
3870 actual_type
= ada_check_typedef (value_type (actual
));
3871 val
= allocate_value (actual_type
);
3872 memcpy ((char *) value_contents_raw (val
),
3873 (char *) value_contents (actual
),
3874 TYPE_LENGTH (actual_type
));
3875 actual
= ensure_lval (val
, sp
);
3877 result
= value_addr (actual
);
3881 return value_cast_pointers (formal_type
, result
);
3883 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3884 return ada_value_ind (actual
);
3890 /* Push a descriptor of type TYPE for array value ARR on the stack at
3891 *SP, updating *SP to reflect the new descriptor. Return either
3892 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3893 to-descriptor type rather than a descriptor type), a struct value *
3894 representing a pointer to this descriptor. */
3896 static struct value
*
3897 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3899 struct type
*bounds_type
= desc_bounds_type (type
);
3900 struct type
*desc_type
= desc_base_type (type
);
3901 struct value
*descriptor
= allocate_value (desc_type
);
3902 struct value
*bounds
= allocate_value (bounds_type
);
3905 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3907 modify_general_field (value_contents_writeable (bounds
),
3908 value_as_long (ada_array_bound (arr
, i
, 0)),
3909 desc_bound_bitpos (bounds_type
, i
, 0),
3910 desc_bound_bitsize (bounds_type
, i
, 0));
3911 modify_general_field (value_contents_writeable (bounds
),
3912 value_as_long (ada_array_bound (arr
, i
, 1)),
3913 desc_bound_bitpos (bounds_type
, i
, 1),
3914 desc_bound_bitsize (bounds_type
, i
, 1));
3917 bounds
= ensure_lval (bounds
, sp
);
3919 modify_general_field (value_contents_writeable (descriptor
),
3920 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3921 fat_pntr_data_bitpos (desc_type
),
3922 fat_pntr_data_bitsize (desc_type
));
3924 modify_general_field (value_contents_writeable (descriptor
),
3925 VALUE_ADDRESS (bounds
),
3926 fat_pntr_bounds_bitpos (desc_type
),
3927 fat_pntr_bounds_bitsize (desc_type
));
3929 descriptor
= ensure_lval (descriptor
, sp
);
3931 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3932 return value_addr (descriptor
);
3937 /* Dummy definitions for an experimental caching module that is not
3938 * used in the public sources. */
3941 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3942 struct symbol
**sym
, struct block
**block
)
3948 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3949 struct block
*block
)
3955 /* Return the result of a standard (literal, C-like) lookup of NAME in
3956 given DOMAIN, visible from lexical block BLOCK. */
3958 static struct symbol
*
3959 standard_lookup (const char *name
, const struct block
*block
,
3964 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3966 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3967 cache_symbol (name
, domain
, sym
, block_found
);
3972 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3973 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3974 since they contend in overloading in the same way. */
3976 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3980 for (i
= 0; i
< n
; i
+= 1)
3981 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3982 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3983 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3989 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3990 struct types. Otherwise, they may not. */
3993 equiv_types (struct type
*type0
, struct type
*type1
)
3997 if (type0
== NULL
|| type1
== NULL
3998 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
4000 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
4001 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
4002 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
4003 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
4009 /* True iff SYM0 represents the same entity as SYM1, or one that is
4010 no more defined than that of SYM1. */
4013 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
4017 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
4018 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
4021 switch (SYMBOL_CLASS (sym0
))
4027 struct type
*type0
= SYMBOL_TYPE (sym0
);
4028 struct type
*type1
= SYMBOL_TYPE (sym1
);
4029 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
4030 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
4031 int len0
= strlen (name0
);
4033 TYPE_CODE (type0
) == TYPE_CODE (type1
)
4034 && (equiv_types (type0
, type1
)
4035 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
4036 && strncmp (name1
+ len0
, "___XV", 5) == 0));
4039 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4040 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4046 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4047 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4050 add_defn_to_vec (struct obstack
*obstackp
,
4052 struct block
*block
)
4056 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4058 /* Do not try to complete stub types, as the debugger is probably
4059 already scanning all symbols matching a certain name at the
4060 time when this function is called. Trying to replace the stub
4061 type by its associated full type will cause us to restart a scan
4062 which may lead to an infinite recursion. Instead, the client
4063 collecting the matching symbols will end up collecting several
4064 matches, with at least one of them complete. It can then filter
4065 out the stub ones if needed. */
4067 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4069 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4071 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4073 prevDefns
[i
].sym
= sym
;
4074 prevDefns
[i
].block
= block
;
4080 struct ada_symbol_info info
;
4084 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4088 /* Number of ada_symbol_info structures currently collected in
4089 current vector in *OBSTACKP. */
4092 num_defns_collected (struct obstack
*obstackp
)
4094 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4097 /* Vector of ada_symbol_info structures currently collected in current
4098 vector in *OBSTACKP. If FINISH, close off the vector and return
4099 its final address. */
4101 static struct ada_symbol_info
*
4102 defns_collected (struct obstack
*obstackp
, int finish
)
4105 return obstack_finish (obstackp
);
4107 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4110 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4111 Check the global symbols if GLOBAL, the static symbols if not.
4112 Do wild-card match if WILD. */
4114 static struct partial_symbol
*
4115 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4116 int global
, domain_enum
namespace, int wild
)
4118 struct partial_symbol
**start
;
4119 int name_len
= strlen (name
);
4120 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4129 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4130 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4134 for (i
= 0; i
< length
; i
+= 1)
4136 struct partial_symbol
*psym
= start
[i
];
4138 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4139 SYMBOL_DOMAIN (psym
), namespace)
4140 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4154 int M
= (U
+ i
) >> 1;
4155 struct partial_symbol
*psym
= start
[M
];
4156 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4158 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4160 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4171 struct partial_symbol
*psym
= start
[i
];
4173 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4174 SYMBOL_DOMAIN (psym
), namespace))
4176 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4184 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4198 int M
= (U
+ i
) >> 1;
4199 struct partial_symbol
*psym
= start
[M
];
4200 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4202 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4204 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4215 struct partial_symbol
*psym
= start
[i
];
4217 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4218 SYMBOL_DOMAIN (psym
), namespace))
4222 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4225 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4227 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4237 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4247 /* Find a symbol table containing symbol SYM or NULL if none. */
4249 static struct symtab
*
4250 symtab_for_sym (struct symbol
*sym
)
4253 struct objfile
*objfile
;
4255 struct symbol
*tmp_sym
;
4256 struct dict_iterator iter
;
4259 ALL_PRIMARY_SYMTABS (objfile
, s
)
4261 switch (SYMBOL_CLASS (sym
))
4269 case LOC_CONST_BYTES
:
4270 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
4271 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4273 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
4274 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4280 switch (SYMBOL_CLASS (sym
))
4285 case LOC_REGPARM_ADDR
:
4289 for (j
= FIRST_LOCAL_BLOCK
;
4290 j
< BLOCKVECTOR_NBLOCKS (BLOCKVECTOR (s
)); j
+= 1)
4292 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), j
);
4293 ALL_BLOCK_SYMBOLS (b
, iter
, tmp_sym
) if (sym
== tmp_sym
)
4304 /* Return a minimal symbol matching NAME according to Ada decoding
4305 rules. Returns NULL if there is no such minimal symbol. Names
4306 prefixed with "standard__" are handled specially: "standard__" is
4307 first stripped off, and only static and global symbols are searched. */
4309 struct minimal_symbol
*
4310 ada_lookup_simple_minsym (const char *name
)
4312 struct objfile
*objfile
;
4313 struct minimal_symbol
*msymbol
;
4316 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4318 name
+= sizeof ("standard__") - 1;
4322 wild_match
= (strstr (name
, "__") == NULL
);
4324 ALL_MSYMBOLS (objfile
, msymbol
)
4326 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4327 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4334 /* For all subprograms that statically enclose the subprogram of the
4335 selected frame, add symbols matching identifier NAME in DOMAIN
4336 and their blocks to the list of data in OBSTACKP, as for
4337 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4341 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4342 const char *name
, domain_enum
namespace,
4347 /* True if TYPE is definitely an artificial type supplied to a symbol
4348 for which no debugging information was given in the symbol file. */
4351 is_nondebugging_type (struct type
*type
)
4353 char *name
= ada_type_name (type
);
4354 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4357 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4358 duplicate other symbols in the list (The only case I know of where
4359 this happens is when object files containing stabs-in-ecoff are
4360 linked with files containing ordinary ecoff debugging symbols (or no
4361 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4362 Returns the number of items in the modified list. */
4365 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4374 /* If two symbols have the same name and one of them is a stub type,
4375 the get rid of the stub. */
4377 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4378 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4380 for (j
= 0; j
< nsyms
; j
++)
4383 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4384 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4385 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4386 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4391 /* Two symbols with the same name, same class and same address
4392 should be identical. */
4394 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4395 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4396 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4398 for (j
= 0; j
< nsyms
; j
+= 1)
4401 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4402 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4403 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4404 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4405 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4406 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4413 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4414 syms
[j
- 1] = syms
[j
];
4423 /* Given a type that corresponds to a renaming entity, use the type name
4424 to extract the scope (package name or function name, fully qualified,
4425 and following the GNAT encoding convention) where this renaming has been
4426 defined. The string returned needs to be deallocated after use. */
4429 xget_renaming_scope (struct type
*renaming_type
)
4431 /* The renaming types adhere to the following convention:
4432 <scope>__<rename>___<XR extension>.
4433 So, to extract the scope, we search for the "___XR" extension,
4434 and then backtrack until we find the first "__". */
4436 const char *name
= type_name_no_tag (renaming_type
);
4437 char *suffix
= strstr (name
, "___XR");
4442 /* Now, backtrack a bit until we find the first "__". Start looking
4443 at suffix - 3, as the <rename> part is at least one character long. */
4445 for (last
= suffix
- 3; last
> name
; last
--)
4446 if (last
[0] == '_' && last
[1] == '_')
4449 /* Make a copy of scope and return it. */
4451 scope_len
= last
- name
;
4452 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4454 strncpy (scope
, name
, scope_len
);
4455 scope
[scope_len
] = '\0';
4460 /* Return nonzero if NAME corresponds to a package name. */
4463 is_package_name (const char *name
)
4465 /* Here, We take advantage of the fact that no symbols are generated
4466 for packages, while symbols are generated for each function.
4467 So the condition for NAME represent a package becomes equivalent
4468 to NAME not existing in our list of symbols. There is only one
4469 small complication with library-level functions (see below). */
4473 /* If it is a function that has not been defined at library level,
4474 then we should be able to look it up in the symbols. */
4475 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4478 /* Library-level function names start with "_ada_". See if function
4479 "_ada_" followed by NAME can be found. */
4481 /* Do a quick check that NAME does not contain "__", since library-level
4482 functions names cannot contain "__" in them. */
4483 if (strstr (name
, "__") != NULL
)
4486 fun_name
= xstrprintf ("_ada_%s", name
);
4488 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4491 /* Return nonzero if SYM corresponds to a renaming entity that is
4492 not visible from FUNCTION_NAME. */
4495 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4499 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4502 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4504 make_cleanup (xfree
, scope
);
4506 /* If the rename has been defined in a package, then it is visible. */
4507 if (is_package_name (scope
))
4510 /* Check that the rename is in the current function scope by checking
4511 that its name starts with SCOPE. */
4513 /* If the function name starts with "_ada_", it means that it is
4514 a library-level function. Strip this prefix before doing the
4515 comparison, as the encoding for the renaming does not contain
4517 if (strncmp (function_name
, "_ada_", 5) == 0)
4520 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4523 /* Remove entries from SYMS that corresponds to a renaming entity that
4524 is not visible from the function associated with CURRENT_BLOCK or
4525 that is superfluous due to the presence of more specific renaming
4526 information. Places surviving symbols in the initial entries of
4527 SYMS and returns the number of surviving symbols.
4530 First, in cases where an object renaming is implemented as a
4531 reference variable, GNAT may produce both the actual reference
4532 variable and the renaming encoding. In this case, we discard the
4535 Second, GNAT emits a type following a specified encoding for each renaming
4536 entity. Unfortunately, STABS currently does not support the definition
4537 of types that are local to a given lexical block, so all renamings types
4538 are emitted at library level. As a consequence, if an application
4539 contains two renaming entities using the same name, and a user tries to
4540 print the value of one of these entities, the result of the ada symbol
4541 lookup will also contain the wrong renaming type.
4543 This function partially covers for this limitation by attempting to
4544 remove from the SYMS list renaming symbols that should be visible
4545 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4546 method with the current information available. The implementation
4547 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4549 - When the user tries to print a rename in a function while there
4550 is another rename entity defined in a package: Normally, the
4551 rename in the function has precedence over the rename in the
4552 package, so the latter should be removed from the list. This is
4553 currently not the case.
4555 - This function will incorrectly remove valid renames if
4556 the CURRENT_BLOCK corresponds to a function which symbol name
4557 has been changed by an "Export" pragma. As a consequence,
4558 the user will be unable to print such rename entities. */
4561 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4562 int nsyms
, const struct block
*current_block
)
4564 struct symbol
*current_function
;
4565 char *current_function_name
;
4567 int is_new_style_renaming
;
4569 /* If there is both a renaming foo___XR... encoded as a variable and
4570 a simple variable foo in the same block, discard the latter.
4571 First, zero out such symbols, then compress. */
4572 is_new_style_renaming
= 0;
4573 for (i
= 0; i
< nsyms
; i
+= 1)
4575 struct symbol
*sym
= syms
[i
].sym
;
4576 struct block
*block
= syms
[i
].block
;
4580 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4582 name
= SYMBOL_LINKAGE_NAME (sym
);
4583 suffix
= strstr (name
, "___XR");
4587 int name_len
= suffix
- name
;
4589 is_new_style_renaming
= 1;
4590 for (j
= 0; j
< nsyms
; j
+= 1)
4591 if (i
!= j
&& syms
[j
].sym
!= NULL
4592 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4594 && block
== syms
[j
].block
)
4598 if (is_new_style_renaming
)
4602 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4603 if (syms
[j
].sym
!= NULL
)
4611 /* Extract the function name associated to CURRENT_BLOCK.
4612 Abort if unable to do so. */
4614 if (current_block
== NULL
)
4617 current_function
= block_linkage_function (current_block
);
4618 if (current_function
== NULL
)
4621 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4622 if (current_function_name
== NULL
)
4625 /* Check each of the symbols, and remove it from the list if it is
4626 a type corresponding to a renaming that is out of the scope of
4627 the current block. */
4632 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4633 == ADA_OBJECT_RENAMING
4634 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4637 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4638 syms
[j
- 1] = syms
[j
];
4648 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4649 whose name and domain match NAME and DOMAIN respectively.
4650 If no match was found, then extend the search to "enclosing"
4651 routines (in other words, if we're inside a nested function,
4652 search the symbols defined inside the enclosing functions).
4654 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4657 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4658 struct block
*block
, domain_enum domain
,
4661 int block_depth
= 0;
4663 while (block
!= NULL
)
4666 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4668 /* If we found a non-function match, assume that's the one. */
4669 if (is_nonfunction (defns_collected (obstackp
, 0),
4670 num_defns_collected (obstackp
)))
4673 block
= BLOCK_SUPERBLOCK (block
);
4676 /* If no luck so far, try to find NAME as a local symbol in some lexically
4677 enclosing subprogram. */
4678 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4679 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4682 /* Add to OBSTACKP all non-local symbols whose name and domain match
4683 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4684 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4687 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4688 domain_enum domain
, int global
,
4691 struct objfile
*objfile
;
4692 struct partial_symtab
*ps
;
4694 ALL_PSYMTABS (objfile
, ps
)
4698 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4700 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4701 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4703 if (s
== NULL
|| !s
->primary
)
4705 ada_add_block_symbols (obstackp
,
4706 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4707 name
, domain
, objfile
, wild_match
);
4712 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4713 scope and in global scopes, returning the number of matches. Sets
4714 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4715 indicating the symbols found and the blocks and symbol tables (if
4716 any) in which they were found. This vector are transient---good only to
4717 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4718 symbol match within the nest of blocks whose innermost member is BLOCK0,
4719 is the one match returned (no other matches in that or
4720 enclosing blocks is returned). If there are any matches in or
4721 surrounding BLOCK0, then these alone are returned. Otherwise, the
4722 search extends to global and file-scope (static) symbol tables.
4723 Names prefixed with "standard__" are handled specially: "standard__"
4724 is first stripped off, and only static and global symbols are searched. */
4727 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4728 domain_enum
namespace,
4729 struct ada_symbol_info
**results
)
4732 struct block
*block
;
4738 obstack_free (&symbol_list_obstack
, NULL
);
4739 obstack_init (&symbol_list_obstack
);
4743 /* Search specified block and its superiors. */
4745 wild_match
= (strstr (name0
, "__") == NULL
);
4747 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4748 needed, but adding const will
4749 have a cascade effect. */
4751 /* Special case: If the user specifies a symbol name inside package
4752 Standard, do a non-wild matching of the symbol name without
4753 the "standard__" prefix. This was primarily introduced in order
4754 to allow the user to specifically access the standard exceptions
4755 using, for instance, Standard.Constraint_Error when Constraint_Error
4756 is ambiguous (due to the user defining its own Constraint_Error
4757 entity inside its program). */
4758 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4762 name
= name0
+ sizeof ("standard__") - 1;
4765 /* Check the non-global symbols. If we have ANY match, then we're done. */
4767 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4769 if (num_defns_collected (&symbol_list_obstack
) > 0)
4772 /* No non-global symbols found. Check our cache to see if we have
4773 already performed this search before. If we have, then return
4777 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4780 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4784 /* Search symbols from all global blocks. */
4786 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4789 /* Now add symbols from all per-file blocks if we've gotten no hits
4790 (not strictly correct, but perhaps better than an error). */
4792 if (num_defns_collected (&symbol_list_obstack
) == 0)
4793 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4797 ndefns
= num_defns_collected (&symbol_list_obstack
);
4798 *results
= defns_collected (&symbol_list_obstack
, 1);
4800 ndefns
= remove_extra_symbols (*results
, ndefns
);
4803 cache_symbol (name0
, namespace, NULL
, NULL
);
4805 if (ndefns
== 1 && cacheIfUnique
)
4806 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4808 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4814 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4815 domain_enum
namespace, struct block
**block_found
)
4817 struct ada_symbol_info
*candidates
;
4820 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4822 if (n_candidates
== 0)
4825 if (block_found
!= NULL
)
4826 *block_found
= candidates
[0].block
;
4828 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4831 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4832 scope and in global scopes, or NULL if none. NAME is folded and
4833 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4834 choosing the first symbol if there are multiple choices.
4835 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4836 table in which the symbol was found (in both cases, these
4837 assignments occur only if the pointers are non-null). */
4839 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4840 domain_enum
namespace, int *is_a_field_of_this
)
4842 if (is_a_field_of_this
!= NULL
)
4843 *is_a_field_of_this
= 0;
4846 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4847 block0
, namespace, NULL
);
4850 static struct symbol
*
4851 ada_lookup_symbol_nonlocal (const char *name
,
4852 const char *linkage_name
,
4853 const struct block
*block
,
4854 const domain_enum domain
)
4856 if (linkage_name
== NULL
)
4857 linkage_name
= name
;
4858 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4863 /* True iff STR is a possible encoded suffix of a normal Ada name
4864 that is to be ignored for matching purposes. Suffixes of parallel
4865 names (e.g., XVE) are not included here. Currently, the possible suffixes
4866 are given by any of the regular expressions:
4868 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4869 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4870 _E[0-9]+[bs]$ [protected object entry suffixes]
4871 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4873 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4874 match is performed. This sequence is used to differentiate homonyms,
4875 is an optional part of a valid name suffix. */
4878 is_name_suffix (const char *str
)
4881 const char *matching
;
4882 const int len
= strlen (str
);
4884 /* Skip optional leading __[0-9]+. */
4886 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4889 while (isdigit (str
[0]))
4895 if (str
[0] == '.' || str
[0] == '$')
4898 while (isdigit (matching
[0]))
4900 if (matching
[0] == '\0')
4906 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4909 while (isdigit (matching
[0]))
4911 if (matching
[0] == '\0')
4916 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4917 with a N at the end. Unfortunately, the compiler uses the same
4918 convention for other internal types it creates. So treating
4919 all entity names that end with an "N" as a name suffix causes
4920 some regressions. For instance, consider the case of an enumerated
4921 type. To support the 'Image attribute, it creates an array whose
4923 Having a single character like this as a suffix carrying some
4924 information is a bit risky. Perhaps we should change the encoding
4925 to be something like "_N" instead. In the meantime, do not do
4926 the following check. */
4927 /* Protected Object Subprograms */
4928 if (len
== 1 && str
[0] == 'N')
4933 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4936 while (isdigit (matching
[0]))
4938 if ((matching
[0] == 'b' || matching
[0] == 's')
4939 && matching
[1] == '\0')
4943 /* ??? We should not modify STR directly, as we are doing below. This
4944 is fine in this case, but may become problematic later if we find
4945 that this alternative did not work, and want to try matching
4946 another one from the begining of STR. Since we modified it, we
4947 won't be able to find the begining of the string anymore! */
4951 while (str
[0] != '_' && str
[0] != '\0')
4953 if (str
[0] != 'n' && str
[0] != 'b')
4959 if (str
[0] == '\000')
4964 if (str
[1] != '_' || str
[2] == '\000')
4968 if (strcmp (str
+ 3, "JM") == 0)
4970 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4971 the LJM suffix in favor of the JM one. But we will
4972 still accept LJM as a valid suffix for a reasonable
4973 amount of time, just to allow ourselves to debug programs
4974 compiled using an older version of GNAT. */
4975 if (strcmp (str
+ 3, "LJM") == 0)
4979 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4980 || str
[4] == 'U' || str
[4] == 'P')
4982 if (str
[4] == 'R' && str
[5] != 'T')
4986 if (!isdigit (str
[2]))
4988 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4989 if (!isdigit (str
[k
]) && str
[k
] != '_')
4993 if (str
[0] == '$' && isdigit (str
[1]))
4995 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4996 if (!isdigit (str
[k
]) && str
[k
] != '_')
5003 /* Return non-zero if the string starting at NAME and ending before
5004 NAME_END contains no capital letters. */
5007 is_valid_name_for_wild_match (const char *name0
)
5009 const char *decoded_name
= ada_decode (name0
);
5012 /* If the decoded name starts with an angle bracket, it means that
5013 NAME0 does not follow the GNAT encoding format. It should then
5014 not be allowed as a possible wild match. */
5015 if (decoded_name
[0] == '<')
5018 for (i
=0; decoded_name
[i
] != '\0'; i
++)
5019 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
5025 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
5026 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
5027 informational suffixes of NAME (i.e., for which is_name_suffix is
5031 wild_match (const char *patn0
, int patn_len
, const char *name0
)
5038 match
= strstr (start
, patn0
);
5043 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
5044 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
5045 && is_name_suffix (match
+ patn_len
))
5046 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
5052 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
5053 vector *defn_symbols, updating the list of symbols in OBSTACKP
5054 (if necessary). If WILD, treat as NAME with a wildcard prefix.
5055 OBJFILE is the section containing BLOCK.
5056 SYMTAB is recorded with each symbol added. */
5059 ada_add_block_symbols (struct obstack
*obstackp
,
5060 struct block
*block
, const char *name
,
5061 domain_enum domain
, struct objfile
*objfile
,
5064 struct dict_iterator iter
;
5065 int name_len
= strlen (name
);
5066 /* A matching argument symbol, if any. */
5067 struct symbol
*arg_sym
;
5068 /* Set true when we find a matching non-argument symbol. */
5077 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5079 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5080 SYMBOL_DOMAIN (sym
), domain
)
5081 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
5083 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
5085 else if (SYMBOL_IS_ARGUMENT (sym
))
5090 add_defn_to_vec (obstackp
,
5091 fixup_symbol_section (sym
, objfile
),
5099 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5101 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5102 SYMBOL_DOMAIN (sym
), domain
))
5104 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5106 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5108 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5110 if (SYMBOL_IS_ARGUMENT (sym
))
5115 add_defn_to_vec (obstackp
,
5116 fixup_symbol_section (sym
, objfile
),
5125 if (!found_sym
&& arg_sym
!= NULL
)
5127 add_defn_to_vec (obstackp
,
5128 fixup_symbol_section (arg_sym
, objfile
),
5137 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5139 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5140 SYMBOL_DOMAIN (sym
), domain
))
5144 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5147 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5149 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5154 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5156 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5158 if (SYMBOL_IS_ARGUMENT (sym
))
5163 add_defn_to_vec (obstackp
,
5164 fixup_symbol_section (sym
, objfile
),
5172 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5173 They aren't parameters, right? */
5174 if (!found_sym
&& arg_sym
!= NULL
)
5176 add_defn_to_vec (obstackp
,
5177 fixup_symbol_section (arg_sym
, objfile
),
5184 /* Symbol Completion */
5186 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5187 name in a form that's appropriate for the completion. The result
5188 does not need to be deallocated, but is only good until the next call.
5190 TEXT_LEN is equal to the length of TEXT.
5191 Perform a wild match if WILD_MATCH is set.
5192 ENCODED should be set if TEXT represents the start of a symbol name
5193 in its encoded form. */
5196 symbol_completion_match (const char *sym_name
,
5197 const char *text
, int text_len
,
5198 int wild_match
, int encoded
)
5201 const int verbatim_match
= (text
[0] == '<');
5206 /* Strip the leading angle bracket. */
5211 /* First, test against the fully qualified name of the symbol. */
5213 if (strncmp (sym_name
, text
, text_len
) == 0)
5216 if (match
&& !encoded
)
5218 /* One needed check before declaring a positive match is to verify
5219 that iff we are doing a verbatim match, the decoded version
5220 of the symbol name starts with '<'. Otherwise, this symbol name
5221 is not a suitable completion. */
5222 const char *sym_name_copy
= sym_name
;
5223 int has_angle_bracket
;
5225 sym_name
= ada_decode (sym_name
);
5226 has_angle_bracket
= (sym_name
[0] == '<');
5227 match
= (has_angle_bracket
== verbatim_match
);
5228 sym_name
= sym_name_copy
;
5231 if (match
&& !verbatim_match
)
5233 /* When doing non-verbatim match, another check that needs to
5234 be done is to verify that the potentially matching symbol name
5235 does not include capital letters, because the ada-mode would
5236 not be able to understand these symbol names without the
5237 angle bracket notation. */
5240 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5245 /* Second: Try wild matching... */
5247 if (!match
&& wild_match
)
5249 /* Since we are doing wild matching, this means that TEXT
5250 may represent an unqualified symbol name. We therefore must
5251 also compare TEXT against the unqualified name of the symbol. */
5252 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5254 if (strncmp (sym_name
, text
, text_len
) == 0)
5258 /* Finally: If we found a mach, prepare the result to return. */
5264 sym_name
= add_angle_brackets (sym_name
);
5267 sym_name
= ada_decode (sym_name
);
5272 typedef char *char_ptr
;
5273 DEF_VEC_P (char_ptr
);
5275 /* A companion function to ada_make_symbol_completion_list().
5276 Check if SYM_NAME represents a symbol which name would be suitable
5277 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5278 it is appended at the end of the given string vector SV.
5280 ORIG_TEXT is the string original string from the user command
5281 that needs to be completed. WORD is the entire command on which
5282 completion should be performed. These two parameters are used to
5283 determine which part of the symbol name should be added to the
5285 if WILD_MATCH is set, then wild matching is performed.
5286 ENCODED should be set if TEXT represents a symbol name in its
5287 encoded formed (in which case the completion should also be
5291 symbol_completion_add (VEC(char_ptr
) **sv
,
5292 const char *sym_name
,
5293 const char *text
, int text_len
,
5294 const char *orig_text
, const char *word
,
5295 int wild_match
, int encoded
)
5297 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5298 wild_match
, encoded
);
5304 /* We found a match, so add the appropriate completion to the given
5307 if (word
== orig_text
)
5309 completion
= xmalloc (strlen (match
) + 5);
5310 strcpy (completion
, match
);
5312 else if (word
> orig_text
)
5314 /* Return some portion of sym_name. */
5315 completion
= xmalloc (strlen (match
) + 5);
5316 strcpy (completion
, match
+ (word
- orig_text
));
5320 /* Return some of ORIG_TEXT plus sym_name. */
5321 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5322 strncpy (completion
, word
, orig_text
- word
);
5323 completion
[orig_text
- word
] = '\0';
5324 strcat (completion
, match
);
5327 VEC_safe_push (char_ptr
, *sv
, completion
);
5330 /* Return a list of possible symbol names completing TEXT0. The list
5331 is NULL terminated. WORD is the entire command on which completion
5335 ada_make_symbol_completion_list (char *text0
, char *word
)
5341 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5344 struct partial_symtab
*ps
;
5345 struct minimal_symbol
*msymbol
;
5346 struct objfile
*objfile
;
5347 struct block
*b
, *surrounding_static_block
= 0;
5349 struct dict_iterator iter
;
5351 if (text0
[0] == '<')
5353 text
= xstrdup (text0
);
5354 make_cleanup (xfree
, text
);
5355 text_len
= strlen (text
);
5361 text
= xstrdup (ada_encode (text0
));
5362 make_cleanup (xfree
, text
);
5363 text_len
= strlen (text
);
5364 for (i
= 0; i
< text_len
; i
++)
5365 text
[i
] = tolower (text
[i
]);
5367 encoded
= (strstr (text0
, "__") != NULL
);
5368 /* If the name contains a ".", then the user is entering a fully
5369 qualified entity name, and the match must not be done in wild
5370 mode. Similarly, if the user wants to complete what looks like
5371 an encoded name, the match must not be done in wild mode. */
5372 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5375 /* First, look at the partial symtab symbols. */
5376 ALL_PSYMTABS (objfile
, ps
)
5378 struct partial_symbol
**psym
;
5380 /* If the psymtab's been read in we'll get it when we search
5381 through the blockvector. */
5385 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5386 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5387 + ps
->n_global_syms
); psym
++)
5390 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5391 text
, text_len
, text0
, word
,
5392 wild_match
, encoded
);
5395 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5396 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5397 + ps
->n_static_syms
); psym
++)
5400 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5401 text
, text_len
, text0
, word
,
5402 wild_match
, encoded
);
5406 /* At this point scan through the misc symbol vectors and add each
5407 symbol you find to the list. Eventually we want to ignore
5408 anything that isn't a text symbol (everything else will be
5409 handled by the psymtab code above). */
5411 ALL_MSYMBOLS (objfile
, msymbol
)
5414 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5415 text
, text_len
, text0
, word
, wild_match
, encoded
);
5418 /* Search upwards from currently selected frame (so that we can
5419 complete on local vars. */
5421 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5423 if (!BLOCK_SUPERBLOCK (b
))
5424 surrounding_static_block
= b
; /* For elmin of dups */
5426 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5428 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5429 text
, text_len
, text0
, word
,
5430 wild_match
, encoded
);
5434 /* Go through the symtabs and check the externs and statics for
5435 symbols which match. */
5437 ALL_SYMTABS (objfile
, s
)
5440 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5441 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5443 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5444 text
, text_len
, text0
, word
,
5445 wild_match
, encoded
);
5449 ALL_SYMTABS (objfile
, s
)
5452 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5453 /* Don't do this block twice. */
5454 if (b
== surrounding_static_block
)
5456 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5458 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5459 text
, text_len
, text0
, word
,
5460 wild_match
, encoded
);
5464 /* Append the closing NULL entry. */
5465 VEC_safe_push (char_ptr
, completions
, NULL
);
5467 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5468 return the copy. It's unfortunate that we have to make a copy
5469 of an array that we're about to destroy, but there is nothing much
5470 we can do about it. Fortunately, it's typically not a very large
5473 const size_t completions_size
=
5474 VEC_length (char_ptr
, completions
) * sizeof (char *);
5475 char **result
= malloc (completions_size
);
5477 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5479 VEC_free (char_ptr
, completions
);
5486 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5487 for tagged types. */
5490 ada_is_dispatch_table_ptr_type (struct type
*type
)
5494 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5497 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5501 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5504 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5505 to be invisible to users. */
5508 ada_is_ignored_field (struct type
*type
, int field_num
)
5510 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5513 /* Check the name of that field. */
5515 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5517 /* Anonymous field names should not be printed.
5518 brobecker/2007-02-20: I don't think this can actually happen
5519 but we don't want to print the value of annonymous fields anyway. */
5523 /* A field named "_parent" is internally generated by GNAT for
5524 tagged types, and should not be printed either. */
5525 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5529 /* If this is the dispatch table of a tagged type, then ignore. */
5530 if (ada_is_tagged_type (type
, 1)
5531 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5534 /* Not a special field, so it should not be ignored. */
5538 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5539 pointer or reference type whose ultimate target has a tag field. */
5542 ada_is_tagged_type (struct type
*type
, int refok
)
5544 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5547 /* True iff TYPE represents the type of X'Tag */
5550 ada_is_tag_type (struct type
*type
)
5552 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5556 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5557 return (name
!= NULL
5558 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5562 /* The type of the tag on VAL. */
5565 ada_tag_type (struct value
*val
)
5567 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5570 /* The value of the tag on VAL. */
5573 ada_value_tag (struct value
*val
)
5575 return ada_value_struct_elt (val
, "_tag", 0);
5578 /* The value of the tag on the object of type TYPE whose contents are
5579 saved at VALADDR, if it is non-null, or is at memory address
5582 static struct value
*
5583 value_tag_from_contents_and_address (struct type
*type
,
5584 const gdb_byte
*valaddr
,
5587 int tag_byte_offset
, dummy1
, dummy2
;
5588 struct type
*tag_type
;
5589 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5592 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5594 : valaddr
+ tag_byte_offset
);
5595 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5597 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5602 static struct type
*
5603 type_from_tag (struct value
*tag
)
5605 const char *type_name
= ada_tag_name (tag
);
5606 if (type_name
!= NULL
)
5607 return ada_find_any_type (ada_encode (type_name
));
5618 static int ada_tag_name_1 (void *);
5619 static int ada_tag_name_2 (struct tag_args
*);
5621 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5622 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5623 The value stored in ARGS->name is valid until the next call to
5627 ada_tag_name_1 (void *args0
)
5629 struct tag_args
*args
= (struct tag_args
*) args0
;
5630 static char name
[1024];
5634 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5636 return ada_tag_name_2 (args
);
5637 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5640 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5641 for (p
= name
; *p
!= '\0'; p
+= 1)
5648 /* Utility function for ada_tag_name_1 that tries the second
5649 representation for the dispatch table (in which there is no
5650 explicit 'tsd' field in the referent of the tag pointer, and instead
5651 the tsd pointer is stored just before the dispatch table. */
5654 ada_tag_name_2 (struct tag_args
*args
)
5656 struct type
*info_type
;
5657 static char name
[1024];
5659 struct value
*val
, *valp
;
5662 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5663 if (info_type
== NULL
)
5665 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5666 valp
= value_cast (info_type
, args
->tag
);
5669 val
= value_ind (value_ptradd (valp
,
5670 value_from_longest (builtin_type_int8
, -1)));
5673 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5676 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5677 for (p
= name
; *p
!= '\0'; p
+= 1)
5684 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5688 ada_tag_name (struct value
*tag
)
5690 struct tag_args args
;
5691 if (!ada_is_tag_type (value_type (tag
)))
5695 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5699 /* The parent type of TYPE, or NULL if none. */
5702 ada_parent_type (struct type
*type
)
5706 type
= ada_check_typedef (type
);
5708 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5711 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5712 if (ada_is_parent_field (type
, i
))
5714 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5716 /* If the _parent field is a pointer, then dereference it. */
5717 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5718 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5719 /* If there is a parallel XVS type, get the actual base type. */
5720 parent_type
= ada_get_base_type (parent_type
);
5722 return ada_check_typedef (parent_type
);
5728 /* True iff field number FIELD_NUM of structure type TYPE contains the
5729 parent-type (inherited) fields of a derived type. Assumes TYPE is
5730 a structure type with at least FIELD_NUM+1 fields. */
5733 ada_is_parent_field (struct type
*type
, int field_num
)
5735 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5736 return (name
!= NULL
5737 && (strncmp (name
, "PARENT", 6) == 0
5738 || strncmp (name
, "_parent", 7) == 0));
5741 /* True iff field number FIELD_NUM of structure type TYPE is a
5742 transparent wrapper field (which should be silently traversed when doing
5743 field selection and flattened when printing). Assumes TYPE is a
5744 structure type with at least FIELD_NUM+1 fields. Such fields are always
5748 ada_is_wrapper_field (struct type
*type
, int field_num
)
5750 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5751 return (name
!= NULL
5752 && (strncmp (name
, "PARENT", 6) == 0
5753 || strcmp (name
, "REP") == 0
5754 || strncmp (name
, "_parent", 7) == 0
5755 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5758 /* True iff field number FIELD_NUM of structure or union type TYPE
5759 is a variant wrapper. Assumes TYPE is a structure type with at least
5760 FIELD_NUM+1 fields. */
5763 ada_is_variant_part (struct type
*type
, int field_num
)
5765 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5766 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5767 || (is_dynamic_field (type
, field_num
)
5768 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5769 == TYPE_CODE_UNION
)));
5772 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5773 whose discriminants are contained in the record type OUTER_TYPE,
5774 returns the type of the controlling discriminant for the variant. */
5777 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5779 char *name
= ada_variant_discrim_name (var_type
);
5781 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5783 return builtin_type_int32
;
5788 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5789 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5790 represents a 'when others' clause; otherwise 0. */
5793 ada_is_others_clause (struct type
*type
, int field_num
)
5795 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5796 return (name
!= NULL
&& name
[0] == 'O');
5799 /* Assuming that TYPE0 is the type of the variant part of a record,
5800 returns the name of the discriminant controlling the variant.
5801 The value is valid until the next call to ada_variant_discrim_name. */
5804 ada_variant_discrim_name (struct type
*type0
)
5806 static char *result
= NULL
;
5807 static size_t result_len
= 0;
5810 const char *discrim_end
;
5811 const char *discrim_start
;
5813 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5814 type
= TYPE_TARGET_TYPE (type0
);
5818 name
= ada_type_name (type
);
5820 if (name
== NULL
|| name
[0] == '\000')
5823 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5826 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5829 if (discrim_end
== name
)
5832 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5835 if (discrim_start
== name
+ 1)
5837 if ((discrim_start
> name
+ 3
5838 && strncmp (discrim_start
- 3, "___", 3) == 0)
5839 || discrim_start
[-1] == '.')
5843 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5844 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5845 result
[discrim_end
- discrim_start
] = '\0';
5849 /* Scan STR for a subtype-encoded number, beginning at position K.
5850 Put the position of the character just past the number scanned in
5851 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5852 Return 1 if there was a valid number at the given position, and 0
5853 otherwise. A "subtype-encoded" number consists of the absolute value
5854 in decimal, followed by the letter 'm' to indicate a negative number.
5855 Assumes 0m does not occur. */
5858 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5862 if (!isdigit (str
[k
]))
5865 /* Do it the hard way so as not to make any assumption about
5866 the relationship of unsigned long (%lu scan format code) and
5869 while (isdigit (str
[k
]))
5871 RU
= RU
* 10 + (str
[k
] - '0');
5878 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5884 /* NOTE on the above: Technically, C does not say what the results of
5885 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5886 number representable as a LONGEST (although either would probably work
5887 in most implementations). When RU>0, the locution in the then branch
5888 above is always equivalent to the negative of RU. */
5895 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5896 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5897 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5900 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5902 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5915 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5924 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5925 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5927 if (val
>= L
&& val
<= U
)
5939 /* FIXME: Lots of redundancy below. Try to consolidate. */
5941 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5942 ARG_TYPE, extract and return the value of one of its (non-static)
5943 fields. FIELDNO says which field. Differs from value_primitive_field
5944 only in that it can handle packed values of arbitrary type. */
5946 static struct value
*
5947 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5948 struct type
*arg_type
)
5952 arg_type
= ada_check_typedef (arg_type
);
5953 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5955 /* Handle packed fields. */
5957 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5959 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5960 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5962 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5963 offset
+ bit_pos
/ 8,
5964 bit_pos
% 8, bit_size
, type
);
5967 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5970 /* Find field with name NAME in object of type TYPE. If found,
5971 set the following for each argument that is non-null:
5972 - *FIELD_TYPE_P to the field's type;
5973 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5974 an object of that type;
5975 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5976 - *BIT_SIZE_P to its size in bits if the field is packed, and
5978 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5979 fields up to but not including the desired field, or by the total
5980 number of fields if not found. A NULL value of NAME never
5981 matches; the function just counts visible fields in this case.
5983 Returns 1 if found, 0 otherwise. */
5986 find_struct_field (char *name
, struct type
*type
, int offset
,
5987 struct type
**field_type_p
,
5988 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5993 type
= ada_check_typedef (type
);
5995 if (field_type_p
!= NULL
)
5996 *field_type_p
= NULL
;
5997 if (byte_offset_p
!= NULL
)
5999 if (bit_offset_p
!= NULL
)
6001 if (bit_size_p
!= NULL
)
6004 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6006 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
6007 int fld_offset
= offset
+ bit_pos
/ 8;
6008 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6010 if (t_field_name
== NULL
)
6013 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
6015 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
6016 if (field_type_p
!= NULL
)
6017 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
6018 if (byte_offset_p
!= NULL
)
6019 *byte_offset_p
= fld_offset
;
6020 if (bit_offset_p
!= NULL
)
6021 *bit_offset_p
= bit_pos
% 8;
6022 if (bit_size_p
!= NULL
)
6023 *bit_size_p
= bit_size
;
6026 else if (ada_is_wrapper_field (type
, i
))
6028 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
6029 field_type_p
, byte_offset_p
, bit_offset_p
,
6030 bit_size_p
, index_p
))
6033 else if (ada_is_variant_part (type
, i
))
6035 /* PNH: Wait. Do we ever execute this section, or is ARG always of
6038 struct type
*field_type
6039 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6041 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6043 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
6045 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6046 field_type_p
, byte_offset_p
,
6047 bit_offset_p
, bit_size_p
, index_p
))
6051 else if (index_p
!= NULL
)
6057 /* Number of user-visible fields in record type TYPE. */
6060 num_visible_fields (struct type
*type
)
6064 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
6068 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
6069 and search in it assuming it has (class) type TYPE.
6070 If found, return value, else return NULL.
6072 Searches recursively through wrapper fields (e.g., '_parent'). */
6074 static struct value
*
6075 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
6079 type
= ada_check_typedef (type
);
6081 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6083 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6085 if (t_field_name
== NULL
)
6088 else if (field_name_match (t_field_name
, name
))
6089 return ada_value_primitive_field (arg
, offset
, i
, type
);
6091 else if (ada_is_wrapper_field (type
, i
))
6093 struct value
*v
= /* Do not let indent join lines here. */
6094 ada_search_struct_field (name
, arg
,
6095 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6096 TYPE_FIELD_TYPE (type
, i
));
6101 else if (ada_is_variant_part (type
, i
))
6103 /* PNH: Do we ever get here? See find_struct_field. */
6105 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6106 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6108 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6110 struct value
*v
= ada_search_struct_field
/* Force line break. */
6112 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6113 TYPE_FIELD_TYPE (field_type
, j
));
6122 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6123 int, struct type
*);
6126 /* Return field #INDEX in ARG, where the index is that returned by
6127 * find_struct_field through its INDEX_P argument. Adjust the address
6128 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6129 * If found, return value, else return NULL. */
6131 static struct value
*
6132 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6135 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6139 /* Auxiliary function for ada_index_struct_field. Like
6140 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6143 static struct value
*
6144 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6148 type
= ada_check_typedef (type
);
6150 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6152 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6154 else if (ada_is_wrapper_field (type
, i
))
6156 struct value
*v
= /* Do not let indent join lines here. */
6157 ada_index_struct_field_1 (index_p
, arg
,
6158 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6159 TYPE_FIELD_TYPE (type
, i
));
6164 else if (ada_is_variant_part (type
, i
))
6166 /* PNH: Do we ever get here? See ada_search_struct_field,
6167 find_struct_field. */
6168 error (_("Cannot assign this kind of variant record"));
6170 else if (*index_p
== 0)
6171 return ada_value_primitive_field (arg
, offset
, i
, type
);
6178 /* Given ARG, a value of type (pointer or reference to a)*
6179 structure/union, extract the component named NAME from the ultimate
6180 target structure/union and return it as a value with its
6181 appropriate type. If ARG is a pointer or reference and the field
6182 is not packed, returns a reference to the field, otherwise the
6183 value of the field (an lvalue if ARG is an lvalue).
6185 The routine searches for NAME among all members of the structure itself
6186 and (recursively) among all members of any wrapper members
6189 If NO_ERR, then simply return NULL in case of error, rather than
6193 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6195 struct type
*t
, *t1
;
6199 t1
= t
= ada_check_typedef (value_type (arg
));
6200 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6202 t1
= TYPE_TARGET_TYPE (t
);
6205 t1
= ada_check_typedef (t1
);
6206 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6208 arg
= coerce_ref (arg
);
6213 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6215 t1
= TYPE_TARGET_TYPE (t
);
6218 t1
= ada_check_typedef (t1
);
6219 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6221 arg
= value_ind (arg
);
6228 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6232 v
= ada_search_struct_field (name
, arg
, 0, t
);
6235 int bit_offset
, bit_size
, byte_offset
;
6236 struct type
*field_type
;
6239 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6240 address
= value_as_address (arg
);
6242 address
= unpack_pointer (t
, value_contents (arg
));
6244 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6245 if (find_struct_field (name
, t1
, 0,
6246 &field_type
, &byte_offset
, &bit_offset
,
6251 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6252 arg
= ada_coerce_ref (arg
);
6254 arg
= ada_value_ind (arg
);
6255 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6256 bit_offset
, bit_size
,
6260 v
= value_from_pointer (lookup_reference_type (field_type
),
6261 address
+ byte_offset
);
6265 if (v
!= NULL
|| no_err
)
6268 error (_("There is no member named %s."), name
);
6274 error (_("Attempt to extract a component of a value that is not a record."));
6277 /* Given a type TYPE, look up the type of the component of type named NAME.
6278 If DISPP is non-null, add its byte displacement from the beginning of a
6279 structure (pointed to by a value) of type TYPE to *DISPP (does not
6280 work for packed fields).
6282 Matches any field whose name has NAME as a prefix, possibly
6285 TYPE can be either a struct or union. If REFOK, TYPE may also
6286 be a (pointer or reference)+ to a struct or union, and the
6287 ultimate target type will be searched.
6289 Looks recursively into variant clauses and parent types.
6291 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6292 TYPE is not a type of the right kind. */
6294 static struct type
*
6295 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6296 int noerr
, int *dispp
)
6303 if (refok
&& type
!= NULL
)
6306 type
= ada_check_typedef (type
);
6307 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6308 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6310 type
= TYPE_TARGET_TYPE (type
);
6314 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6315 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6321 target_terminal_ours ();
6322 gdb_flush (gdb_stdout
);
6324 error (_("Type (null) is not a structure or union type"));
6327 /* XXX: type_sprint */
6328 fprintf_unfiltered (gdb_stderr
, _("Type "));
6329 type_print (type
, "", gdb_stderr
, -1);
6330 error (_(" is not a structure or union type"));
6335 type
= to_static_fixed_type (type
);
6337 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6339 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6343 if (t_field_name
== NULL
)
6346 else if (field_name_match (t_field_name
, name
))
6349 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6350 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6353 else if (ada_is_wrapper_field (type
, i
))
6356 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6361 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6366 else if (ada_is_variant_part (type
, i
))
6369 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6371 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6373 /* FIXME pnh 2008/01/26: We check for a field that is
6374 NOT wrapped in a struct, since the compiler sometimes
6375 generates these for unchecked variant types. Revisit
6376 if the compiler changes this practice. */
6377 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6379 if (v_field_name
!= NULL
6380 && field_name_match (v_field_name
, name
))
6381 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6383 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6389 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6400 target_terminal_ours ();
6401 gdb_flush (gdb_stdout
);
6404 /* XXX: type_sprint */
6405 fprintf_unfiltered (gdb_stderr
, _("Type "));
6406 type_print (type
, "", gdb_stderr
, -1);
6407 error (_(" has no component named <null>"));
6411 /* XXX: type_sprint */
6412 fprintf_unfiltered (gdb_stderr
, _("Type "));
6413 type_print (type
, "", gdb_stderr
, -1);
6414 error (_(" has no component named %s"), name
);
6421 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6422 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6423 represents an unchecked union (that is, the variant part of a
6424 record that is named in an Unchecked_Union pragma). */
6427 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6429 char *discrim_name
= ada_variant_discrim_name (var_type
);
6430 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6435 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6436 within a value of type OUTER_TYPE that is stored in GDB at
6437 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6438 numbering from 0) is applicable. Returns -1 if none are. */
6441 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6442 const gdb_byte
*outer_valaddr
)
6446 char *discrim_name
= ada_variant_discrim_name (var_type
);
6447 struct value
*outer
;
6448 struct value
*discrim
;
6449 LONGEST discrim_val
;
6451 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6452 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6453 if (discrim
== NULL
)
6455 discrim_val
= value_as_long (discrim
);
6458 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6460 if (ada_is_others_clause (var_type
, i
))
6462 else if (ada_in_variant (discrim_val
, var_type
, i
))
6466 return others_clause
;
6471 /* Dynamic-Sized Records */
6473 /* Strategy: The type ostensibly attached to a value with dynamic size
6474 (i.e., a size that is not statically recorded in the debugging
6475 data) does not accurately reflect the size or layout of the value.
6476 Our strategy is to convert these values to values with accurate,
6477 conventional types that are constructed on the fly. */
6479 /* There is a subtle and tricky problem here. In general, we cannot
6480 determine the size of dynamic records without its data. However,
6481 the 'struct value' data structure, which GDB uses to represent
6482 quantities in the inferior process (the target), requires the size
6483 of the type at the time of its allocation in order to reserve space
6484 for GDB's internal copy of the data. That's why the
6485 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6486 rather than struct value*s.
6488 However, GDB's internal history variables ($1, $2, etc.) are
6489 struct value*s containing internal copies of the data that are not, in
6490 general, the same as the data at their corresponding addresses in
6491 the target. Fortunately, the types we give to these values are all
6492 conventional, fixed-size types (as per the strategy described
6493 above), so that we don't usually have to perform the
6494 'to_fixed_xxx_type' conversions to look at their values.
6495 Unfortunately, there is one exception: if one of the internal
6496 history variables is an array whose elements are unconstrained
6497 records, then we will need to create distinct fixed types for each
6498 element selected. */
6500 /* The upshot of all of this is that many routines take a (type, host
6501 address, target address) triple as arguments to represent a value.
6502 The host address, if non-null, is supposed to contain an internal
6503 copy of the relevant data; otherwise, the program is to consult the
6504 target at the target address. */
6506 /* Assuming that VAL0 represents a pointer value, the result of
6507 dereferencing it. Differs from value_ind in its treatment of
6508 dynamic-sized types. */
6511 ada_value_ind (struct value
*val0
)
6513 struct value
*val
= unwrap_value (value_ind (val0
));
6514 return ada_to_fixed_value (val
);
6517 /* The value resulting from dereferencing any "reference to"
6518 qualifiers on VAL0. */
6520 static struct value
*
6521 ada_coerce_ref (struct value
*val0
)
6523 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6525 struct value
*val
= val0
;
6526 val
= coerce_ref (val
);
6527 val
= unwrap_value (val
);
6528 return ada_to_fixed_value (val
);
6534 /* Return OFF rounded upward if necessary to a multiple of
6535 ALIGNMENT (a power of 2). */
6538 align_value (unsigned int off
, unsigned int alignment
)
6540 return (off
+ alignment
- 1) & ~(alignment
- 1);
6543 /* Return the bit alignment required for field #F of template type TYPE. */
6546 field_alignment (struct type
*type
, int f
)
6548 const char *name
= TYPE_FIELD_NAME (type
, f
);
6552 /* The field name should never be null, unless the debugging information
6553 is somehow malformed. In this case, we assume the field does not
6554 require any alignment. */
6558 len
= strlen (name
);
6560 if (!isdigit (name
[len
- 1]))
6563 if (isdigit (name
[len
- 2]))
6564 align_offset
= len
- 2;
6566 align_offset
= len
- 1;
6568 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6569 return TARGET_CHAR_BIT
;
6571 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6574 /* Find a symbol named NAME. Ignores ambiguity. */
6577 ada_find_any_symbol (const char *name
)
6581 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6582 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6585 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6589 /* Find a type named NAME. Ignores ambiguity. */
6592 ada_find_any_type (const char *name
)
6594 struct symbol
*sym
= ada_find_any_symbol (name
);
6597 return SYMBOL_TYPE (sym
);
6602 /* Given NAME and an associated BLOCK, search all symbols for
6603 NAME suffixed with "___XR", which is the ``renaming'' symbol
6604 associated to NAME. Return this symbol if found, return
6608 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6612 sym
= find_old_style_renaming_symbol (name
, block
);
6617 /* Not right yet. FIXME pnh 7/20/2007. */
6618 sym
= ada_find_any_symbol (name
);
6619 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6625 static struct symbol
*
6626 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6628 const struct symbol
*function_sym
= block_linkage_function (block
);
6631 if (function_sym
!= NULL
)
6633 /* If the symbol is defined inside a function, NAME is not fully
6634 qualified. This means we need to prepend the function name
6635 as well as adding the ``___XR'' suffix to build the name of
6636 the associated renaming symbol. */
6637 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6638 /* Function names sometimes contain suffixes used
6639 for instance to qualify nested subprograms. When building
6640 the XR type name, we need to make sure that this suffix is
6641 not included. So do not include any suffix in the function
6642 name length below. */
6643 const int function_name_len
= ada_name_prefix_len (function_name
);
6644 const int rename_len
= function_name_len
+ 2 /* "__" */
6645 + strlen (name
) + 6 /* "___XR\0" */ ;
6647 /* Strip the suffix if necessary. */
6648 function_name
[function_name_len
] = '\0';
6650 /* Library-level functions are a special case, as GNAT adds
6651 a ``_ada_'' prefix to the function name to avoid namespace
6652 pollution. However, the renaming symbols themselves do not
6653 have this prefix, so we need to skip this prefix if present. */
6654 if (function_name_len
> 5 /* "_ada_" */
6655 && strstr (function_name
, "_ada_") == function_name
)
6656 function_name
= function_name
+ 5;
6658 rename
= (char *) alloca (rename_len
* sizeof (char));
6659 sprintf (rename
, "%s__%s___XR", function_name
, name
);
6663 const int rename_len
= strlen (name
) + 6;
6664 rename
= (char *) alloca (rename_len
* sizeof (char));
6665 sprintf (rename
, "%s___XR", name
);
6668 return ada_find_any_symbol (rename
);
6671 /* Because of GNAT encoding conventions, several GDB symbols may match a
6672 given type name. If the type denoted by TYPE0 is to be preferred to
6673 that of TYPE1 for purposes of type printing, return non-zero;
6674 otherwise return 0. */
6677 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6681 else if (type0
== NULL
)
6683 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6685 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6687 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6689 else if (ada_is_packed_array_type (type0
))
6691 else if (ada_is_array_descriptor_type (type0
)
6692 && !ada_is_array_descriptor_type (type1
))
6696 const char *type0_name
= type_name_no_tag (type0
);
6697 const char *type1_name
= type_name_no_tag (type1
);
6699 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6700 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6706 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6707 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6710 ada_type_name (struct type
*type
)
6714 else if (TYPE_NAME (type
) != NULL
)
6715 return TYPE_NAME (type
);
6717 return TYPE_TAG_NAME (type
);
6720 /* Find a parallel type to TYPE whose name is formed by appending
6721 SUFFIX to the name of TYPE. */
6724 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6727 static size_t name_len
= 0;
6729 char *typename
= ada_type_name (type
);
6731 if (typename
== NULL
)
6734 len
= strlen (typename
);
6736 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6738 strcpy (name
, typename
);
6739 strcpy (name
+ len
, suffix
);
6741 return ada_find_any_type (name
);
6745 /* If TYPE is a variable-size record type, return the corresponding template
6746 type describing its fields. Otherwise, return NULL. */
6748 static struct type
*
6749 dynamic_template_type (struct type
*type
)
6751 type
= ada_check_typedef (type
);
6753 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6754 || ada_type_name (type
) == NULL
)
6758 int len
= strlen (ada_type_name (type
));
6759 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6762 return ada_find_parallel_type (type
, "___XVE");
6766 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6767 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6770 is_dynamic_field (struct type
*templ_type
, int field_num
)
6772 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6774 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6775 && strstr (name
, "___XVL") != NULL
;
6778 /* The index of the variant field of TYPE, or -1 if TYPE does not
6779 represent a variant record type. */
6782 variant_field_index (struct type
*type
)
6786 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6789 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6791 if (ada_is_variant_part (type
, f
))
6797 /* A record type with no fields. */
6799 static struct type
*
6800 empty_record (struct objfile
*objfile
)
6802 struct type
*type
= alloc_type (objfile
);
6803 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6804 TYPE_NFIELDS (type
) = 0;
6805 TYPE_FIELDS (type
) = NULL
;
6806 INIT_CPLUS_SPECIFIC (type
);
6807 TYPE_NAME (type
) = "<empty>";
6808 TYPE_TAG_NAME (type
) = NULL
;
6809 TYPE_LENGTH (type
) = 0;
6813 /* An ordinary record type (with fixed-length fields) that describes
6814 the value of type TYPE at VALADDR or ADDRESS (see comments at
6815 the beginning of this section) VAL according to GNAT conventions.
6816 DVAL0 should describe the (portion of a) record that contains any
6817 necessary discriminants. It should be NULL if value_type (VAL) is
6818 an outer-level type (i.e., as opposed to a branch of a variant.) A
6819 variant field (unless unchecked) is replaced by a particular branch
6822 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6823 length are not statically known are discarded. As a consequence,
6824 VALADDR, ADDRESS and DVAL0 are ignored.
6826 NOTE: Limitations: For now, we assume that dynamic fields and
6827 variants occupy whole numbers of bytes. However, they need not be
6831 ada_template_to_fixed_record_type_1 (struct type
*type
,
6832 const gdb_byte
*valaddr
,
6833 CORE_ADDR address
, struct value
*dval0
,
6834 int keep_dynamic_fields
)
6836 struct value
*mark
= value_mark ();
6839 int nfields
, bit_len
;
6842 int fld_bit_len
, bit_incr
;
6845 /* Compute the number of fields in this record type that are going
6846 to be processed: unless keep_dynamic_fields, this includes only
6847 fields whose position and length are static will be processed. */
6848 if (keep_dynamic_fields
)
6849 nfields
= TYPE_NFIELDS (type
);
6853 while (nfields
< TYPE_NFIELDS (type
)
6854 && !ada_is_variant_part (type
, nfields
)
6855 && !is_dynamic_field (type
, nfields
))
6859 rtype
= alloc_type (TYPE_OBJFILE (type
));
6860 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6861 INIT_CPLUS_SPECIFIC (rtype
);
6862 TYPE_NFIELDS (rtype
) = nfields
;
6863 TYPE_FIELDS (rtype
) = (struct field
*)
6864 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6865 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6866 TYPE_NAME (rtype
) = ada_type_name (type
);
6867 TYPE_TAG_NAME (rtype
) = NULL
;
6868 TYPE_FIXED_INSTANCE (rtype
) = 1;
6874 for (f
= 0; f
< nfields
; f
+= 1)
6876 off
= align_value (off
, field_alignment (type
, f
))
6877 + TYPE_FIELD_BITPOS (type
, f
);
6878 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6879 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6881 if (ada_is_variant_part (type
, f
))
6884 fld_bit_len
= bit_incr
= 0;
6886 else if (is_dynamic_field (type
, f
))
6889 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6893 /* Get the fixed type of the field. Note that, in this case, we
6894 do not want to get the real type out of the tag: if the current
6895 field is the parent part of a tagged record, we will get the
6896 tag of the object. Clearly wrong: the real type of the parent
6897 is not the real type of the child. We would end up in an infinite
6899 TYPE_FIELD_TYPE (rtype
, f
) =
6902 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6903 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6904 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6905 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6906 bit_incr
= fld_bit_len
=
6907 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6911 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6912 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6913 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6914 bit_incr
= fld_bit_len
=
6915 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6917 bit_incr
= fld_bit_len
=
6918 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6920 if (off
+ fld_bit_len
> bit_len
)
6921 bit_len
= off
+ fld_bit_len
;
6923 TYPE_LENGTH (rtype
) =
6924 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6927 /* We handle the variant part, if any, at the end because of certain
6928 odd cases in which it is re-ordered so as NOT to be the last field of
6929 the record. This can happen in the presence of representation
6931 if (variant_field
>= 0)
6933 struct type
*branch_type
;
6935 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6938 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6943 to_fixed_variant_branch_type
6944 (TYPE_FIELD_TYPE (type
, variant_field
),
6945 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6946 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6947 if (branch_type
== NULL
)
6949 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6950 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6951 TYPE_NFIELDS (rtype
) -= 1;
6955 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6956 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6958 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6960 if (off
+ fld_bit_len
> bit_len
)
6961 bit_len
= off
+ fld_bit_len
;
6962 TYPE_LENGTH (rtype
) =
6963 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6967 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6968 should contain the alignment of that record, which should be a strictly
6969 positive value. If null or negative, then something is wrong, most
6970 probably in the debug info. In that case, we don't round up the size
6971 of the resulting type. If this record is not part of another structure,
6972 the current RTYPE length might be good enough for our purposes. */
6973 if (TYPE_LENGTH (type
) <= 0)
6975 if (TYPE_NAME (rtype
))
6976 warning (_("Invalid type size for `%s' detected: %d."),
6977 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6979 warning (_("Invalid type size for <unnamed> detected: %d."),
6980 TYPE_LENGTH (type
));
6984 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6985 TYPE_LENGTH (type
));
6988 value_free_to_mark (mark
);
6989 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6990 error (_("record type with dynamic size is larger than varsize-limit"));
6994 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6997 static struct type
*
6998 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6999 CORE_ADDR address
, struct value
*dval0
)
7001 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
7005 /* An ordinary record type in which ___XVL-convention fields and
7006 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
7007 static approximations, containing all possible fields. Uses
7008 no runtime values. Useless for use in values, but that's OK,
7009 since the results are used only for type determinations. Works on both
7010 structs and unions. Representation note: to save space, we memorize
7011 the result of this function in the TYPE_TARGET_TYPE of the
7014 static struct type
*
7015 template_to_static_fixed_type (struct type
*type0
)
7021 if (TYPE_TARGET_TYPE (type0
) != NULL
)
7022 return TYPE_TARGET_TYPE (type0
);
7024 nfields
= TYPE_NFIELDS (type0
);
7027 for (f
= 0; f
< nfields
; f
+= 1)
7029 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
7030 struct type
*new_type
;
7032 if (is_dynamic_field (type0
, f
))
7033 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
7035 new_type
= static_unwrap_type (field_type
);
7036 if (type
== type0
&& new_type
!= field_type
)
7038 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
7039 TYPE_CODE (type
) = TYPE_CODE (type0
);
7040 INIT_CPLUS_SPECIFIC (type
);
7041 TYPE_NFIELDS (type
) = nfields
;
7042 TYPE_FIELDS (type
) = (struct field
*)
7043 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
7044 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
7045 sizeof (struct field
) * nfields
);
7046 TYPE_NAME (type
) = ada_type_name (type0
);
7047 TYPE_TAG_NAME (type
) = NULL
;
7048 TYPE_FIXED_INSTANCE (type
) = 1;
7049 TYPE_LENGTH (type
) = 0;
7051 TYPE_FIELD_TYPE (type
, f
) = new_type
;
7052 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
7057 /* Given an object of type TYPE whose contents are at VALADDR and
7058 whose address in memory is ADDRESS, returns a revision of TYPE,
7059 which should be a non-dynamic-sized record, in which the variant
7060 part, if any, is replaced with the appropriate branch. Looks
7061 for discriminant values in DVAL0, which can be NULL if the record
7062 contains the necessary discriminant values. */
7064 static struct type
*
7065 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
7066 CORE_ADDR address
, struct value
*dval0
)
7068 struct value
*mark
= value_mark ();
7071 struct type
*branch_type
;
7072 int nfields
= TYPE_NFIELDS (type
);
7073 int variant_field
= variant_field_index (type
);
7075 if (variant_field
== -1)
7079 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7083 rtype
= alloc_type (TYPE_OBJFILE (type
));
7084 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7085 INIT_CPLUS_SPECIFIC (rtype
);
7086 TYPE_NFIELDS (rtype
) = nfields
;
7087 TYPE_FIELDS (rtype
) =
7088 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7089 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7090 sizeof (struct field
) * nfields
);
7091 TYPE_NAME (rtype
) = ada_type_name (type
);
7092 TYPE_TAG_NAME (rtype
) = NULL
;
7093 TYPE_FIXED_INSTANCE (rtype
) = 1;
7094 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7096 branch_type
= to_fixed_variant_branch_type
7097 (TYPE_FIELD_TYPE (type
, variant_field
),
7098 cond_offset_host (valaddr
,
7099 TYPE_FIELD_BITPOS (type
, variant_field
)
7101 cond_offset_target (address
,
7102 TYPE_FIELD_BITPOS (type
, variant_field
)
7103 / TARGET_CHAR_BIT
), dval
);
7104 if (branch_type
== NULL
)
7107 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7108 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7109 TYPE_NFIELDS (rtype
) -= 1;
7113 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7114 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7115 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7116 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7118 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7120 value_free_to_mark (mark
);
7124 /* An ordinary record type (with fixed-length fields) that describes
7125 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7126 beginning of this section]. Any necessary discriminants' values
7127 should be in DVAL, a record value; it may be NULL if the object
7128 at ADDR itself contains any necessary discriminant values.
7129 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7130 values from the record are needed. Except in the case that DVAL,
7131 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7132 unchecked) is replaced by a particular branch of the variant.
7134 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7135 is questionable and may be removed. It can arise during the
7136 processing of an unconstrained-array-of-record type where all the
7137 variant branches have exactly the same size. This is because in
7138 such cases, the compiler does not bother to use the XVS convention
7139 when encoding the record. I am currently dubious of this
7140 shortcut and suspect the compiler should be altered. FIXME. */
7142 static struct type
*
7143 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7144 CORE_ADDR address
, struct value
*dval
)
7146 struct type
*templ_type
;
7148 if (TYPE_FIXED_INSTANCE (type0
))
7151 templ_type
= dynamic_template_type (type0
);
7153 if (templ_type
!= NULL
)
7154 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7155 else if (variant_field_index (type0
) >= 0)
7157 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7159 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7164 TYPE_FIXED_INSTANCE (type0
) = 1;
7170 /* An ordinary record type (with fixed-length fields) that describes
7171 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7172 union type. Any necessary discriminants' values should be in DVAL,
7173 a record value. That is, this routine selects the appropriate
7174 branch of the union at ADDR according to the discriminant value
7175 indicated in the union's type name. Returns VAR_TYPE0 itself if
7176 it represents a variant subject to a pragma Unchecked_Union. */
7178 static struct type
*
7179 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7180 CORE_ADDR address
, struct value
*dval
)
7183 struct type
*templ_type
;
7184 struct type
*var_type
;
7186 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7187 var_type
= TYPE_TARGET_TYPE (var_type0
);
7189 var_type
= var_type0
;
7191 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7193 if (templ_type
!= NULL
)
7194 var_type
= templ_type
;
7196 if (is_unchecked_variant (var_type
, value_type (dval
)))
7199 ada_which_variant_applies (var_type
,
7200 value_type (dval
), value_contents (dval
));
7203 return empty_record (TYPE_OBJFILE (var_type
));
7204 else if (is_dynamic_field (var_type
, which
))
7205 return to_fixed_record_type
7206 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7207 valaddr
, address
, dval
);
7208 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7210 to_fixed_record_type
7211 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7213 return TYPE_FIELD_TYPE (var_type
, which
);
7216 /* Assuming that TYPE0 is an array type describing the type of a value
7217 at ADDR, and that DVAL describes a record containing any
7218 discriminants used in TYPE0, returns a type for the value that
7219 contains no dynamic components (that is, no components whose sizes
7220 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7221 true, gives an error message if the resulting type's size is over
7224 static struct type
*
7225 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7228 struct type
*index_type_desc
;
7229 struct type
*result
;
7231 if (ada_is_packed_array_type (type0
) /* revisit? */
7232 || TYPE_FIXED_INSTANCE (type0
))
7235 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7236 if (index_type_desc
== NULL
)
7238 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7239 /* NOTE: elt_type---the fixed version of elt_type0---should never
7240 depend on the contents of the array in properly constructed
7242 /* Create a fixed version of the array element type.
7243 We're not providing the address of an element here,
7244 and thus the actual object value cannot be inspected to do
7245 the conversion. This should not be a problem, since arrays of
7246 unconstrained objects are not allowed. In particular, all
7247 the elements of an array of a tagged type should all be of
7248 the same type specified in the debugging info. No need to
7249 consult the object tag. */
7250 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7252 if (elt_type0
== elt_type
)
7255 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7256 elt_type
, TYPE_INDEX_TYPE (type0
));
7261 struct type
*elt_type0
;
7264 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7265 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7267 /* NOTE: result---the fixed version of elt_type0---should never
7268 depend on the contents of the array in properly constructed
7270 /* Create a fixed version of the array element type.
7271 We're not providing the address of an element here,
7272 and thus the actual object value cannot be inspected to do
7273 the conversion. This should not be a problem, since arrays of
7274 unconstrained objects are not allowed. In particular, all
7275 the elements of an array of a tagged type should all be of
7276 the same type specified in the debugging info. No need to
7277 consult the object tag. */
7279 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7280 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7282 struct type
*range_type
=
7283 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7284 dval
, TYPE_OBJFILE (type0
));
7285 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7286 result
, range_type
);
7288 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7289 error (_("array type with dynamic size is larger than varsize-limit"));
7292 TYPE_FIXED_INSTANCE (result
) = 1;
7297 /* A standard type (containing no dynamically sized components)
7298 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7299 DVAL describes a record containing any discriminants used in TYPE0,
7300 and may be NULL if there are none, or if the object of type TYPE at
7301 ADDRESS or in VALADDR contains these discriminants.
7303 If CHECK_TAG is not null, in the case of tagged types, this function
7304 attempts to locate the object's tag and use it to compute the actual
7305 type. However, when ADDRESS is null, we cannot use it to determine the
7306 location of the tag, and therefore compute the tagged type's actual type.
7307 So we return the tagged type without consulting the tag. */
7309 static struct type
*
7310 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7311 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7313 type
= ada_check_typedef (type
);
7314 switch (TYPE_CODE (type
))
7318 case TYPE_CODE_STRUCT
:
7320 struct type
*static_type
= to_static_fixed_type (type
);
7321 struct type
*fixed_record_type
=
7322 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7323 /* If STATIC_TYPE is a tagged type and we know the object's address,
7324 then we can determine its tag, and compute the object's actual
7325 type from there. Note that we have to use the fixed record
7326 type (the parent part of the record may have dynamic fields
7327 and the way the location of _tag is expressed may depend on
7330 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7332 struct type
*real_type
=
7333 type_from_tag (value_tag_from_contents_and_address
7337 if (real_type
!= NULL
)
7338 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7341 /* Check to see if there is a parallel ___XVZ variable.
7342 If there is, then it provides the actual size of our type. */
7343 else if (ada_type_name (fixed_record_type
) != NULL
)
7345 char *name
= ada_type_name (fixed_record_type
);
7346 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7350 sprintf (xvz_name
, "%s___XVZ", name
);
7351 size
= get_int_var_value (xvz_name
, &xvz_found
);
7352 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7354 fixed_record_type
= copy_type (fixed_record_type
);
7355 TYPE_LENGTH (fixed_record_type
) = size
;
7357 /* The FIXED_RECORD_TYPE may have be a stub. We have
7358 observed this when the debugging info is STABS, and
7359 apparently it is something that is hard to fix.
7361 In practice, we don't need the actual type definition
7362 at all, because the presence of the XVZ variable allows us
7363 to assume that there must be a XVS type as well, which we
7364 should be able to use later, when we need the actual type
7367 In the meantime, pretend that the "fixed" type we are
7368 returning is NOT a stub, because this can cause trouble
7369 when using this type to create new types targeting it.
7370 Indeed, the associated creation routines often check
7371 whether the target type is a stub and will try to replace
7372 it, thus using a type with the wrong size. This, in turn,
7373 might cause the new type to have the wrong size too.
7374 Consider the case of an array, for instance, where the size
7375 of the array is computed from the number of elements in
7376 our array multiplied by the size of its element. */
7377 TYPE_STUB (fixed_record_type
) = 0;
7380 return fixed_record_type
;
7382 case TYPE_CODE_ARRAY
:
7383 return to_fixed_array_type (type
, dval
, 1);
7384 case TYPE_CODE_UNION
:
7388 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7392 /* The same as ada_to_fixed_type_1, except that it preserves the type
7393 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7394 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7397 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7398 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7401 struct type
*fixed_type
=
7402 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7404 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7405 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7411 /* A standard (static-sized) type corresponding as well as possible to
7412 TYPE0, but based on no runtime data. */
7414 static struct type
*
7415 to_static_fixed_type (struct type
*type0
)
7422 if (TYPE_FIXED_INSTANCE (type0
))
7425 type0
= ada_check_typedef (type0
);
7427 switch (TYPE_CODE (type0
))
7431 case TYPE_CODE_STRUCT
:
7432 type
= dynamic_template_type (type0
);
7434 return template_to_static_fixed_type (type
);
7436 return template_to_static_fixed_type (type0
);
7437 case TYPE_CODE_UNION
:
7438 type
= ada_find_parallel_type (type0
, "___XVU");
7440 return template_to_static_fixed_type (type
);
7442 return template_to_static_fixed_type (type0
);
7446 /* A static approximation of TYPE with all type wrappers removed. */
7448 static struct type
*
7449 static_unwrap_type (struct type
*type
)
7451 if (ada_is_aligner_type (type
))
7453 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7454 if (ada_type_name (type1
) == NULL
)
7455 TYPE_NAME (type1
) = ada_type_name (type
);
7457 return static_unwrap_type (type1
);
7461 struct type
*raw_real_type
= ada_get_base_type (type
);
7462 if (raw_real_type
== type
)
7465 return to_static_fixed_type (raw_real_type
);
7469 /* In some cases, incomplete and private types require
7470 cross-references that are not resolved as records (for example,
7472 type FooP is access Foo;
7474 type Foo is array ...;
7475 ). In these cases, since there is no mechanism for producing
7476 cross-references to such types, we instead substitute for FooP a
7477 stub enumeration type that is nowhere resolved, and whose tag is
7478 the name of the actual type. Call these types "non-record stubs". */
7480 /* A type equivalent to TYPE that is not a non-record stub, if one
7481 exists, otherwise TYPE. */
7484 ada_check_typedef (struct type
*type
)
7489 CHECK_TYPEDEF (type
);
7490 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7491 || !TYPE_STUB (type
)
7492 || TYPE_TAG_NAME (type
) == NULL
)
7496 char *name
= TYPE_TAG_NAME (type
);
7497 struct type
*type1
= ada_find_any_type (name
);
7498 return (type1
== NULL
) ? type
: type1
;
7502 /* A value representing the data at VALADDR/ADDRESS as described by
7503 type TYPE0, but with a standard (static-sized) type that correctly
7504 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7505 type, then return VAL0 [this feature is simply to avoid redundant
7506 creation of struct values]. */
7508 static struct value
*
7509 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7512 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7513 if (type
== type0
&& val0
!= NULL
)
7516 return value_from_contents_and_address (type
, 0, address
);
7519 /* A value representing VAL, but with a standard (static-sized) type
7520 that correctly describes it. Does not necessarily create a new
7523 static struct value
*
7524 ada_to_fixed_value (struct value
*val
)
7526 return ada_to_fixed_value_create (value_type (val
),
7527 VALUE_ADDRESS (val
) + value_offset (val
),
7531 /* A value representing VAL, but with a standard (static-sized) type
7532 chosen to approximate the real type of VAL as well as possible, but
7533 without consulting any runtime values. For Ada dynamic-sized
7534 types, therefore, the type of the result is likely to be inaccurate. */
7537 ada_to_static_fixed_value (struct value
*val
)
7540 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7541 if (type
== value_type (val
))
7544 return coerce_unspec_val_to_type (val
, type
);
7550 /* Table mapping attribute numbers to names.
7551 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7553 static const char *attribute_names
[] = {
7571 ada_attribute_name (enum exp_opcode n
)
7573 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7574 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7576 return attribute_names
[0];
7579 /* Evaluate the 'POS attribute applied to ARG. */
7582 pos_atr (struct value
*arg
)
7584 struct value
*val
= coerce_ref (arg
);
7585 struct type
*type
= value_type (val
);
7587 if (!discrete_type_p (type
))
7588 error (_("'POS only defined on discrete types"));
7590 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7593 LONGEST v
= value_as_long (val
);
7595 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7597 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7600 error (_("enumeration value is invalid: can't find 'POS"));
7603 return value_as_long (val
);
7606 static struct value
*
7607 value_pos_atr (struct type
*type
, struct value
*arg
)
7609 return value_from_longest (type
, pos_atr (arg
));
7612 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7614 static struct value
*
7615 value_val_atr (struct type
*type
, struct value
*arg
)
7617 if (!discrete_type_p (type
))
7618 error (_("'VAL only defined on discrete types"));
7619 if (!integer_type_p (value_type (arg
)))
7620 error (_("'VAL requires integral argument"));
7622 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7624 long pos
= value_as_long (arg
);
7625 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7626 error (_("argument to 'VAL out of range"));
7627 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7630 return value_from_longest (type
, value_as_long (arg
));
7636 /* True if TYPE appears to be an Ada character type.
7637 [At the moment, this is true only for Character and Wide_Character;
7638 It is a heuristic test that could stand improvement]. */
7641 ada_is_character_type (struct type
*type
)
7645 /* If the type code says it's a character, then assume it really is,
7646 and don't check any further. */
7647 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7650 /* Otherwise, assume it's a character type iff it is a discrete type
7651 with a known character type name. */
7652 name
= ada_type_name (type
);
7653 return (name
!= NULL
7654 && (TYPE_CODE (type
) == TYPE_CODE_INT
7655 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7656 && (strcmp (name
, "character") == 0
7657 || strcmp (name
, "wide_character") == 0
7658 || strcmp (name
, "wide_wide_character") == 0
7659 || strcmp (name
, "unsigned char") == 0));
7662 /* True if TYPE appears to be an Ada string type. */
7665 ada_is_string_type (struct type
*type
)
7667 type
= ada_check_typedef (type
);
7669 && TYPE_CODE (type
) != TYPE_CODE_PTR
7670 && (ada_is_simple_array_type (type
)
7671 || ada_is_array_descriptor_type (type
))
7672 && ada_array_arity (type
) == 1)
7674 struct type
*elttype
= ada_array_element_type (type
, 1);
7676 return ada_is_character_type (elttype
);
7683 /* True if TYPE is a struct type introduced by the compiler to force the
7684 alignment of a value. Such types have a single field with a
7685 distinctive name. */
7688 ada_is_aligner_type (struct type
*type
)
7690 type
= ada_check_typedef (type
);
7692 /* If we can find a parallel XVS type, then the XVS type should
7693 be used instead of this type. And hence, this is not an aligner
7695 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7698 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7699 && TYPE_NFIELDS (type
) == 1
7700 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7703 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7704 the parallel type. */
7707 ada_get_base_type (struct type
*raw_type
)
7709 struct type
*real_type_namer
;
7710 struct type
*raw_real_type
;
7712 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7715 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7716 if (real_type_namer
== NULL
7717 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7718 || TYPE_NFIELDS (real_type_namer
) != 1)
7721 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7722 if (raw_real_type
== NULL
)
7725 return raw_real_type
;
7728 /* The type of value designated by TYPE, with all aligners removed. */
7731 ada_aligned_type (struct type
*type
)
7733 if (ada_is_aligner_type (type
))
7734 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7736 return ada_get_base_type (type
);
7740 /* The address of the aligned value in an object at address VALADDR
7741 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7744 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7746 if (ada_is_aligner_type (type
))
7747 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7749 TYPE_FIELD_BITPOS (type
,
7750 0) / TARGET_CHAR_BIT
);
7757 /* The printed representation of an enumeration literal with encoded
7758 name NAME. The value is good to the next call of ada_enum_name. */
7760 ada_enum_name (const char *name
)
7762 static char *result
;
7763 static size_t result_len
= 0;
7766 /* First, unqualify the enumeration name:
7767 1. Search for the last '.' character. If we find one, then skip
7768 all the preceeding characters, the unqualified name starts
7769 right after that dot.
7770 2. Otherwise, we may be debugging on a target where the compiler
7771 translates dots into "__". Search forward for double underscores,
7772 but stop searching when we hit an overloading suffix, which is
7773 of the form "__" followed by digits. */
7775 tmp
= strrchr (name
, '.');
7780 while ((tmp
= strstr (name
, "__")) != NULL
)
7782 if (isdigit (tmp
[2]))
7792 if (name
[1] == 'U' || name
[1] == 'W')
7794 if (sscanf (name
+ 2, "%x", &v
) != 1)
7800 GROW_VECT (result
, result_len
, 16);
7801 if (isascii (v
) && isprint (v
))
7802 sprintf (result
, "'%c'", v
);
7803 else if (name
[1] == 'U')
7804 sprintf (result
, "[\"%02x\"]", v
);
7806 sprintf (result
, "[\"%04x\"]", v
);
7812 tmp
= strstr (name
, "__");
7814 tmp
= strstr (name
, "$");
7817 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7818 strncpy (result
, name
, tmp
- name
);
7819 result
[tmp
- name
] = '\0';
7827 static struct value
*
7828 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7831 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7832 (expect_type
, exp
, pos
, noside
);
7835 /* Evaluate the subexpression of EXP starting at *POS as for
7836 evaluate_type, updating *POS to point just past the evaluated
7839 static struct value
*
7840 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7842 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7843 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7846 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7849 static struct value
*
7850 unwrap_value (struct value
*val
)
7852 struct type
*type
= ada_check_typedef (value_type (val
));
7853 if (ada_is_aligner_type (type
))
7855 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7856 struct type
*val_type
= ada_check_typedef (value_type (v
));
7857 if (ada_type_name (val_type
) == NULL
)
7858 TYPE_NAME (val_type
) = ada_type_name (type
);
7860 return unwrap_value (v
);
7864 struct type
*raw_real_type
=
7865 ada_check_typedef (ada_get_base_type (type
));
7867 if (type
== raw_real_type
)
7871 coerce_unspec_val_to_type
7872 (val
, ada_to_fixed_type (raw_real_type
, 0,
7873 VALUE_ADDRESS (val
) + value_offset (val
),
7878 static struct value
*
7879 cast_to_fixed (struct type
*type
, struct value
*arg
)
7883 if (type
== value_type (arg
))
7885 else if (ada_is_fixed_point_type (value_type (arg
)))
7886 val
= ada_float_to_fixed (type
,
7887 ada_fixed_to_float (value_type (arg
),
7888 value_as_long (arg
)));
7891 DOUBLEST argd
= value_as_double (arg
);
7892 val
= ada_float_to_fixed (type
, argd
);
7895 return value_from_longest (type
, val
);
7898 static struct value
*
7899 cast_from_fixed (struct type
*type
, struct value
*arg
)
7901 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7902 value_as_long (arg
));
7903 return value_from_double (type
, val
);
7906 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7907 return the converted value. */
7909 static struct value
*
7910 coerce_for_assign (struct type
*type
, struct value
*val
)
7912 struct type
*type2
= value_type (val
);
7916 type2
= ada_check_typedef (type2
);
7917 type
= ada_check_typedef (type
);
7919 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7920 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7922 val
= ada_value_ind (val
);
7923 type2
= value_type (val
);
7926 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7927 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7929 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7930 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7931 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7932 error (_("Incompatible types in assignment"));
7933 deprecated_set_value_type (val
, type
);
7938 static struct value
*
7939 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7942 struct type
*type1
, *type2
;
7945 arg1
= coerce_ref (arg1
);
7946 arg2
= coerce_ref (arg2
);
7947 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7948 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7950 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7951 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7952 return value_binop (arg1
, arg2
, op
);
7961 return value_binop (arg1
, arg2
, op
);
7964 v2
= value_as_long (arg2
);
7966 error (_("second operand of %s must not be zero."), op_string (op
));
7968 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7969 return value_binop (arg1
, arg2
, op
);
7971 v1
= value_as_long (arg1
);
7976 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7977 v
+= v
> 0 ? -1 : 1;
7985 /* Should not reach this point. */
7989 val
= allocate_value (type1
);
7990 store_unsigned_integer (value_contents_raw (val
),
7991 TYPE_LENGTH (value_type (val
)), v
);
7996 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7998 if (ada_is_direct_array_type (value_type (arg1
))
7999 || ada_is_direct_array_type (value_type (arg2
)))
8001 /* Automatically dereference any array reference before
8002 we attempt to perform the comparison. */
8003 arg1
= ada_coerce_ref (arg1
);
8004 arg2
= ada_coerce_ref (arg2
);
8006 arg1
= ada_coerce_to_simple_array (arg1
);
8007 arg2
= ada_coerce_to_simple_array (arg2
);
8008 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
8009 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
8010 error (_("Attempt to compare array with non-array"));
8011 /* FIXME: The following works only for types whose
8012 representations use all bits (no padding or undefined bits)
8013 and do not have user-defined equality. */
8015 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
8016 && memcmp (value_contents (arg1
), value_contents (arg2
),
8017 TYPE_LENGTH (value_type (arg1
))) == 0;
8019 return value_equal (arg1
, arg2
);
8022 /* Total number of component associations in the aggregate starting at
8023 index PC in EXP. Assumes that index PC is the start of an
8027 num_component_specs (struct expression
*exp
, int pc
)
8030 m
= exp
->elts
[pc
+ 1].longconst
;
8033 for (i
= 0; i
< m
; i
+= 1)
8035 switch (exp
->elts
[pc
].opcode
)
8041 n
+= exp
->elts
[pc
+ 1].longconst
;
8044 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8049 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8050 component of LHS (a simple array or a record), updating *POS past
8051 the expression, assuming that LHS is contained in CONTAINER. Does
8052 not modify the inferior's memory, nor does it modify LHS (unless
8053 LHS == CONTAINER). */
8056 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8057 struct expression
*exp
, int *pos
)
8059 struct value
*mark
= value_mark ();
8061 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8063 struct value
*index_val
= value_from_longest (builtin_type_int32
, index
);
8064 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8068 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8069 elt
= ada_to_fixed_value (unwrap_value (elt
));
8072 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8073 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8075 value_assign_to_component (container
, elt
,
8076 ada_evaluate_subexp (NULL
, exp
, pos
,
8079 value_free_to_mark (mark
);
8082 /* Assuming that LHS represents an lvalue having a record or array
8083 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8084 of that aggregate's value to LHS, advancing *POS past the
8085 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8086 lvalue containing LHS (possibly LHS itself). Does not modify
8087 the inferior's memory, nor does it modify the contents of
8088 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8090 static struct value
*
8091 assign_aggregate (struct value
*container
,
8092 struct value
*lhs
, struct expression
*exp
,
8093 int *pos
, enum noside noside
)
8095 struct type
*lhs_type
;
8096 int n
= exp
->elts
[*pos
+1].longconst
;
8097 LONGEST low_index
, high_index
;
8100 int max_indices
, num_indices
;
8101 int is_array_aggregate
;
8103 struct value
*mark
= value_mark ();
8106 if (noside
!= EVAL_NORMAL
)
8109 for (i
= 0; i
< n
; i
+= 1)
8110 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8114 container
= ada_coerce_ref (container
);
8115 if (ada_is_direct_array_type (value_type (container
)))
8116 container
= ada_coerce_to_simple_array (container
);
8117 lhs
= ada_coerce_ref (lhs
);
8118 if (!deprecated_value_modifiable (lhs
))
8119 error (_("Left operand of assignment is not a modifiable lvalue."));
8121 lhs_type
= value_type (lhs
);
8122 if (ada_is_direct_array_type (lhs_type
))
8124 lhs
= ada_coerce_to_simple_array (lhs
);
8125 lhs_type
= value_type (lhs
);
8126 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8127 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8128 is_array_aggregate
= 1;
8130 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8133 high_index
= num_visible_fields (lhs_type
) - 1;
8134 is_array_aggregate
= 0;
8137 error (_("Left-hand side must be array or record."));
8139 num_specs
= num_component_specs (exp
, *pos
- 3);
8140 max_indices
= 4 * num_specs
+ 4;
8141 indices
= alloca (max_indices
* sizeof (indices
[0]));
8142 indices
[0] = indices
[1] = low_index
- 1;
8143 indices
[2] = indices
[3] = high_index
+ 1;
8146 for (i
= 0; i
< n
; i
+= 1)
8148 switch (exp
->elts
[*pos
].opcode
)
8151 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8152 &num_indices
, max_indices
,
8153 low_index
, high_index
);
8156 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8157 &num_indices
, max_indices
,
8158 low_index
, high_index
);
8162 error (_("Misplaced 'others' clause"));
8163 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8164 num_indices
, low_index
, high_index
);
8167 error (_("Internal error: bad aggregate clause"));
8174 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8175 construct at *POS, updating *POS past the construct, given that
8176 the positions are relative to lower bound LOW, where HIGH is the
8177 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8178 updating *NUM_INDICES as needed. CONTAINER is as for
8179 assign_aggregate. */
8181 aggregate_assign_positional (struct value
*container
,
8182 struct value
*lhs
, struct expression
*exp
,
8183 int *pos
, LONGEST
*indices
, int *num_indices
,
8184 int max_indices
, LONGEST low
, LONGEST high
)
8186 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8188 if (ind
- 1 == high
)
8189 warning (_("Extra components in aggregate ignored."));
8192 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8194 assign_component (container
, lhs
, ind
, exp
, pos
);
8197 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8200 /* Assign into the components of LHS indexed by the OP_CHOICES
8201 construct at *POS, updating *POS past the construct, given that
8202 the allowable indices are LOW..HIGH. Record the indices assigned
8203 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8204 needed. CONTAINER is as for assign_aggregate. */
8206 aggregate_assign_from_choices (struct value
*container
,
8207 struct value
*lhs
, struct expression
*exp
,
8208 int *pos
, LONGEST
*indices
, int *num_indices
,
8209 int max_indices
, LONGEST low
, LONGEST high
)
8212 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8213 int choice_pos
, expr_pc
;
8214 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8216 choice_pos
= *pos
+= 3;
8218 for (j
= 0; j
< n_choices
; j
+= 1)
8219 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8221 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8223 for (j
= 0; j
< n_choices
; j
+= 1)
8225 LONGEST lower
, upper
;
8226 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8227 if (op
== OP_DISCRETE_RANGE
)
8230 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8232 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8237 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8248 name
= &exp
->elts
[choice_pos
+ 2].string
;
8251 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8254 error (_("Invalid record component association."));
8256 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8258 if (! find_struct_field (name
, value_type (lhs
), 0,
8259 NULL
, NULL
, NULL
, NULL
, &ind
))
8260 error (_("Unknown component name: %s."), name
);
8261 lower
= upper
= ind
;
8264 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8265 error (_("Index in component association out of bounds."));
8267 add_component_interval (lower
, upper
, indices
, num_indices
,
8269 while (lower
<= upper
)
8273 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8279 /* Assign the value of the expression in the OP_OTHERS construct in
8280 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8281 have not been previously assigned. The index intervals already assigned
8282 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8283 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8285 aggregate_assign_others (struct value
*container
,
8286 struct value
*lhs
, struct expression
*exp
,
8287 int *pos
, LONGEST
*indices
, int num_indices
,
8288 LONGEST low
, LONGEST high
)
8291 int expr_pc
= *pos
+1;
8293 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8296 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8300 assign_component (container
, lhs
, ind
, exp
, &pos
);
8303 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8306 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8307 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8308 modifying *SIZE as needed. It is an error if *SIZE exceeds
8309 MAX_SIZE. The resulting intervals do not overlap. */
8311 add_component_interval (LONGEST low
, LONGEST high
,
8312 LONGEST
* indices
, int *size
, int max_size
)
8315 for (i
= 0; i
< *size
; i
+= 2) {
8316 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8319 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8320 if (high
< indices
[kh
])
8322 if (low
< indices
[i
])
8324 indices
[i
+ 1] = indices
[kh
- 1];
8325 if (high
> indices
[i
+ 1])
8326 indices
[i
+ 1] = high
;
8327 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8328 *size
-= kh
- i
- 2;
8331 else if (high
< indices
[i
])
8335 if (*size
== max_size
)
8336 error (_("Internal error: miscounted aggregate components."));
8338 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8339 indices
[j
] = indices
[j
- 2];
8341 indices
[i
+ 1] = high
;
8344 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8347 static struct value
*
8348 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8350 if (type
== ada_check_typedef (value_type (arg2
)))
8353 if (ada_is_fixed_point_type (type
))
8354 return (cast_to_fixed (type
, arg2
));
8356 if (ada_is_fixed_point_type (value_type (arg2
)))
8357 return cast_from_fixed (type
, arg2
);
8359 return value_cast (type
, arg2
);
8362 static struct value
*
8363 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8364 int *pos
, enum noside noside
)
8367 int tem
, tem2
, tem3
;
8369 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8372 struct value
**argvec
;
8376 op
= exp
->elts
[pc
].opcode
;
8382 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8383 arg1
= unwrap_value (arg1
);
8385 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8386 then we need to perform the conversion manually, because
8387 evaluate_subexp_standard doesn't do it. This conversion is
8388 necessary in Ada because the different kinds of float/fixed
8389 types in Ada have different representations.
8391 Similarly, we need to perform the conversion from OP_LONG
8393 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8394 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8400 struct value
*result
;
8402 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8403 /* The result type will have code OP_STRING, bashed there from
8404 OP_ARRAY. Bash it back. */
8405 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8406 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8412 type
= exp
->elts
[pc
+ 1].type
;
8413 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8414 if (noside
== EVAL_SKIP
)
8416 arg1
= ada_value_cast (type
, arg1
, noside
);
8421 type
= exp
->elts
[pc
+ 1].type
;
8422 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8425 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8426 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8428 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8429 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8431 return ada_value_assign (arg1
, arg1
);
8433 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8434 except if the lhs of our assignment is a convenience variable.
8435 In the case of assigning to a convenience variable, the lhs
8436 should be exactly the result of the evaluation of the rhs. */
8437 type
= value_type (arg1
);
8438 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8440 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8441 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8443 if (ada_is_fixed_point_type (value_type (arg1
)))
8444 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8445 else if (ada_is_fixed_point_type (value_type (arg2
)))
8447 (_("Fixed-point values must be assigned to fixed-point variables"));
8449 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8450 return ada_value_assign (arg1
, arg2
);
8453 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8454 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8455 if (noside
== EVAL_SKIP
)
8457 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8458 return (value_from_longest
8460 value_as_long (arg1
) + value_as_long (arg2
)));
8461 if ((ada_is_fixed_point_type (value_type (arg1
))
8462 || ada_is_fixed_point_type (value_type (arg2
)))
8463 && value_type (arg1
) != value_type (arg2
))
8464 error (_("Operands of fixed-point addition must have the same type"));
8465 /* Do the addition, and cast the result to the type of the first
8466 argument. We cannot cast the result to a reference type, so if
8467 ARG1 is a reference type, find its underlying type. */
8468 type
= value_type (arg1
);
8469 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8470 type
= TYPE_TARGET_TYPE (type
);
8471 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8472 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8475 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8476 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8477 if (noside
== EVAL_SKIP
)
8479 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8480 return (value_from_longest
8482 value_as_long (arg1
) - value_as_long (arg2
)));
8483 if ((ada_is_fixed_point_type (value_type (arg1
))
8484 || ada_is_fixed_point_type (value_type (arg2
)))
8485 && value_type (arg1
) != value_type (arg2
))
8486 error (_("Operands of fixed-point subtraction must have the same type"));
8487 /* Do the substraction, and cast the result to the type of the first
8488 argument. We cannot cast the result to a reference type, so if
8489 ARG1 is a reference type, find its underlying type. */
8490 type
= value_type (arg1
);
8491 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8492 type
= TYPE_TARGET_TYPE (type
);
8493 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8494 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8498 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8499 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8500 if (noside
== EVAL_SKIP
)
8502 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8503 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8504 return value_zero (value_type (arg1
), not_lval
);
8507 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8508 if (ada_is_fixed_point_type (value_type (arg1
)))
8509 arg1
= cast_from_fixed (type
, arg1
);
8510 if (ada_is_fixed_point_type (value_type (arg2
)))
8511 arg2
= cast_from_fixed (type
, arg2
);
8512 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8513 return ada_value_binop (arg1
, arg2
, op
);
8518 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8519 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8520 if (noside
== EVAL_SKIP
)
8522 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
8523 && (op
== BINOP_DIV
|| op
== BINOP_REM
|| op
== BINOP_MOD
))
8524 return value_zero (value_type (arg1
), not_lval
);
8527 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8528 return ada_value_binop (arg1
, arg2
, op
);
8532 case BINOP_NOTEQUAL
:
8533 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8534 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8535 if (noside
== EVAL_SKIP
)
8537 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8541 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8542 tem
= ada_value_equal (arg1
, arg2
);
8544 if (op
== BINOP_NOTEQUAL
)
8546 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8547 return value_from_longest (type
, (LONGEST
) tem
);
8550 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8551 if (noside
== EVAL_SKIP
)
8553 else if (ada_is_fixed_point_type (value_type (arg1
)))
8554 return value_cast (value_type (arg1
), value_neg (arg1
));
8557 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8558 return value_neg (arg1
);
8561 case BINOP_LOGICAL_AND
:
8562 case BINOP_LOGICAL_OR
:
8563 case UNOP_LOGICAL_NOT
:
8568 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8569 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8570 return value_cast (type
, val
);
8573 case BINOP_BITWISE_AND
:
8574 case BINOP_BITWISE_IOR
:
8575 case BINOP_BITWISE_XOR
:
8579 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8581 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8583 return value_cast (value_type (arg1
), val
);
8589 if (noside
== EVAL_SKIP
)
8594 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8595 /* Only encountered when an unresolved symbol occurs in a
8596 context other than a function call, in which case, it is
8598 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8599 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8600 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8602 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8603 if (ada_is_tagged_type (type
, 0))
8605 /* Tagged types are a little special in the fact that the real
8606 type is dynamic and can only be determined by inspecting the
8607 object's tag. This means that we need to get the object's
8608 value first (EVAL_NORMAL) and then extract the actual object
8611 Note that we cannot skip the final step where we extract
8612 the object type from its tag, because the EVAL_NORMAL phase
8613 results in dynamic components being resolved into fixed ones.
8614 This can cause problems when trying to print the type
8615 description of tagged types whose parent has a dynamic size:
8616 We use the type name of the "_parent" component in order
8617 to print the name of the ancestor type in the type description.
8618 If that component had a dynamic size, the resolution into
8619 a fixed type would result in the loss of that type name,
8620 thus preventing us from printing the name of the ancestor
8621 type in the type description. */
8622 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8623 return value_zero (type_from_tag (ada_value_tag (arg1
)), not_lval
);
8628 (to_static_fixed_type
8629 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8635 unwrap_value (evaluate_subexp_standard
8636 (expect_type
, exp
, pos
, noside
));
8637 return ada_to_fixed_value (arg1
);
8643 /* Allocate arg vector, including space for the function to be
8644 called in argvec[0] and a terminating NULL. */
8645 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8647 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8649 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8650 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8651 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8652 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8655 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8656 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8659 if (noside
== EVAL_SKIP
)
8663 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8664 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8665 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8666 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8667 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8668 argvec
[0] = value_addr (argvec
[0]);
8670 type
= ada_check_typedef (value_type (argvec
[0]));
8671 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8673 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8675 case TYPE_CODE_FUNC
:
8676 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8678 case TYPE_CODE_ARRAY
:
8680 case TYPE_CODE_STRUCT
:
8681 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8682 argvec
[0] = ada_value_ind (argvec
[0]);
8683 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8686 error (_("cannot subscript or call something of type `%s'"),
8687 ada_type_name (value_type (argvec
[0])));
8692 switch (TYPE_CODE (type
))
8694 case TYPE_CODE_FUNC
:
8695 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8696 return allocate_value (TYPE_TARGET_TYPE (type
));
8697 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8698 case TYPE_CODE_STRUCT
:
8702 arity
= ada_array_arity (type
);
8703 type
= ada_array_element_type (type
, nargs
);
8705 error (_("cannot subscript or call a record"));
8707 error (_("wrong number of subscripts; expecting %d"), arity
);
8708 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8709 return value_zero (ada_aligned_type (type
), lval_memory
);
8711 unwrap_value (ada_value_subscript
8712 (argvec
[0], nargs
, argvec
+ 1));
8714 case TYPE_CODE_ARRAY
:
8715 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8717 type
= ada_array_element_type (type
, nargs
);
8719 error (_("element type of array unknown"));
8721 return value_zero (ada_aligned_type (type
), lval_memory
);
8724 unwrap_value (ada_value_subscript
8725 (ada_coerce_to_simple_array (argvec
[0]),
8726 nargs
, argvec
+ 1));
8727 case TYPE_CODE_PTR
: /* Pointer to array */
8728 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8729 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8731 type
= ada_array_element_type (type
, nargs
);
8733 error (_("element type of array unknown"));
8735 return value_zero (ada_aligned_type (type
), lval_memory
);
8738 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8739 nargs
, argvec
+ 1));
8742 error (_("Attempt to index or call something other than an "
8743 "array or function"));
8748 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8749 struct value
*low_bound_val
=
8750 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8751 struct value
*high_bound_val
=
8752 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8755 low_bound_val
= coerce_ref (low_bound_val
);
8756 high_bound_val
= coerce_ref (high_bound_val
);
8757 low_bound
= pos_atr (low_bound_val
);
8758 high_bound
= pos_atr (high_bound_val
);
8760 if (noside
== EVAL_SKIP
)
8763 /* If this is a reference to an aligner type, then remove all
8765 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8766 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8767 TYPE_TARGET_TYPE (value_type (array
)) =
8768 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8770 if (ada_is_packed_array_type (value_type (array
)))
8771 error (_("cannot slice a packed array"));
8773 /* If this is a reference to an array or an array lvalue,
8774 convert to a pointer. */
8775 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8776 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8777 && VALUE_LVAL (array
) == lval_memory
))
8778 array
= value_addr (array
);
8780 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8781 && ada_is_array_descriptor_type (ada_check_typedef
8782 (value_type (array
))))
8783 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8785 array
= ada_coerce_to_simple_array_ptr (array
);
8787 /* If we have more than one level of pointer indirection,
8788 dereference the value until we get only one level. */
8789 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8790 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8792 array
= value_ind (array
);
8794 /* Make sure we really do have an array type before going further,
8795 to avoid a SEGV when trying to get the index type or the target
8796 type later down the road if the debug info generated by
8797 the compiler is incorrect or incomplete. */
8798 if (!ada_is_simple_array_type (value_type (array
)))
8799 error (_("cannot take slice of non-array"));
8801 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8803 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8804 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8808 struct type
*arr_type0
=
8809 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8811 return ada_value_slice_ptr (array
, arr_type0
,
8812 longest_to_int (low_bound
),
8813 longest_to_int (high_bound
));
8816 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8818 else if (high_bound
< low_bound
)
8819 return empty_array (value_type (array
), low_bound
);
8821 return ada_value_slice (array
, longest_to_int (low_bound
),
8822 longest_to_int (high_bound
));
8827 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8828 type
= exp
->elts
[pc
+ 1].type
;
8830 if (noside
== EVAL_SKIP
)
8833 switch (TYPE_CODE (type
))
8836 lim_warning (_("Membership test incompletely implemented; "
8837 "always returns true"));
8838 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8839 return value_from_longest (type
, (LONGEST
) 1);
8841 case TYPE_CODE_RANGE
:
8842 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
8843 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
8844 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8845 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8846 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8848 value_from_longest (type
,
8849 (value_less (arg1
, arg3
)
8850 || value_equal (arg1
, arg3
))
8851 && (value_less (arg2
, arg1
)
8852 || value_equal (arg2
, arg1
)));
8855 case BINOP_IN_BOUNDS
:
8857 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8858 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8860 if (noside
== EVAL_SKIP
)
8863 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8865 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8866 return value_zero (type
, not_lval
);
8869 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8871 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8872 error (_("invalid dimension number to 'range"));
8874 arg3
= ada_array_bound (arg2
, tem
, 1);
8875 arg2
= ada_array_bound (arg2
, tem
, 0);
8877 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8878 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8879 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8881 value_from_longest (type
,
8882 (value_less (arg1
, arg3
)
8883 || value_equal (arg1
, arg3
))
8884 && (value_less (arg2
, arg1
)
8885 || value_equal (arg2
, arg1
)));
8887 case TERNOP_IN_RANGE
:
8888 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8889 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8890 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8892 if (noside
== EVAL_SKIP
)
8895 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8896 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8897 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8899 value_from_longest (type
,
8900 (value_less (arg1
, arg3
)
8901 || value_equal (arg1
, arg3
))
8902 && (value_less (arg2
, arg1
)
8903 || value_equal (arg2
, arg1
)));
8909 struct type
*type_arg
;
8910 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8912 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8914 type_arg
= exp
->elts
[pc
+ 2].type
;
8918 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8922 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8923 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8924 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8927 if (noside
== EVAL_SKIP
)
8930 if (type_arg
== NULL
)
8932 arg1
= ada_coerce_ref (arg1
);
8934 if (ada_is_packed_array_type (value_type (arg1
)))
8935 arg1
= ada_coerce_to_simple_array (arg1
);
8937 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8938 error (_("invalid dimension number to '%s"),
8939 ada_attribute_name (op
));
8941 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8943 type
= ada_index_type (value_type (arg1
), tem
);
8946 (_("attempt to take bound of something that is not an array"));
8947 return allocate_value (type
);
8952 default: /* Should never happen. */
8953 error (_("unexpected attribute encountered"));
8955 return ada_array_bound (arg1
, tem
, 0);
8957 return ada_array_bound (arg1
, tem
, 1);
8959 return ada_array_length (arg1
, tem
);
8962 else if (discrete_type_p (type_arg
))
8964 struct type
*range_type
;
8965 char *name
= ada_type_name (type_arg
);
8967 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8969 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8970 if (range_type
== NULL
)
8971 range_type
= type_arg
;
8975 error (_("unexpected attribute encountered"));
8977 return value_from_longest
8978 (range_type
, discrete_type_low_bound (range_type
));
8980 return value_from_longest
8981 (range_type
, discrete_type_high_bound (range_type
));
8983 error (_("the 'length attribute applies only to array types"));
8986 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8987 error (_("unimplemented type attribute"));
8992 if (ada_is_packed_array_type (type_arg
))
8993 type_arg
= decode_packed_array_type (type_arg
);
8995 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8996 error (_("invalid dimension number to '%s"),
8997 ada_attribute_name (op
));
8999 type
= ada_index_type (type_arg
, tem
);
9002 (_("attempt to take bound of something that is not an array"));
9003 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9004 return allocate_value (type
);
9009 error (_("unexpected attribute encountered"));
9011 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9012 return value_from_longest (type
, low
);
9014 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
9015 return value_from_longest (type
, high
);
9017 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9018 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
9019 return value_from_longest (type
, high
- low
+ 1);
9025 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9026 if (noside
== EVAL_SKIP
)
9029 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9030 return value_zero (ada_tag_type (arg1
), not_lval
);
9032 return ada_value_tag (arg1
);
9036 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9037 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9038 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9039 if (noside
== EVAL_SKIP
)
9041 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9042 return value_zero (value_type (arg1
), not_lval
);
9045 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9046 return value_binop (arg1
, arg2
,
9047 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9050 case OP_ATR_MODULUS
:
9052 struct type
*type_arg
= exp
->elts
[pc
+ 2].type
;
9053 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9055 if (noside
== EVAL_SKIP
)
9058 if (!ada_is_modular_type (type_arg
))
9059 error (_("'modulus must be applied to modular type"));
9061 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9062 ada_modulus (type_arg
));
9067 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9068 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9069 if (noside
== EVAL_SKIP
)
9071 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9072 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9073 return value_zero (type
, not_lval
);
9075 return value_pos_atr (type
, arg1
);
9078 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9079 type
= value_type (arg1
);
9081 /* If the argument is a reference, then dereference its type, since
9082 the user is really asking for the size of the actual object,
9083 not the size of the pointer. */
9084 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9085 type
= TYPE_TARGET_TYPE (type
);
9087 if (noside
== EVAL_SKIP
)
9089 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9090 return value_zero (builtin_type_int32
, not_lval
);
9092 return value_from_longest (builtin_type_int32
,
9093 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9096 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9097 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9098 type
= exp
->elts
[pc
+ 2].type
;
9099 if (noside
== EVAL_SKIP
)
9101 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9102 return value_zero (type
, not_lval
);
9104 return value_val_atr (type
, arg1
);
9107 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9108 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9109 if (noside
== EVAL_SKIP
)
9111 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9112 return value_zero (value_type (arg1
), not_lval
);
9115 /* For integer exponentiation operations,
9116 only promote the first argument. */
9117 if (is_integral_type (value_type (arg2
)))
9118 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9120 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9122 return value_binop (arg1
, arg2
, op
);
9126 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9127 if (noside
== EVAL_SKIP
)
9133 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9134 if (noside
== EVAL_SKIP
)
9136 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9137 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9138 return value_neg (arg1
);
9143 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9144 if (noside
== EVAL_SKIP
)
9146 type
= ada_check_typedef (value_type (arg1
));
9147 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9149 if (ada_is_array_descriptor_type (type
))
9150 /* GDB allows dereferencing GNAT array descriptors. */
9152 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9153 if (arrType
== NULL
)
9154 error (_("Attempt to dereference null array pointer."));
9155 return value_at_lazy (arrType
, 0);
9157 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9158 || TYPE_CODE (type
) == TYPE_CODE_REF
9159 /* In C you can dereference an array to get the 1st elt. */
9160 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9162 type
= to_static_fixed_type
9164 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9166 return value_zero (type
, lval_memory
);
9168 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9170 /* GDB allows dereferencing an int. */
9171 if (expect_type
== NULL
)
9172 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9177 to_static_fixed_type (ada_aligned_type (expect_type
));
9178 return value_zero (expect_type
, lval_memory
);
9182 error (_("Attempt to take contents of a non-pointer value."));
9184 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9185 type
= ada_check_typedef (value_type (arg1
));
9187 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9188 /* GDB allows dereferencing an int. If we were given
9189 the expect_type, then use that as the target type.
9190 Otherwise, assume that the target type is an int. */
9192 if (expect_type
!= NULL
)
9193 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9196 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9197 (CORE_ADDR
) value_as_address (arg1
));
9200 if (ada_is_array_descriptor_type (type
))
9201 /* GDB allows dereferencing GNAT array descriptors. */
9202 return ada_coerce_to_simple_array (arg1
);
9204 return ada_value_ind (arg1
);
9206 case STRUCTOP_STRUCT
:
9207 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9208 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9209 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9210 if (noside
== EVAL_SKIP
)
9212 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9214 struct type
*type1
= value_type (arg1
);
9215 if (ada_is_tagged_type (type1
, 1))
9217 type
= ada_lookup_struct_elt_type (type1
,
9218 &exp
->elts
[pc
+ 2].string
,
9221 /* In this case, we assume that the field COULD exist
9222 in some extension of the type. Return an object of
9223 "type" void, which will match any formal
9224 (see ada_type_match). */
9225 return value_zero (builtin_type_void
, lval_memory
);
9229 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9232 return value_zero (ada_aligned_type (type
), lval_memory
);
9236 ada_to_fixed_value (unwrap_value
9237 (ada_value_struct_elt
9238 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9240 /* The value is not supposed to be used. This is here to make it
9241 easier to accommodate expressions that contain types. */
9243 if (noside
== EVAL_SKIP
)
9245 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9246 return allocate_value (exp
->elts
[pc
+ 1].type
);
9248 error (_("Attempt to use a type name as an expression"));
9253 case OP_DISCRETE_RANGE
:
9256 if (noside
== EVAL_NORMAL
)
9260 error (_("Undefined name, ambiguous name, or renaming used in "
9261 "component association: %s."), &exp
->elts
[pc
+2].string
);
9263 error (_("Aggregates only allowed on the right of an assignment"));
9265 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9268 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9270 for (tem
= 0; tem
< nargs
; tem
+= 1)
9271 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9276 return value_from_longest (builtin_type_int8
, (LONGEST
) 1);
9282 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9283 type name that encodes the 'small and 'delta information.
9284 Otherwise, return NULL. */
9287 fixed_type_info (struct type
*type
)
9289 const char *name
= ada_type_name (type
);
9290 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9292 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9294 const char *tail
= strstr (name
, "___XF_");
9300 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9301 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9306 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9309 ada_is_fixed_point_type (struct type
*type
)
9311 return fixed_type_info (type
) != NULL
;
9314 /* Return non-zero iff TYPE represents a System.Address type. */
9317 ada_is_system_address_type (struct type
*type
)
9319 return (TYPE_NAME (type
)
9320 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9323 /* Assuming that TYPE is the representation of an Ada fixed-point
9324 type, return its delta, or -1 if the type is malformed and the
9325 delta cannot be determined. */
9328 ada_delta (struct type
*type
)
9330 const char *encoding
= fixed_type_info (type
);
9333 if (sscanf (encoding
, "_%ld_%ld", &num
, &den
) < 2)
9336 return (DOUBLEST
) num
/ (DOUBLEST
) den
;
9339 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9340 factor ('SMALL value) associated with the type. */
9343 scaling_factor (struct type
*type
)
9345 const char *encoding
= fixed_type_info (type
);
9346 unsigned long num0
, den0
, num1
, den1
;
9349 n
= sscanf (encoding
, "_%lu_%lu_%lu_%lu", &num0
, &den0
, &num1
, &den1
);
9354 return (DOUBLEST
) num1
/ (DOUBLEST
) den1
;
9356 return (DOUBLEST
) num0
/ (DOUBLEST
) den0
;
9360 /* Assuming that X is the representation of a value of fixed-point
9361 type TYPE, return its floating-point equivalent. */
9364 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9366 return (DOUBLEST
) x
*scaling_factor (type
);
9369 /* The representation of a fixed-point value of type TYPE
9370 corresponding to the value X. */
9373 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9375 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9379 /* VAX floating formats */
9381 /* Non-zero iff TYPE represents one of the special VAX floating-point
9385 ada_is_vax_floating_type (struct type
*type
)
9388 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9391 && (TYPE_CODE (type
) == TYPE_CODE_INT
9392 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9393 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9396 /* The type of special VAX floating-point type this is, assuming
9397 ada_is_vax_floating_point. */
9400 ada_vax_float_type_suffix (struct type
*type
)
9402 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9405 /* A value representing the special debugging function that outputs
9406 VAX floating-point values of the type represented by TYPE. Assumes
9407 ada_is_vax_floating_type (TYPE). */
9410 ada_vax_float_print_function (struct type
*type
)
9412 switch (ada_vax_float_type_suffix (type
))
9415 return get_var_value ("DEBUG_STRING_F", 0);
9417 return get_var_value ("DEBUG_STRING_D", 0);
9419 return get_var_value ("DEBUG_STRING_G", 0);
9421 error (_("invalid VAX floating-point type"));
9428 /* Scan STR beginning at position K for a discriminant name, and
9429 return the value of that discriminant field of DVAL in *PX. If
9430 PNEW_K is not null, put the position of the character beyond the
9431 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9432 not alter *PX and *PNEW_K if unsuccessful. */
9435 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9438 static char *bound_buffer
= NULL
;
9439 static size_t bound_buffer_len
= 0;
9442 struct value
*bound_val
;
9444 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9447 pend
= strstr (str
+ k
, "__");
9451 k
+= strlen (bound
);
9455 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9456 bound
= bound_buffer
;
9457 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9458 bound
[pend
- (str
+ k
)] = '\0';
9462 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9463 if (bound_val
== NULL
)
9466 *px
= value_as_long (bound_val
);
9472 /* Value of variable named NAME in the current environment. If
9473 no such variable found, then if ERR_MSG is null, returns 0, and
9474 otherwise causes an error with message ERR_MSG. */
9476 static struct value
*
9477 get_var_value (char *name
, char *err_msg
)
9479 struct ada_symbol_info
*syms
;
9482 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9487 if (err_msg
== NULL
)
9490 error (("%s"), err_msg
);
9493 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9496 /* Value of integer variable named NAME in the current environment. If
9497 no such variable found, returns 0, and sets *FLAG to 0. If
9498 successful, sets *FLAG to 1. */
9501 get_int_var_value (char *name
, int *flag
)
9503 struct value
*var_val
= get_var_value (name
, 0);
9515 return value_as_long (var_val
);
9520 /* Return a range type whose base type is that of the range type named
9521 NAME in the current environment, and whose bounds are calculated
9522 from NAME according to the GNAT range encoding conventions.
9523 Extract discriminant values, if needed, from DVAL. If a new type
9524 must be created, allocate in OBJFILE's space. The bounds
9525 information, in general, is encoded in NAME, the base type given in
9526 the named range type. */
9528 static struct type
*
9529 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9531 struct type
*raw_type
= ada_find_any_type (name
);
9532 struct type
*base_type
;
9535 if (raw_type
== NULL
)
9536 base_type
= builtin_type_int32
;
9537 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9538 base_type
= TYPE_TARGET_TYPE (raw_type
);
9540 base_type
= raw_type
;
9542 subtype_info
= strstr (name
, "___XD");
9543 if (subtype_info
== NULL
)
9545 LONGEST L
= discrete_type_low_bound (raw_type
);
9546 LONGEST U
= discrete_type_high_bound (raw_type
);
9547 if (L
< INT_MIN
|| U
> INT_MAX
)
9550 return create_range_type (alloc_type (objfile
), raw_type
,
9551 discrete_type_low_bound (raw_type
),
9552 discrete_type_high_bound (raw_type
));
9556 static char *name_buf
= NULL
;
9557 static size_t name_len
= 0;
9558 int prefix_len
= subtype_info
- name
;
9564 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9565 strncpy (name_buf
, name
, prefix_len
);
9566 name_buf
[prefix_len
] = '\0';
9569 bounds_str
= strchr (subtype_info
, '_');
9572 if (*subtype_info
== 'L')
9574 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9575 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9577 if (bounds_str
[n
] == '_')
9579 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9586 strcpy (name_buf
+ prefix_len
, "___L");
9587 L
= get_int_var_value (name_buf
, &ok
);
9590 lim_warning (_("Unknown lower bound, using 1."));
9595 if (*subtype_info
== 'U')
9597 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9598 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9604 strcpy (name_buf
+ prefix_len
, "___U");
9605 U
= get_int_var_value (name_buf
, &ok
);
9608 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9613 if (objfile
== NULL
)
9614 objfile
= TYPE_OBJFILE (base_type
);
9615 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9616 TYPE_NAME (type
) = name
;
9621 /* True iff NAME is the name of a range type. */
9624 ada_is_range_type_name (const char *name
)
9626 return (name
!= NULL
&& strstr (name
, "___XD"));
9632 /* True iff TYPE is an Ada modular type. */
9635 ada_is_modular_type (struct type
*type
)
9637 struct type
*subranged_type
= base_type (type
);
9639 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9640 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9641 && TYPE_UNSIGNED (subranged_type
));
9644 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9647 ada_modulus (struct type
* type
)
9649 return (ULONGEST
) (unsigned int) TYPE_HIGH_BOUND (type
) + 1;
9653 /* Ada exception catchpoint support:
9654 ---------------------------------
9656 We support 3 kinds of exception catchpoints:
9657 . catchpoints on Ada exceptions
9658 . catchpoints on unhandled Ada exceptions
9659 . catchpoints on failed assertions
9661 Exceptions raised during failed assertions, or unhandled exceptions
9662 could perfectly be caught with the general catchpoint on Ada exceptions.
9663 However, we can easily differentiate these two special cases, and having
9664 the option to distinguish these two cases from the rest can be useful
9665 to zero-in on certain situations.
9667 Exception catchpoints are a specialized form of breakpoint,
9668 since they rely on inserting breakpoints inside known routines
9669 of the GNAT runtime. The implementation therefore uses a standard
9670 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9673 Support in the runtime for exception catchpoints have been changed
9674 a few times already, and these changes affect the implementation
9675 of these catchpoints. In order to be able to support several
9676 variants of the runtime, we use a sniffer that will determine
9677 the runtime variant used by the program being debugged.
9679 At this time, we do not support the use of conditions on Ada exception
9680 catchpoints. The COND and COND_STRING fields are therefore set
9681 to NULL (most of the time, see below).
9683 Conditions where EXP_STRING, COND, and COND_STRING are used:
9685 When a user specifies the name of a specific exception in the case
9686 of catchpoints on Ada exceptions, we store the name of that exception
9687 in the EXP_STRING. We then translate this request into an actual
9688 condition stored in COND_STRING, and then parse it into an expression
9691 /* The different types of catchpoints that we introduced for catching
9694 enum exception_catchpoint_kind
9697 ex_catch_exception_unhandled
,
9701 /* Ada's standard exceptions. */
9703 static char *standard_exc
[] = {
9710 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9712 /* A structure that describes how to support exception catchpoints
9713 for a given executable. */
9715 struct exception_support_info
9717 /* The name of the symbol to break on in order to insert
9718 a catchpoint on exceptions. */
9719 const char *catch_exception_sym
;
9721 /* The name of the symbol to break on in order to insert
9722 a catchpoint on unhandled exceptions. */
9723 const char *catch_exception_unhandled_sym
;
9725 /* The name of the symbol to break on in order to insert
9726 a catchpoint on failed assertions. */
9727 const char *catch_assert_sym
;
9729 /* Assuming that the inferior just triggered an unhandled exception
9730 catchpoint, this function is responsible for returning the address
9731 in inferior memory where the name of that exception is stored.
9732 Return zero if the address could not be computed. */
9733 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9736 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9737 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9739 /* The following exception support info structure describes how to
9740 implement exception catchpoints with the latest version of the
9741 Ada runtime (as of 2007-03-06). */
9743 static const struct exception_support_info default_exception_support_info
=
9745 "__gnat_debug_raise_exception", /* catch_exception_sym */
9746 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9747 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9748 ada_unhandled_exception_name_addr
9751 /* The following exception support info structure describes how to
9752 implement exception catchpoints with a slightly older version
9753 of the Ada runtime. */
9755 static const struct exception_support_info exception_support_info_fallback
=
9757 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9758 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9759 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9760 ada_unhandled_exception_name_addr_from_raise
9763 /* For each executable, we sniff which exception info structure to use
9764 and cache it in the following global variable. */
9766 static const struct exception_support_info
*exception_info
= NULL
;
9768 /* Inspect the Ada runtime and determine which exception info structure
9769 should be used to provide support for exception catchpoints.
9771 This function will always set exception_info, or raise an error. */
9774 ada_exception_support_info_sniffer (void)
9778 /* If the exception info is already known, then no need to recompute it. */
9779 if (exception_info
!= NULL
)
9782 /* Check the latest (default) exception support info. */
9783 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9787 exception_info
= &default_exception_support_info
;
9791 /* Try our fallback exception suport info. */
9792 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9796 exception_info
= &exception_support_info_fallback
;
9800 /* Sometimes, it is normal for us to not be able to find the routine
9801 we are looking for. This happens when the program is linked with
9802 the shared version of the GNAT runtime, and the program has not been
9803 started yet. Inform the user of these two possible causes if
9806 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9807 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9809 /* If the symbol does not exist, then check that the program is
9810 already started, to make sure that shared libraries have been
9811 loaded. If it is not started, this may mean that the symbol is
9812 in a shared library. */
9814 if (ptid_get_pid (inferior_ptid
) == 0)
9815 error (_("Unable to insert catchpoint. Try to start the program first."));
9817 /* At this point, we know that we are debugging an Ada program and
9818 that the inferior has been started, but we still are not able to
9819 find the run-time symbols. That can mean that we are in
9820 configurable run time mode, or that a-except as been optimized
9821 out by the linker... In any case, at this point it is not worth
9822 supporting this feature. */
9824 error (_("Cannot insert catchpoints in this configuration."));
9827 /* An observer of "executable_changed" events.
9828 Its role is to clear certain cached values that need to be recomputed
9829 each time a new executable is loaded by GDB. */
9832 ada_executable_changed_observer (void)
9834 /* If the executable changed, then it is possible that the Ada runtime
9835 is different. So we need to invalidate the exception support info
9837 exception_info
= NULL
;
9840 /* Return the name of the function at PC, NULL if could not find it.
9841 This function only checks the debugging information, not the symbol
9845 function_name_from_pc (CORE_ADDR pc
)
9849 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9855 /* True iff FRAME is very likely to be that of a function that is
9856 part of the runtime system. This is all very heuristic, but is
9857 intended to be used as advice as to what frames are uninteresting
9861 is_known_support_routine (struct frame_info
*frame
)
9863 struct symtab_and_line sal
;
9867 /* If this code does not have any debugging information (no symtab),
9868 This cannot be any user code. */
9870 find_frame_sal (frame
, &sal
);
9871 if (sal
.symtab
== NULL
)
9874 /* If there is a symtab, but the associated source file cannot be
9875 located, then assume this is not user code: Selecting a frame
9876 for which we cannot display the code would not be very helpful
9877 for the user. This should also take care of case such as VxWorks
9878 where the kernel has some debugging info provided for a few units. */
9880 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9883 /* Check the unit filename againt the Ada runtime file naming.
9884 We also check the name of the objfile against the name of some
9885 known system libraries that sometimes come with debugging info
9888 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9890 re_comp (known_runtime_file_name_patterns
[i
]);
9891 if (re_exec (sal
.symtab
->filename
))
9893 if (sal
.symtab
->objfile
!= NULL
9894 && re_exec (sal
.symtab
->objfile
->name
))
9898 /* Check whether the function is a GNAT-generated entity. */
9900 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9901 if (func_name
== NULL
)
9904 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9906 re_comp (known_auxiliary_function_name_patterns
[i
]);
9907 if (re_exec (func_name
))
9914 /* Find the first frame that contains debugging information and that is not
9915 part of the Ada run-time, starting from FI and moving upward. */
9918 ada_find_printable_frame (struct frame_info
*fi
)
9920 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9922 if (!is_known_support_routine (fi
))
9931 /* Assuming that the inferior just triggered an unhandled exception
9932 catchpoint, return the address in inferior memory where the name
9933 of the exception is stored.
9935 Return zero if the address could not be computed. */
9938 ada_unhandled_exception_name_addr (void)
9940 return parse_and_eval_address ("e.full_name");
9943 /* Same as ada_unhandled_exception_name_addr, except that this function
9944 should be used when the inferior uses an older version of the runtime,
9945 where the exception name needs to be extracted from a specific frame
9946 several frames up in the callstack. */
9949 ada_unhandled_exception_name_addr_from_raise (void)
9952 struct frame_info
*fi
;
9954 /* To determine the name of this exception, we need to select
9955 the frame corresponding to RAISE_SYM_NAME. This frame is
9956 at least 3 levels up, so we simply skip the first 3 frames
9957 without checking the name of their associated function. */
9958 fi
= get_current_frame ();
9959 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9961 fi
= get_prev_frame (fi
);
9965 const char *func_name
=
9966 function_name_from_pc (get_frame_address_in_block (fi
));
9967 if (func_name
!= NULL
9968 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9969 break; /* We found the frame we were looking for... */
9970 fi
= get_prev_frame (fi
);
9977 return parse_and_eval_address ("id.full_name");
9980 /* Assuming the inferior just triggered an Ada exception catchpoint
9981 (of any type), return the address in inferior memory where the name
9982 of the exception is stored, if applicable.
9984 Return zero if the address could not be computed, or if not relevant. */
9987 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9988 struct breakpoint
*b
)
9992 case ex_catch_exception
:
9993 return (parse_and_eval_address ("e.full_name"));
9996 case ex_catch_exception_unhandled
:
9997 return exception_info
->unhandled_exception_name_addr ();
10000 case ex_catch_assert
:
10001 return 0; /* Exception name is not relevant in this case. */
10005 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10009 return 0; /* Should never be reached. */
10012 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10013 any error that ada_exception_name_addr_1 might cause to be thrown.
10014 When an error is intercepted, a warning with the error message is printed,
10015 and zero is returned. */
10018 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10019 struct breakpoint
*b
)
10021 struct gdb_exception e
;
10022 CORE_ADDR result
= 0;
10024 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10026 result
= ada_exception_name_addr_1 (ex
, b
);
10031 warning (_("failed to get exception name: %s"), e
.message
);
10038 /* Implement the PRINT_IT method in the breakpoint_ops structure
10039 for all exception catchpoint kinds. */
10041 static enum print_stop_action
10042 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10044 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10045 char exception_name
[256];
10049 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10050 exception_name
[sizeof (exception_name
) - 1] = '\0';
10053 ada_find_printable_frame (get_current_frame ());
10055 annotate_catchpoint (b
->number
);
10058 case ex_catch_exception
:
10060 printf_filtered (_("\nCatchpoint %d, %s at "),
10061 b
->number
, exception_name
);
10063 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10065 case ex_catch_exception_unhandled
:
10067 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10068 b
->number
, exception_name
);
10070 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10073 case ex_catch_assert
:
10074 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10079 return PRINT_SRC_AND_LOC
;
10082 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10083 for all exception catchpoint kinds. */
10086 print_one_exception (enum exception_catchpoint_kind ex
,
10087 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10089 struct value_print_options opts
;
10091 get_user_print_options (&opts
);
10092 if (opts
.addressprint
)
10094 annotate_field (4);
10095 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10098 annotate_field (5);
10099 *last_addr
= b
->loc
->address
;
10102 case ex_catch_exception
:
10103 if (b
->exp_string
!= NULL
)
10105 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10107 ui_out_field_string (uiout
, "what", msg
);
10111 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10115 case ex_catch_exception_unhandled
:
10116 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10119 case ex_catch_assert
:
10120 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10124 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10129 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10130 for all exception catchpoint kinds. */
10133 print_mention_exception (enum exception_catchpoint_kind ex
,
10134 struct breakpoint
*b
)
10138 case ex_catch_exception
:
10139 if (b
->exp_string
!= NULL
)
10140 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10141 b
->number
, b
->exp_string
);
10143 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10147 case ex_catch_exception_unhandled
:
10148 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10152 case ex_catch_assert
:
10153 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10157 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10162 /* Virtual table for "catch exception" breakpoints. */
10164 static enum print_stop_action
10165 print_it_catch_exception (struct breakpoint
*b
)
10167 return print_it_exception (ex_catch_exception
, b
);
10171 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10173 print_one_exception (ex_catch_exception
, b
, last_addr
);
10177 print_mention_catch_exception (struct breakpoint
*b
)
10179 print_mention_exception (ex_catch_exception
, b
);
10182 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10186 NULL
, /* breakpoint_hit */
10187 print_it_catch_exception
,
10188 print_one_catch_exception
,
10189 print_mention_catch_exception
10192 /* Virtual table for "catch exception unhandled" breakpoints. */
10194 static enum print_stop_action
10195 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10197 return print_it_exception (ex_catch_exception_unhandled
, b
);
10201 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10203 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10207 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10209 print_mention_exception (ex_catch_exception_unhandled
, b
);
10212 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10215 NULL
, /* breakpoint_hit */
10216 print_it_catch_exception_unhandled
,
10217 print_one_catch_exception_unhandled
,
10218 print_mention_catch_exception_unhandled
10221 /* Virtual table for "catch assert" breakpoints. */
10223 static enum print_stop_action
10224 print_it_catch_assert (struct breakpoint
*b
)
10226 return print_it_exception (ex_catch_assert
, b
);
10230 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10232 print_one_exception (ex_catch_assert
, b
, last_addr
);
10236 print_mention_catch_assert (struct breakpoint
*b
)
10238 print_mention_exception (ex_catch_assert
, b
);
10241 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10244 NULL
, /* breakpoint_hit */
10245 print_it_catch_assert
,
10246 print_one_catch_assert
,
10247 print_mention_catch_assert
10250 /* Return non-zero if B is an Ada exception catchpoint. */
10253 ada_exception_catchpoint_p (struct breakpoint
*b
)
10255 return (b
->ops
== &catch_exception_breakpoint_ops
10256 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10257 || b
->ops
== &catch_assert_breakpoint_ops
);
10260 /* Return a newly allocated copy of the first space-separated token
10261 in ARGSP, and then adjust ARGSP to point immediately after that
10264 Return NULL if ARGPS does not contain any more tokens. */
10267 ada_get_next_arg (char **argsp
)
10269 char *args
= *argsp
;
10273 /* Skip any leading white space. */
10275 while (isspace (*args
))
10278 if (args
[0] == '\0')
10279 return NULL
; /* No more arguments. */
10281 /* Find the end of the current argument. */
10284 while (*end
!= '\0' && !isspace (*end
))
10287 /* Adjust ARGSP to point to the start of the next argument. */
10291 /* Make a copy of the current argument and return it. */
10293 result
= xmalloc (end
- args
+ 1);
10294 strncpy (result
, args
, end
- args
);
10295 result
[end
- args
] = '\0';
10300 /* Split the arguments specified in a "catch exception" command.
10301 Set EX to the appropriate catchpoint type.
10302 Set EXP_STRING to the name of the specific exception if
10303 specified by the user. */
10306 catch_ada_exception_command_split (char *args
,
10307 enum exception_catchpoint_kind
*ex
,
10310 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10311 char *exception_name
;
10313 exception_name
= ada_get_next_arg (&args
);
10314 make_cleanup (xfree
, exception_name
);
10316 /* Check that we do not have any more arguments. Anything else
10319 while (isspace (*args
))
10322 if (args
[0] != '\0')
10323 error (_("Junk at end of expression"));
10325 discard_cleanups (old_chain
);
10327 if (exception_name
== NULL
)
10329 /* Catch all exceptions. */
10330 *ex
= ex_catch_exception
;
10331 *exp_string
= NULL
;
10333 else if (strcmp (exception_name
, "unhandled") == 0)
10335 /* Catch unhandled exceptions. */
10336 *ex
= ex_catch_exception_unhandled
;
10337 *exp_string
= NULL
;
10341 /* Catch a specific exception. */
10342 *ex
= ex_catch_exception
;
10343 *exp_string
= exception_name
;
10347 /* Return the name of the symbol on which we should break in order to
10348 implement a catchpoint of the EX kind. */
10350 static const char *
10351 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10353 gdb_assert (exception_info
!= NULL
);
10357 case ex_catch_exception
:
10358 return (exception_info
->catch_exception_sym
);
10360 case ex_catch_exception_unhandled
:
10361 return (exception_info
->catch_exception_unhandled_sym
);
10363 case ex_catch_assert
:
10364 return (exception_info
->catch_assert_sym
);
10367 internal_error (__FILE__
, __LINE__
,
10368 _("unexpected catchpoint kind (%d)"), ex
);
10372 /* Return the breakpoint ops "virtual table" used for catchpoints
10375 static struct breakpoint_ops
*
10376 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10380 case ex_catch_exception
:
10381 return (&catch_exception_breakpoint_ops
);
10383 case ex_catch_exception_unhandled
:
10384 return (&catch_exception_unhandled_breakpoint_ops
);
10386 case ex_catch_assert
:
10387 return (&catch_assert_breakpoint_ops
);
10390 internal_error (__FILE__
, __LINE__
,
10391 _("unexpected catchpoint kind (%d)"), ex
);
10395 /* Return the condition that will be used to match the current exception
10396 being raised with the exception that the user wants to catch. This
10397 assumes that this condition is used when the inferior just triggered
10398 an exception catchpoint.
10400 The string returned is a newly allocated string that needs to be
10401 deallocated later. */
10404 ada_exception_catchpoint_cond_string (const char *exp_string
)
10408 /* The standard exceptions are a special case. They are defined in
10409 runtime units that have been compiled without debugging info; if
10410 EXP_STRING is the not-fully-qualified name of a standard
10411 exception (e.g. "constraint_error") then, during the evaluation
10412 of the condition expression, the symbol lookup on this name would
10413 *not* return this standard exception. The catchpoint condition
10414 may then be set only on user-defined exceptions which have the
10415 same not-fully-qualified name (e.g. my_package.constraint_error).
10417 To avoid this unexcepted behavior, these standard exceptions are
10418 systematically prefixed by "standard". This means that "catch
10419 exception constraint_error" is rewritten into "catch exception
10420 standard.constraint_error".
10422 If an exception named contraint_error is defined in another package of
10423 the inferior program, then the only way to specify this exception as a
10424 breakpoint condition is to use its fully-qualified named:
10425 e.g. my_package.constraint_error. */
10427 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10429 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10431 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10435 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10438 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10440 static struct expression
*
10441 ada_parse_catchpoint_condition (char *cond_string
,
10442 struct symtab_and_line sal
)
10444 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10447 /* Return the symtab_and_line that should be used to insert an exception
10448 catchpoint of the TYPE kind.
10450 EX_STRING should contain the name of a specific exception
10451 that the catchpoint should catch, or NULL otherwise.
10453 The idea behind all the remaining parameters is that their names match
10454 the name of certain fields in the breakpoint structure that are used to
10455 handle exception catchpoints. This function returns the value to which
10456 these fields should be set, depending on the type of catchpoint we need
10459 If COND and COND_STRING are both non-NULL, any value they might
10460 hold will be free'ed, and then replaced by newly allocated ones.
10461 These parameters are left untouched otherwise. */
10463 static struct symtab_and_line
10464 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10465 char **addr_string
, char **cond_string
,
10466 struct expression
**cond
, struct breakpoint_ops
**ops
)
10468 const char *sym_name
;
10469 struct symbol
*sym
;
10470 struct symtab_and_line sal
;
10472 /* First, find out which exception support info to use. */
10473 ada_exception_support_info_sniffer ();
10475 /* Then lookup the function on which we will break in order to catch
10476 the Ada exceptions requested by the user. */
10478 sym_name
= ada_exception_sym_name (ex
);
10479 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10481 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10482 that should be compiled with debugging information. As a result, we
10483 expect to find that symbol in the symtabs. If we don't find it, then
10484 the target most likely does not support Ada exceptions, or we cannot
10485 insert exception breakpoints yet, because the GNAT runtime hasn't been
10488 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10489 in such a way that no debugging information is produced for the symbol
10490 we are looking for. In this case, we could search the minimal symbols
10491 as a fall-back mechanism. This would still be operating in degraded
10492 mode, however, as we would still be missing the debugging information
10493 that is needed in order to extract the name of the exception being
10494 raised (this name is printed in the catchpoint message, and is also
10495 used when trying to catch a specific exception). We do not handle
10496 this case for now. */
10499 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10501 /* Make sure that the symbol we found corresponds to a function. */
10502 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10503 error (_("Symbol \"%s\" is not a function (class = %d)"),
10504 sym_name
, SYMBOL_CLASS (sym
));
10506 sal
= find_function_start_sal (sym
, 1);
10508 /* Set ADDR_STRING. */
10510 *addr_string
= xstrdup (sym_name
);
10512 /* Set the COND and COND_STRING (if not NULL). */
10514 if (cond_string
!= NULL
&& cond
!= NULL
)
10516 if (*cond_string
!= NULL
)
10518 xfree (*cond_string
);
10519 *cond_string
= NULL
;
10526 if (exp_string
!= NULL
)
10528 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10529 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10534 *ops
= ada_exception_breakpoint_ops (ex
);
10539 /* Parse the arguments (ARGS) of the "catch exception" command.
10541 Set TYPE to the appropriate exception catchpoint type.
10542 If the user asked the catchpoint to catch only a specific
10543 exception, then save the exception name in ADDR_STRING.
10545 See ada_exception_sal for a description of all the remaining
10546 function arguments of this function. */
10548 struct symtab_and_line
10549 ada_decode_exception_location (char *args
, char **addr_string
,
10550 char **exp_string
, char **cond_string
,
10551 struct expression
**cond
,
10552 struct breakpoint_ops
**ops
)
10554 enum exception_catchpoint_kind ex
;
10556 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10557 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10561 struct symtab_and_line
10562 ada_decode_assert_location (char *args
, char **addr_string
,
10563 struct breakpoint_ops
**ops
)
10565 /* Check that no argument where provided at the end of the command. */
10569 while (isspace (*args
))
10572 error (_("Junk at end of arguments."));
10575 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10580 /* Information about operators given special treatment in functions
10582 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10584 #define ADA_OPERATORS \
10585 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10586 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10587 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10588 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10589 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10590 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10591 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10592 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10593 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10594 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10595 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10596 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10597 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10598 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10599 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10600 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10601 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10602 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10603 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10606 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10608 switch (exp
->elts
[pc
- 1].opcode
)
10611 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10614 #define OP_DEFN(op, len, args, binop) \
10615 case op: *oplenp = len; *argsp = args; break;
10621 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10626 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10632 ada_op_name (enum exp_opcode opcode
)
10637 return op_name_standard (opcode
);
10639 #define OP_DEFN(op, len, args, binop) case op: return #op;
10644 return "OP_AGGREGATE";
10646 return "OP_CHOICES";
10652 /* As for operator_length, but assumes PC is pointing at the first
10653 element of the operator, and gives meaningful results only for the
10654 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10657 ada_forward_operator_length (struct expression
*exp
, int pc
,
10658 int *oplenp
, int *argsp
)
10660 switch (exp
->elts
[pc
].opcode
)
10663 *oplenp
= *argsp
= 0;
10666 #define OP_DEFN(op, len, args, binop) \
10667 case op: *oplenp = len; *argsp = args; break;
10673 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10678 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10684 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10685 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10693 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10695 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10700 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10704 /* Ada attributes ('Foo). */
10707 case OP_ATR_LENGTH
:
10711 case OP_ATR_MODULUS
:
10718 case UNOP_IN_RANGE
:
10720 /* XXX: gdb_sprint_host_address, type_sprint */
10721 fprintf_filtered (stream
, _("Type @"));
10722 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10723 fprintf_filtered (stream
, " (");
10724 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10725 fprintf_filtered (stream
, ")");
10727 case BINOP_IN_BOUNDS
:
10728 fprintf_filtered (stream
, " (%d)",
10729 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10731 case TERNOP_IN_RANGE
:
10736 case OP_DISCRETE_RANGE
:
10737 case OP_POSITIONAL
:
10744 char *name
= &exp
->elts
[elt
+ 2].string
;
10745 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10746 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10751 return dump_subexp_body_standard (exp
, stream
, elt
);
10755 for (i
= 0; i
< nargs
; i
+= 1)
10756 elt
= dump_subexp (exp
, stream
, elt
);
10761 /* The Ada extension of print_subexp (q.v.). */
10764 ada_print_subexp (struct expression
*exp
, int *pos
,
10765 struct ui_file
*stream
, enum precedence prec
)
10767 int oplen
, nargs
, i
;
10769 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10771 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10778 print_subexp_standard (exp
, pos
, stream
, prec
);
10782 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10785 case BINOP_IN_BOUNDS
:
10786 /* XXX: sprint_subexp */
10787 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10788 fputs_filtered (" in ", stream
);
10789 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10790 fputs_filtered ("'range", stream
);
10791 if (exp
->elts
[pc
+ 1].longconst
> 1)
10792 fprintf_filtered (stream
, "(%ld)",
10793 (long) exp
->elts
[pc
+ 1].longconst
);
10796 case TERNOP_IN_RANGE
:
10797 if (prec
>= PREC_EQUAL
)
10798 fputs_filtered ("(", stream
);
10799 /* XXX: sprint_subexp */
10800 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10801 fputs_filtered (" in ", stream
);
10802 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10803 fputs_filtered (" .. ", stream
);
10804 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10805 if (prec
>= PREC_EQUAL
)
10806 fputs_filtered (")", stream
);
10811 case OP_ATR_LENGTH
:
10815 case OP_ATR_MODULUS
:
10820 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10822 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10823 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10827 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10828 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10832 for (tem
= 1; tem
< nargs
; tem
+= 1)
10834 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10835 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10837 fputs_filtered (")", stream
);
10842 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10843 fputs_filtered ("'(", stream
);
10844 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10845 fputs_filtered (")", stream
);
10848 case UNOP_IN_RANGE
:
10849 /* XXX: sprint_subexp */
10850 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10851 fputs_filtered (" in ", stream
);
10852 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10855 case OP_DISCRETE_RANGE
:
10856 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10857 fputs_filtered ("..", stream
);
10858 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10862 fputs_filtered ("others => ", stream
);
10863 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10867 for (i
= 0; i
< nargs
-1; i
+= 1)
10870 fputs_filtered ("|", stream
);
10871 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10873 fputs_filtered (" => ", stream
);
10874 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10877 case OP_POSITIONAL
:
10878 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10882 fputs_filtered ("(", stream
);
10883 for (i
= 0; i
< nargs
; i
+= 1)
10886 fputs_filtered (", ", stream
);
10887 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10889 fputs_filtered (")", stream
);
10894 /* Table mapping opcodes into strings for printing operators
10895 and precedences of the operators. */
10897 static const struct op_print ada_op_print_tab
[] = {
10898 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10899 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10900 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10901 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10902 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10903 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10904 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10905 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10906 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10907 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10908 {">", BINOP_GTR
, PREC_ORDER
, 0},
10909 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10910 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10911 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10912 {"+", BINOP_ADD
, PREC_ADD
, 0},
10913 {"-", BINOP_SUB
, PREC_ADD
, 0},
10914 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10915 {"*", BINOP_MUL
, PREC_MUL
, 0},
10916 {"/", BINOP_DIV
, PREC_MUL
, 0},
10917 {"rem", BINOP_REM
, PREC_MUL
, 0},
10918 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10919 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10920 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10921 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10922 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10923 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10924 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10925 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10926 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10927 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10928 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10932 enum ada_primitive_types
{
10933 ada_primitive_type_int
,
10934 ada_primitive_type_long
,
10935 ada_primitive_type_short
,
10936 ada_primitive_type_char
,
10937 ada_primitive_type_float
,
10938 ada_primitive_type_double
,
10939 ada_primitive_type_void
,
10940 ada_primitive_type_long_long
,
10941 ada_primitive_type_long_double
,
10942 ada_primitive_type_natural
,
10943 ada_primitive_type_positive
,
10944 ada_primitive_type_system_address
,
10945 nr_ada_primitive_types
10949 ada_language_arch_info (struct gdbarch
*gdbarch
,
10950 struct language_arch_info
*lai
)
10952 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10953 lai
->primitive_type_vector
10954 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10956 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10957 init_type (TYPE_CODE_INT
,
10958 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10959 0, "integer", (struct objfile
*) NULL
);
10960 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10961 init_type (TYPE_CODE_INT
,
10962 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10963 0, "long_integer", (struct objfile
*) NULL
);
10964 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10965 init_type (TYPE_CODE_INT
,
10966 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10967 0, "short_integer", (struct objfile
*) NULL
);
10968 lai
->string_char_type
=
10969 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10970 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10971 0, "character", (struct objfile
*) NULL
);
10972 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10973 init_type (TYPE_CODE_FLT
,
10974 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10975 0, "float", (struct objfile
*) NULL
);
10976 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10977 init_type (TYPE_CODE_FLT
,
10978 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10979 0, "long_float", (struct objfile
*) NULL
);
10980 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10981 init_type (TYPE_CODE_INT
,
10982 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10983 0, "long_long_integer", (struct objfile
*) NULL
);
10984 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10985 init_type (TYPE_CODE_FLT
,
10986 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10987 0, "long_long_float", (struct objfile
*) NULL
);
10988 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10989 init_type (TYPE_CODE_INT
,
10990 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10991 0, "natural", (struct objfile
*) NULL
);
10992 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10993 init_type (TYPE_CODE_INT
,
10994 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10995 0, "positive", (struct objfile
*) NULL
);
10996 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10998 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10999 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
11000 (struct objfile
*) NULL
));
11001 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11002 = "system__address";
11004 lai
->bool_type_symbol
= "boolean";
11005 lai
->bool_type_default
= builtin
->builtin_bool
;
11008 /* Language vector */
11010 /* Not really used, but needed in the ada_language_defn. */
11013 emit_char (int c
, struct ui_file
*stream
, int quoter
)
11015 ada_emit_char (c
, stream
, quoter
, 1);
11021 warnings_issued
= 0;
11022 return ada_parse ();
11025 static const struct exp_descriptor ada_exp_descriptor
= {
11027 ada_operator_length
,
11029 ada_dump_subexp_body
,
11030 ada_evaluate_subexp
11033 const struct language_defn ada_language_defn
= {
11034 "ada", /* Language name */
11038 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11039 that's not quite what this means. */
11041 macro_expansion_no
,
11042 &ada_exp_descriptor
,
11046 ada_printchar
, /* Print a character constant */
11047 ada_printstr
, /* Function to print string constant */
11048 emit_char
, /* Function to print single char (not used) */
11049 ada_print_type
, /* Print a type using appropriate syntax */
11050 default_print_typedef
, /* Print a typedef using appropriate syntax */
11051 ada_val_print
, /* Print a value using appropriate syntax */
11052 ada_value_print
, /* Print a top-level value */
11053 NULL
, /* Language specific skip_trampoline */
11054 NULL
, /* name_of_this */
11055 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11056 basic_lookup_transparent_type
, /* lookup_transparent_type */
11057 ada_la_decode
, /* Language specific symbol demangler */
11058 NULL
, /* Language specific class_name_from_physname */
11059 ada_op_print_tab
, /* expression operators for printing */
11060 0, /* c-style arrays */
11061 1, /* String lower bound */
11062 ada_get_gdb_completer_word_break_characters
,
11063 ada_make_symbol_completion_list
,
11064 ada_language_arch_info
,
11065 ada_print_array_index
,
11066 default_pass_by_reference
,
11071 _initialize_ada_language (void)
11073 add_language (&ada_language_defn
);
11075 varsize_limit
= 65536;
11077 obstack_init (&symbol_list_obstack
);
11079 decoded_names_store
= htab_create_alloc
11080 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11081 NULL
, xcalloc
, xfree
);
11083 observer_attach_executable_changed (ada_executable_changed_observer
);