1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
60 /* Define whether or not the C operator '/' truncates towards zero for
61 differently signed operands (truncation direction is undefined in C).
62 Copied from valarith.c. */
64 #ifndef TRUNCATION_TOWARDS_ZERO
65 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
68 static void extract_string (CORE_ADDR addr
, char *buf
);
70 static void modify_general_field (char *, LONGEST
, int, int);
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_target_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 value
*resolve_subexp (struct expression
**, int *, int,
132 static void replace_operator_with_call (struct expression
**, int, int, int,
133 struct symbol
*, struct block
*);
135 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
137 static char *ada_op_name (enum exp_opcode
);
139 static const char *ada_decoded_op_name (enum exp_opcode
);
141 static int numeric_type_p (struct type
*);
143 static int integer_type_p (struct type
*);
145 static int scalar_type_p (struct type
*);
147 static int discrete_type_p (struct type
*);
149 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
154 static struct symbol
*find_old_style_renaming_symbol (const char *,
157 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
160 static struct value
*evaluate_subexp_type (struct expression
*, int *);
162 static int is_dynamic_field (struct type
*, int);
164 static struct type
*to_fixed_variant_branch_type (struct type
*,
166 CORE_ADDR
, struct value
*);
168 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
170 static struct type
*to_fixed_range_type (char *, struct value
*,
173 static struct type
*to_static_fixed_type (struct type
*);
174 static struct type
*static_unwrap_type (struct type
*type
);
176 static struct value
*unwrap_value (struct value
*);
178 static struct type
*packed_array_type (struct type
*, long *);
180 static struct type
*decode_packed_array_type (struct type
*);
182 static struct value
*decode_packed_array (struct value
*);
184 static struct value
*value_subscript_packed (struct value
*, int,
187 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
189 static struct value
*coerce_unspec_val_to_type (struct value
*,
192 static struct value
*get_var_value (char *, char *);
194 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
196 static int equiv_types (struct type
*, struct type
*);
198 static int is_name_suffix (const char *);
200 static int wild_match (const char *, int, const char *);
202 static struct value
*ada_coerce_ref (struct value
*);
204 static LONGEST
pos_atr (struct value
*);
206 static struct value
*value_pos_atr (struct type
*, struct value
*);
208 static struct value
*value_val_atr (struct type
*, struct value
*);
210 static struct symbol
*standard_lookup (const char *, const struct block
*,
213 static struct value
*ada_search_struct_field (char *, struct value
*, int,
216 static struct value
*ada_value_primitive_field (struct value
*, int, int,
219 static int find_struct_field (char *, struct type
*, int,
220 struct type
**, int *, int *, int *, int *);
222 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
225 static struct value
*ada_to_fixed_value (struct value
*);
227 static int ada_resolve_function (struct ada_symbol_info
*, int,
228 struct value
**, int, const char *,
231 static struct value
*ada_coerce_to_simple_array (struct value
*);
233 static int ada_is_direct_array_type (struct type
*);
235 static void ada_language_arch_info (struct gdbarch
*,
236 struct language_arch_info
*);
238 static void check_size (const struct type
*);
240 static struct value
*ada_index_struct_field (int, struct value
*, int,
243 static struct value
*assign_aggregate (struct value
*, struct value
*,
244 struct expression
*, int *, enum noside
);
246 static void aggregate_assign_from_choices (struct value
*, struct value
*,
248 int *, LONGEST
*, int *,
249 int, LONGEST
, LONGEST
);
251 static void aggregate_assign_positional (struct value
*, struct value
*,
253 int *, LONGEST
*, int *, int,
257 static void aggregate_assign_others (struct value
*, struct value
*,
259 int *, LONGEST
*, int, LONGEST
, LONGEST
);
262 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
265 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
268 static void ada_forward_operator_length (struct expression
*, int, int *,
273 /* Maximum-sized dynamic type. */
274 static unsigned int varsize_limit
;
276 /* FIXME: brobecker/2003-09-17: No longer a const because it is
277 returned by a function that does not return a const char *. */
278 static char *ada_completer_word_break_characters
=
280 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
282 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
285 /* The name of the symbol to use to get the name of the main subprogram. */
286 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
287 = "__gnat_ada_main_program_name";
289 /* Limit on the number of warnings to raise per expression evaluation. */
290 static int warning_limit
= 2;
292 /* Number of warning messages issued; reset to 0 by cleanups after
293 expression evaluation. */
294 static int warnings_issued
= 0;
296 static const char *known_runtime_file_name_patterns
[] = {
297 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
300 static const char *known_auxiliary_function_name_patterns
[] = {
301 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
304 /* Space for allocating results of ada_lookup_symbol_list. */
305 static struct obstack symbol_list_obstack
;
309 /* Given DECODED_NAME a string holding a symbol name in its
310 decoded form (ie using the Ada dotted notation), returns
311 its unqualified name. */
314 ada_unqualified_name (const char *decoded_name
)
316 const char *result
= strrchr (decoded_name
, '.');
319 result
++; /* Skip the dot... */
321 result
= decoded_name
;
326 /* Return a string starting with '<', followed by STR, and '>'.
327 The result is good until the next call. */
330 add_angle_brackets (const char *str
)
332 static char *result
= NULL
;
335 result
= xstrprintf ("<%s>", str
);
340 ada_get_gdb_completer_word_break_characters (void)
342 return ada_completer_word_break_characters
;
345 /* Print an array element index using the Ada syntax. */
348 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
349 const struct value_print_options
*options
)
351 LA_VALUE_PRINT (index_value
, stream
, options
);
352 fprintf_filtered (stream
, " => ");
355 /* Read the string located at ADDR from the inferior and store the
359 extract_string (CORE_ADDR addr
, char *buf
)
363 /* Loop, reading one byte at a time, until we reach the '\000'
364 end-of-string marker. */
367 target_read_memory (addr
+ char_index
* sizeof (char),
368 buf
+ char_index
* sizeof (char), sizeof (char));
371 while (buf
[char_index
- 1] != '\000');
374 /* Assuming VECT points to an array of *SIZE objects of size
375 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
376 updating *SIZE as necessary and returning the (new) array. */
379 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
381 if (*size
< min_size
)
384 if (*size
< min_size
)
386 vect
= xrealloc (vect
, *size
* element_size
);
391 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
392 suffix of FIELD_NAME beginning "___". */
395 field_name_match (const char *field_name
, const char *target
)
397 int len
= strlen (target
);
399 (strncmp (field_name
, target
, len
) == 0
400 && (field_name
[len
] == '\0'
401 || (strncmp (field_name
+ len
, "___", 3) == 0
402 && strcmp (field_name
+ strlen (field_name
) - 6,
407 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
408 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
409 and return its index. This function also handles fields whose name
410 have ___ suffixes because the compiler sometimes alters their name
411 by adding such a suffix to represent fields with certain constraints.
412 If the field could not be found, return a negative number if
413 MAYBE_MISSING is set. Otherwise raise an error. */
416 ada_get_field_index (const struct type
*type
, const char *field_name
,
420 struct type
*struct_type
= check_typedef ((struct type
*) type
);
422 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
423 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
427 error (_("Unable to find field %s in struct %s. Aborting"),
428 field_name
, TYPE_NAME (struct_type
));
433 /* The length of the prefix of NAME prior to any "___" suffix. */
436 ada_name_prefix_len (const char *name
)
442 const char *p
= strstr (name
, "___");
444 return strlen (name
);
450 /* Return non-zero if SUFFIX is a suffix of STR.
451 Return zero if STR is null. */
454 is_suffix (const char *str
, const char *suffix
)
460 len2
= strlen (suffix
);
461 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
464 /* The contents of value VAL, treated as a value of type TYPE. The
465 result is an lval in memory if VAL is. */
467 static struct value
*
468 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
470 type
= ada_check_typedef (type
);
471 if (value_type (val
) == type
)
475 struct value
*result
;
477 /* Make sure that the object size is not unreasonable before
478 trying to allocate some memory for it. */
481 result
= allocate_value (type
);
482 set_value_component_location (result
, val
);
483 set_value_bitsize (result
, value_bitsize (val
));
484 set_value_bitpos (result
, value_bitpos (val
));
485 set_value_address (result
, value_address (val
));
487 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
488 set_value_lazy (result
, 1);
490 memcpy (value_contents_raw (result
), value_contents (val
),
496 static const gdb_byte
*
497 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
502 return valaddr
+ offset
;
506 cond_offset_target (CORE_ADDR address
, long offset
)
511 return address
+ offset
;
514 /* Issue a warning (as for the definition of warning in utils.c, but
515 with exactly one argument rather than ...), unless the limit on the
516 number of warnings has passed during the evaluation of the current
519 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
520 provided by "complaint". */
521 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
524 lim_warning (const char *format
, ...)
527 va_start (args
, format
);
529 warnings_issued
+= 1;
530 if (warnings_issued
<= warning_limit
)
531 vwarning (format
, args
);
536 /* Issue an error if the size of an object of type T is unreasonable,
537 i.e. if it would be a bad idea to allocate a value of this type in
541 check_size (const struct type
*type
)
543 if (TYPE_LENGTH (type
) > varsize_limit
)
544 error (_("object size is larger than varsize-limit"));
548 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
549 gdbtypes.h, but some of the necessary definitions in that file
550 seem to have gone missing. */
552 /* Maximum value of a SIZE-byte signed integer type. */
554 max_of_size (int size
)
556 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
557 return top_bit
| (top_bit
- 1);
560 /* Minimum value of a SIZE-byte signed integer type. */
562 min_of_size (int size
)
564 return -max_of_size (size
) - 1;
567 /* Maximum value of a SIZE-byte unsigned integer type. */
569 umax_of_size (int size
)
571 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
572 return top_bit
| (top_bit
- 1);
575 /* Maximum value of integral type T, as a signed quantity. */
577 max_of_type (struct type
*t
)
579 if (TYPE_UNSIGNED (t
))
580 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
582 return max_of_size (TYPE_LENGTH (t
));
585 /* Minimum value of integral type T, as a signed quantity. */
587 min_of_type (struct type
*t
)
589 if (TYPE_UNSIGNED (t
))
592 return min_of_size (TYPE_LENGTH (t
));
595 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
597 discrete_type_high_bound (struct type
*type
)
599 switch (TYPE_CODE (type
))
601 case TYPE_CODE_RANGE
:
602 return TYPE_HIGH_BOUND (type
);
604 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
609 return max_of_type (type
);
611 error (_("Unexpected type in discrete_type_high_bound."));
615 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
617 discrete_type_low_bound (struct type
*type
)
619 switch (TYPE_CODE (type
))
621 case TYPE_CODE_RANGE
:
622 return TYPE_LOW_BOUND (type
);
624 return TYPE_FIELD_BITPOS (type
, 0);
629 return min_of_type (type
);
631 error (_("Unexpected type in discrete_type_low_bound."));
635 /* The identity on non-range types. For range types, the underlying
636 non-range scalar type. */
639 base_type (struct type
*type
)
641 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
643 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
645 type
= TYPE_TARGET_TYPE (type
);
651 /* Language Selection */
653 /* If the main program is in Ada, return language_ada, otherwise return LANG
654 (the main program is in Ada iif the adainit symbol is found).
656 MAIN_PST is not used. */
659 ada_update_initial_language (enum language lang
,
660 struct partial_symtab
*main_pst
)
662 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
663 (struct objfile
*) NULL
) != NULL
)
669 /* If the main procedure is written in Ada, then return its name.
670 The result is good until the next call. Return NULL if the main
671 procedure doesn't appear to be in Ada. */
676 struct minimal_symbol
*msym
;
677 static char *main_program_name
= NULL
;
679 /* For Ada, the name of the main procedure is stored in a specific
680 string constant, generated by the binder. Look for that symbol,
681 extract its address, and then read that string. If we didn't find
682 that string, then most probably the main procedure is not written
684 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
688 CORE_ADDR main_program_name_addr
;
691 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
692 if (main_program_name_addr
== 0)
693 error (_("Invalid address for Ada main program name."));
695 xfree (main_program_name
);
696 target_read_string (main_program_name_addr
, &main_program_name
,
701 return main_program_name
;
704 /* The main procedure doesn't seem to be in Ada. */
710 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
713 const struct ada_opname_map ada_opname_table
[] = {
714 {"Oadd", "\"+\"", BINOP_ADD
},
715 {"Osubtract", "\"-\"", BINOP_SUB
},
716 {"Omultiply", "\"*\"", BINOP_MUL
},
717 {"Odivide", "\"/\"", BINOP_DIV
},
718 {"Omod", "\"mod\"", BINOP_MOD
},
719 {"Orem", "\"rem\"", BINOP_REM
},
720 {"Oexpon", "\"**\"", BINOP_EXP
},
721 {"Olt", "\"<\"", BINOP_LESS
},
722 {"Ole", "\"<=\"", BINOP_LEQ
},
723 {"Ogt", "\">\"", BINOP_GTR
},
724 {"Oge", "\">=\"", BINOP_GEQ
},
725 {"Oeq", "\"=\"", BINOP_EQUAL
},
726 {"One", "\"/=\"", BINOP_NOTEQUAL
},
727 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
728 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
729 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
730 {"Oconcat", "\"&\"", BINOP_CONCAT
},
731 {"Oabs", "\"abs\"", UNOP_ABS
},
732 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
733 {"Oadd", "\"+\"", UNOP_PLUS
},
734 {"Osubtract", "\"-\"", UNOP_NEG
},
738 /* The "encoded" form of DECODED, according to GNAT conventions.
739 The result is valid until the next call to ada_encode. */
742 ada_encode (const char *decoded
)
744 static char *encoding_buffer
= NULL
;
745 static size_t encoding_buffer_size
= 0;
752 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
753 2 * strlen (decoded
) + 10);
756 for (p
= decoded
; *p
!= '\0'; p
+= 1)
760 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
765 const struct ada_opname_map
*mapping
;
767 for (mapping
= ada_opname_table
;
768 mapping
->encoded
!= NULL
769 && strncmp (mapping
->decoded
, p
,
770 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
772 if (mapping
->encoded
== NULL
)
773 error (_("invalid Ada operator name: %s"), p
);
774 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
775 k
+= strlen (mapping
->encoded
);
780 encoding_buffer
[k
] = *p
;
785 encoding_buffer
[k
] = '\0';
786 return encoding_buffer
;
789 /* Return NAME folded to lower case, or, if surrounded by single
790 quotes, unfolded, but with the quotes stripped away. Result good
794 ada_fold_name (const char *name
)
796 static char *fold_buffer
= NULL
;
797 static size_t fold_buffer_size
= 0;
799 int len
= strlen (name
);
800 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
804 strncpy (fold_buffer
, name
+ 1, len
- 2);
805 fold_buffer
[len
- 2] = '\000';
810 for (i
= 0; i
<= len
; i
+= 1)
811 fold_buffer
[i
] = tolower (name
[i
]);
817 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
820 is_lower_alphanum (const char c
)
822 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
825 /* Remove either of these suffixes:
830 These are suffixes introduced by the compiler for entities such as
831 nested subprogram for instance, in order to avoid name clashes.
832 They do not serve any purpose for the debugger. */
835 ada_remove_trailing_digits (const char *encoded
, int *len
)
837 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
840 while (i
> 0 && isdigit (encoded
[i
]))
842 if (i
>= 0 && encoded
[i
] == '.')
844 else if (i
>= 0 && encoded
[i
] == '$')
846 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
848 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
853 /* Remove the suffix introduced by the compiler for protected object
857 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
859 /* Remove trailing N. */
861 /* Protected entry subprograms are broken into two
862 separate subprograms: The first one is unprotected, and has
863 a 'N' suffix; the second is the protected version, and has
864 the 'P' suffix. The second calls the first one after handling
865 the protection. Since the P subprograms are internally generated,
866 we leave these names undecoded, giving the user a clue that this
867 entity is internal. */
870 && encoded
[*len
- 1] == 'N'
871 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
875 /* If ENCODED follows the GNAT entity encoding conventions, then return
876 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
879 The resulting string is valid until the next call of ada_decode.
880 If the string is unchanged by decoding, the original string pointer
884 ada_decode (const char *encoded
)
891 static char *decoding_buffer
= NULL
;
892 static size_t decoding_buffer_size
= 0;
894 /* The name of the Ada main procedure starts with "_ada_".
895 This prefix is not part of the decoded name, so skip this part
896 if we see this prefix. */
897 if (strncmp (encoded
, "_ada_", 5) == 0)
900 /* If the name starts with '_', then it is not a properly encoded
901 name, so do not attempt to decode it. Similarly, if the name
902 starts with '<', the name should not be decoded. */
903 if (encoded
[0] == '_' || encoded
[0] == '<')
906 len0
= strlen (encoded
);
908 ada_remove_trailing_digits (encoded
, &len0
);
909 ada_remove_po_subprogram_suffix (encoded
, &len0
);
911 /* Remove the ___X.* suffix if present. Do not forget to verify that
912 the suffix is located before the current "end" of ENCODED. We want
913 to avoid re-matching parts of ENCODED that have previously been
914 marked as discarded (by decrementing LEN0). */
915 p
= strstr (encoded
, "___");
916 if (p
!= NULL
&& p
- encoded
< len0
- 3)
924 /* Remove any trailing TKB suffix. It tells us that this symbol
925 is for the body of a task, but that information does not actually
926 appear in the decoded name. */
928 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
931 /* Remove trailing "B" suffixes. */
932 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
934 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
937 /* Make decoded big enough for possible expansion by operator name. */
939 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
940 decoded
= decoding_buffer
;
942 /* Remove trailing __{digit}+ or trailing ${digit}+. */
944 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
947 while ((i
>= 0 && isdigit (encoded
[i
]))
948 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
950 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
952 else if (encoded
[i
] == '$')
956 /* The first few characters that are not alphabetic are not part
957 of any encoding we use, so we can copy them over verbatim. */
959 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
960 decoded
[j
] = encoded
[i
];
965 /* Is this a symbol function? */
966 if (at_start_name
&& encoded
[i
] == 'O')
969 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
971 int op_len
= strlen (ada_opname_table
[k
].encoded
);
972 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
974 && !isalnum (encoded
[i
+ op_len
]))
976 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
979 j
+= strlen (ada_opname_table
[k
].decoded
);
983 if (ada_opname_table
[k
].encoded
!= NULL
)
988 /* Replace "TK__" with "__", which will eventually be translated
989 into "." (just below). */
991 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
994 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
995 be translated into "." (just below). These are internal names
996 generated for anonymous blocks inside which our symbol is nested. */
998 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
999 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1000 && isdigit (encoded
[i
+4]))
1004 while (k
< len0
&& isdigit (encoded
[k
]))
1005 k
++; /* Skip any extra digit. */
1007 /* Double-check that the "__B_{DIGITS}+" sequence we found
1008 is indeed followed by "__". */
1009 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1013 /* Remove _E{DIGITS}+[sb] */
1015 /* Just as for protected object subprograms, there are 2 categories
1016 of subprograms created by the compiler for each entry. The first
1017 one implements the actual entry code, and has a suffix following
1018 the convention above; the second one implements the barrier and
1019 uses the same convention as above, except that the 'E' is replaced
1022 Just as above, we do not decode the name of barrier functions
1023 to give the user a clue that the code he is debugging has been
1024 internally generated. */
1026 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1027 && isdigit (encoded
[i
+2]))
1031 while (k
< len0
&& isdigit (encoded
[k
]))
1035 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1038 /* Just as an extra precaution, make sure that if this
1039 suffix is followed by anything else, it is a '_'.
1040 Otherwise, we matched this sequence by accident. */
1042 || (k
< len0
&& encoded
[k
] == '_'))
1047 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1048 the GNAT front-end in protected object subprograms. */
1051 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1053 /* Backtrack a bit up until we reach either the begining of
1054 the encoded name, or "__". Make sure that we only find
1055 digits or lowercase characters. */
1056 const char *ptr
= encoded
+ i
- 1;
1058 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1061 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1065 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1067 /* This is a X[bn]* sequence not separated from the previous
1068 part of the name with a non-alpha-numeric character (in other
1069 words, immediately following an alpha-numeric character), then
1070 verify that it is placed at the end of the encoded name. If
1071 not, then the encoding is not valid and we should abort the
1072 decoding. Otherwise, just skip it, it is used in body-nested
1076 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1080 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1082 /* Replace '__' by '.'. */
1090 /* It's a character part of the decoded name, so just copy it
1092 decoded
[j
] = encoded
[i
];
1097 decoded
[j
] = '\000';
1099 /* Decoded names should never contain any uppercase character.
1100 Double-check this, and abort the decoding if we find one. */
1102 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1103 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1106 if (strcmp (decoded
, encoded
) == 0)
1112 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1113 decoded
= decoding_buffer
;
1114 if (encoded
[0] == '<')
1115 strcpy (decoded
, encoded
);
1117 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1122 /* Table for keeping permanent unique copies of decoded names. Once
1123 allocated, names in this table are never released. While this is a
1124 storage leak, it should not be significant unless there are massive
1125 changes in the set of decoded names in successive versions of a
1126 symbol table loaded during a single session. */
1127 static struct htab
*decoded_names_store
;
1129 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1130 in the language-specific part of GSYMBOL, if it has not been
1131 previously computed. Tries to save the decoded name in the same
1132 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1133 in any case, the decoded symbol has a lifetime at least that of
1135 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1136 const, but nevertheless modified to a semantically equivalent form
1137 when a decoded name is cached in it.
1141 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1144 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1145 if (*resultp
== NULL
)
1147 const char *decoded
= ada_decode (gsymbol
->name
);
1148 if (gsymbol
->obj_section
!= NULL
)
1150 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1151 *resultp
= obsavestring (decoded
, strlen (decoded
),
1152 &objf
->objfile_obstack
);
1154 /* Sometimes, we can't find a corresponding objfile, in which
1155 case, we put the result on the heap. Since we only decode
1156 when needed, we hope this usually does not cause a
1157 significant memory leak (FIXME). */
1158 if (*resultp
== NULL
)
1160 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1163 *slot
= xstrdup (decoded
);
1172 ada_la_decode (const char *encoded
, int options
)
1174 return xstrdup (ada_decode (encoded
));
1177 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1178 suffixes that encode debugging information or leading _ada_ on
1179 SYM_NAME (see is_name_suffix commentary for the debugging
1180 information that is ignored). If WILD, then NAME need only match a
1181 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1182 either argument is NULL. */
1185 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1187 if (sym_name
== NULL
|| name
== NULL
)
1190 return wild_match (name
, strlen (name
), sym_name
);
1193 int len_name
= strlen (name
);
1194 return (strncmp (sym_name
, name
, len_name
) == 0
1195 && is_name_suffix (sym_name
+ len_name
))
1196 || (strncmp (sym_name
, "_ada_", 5) == 0
1197 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1198 && is_name_suffix (sym_name
+ len_name
+ 5));
1205 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1207 static char *bound_name
[] = {
1208 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1209 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1212 /* Maximum number of array dimensions we are prepared to handle. */
1214 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1216 /* Like modify_field, but allows bitpos > wordlength. */
1219 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1221 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1225 /* The desc_* routines return primitive portions of array descriptors
1228 /* The descriptor or array type, if any, indicated by TYPE; removes
1229 level of indirection, if needed. */
1231 static struct type
*
1232 desc_base_type (struct type
*type
)
1236 type
= ada_check_typedef (type
);
1238 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1239 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1240 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1245 /* True iff TYPE indicates a "thin" array pointer type. */
1248 is_thin_pntr (struct type
*type
)
1251 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1252 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1255 /* The descriptor type for thin pointer type TYPE. */
1257 static struct type
*
1258 thin_descriptor_type (struct type
*type
)
1260 struct type
*base_type
= desc_base_type (type
);
1261 if (base_type
== NULL
)
1263 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1267 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1268 if (alt_type
== NULL
)
1275 /* A pointer to the array data for thin-pointer value VAL. */
1277 static struct value
*
1278 thin_data_pntr (struct value
*val
)
1280 struct type
*type
= value_type (val
);
1281 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1282 data_type
= lookup_pointer_type (data_type
);
1284 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1285 return value_cast (data_type
, value_copy (val
));
1287 return value_from_longest (data_type
, value_address (val
));
1290 /* True iff TYPE indicates a "thick" array pointer type. */
1293 is_thick_pntr (struct type
*type
)
1295 type
= desc_base_type (type
);
1296 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1297 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1300 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1301 pointer to one, the type of its bounds data; otherwise, NULL. */
1303 static struct type
*
1304 desc_bounds_type (struct type
*type
)
1308 type
= desc_base_type (type
);
1312 else if (is_thin_pntr (type
))
1314 type
= thin_descriptor_type (type
);
1317 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1319 return ada_check_typedef (r
);
1321 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1323 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1325 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1330 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1331 one, a pointer to its bounds data. Otherwise NULL. */
1333 static struct value
*
1334 desc_bounds (struct value
*arr
)
1336 struct type
*type
= ada_check_typedef (value_type (arr
));
1337 if (is_thin_pntr (type
))
1339 struct type
*bounds_type
=
1340 desc_bounds_type (thin_descriptor_type (type
));
1343 if (bounds_type
== NULL
)
1344 error (_("Bad GNAT array descriptor"));
1346 /* NOTE: The following calculation is not really kosher, but
1347 since desc_type is an XVE-encoded type (and shouldn't be),
1348 the correct calculation is a real pain. FIXME (and fix GCC). */
1349 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1350 addr
= value_as_long (arr
);
1352 addr
= value_address (arr
);
1355 value_from_longest (lookup_pointer_type (bounds_type
),
1356 addr
- TYPE_LENGTH (bounds_type
));
1359 else if (is_thick_pntr (type
))
1360 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1361 _("Bad GNAT array descriptor"));
1366 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1367 position of the field containing the address of the bounds data. */
1370 fat_pntr_bounds_bitpos (struct type
*type
)
1372 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1375 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1376 size of the field containing the address of the bounds data. */
1379 fat_pntr_bounds_bitsize (struct type
*type
)
1381 type
= desc_base_type (type
);
1383 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1384 return TYPE_FIELD_BITSIZE (type
, 1);
1386 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1389 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1390 pointer to one, the type of its array data (a array-with-no-bounds type);
1391 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1394 static struct type
*
1395 desc_data_target_type (struct type
*type
)
1397 type
= desc_base_type (type
);
1399 /* NOTE: The following is bogus; see comment in desc_bounds. */
1400 if (is_thin_pntr (type
))
1401 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1402 else if (is_thick_pntr (type
))
1404 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1407 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1408 return TYPE_TARGET_TYPE (data_type
);
1414 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1417 static struct value
*
1418 desc_data (struct value
*arr
)
1420 struct type
*type
= value_type (arr
);
1421 if (is_thin_pntr (type
))
1422 return thin_data_pntr (arr
);
1423 else if (is_thick_pntr (type
))
1424 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1425 _("Bad GNAT array descriptor"));
1431 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1432 position of the field containing the address of the data. */
1435 fat_pntr_data_bitpos (struct type
*type
)
1437 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1440 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1441 size of the field containing the address of the data. */
1444 fat_pntr_data_bitsize (struct type
*type
)
1446 type
= desc_base_type (type
);
1448 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1449 return TYPE_FIELD_BITSIZE (type
, 0);
1451 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1454 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1455 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1456 bound, if WHICH is 1. The first bound is I=1. */
1458 static struct value
*
1459 desc_one_bound (struct value
*bounds
, int i
, int which
)
1461 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1462 _("Bad GNAT array descriptor bounds"));
1465 /* If BOUNDS is an array-bounds structure type, return the bit position
1466 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1467 bound, if WHICH is 1. The first bound is I=1. */
1470 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1472 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1475 /* If BOUNDS is an array-bounds structure type, return the bit field size
1476 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1477 bound, if WHICH is 1. The first bound is I=1. */
1480 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1482 type
= desc_base_type (type
);
1484 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1485 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1487 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1490 /* If TYPE is the type of an array-bounds structure, the type of its
1491 Ith bound (numbering from 1). Otherwise, NULL. */
1493 static struct type
*
1494 desc_index_type (struct type
*type
, int i
)
1496 type
= desc_base_type (type
);
1498 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1499 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1504 /* The number of index positions in the array-bounds type TYPE.
1505 Return 0 if TYPE is NULL. */
1508 desc_arity (struct type
*type
)
1510 type
= desc_base_type (type
);
1513 return TYPE_NFIELDS (type
) / 2;
1517 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1518 an array descriptor type (representing an unconstrained array
1522 ada_is_direct_array_type (struct type
*type
)
1526 type
= ada_check_typedef (type
);
1527 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1528 || ada_is_array_descriptor_type (type
));
1531 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1535 ada_is_array_type (struct type
*type
)
1538 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1539 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1540 type
= TYPE_TARGET_TYPE (type
);
1541 return ada_is_direct_array_type (type
);
1544 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1547 ada_is_simple_array_type (struct type
*type
)
1551 type
= ada_check_typedef (type
);
1552 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1553 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1554 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1557 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1560 ada_is_array_descriptor_type (struct type
*type
)
1562 struct type
*data_type
= desc_data_target_type (type
);
1566 type
= ada_check_typedef (type
);
1567 return (data_type
!= NULL
1568 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1569 && desc_arity (desc_bounds_type (type
)) > 0);
1572 /* Non-zero iff type is a partially mal-formed GNAT array
1573 descriptor. FIXME: This is to compensate for some problems with
1574 debugging output from GNAT. Re-examine periodically to see if it
1578 ada_is_bogus_array_descriptor (struct type
*type
)
1582 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1583 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1584 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1585 && !ada_is_array_descriptor_type (type
);
1589 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1590 (fat pointer) returns the type of the array data described---specifically,
1591 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1592 in from the descriptor; otherwise, they are left unspecified. If
1593 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1594 returns NULL. The result is simply the type of ARR if ARR is not
1597 ada_type_of_array (struct value
*arr
, int bounds
)
1599 if (ada_is_packed_array_type (value_type (arr
)))
1600 return decode_packed_array_type (value_type (arr
));
1602 if (!ada_is_array_descriptor_type (value_type (arr
)))
1603 return value_type (arr
);
1607 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1610 struct type
*elt_type
;
1612 struct value
*descriptor
;
1613 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1615 elt_type
= ada_array_element_type (value_type (arr
), -1);
1616 arity
= ada_array_arity (value_type (arr
));
1618 if (elt_type
== NULL
|| arity
== 0)
1619 return ada_check_typedef (value_type (arr
));
1621 descriptor
= desc_bounds (arr
);
1622 if (value_as_long (descriptor
) == 0)
1626 struct type
*range_type
= alloc_type (objf
);
1627 struct type
*array_type
= alloc_type (objf
);
1628 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1629 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1632 create_range_type (range_type
, value_type (low
),
1633 longest_to_int (value_as_long (low
)),
1634 longest_to_int (value_as_long (high
)));
1635 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1638 return lookup_pointer_type (elt_type
);
1642 /* If ARR does not represent an array, returns ARR unchanged.
1643 Otherwise, returns either a standard GDB array with bounds set
1644 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1645 GDB array. Returns NULL if ARR is a null fat pointer. */
1648 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1650 if (ada_is_array_descriptor_type (value_type (arr
)))
1652 struct type
*arrType
= ada_type_of_array (arr
, 1);
1653 if (arrType
== NULL
)
1655 return value_cast (arrType
, value_copy (desc_data (arr
)));
1657 else if (ada_is_packed_array_type (value_type (arr
)))
1658 return decode_packed_array (arr
);
1663 /* If ARR does not represent an array, returns ARR unchanged.
1664 Otherwise, returns a standard GDB array describing ARR (which may
1665 be ARR itself if it already is in the proper form). */
1667 static struct value
*
1668 ada_coerce_to_simple_array (struct value
*arr
)
1670 if (ada_is_array_descriptor_type (value_type (arr
)))
1672 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1674 error (_("Bounds unavailable for null array pointer."));
1675 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1676 return value_ind (arrVal
);
1678 else if (ada_is_packed_array_type (value_type (arr
)))
1679 return decode_packed_array (arr
);
1684 /* If TYPE represents a GNAT array type, return it translated to an
1685 ordinary GDB array type (possibly with BITSIZE fields indicating
1686 packing). For other types, is the identity. */
1689 ada_coerce_to_simple_array_type (struct type
*type
)
1691 if (ada_is_packed_array_type (type
))
1692 return decode_packed_array_type (type
);
1694 if (ada_is_array_descriptor_type (type
))
1695 return ada_check_typedef (desc_data_target_type (type
));
1700 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1703 ada_is_packed_array_type (struct type
*type
)
1707 type
= desc_base_type (type
);
1708 type
= ada_check_typedef (type
);
1710 ada_type_name (type
) != NULL
1711 && strstr (ada_type_name (type
), "___XP") != NULL
;
1714 /* Given that TYPE is a standard GDB array type with all bounds filled
1715 in, and that the element size of its ultimate scalar constituents
1716 (that is, either its elements, or, if it is an array of arrays, its
1717 elements' elements, etc.) is *ELT_BITS, return an identical type,
1718 but with the bit sizes of its elements (and those of any
1719 constituent arrays) recorded in the BITSIZE components of its
1720 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1723 static struct type
*
1724 packed_array_type (struct type
*type
, long *elt_bits
)
1726 struct type
*new_elt_type
;
1727 struct type
*new_type
;
1728 LONGEST low_bound
, high_bound
;
1730 type
= ada_check_typedef (type
);
1731 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1734 new_type
= alloc_type (TYPE_OBJFILE (type
));
1735 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1737 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1738 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1739 TYPE_NAME (new_type
) = ada_type_name (type
);
1741 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1742 &low_bound
, &high_bound
) < 0)
1743 low_bound
= high_bound
= 0;
1744 if (high_bound
< low_bound
)
1745 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1748 *elt_bits
*= (high_bound
- low_bound
+ 1);
1749 TYPE_LENGTH (new_type
) =
1750 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1753 TYPE_FIXED_INSTANCE (new_type
) = 1;
1757 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1759 static struct type
*
1760 decode_packed_array_type (struct type
*type
)
1763 struct block
**blocks
;
1764 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1767 struct type
*shadow_type
;
1772 raw_name
= ada_type_name (desc_base_type (type
));
1777 name
= (char *) alloca (strlen (raw_name
) + 1);
1778 tail
= strstr (raw_name
, "___XP");
1779 type
= desc_base_type (type
);
1781 memcpy (name
, raw_name
, tail
- raw_name
);
1782 name
[tail
- raw_name
] = '\000';
1784 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1785 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1787 lim_warning (_("could not find bounds information on packed array"));
1790 shadow_type
= SYMBOL_TYPE (sym
);
1791 CHECK_TYPEDEF (shadow_type
);
1793 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1795 lim_warning (_("could not understand bounds information on packed array"));
1799 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1802 (_("could not understand bit size information on packed array"));
1806 return packed_array_type (shadow_type
, &bits
);
1809 /* Given that ARR is a struct value *indicating a GNAT packed array,
1810 returns a simple array that denotes that array. Its type is a
1811 standard GDB array type except that the BITSIZEs of the array
1812 target types are set to the number of bits in each element, and the
1813 type length is set appropriately. */
1815 static struct value
*
1816 decode_packed_array (struct value
*arr
)
1820 arr
= ada_coerce_ref (arr
);
1821 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1822 arr
= ada_value_ind (arr
);
1824 type
= decode_packed_array_type (value_type (arr
));
1827 error (_("can't unpack array"));
1831 if (gdbarch_bits_big_endian (current_gdbarch
)
1832 && ada_is_modular_type (value_type (arr
)))
1834 /* This is a (right-justified) modular type representing a packed
1835 array with no wrapper. In order to interpret the value through
1836 the (left-justified) packed array type we just built, we must
1837 first left-justify it. */
1838 int bit_size
, bit_pos
;
1841 mod
= ada_modulus (value_type (arr
)) - 1;
1848 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1849 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1850 bit_pos
/ HOST_CHAR_BIT
,
1851 bit_pos
% HOST_CHAR_BIT
,
1856 return coerce_unspec_val_to_type (arr
, type
);
1860 /* The value of the element of packed array ARR at the ARITY indices
1861 given in IND. ARR must be a simple array. */
1863 static struct value
*
1864 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1867 int bits
, elt_off
, bit_off
;
1868 long elt_total_bit_offset
;
1869 struct type
*elt_type
;
1873 elt_total_bit_offset
= 0;
1874 elt_type
= ada_check_typedef (value_type (arr
));
1875 for (i
= 0; i
< arity
; i
+= 1)
1877 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1878 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1880 (_("attempt to do packed indexing of something other than a packed array"));
1883 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1884 LONGEST lowerbound
, upperbound
;
1887 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1889 lim_warning (_("don't know bounds of array"));
1890 lowerbound
= upperbound
= 0;
1893 idx
= pos_atr (ind
[i
]);
1894 if (idx
< lowerbound
|| idx
> upperbound
)
1895 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1896 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1897 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1898 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1901 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1902 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1904 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1909 /* Non-zero iff TYPE includes negative integer values. */
1912 has_negatives (struct type
*type
)
1914 switch (TYPE_CODE (type
))
1919 return !TYPE_UNSIGNED (type
);
1920 case TYPE_CODE_RANGE
:
1921 return TYPE_LOW_BOUND (type
) < 0;
1926 /* Create a new value of type TYPE from the contents of OBJ starting
1927 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1928 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1929 assigning through the result will set the field fetched from.
1930 VALADDR is ignored unless OBJ is NULL, in which case,
1931 VALADDR+OFFSET must address the start of storage containing the
1932 packed value. The value returned in this case is never an lval.
1933 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1936 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1937 long offset
, int bit_offset
, int bit_size
,
1941 int src
, /* Index into the source area */
1942 targ
, /* Index into the target area */
1943 srcBitsLeft
, /* Number of source bits left to move */
1944 nsrc
, ntarg
, /* Number of source and target bytes */
1945 unusedLS
, /* Number of bits in next significant
1946 byte of source that are unused */
1947 accumSize
; /* Number of meaningful bits in accum */
1948 unsigned char *bytes
; /* First byte containing data to unpack */
1949 unsigned char *unpacked
;
1950 unsigned long accum
; /* Staging area for bits being transferred */
1952 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1953 /* Transmit bytes from least to most significant; delta is the direction
1954 the indices move. */
1955 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
1957 type
= ada_check_typedef (type
);
1961 v
= allocate_value (type
);
1962 bytes
= (unsigned char *) (valaddr
+ offset
);
1964 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
1967 value_address (obj
) + offset
);
1968 bytes
= (unsigned char *) alloca (len
);
1969 read_memory (value_address (v
), bytes
, len
);
1973 v
= allocate_value (type
);
1974 bytes
= (unsigned char *) value_contents (obj
) + offset
;
1980 set_value_component_location (v
, obj
);
1981 new_addr
= value_address (obj
) + offset
;
1982 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
1983 set_value_bitsize (v
, bit_size
);
1984 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
1987 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
1989 set_value_address (v
, new_addr
);
1992 set_value_bitsize (v
, bit_size
);
1993 unpacked
= (unsigned char *) value_contents (v
);
1995 srcBitsLeft
= bit_size
;
1997 ntarg
= TYPE_LENGTH (type
);
2001 memset (unpacked
, 0, TYPE_LENGTH (type
));
2004 else if (gdbarch_bits_big_endian (current_gdbarch
))
2007 if (has_negatives (type
)
2008 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2012 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2015 switch (TYPE_CODE (type
))
2017 case TYPE_CODE_ARRAY
:
2018 case TYPE_CODE_UNION
:
2019 case TYPE_CODE_STRUCT
:
2020 /* Non-scalar values must be aligned at a byte boundary... */
2022 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2023 /* ... And are placed at the beginning (most-significant) bytes
2025 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2030 targ
= TYPE_LENGTH (type
) - 1;
2036 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2039 unusedLS
= bit_offset
;
2042 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2049 /* Mask for removing bits of the next source byte that are not
2050 part of the value. */
2051 unsigned int unusedMSMask
=
2052 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2054 /* Sign-extend bits for this byte. */
2055 unsigned int signMask
= sign
& ~unusedMSMask
;
2057 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2058 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2059 if (accumSize
>= HOST_CHAR_BIT
)
2061 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2062 accumSize
-= HOST_CHAR_BIT
;
2063 accum
>>= HOST_CHAR_BIT
;
2067 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2074 accum
|= sign
<< accumSize
;
2075 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2076 accumSize
-= HOST_CHAR_BIT
;
2077 accum
>>= HOST_CHAR_BIT
;
2085 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2086 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2089 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2090 int src_offset
, int n
)
2092 unsigned int accum
, mask
;
2093 int accum_bits
, chunk_size
;
2095 target
+= targ_offset
/ HOST_CHAR_BIT
;
2096 targ_offset
%= HOST_CHAR_BIT
;
2097 source
+= src_offset
/ HOST_CHAR_BIT
;
2098 src_offset
%= HOST_CHAR_BIT
;
2099 if (gdbarch_bits_big_endian (current_gdbarch
))
2101 accum
= (unsigned char) *source
;
2103 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2108 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2109 accum_bits
+= HOST_CHAR_BIT
;
2111 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2114 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2115 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2118 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2120 accum_bits
-= chunk_size
;
2127 accum
= (unsigned char) *source
>> src_offset
;
2129 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2133 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2134 accum_bits
+= HOST_CHAR_BIT
;
2136 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2139 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2140 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2142 accum_bits
-= chunk_size
;
2143 accum
>>= chunk_size
;
2150 /* Store the contents of FROMVAL into the location of TOVAL.
2151 Return a new value with the location of TOVAL and contents of
2152 FROMVAL. Handles assignment into packed fields that have
2153 floating-point or non-scalar types. */
2155 static struct value
*
2156 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2158 struct type
*type
= value_type (toval
);
2159 int bits
= value_bitsize (toval
);
2161 toval
= ada_coerce_ref (toval
);
2162 fromval
= ada_coerce_ref (fromval
);
2164 if (ada_is_direct_array_type (value_type (toval
)))
2165 toval
= ada_coerce_to_simple_array (toval
);
2166 if (ada_is_direct_array_type (value_type (fromval
)))
2167 fromval
= ada_coerce_to_simple_array (fromval
);
2169 if (!deprecated_value_modifiable (toval
))
2170 error (_("Left operand of assignment is not a modifiable lvalue."));
2172 if (VALUE_LVAL (toval
) == lval_memory
2174 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2175 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2177 int len
= (value_bitpos (toval
)
2178 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2180 char *buffer
= (char *) alloca (len
);
2182 CORE_ADDR to_addr
= value_address (toval
);
2184 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2185 fromval
= value_cast (type
, fromval
);
2187 read_memory (to_addr
, buffer
, len
);
2188 from_size
= value_bitsize (fromval
);
2190 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2191 if (gdbarch_bits_big_endian (current_gdbarch
))
2192 move_bits (buffer
, value_bitpos (toval
),
2193 value_contents (fromval
), from_size
- bits
, bits
);
2195 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2197 write_memory (to_addr
, buffer
, len
);
2198 if (deprecated_memory_changed_hook
)
2199 deprecated_memory_changed_hook (to_addr
, len
);
2201 val
= value_copy (toval
);
2202 memcpy (value_contents_raw (val
), value_contents (fromval
),
2203 TYPE_LENGTH (type
));
2204 deprecated_set_value_type (val
, type
);
2209 return value_assign (toval
, fromval
);
2213 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2214 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2215 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2216 * COMPONENT, and not the inferior's memory. The current contents
2217 * of COMPONENT are ignored. */
2219 value_assign_to_component (struct value
*container
, struct value
*component
,
2222 LONGEST offset_in_container
=
2223 (LONGEST
) (value_address (component
) - value_address (container
));
2224 int bit_offset_in_container
=
2225 value_bitpos (component
) - value_bitpos (container
);
2228 val
= value_cast (value_type (component
), val
);
2230 if (value_bitsize (component
) == 0)
2231 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2233 bits
= value_bitsize (component
);
2235 if (gdbarch_bits_big_endian (current_gdbarch
))
2236 move_bits (value_contents_writeable (container
) + offset_in_container
,
2237 value_bitpos (container
) + bit_offset_in_container
,
2238 value_contents (val
),
2239 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2242 move_bits (value_contents_writeable (container
) + offset_in_container
,
2243 value_bitpos (container
) + bit_offset_in_container
,
2244 value_contents (val
), 0, bits
);
2247 /* The value of the element of array ARR at the ARITY indices given in IND.
2248 ARR may be either a simple array, GNAT array descriptor, or pointer
2252 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2256 struct type
*elt_type
;
2258 elt
= ada_coerce_to_simple_array (arr
);
2260 elt_type
= ada_check_typedef (value_type (elt
));
2261 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2262 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2263 return value_subscript_packed (elt
, arity
, ind
);
2265 for (k
= 0; k
< arity
; k
+= 1)
2267 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2268 error (_("too many subscripts (%d expected)"), k
);
2269 elt
= value_subscript (elt
, value_pos_atr (builtin_type_int32
, ind
[k
]));
2274 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2275 value of the element of *ARR at the ARITY indices given in
2276 IND. Does not read the entire array into memory. */
2278 static struct value
*
2279 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2284 for (k
= 0; k
< arity
; k
+= 1)
2289 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2290 error (_("too many subscripts (%d expected)"), k
);
2291 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2293 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2294 idx
= value_pos_atr (builtin_type_int32
, ind
[k
]);
2296 idx
= value_binop (idx
, value_from_longest (value_type (idx
), lwb
),
2299 arr
= value_ptradd (arr
, idx
);
2300 type
= TYPE_TARGET_TYPE (type
);
2303 return value_ind (arr
);
2306 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2307 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2308 elements starting at index LOW. The lower bound of this array is LOW, as
2310 static struct value
*
2311 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2314 CORE_ADDR base
= value_as_address (array_ptr
)
2315 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2316 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2317 struct type
*index_type
=
2318 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2320 struct type
*slice_type
=
2321 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2322 return value_at_lazy (slice_type
, base
);
2326 static struct value
*
2327 ada_value_slice (struct value
*array
, int low
, int high
)
2329 struct type
*type
= value_type (array
);
2330 struct type
*index_type
=
2331 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2332 struct type
*slice_type
=
2333 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2334 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2337 /* If type is a record type in the form of a standard GNAT array
2338 descriptor, returns the number of dimensions for type. If arr is a
2339 simple array, returns the number of "array of"s that prefix its
2340 type designation. Otherwise, returns 0. */
2343 ada_array_arity (struct type
*type
)
2350 type
= desc_base_type (type
);
2353 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2354 return desc_arity (desc_bounds_type (type
));
2356 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2359 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2365 /* If TYPE is a record type in the form of a standard GNAT array
2366 descriptor or a simple array type, returns the element type for
2367 TYPE after indexing by NINDICES indices, or by all indices if
2368 NINDICES is -1. Otherwise, returns NULL. */
2371 ada_array_element_type (struct type
*type
, int nindices
)
2373 type
= desc_base_type (type
);
2375 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2378 struct type
*p_array_type
;
2380 p_array_type
= desc_data_target_type (type
);
2382 k
= ada_array_arity (type
);
2386 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2387 if (nindices
>= 0 && k
> nindices
)
2389 while (k
> 0 && p_array_type
!= NULL
)
2391 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2394 return p_array_type
;
2396 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2398 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2400 type
= TYPE_TARGET_TYPE (type
);
2409 /* The type of nth index in arrays of given type (n numbering from 1).
2410 Does not examine memory. */
2413 ada_index_type (struct type
*type
, int n
)
2415 struct type
*result_type
;
2417 type
= desc_base_type (type
);
2419 if (n
> ada_array_arity (type
))
2422 if (ada_is_simple_array_type (type
))
2426 for (i
= 1; i
< n
; i
+= 1)
2427 type
= TYPE_TARGET_TYPE (type
);
2428 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2429 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2430 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2431 perhaps stabsread.c would make more sense. */
2432 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2433 result_type
= builtin_type_int32
;
2438 return desc_index_type (desc_bounds_type (type
), n
);
2441 /* Given that arr is an array type, returns the lower bound of the
2442 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2443 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2444 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2445 bounds type. It works for other arrays with bounds supplied by
2446 run-time quantities other than discriminants. */
2449 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2450 struct type
** typep
)
2452 struct type
*type
, *index_type_desc
, *index_type
;
2455 gdb_assert (which
== 0 || which
== 1);
2457 if (ada_is_packed_array_type (arr_type
))
2458 arr_type
= decode_packed_array_type (arr_type
);
2460 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2463 *typep
= builtin_type_int32
;
2464 return (LONGEST
) - which
;
2467 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2468 type
= TYPE_TARGET_TYPE (arr_type
);
2472 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2473 if (index_type_desc
!= NULL
)
2474 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2475 NULL
, TYPE_OBJFILE (arr_type
));
2480 type
= TYPE_TARGET_TYPE (type
);
2484 index_type
= TYPE_INDEX_TYPE (type
);
2487 switch (TYPE_CODE (index_type
))
2489 case TYPE_CODE_RANGE
:
2490 retval
= which
== 0 ? TYPE_LOW_BOUND (index_type
)
2491 : TYPE_HIGH_BOUND (index_type
);
2493 case TYPE_CODE_ENUM
:
2494 retval
= which
== 0 ? TYPE_FIELD_BITPOS (index_type
, 0)
2495 : TYPE_FIELD_BITPOS (index_type
,
2496 TYPE_NFIELDS (index_type
) - 1);
2499 internal_error (__FILE__
, __LINE__
, _("invalid type code of index type"));
2503 *typep
= index_type
;
2508 /* Given that arr is an array value, returns the lower bound of the
2509 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2510 WHICH is 1. This routine will also work for arrays with bounds
2511 supplied by run-time quantities other than discriminants. */
2514 ada_array_bound (struct value
*arr
, int n
, int which
)
2516 struct type
*arr_type
= value_type (arr
);
2518 if (ada_is_packed_array_type (arr_type
))
2519 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2520 else if (ada_is_simple_array_type (arr_type
))
2523 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2524 return value_from_longest (type
, v
);
2527 return desc_one_bound (desc_bounds (arr
), n
, which
);
2530 /* Given that arr is an array value, returns the length of the
2531 nth index. This routine will also work for arrays with bounds
2532 supplied by run-time quantities other than discriminants.
2533 Does not work for arrays indexed by enumeration types with representation
2534 clauses at the moment. */
2536 static struct value
*
2537 ada_array_length (struct value
*arr
, int n
)
2539 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2541 if (ada_is_packed_array_type (arr_type
))
2542 return ada_array_length (decode_packed_array (arr
), n
);
2544 if (ada_is_simple_array_type (arr_type
))
2548 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2549 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2550 return value_from_longest (type
, v
);
2554 value_from_longest (builtin_type_int32
,
2555 value_as_long (desc_one_bound (desc_bounds (arr
),
2557 - value_as_long (desc_one_bound (desc_bounds (arr
),
2561 /* An empty array whose type is that of ARR_TYPE (an array type),
2562 with bounds LOW to LOW-1. */
2564 static struct value
*
2565 empty_array (struct type
*arr_type
, int low
)
2567 struct type
*index_type
=
2568 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2570 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2571 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2575 /* Name resolution */
2577 /* The "decoded" name for the user-definable Ada operator corresponding
2581 ada_decoded_op_name (enum exp_opcode op
)
2585 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2587 if (ada_opname_table
[i
].op
== op
)
2588 return ada_opname_table
[i
].decoded
;
2590 error (_("Could not find operator name for opcode"));
2594 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2595 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2596 undefined namespace) and converts operators that are
2597 user-defined into appropriate function calls. If CONTEXT_TYPE is
2598 non-null, it provides a preferred result type [at the moment, only
2599 type void has any effect---causing procedures to be preferred over
2600 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2601 return type is preferred. May change (expand) *EXP. */
2604 resolve (struct expression
**expp
, int void_context_p
)
2608 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2611 /* Resolve the operator of the subexpression beginning at
2612 position *POS of *EXPP. "Resolving" consists of replacing
2613 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2614 with their resolutions, replacing built-in operators with
2615 function calls to user-defined operators, where appropriate, and,
2616 when DEPROCEDURE_P is non-zero, converting function-valued variables
2617 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2618 are as in ada_resolve, above. */
2620 static struct value
*
2621 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2622 struct type
*context_type
)
2626 struct expression
*exp
; /* Convenience: == *expp. */
2627 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2628 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2629 int nargs
; /* Number of operands. */
2636 /* Pass one: resolve operands, saving their types and updating *pos,
2641 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2642 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2647 resolve_subexp (expp
, pos
, 0, NULL
);
2649 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2654 resolve_subexp (expp
, pos
, 0, NULL
);
2659 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2662 case OP_ATR_MODULUS
:
2672 case TERNOP_IN_RANGE
:
2673 case BINOP_IN_BOUNDS
:
2679 case OP_DISCRETE_RANGE
:
2681 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2690 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2692 resolve_subexp (expp
, pos
, 1, NULL
);
2694 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2711 case BINOP_LOGICAL_AND
:
2712 case BINOP_LOGICAL_OR
:
2713 case BINOP_BITWISE_AND
:
2714 case BINOP_BITWISE_IOR
:
2715 case BINOP_BITWISE_XOR
:
2718 case BINOP_NOTEQUAL
:
2725 case BINOP_SUBSCRIPT
:
2733 case UNOP_LOGICAL_NOT
:
2749 case OP_INTERNALVAR
:
2759 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2762 case STRUCTOP_STRUCT
:
2763 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2776 error (_("Unexpected operator during name resolution"));
2779 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2780 for (i
= 0; i
< nargs
; i
+= 1)
2781 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2785 /* Pass two: perform any resolution on principal operator. */
2792 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2794 struct ada_symbol_info
*candidates
;
2798 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2799 (exp
->elts
[pc
+ 2].symbol
),
2800 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2803 if (n_candidates
> 1)
2805 /* Types tend to get re-introduced locally, so if there
2806 are any local symbols that are not types, first filter
2809 for (j
= 0; j
< n_candidates
; j
+= 1)
2810 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2815 case LOC_REGPARM_ADDR
:
2823 if (j
< n_candidates
)
2826 while (j
< n_candidates
)
2828 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2830 candidates
[j
] = candidates
[n_candidates
- 1];
2839 if (n_candidates
== 0)
2840 error (_("No definition found for %s"),
2841 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2842 else if (n_candidates
== 1)
2844 else if (deprocedure_p
2845 && !is_nonfunction (candidates
, n_candidates
))
2847 i
= ada_resolve_function
2848 (candidates
, n_candidates
, NULL
, 0,
2849 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2852 error (_("Could not find a match for %s"),
2853 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2857 printf_filtered (_("Multiple matches for %s\n"),
2858 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2859 user_select_syms (candidates
, n_candidates
, 1);
2863 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2864 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2865 if (innermost_block
== NULL
2866 || contained_in (candidates
[i
].block
, innermost_block
))
2867 innermost_block
= candidates
[i
].block
;
2871 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2874 replace_operator_with_call (expp
, pc
, 0, 0,
2875 exp
->elts
[pc
+ 2].symbol
,
2876 exp
->elts
[pc
+ 1].block
);
2883 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2884 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2886 struct ada_symbol_info
*candidates
;
2890 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2891 (exp
->elts
[pc
+ 5].symbol
),
2892 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2894 if (n_candidates
== 1)
2898 i
= ada_resolve_function
2899 (candidates
, n_candidates
,
2901 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2904 error (_("Could not find a match for %s"),
2905 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2908 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2909 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2910 if (innermost_block
== NULL
2911 || contained_in (candidates
[i
].block
, innermost_block
))
2912 innermost_block
= candidates
[i
].block
;
2923 case BINOP_BITWISE_AND
:
2924 case BINOP_BITWISE_IOR
:
2925 case BINOP_BITWISE_XOR
:
2927 case BINOP_NOTEQUAL
:
2935 case UNOP_LOGICAL_NOT
:
2937 if (possible_user_operator_p (op
, argvec
))
2939 struct ada_symbol_info
*candidates
;
2943 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2944 (struct block
*) NULL
, VAR_DOMAIN
,
2946 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2947 ada_decoded_op_name (op
), NULL
);
2951 replace_operator_with_call (expp
, pc
, nargs
, 1,
2952 candidates
[i
].sym
, candidates
[i
].block
);
2963 return evaluate_subexp_type (exp
, pos
);
2966 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2967 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2968 a non-pointer. A type of 'void' (which is never a valid expression type)
2969 by convention matches anything. */
2970 /* The term "match" here is rather loose. The match is heuristic and
2971 liberal. FIXME: TOO liberal, in fact. */
2974 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
2976 ftype
= ada_check_typedef (ftype
);
2977 atype
= ada_check_typedef (atype
);
2979 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
2980 ftype
= TYPE_TARGET_TYPE (ftype
);
2981 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
2982 atype
= TYPE_TARGET_TYPE (atype
);
2984 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
2985 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
2988 switch (TYPE_CODE (ftype
))
2993 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
2994 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
2995 TYPE_TARGET_TYPE (atype
), 0);
2998 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3000 case TYPE_CODE_ENUM
:
3001 case TYPE_CODE_RANGE
:
3002 switch (TYPE_CODE (atype
))
3005 case TYPE_CODE_ENUM
:
3006 case TYPE_CODE_RANGE
:
3012 case TYPE_CODE_ARRAY
:
3013 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3014 || ada_is_array_descriptor_type (atype
));
3016 case TYPE_CODE_STRUCT
:
3017 if (ada_is_array_descriptor_type (ftype
))
3018 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3019 || ada_is_array_descriptor_type (atype
));
3021 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3022 && !ada_is_array_descriptor_type (atype
));
3024 case TYPE_CODE_UNION
:
3026 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3030 /* Return non-zero if the formals of FUNC "sufficiently match" the
3031 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3032 may also be an enumeral, in which case it is treated as a 0-
3033 argument function. */
3036 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3039 struct type
*func_type
= SYMBOL_TYPE (func
);
3041 if (SYMBOL_CLASS (func
) == LOC_CONST
3042 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3043 return (n_actuals
== 0);
3044 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3047 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3050 for (i
= 0; i
< n_actuals
; i
+= 1)
3052 if (actuals
[i
] == NULL
)
3056 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3057 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3059 if (!ada_type_match (ftype
, atype
, 1))
3066 /* False iff function type FUNC_TYPE definitely does not produce a value
3067 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3068 FUNC_TYPE is not a valid function type with a non-null return type
3069 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3072 return_match (struct type
*func_type
, struct type
*context_type
)
3074 struct type
*return_type
;
3076 if (func_type
== NULL
)
3079 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3080 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3082 return_type
= base_type (func_type
);
3083 if (return_type
== NULL
)
3086 context_type
= base_type (context_type
);
3088 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3089 return context_type
== NULL
|| return_type
== context_type
;
3090 else if (context_type
== NULL
)
3091 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3093 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3097 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3098 function (if any) that matches the types of the NARGS arguments in
3099 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3100 that returns that type, then eliminate matches that don't. If
3101 CONTEXT_TYPE is void and there is at least one match that does not
3102 return void, eliminate all matches that do.
3104 Asks the user if there is more than one match remaining. Returns -1
3105 if there is no such symbol or none is selected. NAME is used
3106 solely for messages. May re-arrange and modify SYMS in
3107 the process; the index returned is for the modified vector. */
3110 ada_resolve_function (struct ada_symbol_info syms
[],
3111 int nsyms
, struct value
**args
, int nargs
,
3112 const char *name
, struct type
*context_type
)
3115 int m
; /* Number of hits */
3116 struct type
*fallback
;
3117 struct type
*return_type
;
3119 return_type
= context_type
;
3120 if (context_type
== NULL
)
3121 fallback
= builtin_type_void
;
3128 for (k
= 0; k
< nsyms
; k
+= 1)
3130 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3132 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3133 && return_match (type
, return_type
))
3139 if (m
> 0 || return_type
== fallback
)
3142 return_type
= fallback
;
3149 printf_filtered (_("Multiple matches for %s\n"), name
);
3150 user_select_syms (syms
, m
, 1);
3156 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3157 in a listing of choices during disambiguation (see sort_choices, below).
3158 The idea is that overloadings of a subprogram name from the
3159 same package should sort in their source order. We settle for ordering
3160 such symbols by their trailing number (__N or $N). */
3163 encoded_ordered_before (char *N0
, char *N1
)
3167 else if (N0
== NULL
)
3172 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3174 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3176 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3177 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3181 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3184 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3186 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3187 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3189 return (strcmp (N0
, N1
) < 0);
3193 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3197 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3200 for (i
= 1; i
< nsyms
; i
+= 1)
3202 struct ada_symbol_info sym
= syms
[i
];
3205 for (j
= i
- 1; j
>= 0; j
-= 1)
3207 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3208 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3210 syms
[j
+ 1] = syms
[j
];
3216 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3217 by asking the user (if necessary), returning the number selected,
3218 and setting the first elements of SYMS items. Error if no symbols
3221 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3222 to be re-integrated one of these days. */
3225 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3228 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3230 int first_choice
= (max_results
== 1) ? 1 : 2;
3231 const char *select_mode
= multiple_symbols_select_mode ();
3233 if (max_results
< 1)
3234 error (_("Request to select 0 symbols!"));
3238 if (select_mode
== multiple_symbols_cancel
)
3240 canceled because the command is ambiguous\n\
3241 See set/show multiple-symbol."));
3243 /* If select_mode is "all", then return all possible symbols.
3244 Only do that if more than one symbol can be selected, of course.
3245 Otherwise, display the menu as usual. */
3246 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3249 printf_unfiltered (_("[0] cancel\n"));
3250 if (max_results
> 1)
3251 printf_unfiltered (_("[1] all\n"));
3253 sort_choices (syms
, nsyms
);
3255 for (i
= 0; i
< nsyms
; i
+= 1)
3257 if (syms
[i
].sym
== NULL
)
3260 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3262 struct symtab_and_line sal
=
3263 find_function_start_sal (syms
[i
].sym
, 1);
3264 if (sal
.symtab
== NULL
)
3265 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3267 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3270 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3271 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3272 sal
.symtab
->filename
, sal
.line
);
3278 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3279 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3280 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3281 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3283 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3284 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3286 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3287 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3288 else if (is_enumeral
3289 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3291 printf_unfiltered (("[%d] "), i
+ first_choice
);
3292 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3294 printf_unfiltered (_("'(%s) (enumeral)\n"),
3295 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3297 else if (symtab
!= NULL
)
3298 printf_unfiltered (is_enumeral
3299 ? _("[%d] %s in %s (enumeral)\n")
3300 : _("[%d] %s at %s:?\n"),
3302 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3305 printf_unfiltered (is_enumeral
3306 ? _("[%d] %s (enumeral)\n")
3307 : _("[%d] %s at ?\n"),
3309 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3313 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3316 for (i
= 0; i
< n_chosen
; i
+= 1)
3317 syms
[i
] = syms
[chosen
[i
]];
3322 /* Read and validate a set of numeric choices from the user in the
3323 range 0 .. N_CHOICES-1. Place the results in increasing
3324 order in CHOICES[0 .. N-1], and return N.
3326 The user types choices as a sequence of numbers on one line
3327 separated by blanks, encoding them as follows:
3329 + A choice of 0 means to cancel the selection, throwing an error.
3330 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3331 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3333 The user is not allowed to choose more than MAX_RESULTS values.
3335 ANNOTATION_SUFFIX, if present, is used to annotate the input
3336 prompts (for use with the -f switch). */
3339 get_selections (int *choices
, int n_choices
, int max_results
,
3340 int is_all_choice
, char *annotation_suffix
)
3345 int first_choice
= is_all_choice
? 2 : 1;
3347 prompt
= getenv ("PS2");
3351 args
= command_line_input (prompt
, 0, annotation_suffix
);
3354 error_no_arg (_("one or more choice numbers"));
3358 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3359 order, as given in args. Choices are validated. */
3365 while (isspace (*args
))
3367 if (*args
== '\0' && n_chosen
== 0)
3368 error_no_arg (_("one or more choice numbers"));
3369 else if (*args
== '\0')
3372 choice
= strtol (args
, &args2
, 10);
3373 if (args
== args2
|| choice
< 0
3374 || choice
> n_choices
+ first_choice
- 1)
3375 error (_("Argument must be choice number"));
3379 error (_("cancelled"));
3381 if (choice
< first_choice
)
3383 n_chosen
= n_choices
;
3384 for (j
= 0; j
< n_choices
; j
+= 1)
3388 choice
-= first_choice
;
3390 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3394 if (j
< 0 || choice
!= choices
[j
])
3397 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3398 choices
[k
+ 1] = choices
[k
];
3399 choices
[j
+ 1] = choice
;
3404 if (n_chosen
> max_results
)
3405 error (_("Select no more than %d of the above"), max_results
);
3410 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3411 on the function identified by SYM and BLOCK, and taking NARGS
3412 arguments. Update *EXPP as needed to hold more space. */
3415 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3416 int oplen
, struct symbol
*sym
,
3417 struct block
*block
)
3419 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3420 symbol, -oplen for operator being replaced). */
3421 struct expression
*newexp
= (struct expression
*)
3422 xmalloc (sizeof (struct expression
)
3423 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3424 struct expression
*exp
= *expp
;
3426 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3427 newexp
->language_defn
= exp
->language_defn
;
3428 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3429 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3430 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3432 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3433 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3435 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3436 newexp
->elts
[pc
+ 4].block
= block
;
3437 newexp
->elts
[pc
+ 5].symbol
= sym
;
3443 /* Type-class predicates */
3445 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3449 numeric_type_p (struct type
*type
)
3455 switch (TYPE_CODE (type
))
3460 case TYPE_CODE_RANGE
:
3461 return (type
== TYPE_TARGET_TYPE (type
)
3462 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3469 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3472 integer_type_p (struct type
*type
)
3478 switch (TYPE_CODE (type
))
3482 case TYPE_CODE_RANGE
:
3483 return (type
== TYPE_TARGET_TYPE (type
)
3484 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3491 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3494 scalar_type_p (struct type
*type
)
3500 switch (TYPE_CODE (type
))
3503 case TYPE_CODE_RANGE
:
3504 case TYPE_CODE_ENUM
:
3513 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3516 discrete_type_p (struct type
*type
)
3522 switch (TYPE_CODE (type
))
3525 case TYPE_CODE_RANGE
:
3526 case TYPE_CODE_ENUM
:
3534 /* Returns non-zero if OP with operands in the vector ARGS could be
3535 a user-defined function. Errs on the side of pre-defined operators
3536 (i.e., result 0). */
3539 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3541 struct type
*type0
=
3542 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3543 struct type
*type1
=
3544 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3558 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3562 case BINOP_BITWISE_AND
:
3563 case BINOP_BITWISE_IOR
:
3564 case BINOP_BITWISE_XOR
:
3565 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3568 case BINOP_NOTEQUAL
:
3573 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3576 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3579 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3583 case UNOP_LOGICAL_NOT
:
3585 return (!numeric_type_p (type0
));
3594 1. In the following, we assume that a renaming type's name may
3595 have an ___XD suffix. It would be nice if this went away at some
3597 2. We handle both the (old) purely type-based representation of
3598 renamings and the (new) variable-based encoding. At some point,
3599 it is devoutly to be hoped that the former goes away
3600 (FIXME: hilfinger-2007-07-09).
3601 3. Subprogram renamings are not implemented, although the XRS
3602 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3604 /* If SYM encodes a renaming,
3606 <renaming> renames <renamed entity>,
3608 sets *LEN to the length of the renamed entity's name,
3609 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3610 the string describing the subcomponent selected from the renamed
3611 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3612 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3613 are undefined). Otherwise, returns a value indicating the category
3614 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3615 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3616 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3617 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3618 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3619 may be NULL, in which case they are not assigned.
3621 [Currently, however, GCC does not generate subprogram renamings.] */
3623 enum ada_renaming_category
3624 ada_parse_renaming (struct symbol
*sym
,
3625 const char **renamed_entity
, int *len
,
3626 const char **renaming_expr
)
3628 enum ada_renaming_category kind
;
3633 return ADA_NOT_RENAMING
;
3634 switch (SYMBOL_CLASS (sym
))
3637 return ADA_NOT_RENAMING
;
3639 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3640 renamed_entity
, len
, renaming_expr
);
3644 case LOC_OPTIMIZED_OUT
:
3645 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3647 return ADA_NOT_RENAMING
;
3651 kind
= ADA_OBJECT_RENAMING
;
3655 kind
= ADA_EXCEPTION_RENAMING
;
3659 kind
= ADA_PACKAGE_RENAMING
;
3663 kind
= ADA_SUBPROGRAM_RENAMING
;
3667 return ADA_NOT_RENAMING
;
3671 if (renamed_entity
!= NULL
)
3672 *renamed_entity
= info
;
3673 suffix
= strstr (info
, "___XE");
3674 if (suffix
== NULL
|| suffix
== info
)
3675 return ADA_NOT_RENAMING
;
3677 *len
= strlen (info
) - strlen (suffix
);
3679 if (renaming_expr
!= NULL
)
3680 *renaming_expr
= suffix
;
3684 /* Assuming TYPE encodes a renaming according to the old encoding in
3685 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3686 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3687 ADA_NOT_RENAMING otherwise. */
3688 static enum ada_renaming_category
3689 parse_old_style_renaming (struct type
*type
,
3690 const char **renamed_entity
, int *len
,
3691 const char **renaming_expr
)
3693 enum ada_renaming_category kind
;
3698 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3699 || TYPE_NFIELDS (type
) != 1)
3700 return ADA_NOT_RENAMING
;
3702 name
= type_name_no_tag (type
);
3704 return ADA_NOT_RENAMING
;
3706 name
= strstr (name
, "___XR");
3708 return ADA_NOT_RENAMING
;
3713 kind
= ADA_OBJECT_RENAMING
;
3716 kind
= ADA_EXCEPTION_RENAMING
;
3719 kind
= ADA_PACKAGE_RENAMING
;
3722 kind
= ADA_SUBPROGRAM_RENAMING
;
3725 return ADA_NOT_RENAMING
;
3728 info
= TYPE_FIELD_NAME (type
, 0);
3730 return ADA_NOT_RENAMING
;
3731 if (renamed_entity
!= NULL
)
3732 *renamed_entity
= info
;
3733 suffix
= strstr (info
, "___XE");
3734 if (renaming_expr
!= NULL
)
3735 *renaming_expr
= suffix
+ 5;
3736 if (suffix
== NULL
|| suffix
== info
)
3737 return ADA_NOT_RENAMING
;
3739 *len
= suffix
- info
;
3745 /* Evaluation: Function Calls */
3747 /* Return an lvalue containing the value VAL. This is the identity on
3748 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3749 on the stack, using and updating *SP as the stack pointer, and
3750 returning an lvalue whose value_address points to the copy. */
3752 static struct value
*
3753 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3755 if (! VALUE_LVAL (val
))
3757 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3759 /* The following is taken from the structure-return code in
3760 call_function_by_hand. FIXME: Therefore, some refactoring seems
3762 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3764 /* Stack grows downward. Align SP and value_address (val) after
3765 reserving sufficient space. */
3767 if (gdbarch_frame_align_p (current_gdbarch
))
3768 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3769 set_value_address (val
, *sp
);
3773 /* Stack grows upward. Align the frame, allocate space, and
3774 then again, re-align the frame. */
3775 if (gdbarch_frame_align_p (current_gdbarch
))
3776 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3777 set_value_address (val
, *sp
);
3779 if (gdbarch_frame_align_p (current_gdbarch
))
3780 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3782 VALUE_LVAL (val
) = lval_memory
;
3784 write_memory (value_address (val
), value_contents_raw (val
), len
);
3790 /* Return the value ACTUAL, converted to be an appropriate value for a
3791 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3792 allocating any necessary descriptors (fat pointers), or copies of
3793 values not residing in memory, updating it as needed. */
3796 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3799 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3800 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3801 struct type
*formal_target
=
3802 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3803 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3804 struct type
*actual_target
=
3805 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3806 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3808 if (ada_is_array_descriptor_type (formal_target
)
3809 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3810 return make_array_descriptor (formal_type
, actual
, sp
);
3811 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3812 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3814 struct value
*result
;
3815 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3816 && ada_is_array_descriptor_type (actual_target
))
3817 result
= desc_data (actual
);
3818 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3820 if (VALUE_LVAL (actual
) != lval_memory
)
3823 actual_type
= ada_check_typedef (value_type (actual
));
3824 val
= allocate_value (actual_type
);
3825 memcpy ((char *) value_contents_raw (val
),
3826 (char *) value_contents (actual
),
3827 TYPE_LENGTH (actual_type
));
3828 actual
= ensure_lval (val
, sp
);
3830 result
= value_addr (actual
);
3834 return value_cast_pointers (formal_type
, result
);
3836 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3837 return ada_value_ind (actual
);
3843 /* Push a descriptor of type TYPE for array value ARR on the stack at
3844 *SP, updating *SP to reflect the new descriptor. Return either
3845 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3846 to-descriptor type rather than a descriptor type), a struct value *
3847 representing a pointer to this descriptor. */
3849 static struct value
*
3850 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3852 struct type
*bounds_type
= desc_bounds_type (type
);
3853 struct type
*desc_type
= desc_base_type (type
);
3854 struct value
*descriptor
= allocate_value (desc_type
);
3855 struct value
*bounds
= allocate_value (bounds_type
);
3858 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3860 modify_general_field (value_contents_writeable (bounds
),
3861 value_as_long (ada_array_bound (arr
, i
, 0)),
3862 desc_bound_bitpos (bounds_type
, i
, 0),
3863 desc_bound_bitsize (bounds_type
, i
, 0));
3864 modify_general_field (value_contents_writeable (bounds
),
3865 value_as_long (ada_array_bound (arr
, i
, 1)),
3866 desc_bound_bitpos (bounds_type
, i
, 1),
3867 desc_bound_bitsize (bounds_type
, i
, 1));
3870 bounds
= ensure_lval (bounds
, sp
);
3872 modify_general_field (value_contents_writeable (descriptor
),
3873 value_address (ensure_lval (arr
, sp
)),
3874 fat_pntr_data_bitpos (desc_type
),
3875 fat_pntr_data_bitsize (desc_type
));
3877 modify_general_field (value_contents_writeable (descriptor
),
3878 value_address (bounds
),
3879 fat_pntr_bounds_bitpos (desc_type
),
3880 fat_pntr_bounds_bitsize (desc_type
));
3882 descriptor
= ensure_lval (descriptor
, sp
);
3884 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3885 return value_addr (descriptor
);
3890 /* Dummy definitions for an experimental caching module that is not
3891 * used in the public sources. */
3894 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3895 struct symbol
**sym
, struct block
**block
)
3901 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3902 struct block
*block
)
3908 /* Return the result of a standard (literal, C-like) lookup of NAME in
3909 given DOMAIN, visible from lexical block BLOCK. */
3911 static struct symbol
*
3912 standard_lookup (const char *name
, const struct block
*block
,
3917 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3919 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3920 cache_symbol (name
, domain
, sym
, block_found
);
3925 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3926 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3927 since they contend in overloading in the same way. */
3929 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3933 for (i
= 0; i
< n
; i
+= 1)
3934 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3935 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3936 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3942 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3943 struct types. Otherwise, they may not. */
3946 equiv_types (struct type
*type0
, struct type
*type1
)
3950 if (type0
== NULL
|| type1
== NULL
3951 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3953 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3954 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3955 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3956 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3962 /* True iff SYM0 represents the same entity as SYM1, or one that is
3963 no more defined than that of SYM1. */
3966 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
3970 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
3971 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
3974 switch (SYMBOL_CLASS (sym0
))
3980 struct type
*type0
= SYMBOL_TYPE (sym0
);
3981 struct type
*type1
= SYMBOL_TYPE (sym1
);
3982 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
3983 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
3984 int len0
= strlen (name0
);
3986 TYPE_CODE (type0
) == TYPE_CODE (type1
)
3987 && (equiv_types (type0
, type1
)
3988 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
3989 && strncmp (name1
+ len0
, "___XV", 5) == 0));
3992 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
3993 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
3999 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4000 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4003 add_defn_to_vec (struct obstack
*obstackp
,
4005 struct block
*block
)
4009 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4011 /* Do not try to complete stub types, as the debugger is probably
4012 already scanning all symbols matching a certain name at the
4013 time when this function is called. Trying to replace the stub
4014 type by its associated full type will cause us to restart a scan
4015 which may lead to an infinite recursion. Instead, the client
4016 collecting the matching symbols will end up collecting several
4017 matches, with at least one of them complete. It can then filter
4018 out the stub ones if needed. */
4020 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4022 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4024 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4026 prevDefns
[i
].sym
= sym
;
4027 prevDefns
[i
].block
= block
;
4033 struct ada_symbol_info info
;
4037 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4041 /* Number of ada_symbol_info structures currently collected in
4042 current vector in *OBSTACKP. */
4045 num_defns_collected (struct obstack
*obstackp
)
4047 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4050 /* Vector of ada_symbol_info structures currently collected in current
4051 vector in *OBSTACKP. If FINISH, close off the vector and return
4052 its final address. */
4054 static struct ada_symbol_info
*
4055 defns_collected (struct obstack
*obstackp
, int finish
)
4058 return obstack_finish (obstackp
);
4060 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4063 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4064 Check the global symbols if GLOBAL, the static symbols if not.
4065 Do wild-card match if WILD. */
4067 static struct partial_symbol
*
4068 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4069 int global
, domain_enum
namespace, int wild
)
4071 struct partial_symbol
**start
;
4072 int name_len
= strlen (name
);
4073 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4082 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4083 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4087 for (i
= 0; i
< length
; i
+= 1)
4089 struct partial_symbol
*psym
= start
[i
];
4091 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4092 SYMBOL_DOMAIN (psym
), namespace)
4093 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4107 int M
= (U
+ i
) >> 1;
4108 struct partial_symbol
*psym
= start
[M
];
4109 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4111 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4113 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4124 struct partial_symbol
*psym
= start
[i
];
4126 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4127 SYMBOL_DOMAIN (psym
), namespace))
4129 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4137 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4151 int M
= (U
+ i
) >> 1;
4152 struct partial_symbol
*psym
= start
[M
];
4153 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4155 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4157 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4168 struct partial_symbol
*psym
= start
[i
];
4170 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4171 SYMBOL_DOMAIN (psym
), namespace))
4175 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4178 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4180 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4190 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4200 /* Return a minimal symbol matching NAME according to Ada decoding
4201 rules. Returns NULL if there is no such minimal symbol. Names
4202 prefixed with "standard__" are handled specially: "standard__" is
4203 first stripped off, and only static and global symbols are searched. */
4205 struct minimal_symbol
*
4206 ada_lookup_simple_minsym (const char *name
)
4208 struct objfile
*objfile
;
4209 struct minimal_symbol
*msymbol
;
4212 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4214 name
+= sizeof ("standard__") - 1;
4218 wild_match
= (strstr (name
, "__") == NULL
);
4220 ALL_MSYMBOLS (objfile
, msymbol
)
4222 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4223 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4230 /* For all subprograms that statically enclose the subprogram of the
4231 selected frame, add symbols matching identifier NAME in DOMAIN
4232 and their blocks to the list of data in OBSTACKP, as for
4233 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4237 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4238 const char *name
, domain_enum
namespace,
4243 /* True if TYPE is definitely an artificial type supplied to a symbol
4244 for which no debugging information was given in the symbol file. */
4247 is_nondebugging_type (struct type
*type
)
4249 char *name
= ada_type_name (type
);
4250 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4253 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4254 duplicate other symbols in the list (The only case I know of where
4255 this happens is when object files containing stabs-in-ecoff are
4256 linked with files containing ordinary ecoff debugging symbols (or no
4257 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4258 Returns the number of items in the modified list. */
4261 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4270 /* If two symbols have the same name and one of them is a stub type,
4271 the get rid of the stub. */
4273 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4274 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4276 for (j
= 0; j
< nsyms
; j
++)
4279 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4280 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4281 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4282 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4287 /* Two symbols with the same name, same class and same address
4288 should be identical. */
4290 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4291 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4292 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4294 for (j
= 0; j
< nsyms
; j
+= 1)
4297 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4298 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4299 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4300 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4301 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4302 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4309 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4310 syms
[j
- 1] = syms
[j
];
4319 /* Given a type that corresponds to a renaming entity, use the type name
4320 to extract the scope (package name or function name, fully qualified,
4321 and following the GNAT encoding convention) where this renaming has been
4322 defined. The string returned needs to be deallocated after use. */
4325 xget_renaming_scope (struct type
*renaming_type
)
4327 /* The renaming types adhere to the following convention:
4328 <scope>__<rename>___<XR extension>.
4329 So, to extract the scope, we search for the "___XR" extension,
4330 and then backtrack until we find the first "__". */
4332 const char *name
= type_name_no_tag (renaming_type
);
4333 char *suffix
= strstr (name
, "___XR");
4338 /* Now, backtrack a bit until we find the first "__". Start looking
4339 at suffix - 3, as the <rename> part is at least one character long. */
4341 for (last
= suffix
- 3; last
> name
; last
--)
4342 if (last
[0] == '_' && last
[1] == '_')
4345 /* Make a copy of scope and return it. */
4347 scope_len
= last
- name
;
4348 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4350 strncpy (scope
, name
, scope_len
);
4351 scope
[scope_len
] = '\0';
4356 /* Return nonzero if NAME corresponds to a package name. */
4359 is_package_name (const char *name
)
4361 /* Here, We take advantage of the fact that no symbols are generated
4362 for packages, while symbols are generated for each function.
4363 So the condition for NAME represent a package becomes equivalent
4364 to NAME not existing in our list of symbols. There is only one
4365 small complication with library-level functions (see below). */
4369 /* If it is a function that has not been defined at library level,
4370 then we should be able to look it up in the symbols. */
4371 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4374 /* Library-level function names start with "_ada_". See if function
4375 "_ada_" followed by NAME can be found. */
4377 /* Do a quick check that NAME does not contain "__", since library-level
4378 functions names cannot contain "__" in them. */
4379 if (strstr (name
, "__") != NULL
)
4382 fun_name
= xstrprintf ("_ada_%s", name
);
4384 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4387 /* Return nonzero if SYM corresponds to a renaming entity that is
4388 not visible from FUNCTION_NAME. */
4391 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4395 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4398 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4400 make_cleanup (xfree
, scope
);
4402 /* If the rename has been defined in a package, then it is visible. */
4403 if (is_package_name (scope
))
4406 /* Check that the rename is in the current function scope by checking
4407 that its name starts with SCOPE. */
4409 /* If the function name starts with "_ada_", it means that it is
4410 a library-level function. Strip this prefix before doing the
4411 comparison, as the encoding for the renaming does not contain
4413 if (strncmp (function_name
, "_ada_", 5) == 0)
4416 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4419 /* Remove entries from SYMS that corresponds to a renaming entity that
4420 is not visible from the function associated with CURRENT_BLOCK or
4421 that is superfluous due to the presence of more specific renaming
4422 information. Places surviving symbols in the initial entries of
4423 SYMS and returns the number of surviving symbols.
4426 First, in cases where an object renaming is implemented as a
4427 reference variable, GNAT may produce both the actual reference
4428 variable and the renaming encoding. In this case, we discard the
4431 Second, GNAT emits a type following a specified encoding for each renaming
4432 entity. Unfortunately, STABS currently does not support the definition
4433 of types that are local to a given lexical block, so all renamings types
4434 are emitted at library level. As a consequence, if an application
4435 contains two renaming entities using the same name, and a user tries to
4436 print the value of one of these entities, the result of the ada symbol
4437 lookup will also contain the wrong renaming type.
4439 This function partially covers for this limitation by attempting to
4440 remove from the SYMS list renaming symbols that should be visible
4441 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4442 method with the current information available. The implementation
4443 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4445 - When the user tries to print a rename in a function while there
4446 is another rename entity defined in a package: Normally, the
4447 rename in the function has precedence over the rename in the
4448 package, so the latter should be removed from the list. This is
4449 currently not the case.
4451 - This function will incorrectly remove valid renames if
4452 the CURRENT_BLOCK corresponds to a function which symbol name
4453 has been changed by an "Export" pragma. As a consequence,
4454 the user will be unable to print such rename entities. */
4457 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4458 int nsyms
, const struct block
*current_block
)
4460 struct symbol
*current_function
;
4461 char *current_function_name
;
4463 int is_new_style_renaming
;
4465 /* If there is both a renaming foo___XR... encoded as a variable and
4466 a simple variable foo in the same block, discard the latter.
4467 First, zero out such symbols, then compress. */
4468 is_new_style_renaming
= 0;
4469 for (i
= 0; i
< nsyms
; i
+= 1)
4471 struct symbol
*sym
= syms
[i
].sym
;
4472 struct block
*block
= syms
[i
].block
;
4476 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4478 name
= SYMBOL_LINKAGE_NAME (sym
);
4479 suffix
= strstr (name
, "___XR");
4483 int name_len
= suffix
- name
;
4485 is_new_style_renaming
= 1;
4486 for (j
= 0; j
< nsyms
; j
+= 1)
4487 if (i
!= j
&& syms
[j
].sym
!= NULL
4488 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4490 && block
== syms
[j
].block
)
4494 if (is_new_style_renaming
)
4498 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4499 if (syms
[j
].sym
!= NULL
)
4507 /* Extract the function name associated to CURRENT_BLOCK.
4508 Abort if unable to do so. */
4510 if (current_block
== NULL
)
4513 current_function
= block_linkage_function (current_block
);
4514 if (current_function
== NULL
)
4517 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4518 if (current_function_name
== NULL
)
4521 /* Check each of the symbols, and remove it from the list if it is
4522 a type corresponding to a renaming that is out of the scope of
4523 the current block. */
4528 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4529 == ADA_OBJECT_RENAMING
4530 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4533 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4534 syms
[j
- 1] = syms
[j
];
4544 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4545 whose name and domain match NAME and DOMAIN respectively.
4546 If no match was found, then extend the search to "enclosing"
4547 routines (in other words, if we're inside a nested function,
4548 search the symbols defined inside the enclosing functions).
4550 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4553 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4554 struct block
*block
, domain_enum domain
,
4557 int block_depth
= 0;
4559 while (block
!= NULL
)
4562 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4564 /* If we found a non-function match, assume that's the one. */
4565 if (is_nonfunction (defns_collected (obstackp
, 0),
4566 num_defns_collected (obstackp
)))
4569 block
= BLOCK_SUPERBLOCK (block
);
4572 /* If no luck so far, try to find NAME as a local symbol in some lexically
4573 enclosing subprogram. */
4574 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4575 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4578 /* Add to OBSTACKP all non-local symbols whose name and domain match
4579 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4580 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4583 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4584 domain_enum domain
, int global
,
4587 struct objfile
*objfile
;
4588 struct partial_symtab
*ps
;
4590 ALL_PSYMTABS (objfile
, ps
)
4594 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4596 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4597 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4599 if (s
== NULL
|| !s
->primary
)
4601 ada_add_block_symbols (obstackp
,
4602 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4603 name
, domain
, objfile
, wild_match
);
4608 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4609 scope and in global scopes, returning the number of matches. Sets
4610 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4611 indicating the symbols found and the blocks and symbol tables (if
4612 any) in which they were found. This vector are transient---good only to
4613 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4614 symbol match within the nest of blocks whose innermost member is BLOCK0,
4615 is the one match returned (no other matches in that or
4616 enclosing blocks is returned). If there are any matches in or
4617 surrounding BLOCK0, then these alone are returned. Otherwise, the
4618 search extends to global and file-scope (static) symbol tables.
4619 Names prefixed with "standard__" are handled specially: "standard__"
4620 is first stripped off, and only static and global symbols are searched. */
4623 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4624 domain_enum
namespace,
4625 struct ada_symbol_info
**results
)
4628 struct block
*block
;
4634 obstack_free (&symbol_list_obstack
, NULL
);
4635 obstack_init (&symbol_list_obstack
);
4639 /* Search specified block and its superiors. */
4641 wild_match
= (strstr (name0
, "__") == NULL
);
4643 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4644 needed, but adding const will
4645 have a cascade effect. */
4647 /* Special case: If the user specifies a symbol name inside package
4648 Standard, do a non-wild matching of the symbol name without
4649 the "standard__" prefix. This was primarily introduced in order
4650 to allow the user to specifically access the standard exceptions
4651 using, for instance, Standard.Constraint_Error when Constraint_Error
4652 is ambiguous (due to the user defining its own Constraint_Error
4653 entity inside its program). */
4654 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4658 name
= name0
+ sizeof ("standard__") - 1;
4661 /* Check the non-global symbols. If we have ANY match, then we're done. */
4663 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4665 if (num_defns_collected (&symbol_list_obstack
) > 0)
4668 /* No non-global symbols found. Check our cache to see if we have
4669 already performed this search before. If we have, then return
4673 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4676 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4680 /* Search symbols from all global blocks. */
4682 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4685 /* Now add symbols from all per-file blocks if we've gotten no hits
4686 (not strictly correct, but perhaps better than an error). */
4688 if (num_defns_collected (&symbol_list_obstack
) == 0)
4689 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4693 ndefns
= num_defns_collected (&symbol_list_obstack
);
4694 *results
= defns_collected (&symbol_list_obstack
, 1);
4696 ndefns
= remove_extra_symbols (*results
, ndefns
);
4699 cache_symbol (name0
, namespace, NULL
, NULL
);
4701 if (ndefns
== 1 && cacheIfUnique
)
4702 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4704 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4710 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4711 domain_enum
namespace, struct block
**block_found
)
4713 struct ada_symbol_info
*candidates
;
4716 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4718 if (n_candidates
== 0)
4721 if (block_found
!= NULL
)
4722 *block_found
= candidates
[0].block
;
4724 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4727 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4728 scope and in global scopes, or NULL if none. NAME is folded and
4729 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4730 choosing the first symbol if there are multiple choices.
4731 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4732 table in which the symbol was found (in both cases, these
4733 assignments occur only if the pointers are non-null). */
4735 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4736 domain_enum
namespace, int *is_a_field_of_this
)
4738 if (is_a_field_of_this
!= NULL
)
4739 *is_a_field_of_this
= 0;
4742 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4743 block0
, namespace, NULL
);
4746 static struct symbol
*
4747 ada_lookup_symbol_nonlocal (const char *name
,
4748 const char *linkage_name
,
4749 const struct block
*block
,
4750 const domain_enum domain
)
4752 if (linkage_name
== NULL
)
4753 linkage_name
= name
;
4754 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4759 /* True iff STR is a possible encoded suffix of a normal Ada name
4760 that is to be ignored for matching purposes. Suffixes of parallel
4761 names (e.g., XVE) are not included here. Currently, the possible suffixes
4762 are given by any of the regular expressions:
4764 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4765 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4766 _E[0-9]+[bs]$ [protected object entry suffixes]
4767 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4769 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4770 match is performed. This sequence is used to differentiate homonyms,
4771 is an optional part of a valid name suffix. */
4774 is_name_suffix (const char *str
)
4777 const char *matching
;
4778 const int len
= strlen (str
);
4780 /* Skip optional leading __[0-9]+. */
4782 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4785 while (isdigit (str
[0]))
4791 if (str
[0] == '.' || str
[0] == '$')
4794 while (isdigit (matching
[0]))
4796 if (matching
[0] == '\0')
4802 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4805 while (isdigit (matching
[0]))
4807 if (matching
[0] == '\0')
4812 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4813 with a N at the end. Unfortunately, the compiler uses the same
4814 convention for other internal types it creates. So treating
4815 all entity names that end with an "N" as a name suffix causes
4816 some regressions. For instance, consider the case of an enumerated
4817 type. To support the 'Image attribute, it creates an array whose
4819 Having a single character like this as a suffix carrying some
4820 information is a bit risky. Perhaps we should change the encoding
4821 to be something like "_N" instead. In the meantime, do not do
4822 the following check. */
4823 /* Protected Object Subprograms */
4824 if (len
== 1 && str
[0] == 'N')
4829 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4832 while (isdigit (matching
[0]))
4834 if ((matching
[0] == 'b' || matching
[0] == 's')
4835 && matching
[1] == '\0')
4839 /* ??? We should not modify STR directly, as we are doing below. This
4840 is fine in this case, but may become problematic later if we find
4841 that this alternative did not work, and want to try matching
4842 another one from the begining of STR. Since we modified it, we
4843 won't be able to find the begining of the string anymore! */
4847 while (str
[0] != '_' && str
[0] != '\0')
4849 if (str
[0] != 'n' && str
[0] != 'b')
4855 if (str
[0] == '\000')
4860 if (str
[1] != '_' || str
[2] == '\000')
4864 if (strcmp (str
+ 3, "JM") == 0)
4866 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4867 the LJM suffix in favor of the JM one. But we will
4868 still accept LJM as a valid suffix for a reasonable
4869 amount of time, just to allow ourselves to debug programs
4870 compiled using an older version of GNAT. */
4871 if (strcmp (str
+ 3, "LJM") == 0)
4875 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4876 || str
[4] == 'U' || str
[4] == 'P')
4878 if (str
[4] == 'R' && str
[5] != 'T')
4882 if (!isdigit (str
[2]))
4884 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4885 if (!isdigit (str
[k
]) && str
[k
] != '_')
4889 if (str
[0] == '$' && isdigit (str
[1]))
4891 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4892 if (!isdigit (str
[k
]) && str
[k
] != '_')
4899 /* Return non-zero if the string starting at NAME and ending before
4900 NAME_END contains no capital letters. */
4903 is_valid_name_for_wild_match (const char *name0
)
4905 const char *decoded_name
= ada_decode (name0
);
4908 /* If the decoded name starts with an angle bracket, it means that
4909 NAME0 does not follow the GNAT encoding format. It should then
4910 not be allowed as a possible wild match. */
4911 if (decoded_name
[0] == '<')
4914 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4915 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4921 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4922 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4923 informational suffixes of NAME (i.e., for which is_name_suffix is
4927 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4934 match
= strstr (start
, patn0
);
4939 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4940 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4941 && is_name_suffix (match
+ patn_len
))
4942 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
4947 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4948 vector *defn_symbols, updating the list of symbols in OBSTACKP
4949 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4950 OBJFILE is the section containing BLOCK.
4951 SYMTAB is recorded with each symbol added. */
4954 ada_add_block_symbols (struct obstack
*obstackp
,
4955 struct block
*block
, const char *name
,
4956 domain_enum domain
, struct objfile
*objfile
,
4959 struct dict_iterator iter
;
4960 int name_len
= strlen (name
);
4961 /* A matching argument symbol, if any. */
4962 struct symbol
*arg_sym
;
4963 /* Set true when we find a matching non-argument symbol. */
4972 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4974 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4975 SYMBOL_DOMAIN (sym
), domain
)
4976 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
4978 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4980 else if (SYMBOL_IS_ARGUMENT (sym
))
4985 add_defn_to_vec (obstackp
,
4986 fixup_symbol_section (sym
, objfile
),
4994 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4996 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4997 SYMBOL_DOMAIN (sym
), domain
))
4999 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5001 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5003 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5005 if (SYMBOL_IS_ARGUMENT (sym
))
5010 add_defn_to_vec (obstackp
,
5011 fixup_symbol_section (sym
, objfile
),
5020 if (!found_sym
&& arg_sym
!= NULL
)
5022 add_defn_to_vec (obstackp
,
5023 fixup_symbol_section (arg_sym
, objfile
),
5032 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5034 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5035 SYMBOL_DOMAIN (sym
), domain
))
5039 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5042 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5044 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5049 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5051 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5053 if (SYMBOL_IS_ARGUMENT (sym
))
5058 add_defn_to_vec (obstackp
,
5059 fixup_symbol_section (sym
, objfile
),
5067 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5068 They aren't parameters, right? */
5069 if (!found_sym
&& arg_sym
!= NULL
)
5071 add_defn_to_vec (obstackp
,
5072 fixup_symbol_section (arg_sym
, objfile
),
5079 /* Symbol Completion */
5081 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5082 name in a form that's appropriate for the completion. The result
5083 does not need to be deallocated, but is only good until the next call.
5085 TEXT_LEN is equal to the length of TEXT.
5086 Perform a wild match if WILD_MATCH is set.
5087 ENCODED should be set if TEXT represents the start of a symbol name
5088 in its encoded form. */
5091 symbol_completion_match (const char *sym_name
,
5092 const char *text
, int text_len
,
5093 int wild_match
, int encoded
)
5096 const int verbatim_match
= (text
[0] == '<');
5101 /* Strip the leading angle bracket. */
5106 /* First, test against the fully qualified name of the symbol. */
5108 if (strncmp (sym_name
, text
, text_len
) == 0)
5111 if (match
&& !encoded
)
5113 /* One needed check before declaring a positive match is to verify
5114 that iff we are doing a verbatim match, the decoded version
5115 of the symbol name starts with '<'. Otherwise, this symbol name
5116 is not a suitable completion. */
5117 const char *sym_name_copy
= sym_name
;
5118 int has_angle_bracket
;
5120 sym_name
= ada_decode (sym_name
);
5121 has_angle_bracket
= (sym_name
[0] == '<');
5122 match
= (has_angle_bracket
== verbatim_match
);
5123 sym_name
= sym_name_copy
;
5126 if (match
&& !verbatim_match
)
5128 /* When doing non-verbatim match, another check that needs to
5129 be done is to verify that the potentially matching symbol name
5130 does not include capital letters, because the ada-mode would
5131 not be able to understand these symbol names without the
5132 angle bracket notation. */
5135 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5140 /* Second: Try wild matching... */
5142 if (!match
&& wild_match
)
5144 /* Since we are doing wild matching, this means that TEXT
5145 may represent an unqualified symbol name. We therefore must
5146 also compare TEXT against the unqualified name of the symbol. */
5147 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5149 if (strncmp (sym_name
, text
, text_len
) == 0)
5153 /* Finally: If we found a mach, prepare the result to return. */
5159 sym_name
= add_angle_brackets (sym_name
);
5162 sym_name
= ada_decode (sym_name
);
5167 typedef char *char_ptr
;
5168 DEF_VEC_P (char_ptr
);
5170 /* A companion function to ada_make_symbol_completion_list().
5171 Check if SYM_NAME represents a symbol which name would be suitable
5172 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5173 it is appended at the end of the given string vector SV.
5175 ORIG_TEXT is the string original string from the user command
5176 that needs to be completed. WORD is the entire command on which
5177 completion should be performed. These two parameters are used to
5178 determine which part of the symbol name should be added to the
5180 if WILD_MATCH is set, then wild matching is performed.
5181 ENCODED should be set if TEXT represents a symbol name in its
5182 encoded formed (in which case the completion should also be
5186 symbol_completion_add (VEC(char_ptr
) **sv
,
5187 const char *sym_name
,
5188 const char *text
, int text_len
,
5189 const char *orig_text
, const char *word
,
5190 int wild_match
, int encoded
)
5192 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5193 wild_match
, encoded
);
5199 /* We found a match, so add the appropriate completion to the given
5202 if (word
== orig_text
)
5204 completion
= xmalloc (strlen (match
) + 5);
5205 strcpy (completion
, match
);
5207 else if (word
> orig_text
)
5209 /* Return some portion of sym_name. */
5210 completion
= xmalloc (strlen (match
) + 5);
5211 strcpy (completion
, match
+ (word
- orig_text
));
5215 /* Return some of ORIG_TEXT plus sym_name. */
5216 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5217 strncpy (completion
, word
, orig_text
- word
);
5218 completion
[orig_text
- word
] = '\0';
5219 strcat (completion
, match
);
5222 VEC_safe_push (char_ptr
, *sv
, completion
);
5225 /* Return a list of possible symbol names completing TEXT0. The list
5226 is NULL terminated. WORD is the entire command on which completion
5230 ada_make_symbol_completion_list (char *text0
, char *word
)
5236 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5239 struct partial_symtab
*ps
;
5240 struct minimal_symbol
*msymbol
;
5241 struct objfile
*objfile
;
5242 struct block
*b
, *surrounding_static_block
= 0;
5244 struct dict_iterator iter
;
5246 if (text0
[0] == '<')
5248 text
= xstrdup (text0
);
5249 make_cleanup (xfree
, text
);
5250 text_len
= strlen (text
);
5256 text
= xstrdup (ada_encode (text0
));
5257 make_cleanup (xfree
, text
);
5258 text_len
= strlen (text
);
5259 for (i
= 0; i
< text_len
; i
++)
5260 text
[i
] = tolower (text
[i
]);
5262 encoded
= (strstr (text0
, "__") != NULL
);
5263 /* If the name contains a ".", then the user is entering a fully
5264 qualified entity name, and the match must not be done in wild
5265 mode. Similarly, if the user wants to complete what looks like
5266 an encoded name, the match must not be done in wild mode. */
5267 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5270 /* First, look at the partial symtab symbols. */
5271 ALL_PSYMTABS (objfile
, ps
)
5273 struct partial_symbol
**psym
;
5275 /* If the psymtab's been read in we'll get it when we search
5276 through the blockvector. */
5280 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5281 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5282 + ps
->n_global_syms
); psym
++)
5285 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5286 text
, text_len
, text0
, word
,
5287 wild_match
, encoded
);
5290 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5291 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5292 + ps
->n_static_syms
); psym
++)
5295 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5296 text
, text_len
, text0
, word
,
5297 wild_match
, encoded
);
5301 /* At this point scan through the misc symbol vectors and add each
5302 symbol you find to the list. Eventually we want to ignore
5303 anything that isn't a text symbol (everything else will be
5304 handled by the psymtab code above). */
5306 ALL_MSYMBOLS (objfile
, msymbol
)
5309 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5310 text
, text_len
, text0
, word
, wild_match
, encoded
);
5313 /* Search upwards from currently selected frame (so that we can
5314 complete on local vars. */
5316 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5318 if (!BLOCK_SUPERBLOCK (b
))
5319 surrounding_static_block
= b
; /* For elmin of dups */
5321 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5323 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5324 text
, text_len
, text0
, word
,
5325 wild_match
, encoded
);
5329 /* Go through the symtabs and check the externs and statics for
5330 symbols which match. */
5332 ALL_SYMTABS (objfile
, s
)
5335 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5336 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5338 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5339 text
, text_len
, text0
, word
,
5340 wild_match
, encoded
);
5344 ALL_SYMTABS (objfile
, s
)
5347 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5348 /* Don't do this block twice. */
5349 if (b
== surrounding_static_block
)
5351 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5353 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5354 text
, text_len
, text0
, word
,
5355 wild_match
, encoded
);
5359 /* Append the closing NULL entry. */
5360 VEC_safe_push (char_ptr
, completions
, NULL
);
5362 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5363 return the copy. It's unfortunate that we have to make a copy
5364 of an array that we're about to destroy, but there is nothing much
5365 we can do about it. Fortunately, it's typically not a very large
5368 const size_t completions_size
=
5369 VEC_length (char_ptr
, completions
) * sizeof (char *);
5370 char **result
= malloc (completions_size
);
5372 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5374 VEC_free (char_ptr
, completions
);
5381 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5382 for tagged types. */
5385 ada_is_dispatch_table_ptr_type (struct type
*type
)
5389 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5392 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5396 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5399 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5400 to be invisible to users. */
5403 ada_is_ignored_field (struct type
*type
, int field_num
)
5405 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5408 /* Check the name of that field. */
5410 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5412 /* Anonymous field names should not be printed.
5413 brobecker/2007-02-20: I don't think this can actually happen
5414 but we don't want to print the value of annonymous fields anyway. */
5418 /* A field named "_parent" is internally generated by GNAT for
5419 tagged types, and should not be printed either. */
5420 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5424 /* If this is the dispatch table of a tagged type, then ignore. */
5425 if (ada_is_tagged_type (type
, 1)
5426 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5429 /* Not a special field, so it should not be ignored. */
5433 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5434 pointer or reference type whose ultimate target has a tag field. */
5437 ada_is_tagged_type (struct type
*type
, int refok
)
5439 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5442 /* True iff TYPE represents the type of X'Tag */
5445 ada_is_tag_type (struct type
*type
)
5447 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5451 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5452 return (name
!= NULL
5453 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5457 /* The type of the tag on VAL. */
5460 ada_tag_type (struct value
*val
)
5462 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5465 /* The value of the tag on VAL. */
5468 ada_value_tag (struct value
*val
)
5470 return ada_value_struct_elt (val
, "_tag", 0);
5473 /* The value of the tag on the object of type TYPE whose contents are
5474 saved at VALADDR, if it is non-null, or is at memory address
5477 static struct value
*
5478 value_tag_from_contents_and_address (struct type
*type
,
5479 const gdb_byte
*valaddr
,
5482 int tag_byte_offset
, dummy1
, dummy2
;
5483 struct type
*tag_type
;
5484 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5487 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5489 : valaddr
+ tag_byte_offset
);
5490 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5492 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5497 static struct type
*
5498 type_from_tag (struct value
*tag
)
5500 const char *type_name
= ada_tag_name (tag
);
5501 if (type_name
!= NULL
)
5502 return ada_find_any_type (ada_encode (type_name
));
5513 static int ada_tag_name_1 (void *);
5514 static int ada_tag_name_2 (struct tag_args
*);
5516 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5517 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5518 The value stored in ARGS->name is valid until the next call to
5522 ada_tag_name_1 (void *args0
)
5524 struct tag_args
*args
= (struct tag_args
*) args0
;
5525 static char name
[1024];
5529 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5531 return ada_tag_name_2 (args
);
5532 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5535 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5536 for (p
= name
; *p
!= '\0'; p
+= 1)
5543 /* Utility function for ada_tag_name_1 that tries the second
5544 representation for the dispatch table (in which there is no
5545 explicit 'tsd' field in the referent of the tag pointer, and instead
5546 the tsd pointer is stored just before the dispatch table. */
5549 ada_tag_name_2 (struct tag_args
*args
)
5551 struct type
*info_type
;
5552 static char name
[1024];
5554 struct value
*val
, *valp
;
5557 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5558 if (info_type
== NULL
)
5560 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5561 valp
= value_cast (info_type
, args
->tag
);
5564 val
= value_ind (value_ptradd (valp
,
5565 value_from_longest (builtin_type_int8
, -1)));
5568 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5571 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5572 for (p
= name
; *p
!= '\0'; p
+= 1)
5579 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5583 ada_tag_name (struct value
*tag
)
5585 struct tag_args args
;
5586 if (!ada_is_tag_type (value_type (tag
)))
5590 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5594 /* The parent type of TYPE, or NULL if none. */
5597 ada_parent_type (struct type
*type
)
5601 type
= ada_check_typedef (type
);
5603 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5606 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5607 if (ada_is_parent_field (type
, i
))
5609 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5611 /* If the _parent field is a pointer, then dereference it. */
5612 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5613 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5614 /* If there is a parallel XVS type, get the actual base type. */
5615 parent_type
= ada_get_base_type (parent_type
);
5617 return ada_check_typedef (parent_type
);
5623 /* True iff field number FIELD_NUM of structure type TYPE contains the
5624 parent-type (inherited) fields of a derived type. Assumes TYPE is
5625 a structure type with at least FIELD_NUM+1 fields. */
5628 ada_is_parent_field (struct type
*type
, int field_num
)
5630 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5631 return (name
!= NULL
5632 && (strncmp (name
, "PARENT", 6) == 0
5633 || strncmp (name
, "_parent", 7) == 0));
5636 /* True iff field number FIELD_NUM of structure type TYPE is a
5637 transparent wrapper field (which should be silently traversed when doing
5638 field selection and flattened when printing). Assumes TYPE is a
5639 structure type with at least FIELD_NUM+1 fields. Such fields are always
5643 ada_is_wrapper_field (struct type
*type
, int field_num
)
5645 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5646 return (name
!= NULL
5647 && (strncmp (name
, "PARENT", 6) == 0
5648 || strcmp (name
, "REP") == 0
5649 || strncmp (name
, "_parent", 7) == 0
5650 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5653 /* True iff field number FIELD_NUM of structure or union type TYPE
5654 is a variant wrapper. Assumes TYPE is a structure type with at least
5655 FIELD_NUM+1 fields. */
5658 ada_is_variant_part (struct type
*type
, int field_num
)
5660 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5661 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5662 || (is_dynamic_field (type
, field_num
)
5663 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5664 == TYPE_CODE_UNION
)));
5667 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5668 whose discriminants are contained in the record type OUTER_TYPE,
5669 returns the type of the controlling discriminant for the variant. */
5672 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5674 char *name
= ada_variant_discrim_name (var_type
);
5676 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5678 return builtin_type_int32
;
5683 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5684 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5685 represents a 'when others' clause; otherwise 0. */
5688 ada_is_others_clause (struct type
*type
, int field_num
)
5690 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5691 return (name
!= NULL
&& name
[0] == 'O');
5694 /* Assuming that TYPE0 is the type of the variant part of a record,
5695 returns the name of the discriminant controlling the variant.
5696 The value is valid until the next call to ada_variant_discrim_name. */
5699 ada_variant_discrim_name (struct type
*type0
)
5701 static char *result
= NULL
;
5702 static size_t result_len
= 0;
5705 const char *discrim_end
;
5706 const char *discrim_start
;
5708 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5709 type
= TYPE_TARGET_TYPE (type0
);
5713 name
= ada_type_name (type
);
5715 if (name
== NULL
|| name
[0] == '\000')
5718 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5721 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5724 if (discrim_end
== name
)
5727 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5730 if (discrim_start
== name
+ 1)
5732 if ((discrim_start
> name
+ 3
5733 && strncmp (discrim_start
- 3, "___", 3) == 0)
5734 || discrim_start
[-1] == '.')
5738 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5739 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5740 result
[discrim_end
- discrim_start
] = '\0';
5744 /* Scan STR for a subtype-encoded number, beginning at position K.
5745 Put the position of the character just past the number scanned in
5746 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5747 Return 1 if there was a valid number at the given position, and 0
5748 otherwise. A "subtype-encoded" number consists of the absolute value
5749 in decimal, followed by the letter 'm' to indicate a negative number.
5750 Assumes 0m does not occur. */
5753 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5757 if (!isdigit (str
[k
]))
5760 /* Do it the hard way so as not to make any assumption about
5761 the relationship of unsigned long (%lu scan format code) and
5764 while (isdigit (str
[k
]))
5766 RU
= RU
* 10 + (str
[k
] - '0');
5773 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5779 /* NOTE on the above: Technically, C does not say what the results of
5780 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5781 number representable as a LONGEST (although either would probably work
5782 in most implementations). When RU>0, the locution in the then branch
5783 above is always equivalent to the negative of RU. */
5790 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5791 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5792 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5795 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5797 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5810 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5819 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5820 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5822 if (val
>= L
&& val
<= U
)
5834 /* FIXME: Lots of redundancy below. Try to consolidate. */
5836 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5837 ARG_TYPE, extract and return the value of one of its (non-static)
5838 fields. FIELDNO says which field. Differs from value_primitive_field
5839 only in that it can handle packed values of arbitrary type. */
5841 static struct value
*
5842 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5843 struct type
*arg_type
)
5847 arg_type
= ada_check_typedef (arg_type
);
5848 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5850 /* Handle packed fields. */
5852 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5854 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5855 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5857 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5858 offset
+ bit_pos
/ 8,
5859 bit_pos
% 8, bit_size
, type
);
5862 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5865 /* Find field with name NAME in object of type TYPE. If found,
5866 set the following for each argument that is non-null:
5867 - *FIELD_TYPE_P to the field's type;
5868 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5869 an object of that type;
5870 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5871 - *BIT_SIZE_P to its size in bits if the field is packed, and
5873 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5874 fields up to but not including the desired field, or by the total
5875 number of fields if not found. A NULL value of NAME never
5876 matches; the function just counts visible fields in this case.
5878 Returns 1 if found, 0 otherwise. */
5881 find_struct_field (char *name
, struct type
*type
, int offset
,
5882 struct type
**field_type_p
,
5883 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5888 type
= ada_check_typedef (type
);
5890 if (field_type_p
!= NULL
)
5891 *field_type_p
= NULL
;
5892 if (byte_offset_p
!= NULL
)
5894 if (bit_offset_p
!= NULL
)
5896 if (bit_size_p
!= NULL
)
5899 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5901 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5902 int fld_offset
= offset
+ bit_pos
/ 8;
5903 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5905 if (t_field_name
== NULL
)
5908 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5910 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5911 if (field_type_p
!= NULL
)
5912 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5913 if (byte_offset_p
!= NULL
)
5914 *byte_offset_p
= fld_offset
;
5915 if (bit_offset_p
!= NULL
)
5916 *bit_offset_p
= bit_pos
% 8;
5917 if (bit_size_p
!= NULL
)
5918 *bit_size_p
= bit_size
;
5921 else if (ada_is_wrapper_field (type
, i
))
5923 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5924 field_type_p
, byte_offset_p
, bit_offset_p
,
5925 bit_size_p
, index_p
))
5928 else if (ada_is_variant_part (type
, i
))
5930 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5933 struct type
*field_type
5934 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5936 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5938 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5940 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5941 field_type_p
, byte_offset_p
,
5942 bit_offset_p
, bit_size_p
, index_p
))
5946 else if (index_p
!= NULL
)
5952 /* Number of user-visible fields in record type TYPE. */
5955 num_visible_fields (struct type
*type
)
5959 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5963 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5964 and search in it assuming it has (class) type TYPE.
5965 If found, return value, else return NULL.
5967 Searches recursively through wrapper fields (e.g., '_parent'). */
5969 static struct value
*
5970 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5974 type
= ada_check_typedef (type
);
5976 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5978 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5980 if (t_field_name
== NULL
)
5983 else if (field_name_match (t_field_name
, name
))
5984 return ada_value_primitive_field (arg
, offset
, i
, type
);
5986 else if (ada_is_wrapper_field (type
, i
))
5988 struct value
*v
= /* Do not let indent join lines here. */
5989 ada_search_struct_field (name
, arg
,
5990 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5991 TYPE_FIELD_TYPE (type
, i
));
5996 else if (ada_is_variant_part (type
, i
))
5998 /* PNH: Do we ever get here? See find_struct_field. */
6000 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6001 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6003 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6005 struct value
*v
= ada_search_struct_field
/* Force line break. */
6007 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6008 TYPE_FIELD_TYPE (field_type
, j
));
6017 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6018 int, struct type
*);
6021 /* Return field #INDEX in ARG, where the index is that returned by
6022 * find_struct_field through its INDEX_P argument. Adjust the address
6023 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6024 * If found, return value, else return NULL. */
6026 static struct value
*
6027 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6030 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6034 /* Auxiliary function for ada_index_struct_field. Like
6035 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6038 static struct value
*
6039 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6043 type
= ada_check_typedef (type
);
6045 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6047 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6049 else if (ada_is_wrapper_field (type
, i
))
6051 struct value
*v
= /* Do not let indent join lines here. */
6052 ada_index_struct_field_1 (index_p
, arg
,
6053 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6054 TYPE_FIELD_TYPE (type
, i
));
6059 else if (ada_is_variant_part (type
, i
))
6061 /* PNH: Do we ever get here? See ada_search_struct_field,
6062 find_struct_field. */
6063 error (_("Cannot assign this kind of variant record"));
6065 else if (*index_p
== 0)
6066 return ada_value_primitive_field (arg
, offset
, i
, type
);
6073 /* Given ARG, a value of type (pointer or reference to a)*
6074 structure/union, extract the component named NAME from the ultimate
6075 target structure/union and return it as a value with its
6078 The routine searches for NAME among all members of the structure itself
6079 and (recursively) among all members of any wrapper members
6082 If NO_ERR, then simply return NULL in case of error, rather than
6086 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6088 struct type
*t
, *t1
;
6092 t1
= t
= ada_check_typedef (value_type (arg
));
6093 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6095 t1
= TYPE_TARGET_TYPE (t
);
6098 t1
= ada_check_typedef (t1
);
6099 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6101 arg
= coerce_ref (arg
);
6106 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6108 t1
= TYPE_TARGET_TYPE (t
);
6111 t1
= ada_check_typedef (t1
);
6112 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6114 arg
= value_ind (arg
);
6121 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6125 v
= ada_search_struct_field (name
, arg
, 0, t
);
6128 int bit_offset
, bit_size
, byte_offset
;
6129 struct type
*field_type
;
6132 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6133 address
= value_as_address (arg
);
6135 address
= unpack_pointer (t
, value_contents (arg
));
6137 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6138 if (find_struct_field (name
, t1
, 0,
6139 &field_type
, &byte_offset
, &bit_offset
,
6144 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6145 arg
= ada_coerce_ref (arg
);
6147 arg
= ada_value_ind (arg
);
6148 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6149 bit_offset
, bit_size
,
6153 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6157 if (v
!= NULL
|| no_err
)
6160 error (_("There is no member named %s."), name
);
6166 error (_("Attempt to extract a component of a value that is not a record."));
6169 /* Given a type TYPE, look up the type of the component of type named NAME.
6170 If DISPP is non-null, add its byte displacement from the beginning of a
6171 structure (pointed to by a value) of type TYPE to *DISPP (does not
6172 work for packed fields).
6174 Matches any field whose name has NAME as a prefix, possibly
6177 TYPE can be either a struct or union. If REFOK, TYPE may also
6178 be a (pointer or reference)+ to a struct or union, and the
6179 ultimate target type will be searched.
6181 Looks recursively into variant clauses and parent types.
6183 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6184 TYPE is not a type of the right kind. */
6186 static struct type
*
6187 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6188 int noerr
, int *dispp
)
6195 if (refok
&& type
!= NULL
)
6198 type
= ada_check_typedef (type
);
6199 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6200 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6202 type
= TYPE_TARGET_TYPE (type
);
6206 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6207 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6213 target_terminal_ours ();
6214 gdb_flush (gdb_stdout
);
6216 error (_("Type (null) is not a structure or union type"));
6219 /* XXX: type_sprint */
6220 fprintf_unfiltered (gdb_stderr
, _("Type "));
6221 type_print (type
, "", gdb_stderr
, -1);
6222 error (_(" is not a structure or union type"));
6227 type
= to_static_fixed_type (type
);
6229 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6231 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6235 if (t_field_name
== NULL
)
6238 else if (field_name_match (t_field_name
, name
))
6241 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6242 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6245 else if (ada_is_wrapper_field (type
, i
))
6248 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6253 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6258 else if (ada_is_variant_part (type
, i
))
6261 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6263 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6265 /* FIXME pnh 2008/01/26: We check for a field that is
6266 NOT wrapped in a struct, since the compiler sometimes
6267 generates these for unchecked variant types. Revisit
6268 if the compiler changes this practice. */
6269 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6271 if (v_field_name
!= NULL
6272 && field_name_match (v_field_name
, name
))
6273 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6275 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6281 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6292 target_terminal_ours ();
6293 gdb_flush (gdb_stdout
);
6296 /* XXX: type_sprint */
6297 fprintf_unfiltered (gdb_stderr
, _("Type "));
6298 type_print (type
, "", gdb_stderr
, -1);
6299 error (_(" has no component named <null>"));
6303 /* XXX: type_sprint */
6304 fprintf_unfiltered (gdb_stderr
, _("Type "));
6305 type_print (type
, "", gdb_stderr
, -1);
6306 error (_(" has no component named %s"), name
);
6313 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6314 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6315 represents an unchecked union (that is, the variant part of a
6316 record that is named in an Unchecked_Union pragma). */
6319 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6321 char *discrim_name
= ada_variant_discrim_name (var_type
);
6322 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6327 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6328 within a value of type OUTER_TYPE that is stored in GDB at
6329 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6330 numbering from 0) is applicable. Returns -1 if none are. */
6333 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6334 const gdb_byte
*outer_valaddr
)
6338 char *discrim_name
= ada_variant_discrim_name (var_type
);
6339 struct value
*outer
;
6340 struct value
*discrim
;
6341 LONGEST discrim_val
;
6343 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6344 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6345 if (discrim
== NULL
)
6347 discrim_val
= value_as_long (discrim
);
6350 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6352 if (ada_is_others_clause (var_type
, i
))
6354 else if (ada_in_variant (discrim_val
, var_type
, i
))
6358 return others_clause
;
6363 /* Dynamic-Sized Records */
6365 /* Strategy: The type ostensibly attached to a value with dynamic size
6366 (i.e., a size that is not statically recorded in the debugging
6367 data) does not accurately reflect the size or layout of the value.
6368 Our strategy is to convert these values to values with accurate,
6369 conventional types that are constructed on the fly. */
6371 /* There is a subtle and tricky problem here. In general, we cannot
6372 determine the size of dynamic records without its data. However,
6373 the 'struct value' data structure, which GDB uses to represent
6374 quantities in the inferior process (the target), requires the size
6375 of the type at the time of its allocation in order to reserve space
6376 for GDB's internal copy of the data. That's why the
6377 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6378 rather than struct value*s.
6380 However, GDB's internal history variables ($1, $2, etc.) are
6381 struct value*s containing internal copies of the data that are not, in
6382 general, the same as the data at their corresponding addresses in
6383 the target. Fortunately, the types we give to these values are all
6384 conventional, fixed-size types (as per the strategy described
6385 above), so that we don't usually have to perform the
6386 'to_fixed_xxx_type' conversions to look at their values.
6387 Unfortunately, there is one exception: if one of the internal
6388 history variables is an array whose elements are unconstrained
6389 records, then we will need to create distinct fixed types for each
6390 element selected. */
6392 /* The upshot of all of this is that many routines take a (type, host
6393 address, target address) triple as arguments to represent a value.
6394 The host address, if non-null, is supposed to contain an internal
6395 copy of the relevant data; otherwise, the program is to consult the
6396 target at the target address. */
6398 /* Assuming that VAL0 represents a pointer value, the result of
6399 dereferencing it. Differs from value_ind in its treatment of
6400 dynamic-sized types. */
6403 ada_value_ind (struct value
*val0
)
6405 struct value
*val
= unwrap_value (value_ind (val0
));
6406 return ada_to_fixed_value (val
);
6409 /* The value resulting from dereferencing any "reference to"
6410 qualifiers on VAL0. */
6412 static struct value
*
6413 ada_coerce_ref (struct value
*val0
)
6415 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6417 struct value
*val
= val0
;
6418 val
= coerce_ref (val
);
6419 val
= unwrap_value (val
);
6420 return ada_to_fixed_value (val
);
6426 /* Return OFF rounded upward if necessary to a multiple of
6427 ALIGNMENT (a power of 2). */
6430 align_value (unsigned int off
, unsigned int alignment
)
6432 return (off
+ alignment
- 1) & ~(alignment
- 1);
6435 /* Return the bit alignment required for field #F of template type TYPE. */
6438 field_alignment (struct type
*type
, int f
)
6440 const char *name
= TYPE_FIELD_NAME (type
, f
);
6444 /* The field name should never be null, unless the debugging information
6445 is somehow malformed. In this case, we assume the field does not
6446 require any alignment. */
6450 len
= strlen (name
);
6452 if (!isdigit (name
[len
- 1]))
6455 if (isdigit (name
[len
- 2]))
6456 align_offset
= len
- 2;
6458 align_offset
= len
- 1;
6460 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6461 return TARGET_CHAR_BIT
;
6463 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6466 /* Find a symbol named NAME. Ignores ambiguity. */
6469 ada_find_any_symbol (const char *name
)
6473 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6474 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6477 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6481 /* Find a type named NAME. Ignores ambiguity. This routine will look
6482 solely for types defined by debug info, it will not search the GDB
6486 ada_find_any_type (const char *name
)
6488 struct symbol
*sym
= ada_find_any_symbol (name
);
6491 return SYMBOL_TYPE (sym
);
6496 /* Given NAME and an associated BLOCK, search all symbols for
6497 NAME suffixed with "___XR", which is the ``renaming'' symbol
6498 associated to NAME. Return this symbol if found, return
6502 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6506 sym
= find_old_style_renaming_symbol (name
, block
);
6511 /* Not right yet. FIXME pnh 7/20/2007. */
6512 sym
= ada_find_any_symbol (name
);
6513 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6519 static struct symbol
*
6520 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6522 const struct symbol
*function_sym
= block_linkage_function (block
);
6525 if (function_sym
!= NULL
)
6527 /* If the symbol is defined inside a function, NAME is not fully
6528 qualified. This means we need to prepend the function name
6529 as well as adding the ``___XR'' suffix to build the name of
6530 the associated renaming symbol. */
6531 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6532 /* Function names sometimes contain suffixes used
6533 for instance to qualify nested subprograms. When building
6534 the XR type name, we need to make sure that this suffix is
6535 not included. So do not include any suffix in the function
6536 name length below. */
6537 const int function_name_len
= ada_name_prefix_len (function_name
);
6538 const int rename_len
= function_name_len
+ 2 /* "__" */
6539 + strlen (name
) + 6 /* "___XR\0" */ ;
6541 /* Strip the suffix if necessary. */
6542 function_name
[function_name_len
] = '\0';
6544 /* Library-level functions are a special case, as GNAT adds
6545 a ``_ada_'' prefix to the function name to avoid namespace
6546 pollution. However, the renaming symbols themselves do not
6547 have this prefix, so we need to skip this prefix if present. */
6548 if (function_name_len
> 5 /* "_ada_" */
6549 && strstr (function_name
, "_ada_") == function_name
)
6550 function_name
= function_name
+ 5;
6552 rename
= (char *) alloca (rename_len
* sizeof (char));
6553 xsnprintf (rename
, rename_len
* sizeof (char), "%s__%s___XR",
6554 function_name
, name
);
6558 const int rename_len
= strlen (name
) + 6;
6559 rename
= (char *) alloca (rename_len
* sizeof (char));
6560 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6563 return ada_find_any_symbol (rename
);
6566 /* Because of GNAT encoding conventions, several GDB symbols may match a
6567 given type name. If the type denoted by TYPE0 is to be preferred to
6568 that of TYPE1 for purposes of type printing, return non-zero;
6569 otherwise return 0. */
6572 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6576 else if (type0
== NULL
)
6578 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6580 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6582 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6584 else if (ada_is_packed_array_type (type0
))
6586 else if (ada_is_array_descriptor_type (type0
)
6587 && !ada_is_array_descriptor_type (type1
))
6591 const char *type0_name
= type_name_no_tag (type0
);
6592 const char *type1_name
= type_name_no_tag (type1
);
6594 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6595 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6601 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6602 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6605 ada_type_name (struct type
*type
)
6609 else if (TYPE_NAME (type
) != NULL
)
6610 return TYPE_NAME (type
);
6612 return TYPE_TAG_NAME (type
);
6615 /* Find a parallel type to TYPE whose name is formed by appending
6616 SUFFIX to the name of TYPE. */
6619 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6622 static size_t name_len
= 0;
6624 char *typename
= ada_type_name (type
);
6626 if (typename
== NULL
)
6629 len
= strlen (typename
);
6631 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6633 strcpy (name
, typename
);
6634 strcpy (name
+ len
, suffix
);
6636 return ada_find_any_type (name
);
6640 /* If TYPE is a variable-size record type, return the corresponding template
6641 type describing its fields. Otherwise, return NULL. */
6643 static struct type
*
6644 dynamic_template_type (struct type
*type
)
6646 type
= ada_check_typedef (type
);
6648 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6649 || ada_type_name (type
) == NULL
)
6653 int len
= strlen (ada_type_name (type
));
6654 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6657 return ada_find_parallel_type (type
, "___XVE");
6661 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6662 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6665 is_dynamic_field (struct type
*templ_type
, int field_num
)
6667 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6669 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6670 && strstr (name
, "___XVL") != NULL
;
6673 /* The index of the variant field of TYPE, or -1 if TYPE does not
6674 represent a variant record type. */
6677 variant_field_index (struct type
*type
)
6681 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6684 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6686 if (ada_is_variant_part (type
, f
))
6692 /* A record type with no fields. */
6694 static struct type
*
6695 empty_record (struct objfile
*objfile
)
6697 struct type
*type
= alloc_type (objfile
);
6698 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6699 TYPE_NFIELDS (type
) = 0;
6700 TYPE_FIELDS (type
) = NULL
;
6701 INIT_CPLUS_SPECIFIC (type
);
6702 TYPE_NAME (type
) = "<empty>";
6703 TYPE_TAG_NAME (type
) = NULL
;
6704 TYPE_LENGTH (type
) = 0;
6708 /* An ordinary record type (with fixed-length fields) that describes
6709 the value of type TYPE at VALADDR or ADDRESS (see comments at
6710 the beginning of this section) VAL according to GNAT conventions.
6711 DVAL0 should describe the (portion of a) record that contains any
6712 necessary discriminants. It should be NULL if value_type (VAL) is
6713 an outer-level type (i.e., as opposed to a branch of a variant.) A
6714 variant field (unless unchecked) is replaced by a particular branch
6717 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6718 length are not statically known are discarded. As a consequence,
6719 VALADDR, ADDRESS and DVAL0 are ignored.
6721 NOTE: Limitations: For now, we assume that dynamic fields and
6722 variants occupy whole numbers of bytes. However, they need not be
6726 ada_template_to_fixed_record_type_1 (struct type
*type
,
6727 const gdb_byte
*valaddr
,
6728 CORE_ADDR address
, struct value
*dval0
,
6729 int keep_dynamic_fields
)
6731 struct value
*mark
= value_mark ();
6734 int nfields
, bit_len
;
6737 int fld_bit_len
, bit_incr
;
6740 /* Compute the number of fields in this record type that are going
6741 to be processed: unless keep_dynamic_fields, this includes only
6742 fields whose position and length are static will be processed. */
6743 if (keep_dynamic_fields
)
6744 nfields
= TYPE_NFIELDS (type
);
6748 while (nfields
< TYPE_NFIELDS (type
)
6749 && !ada_is_variant_part (type
, nfields
)
6750 && !is_dynamic_field (type
, nfields
))
6754 rtype
= alloc_type (TYPE_OBJFILE (type
));
6755 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6756 INIT_CPLUS_SPECIFIC (rtype
);
6757 TYPE_NFIELDS (rtype
) = nfields
;
6758 TYPE_FIELDS (rtype
) = (struct field
*)
6759 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6760 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6761 TYPE_NAME (rtype
) = ada_type_name (type
);
6762 TYPE_TAG_NAME (rtype
) = NULL
;
6763 TYPE_FIXED_INSTANCE (rtype
) = 1;
6769 for (f
= 0; f
< nfields
; f
+= 1)
6771 off
= align_value (off
, field_alignment (type
, f
))
6772 + TYPE_FIELD_BITPOS (type
, f
);
6773 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6774 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6776 if (ada_is_variant_part (type
, f
))
6779 fld_bit_len
= bit_incr
= 0;
6781 else if (is_dynamic_field (type
, f
))
6785 /* rtype's length is computed based on the run-time
6786 value of discriminants. If the discriminants are not
6787 initialized, the type size may be completely bogus and
6788 GDB may fail to allocate a value for it. So check the
6789 size first before creating the value. */
6791 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6796 /* Get the fixed type of the field. Note that, in this case, we
6797 do not want to get the real type out of the tag: if the current
6798 field is the parent part of a tagged record, we will get the
6799 tag of the object. Clearly wrong: the real type of the parent
6800 is not the real type of the child. We would end up in an infinite
6802 TYPE_FIELD_TYPE (rtype
, f
) =
6805 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6806 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6807 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6808 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6809 bit_incr
= fld_bit_len
=
6810 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6814 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6815 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6816 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6817 bit_incr
= fld_bit_len
=
6818 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6820 bit_incr
= fld_bit_len
=
6821 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6823 if (off
+ fld_bit_len
> bit_len
)
6824 bit_len
= off
+ fld_bit_len
;
6826 TYPE_LENGTH (rtype
) =
6827 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6830 /* We handle the variant part, if any, at the end because of certain
6831 odd cases in which it is re-ordered so as NOT to be the last field of
6832 the record. This can happen in the presence of representation
6834 if (variant_field
>= 0)
6836 struct type
*branch_type
;
6838 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6841 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6846 to_fixed_variant_branch_type
6847 (TYPE_FIELD_TYPE (type
, variant_field
),
6848 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6849 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6850 if (branch_type
== NULL
)
6852 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6853 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6854 TYPE_NFIELDS (rtype
) -= 1;
6858 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6859 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6861 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6863 if (off
+ fld_bit_len
> bit_len
)
6864 bit_len
= off
+ fld_bit_len
;
6865 TYPE_LENGTH (rtype
) =
6866 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6870 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6871 should contain the alignment of that record, which should be a strictly
6872 positive value. If null or negative, then something is wrong, most
6873 probably in the debug info. In that case, we don't round up the size
6874 of the resulting type. If this record is not part of another structure,
6875 the current RTYPE length might be good enough for our purposes. */
6876 if (TYPE_LENGTH (type
) <= 0)
6878 if (TYPE_NAME (rtype
))
6879 warning (_("Invalid type size for `%s' detected: %d."),
6880 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6882 warning (_("Invalid type size for <unnamed> detected: %d."),
6883 TYPE_LENGTH (type
));
6887 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6888 TYPE_LENGTH (type
));
6891 value_free_to_mark (mark
);
6892 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6893 error (_("record type with dynamic size is larger than varsize-limit"));
6897 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6900 static struct type
*
6901 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6902 CORE_ADDR address
, struct value
*dval0
)
6904 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6908 /* An ordinary record type in which ___XVL-convention fields and
6909 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6910 static approximations, containing all possible fields. Uses
6911 no runtime values. Useless for use in values, but that's OK,
6912 since the results are used only for type determinations. Works on both
6913 structs and unions. Representation note: to save space, we memorize
6914 the result of this function in the TYPE_TARGET_TYPE of the
6917 static struct type
*
6918 template_to_static_fixed_type (struct type
*type0
)
6924 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6925 return TYPE_TARGET_TYPE (type0
);
6927 nfields
= TYPE_NFIELDS (type0
);
6930 for (f
= 0; f
< nfields
; f
+= 1)
6932 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6933 struct type
*new_type
;
6935 if (is_dynamic_field (type0
, f
))
6936 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6938 new_type
= static_unwrap_type (field_type
);
6939 if (type
== type0
&& new_type
!= field_type
)
6941 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6942 TYPE_CODE (type
) = TYPE_CODE (type0
);
6943 INIT_CPLUS_SPECIFIC (type
);
6944 TYPE_NFIELDS (type
) = nfields
;
6945 TYPE_FIELDS (type
) = (struct field
*)
6946 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6947 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6948 sizeof (struct field
) * nfields
);
6949 TYPE_NAME (type
) = ada_type_name (type0
);
6950 TYPE_TAG_NAME (type
) = NULL
;
6951 TYPE_FIXED_INSTANCE (type
) = 1;
6952 TYPE_LENGTH (type
) = 0;
6954 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6955 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6960 /* Given an object of type TYPE whose contents are at VALADDR and
6961 whose address in memory is ADDRESS, returns a revision of TYPE,
6962 which should be a non-dynamic-sized record, in which the variant
6963 part, if any, is replaced with the appropriate branch. Looks
6964 for discriminant values in DVAL0, which can be NULL if the record
6965 contains the necessary discriminant values. */
6967 static struct type
*
6968 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6969 CORE_ADDR address
, struct value
*dval0
)
6971 struct value
*mark
= value_mark ();
6974 struct type
*branch_type
;
6975 int nfields
= TYPE_NFIELDS (type
);
6976 int variant_field
= variant_field_index (type
);
6978 if (variant_field
== -1)
6982 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6986 rtype
= alloc_type (TYPE_OBJFILE (type
));
6987 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6988 INIT_CPLUS_SPECIFIC (rtype
);
6989 TYPE_NFIELDS (rtype
) = nfields
;
6990 TYPE_FIELDS (rtype
) =
6991 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6992 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6993 sizeof (struct field
) * nfields
);
6994 TYPE_NAME (rtype
) = ada_type_name (type
);
6995 TYPE_TAG_NAME (rtype
) = NULL
;
6996 TYPE_FIXED_INSTANCE (rtype
) = 1;
6997 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
6999 branch_type
= to_fixed_variant_branch_type
7000 (TYPE_FIELD_TYPE (type
, variant_field
),
7001 cond_offset_host (valaddr
,
7002 TYPE_FIELD_BITPOS (type
, variant_field
)
7004 cond_offset_target (address
,
7005 TYPE_FIELD_BITPOS (type
, variant_field
)
7006 / TARGET_CHAR_BIT
), dval
);
7007 if (branch_type
== NULL
)
7010 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7011 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7012 TYPE_NFIELDS (rtype
) -= 1;
7016 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7017 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7018 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7019 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7021 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7023 value_free_to_mark (mark
);
7027 /* An ordinary record type (with fixed-length fields) that describes
7028 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7029 beginning of this section]. Any necessary discriminants' values
7030 should be in DVAL, a record value; it may be NULL if the object
7031 at ADDR itself contains any necessary discriminant values.
7032 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7033 values from the record are needed. Except in the case that DVAL,
7034 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7035 unchecked) is replaced by a particular branch of the variant.
7037 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7038 is questionable and may be removed. It can arise during the
7039 processing of an unconstrained-array-of-record type where all the
7040 variant branches have exactly the same size. This is because in
7041 such cases, the compiler does not bother to use the XVS convention
7042 when encoding the record. I am currently dubious of this
7043 shortcut and suspect the compiler should be altered. FIXME. */
7045 static struct type
*
7046 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7047 CORE_ADDR address
, struct value
*dval
)
7049 struct type
*templ_type
;
7051 if (TYPE_FIXED_INSTANCE (type0
))
7054 templ_type
= dynamic_template_type (type0
);
7056 if (templ_type
!= NULL
)
7057 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7058 else if (variant_field_index (type0
) >= 0)
7060 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7062 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7067 TYPE_FIXED_INSTANCE (type0
) = 1;
7073 /* An ordinary record type (with fixed-length fields) that describes
7074 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7075 union type. Any necessary discriminants' values should be in DVAL,
7076 a record value. That is, this routine selects the appropriate
7077 branch of the union at ADDR according to the discriminant value
7078 indicated in the union's type name. Returns VAR_TYPE0 itself if
7079 it represents a variant subject to a pragma Unchecked_Union. */
7081 static struct type
*
7082 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7083 CORE_ADDR address
, struct value
*dval
)
7086 struct type
*templ_type
;
7087 struct type
*var_type
;
7089 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7090 var_type
= TYPE_TARGET_TYPE (var_type0
);
7092 var_type
= var_type0
;
7094 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7096 if (templ_type
!= NULL
)
7097 var_type
= templ_type
;
7099 if (is_unchecked_variant (var_type
, value_type (dval
)))
7102 ada_which_variant_applies (var_type
,
7103 value_type (dval
), value_contents (dval
));
7106 return empty_record (TYPE_OBJFILE (var_type
));
7107 else if (is_dynamic_field (var_type
, which
))
7108 return to_fixed_record_type
7109 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7110 valaddr
, address
, dval
);
7111 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7113 to_fixed_record_type
7114 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7116 return TYPE_FIELD_TYPE (var_type
, which
);
7119 /* Assuming that TYPE0 is an array type describing the type of a value
7120 at ADDR, and that DVAL describes a record containing any
7121 discriminants used in TYPE0, returns a type for the value that
7122 contains no dynamic components (that is, no components whose sizes
7123 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7124 true, gives an error message if the resulting type's size is over
7127 static struct type
*
7128 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7131 struct type
*index_type_desc
;
7132 struct type
*result
;
7134 if (ada_is_packed_array_type (type0
) /* revisit? */
7135 || TYPE_FIXED_INSTANCE (type0
))
7138 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7139 if (index_type_desc
== NULL
)
7141 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7142 /* NOTE: elt_type---the fixed version of elt_type0---should never
7143 depend on the contents of the array in properly constructed
7145 /* Create a fixed version of the array element type.
7146 We're not providing the address of an element here,
7147 and thus the actual object value cannot be inspected to do
7148 the conversion. This should not be a problem, since arrays of
7149 unconstrained objects are not allowed. In particular, all
7150 the elements of an array of a tagged type should all be of
7151 the same type specified in the debugging info. No need to
7152 consult the object tag. */
7153 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7155 if (elt_type0
== elt_type
)
7158 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7159 elt_type
, TYPE_INDEX_TYPE (type0
));
7164 struct type
*elt_type0
;
7167 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7168 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7170 /* NOTE: result---the fixed version of elt_type0---should never
7171 depend on the contents of the array in properly constructed
7173 /* Create a fixed version of the array element type.
7174 We're not providing the address of an element here,
7175 and thus the actual object value cannot be inspected to do
7176 the conversion. This should not be a problem, since arrays of
7177 unconstrained objects are not allowed. In particular, all
7178 the elements of an array of a tagged type should all be of
7179 the same type specified in the debugging info. No need to
7180 consult the object tag. */
7182 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7183 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7185 struct type
*range_type
=
7186 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7187 dval
, TYPE_OBJFILE (type0
));
7188 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7189 result
, range_type
);
7191 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7192 error (_("array type with dynamic size is larger than varsize-limit"));
7195 TYPE_FIXED_INSTANCE (result
) = 1;
7200 /* A standard type (containing no dynamically sized components)
7201 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7202 DVAL describes a record containing any discriminants used in TYPE0,
7203 and may be NULL if there are none, or if the object of type TYPE at
7204 ADDRESS or in VALADDR contains these discriminants.
7206 If CHECK_TAG is not null, in the case of tagged types, this function
7207 attempts to locate the object's tag and use it to compute the actual
7208 type. However, when ADDRESS is null, we cannot use it to determine the
7209 location of the tag, and therefore compute the tagged type's actual type.
7210 So we return the tagged type without consulting the tag. */
7212 static struct type
*
7213 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7214 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7216 type
= ada_check_typedef (type
);
7217 switch (TYPE_CODE (type
))
7221 case TYPE_CODE_STRUCT
:
7223 struct type
*static_type
= to_static_fixed_type (type
);
7224 struct type
*fixed_record_type
=
7225 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7226 /* If STATIC_TYPE is a tagged type and we know the object's address,
7227 then we can determine its tag, and compute the object's actual
7228 type from there. Note that we have to use the fixed record
7229 type (the parent part of the record may have dynamic fields
7230 and the way the location of _tag is expressed may depend on
7233 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7235 struct type
*real_type
=
7236 type_from_tag (value_tag_from_contents_and_address
7240 if (real_type
!= NULL
)
7241 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7244 /* Check to see if there is a parallel ___XVZ variable.
7245 If there is, then it provides the actual size of our type. */
7246 else if (ada_type_name (fixed_record_type
) != NULL
)
7248 char *name
= ada_type_name (fixed_record_type
);
7249 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7253 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7254 size
= get_int_var_value (xvz_name
, &xvz_found
);
7255 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7257 fixed_record_type
= copy_type (fixed_record_type
);
7258 TYPE_LENGTH (fixed_record_type
) = size
;
7260 /* The FIXED_RECORD_TYPE may have be a stub. We have
7261 observed this when the debugging info is STABS, and
7262 apparently it is something that is hard to fix.
7264 In practice, we don't need the actual type definition
7265 at all, because the presence of the XVZ variable allows us
7266 to assume that there must be a XVS type as well, which we
7267 should be able to use later, when we need the actual type
7270 In the meantime, pretend that the "fixed" type we are
7271 returning is NOT a stub, because this can cause trouble
7272 when using this type to create new types targeting it.
7273 Indeed, the associated creation routines often check
7274 whether the target type is a stub and will try to replace
7275 it, thus using a type with the wrong size. This, in turn,
7276 might cause the new type to have the wrong size too.
7277 Consider the case of an array, for instance, where the size
7278 of the array is computed from the number of elements in
7279 our array multiplied by the size of its element. */
7280 TYPE_STUB (fixed_record_type
) = 0;
7283 return fixed_record_type
;
7285 case TYPE_CODE_ARRAY
:
7286 return to_fixed_array_type (type
, dval
, 1);
7287 case TYPE_CODE_UNION
:
7291 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7295 /* The same as ada_to_fixed_type_1, except that it preserves the type
7296 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7297 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7300 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7301 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7304 struct type
*fixed_type
=
7305 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7307 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7308 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7314 /* A standard (static-sized) type corresponding as well as possible to
7315 TYPE0, but based on no runtime data. */
7317 static struct type
*
7318 to_static_fixed_type (struct type
*type0
)
7325 if (TYPE_FIXED_INSTANCE (type0
))
7328 type0
= ada_check_typedef (type0
);
7330 switch (TYPE_CODE (type0
))
7334 case TYPE_CODE_STRUCT
:
7335 type
= dynamic_template_type (type0
);
7337 return template_to_static_fixed_type (type
);
7339 return template_to_static_fixed_type (type0
);
7340 case TYPE_CODE_UNION
:
7341 type
= ada_find_parallel_type (type0
, "___XVU");
7343 return template_to_static_fixed_type (type
);
7345 return template_to_static_fixed_type (type0
);
7349 /* A static approximation of TYPE with all type wrappers removed. */
7351 static struct type
*
7352 static_unwrap_type (struct type
*type
)
7354 if (ada_is_aligner_type (type
))
7356 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7357 if (ada_type_name (type1
) == NULL
)
7358 TYPE_NAME (type1
) = ada_type_name (type
);
7360 return static_unwrap_type (type1
);
7364 struct type
*raw_real_type
= ada_get_base_type (type
);
7365 if (raw_real_type
== type
)
7368 return to_static_fixed_type (raw_real_type
);
7372 /* In some cases, incomplete and private types require
7373 cross-references that are not resolved as records (for example,
7375 type FooP is access Foo;
7377 type Foo is array ...;
7378 ). In these cases, since there is no mechanism for producing
7379 cross-references to such types, we instead substitute for FooP a
7380 stub enumeration type that is nowhere resolved, and whose tag is
7381 the name of the actual type. Call these types "non-record stubs". */
7383 /* A type equivalent to TYPE that is not a non-record stub, if one
7384 exists, otherwise TYPE. */
7387 ada_check_typedef (struct type
*type
)
7392 CHECK_TYPEDEF (type
);
7393 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7394 || !TYPE_STUB (type
)
7395 || TYPE_TAG_NAME (type
) == NULL
)
7399 char *name
= TYPE_TAG_NAME (type
);
7400 struct type
*type1
= ada_find_any_type (name
);
7401 return (type1
== NULL
) ? type
: type1
;
7405 /* A value representing the data at VALADDR/ADDRESS as described by
7406 type TYPE0, but with a standard (static-sized) type that correctly
7407 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7408 type, then return VAL0 [this feature is simply to avoid redundant
7409 creation of struct values]. */
7411 static struct value
*
7412 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7415 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7416 if (type
== type0
&& val0
!= NULL
)
7419 return value_from_contents_and_address (type
, 0, address
);
7422 /* A value representing VAL, but with a standard (static-sized) type
7423 that correctly describes it. Does not necessarily create a new
7426 static struct value
*
7427 ada_to_fixed_value (struct value
*val
)
7429 return ada_to_fixed_value_create (value_type (val
),
7430 value_address (val
),
7434 /* A value representing VAL, but with a standard (static-sized) type
7435 chosen to approximate the real type of VAL as well as possible, but
7436 without consulting any runtime values. For Ada dynamic-sized
7437 types, therefore, the type of the result is likely to be inaccurate. */
7439 static struct value
*
7440 ada_to_static_fixed_value (struct value
*val
)
7443 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7444 if (type
== value_type (val
))
7447 return coerce_unspec_val_to_type (val
, type
);
7453 /* Table mapping attribute numbers to names.
7454 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7456 static const char *attribute_names
[] = {
7474 ada_attribute_name (enum exp_opcode n
)
7476 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7477 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7479 return attribute_names
[0];
7482 /* Evaluate the 'POS attribute applied to ARG. */
7485 pos_atr (struct value
*arg
)
7487 struct value
*val
= coerce_ref (arg
);
7488 struct type
*type
= value_type (val
);
7490 if (!discrete_type_p (type
))
7491 error (_("'POS only defined on discrete types"));
7493 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7496 LONGEST v
= value_as_long (val
);
7498 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7500 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7503 error (_("enumeration value is invalid: can't find 'POS"));
7506 return value_as_long (val
);
7509 static struct value
*
7510 value_pos_atr (struct type
*type
, struct value
*arg
)
7512 return value_from_longest (type
, pos_atr (arg
));
7515 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7517 static struct value
*
7518 value_val_atr (struct type
*type
, struct value
*arg
)
7520 if (!discrete_type_p (type
))
7521 error (_("'VAL only defined on discrete types"));
7522 if (!integer_type_p (value_type (arg
)))
7523 error (_("'VAL requires integral argument"));
7525 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7527 long pos
= value_as_long (arg
);
7528 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7529 error (_("argument to 'VAL out of range"));
7530 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7533 return value_from_longest (type
, value_as_long (arg
));
7539 /* True if TYPE appears to be an Ada character type.
7540 [At the moment, this is true only for Character and Wide_Character;
7541 It is a heuristic test that could stand improvement]. */
7544 ada_is_character_type (struct type
*type
)
7548 /* If the type code says it's a character, then assume it really is,
7549 and don't check any further. */
7550 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7553 /* Otherwise, assume it's a character type iff it is a discrete type
7554 with a known character type name. */
7555 name
= ada_type_name (type
);
7556 return (name
!= NULL
7557 && (TYPE_CODE (type
) == TYPE_CODE_INT
7558 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7559 && (strcmp (name
, "character") == 0
7560 || strcmp (name
, "wide_character") == 0
7561 || strcmp (name
, "wide_wide_character") == 0
7562 || strcmp (name
, "unsigned char") == 0));
7565 /* True if TYPE appears to be an Ada string type. */
7568 ada_is_string_type (struct type
*type
)
7570 type
= ada_check_typedef (type
);
7572 && TYPE_CODE (type
) != TYPE_CODE_PTR
7573 && (ada_is_simple_array_type (type
)
7574 || ada_is_array_descriptor_type (type
))
7575 && ada_array_arity (type
) == 1)
7577 struct type
*elttype
= ada_array_element_type (type
, 1);
7579 return ada_is_character_type (elttype
);
7586 /* True if TYPE is a struct type introduced by the compiler to force the
7587 alignment of a value. Such types have a single field with a
7588 distinctive name. */
7591 ada_is_aligner_type (struct type
*type
)
7593 type
= ada_check_typedef (type
);
7595 /* If we can find a parallel XVS type, then the XVS type should
7596 be used instead of this type. And hence, this is not an aligner
7598 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7601 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7602 && TYPE_NFIELDS (type
) == 1
7603 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7606 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7607 the parallel type. */
7610 ada_get_base_type (struct type
*raw_type
)
7612 struct type
*real_type_namer
;
7613 struct type
*raw_real_type
;
7615 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7618 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7619 if (real_type_namer
== NULL
7620 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7621 || TYPE_NFIELDS (real_type_namer
) != 1)
7624 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7625 if (raw_real_type
== NULL
)
7628 return raw_real_type
;
7631 /* The type of value designated by TYPE, with all aligners removed. */
7634 ada_aligned_type (struct type
*type
)
7636 if (ada_is_aligner_type (type
))
7637 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7639 return ada_get_base_type (type
);
7643 /* The address of the aligned value in an object at address VALADDR
7644 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7647 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7649 if (ada_is_aligner_type (type
))
7650 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7652 TYPE_FIELD_BITPOS (type
,
7653 0) / TARGET_CHAR_BIT
);
7660 /* The printed representation of an enumeration literal with encoded
7661 name NAME. The value is good to the next call of ada_enum_name. */
7663 ada_enum_name (const char *name
)
7665 static char *result
;
7666 static size_t result_len
= 0;
7669 /* First, unqualify the enumeration name:
7670 1. Search for the last '.' character. If we find one, then skip
7671 all the preceeding characters, the unqualified name starts
7672 right after that dot.
7673 2. Otherwise, we may be debugging on a target where the compiler
7674 translates dots into "__". Search forward for double underscores,
7675 but stop searching when we hit an overloading suffix, which is
7676 of the form "__" followed by digits. */
7678 tmp
= strrchr (name
, '.');
7683 while ((tmp
= strstr (name
, "__")) != NULL
)
7685 if (isdigit (tmp
[2]))
7695 if (name
[1] == 'U' || name
[1] == 'W')
7697 if (sscanf (name
+ 2, "%x", &v
) != 1)
7703 GROW_VECT (result
, result_len
, 16);
7704 if (isascii (v
) && isprint (v
))
7705 xsnprintf (result
, result_len
, "'%c'", v
);
7706 else if (name
[1] == 'U')
7707 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7709 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7715 tmp
= strstr (name
, "__");
7717 tmp
= strstr (name
, "$");
7720 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7721 strncpy (result
, name
, tmp
- name
);
7722 result
[tmp
- name
] = '\0';
7730 /* Evaluate the subexpression of EXP starting at *POS as for
7731 evaluate_type, updating *POS to point just past the evaluated
7734 static struct value
*
7735 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7737 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7740 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7743 static struct value
*
7744 unwrap_value (struct value
*val
)
7746 struct type
*type
= ada_check_typedef (value_type (val
));
7747 if (ada_is_aligner_type (type
))
7749 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7750 struct type
*val_type
= ada_check_typedef (value_type (v
));
7751 if (ada_type_name (val_type
) == NULL
)
7752 TYPE_NAME (val_type
) = ada_type_name (type
);
7754 return unwrap_value (v
);
7758 struct type
*raw_real_type
=
7759 ada_check_typedef (ada_get_base_type (type
));
7761 if (type
== raw_real_type
)
7765 coerce_unspec_val_to_type
7766 (val
, ada_to_fixed_type (raw_real_type
, 0,
7767 value_address (val
),
7772 static struct value
*
7773 cast_to_fixed (struct type
*type
, struct value
*arg
)
7777 if (type
== value_type (arg
))
7779 else if (ada_is_fixed_point_type (value_type (arg
)))
7780 val
= ada_float_to_fixed (type
,
7781 ada_fixed_to_float (value_type (arg
),
7782 value_as_long (arg
)));
7785 DOUBLEST argd
= value_as_double (arg
);
7786 val
= ada_float_to_fixed (type
, argd
);
7789 return value_from_longest (type
, val
);
7792 static struct value
*
7793 cast_from_fixed (struct type
*type
, struct value
*arg
)
7795 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7796 value_as_long (arg
));
7797 return value_from_double (type
, val
);
7800 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7801 return the converted value. */
7803 static struct value
*
7804 coerce_for_assign (struct type
*type
, struct value
*val
)
7806 struct type
*type2
= value_type (val
);
7810 type2
= ada_check_typedef (type2
);
7811 type
= ada_check_typedef (type
);
7813 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7814 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7816 val
= ada_value_ind (val
);
7817 type2
= value_type (val
);
7820 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7821 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7823 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7824 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7825 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7826 error (_("Incompatible types in assignment"));
7827 deprecated_set_value_type (val
, type
);
7832 static struct value
*
7833 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7836 struct type
*type1
, *type2
;
7839 arg1
= coerce_ref (arg1
);
7840 arg2
= coerce_ref (arg2
);
7841 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7842 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7844 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7845 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7846 return value_binop (arg1
, arg2
, op
);
7855 return value_binop (arg1
, arg2
, op
);
7858 v2
= value_as_long (arg2
);
7860 error (_("second operand of %s must not be zero."), op_string (op
));
7862 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7863 return value_binop (arg1
, arg2
, op
);
7865 v1
= value_as_long (arg1
);
7870 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7871 v
+= v
> 0 ? -1 : 1;
7879 /* Should not reach this point. */
7883 val
= allocate_value (type1
);
7884 store_unsigned_integer (value_contents_raw (val
),
7885 TYPE_LENGTH (value_type (val
)), v
);
7890 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7892 if (ada_is_direct_array_type (value_type (arg1
))
7893 || ada_is_direct_array_type (value_type (arg2
)))
7895 /* Automatically dereference any array reference before
7896 we attempt to perform the comparison. */
7897 arg1
= ada_coerce_ref (arg1
);
7898 arg2
= ada_coerce_ref (arg2
);
7900 arg1
= ada_coerce_to_simple_array (arg1
);
7901 arg2
= ada_coerce_to_simple_array (arg2
);
7902 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7903 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7904 error (_("Attempt to compare array with non-array"));
7905 /* FIXME: The following works only for types whose
7906 representations use all bits (no padding or undefined bits)
7907 and do not have user-defined equality. */
7909 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7910 && memcmp (value_contents (arg1
), value_contents (arg2
),
7911 TYPE_LENGTH (value_type (arg1
))) == 0;
7913 return value_equal (arg1
, arg2
);
7916 /* Total number of component associations in the aggregate starting at
7917 index PC in EXP. Assumes that index PC is the start of an
7921 num_component_specs (struct expression
*exp
, int pc
)
7924 m
= exp
->elts
[pc
+ 1].longconst
;
7927 for (i
= 0; i
< m
; i
+= 1)
7929 switch (exp
->elts
[pc
].opcode
)
7935 n
+= exp
->elts
[pc
+ 1].longconst
;
7938 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7943 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7944 component of LHS (a simple array or a record), updating *POS past
7945 the expression, assuming that LHS is contained in CONTAINER. Does
7946 not modify the inferior's memory, nor does it modify LHS (unless
7947 LHS == CONTAINER). */
7950 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7951 struct expression
*exp
, int *pos
)
7953 struct value
*mark
= value_mark ();
7955 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7957 struct value
*index_val
= value_from_longest (builtin_type_int32
, index
);
7958 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7962 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7963 elt
= ada_to_fixed_value (unwrap_value (elt
));
7966 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7967 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7969 value_assign_to_component (container
, elt
,
7970 ada_evaluate_subexp (NULL
, exp
, pos
,
7973 value_free_to_mark (mark
);
7976 /* Assuming that LHS represents an lvalue having a record or array
7977 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7978 of that aggregate's value to LHS, advancing *POS past the
7979 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7980 lvalue containing LHS (possibly LHS itself). Does not modify
7981 the inferior's memory, nor does it modify the contents of
7982 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7984 static struct value
*
7985 assign_aggregate (struct value
*container
,
7986 struct value
*lhs
, struct expression
*exp
,
7987 int *pos
, enum noside noside
)
7989 struct type
*lhs_type
;
7990 int n
= exp
->elts
[*pos
+1].longconst
;
7991 LONGEST low_index
, high_index
;
7994 int max_indices
, num_indices
;
7995 int is_array_aggregate
;
7997 struct value
*mark
= value_mark ();
8000 if (noside
!= EVAL_NORMAL
)
8003 for (i
= 0; i
< n
; i
+= 1)
8004 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8008 container
= ada_coerce_ref (container
);
8009 if (ada_is_direct_array_type (value_type (container
)))
8010 container
= ada_coerce_to_simple_array (container
);
8011 lhs
= ada_coerce_ref (lhs
);
8012 if (!deprecated_value_modifiable (lhs
))
8013 error (_("Left operand of assignment is not a modifiable lvalue."));
8015 lhs_type
= value_type (lhs
);
8016 if (ada_is_direct_array_type (lhs_type
))
8018 lhs
= ada_coerce_to_simple_array (lhs
);
8019 lhs_type
= value_type (lhs
);
8020 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8021 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8022 is_array_aggregate
= 1;
8024 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8027 high_index
= num_visible_fields (lhs_type
) - 1;
8028 is_array_aggregate
= 0;
8031 error (_("Left-hand side must be array or record."));
8033 num_specs
= num_component_specs (exp
, *pos
- 3);
8034 max_indices
= 4 * num_specs
+ 4;
8035 indices
= alloca (max_indices
* sizeof (indices
[0]));
8036 indices
[0] = indices
[1] = low_index
- 1;
8037 indices
[2] = indices
[3] = high_index
+ 1;
8040 for (i
= 0; i
< n
; i
+= 1)
8042 switch (exp
->elts
[*pos
].opcode
)
8045 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8046 &num_indices
, max_indices
,
8047 low_index
, high_index
);
8050 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8051 &num_indices
, max_indices
,
8052 low_index
, high_index
);
8056 error (_("Misplaced 'others' clause"));
8057 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8058 num_indices
, low_index
, high_index
);
8061 error (_("Internal error: bad aggregate clause"));
8068 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8069 construct at *POS, updating *POS past the construct, given that
8070 the positions are relative to lower bound LOW, where HIGH is the
8071 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8072 updating *NUM_INDICES as needed. CONTAINER is as for
8073 assign_aggregate. */
8075 aggregate_assign_positional (struct value
*container
,
8076 struct value
*lhs
, struct expression
*exp
,
8077 int *pos
, LONGEST
*indices
, int *num_indices
,
8078 int max_indices
, LONGEST low
, LONGEST high
)
8080 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8082 if (ind
- 1 == high
)
8083 warning (_("Extra components in aggregate ignored."));
8086 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8088 assign_component (container
, lhs
, ind
, exp
, pos
);
8091 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8094 /* Assign into the components of LHS indexed by the OP_CHOICES
8095 construct at *POS, updating *POS past the construct, given that
8096 the allowable indices are LOW..HIGH. Record the indices assigned
8097 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8098 needed. CONTAINER is as for assign_aggregate. */
8100 aggregate_assign_from_choices (struct value
*container
,
8101 struct value
*lhs
, struct expression
*exp
,
8102 int *pos
, LONGEST
*indices
, int *num_indices
,
8103 int max_indices
, LONGEST low
, LONGEST high
)
8106 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8107 int choice_pos
, expr_pc
;
8108 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8110 choice_pos
= *pos
+= 3;
8112 for (j
= 0; j
< n_choices
; j
+= 1)
8113 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8115 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8117 for (j
= 0; j
< n_choices
; j
+= 1)
8119 LONGEST lower
, upper
;
8120 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8121 if (op
== OP_DISCRETE_RANGE
)
8124 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8126 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8131 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8142 name
= &exp
->elts
[choice_pos
+ 2].string
;
8145 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8148 error (_("Invalid record component association."));
8150 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8152 if (! find_struct_field (name
, value_type (lhs
), 0,
8153 NULL
, NULL
, NULL
, NULL
, &ind
))
8154 error (_("Unknown component name: %s."), name
);
8155 lower
= upper
= ind
;
8158 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8159 error (_("Index in component association out of bounds."));
8161 add_component_interval (lower
, upper
, indices
, num_indices
,
8163 while (lower
<= upper
)
8167 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8173 /* Assign the value of the expression in the OP_OTHERS construct in
8174 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8175 have not been previously assigned. The index intervals already assigned
8176 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8177 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8179 aggregate_assign_others (struct value
*container
,
8180 struct value
*lhs
, struct expression
*exp
,
8181 int *pos
, LONGEST
*indices
, int num_indices
,
8182 LONGEST low
, LONGEST high
)
8185 int expr_pc
= *pos
+1;
8187 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8190 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8194 assign_component (container
, lhs
, ind
, exp
, &pos
);
8197 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8200 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8201 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8202 modifying *SIZE as needed. It is an error if *SIZE exceeds
8203 MAX_SIZE. The resulting intervals do not overlap. */
8205 add_component_interval (LONGEST low
, LONGEST high
,
8206 LONGEST
* indices
, int *size
, int max_size
)
8209 for (i
= 0; i
< *size
; i
+= 2) {
8210 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8213 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8214 if (high
< indices
[kh
])
8216 if (low
< indices
[i
])
8218 indices
[i
+ 1] = indices
[kh
- 1];
8219 if (high
> indices
[i
+ 1])
8220 indices
[i
+ 1] = high
;
8221 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8222 *size
-= kh
- i
- 2;
8225 else if (high
< indices
[i
])
8229 if (*size
== max_size
)
8230 error (_("Internal error: miscounted aggregate components."));
8232 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8233 indices
[j
] = indices
[j
- 2];
8235 indices
[i
+ 1] = high
;
8238 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8241 static struct value
*
8242 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8244 if (type
== ada_check_typedef (value_type (arg2
)))
8247 if (ada_is_fixed_point_type (type
))
8248 return (cast_to_fixed (type
, arg2
));
8250 if (ada_is_fixed_point_type (value_type (arg2
)))
8251 return cast_from_fixed (type
, arg2
);
8253 return value_cast (type
, arg2
);
8256 static struct value
*
8257 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8258 int *pos
, enum noside noside
)
8261 int tem
, tem2
, tem3
;
8263 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8266 struct value
**argvec
;
8270 op
= exp
->elts
[pc
].opcode
;
8276 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8277 arg1
= unwrap_value (arg1
);
8279 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8280 then we need to perform the conversion manually, because
8281 evaluate_subexp_standard doesn't do it. This conversion is
8282 necessary in Ada because the different kinds of float/fixed
8283 types in Ada have different representations.
8285 Similarly, we need to perform the conversion from OP_LONG
8287 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8288 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8294 struct value
*result
;
8296 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8297 /* The result type will have code OP_STRING, bashed there from
8298 OP_ARRAY. Bash it back. */
8299 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8300 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8306 type
= exp
->elts
[pc
+ 1].type
;
8307 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8308 if (noside
== EVAL_SKIP
)
8310 arg1
= ada_value_cast (type
, arg1
, noside
);
8315 type
= exp
->elts
[pc
+ 1].type
;
8316 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8319 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8320 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8322 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8323 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8325 return ada_value_assign (arg1
, arg1
);
8327 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8328 except if the lhs of our assignment is a convenience variable.
8329 In the case of assigning to a convenience variable, the lhs
8330 should be exactly the result of the evaluation of the rhs. */
8331 type
= value_type (arg1
);
8332 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8334 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8335 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8337 if (ada_is_fixed_point_type (value_type (arg1
)))
8338 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8339 else if (ada_is_fixed_point_type (value_type (arg2
)))
8341 (_("Fixed-point values must be assigned to fixed-point variables"));
8343 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8344 return ada_value_assign (arg1
, arg2
);
8347 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8348 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8349 if (noside
== EVAL_SKIP
)
8351 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8352 return (value_from_longest
8354 value_as_long (arg1
) + value_as_long (arg2
)));
8355 if ((ada_is_fixed_point_type (value_type (arg1
))
8356 || ada_is_fixed_point_type (value_type (arg2
)))
8357 && value_type (arg1
) != value_type (arg2
))
8358 error (_("Operands of fixed-point addition must have the same type"));
8359 /* Do the addition, and cast the result to the type of the first
8360 argument. We cannot cast the result to a reference type, so if
8361 ARG1 is a reference type, find its underlying type. */
8362 type
= value_type (arg1
);
8363 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8364 type
= TYPE_TARGET_TYPE (type
);
8365 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8366 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8369 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8370 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8371 if (noside
== EVAL_SKIP
)
8373 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8374 return (value_from_longest
8376 value_as_long (arg1
) - value_as_long (arg2
)));
8377 if ((ada_is_fixed_point_type (value_type (arg1
))
8378 || ada_is_fixed_point_type (value_type (arg2
)))
8379 && value_type (arg1
) != value_type (arg2
))
8380 error (_("Operands of fixed-point subtraction must have the same type"));
8381 /* Do the substraction, and cast the result to the type of the first
8382 argument. We cannot cast the result to a reference type, so if
8383 ARG1 is a reference type, find its underlying type. */
8384 type
= value_type (arg1
);
8385 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8386 type
= TYPE_TARGET_TYPE (type
);
8387 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8388 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8394 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8395 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8396 if (noside
== EVAL_SKIP
)
8398 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8400 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8401 return value_zero (value_type (arg1
), not_lval
);
8405 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8406 if (ada_is_fixed_point_type (value_type (arg1
)))
8407 arg1
= cast_from_fixed (type
, arg1
);
8408 if (ada_is_fixed_point_type (value_type (arg2
)))
8409 arg2
= cast_from_fixed (type
, arg2
);
8410 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8411 return ada_value_binop (arg1
, arg2
, op
);
8415 case BINOP_NOTEQUAL
:
8416 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8417 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8418 if (noside
== EVAL_SKIP
)
8420 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8424 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8425 tem
= ada_value_equal (arg1
, arg2
);
8427 if (op
== BINOP_NOTEQUAL
)
8429 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8430 return value_from_longest (type
, (LONGEST
) tem
);
8433 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8434 if (noside
== EVAL_SKIP
)
8436 else if (ada_is_fixed_point_type (value_type (arg1
)))
8437 return value_cast (value_type (arg1
), value_neg (arg1
));
8440 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8441 return value_neg (arg1
);
8444 case BINOP_LOGICAL_AND
:
8445 case BINOP_LOGICAL_OR
:
8446 case UNOP_LOGICAL_NOT
:
8451 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8452 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8453 return value_cast (type
, val
);
8456 case BINOP_BITWISE_AND
:
8457 case BINOP_BITWISE_IOR
:
8458 case BINOP_BITWISE_XOR
:
8462 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8464 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8466 return value_cast (value_type (arg1
), val
);
8472 if (noside
== EVAL_SKIP
)
8477 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8478 /* Only encountered when an unresolved symbol occurs in a
8479 context other than a function call, in which case, it is
8481 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8482 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8483 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8485 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8486 if (ada_is_tagged_type (type
, 0))
8488 /* Tagged types are a little special in the fact that the real
8489 type is dynamic and can only be determined by inspecting the
8490 object's tag. This means that we need to get the object's
8491 value first (EVAL_NORMAL) and then extract the actual object
8494 Note that we cannot skip the final step where we extract
8495 the object type from its tag, because the EVAL_NORMAL phase
8496 results in dynamic components being resolved into fixed ones.
8497 This can cause problems when trying to print the type
8498 description of tagged types whose parent has a dynamic size:
8499 We use the type name of the "_parent" component in order
8500 to print the name of the ancestor type in the type description.
8501 If that component had a dynamic size, the resolution into
8502 a fixed type would result in the loss of that type name,
8503 thus preventing us from printing the name of the ancestor
8504 type in the type description. */
8505 struct type
*actual_type
;
8507 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8508 actual_type
= type_from_tag (ada_value_tag (arg1
));
8509 if (actual_type
== NULL
)
8510 /* If, for some reason, we were unable to determine
8511 the actual type from the tag, then use the static
8512 approximation that we just computed as a fallback.
8513 This can happen if the debugging information is
8514 incomplete, for instance. */
8517 return value_zero (actual_type
, not_lval
);
8522 (to_static_fixed_type
8523 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8529 unwrap_value (evaluate_subexp_standard
8530 (expect_type
, exp
, pos
, noside
));
8531 return ada_to_fixed_value (arg1
);
8537 /* Allocate arg vector, including space for the function to be
8538 called in argvec[0] and a terminating NULL. */
8539 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8541 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8543 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8544 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8545 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8546 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8549 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8550 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8553 if (noside
== EVAL_SKIP
)
8557 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8558 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8559 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8560 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8561 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8562 argvec
[0] = value_addr (argvec
[0]);
8564 type
= ada_check_typedef (value_type (argvec
[0]));
8565 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8567 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8569 case TYPE_CODE_FUNC
:
8570 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8572 case TYPE_CODE_ARRAY
:
8574 case TYPE_CODE_STRUCT
:
8575 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8576 argvec
[0] = ada_value_ind (argvec
[0]);
8577 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8580 error (_("cannot subscript or call something of type `%s'"),
8581 ada_type_name (value_type (argvec
[0])));
8586 switch (TYPE_CODE (type
))
8588 case TYPE_CODE_FUNC
:
8589 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8590 return allocate_value (TYPE_TARGET_TYPE (type
));
8591 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8592 case TYPE_CODE_STRUCT
:
8596 arity
= ada_array_arity (type
);
8597 type
= ada_array_element_type (type
, nargs
);
8599 error (_("cannot subscript or call a record"));
8601 error (_("wrong number of subscripts; expecting %d"), arity
);
8602 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8603 return value_zero (ada_aligned_type (type
), lval_memory
);
8605 unwrap_value (ada_value_subscript
8606 (argvec
[0], nargs
, argvec
+ 1));
8608 case TYPE_CODE_ARRAY
:
8609 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8611 type
= ada_array_element_type (type
, nargs
);
8613 error (_("element type of array unknown"));
8615 return value_zero (ada_aligned_type (type
), lval_memory
);
8618 unwrap_value (ada_value_subscript
8619 (ada_coerce_to_simple_array (argvec
[0]),
8620 nargs
, argvec
+ 1));
8621 case TYPE_CODE_PTR
: /* Pointer to array */
8622 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8623 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8625 type
= ada_array_element_type (type
, nargs
);
8627 error (_("element type of array unknown"));
8629 return value_zero (ada_aligned_type (type
), lval_memory
);
8632 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8633 nargs
, argvec
+ 1));
8636 error (_("Attempt to index or call something other than an "
8637 "array or function"));
8642 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8643 struct value
*low_bound_val
=
8644 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8645 struct value
*high_bound_val
=
8646 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8649 low_bound_val
= coerce_ref (low_bound_val
);
8650 high_bound_val
= coerce_ref (high_bound_val
);
8651 low_bound
= pos_atr (low_bound_val
);
8652 high_bound
= pos_atr (high_bound_val
);
8654 if (noside
== EVAL_SKIP
)
8657 /* If this is a reference to an aligner type, then remove all
8659 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8660 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8661 TYPE_TARGET_TYPE (value_type (array
)) =
8662 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8664 if (ada_is_packed_array_type (value_type (array
)))
8665 error (_("cannot slice a packed array"));
8667 /* If this is a reference to an array or an array lvalue,
8668 convert to a pointer. */
8669 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8670 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8671 && VALUE_LVAL (array
) == lval_memory
))
8672 array
= value_addr (array
);
8674 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8675 && ada_is_array_descriptor_type (ada_check_typedef
8676 (value_type (array
))))
8677 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8679 array
= ada_coerce_to_simple_array_ptr (array
);
8681 /* If we have more than one level of pointer indirection,
8682 dereference the value until we get only one level. */
8683 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8684 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8686 array
= value_ind (array
);
8688 /* Make sure we really do have an array type before going further,
8689 to avoid a SEGV when trying to get the index type or the target
8690 type later down the road if the debug info generated by
8691 the compiler is incorrect or incomplete. */
8692 if (!ada_is_simple_array_type (value_type (array
)))
8693 error (_("cannot take slice of non-array"));
8695 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8697 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8698 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8702 struct type
*arr_type0
=
8703 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8705 return ada_value_slice_from_ptr (array
, arr_type0
,
8706 longest_to_int (low_bound
),
8707 longest_to_int (high_bound
));
8710 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8712 else if (high_bound
< low_bound
)
8713 return empty_array (value_type (array
), low_bound
);
8715 return ada_value_slice (array
, longest_to_int (low_bound
),
8716 longest_to_int (high_bound
));
8721 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8722 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
8724 if (noside
== EVAL_SKIP
)
8727 switch (TYPE_CODE (type
))
8730 lim_warning (_("Membership test incompletely implemented; "
8731 "always returns true"));
8732 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8733 return value_from_longest (type
, (LONGEST
) 1);
8735 case TYPE_CODE_RANGE
:
8736 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
8737 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
8738 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8739 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8740 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8742 value_from_longest (type
,
8743 (value_less (arg1
, arg3
)
8744 || value_equal (arg1
, arg3
))
8745 && (value_less (arg2
, arg1
)
8746 || value_equal (arg2
, arg1
)));
8749 case BINOP_IN_BOUNDS
:
8751 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8752 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8754 if (noside
== EVAL_SKIP
)
8757 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8759 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8760 return value_zero (type
, not_lval
);
8763 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8765 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8766 error (_("invalid dimension number to 'range"));
8768 arg3
= ada_array_bound (arg2
, tem
, 1);
8769 arg2
= ada_array_bound (arg2
, tem
, 0);
8771 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8772 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8773 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8775 value_from_longest (type
,
8776 (value_less (arg1
, arg3
)
8777 || value_equal (arg1
, arg3
))
8778 && (value_less (arg2
, arg1
)
8779 || value_equal (arg2
, arg1
)));
8781 case TERNOP_IN_RANGE
:
8782 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8783 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8784 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8786 if (noside
== EVAL_SKIP
)
8789 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8790 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8791 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8793 value_from_longest (type
,
8794 (value_less (arg1
, arg3
)
8795 || value_equal (arg1
, arg3
))
8796 && (value_less (arg2
, arg1
)
8797 || value_equal (arg2
, arg1
)));
8803 struct type
*type_arg
;
8804 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8806 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8808 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
8812 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8816 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8817 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8818 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8821 if (noside
== EVAL_SKIP
)
8824 if (type_arg
== NULL
)
8826 arg1
= ada_coerce_ref (arg1
);
8828 if (ada_is_packed_array_type (value_type (arg1
)))
8829 arg1
= ada_coerce_to_simple_array (arg1
);
8831 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8832 error (_("invalid dimension number to '%s"),
8833 ada_attribute_name (op
));
8835 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8837 type
= ada_index_type (value_type (arg1
), tem
);
8840 (_("attempt to take bound of something that is not an array"));
8841 return allocate_value (type
);
8846 default: /* Should never happen. */
8847 error (_("unexpected attribute encountered"));
8849 return ada_array_bound (arg1
, tem
, 0);
8851 return ada_array_bound (arg1
, tem
, 1);
8853 return ada_array_length (arg1
, tem
);
8856 else if (discrete_type_p (type_arg
))
8858 struct type
*range_type
;
8859 char *name
= ada_type_name (type_arg
);
8861 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8863 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8864 if (range_type
== NULL
)
8865 range_type
= type_arg
;
8869 error (_("unexpected attribute encountered"));
8871 return value_from_longest
8872 (range_type
, discrete_type_low_bound (range_type
));
8874 return value_from_longest
8875 (range_type
, discrete_type_high_bound (range_type
));
8877 error (_("the 'length attribute applies only to array types"));
8880 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8881 error (_("unimplemented type attribute"));
8886 if (ada_is_packed_array_type (type_arg
))
8887 type_arg
= decode_packed_array_type (type_arg
);
8889 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8890 error (_("invalid dimension number to '%s"),
8891 ada_attribute_name (op
));
8893 type
= ada_index_type (type_arg
, tem
);
8896 (_("attempt to take bound of something that is not an array"));
8897 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8898 return allocate_value (type
);
8903 error (_("unexpected attribute encountered"));
8905 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8906 return value_from_longest (type
, low
);
8908 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8909 return value_from_longest (type
, high
);
8911 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8912 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8913 return value_from_longest (type
, high
- low
+ 1);
8919 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8920 if (noside
== EVAL_SKIP
)
8923 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8924 return value_zero (ada_tag_type (arg1
), not_lval
);
8926 return ada_value_tag (arg1
);
8930 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8931 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8932 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8933 if (noside
== EVAL_SKIP
)
8935 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8936 return value_zero (value_type (arg1
), not_lval
);
8939 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8940 return value_binop (arg1
, arg2
,
8941 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8944 case OP_ATR_MODULUS
:
8946 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
8947 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8949 if (noside
== EVAL_SKIP
)
8952 if (!ada_is_modular_type (type_arg
))
8953 error (_("'modulus must be applied to modular type"));
8955 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8956 ada_modulus (type_arg
));
8961 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8962 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8963 if (noside
== EVAL_SKIP
)
8965 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8966 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8967 return value_zero (type
, not_lval
);
8969 return value_pos_atr (type
, arg1
);
8972 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8973 type
= value_type (arg1
);
8975 /* If the argument is a reference, then dereference its type, since
8976 the user is really asking for the size of the actual object,
8977 not the size of the pointer. */
8978 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
8979 type
= TYPE_TARGET_TYPE (type
);
8981 if (noside
== EVAL_SKIP
)
8983 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8984 return value_zero (builtin_type_int32
, not_lval
);
8986 return value_from_longest (builtin_type_int32
,
8987 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
8990 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8991 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8992 type
= exp
->elts
[pc
+ 2].type
;
8993 if (noside
== EVAL_SKIP
)
8995 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8996 return value_zero (type
, not_lval
);
8998 return value_val_atr (type
, arg1
);
9001 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9002 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9003 if (noside
== EVAL_SKIP
)
9005 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9006 return value_zero (value_type (arg1
), not_lval
);
9009 /* For integer exponentiation operations,
9010 only promote the first argument. */
9011 if (is_integral_type (value_type (arg2
)))
9012 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9014 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9016 return value_binop (arg1
, arg2
, op
);
9020 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9021 if (noside
== EVAL_SKIP
)
9027 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9028 if (noside
== EVAL_SKIP
)
9030 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9031 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9032 return value_neg (arg1
);
9037 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9038 if (noside
== EVAL_SKIP
)
9040 type
= ada_check_typedef (value_type (arg1
));
9041 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9043 if (ada_is_array_descriptor_type (type
))
9044 /* GDB allows dereferencing GNAT array descriptors. */
9046 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9047 if (arrType
== NULL
)
9048 error (_("Attempt to dereference null array pointer."));
9049 return value_at_lazy (arrType
, 0);
9051 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9052 || TYPE_CODE (type
) == TYPE_CODE_REF
9053 /* In C you can dereference an array to get the 1st elt. */
9054 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9056 type
= to_static_fixed_type
9058 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9060 return value_zero (type
, lval_memory
);
9062 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9064 /* GDB allows dereferencing an int. */
9065 if (expect_type
== NULL
)
9066 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9071 to_static_fixed_type (ada_aligned_type (expect_type
));
9072 return value_zero (expect_type
, lval_memory
);
9076 error (_("Attempt to take contents of a non-pointer value."));
9078 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9079 type
= ada_check_typedef (value_type (arg1
));
9081 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9082 /* GDB allows dereferencing an int. If we were given
9083 the expect_type, then use that as the target type.
9084 Otherwise, assume that the target type is an int. */
9086 if (expect_type
!= NULL
)
9087 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9090 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9091 (CORE_ADDR
) value_as_address (arg1
));
9094 if (ada_is_array_descriptor_type (type
))
9095 /* GDB allows dereferencing GNAT array descriptors. */
9096 return ada_coerce_to_simple_array (arg1
);
9098 return ada_value_ind (arg1
);
9100 case STRUCTOP_STRUCT
:
9101 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9102 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9103 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9104 if (noside
== EVAL_SKIP
)
9106 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9108 struct type
*type1
= value_type (arg1
);
9109 if (ada_is_tagged_type (type1
, 1))
9111 type
= ada_lookup_struct_elt_type (type1
,
9112 &exp
->elts
[pc
+ 2].string
,
9115 /* In this case, we assume that the field COULD exist
9116 in some extension of the type. Return an object of
9117 "type" void, which will match any formal
9118 (see ada_type_match). */
9119 return value_zero (builtin_type_void
, lval_memory
);
9123 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9126 return value_zero (ada_aligned_type (type
), lval_memory
);
9130 ada_to_fixed_value (unwrap_value
9131 (ada_value_struct_elt
9132 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9134 /* The value is not supposed to be used. This is here to make it
9135 easier to accommodate expressions that contain types. */
9137 if (noside
== EVAL_SKIP
)
9139 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9140 return allocate_value (exp
->elts
[pc
+ 1].type
);
9142 error (_("Attempt to use a type name as an expression"));
9147 case OP_DISCRETE_RANGE
:
9150 if (noside
== EVAL_NORMAL
)
9154 error (_("Undefined name, ambiguous name, or renaming used in "
9155 "component association: %s."), &exp
->elts
[pc
+2].string
);
9157 error (_("Aggregates only allowed on the right of an assignment"));
9159 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9162 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9164 for (tem
= 0; tem
< nargs
; tem
+= 1)
9165 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9170 return value_from_longest (builtin_type_int8
, (LONGEST
) 1);
9176 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9177 type name that encodes the 'small and 'delta information.
9178 Otherwise, return NULL. */
9181 fixed_type_info (struct type
*type
)
9183 const char *name
= ada_type_name (type
);
9184 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9186 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9188 const char *tail
= strstr (name
, "___XF_");
9194 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9195 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9200 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9203 ada_is_fixed_point_type (struct type
*type
)
9205 return fixed_type_info (type
) != NULL
;
9208 /* Return non-zero iff TYPE represents a System.Address type. */
9211 ada_is_system_address_type (struct type
*type
)
9213 return (TYPE_NAME (type
)
9214 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9217 /* Assuming that TYPE is the representation of an Ada fixed-point
9218 type, return its delta, or -1 if the type is malformed and the
9219 delta cannot be determined. */
9222 ada_delta (struct type
*type
)
9224 const char *encoding
= fixed_type_info (type
);
9227 /* Strictly speaking, num and den are encoded as integer. However,
9228 they may not fit into a long, and they will have to be converted
9229 to DOUBLEST anyway. So scan them as DOUBLEST. */
9230 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9237 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9238 factor ('SMALL value) associated with the type. */
9241 scaling_factor (struct type
*type
)
9243 const char *encoding
= fixed_type_info (type
);
9244 DOUBLEST num0
, den0
, num1
, den1
;
9247 /* Strictly speaking, num's and den's are encoded as integer. However,
9248 they may not fit into a long, and they will have to be converted
9249 to DOUBLEST anyway. So scan them as DOUBLEST. */
9250 n
= sscanf (encoding
,
9251 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9252 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9253 &num0
, &den0
, &num1
, &den1
);
9264 /* Assuming that X is the representation of a value of fixed-point
9265 type TYPE, return its floating-point equivalent. */
9268 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9270 return (DOUBLEST
) x
*scaling_factor (type
);
9273 /* The representation of a fixed-point value of type TYPE
9274 corresponding to the value X. */
9277 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9279 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9283 /* VAX floating formats */
9285 /* Non-zero iff TYPE represents one of the special VAX floating-point
9289 ada_is_vax_floating_type (struct type
*type
)
9292 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9295 && (TYPE_CODE (type
) == TYPE_CODE_INT
9296 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9297 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9300 /* The type of special VAX floating-point type this is, assuming
9301 ada_is_vax_floating_point. */
9304 ada_vax_float_type_suffix (struct type
*type
)
9306 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9309 /* A value representing the special debugging function that outputs
9310 VAX floating-point values of the type represented by TYPE. Assumes
9311 ada_is_vax_floating_type (TYPE). */
9314 ada_vax_float_print_function (struct type
*type
)
9316 switch (ada_vax_float_type_suffix (type
))
9319 return get_var_value ("DEBUG_STRING_F", 0);
9321 return get_var_value ("DEBUG_STRING_D", 0);
9323 return get_var_value ("DEBUG_STRING_G", 0);
9325 error (_("invalid VAX floating-point type"));
9332 /* Scan STR beginning at position K for a discriminant name, and
9333 return the value of that discriminant field of DVAL in *PX. If
9334 PNEW_K is not null, put the position of the character beyond the
9335 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9336 not alter *PX and *PNEW_K if unsuccessful. */
9339 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9342 static char *bound_buffer
= NULL
;
9343 static size_t bound_buffer_len
= 0;
9346 struct value
*bound_val
;
9348 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9351 pend
= strstr (str
+ k
, "__");
9355 k
+= strlen (bound
);
9359 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9360 bound
= bound_buffer
;
9361 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9362 bound
[pend
- (str
+ k
)] = '\0';
9366 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9367 if (bound_val
== NULL
)
9370 *px
= value_as_long (bound_val
);
9376 /* Value of variable named NAME in the current environment. If
9377 no such variable found, then if ERR_MSG is null, returns 0, and
9378 otherwise causes an error with message ERR_MSG. */
9380 static struct value
*
9381 get_var_value (char *name
, char *err_msg
)
9383 struct ada_symbol_info
*syms
;
9386 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9391 if (err_msg
== NULL
)
9394 error (("%s"), err_msg
);
9397 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9400 /* Value of integer variable named NAME in the current environment. If
9401 no such variable found, returns 0, and sets *FLAG to 0. If
9402 successful, sets *FLAG to 1. */
9405 get_int_var_value (char *name
, int *flag
)
9407 struct value
*var_val
= get_var_value (name
, 0);
9419 return value_as_long (var_val
);
9424 /* Return a range type whose base type is that of the range type named
9425 NAME in the current environment, and whose bounds are calculated
9426 from NAME according to the GNAT range encoding conventions.
9427 Extract discriminant values, if needed, from DVAL. If a new type
9428 must be created, allocate in OBJFILE's space. The bounds
9429 information, in general, is encoded in NAME, the base type given in
9430 the named range type. */
9432 static struct type
*
9433 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9435 struct type
*raw_type
= ada_find_any_type (name
);
9436 struct type
*base_type
;
9439 /* Also search primitive types if type symbol could not be found. */
9440 if (raw_type
== NULL
)
9441 raw_type
= language_lookup_primitive_type_by_name
9442 (language_def (language_ada
), current_gdbarch
, name
);
9444 if (raw_type
== NULL
)
9445 base_type
= builtin_type_int32
;
9446 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9447 base_type
= TYPE_TARGET_TYPE (raw_type
);
9449 base_type
= raw_type
;
9451 subtype_info
= strstr (name
, "___XD");
9452 if (subtype_info
== NULL
)
9454 LONGEST L
= discrete_type_low_bound (raw_type
);
9455 LONGEST U
= discrete_type_high_bound (raw_type
);
9456 if (L
< INT_MIN
|| U
> INT_MAX
)
9459 return create_range_type (alloc_type (objfile
), raw_type
,
9460 discrete_type_low_bound (raw_type
),
9461 discrete_type_high_bound (raw_type
));
9465 static char *name_buf
= NULL
;
9466 static size_t name_len
= 0;
9467 int prefix_len
= subtype_info
- name
;
9473 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9474 strncpy (name_buf
, name
, prefix_len
);
9475 name_buf
[prefix_len
] = '\0';
9478 bounds_str
= strchr (subtype_info
, '_');
9481 if (*subtype_info
== 'L')
9483 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9484 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9486 if (bounds_str
[n
] == '_')
9488 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9495 strcpy (name_buf
+ prefix_len
, "___L");
9496 L
= get_int_var_value (name_buf
, &ok
);
9499 lim_warning (_("Unknown lower bound, using 1."));
9504 if (*subtype_info
== 'U')
9506 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9507 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9513 strcpy (name_buf
+ prefix_len
, "___U");
9514 U
= get_int_var_value (name_buf
, &ok
);
9517 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9522 if (objfile
== NULL
)
9523 objfile
= TYPE_OBJFILE (base_type
);
9524 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9525 TYPE_NAME (type
) = name
;
9530 /* True iff NAME is the name of a range type. */
9533 ada_is_range_type_name (const char *name
)
9535 return (name
!= NULL
&& strstr (name
, "___XD"));
9541 /* True iff TYPE is an Ada modular type. */
9544 ada_is_modular_type (struct type
*type
)
9546 struct type
*subranged_type
= base_type (type
);
9548 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9549 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9550 && TYPE_UNSIGNED (subranged_type
));
9553 /* Try to determine the lower and upper bounds of the given modular type
9554 using the type name only. Return non-zero and set L and U as the lower
9555 and upper bounds (respectively) if successful. */
9558 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9560 char *name
= ada_type_name (type
);
9568 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9569 we are looking for static bounds, which means an __XDLU suffix.
9570 Moreover, we know that the lower bound of modular types is always
9571 zero, so the actual suffix should start with "__XDLU_0__", and
9572 then be followed by the upper bound value. */
9573 suffix
= strstr (name
, "__XDLU_0__");
9577 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9580 *modulus
= (ULONGEST
) U
+ 1;
9584 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9587 ada_modulus (struct type
*type
)
9591 /* Normally, the modulus of a modular type is equal to the value of
9592 its upper bound + 1. However, the upper bound is currently stored
9593 as an int, which is not always big enough to hold the actual bound
9594 value. To workaround this, try to take advantage of the encoding
9595 that GNAT uses with with discrete types. To avoid some unnecessary
9596 parsing, we do this only when the size of TYPE is greater than
9597 the size of the field holding the bound. */
9598 if (TYPE_LENGTH (type
) > sizeof (TYPE_HIGH_BOUND (type
))
9599 && ada_modulus_from_name (type
, &modulus
))
9602 return (ULONGEST
) (unsigned int) TYPE_HIGH_BOUND (type
) + 1;
9606 /* Ada exception catchpoint support:
9607 ---------------------------------
9609 We support 3 kinds of exception catchpoints:
9610 . catchpoints on Ada exceptions
9611 . catchpoints on unhandled Ada exceptions
9612 . catchpoints on failed assertions
9614 Exceptions raised during failed assertions, or unhandled exceptions
9615 could perfectly be caught with the general catchpoint on Ada exceptions.
9616 However, we can easily differentiate these two special cases, and having
9617 the option to distinguish these two cases from the rest can be useful
9618 to zero-in on certain situations.
9620 Exception catchpoints are a specialized form of breakpoint,
9621 since they rely on inserting breakpoints inside known routines
9622 of the GNAT runtime. The implementation therefore uses a standard
9623 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9626 Support in the runtime for exception catchpoints have been changed
9627 a few times already, and these changes affect the implementation
9628 of these catchpoints. In order to be able to support several
9629 variants of the runtime, we use a sniffer that will determine
9630 the runtime variant used by the program being debugged.
9632 At this time, we do not support the use of conditions on Ada exception
9633 catchpoints. The COND and COND_STRING fields are therefore set
9634 to NULL (most of the time, see below).
9636 Conditions where EXP_STRING, COND, and COND_STRING are used:
9638 When a user specifies the name of a specific exception in the case
9639 of catchpoints on Ada exceptions, we store the name of that exception
9640 in the EXP_STRING. We then translate this request into an actual
9641 condition stored in COND_STRING, and then parse it into an expression
9644 /* The different types of catchpoints that we introduced for catching
9647 enum exception_catchpoint_kind
9650 ex_catch_exception_unhandled
,
9654 /* Ada's standard exceptions. */
9656 static char *standard_exc
[] = {
9663 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9665 /* A structure that describes how to support exception catchpoints
9666 for a given executable. */
9668 struct exception_support_info
9670 /* The name of the symbol to break on in order to insert
9671 a catchpoint on exceptions. */
9672 const char *catch_exception_sym
;
9674 /* The name of the symbol to break on in order to insert
9675 a catchpoint on unhandled exceptions. */
9676 const char *catch_exception_unhandled_sym
;
9678 /* The name of the symbol to break on in order to insert
9679 a catchpoint on failed assertions. */
9680 const char *catch_assert_sym
;
9682 /* Assuming that the inferior just triggered an unhandled exception
9683 catchpoint, this function is responsible for returning the address
9684 in inferior memory where the name of that exception is stored.
9685 Return zero if the address could not be computed. */
9686 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9689 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9690 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9692 /* The following exception support info structure describes how to
9693 implement exception catchpoints with the latest version of the
9694 Ada runtime (as of 2007-03-06). */
9696 static const struct exception_support_info default_exception_support_info
=
9698 "__gnat_debug_raise_exception", /* catch_exception_sym */
9699 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9700 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9701 ada_unhandled_exception_name_addr
9704 /* The following exception support info structure describes how to
9705 implement exception catchpoints with a slightly older version
9706 of the Ada runtime. */
9708 static const struct exception_support_info exception_support_info_fallback
=
9710 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9711 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9712 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9713 ada_unhandled_exception_name_addr_from_raise
9716 /* For each executable, we sniff which exception info structure to use
9717 and cache it in the following global variable. */
9719 static const struct exception_support_info
*exception_info
= NULL
;
9721 /* Inspect the Ada runtime and determine which exception info structure
9722 should be used to provide support for exception catchpoints.
9724 This function will always set exception_info, or raise an error. */
9727 ada_exception_support_info_sniffer (void)
9731 /* If the exception info is already known, then no need to recompute it. */
9732 if (exception_info
!= NULL
)
9735 /* Check the latest (default) exception support info. */
9736 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9740 exception_info
= &default_exception_support_info
;
9744 /* Try our fallback exception suport info. */
9745 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9749 exception_info
= &exception_support_info_fallback
;
9753 /* Sometimes, it is normal for us to not be able to find the routine
9754 we are looking for. This happens when the program is linked with
9755 the shared version of the GNAT runtime, and the program has not been
9756 started yet. Inform the user of these two possible causes if
9759 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9760 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9762 /* If the symbol does not exist, then check that the program is
9763 already started, to make sure that shared libraries have been
9764 loaded. If it is not started, this may mean that the symbol is
9765 in a shared library. */
9767 if (ptid_get_pid (inferior_ptid
) == 0)
9768 error (_("Unable to insert catchpoint. Try to start the program first."));
9770 /* At this point, we know that we are debugging an Ada program and
9771 that the inferior has been started, but we still are not able to
9772 find the run-time symbols. That can mean that we are in
9773 configurable run time mode, or that a-except as been optimized
9774 out by the linker... In any case, at this point it is not worth
9775 supporting this feature. */
9777 error (_("Cannot insert catchpoints in this configuration."));
9780 /* An observer of "executable_changed" events.
9781 Its role is to clear certain cached values that need to be recomputed
9782 each time a new executable is loaded by GDB. */
9785 ada_executable_changed_observer (void)
9787 /* If the executable changed, then it is possible that the Ada runtime
9788 is different. So we need to invalidate the exception support info
9790 exception_info
= NULL
;
9793 /* Return the name of the function at PC, NULL if could not find it.
9794 This function only checks the debugging information, not the symbol
9798 function_name_from_pc (CORE_ADDR pc
)
9802 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9808 /* True iff FRAME is very likely to be that of a function that is
9809 part of the runtime system. This is all very heuristic, but is
9810 intended to be used as advice as to what frames are uninteresting
9814 is_known_support_routine (struct frame_info
*frame
)
9816 struct symtab_and_line sal
;
9820 /* If this code does not have any debugging information (no symtab),
9821 This cannot be any user code. */
9823 find_frame_sal (frame
, &sal
);
9824 if (sal
.symtab
== NULL
)
9827 /* If there is a symtab, but the associated source file cannot be
9828 located, then assume this is not user code: Selecting a frame
9829 for which we cannot display the code would not be very helpful
9830 for the user. This should also take care of case such as VxWorks
9831 where the kernel has some debugging info provided for a few units. */
9833 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9836 /* Check the unit filename againt the Ada runtime file naming.
9837 We also check the name of the objfile against the name of some
9838 known system libraries that sometimes come with debugging info
9841 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9843 re_comp (known_runtime_file_name_patterns
[i
]);
9844 if (re_exec (sal
.symtab
->filename
))
9846 if (sal
.symtab
->objfile
!= NULL
9847 && re_exec (sal
.symtab
->objfile
->name
))
9851 /* Check whether the function is a GNAT-generated entity. */
9853 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9854 if (func_name
== NULL
)
9857 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9859 re_comp (known_auxiliary_function_name_patterns
[i
]);
9860 if (re_exec (func_name
))
9867 /* Find the first frame that contains debugging information and that is not
9868 part of the Ada run-time, starting from FI and moving upward. */
9871 ada_find_printable_frame (struct frame_info
*fi
)
9873 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9875 if (!is_known_support_routine (fi
))
9884 /* Assuming that the inferior just triggered an unhandled exception
9885 catchpoint, return the address in inferior memory where the name
9886 of the exception is stored.
9888 Return zero if the address could not be computed. */
9891 ada_unhandled_exception_name_addr (void)
9893 return parse_and_eval_address ("e.full_name");
9896 /* Same as ada_unhandled_exception_name_addr, except that this function
9897 should be used when the inferior uses an older version of the runtime,
9898 where the exception name needs to be extracted from a specific frame
9899 several frames up in the callstack. */
9902 ada_unhandled_exception_name_addr_from_raise (void)
9905 struct frame_info
*fi
;
9907 /* To determine the name of this exception, we need to select
9908 the frame corresponding to RAISE_SYM_NAME. This frame is
9909 at least 3 levels up, so we simply skip the first 3 frames
9910 without checking the name of their associated function. */
9911 fi
= get_current_frame ();
9912 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9914 fi
= get_prev_frame (fi
);
9918 const char *func_name
=
9919 function_name_from_pc (get_frame_address_in_block (fi
));
9920 if (func_name
!= NULL
9921 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9922 break; /* We found the frame we were looking for... */
9923 fi
= get_prev_frame (fi
);
9930 return parse_and_eval_address ("id.full_name");
9933 /* Assuming the inferior just triggered an Ada exception catchpoint
9934 (of any type), return the address in inferior memory where the name
9935 of the exception is stored, if applicable.
9937 Return zero if the address could not be computed, or if not relevant. */
9940 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9941 struct breakpoint
*b
)
9945 case ex_catch_exception
:
9946 return (parse_and_eval_address ("e.full_name"));
9949 case ex_catch_exception_unhandled
:
9950 return exception_info
->unhandled_exception_name_addr ();
9953 case ex_catch_assert
:
9954 return 0; /* Exception name is not relevant in this case. */
9958 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9962 return 0; /* Should never be reached. */
9965 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9966 any error that ada_exception_name_addr_1 might cause to be thrown.
9967 When an error is intercepted, a warning with the error message is printed,
9968 and zero is returned. */
9971 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9972 struct breakpoint
*b
)
9974 struct gdb_exception e
;
9975 CORE_ADDR result
= 0;
9977 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9979 result
= ada_exception_name_addr_1 (ex
, b
);
9984 warning (_("failed to get exception name: %s"), e
.message
);
9991 /* Implement the PRINT_IT method in the breakpoint_ops structure
9992 for all exception catchpoint kinds. */
9994 static enum print_stop_action
9995 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
9997 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
9998 char exception_name
[256];
10002 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10003 exception_name
[sizeof (exception_name
) - 1] = '\0';
10006 ada_find_printable_frame (get_current_frame ());
10008 annotate_catchpoint (b
->number
);
10011 case ex_catch_exception
:
10013 printf_filtered (_("\nCatchpoint %d, %s at "),
10014 b
->number
, exception_name
);
10016 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10018 case ex_catch_exception_unhandled
:
10020 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10021 b
->number
, exception_name
);
10023 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10026 case ex_catch_assert
:
10027 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10032 return PRINT_SRC_AND_LOC
;
10035 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10036 for all exception catchpoint kinds. */
10039 print_one_exception (enum exception_catchpoint_kind ex
,
10040 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10042 struct value_print_options opts
;
10044 get_user_print_options (&opts
);
10045 if (opts
.addressprint
)
10047 annotate_field (4);
10048 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10051 annotate_field (5);
10052 *last_addr
= b
->loc
->address
;
10055 case ex_catch_exception
:
10056 if (b
->exp_string
!= NULL
)
10058 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10060 ui_out_field_string (uiout
, "what", msg
);
10064 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10068 case ex_catch_exception_unhandled
:
10069 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10072 case ex_catch_assert
:
10073 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10077 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10082 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10083 for all exception catchpoint kinds. */
10086 print_mention_exception (enum exception_catchpoint_kind ex
,
10087 struct breakpoint
*b
)
10091 case ex_catch_exception
:
10092 if (b
->exp_string
!= NULL
)
10093 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10094 b
->number
, b
->exp_string
);
10096 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10100 case ex_catch_exception_unhandled
:
10101 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10105 case ex_catch_assert
:
10106 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10110 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10115 /* Virtual table for "catch exception" breakpoints. */
10117 static enum print_stop_action
10118 print_it_catch_exception (struct breakpoint
*b
)
10120 return print_it_exception (ex_catch_exception
, b
);
10124 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10126 print_one_exception (ex_catch_exception
, b
, last_addr
);
10130 print_mention_catch_exception (struct breakpoint
*b
)
10132 print_mention_exception (ex_catch_exception
, b
);
10135 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10139 NULL
, /* breakpoint_hit */
10140 print_it_catch_exception
,
10141 print_one_catch_exception
,
10142 print_mention_catch_exception
10145 /* Virtual table for "catch exception unhandled" breakpoints. */
10147 static enum print_stop_action
10148 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10150 return print_it_exception (ex_catch_exception_unhandled
, b
);
10154 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10156 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10160 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10162 print_mention_exception (ex_catch_exception_unhandled
, b
);
10165 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10168 NULL
, /* breakpoint_hit */
10169 print_it_catch_exception_unhandled
,
10170 print_one_catch_exception_unhandled
,
10171 print_mention_catch_exception_unhandled
10174 /* Virtual table for "catch assert" breakpoints. */
10176 static enum print_stop_action
10177 print_it_catch_assert (struct breakpoint
*b
)
10179 return print_it_exception (ex_catch_assert
, b
);
10183 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10185 print_one_exception (ex_catch_assert
, b
, last_addr
);
10189 print_mention_catch_assert (struct breakpoint
*b
)
10191 print_mention_exception (ex_catch_assert
, b
);
10194 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10197 NULL
, /* breakpoint_hit */
10198 print_it_catch_assert
,
10199 print_one_catch_assert
,
10200 print_mention_catch_assert
10203 /* Return non-zero if B is an Ada exception catchpoint. */
10206 ada_exception_catchpoint_p (struct breakpoint
*b
)
10208 return (b
->ops
== &catch_exception_breakpoint_ops
10209 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10210 || b
->ops
== &catch_assert_breakpoint_ops
);
10213 /* Return a newly allocated copy of the first space-separated token
10214 in ARGSP, and then adjust ARGSP to point immediately after that
10217 Return NULL if ARGPS does not contain any more tokens. */
10220 ada_get_next_arg (char **argsp
)
10222 char *args
= *argsp
;
10226 /* Skip any leading white space. */
10228 while (isspace (*args
))
10231 if (args
[0] == '\0')
10232 return NULL
; /* No more arguments. */
10234 /* Find the end of the current argument. */
10237 while (*end
!= '\0' && !isspace (*end
))
10240 /* Adjust ARGSP to point to the start of the next argument. */
10244 /* Make a copy of the current argument and return it. */
10246 result
= xmalloc (end
- args
+ 1);
10247 strncpy (result
, args
, end
- args
);
10248 result
[end
- args
] = '\0';
10253 /* Split the arguments specified in a "catch exception" command.
10254 Set EX to the appropriate catchpoint type.
10255 Set EXP_STRING to the name of the specific exception if
10256 specified by the user. */
10259 catch_ada_exception_command_split (char *args
,
10260 enum exception_catchpoint_kind
*ex
,
10263 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10264 char *exception_name
;
10266 exception_name
= ada_get_next_arg (&args
);
10267 make_cleanup (xfree
, exception_name
);
10269 /* Check that we do not have any more arguments. Anything else
10272 while (isspace (*args
))
10275 if (args
[0] != '\0')
10276 error (_("Junk at end of expression"));
10278 discard_cleanups (old_chain
);
10280 if (exception_name
== NULL
)
10282 /* Catch all exceptions. */
10283 *ex
= ex_catch_exception
;
10284 *exp_string
= NULL
;
10286 else if (strcmp (exception_name
, "unhandled") == 0)
10288 /* Catch unhandled exceptions. */
10289 *ex
= ex_catch_exception_unhandled
;
10290 *exp_string
= NULL
;
10294 /* Catch a specific exception. */
10295 *ex
= ex_catch_exception
;
10296 *exp_string
= exception_name
;
10300 /* Return the name of the symbol on which we should break in order to
10301 implement a catchpoint of the EX kind. */
10303 static const char *
10304 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10306 gdb_assert (exception_info
!= NULL
);
10310 case ex_catch_exception
:
10311 return (exception_info
->catch_exception_sym
);
10313 case ex_catch_exception_unhandled
:
10314 return (exception_info
->catch_exception_unhandled_sym
);
10316 case ex_catch_assert
:
10317 return (exception_info
->catch_assert_sym
);
10320 internal_error (__FILE__
, __LINE__
,
10321 _("unexpected catchpoint kind (%d)"), ex
);
10325 /* Return the breakpoint ops "virtual table" used for catchpoints
10328 static struct breakpoint_ops
*
10329 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10333 case ex_catch_exception
:
10334 return (&catch_exception_breakpoint_ops
);
10336 case ex_catch_exception_unhandled
:
10337 return (&catch_exception_unhandled_breakpoint_ops
);
10339 case ex_catch_assert
:
10340 return (&catch_assert_breakpoint_ops
);
10343 internal_error (__FILE__
, __LINE__
,
10344 _("unexpected catchpoint kind (%d)"), ex
);
10348 /* Return the condition that will be used to match the current exception
10349 being raised with the exception that the user wants to catch. This
10350 assumes that this condition is used when the inferior just triggered
10351 an exception catchpoint.
10353 The string returned is a newly allocated string that needs to be
10354 deallocated later. */
10357 ada_exception_catchpoint_cond_string (const char *exp_string
)
10361 /* The standard exceptions are a special case. They are defined in
10362 runtime units that have been compiled without debugging info; if
10363 EXP_STRING is the not-fully-qualified name of a standard
10364 exception (e.g. "constraint_error") then, during the evaluation
10365 of the condition expression, the symbol lookup on this name would
10366 *not* return this standard exception. The catchpoint condition
10367 may then be set only on user-defined exceptions which have the
10368 same not-fully-qualified name (e.g. my_package.constraint_error).
10370 To avoid this unexcepted behavior, these standard exceptions are
10371 systematically prefixed by "standard". This means that "catch
10372 exception constraint_error" is rewritten into "catch exception
10373 standard.constraint_error".
10375 If an exception named contraint_error is defined in another package of
10376 the inferior program, then the only way to specify this exception as a
10377 breakpoint condition is to use its fully-qualified named:
10378 e.g. my_package.constraint_error. */
10380 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10382 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10384 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10388 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10391 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10393 static struct expression
*
10394 ada_parse_catchpoint_condition (char *cond_string
,
10395 struct symtab_and_line sal
)
10397 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10400 /* Return the symtab_and_line that should be used to insert an exception
10401 catchpoint of the TYPE kind.
10403 EX_STRING should contain the name of a specific exception
10404 that the catchpoint should catch, or NULL otherwise.
10406 The idea behind all the remaining parameters is that their names match
10407 the name of certain fields in the breakpoint structure that are used to
10408 handle exception catchpoints. This function returns the value to which
10409 these fields should be set, depending on the type of catchpoint we need
10412 If COND and COND_STRING are both non-NULL, any value they might
10413 hold will be free'ed, and then replaced by newly allocated ones.
10414 These parameters are left untouched otherwise. */
10416 static struct symtab_and_line
10417 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10418 char **addr_string
, char **cond_string
,
10419 struct expression
**cond
, struct breakpoint_ops
**ops
)
10421 const char *sym_name
;
10422 struct symbol
*sym
;
10423 struct symtab_and_line sal
;
10425 /* First, find out which exception support info to use. */
10426 ada_exception_support_info_sniffer ();
10428 /* Then lookup the function on which we will break in order to catch
10429 the Ada exceptions requested by the user. */
10431 sym_name
= ada_exception_sym_name (ex
);
10432 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10434 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10435 that should be compiled with debugging information. As a result, we
10436 expect to find that symbol in the symtabs. If we don't find it, then
10437 the target most likely does not support Ada exceptions, or we cannot
10438 insert exception breakpoints yet, because the GNAT runtime hasn't been
10441 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10442 in such a way that no debugging information is produced for the symbol
10443 we are looking for. In this case, we could search the minimal symbols
10444 as a fall-back mechanism. This would still be operating in degraded
10445 mode, however, as we would still be missing the debugging information
10446 that is needed in order to extract the name of the exception being
10447 raised (this name is printed in the catchpoint message, and is also
10448 used when trying to catch a specific exception). We do not handle
10449 this case for now. */
10452 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10454 /* Make sure that the symbol we found corresponds to a function. */
10455 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10456 error (_("Symbol \"%s\" is not a function (class = %d)"),
10457 sym_name
, SYMBOL_CLASS (sym
));
10459 sal
= find_function_start_sal (sym
, 1);
10461 /* Set ADDR_STRING. */
10463 *addr_string
= xstrdup (sym_name
);
10465 /* Set the COND and COND_STRING (if not NULL). */
10467 if (cond_string
!= NULL
&& cond
!= NULL
)
10469 if (*cond_string
!= NULL
)
10471 xfree (*cond_string
);
10472 *cond_string
= NULL
;
10479 if (exp_string
!= NULL
)
10481 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10482 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10487 *ops
= ada_exception_breakpoint_ops (ex
);
10492 /* Parse the arguments (ARGS) of the "catch exception" command.
10494 Set TYPE to the appropriate exception catchpoint type.
10495 If the user asked the catchpoint to catch only a specific
10496 exception, then save the exception name in ADDR_STRING.
10498 See ada_exception_sal for a description of all the remaining
10499 function arguments of this function. */
10501 struct symtab_and_line
10502 ada_decode_exception_location (char *args
, char **addr_string
,
10503 char **exp_string
, char **cond_string
,
10504 struct expression
**cond
,
10505 struct breakpoint_ops
**ops
)
10507 enum exception_catchpoint_kind ex
;
10509 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10510 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10514 struct symtab_and_line
10515 ada_decode_assert_location (char *args
, char **addr_string
,
10516 struct breakpoint_ops
**ops
)
10518 /* Check that no argument where provided at the end of the command. */
10522 while (isspace (*args
))
10525 error (_("Junk at end of arguments."));
10528 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10533 /* Information about operators given special treatment in functions
10535 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10537 #define ADA_OPERATORS \
10538 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10539 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10540 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10541 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10542 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10543 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10544 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10545 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10546 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10547 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10548 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10549 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10550 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10551 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10552 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10553 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10554 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10555 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10556 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10559 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10561 switch (exp
->elts
[pc
- 1].opcode
)
10564 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10567 #define OP_DEFN(op, len, args, binop) \
10568 case op: *oplenp = len; *argsp = args; break;
10574 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10579 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10585 ada_op_name (enum exp_opcode opcode
)
10590 return op_name_standard (opcode
);
10592 #define OP_DEFN(op, len, args, binop) case op: return #op;
10597 return "OP_AGGREGATE";
10599 return "OP_CHOICES";
10605 /* As for operator_length, but assumes PC is pointing at the first
10606 element of the operator, and gives meaningful results only for the
10607 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10610 ada_forward_operator_length (struct expression
*exp
, int pc
,
10611 int *oplenp
, int *argsp
)
10613 switch (exp
->elts
[pc
].opcode
)
10616 *oplenp
= *argsp
= 0;
10619 #define OP_DEFN(op, len, args, binop) \
10620 case op: *oplenp = len; *argsp = args; break;
10626 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10631 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10637 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10638 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10646 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10648 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10653 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10657 /* Ada attributes ('Foo). */
10660 case OP_ATR_LENGTH
:
10664 case OP_ATR_MODULUS
:
10671 case UNOP_IN_RANGE
:
10673 /* XXX: gdb_sprint_host_address, type_sprint */
10674 fprintf_filtered (stream
, _("Type @"));
10675 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10676 fprintf_filtered (stream
, " (");
10677 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10678 fprintf_filtered (stream
, ")");
10680 case BINOP_IN_BOUNDS
:
10681 fprintf_filtered (stream
, " (%d)",
10682 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10684 case TERNOP_IN_RANGE
:
10689 case OP_DISCRETE_RANGE
:
10690 case OP_POSITIONAL
:
10697 char *name
= &exp
->elts
[elt
+ 2].string
;
10698 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10699 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10704 return dump_subexp_body_standard (exp
, stream
, elt
);
10708 for (i
= 0; i
< nargs
; i
+= 1)
10709 elt
= dump_subexp (exp
, stream
, elt
);
10714 /* The Ada extension of print_subexp (q.v.). */
10717 ada_print_subexp (struct expression
*exp
, int *pos
,
10718 struct ui_file
*stream
, enum precedence prec
)
10720 int oplen
, nargs
, i
;
10722 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10724 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10731 print_subexp_standard (exp
, pos
, stream
, prec
);
10735 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10738 case BINOP_IN_BOUNDS
:
10739 /* XXX: sprint_subexp */
10740 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10741 fputs_filtered (" in ", stream
);
10742 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10743 fputs_filtered ("'range", stream
);
10744 if (exp
->elts
[pc
+ 1].longconst
> 1)
10745 fprintf_filtered (stream
, "(%ld)",
10746 (long) exp
->elts
[pc
+ 1].longconst
);
10749 case TERNOP_IN_RANGE
:
10750 if (prec
>= PREC_EQUAL
)
10751 fputs_filtered ("(", stream
);
10752 /* XXX: sprint_subexp */
10753 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10754 fputs_filtered (" in ", stream
);
10755 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10756 fputs_filtered (" .. ", stream
);
10757 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10758 if (prec
>= PREC_EQUAL
)
10759 fputs_filtered (")", stream
);
10764 case OP_ATR_LENGTH
:
10768 case OP_ATR_MODULUS
:
10773 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10775 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10776 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10780 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10781 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10785 for (tem
= 1; tem
< nargs
; tem
+= 1)
10787 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10788 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10790 fputs_filtered (")", stream
);
10795 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10796 fputs_filtered ("'(", stream
);
10797 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10798 fputs_filtered (")", stream
);
10801 case UNOP_IN_RANGE
:
10802 /* XXX: sprint_subexp */
10803 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10804 fputs_filtered (" in ", stream
);
10805 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10808 case OP_DISCRETE_RANGE
:
10809 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10810 fputs_filtered ("..", stream
);
10811 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10815 fputs_filtered ("others => ", stream
);
10816 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10820 for (i
= 0; i
< nargs
-1; i
+= 1)
10823 fputs_filtered ("|", stream
);
10824 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10826 fputs_filtered (" => ", stream
);
10827 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10830 case OP_POSITIONAL
:
10831 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10835 fputs_filtered ("(", stream
);
10836 for (i
= 0; i
< nargs
; i
+= 1)
10839 fputs_filtered (", ", stream
);
10840 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10842 fputs_filtered (")", stream
);
10847 /* Table mapping opcodes into strings for printing operators
10848 and precedences of the operators. */
10850 static const struct op_print ada_op_print_tab
[] = {
10851 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10852 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10853 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10854 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10855 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10856 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10857 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10858 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10859 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10860 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10861 {">", BINOP_GTR
, PREC_ORDER
, 0},
10862 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10863 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10864 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10865 {"+", BINOP_ADD
, PREC_ADD
, 0},
10866 {"-", BINOP_SUB
, PREC_ADD
, 0},
10867 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10868 {"*", BINOP_MUL
, PREC_MUL
, 0},
10869 {"/", BINOP_DIV
, PREC_MUL
, 0},
10870 {"rem", BINOP_REM
, PREC_MUL
, 0},
10871 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10872 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10873 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10874 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10875 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10876 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10877 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10878 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10879 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10880 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10881 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10885 enum ada_primitive_types
{
10886 ada_primitive_type_int
,
10887 ada_primitive_type_long
,
10888 ada_primitive_type_short
,
10889 ada_primitive_type_char
,
10890 ada_primitive_type_float
,
10891 ada_primitive_type_double
,
10892 ada_primitive_type_void
,
10893 ada_primitive_type_long_long
,
10894 ada_primitive_type_long_double
,
10895 ada_primitive_type_natural
,
10896 ada_primitive_type_positive
,
10897 ada_primitive_type_system_address
,
10898 nr_ada_primitive_types
10902 ada_language_arch_info (struct gdbarch
*gdbarch
,
10903 struct language_arch_info
*lai
)
10905 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10906 lai
->primitive_type_vector
10907 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10909 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10910 init_type (TYPE_CODE_INT
,
10911 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10912 0, "integer", (struct objfile
*) NULL
);
10913 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10914 init_type (TYPE_CODE_INT
,
10915 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10916 0, "long_integer", (struct objfile
*) NULL
);
10917 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10918 init_type (TYPE_CODE_INT
,
10919 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10920 0, "short_integer", (struct objfile
*) NULL
);
10921 lai
->string_char_type
=
10922 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10923 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10924 0, "character", (struct objfile
*) NULL
);
10925 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10926 init_type (TYPE_CODE_FLT
,
10927 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10928 0, "float", (struct objfile
*) NULL
);
10929 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10930 init_type (TYPE_CODE_FLT
,
10931 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10932 0, "long_float", (struct objfile
*) NULL
);
10933 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10934 init_type (TYPE_CODE_INT
,
10935 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10936 0, "long_long_integer", (struct objfile
*) NULL
);
10937 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10938 init_type (TYPE_CODE_FLT
,
10939 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10940 0, "long_long_float", (struct objfile
*) NULL
);
10941 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10942 init_type (TYPE_CODE_INT
,
10943 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10944 0, "natural", (struct objfile
*) NULL
);
10945 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10946 init_type (TYPE_CODE_INT
,
10947 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10948 0, "positive", (struct objfile
*) NULL
);
10949 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10951 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10952 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10953 (struct objfile
*) NULL
));
10954 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10955 = "system__address";
10957 lai
->bool_type_symbol
= NULL
;
10958 lai
->bool_type_default
= builtin
->builtin_bool
;
10961 /* Language vector */
10963 /* Not really used, but needed in the ada_language_defn. */
10966 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
10968 ada_emit_char (c
, type
, stream
, quoter
, 1);
10974 warnings_issued
= 0;
10975 return ada_parse ();
10978 static const struct exp_descriptor ada_exp_descriptor
= {
10980 ada_operator_length
,
10982 ada_dump_subexp_body
,
10983 ada_evaluate_subexp
10986 const struct language_defn ada_language_defn
= {
10987 "ada", /* Language name */
10991 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
10992 that's not quite what this means. */
10994 macro_expansion_no
,
10995 &ada_exp_descriptor
,
10999 ada_printchar
, /* Print a character constant */
11000 ada_printstr
, /* Function to print string constant */
11001 emit_char
, /* Function to print single char (not used) */
11002 ada_print_type
, /* Print a type using appropriate syntax */
11003 default_print_typedef
, /* Print a typedef using appropriate syntax */
11004 ada_val_print
, /* Print a value using appropriate syntax */
11005 ada_value_print
, /* Print a top-level value */
11006 NULL
, /* Language specific skip_trampoline */
11007 NULL
, /* name_of_this */
11008 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11009 basic_lookup_transparent_type
, /* lookup_transparent_type */
11010 ada_la_decode
, /* Language specific symbol demangler */
11011 NULL
, /* Language specific class_name_from_physname */
11012 ada_op_print_tab
, /* expression operators for printing */
11013 0, /* c-style arrays */
11014 1, /* String lower bound */
11015 ada_get_gdb_completer_word_break_characters
,
11016 ada_make_symbol_completion_list
,
11017 ada_language_arch_info
,
11018 ada_print_array_index
,
11019 default_pass_by_reference
,
11024 /* Provide a prototype to silence -Wmissing-prototypes. */
11025 extern initialize_file_ftype _initialize_ada_language
;
11028 _initialize_ada_language (void)
11030 add_language (&ada_language_defn
);
11032 varsize_limit
= 65536;
11034 obstack_init (&symbol_list_obstack
);
11036 decoded_names_store
= htab_create_alloc
11037 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11038 NULL
, xcalloc
, xfree
);
11040 observer_attach_executable_changed (ada_executable_changed_observer
);