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
);
1822 /* If our value is a pointer, then dererence it. Make sure that
1823 this operation does not cause the target type to be fixed, as
1824 this would indirectly cause this array to be decoded. The rest
1825 of the routine assumes that the array hasn't been decoded yet,
1826 so we use the basic "value_ind" routine to perform the dereferencing,
1827 as opposed to using "ada_value_ind". */
1828 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1829 arr
= value_ind (arr
);
1831 type
= decode_packed_array_type (value_type (arr
));
1834 error (_("can't unpack array"));
1838 if (gdbarch_bits_big_endian (current_gdbarch
)
1839 && ada_is_modular_type (value_type (arr
)))
1841 /* This is a (right-justified) modular type representing a packed
1842 array with no wrapper. In order to interpret the value through
1843 the (left-justified) packed array type we just built, we must
1844 first left-justify it. */
1845 int bit_size
, bit_pos
;
1848 mod
= ada_modulus (value_type (arr
)) - 1;
1855 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1856 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1857 bit_pos
/ HOST_CHAR_BIT
,
1858 bit_pos
% HOST_CHAR_BIT
,
1863 return coerce_unspec_val_to_type (arr
, type
);
1867 /* The value of the element of packed array ARR at the ARITY indices
1868 given in IND. ARR must be a simple array. */
1870 static struct value
*
1871 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1874 int bits
, elt_off
, bit_off
;
1875 long elt_total_bit_offset
;
1876 struct type
*elt_type
;
1880 elt_total_bit_offset
= 0;
1881 elt_type
= ada_check_typedef (value_type (arr
));
1882 for (i
= 0; i
< arity
; i
+= 1)
1884 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1885 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1887 (_("attempt to do packed indexing of something other than a packed array"));
1890 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1891 LONGEST lowerbound
, upperbound
;
1894 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1896 lim_warning (_("don't know bounds of array"));
1897 lowerbound
= upperbound
= 0;
1900 idx
= pos_atr (ind
[i
]);
1901 if (idx
< lowerbound
|| idx
> upperbound
)
1902 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1903 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1904 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1905 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1908 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1909 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1911 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1916 /* Non-zero iff TYPE includes negative integer values. */
1919 has_negatives (struct type
*type
)
1921 switch (TYPE_CODE (type
))
1926 return !TYPE_UNSIGNED (type
);
1927 case TYPE_CODE_RANGE
:
1928 return TYPE_LOW_BOUND (type
) < 0;
1933 /* Create a new value of type TYPE from the contents of OBJ starting
1934 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1935 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1936 assigning through the result will set the field fetched from.
1937 VALADDR is ignored unless OBJ is NULL, in which case,
1938 VALADDR+OFFSET must address the start of storage containing the
1939 packed value. The value returned in this case is never an lval.
1940 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1943 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1944 long offset
, int bit_offset
, int bit_size
,
1948 int src
, /* Index into the source area */
1949 targ
, /* Index into the target area */
1950 srcBitsLeft
, /* Number of source bits left to move */
1951 nsrc
, ntarg
, /* Number of source and target bytes */
1952 unusedLS
, /* Number of bits in next significant
1953 byte of source that are unused */
1954 accumSize
; /* Number of meaningful bits in accum */
1955 unsigned char *bytes
; /* First byte containing data to unpack */
1956 unsigned char *unpacked
;
1957 unsigned long accum
; /* Staging area for bits being transferred */
1959 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1960 /* Transmit bytes from least to most significant; delta is the direction
1961 the indices move. */
1962 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
1964 type
= ada_check_typedef (type
);
1968 v
= allocate_value (type
);
1969 bytes
= (unsigned char *) (valaddr
+ offset
);
1971 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
1974 value_address (obj
) + offset
);
1975 bytes
= (unsigned char *) alloca (len
);
1976 read_memory (value_address (v
), bytes
, len
);
1980 v
= allocate_value (type
);
1981 bytes
= (unsigned char *) value_contents (obj
) + offset
;
1987 set_value_component_location (v
, obj
);
1988 new_addr
= value_address (obj
) + offset
;
1989 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
1990 set_value_bitsize (v
, bit_size
);
1991 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
1994 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
1996 set_value_address (v
, new_addr
);
1999 set_value_bitsize (v
, bit_size
);
2000 unpacked
= (unsigned char *) value_contents (v
);
2002 srcBitsLeft
= bit_size
;
2004 ntarg
= TYPE_LENGTH (type
);
2008 memset (unpacked
, 0, TYPE_LENGTH (type
));
2011 else if (gdbarch_bits_big_endian (current_gdbarch
))
2014 if (has_negatives (type
)
2015 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2019 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2022 switch (TYPE_CODE (type
))
2024 case TYPE_CODE_ARRAY
:
2025 case TYPE_CODE_UNION
:
2026 case TYPE_CODE_STRUCT
:
2027 /* Non-scalar values must be aligned at a byte boundary... */
2029 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2030 /* ... And are placed at the beginning (most-significant) bytes
2032 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2037 targ
= TYPE_LENGTH (type
) - 1;
2043 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2046 unusedLS
= bit_offset
;
2049 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2056 /* Mask for removing bits of the next source byte that are not
2057 part of the value. */
2058 unsigned int unusedMSMask
=
2059 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2061 /* Sign-extend bits for this byte. */
2062 unsigned int signMask
= sign
& ~unusedMSMask
;
2064 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2065 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2066 if (accumSize
>= HOST_CHAR_BIT
)
2068 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2069 accumSize
-= HOST_CHAR_BIT
;
2070 accum
>>= HOST_CHAR_BIT
;
2074 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2081 accum
|= sign
<< accumSize
;
2082 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2083 accumSize
-= HOST_CHAR_BIT
;
2084 accum
>>= HOST_CHAR_BIT
;
2092 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2093 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2096 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2097 int src_offset
, int n
)
2099 unsigned int accum
, mask
;
2100 int accum_bits
, chunk_size
;
2102 target
+= targ_offset
/ HOST_CHAR_BIT
;
2103 targ_offset
%= HOST_CHAR_BIT
;
2104 source
+= src_offset
/ HOST_CHAR_BIT
;
2105 src_offset
%= HOST_CHAR_BIT
;
2106 if (gdbarch_bits_big_endian (current_gdbarch
))
2108 accum
= (unsigned char) *source
;
2110 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2115 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2116 accum_bits
+= HOST_CHAR_BIT
;
2118 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2121 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2122 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2125 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2127 accum_bits
-= chunk_size
;
2134 accum
= (unsigned char) *source
>> src_offset
;
2136 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2140 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2141 accum_bits
+= HOST_CHAR_BIT
;
2143 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2146 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2147 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2149 accum_bits
-= chunk_size
;
2150 accum
>>= chunk_size
;
2157 /* Store the contents of FROMVAL into the location of TOVAL.
2158 Return a new value with the location of TOVAL and contents of
2159 FROMVAL. Handles assignment into packed fields that have
2160 floating-point or non-scalar types. */
2162 static struct value
*
2163 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2165 struct type
*type
= value_type (toval
);
2166 int bits
= value_bitsize (toval
);
2168 toval
= ada_coerce_ref (toval
);
2169 fromval
= ada_coerce_ref (fromval
);
2171 if (ada_is_direct_array_type (value_type (toval
)))
2172 toval
= ada_coerce_to_simple_array (toval
);
2173 if (ada_is_direct_array_type (value_type (fromval
)))
2174 fromval
= ada_coerce_to_simple_array (fromval
);
2176 if (!deprecated_value_modifiable (toval
))
2177 error (_("Left operand of assignment is not a modifiable lvalue."));
2179 if (VALUE_LVAL (toval
) == lval_memory
2181 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2182 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2184 int len
= (value_bitpos (toval
)
2185 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2187 char *buffer
= (char *) alloca (len
);
2189 CORE_ADDR to_addr
= value_address (toval
);
2191 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2192 fromval
= value_cast (type
, fromval
);
2194 read_memory (to_addr
, buffer
, len
);
2195 from_size
= value_bitsize (fromval
);
2197 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2198 if (gdbarch_bits_big_endian (current_gdbarch
))
2199 move_bits (buffer
, value_bitpos (toval
),
2200 value_contents (fromval
), from_size
- bits
, bits
);
2202 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2204 write_memory (to_addr
, buffer
, len
);
2205 if (deprecated_memory_changed_hook
)
2206 deprecated_memory_changed_hook (to_addr
, len
);
2208 val
= value_copy (toval
);
2209 memcpy (value_contents_raw (val
), value_contents (fromval
),
2210 TYPE_LENGTH (type
));
2211 deprecated_set_value_type (val
, type
);
2216 return value_assign (toval
, fromval
);
2220 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2221 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2222 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2223 * COMPONENT, and not the inferior's memory. The current contents
2224 * of COMPONENT are ignored. */
2226 value_assign_to_component (struct value
*container
, struct value
*component
,
2229 LONGEST offset_in_container
=
2230 (LONGEST
) (value_address (component
) - value_address (container
));
2231 int bit_offset_in_container
=
2232 value_bitpos (component
) - value_bitpos (container
);
2235 val
= value_cast (value_type (component
), val
);
2237 if (value_bitsize (component
) == 0)
2238 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2240 bits
= value_bitsize (component
);
2242 if (gdbarch_bits_big_endian (current_gdbarch
))
2243 move_bits (value_contents_writeable (container
) + offset_in_container
,
2244 value_bitpos (container
) + bit_offset_in_container
,
2245 value_contents (val
),
2246 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2249 move_bits (value_contents_writeable (container
) + offset_in_container
,
2250 value_bitpos (container
) + bit_offset_in_container
,
2251 value_contents (val
), 0, bits
);
2254 /* The value of the element of array ARR at the ARITY indices given in IND.
2255 ARR may be either a simple array, GNAT array descriptor, or pointer
2259 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2263 struct type
*elt_type
;
2265 elt
= ada_coerce_to_simple_array (arr
);
2267 elt_type
= ada_check_typedef (value_type (elt
));
2268 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2269 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2270 return value_subscript_packed (elt
, arity
, ind
);
2272 for (k
= 0; k
< arity
; k
+= 1)
2274 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2275 error (_("too many subscripts (%d expected)"), k
);
2276 elt
= value_subscript (elt
, value_pos_atr (builtin_type_int32
, ind
[k
]));
2281 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2282 value of the element of *ARR at the ARITY indices given in
2283 IND. Does not read the entire array into memory. */
2285 static struct value
*
2286 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2291 for (k
= 0; k
< arity
; k
+= 1)
2296 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2297 error (_("too many subscripts (%d expected)"), k
);
2298 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2300 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2301 idx
= value_pos_atr (builtin_type_int32
, ind
[k
]);
2303 idx
= value_binop (idx
, value_from_longest (value_type (idx
), lwb
),
2306 arr
= value_ptradd (arr
, idx
);
2307 type
= TYPE_TARGET_TYPE (type
);
2310 return value_ind (arr
);
2313 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2314 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2315 elements starting at index LOW. The lower bound of this array is LOW, as
2317 static struct value
*
2318 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2321 CORE_ADDR base
= value_as_address (array_ptr
)
2322 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2323 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2324 struct type
*index_type
=
2325 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2327 struct type
*slice_type
=
2328 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2329 return value_at_lazy (slice_type
, base
);
2333 static struct value
*
2334 ada_value_slice (struct value
*array
, int low
, int high
)
2336 struct type
*type
= value_type (array
);
2337 struct type
*index_type
=
2338 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2339 struct type
*slice_type
=
2340 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2341 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2344 /* If type is a record type in the form of a standard GNAT array
2345 descriptor, returns the number of dimensions for type. If arr is a
2346 simple array, returns the number of "array of"s that prefix its
2347 type designation. Otherwise, returns 0. */
2350 ada_array_arity (struct type
*type
)
2357 type
= desc_base_type (type
);
2360 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2361 return desc_arity (desc_bounds_type (type
));
2363 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2366 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2372 /* If TYPE is a record type in the form of a standard GNAT array
2373 descriptor or a simple array type, returns the element type for
2374 TYPE after indexing by NINDICES indices, or by all indices if
2375 NINDICES is -1. Otherwise, returns NULL. */
2378 ada_array_element_type (struct type
*type
, int nindices
)
2380 type
= desc_base_type (type
);
2382 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2385 struct type
*p_array_type
;
2387 p_array_type
= desc_data_target_type (type
);
2389 k
= ada_array_arity (type
);
2393 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2394 if (nindices
>= 0 && k
> nindices
)
2396 while (k
> 0 && p_array_type
!= NULL
)
2398 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2401 return p_array_type
;
2403 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2405 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2407 type
= TYPE_TARGET_TYPE (type
);
2416 /* The type of nth index in arrays of given type (n numbering from 1).
2417 Does not examine memory. */
2420 ada_index_type (struct type
*type
, int n
)
2422 struct type
*result_type
;
2424 type
= desc_base_type (type
);
2426 if (n
> ada_array_arity (type
))
2429 if (ada_is_simple_array_type (type
))
2433 for (i
= 1; i
< n
; i
+= 1)
2434 type
= TYPE_TARGET_TYPE (type
);
2435 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2436 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2437 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2438 perhaps stabsread.c would make more sense. */
2439 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2440 result_type
= builtin_type_int32
;
2445 return desc_index_type (desc_bounds_type (type
), n
);
2448 /* Given that arr is an array type, returns the lower bound of the
2449 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2450 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2451 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2452 bounds type. It works for other arrays with bounds supplied by
2453 run-time quantities other than discriminants. */
2456 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2457 struct type
** typep
)
2459 struct type
*type
, *index_type_desc
, *index_type
;
2462 gdb_assert (which
== 0 || which
== 1);
2464 if (ada_is_packed_array_type (arr_type
))
2465 arr_type
= decode_packed_array_type (arr_type
);
2467 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2470 *typep
= builtin_type_int32
;
2471 return (LONGEST
) - which
;
2474 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2475 type
= TYPE_TARGET_TYPE (arr_type
);
2479 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2480 if (index_type_desc
!= NULL
)
2481 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2482 NULL
, TYPE_OBJFILE (arr_type
));
2487 type
= TYPE_TARGET_TYPE (type
);
2491 index_type
= TYPE_INDEX_TYPE (type
);
2494 switch (TYPE_CODE (index_type
))
2496 case TYPE_CODE_RANGE
:
2497 retval
= which
== 0 ? TYPE_LOW_BOUND (index_type
)
2498 : TYPE_HIGH_BOUND (index_type
);
2500 case TYPE_CODE_ENUM
:
2501 retval
= which
== 0 ? TYPE_FIELD_BITPOS (index_type
, 0)
2502 : TYPE_FIELD_BITPOS (index_type
,
2503 TYPE_NFIELDS (index_type
) - 1);
2506 internal_error (__FILE__
, __LINE__
, _("invalid type code of index type"));
2510 *typep
= index_type
;
2515 /* Given that arr is an array value, returns the lower bound of the
2516 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2517 WHICH is 1. This routine will also work for arrays with bounds
2518 supplied by run-time quantities other than discriminants. */
2521 ada_array_bound (struct value
*arr
, int n
, int which
)
2523 struct type
*arr_type
= value_type (arr
);
2525 if (ada_is_packed_array_type (arr_type
))
2526 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2527 else if (ada_is_simple_array_type (arr_type
))
2530 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2531 return value_from_longest (type
, v
);
2534 return desc_one_bound (desc_bounds (arr
), n
, which
);
2537 /* Given that arr is an array value, returns the length of the
2538 nth index. This routine will also work for arrays with bounds
2539 supplied by run-time quantities other than discriminants.
2540 Does not work for arrays indexed by enumeration types with representation
2541 clauses at the moment. */
2543 static struct value
*
2544 ada_array_length (struct value
*arr
, int n
)
2546 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2548 if (ada_is_packed_array_type (arr_type
))
2549 return ada_array_length (decode_packed_array (arr
), n
);
2551 if (ada_is_simple_array_type (arr_type
))
2555 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2556 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2557 return value_from_longest (type
, v
);
2561 value_from_longest (builtin_type_int32
,
2562 value_as_long (desc_one_bound (desc_bounds (arr
),
2564 - value_as_long (desc_one_bound (desc_bounds (arr
),
2568 /* An empty array whose type is that of ARR_TYPE (an array type),
2569 with bounds LOW to LOW-1. */
2571 static struct value
*
2572 empty_array (struct type
*arr_type
, int low
)
2574 struct type
*index_type
=
2575 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2577 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2578 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2582 /* Name resolution */
2584 /* The "decoded" name for the user-definable Ada operator corresponding
2588 ada_decoded_op_name (enum exp_opcode op
)
2592 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2594 if (ada_opname_table
[i
].op
== op
)
2595 return ada_opname_table
[i
].decoded
;
2597 error (_("Could not find operator name for opcode"));
2601 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2602 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2603 undefined namespace) and converts operators that are
2604 user-defined into appropriate function calls. If CONTEXT_TYPE is
2605 non-null, it provides a preferred result type [at the moment, only
2606 type void has any effect---causing procedures to be preferred over
2607 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2608 return type is preferred. May change (expand) *EXP. */
2611 resolve (struct expression
**expp
, int void_context_p
)
2615 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2618 /* Resolve the operator of the subexpression beginning at
2619 position *POS of *EXPP. "Resolving" consists of replacing
2620 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2621 with their resolutions, replacing built-in operators with
2622 function calls to user-defined operators, where appropriate, and,
2623 when DEPROCEDURE_P is non-zero, converting function-valued variables
2624 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2625 are as in ada_resolve, above. */
2627 static struct value
*
2628 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2629 struct type
*context_type
)
2633 struct expression
*exp
; /* Convenience: == *expp. */
2634 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2635 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2636 int nargs
; /* Number of operands. */
2643 /* Pass one: resolve operands, saving their types and updating *pos,
2648 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2649 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2654 resolve_subexp (expp
, pos
, 0, NULL
);
2656 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2661 resolve_subexp (expp
, pos
, 0, NULL
);
2666 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2669 case OP_ATR_MODULUS
:
2679 case TERNOP_IN_RANGE
:
2680 case BINOP_IN_BOUNDS
:
2686 case OP_DISCRETE_RANGE
:
2688 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2697 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2699 resolve_subexp (expp
, pos
, 1, NULL
);
2701 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2718 case BINOP_LOGICAL_AND
:
2719 case BINOP_LOGICAL_OR
:
2720 case BINOP_BITWISE_AND
:
2721 case BINOP_BITWISE_IOR
:
2722 case BINOP_BITWISE_XOR
:
2725 case BINOP_NOTEQUAL
:
2732 case BINOP_SUBSCRIPT
:
2740 case UNOP_LOGICAL_NOT
:
2756 case OP_INTERNALVAR
:
2766 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2769 case STRUCTOP_STRUCT
:
2770 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2783 error (_("Unexpected operator during name resolution"));
2786 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2787 for (i
= 0; i
< nargs
; i
+= 1)
2788 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2792 /* Pass two: perform any resolution on principal operator. */
2799 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2801 struct ada_symbol_info
*candidates
;
2805 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2806 (exp
->elts
[pc
+ 2].symbol
),
2807 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2810 if (n_candidates
> 1)
2812 /* Types tend to get re-introduced locally, so if there
2813 are any local symbols that are not types, first filter
2816 for (j
= 0; j
< n_candidates
; j
+= 1)
2817 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2822 case LOC_REGPARM_ADDR
:
2830 if (j
< n_candidates
)
2833 while (j
< n_candidates
)
2835 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2837 candidates
[j
] = candidates
[n_candidates
- 1];
2846 if (n_candidates
== 0)
2847 error (_("No definition found for %s"),
2848 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2849 else if (n_candidates
== 1)
2851 else if (deprocedure_p
2852 && !is_nonfunction (candidates
, n_candidates
))
2854 i
= ada_resolve_function
2855 (candidates
, n_candidates
, NULL
, 0,
2856 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2859 error (_("Could not find a match for %s"),
2860 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2864 printf_filtered (_("Multiple matches for %s\n"),
2865 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2866 user_select_syms (candidates
, n_candidates
, 1);
2870 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2871 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2872 if (innermost_block
== NULL
2873 || contained_in (candidates
[i
].block
, innermost_block
))
2874 innermost_block
= candidates
[i
].block
;
2878 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2881 replace_operator_with_call (expp
, pc
, 0, 0,
2882 exp
->elts
[pc
+ 2].symbol
,
2883 exp
->elts
[pc
+ 1].block
);
2890 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2891 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2893 struct ada_symbol_info
*candidates
;
2897 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2898 (exp
->elts
[pc
+ 5].symbol
),
2899 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2901 if (n_candidates
== 1)
2905 i
= ada_resolve_function
2906 (candidates
, n_candidates
,
2908 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2911 error (_("Could not find a match for %s"),
2912 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2915 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2916 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2917 if (innermost_block
== NULL
2918 || contained_in (candidates
[i
].block
, innermost_block
))
2919 innermost_block
= candidates
[i
].block
;
2930 case BINOP_BITWISE_AND
:
2931 case BINOP_BITWISE_IOR
:
2932 case BINOP_BITWISE_XOR
:
2934 case BINOP_NOTEQUAL
:
2942 case UNOP_LOGICAL_NOT
:
2944 if (possible_user_operator_p (op
, argvec
))
2946 struct ada_symbol_info
*candidates
;
2950 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2951 (struct block
*) NULL
, VAR_DOMAIN
,
2953 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2954 ada_decoded_op_name (op
), NULL
);
2958 replace_operator_with_call (expp
, pc
, nargs
, 1,
2959 candidates
[i
].sym
, candidates
[i
].block
);
2970 return evaluate_subexp_type (exp
, pos
);
2973 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2974 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2975 a non-pointer. A type of 'void' (which is never a valid expression type)
2976 by convention matches anything. */
2977 /* The term "match" here is rather loose. The match is heuristic and
2978 liberal. FIXME: TOO liberal, in fact. */
2981 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
2983 ftype
= ada_check_typedef (ftype
);
2984 atype
= ada_check_typedef (atype
);
2986 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
2987 ftype
= TYPE_TARGET_TYPE (ftype
);
2988 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
2989 atype
= TYPE_TARGET_TYPE (atype
);
2991 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
2992 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
2995 switch (TYPE_CODE (ftype
))
3000 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
3001 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
3002 TYPE_TARGET_TYPE (atype
), 0);
3005 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3007 case TYPE_CODE_ENUM
:
3008 case TYPE_CODE_RANGE
:
3009 switch (TYPE_CODE (atype
))
3012 case TYPE_CODE_ENUM
:
3013 case TYPE_CODE_RANGE
:
3019 case TYPE_CODE_ARRAY
:
3020 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3021 || ada_is_array_descriptor_type (atype
));
3023 case TYPE_CODE_STRUCT
:
3024 if (ada_is_array_descriptor_type (ftype
))
3025 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3026 || ada_is_array_descriptor_type (atype
));
3028 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3029 && !ada_is_array_descriptor_type (atype
));
3031 case TYPE_CODE_UNION
:
3033 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3037 /* Return non-zero if the formals of FUNC "sufficiently match" the
3038 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3039 may also be an enumeral, in which case it is treated as a 0-
3040 argument function. */
3043 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3046 struct type
*func_type
= SYMBOL_TYPE (func
);
3048 if (SYMBOL_CLASS (func
) == LOC_CONST
3049 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3050 return (n_actuals
== 0);
3051 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3054 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3057 for (i
= 0; i
< n_actuals
; i
+= 1)
3059 if (actuals
[i
] == NULL
)
3063 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3064 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3066 if (!ada_type_match (ftype
, atype
, 1))
3073 /* False iff function type FUNC_TYPE definitely does not produce a value
3074 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3075 FUNC_TYPE is not a valid function type with a non-null return type
3076 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3079 return_match (struct type
*func_type
, struct type
*context_type
)
3081 struct type
*return_type
;
3083 if (func_type
== NULL
)
3086 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3087 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3089 return_type
= base_type (func_type
);
3090 if (return_type
== NULL
)
3093 context_type
= base_type (context_type
);
3095 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3096 return context_type
== NULL
|| return_type
== context_type
;
3097 else if (context_type
== NULL
)
3098 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3100 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3104 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3105 function (if any) that matches the types of the NARGS arguments in
3106 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3107 that returns that type, then eliminate matches that don't. If
3108 CONTEXT_TYPE is void and there is at least one match that does not
3109 return void, eliminate all matches that do.
3111 Asks the user if there is more than one match remaining. Returns -1
3112 if there is no such symbol or none is selected. NAME is used
3113 solely for messages. May re-arrange and modify SYMS in
3114 the process; the index returned is for the modified vector. */
3117 ada_resolve_function (struct ada_symbol_info syms
[],
3118 int nsyms
, struct value
**args
, int nargs
,
3119 const char *name
, struct type
*context_type
)
3122 int m
; /* Number of hits */
3123 struct type
*fallback
;
3124 struct type
*return_type
;
3126 return_type
= context_type
;
3127 if (context_type
== NULL
)
3128 fallback
= builtin_type_void
;
3135 for (k
= 0; k
< nsyms
; k
+= 1)
3137 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3139 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3140 && return_match (type
, return_type
))
3146 if (m
> 0 || return_type
== fallback
)
3149 return_type
= fallback
;
3156 printf_filtered (_("Multiple matches for %s\n"), name
);
3157 user_select_syms (syms
, m
, 1);
3163 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3164 in a listing of choices during disambiguation (see sort_choices, below).
3165 The idea is that overloadings of a subprogram name from the
3166 same package should sort in their source order. We settle for ordering
3167 such symbols by their trailing number (__N or $N). */
3170 encoded_ordered_before (char *N0
, char *N1
)
3174 else if (N0
== NULL
)
3179 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3181 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3183 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3184 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3188 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3191 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3193 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3194 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3196 return (strcmp (N0
, N1
) < 0);
3200 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3204 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3207 for (i
= 1; i
< nsyms
; i
+= 1)
3209 struct ada_symbol_info sym
= syms
[i
];
3212 for (j
= i
- 1; j
>= 0; j
-= 1)
3214 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3215 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3217 syms
[j
+ 1] = syms
[j
];
3223 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3224 by asking the user (if necessary), returning the number selected,
3225 and setting the first elements of SYMS items. Error if no symbols
3228 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3229 to be re-integrated one of these days. */
3232 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3235 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3237 int first_choice
= (max_results
== 1) ? 1 : 2;
3238 const char *select_mode
= multiple_symbols_select_mode ();
3240 if (max_results
< 1)
3241 error (_("Request to select 0 symbols!"));
3245 if (select_mode
== multiple_symbols_cancel
)
3247 canceled because the command is ambiguous\n\
3248 See set/show multiple-symbol."));
3250 /* If select_mode is "all", then return all possible symbols.
3251 Only do that if more than one symbol can be selected, of course.
3252 Otherwise, display the menu as usual. */
3253 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3256 printf_unfiltered (_("[0] cancel\n"));
3257 if (max_results
> 1)
3258 printf_unfiltered (_("[1] all\n"));
3260 sort_choices (syms
, nsyms
);
3262 for (i
= 0; i
< nsyms
; i
+= 1)
3264 if (syms
[i
].sym
== NULL
)
3267 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3269 struct symtab_and_line sal
=
3270 find_function_start_sal (syms
[i
].sym
, 1);
3271 if (sal
.symtab
== NULL
)
3272 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3274 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3277 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3278 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3279 sal
.symtab
->filename
, sal
.line
);
3285 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3286 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3287 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3288 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3290 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3291 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3293 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3294 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3295 else if (is_enumeral
3296 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3298 printf_unfiltered (("[%d] "), i
+ first_choice
);
3299 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3301 printf_unfiltered (_("'(%s) (enumeral)\n"),
3302 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3304 else if (symtab
!= NULL
)
3305 printf_unfiltered (is_enumeral
3306 ? _("[%d] %s in %s (enumeral)\n")
3307 : _("[%d] %s at %s:?\n"),
3309 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3312 printf_unfiltered (is_enumeral
3313 ? _("[%d] %s (enumeral)\n")
3314 : _("[%d] %s at ?\n"),
3316 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3320 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3323 for (i
= 0; i
< n_chosen
; i
+= 1)
3324 syms
[i
] = syms
[chosen
[i
]];
3329 /* Read and validate a set of numeric choices from the user in the
3330 range 0 .. N_CHOICES-1. Place the results in increasing
3331 order in CHOICES[0 .. N-1], and return N.
3333 The user types choices as a sequence of numbers on one line
3334 separated by blanks, encoding them as follows:
3336 + A choice of 0 means to cancel the selection, throwing an error.
3337 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3338 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3340 The user is not allowed to choose more than MAX_RESULTS values.
3342 ANNOTATION_SUFFIX, if present, is used to annotate the input
3343 prompts (for use with the -f switch). */
3346 get_selections (int *choices
, int n_choices
, int max_results
,
3347 int is_all_choice
, char *annotation_suffix
)
3352 int first_choice
= is_all_choice
? 2 : 1;
3354 prompt
= getenv ("PS2");
3358 args
= command_line_input (prompt
, 0, annotation_suffix
);
3361 error_no_arg (_("one or more choice numbers"));
3365 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3366 order, as given in args. Choices are validated. */
3372 while (isspace (*args
))
3374 if (*args
== '\0' && n_chosen
== 0)
3375 error_no_arg (_("one or more choice numbers"));
3376 else if (*args
== '\0')
3379 choice
= strtol (args
, &args2
, 10);
3380 if (args
== args2
|| choice
< 0
3381 || choice
> n_choices
+ first_choice
- 1)
3382 error (_("Argument must be choice number"));
3386 error (_("cancelled"));
3388 if (choice
< first_choice
)
3390 n_chosen
= n_choices
;
3391 for (j
= 0; j
< n_choices
; j
+= 1)
3395 choice
-= first_choice
;
3397 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3401 if (j
< 0 || choice
!= choices
[j
])
3404 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3405 choices
[k
+ 1] = choices
[k
];
3406 choices
[j
+ 1] = choice
;
3411 if (n_chosen
> max_results
)
3412 error (_("Select no more than %d of the above"), max_results
);
3417 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3418 on the function identified by SYM and BLOCK, and taking NARGS
3419 arguments. Update *EXPP as needed to hold more space. */
3422 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3423 int oplen
, struct symbol
*sym
,
3424 struct block
*block
)
3426 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3427 symbol, -oplen for operator being replaced). */
3428 struct expression
*newexp
= (struct expression
*)
3429 xmalloc (sizeof (struct expression
)
3430 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3431 struct expression
*exp
= *expp
;
3433 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3434 newexp
->language_defn
= exp
->language_defn
;
3435 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3436 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3437 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3439 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3440 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3442 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3443 newexp
->elts
[pc
+ 4].block
= block
;
3444 newexp
->elts
[pc
+ 5].symbol
= sym
;
3450 /* Type-class predicates */
3452 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3456 numeric_type_p (struct type
*type
)
3462 switch (TYPE_CODE (type
))
3467 case TYPE_CODE_RANGE
:
3468 return (type
== TYPE_TARGET_TYPE (type
)
3469 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3476 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3479 integer_type_p (struct type
*type
)
3485 switch (TYPE_CODE (type
))
3489 case TYPE_CODE_RANGE
:
3490 return (type
== TYPE_TARGET_TYPE (type
)
3491 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3498 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3501 scalar_type_p (struct type
*type
)
3507 switch (TYPE_CODE (type
))
3510 case TYPE_CODE_RANGE
:
3511 case TYPE_CODE_ENUM
:
3520 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3523 discrete_type_p (struct type
*type
)
3529 switch (TYPE_CODE (type
))
3532 case TYPE_CODE_RANGE
:
3533 case TYPE_CODE_ENUM
:
3541 /* Returns non-zero if OP with operands in the vector ARGS could be
3542 a user-defined function. Errs on the side of pre-defined operators
3543 (i.e., result 0). */
3546 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3548 struct type
*type0
=
3549 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3550 struct type
*type1
=
3551 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3565 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3569 case BINOP_BITWISE_AND
:
3570 case BINOP_BITWISE_IOR
:
3571 case BINOP_BITWISE_XOR
:
3572 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3575 case BINOP_NOTEQUAL
:
3580 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3583 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3586 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3590 case UNOP_LOGICAL_NOT
:
3592 return (!numeric_type_p (type0
));
3601 1. In the following, we assume that a renaming type's name may
3602 have an ___XD suffix. It would be nice if this went away at some
3604 2. We handle both the (old) purely type-based representation of
3605 renamings and the (new) variable-based encoding. At some point,
3606 it is devoutly to be hoped that the former goes away
3607 (FIXME: hilfinger-2007-07-09).
3608 3. Subprogram renamings are not implemented, although the XRS
3609 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3611 /* If SYM encodes a renaming,
3613 <renaming> renames <renamed entity>,
3615 sets *LEN to the length of the renamed entity's name,
3616 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3617 the string describing the subcomponent selected from the renamed
3618 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3619 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3620 are undefined). Otherwise, returns a value indicating the category
3621 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3622 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3623 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3624 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3625 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3626 may be NULL, in which case they are not assigned.
3628 [Currently, however, GCC does not generate subprogram renamings.] */
3630 enum ada_renaming_category
3631 ada_parse_renaming (struct symbol
*sym
,
3632 const char **renamed_entity
, int *len
,
3633 const char **renaming_expr
)
3635 enum ada_renaming_category kind
;
3640 return ADA_NOT_RENAMING
;
3641 switch (SYMBOL_CLASS (sym
))
3644 return ADA_NOT_RENAMING
;
3646 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3647 renamed_entity
, len
, renaming_expr
);
3651 case LOC_OPTIMIZED_OUT
:
3652 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3654 return ADA_NOT_RENAMING
;
3658 kind
= ADA_OBJECT_RENAMING
;
3662 kind
= ADA_EXCEPTION_RENAMING
;
3666 kind
= ADA_PACKAGE_RENAMING
;
3670 kind
= ADA_SUBPROGRAM_RENAMING
;
3674 return ADA_NOT_RENAMING
;
3678 if (renamed_entity
!= NULL
)
3679 *renamed_entity
= info
;
3680 suffix
= strstr (info
, "___XE");
3681 if (suffix
== NULL
|| suffix
== info
)
3682 return ADA_NOT_RENAMING
;
3684 *len
= strlen (info
) - strlen (suffix
);
3686 if (renaming_expr
!= NULL
)
3687 *renaming_expr
= suffix
;
3691 /* Assuming TYPE encodes a renaming according to the old encoding in
3692 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3693 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3694 ADA_NOT_RENAMING otherwise. */
3695 static enum ada_renaming_category
3696 parse_old_style_renaming (struct type
*type
,
3697 const char **renamed_entity
, int *len
,
3698 const char **renaming_expr
)
3700 enum ada_renaming_category kind
;
3705 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3706 || TYPE_NFIELDS (type
) != 1)
3707 return ADA_NOT_RENAMING
;
3709 name
= type_name_no_tag (type
);
3711 return ADA_NOT_RENAMING
;
3713 name
= strstr (name
, "___XR");
3715 return ADA_NOT_RENAMING
;
3720 kind
= ADA_OBJECT_RENAMING
;
3723 kind
= ADA_EXCEPTION_RENAMING
;
3726 kind
= ADA_PACKAGE_RENAMING
;
3729 kind
= ADA_SUBPROGRAM_RENAMING
;
3732 return ADA_NOT_RENAMING
;
3735 info
= TYPE_FIELD_NAME (type
, 0);
3737 return ADA_NOT_RENAMING
;
3738 if (renamed_entity
!= NULL
)
3739 *renamed_entity
= info
;
3740 suffix
= strstr (info
, "___XE");
3741 if (renaming_expr
!= NULL
)
3742 *renaming_expr
= suffix
+ 5;
3743 if (suffix
== NULL
|| suffix
== info
)
3744 return ADA_NOT_RENAMING
;
3746 *len
= suffix
- info
;
3752 /* Evaluation: Function Calls */
3754 /* Return an lvalue containing the value VAL. This is the identity on
3755 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3756 on the stack, using and updating *SP as the stack pointer, and
3757 returning an lvalue whose value_address points to the copy. */
3759 static struct value
*
3760 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3762 if (! VALUE_LVAL (val
))
3764 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3766 /* The following is taken from the structure-return code in
3767 call_function_by_hand. FIXME: Therefore, some refactoring seems
3769 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3771 /* Stack grows downward. Align SP and value_address (val) after
3772 reserving sufficient space. */
3774 if (gdbarch_frame_align_p (current_gdbarch
))
3775 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3776 set_value_address (val
, *sp
);
3780 /* Stack grows upward. Align the frame, allocate space, and
3781 then again, re-align the frame. */
3782 if (gdbarch_frame_align_p (current_gdbarch
))
3783 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3784 set_value_address (val
, *sp
);
3786 if (gdbarch_frame_align_p (current_gdbarch
))
3787 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3789 VALUE_LVAL (val
) = lval_memory
;
3791 write_memory (value_address (val
), value_contents_raw (val
), len
);
3797 /* Return the value ACTUAL, converted to be an appropriate value for a
3798 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3799 allocating any necessary descriptors (fat pointers), or copies of
3800 values not residing in memory, updating it as needed. */
3803 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3806 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3807 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3808 struct type
*formal_target
=
3809 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3810 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3811 struct type
*actual_target
=
3812 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3813 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3815 if (ada_is_array_descriptor_type (formal_target
)
3816 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3817 return make_array_descriptor (formal_type
, actual
, sp
);
3818 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3819 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3821 struct value
*result
;
3822 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3823 && ada_is_array_descriptor_type (actual_target
))
3824 result
= desc_data (actual
);
3825 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3827 if (VALUE_LVAL (actual
) != lval_memory
)
3830 actual_type
= ada_check_typedef (value_type (actual
));
3831 val
= allocate_value (actual_type
);
3832 memcpy ((char *) value_contents_raw (val
),
3833 (char *) value_contents (actual
),
3834 TYPE_LENGTH (actual_type
));
3835 actual
= ensure_lval (val
, sp
);
3837 result
= value_addr (actual
);
3841 return value_cast_pointers (formal_type
, result
);
3843 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3844 return ada_value_ind (actual
);
3850 /* Push a descriptor of type TYPE for array value ARR on the stack at
3851 *SP, updating *SP to reflect the new descriptor. Return either
3852 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3853 to-descriptor type rather than a descriptor type), a struct value *
3854 representing a pointer to this descriptor. */
3856 static struct value
*
3857 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3859 struct type
*bounds_type
= desc_bounds_type (type
);
3860 struct type
*desc_type
= desc_base_type (type
);
3861 struct value
*descriptor
= allocate_value (desc_type
);
3862 struct value
*bounds
= allocate_value (bounds_type
);
3865 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3867 modify_general_field (value_contents_writeable (bounds
),
3868 value_as_long (ada_array_bound (arr
, i
, 0)),
3869 desc_bound_bitpos (bounds_type
, i
, 0),
3870 desc_bound_bitsize (bounds_type
, i
, 0));
3871 modify_general_field (value_contents_writeable (bounds
),
3872 value_as_long (ada_array_bound (arr
, i
, 1)),
3873 desc_bound_bitpos (bounds_type
, i
, 1),
3874 desc_bound_bitsize (bounds_type
, i
, 1));
3877 bounds
= ensure_lval (bounds
, sp
);
3879 modify_general_field (value_contents_writeable (descriptor
),
3880 value_address (ensure_lval (arr
, sp
)),
3881 fat_pntr_data_bitpos (desc_type
),
3882 fat_pntr_data_bitsize (desc_type
));
3884 modify_general_field (value_contents_writeable (descriptor
),
3885 value_address (bounds
),
3886 fat_pntr_bounds_bitpos (desc_type
),
3887 fat_pntr_bounds_bitsize (desc_type
));
3889 descriptor
= ensure_lval (descriptor
, sp
);
3891 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3892 return value_addr (descriptor
);
3897 /* Dummy definitions for an experimental caching module that is not
3898 * used in the public sources. */
3901 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3902 struct symbol
**sym
, struct block
**block
)
3908 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3909 struct block
*block
)
3915 /* Return the result of a standard (literal, C-like) lookup of NAME in
3916 given DOMAIN, visible from lexical block BLOCK. */
3918 static struct symbol
*
3919 standard_lookup (const char *name
, const struct block
*block
,
3924 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3926 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3927 cache_symbol (name
, domain
, sym
, block_found
);
3932 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3933 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3934 since they contend in overloading in the same way. */
3936 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3940 for (i
= 0; i
< n
; i
+= 1)
3941 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3942 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3943 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3949 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3950 struct types. Otherwise, they may not. */
3953 equiv_types (struct type
*type0
, struct type
*type1
)
3957 if (type0
== NULL
|| type1
== NULL
3958 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3960 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3961 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3962 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3963 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3969 /* True iff SYM0 represents the same entity as SYM1, or one that is
3970 no more defined than that of SYM1. */
3973 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
3977 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
3978 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
3981 switch (SYMBOL_CLASS (sym0
))
3987 struct type
*type0
= SYMBOL_TYPE (sym0
);
3988 struct type
*type1
= SYMBOL_TYPE (sym1
);
3989 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
3990 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
3991 int len0
= strlen (name0
);
3993 TYPE_CODE (type0
) == TYPE_CODE (type1
)
3994 && (equiv_types (type0
, type1
)
3995 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
3996 && strncmp (name1
+ len0
, "___XV", 5) == 0));
3999 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
4000 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4006 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4007 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4010 add_defn_to_vec (struct obstack
*obstackp
,
4012 struct block
*block
)
4016 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4018 /* Do not try to complete stub types, as the debugger is probably
4019 already scanning all symbols matching a certain name at the
4020 time when this function is called. Trying to replace the stub
4021 type by its associated full type will cause us to restart a scan
4022 which may lead to an infinite recursion. Instead, the client
4023 collecting the matching symbols will end up collecting several
4024 matches, with at least one of them complete. It can then filter
4025 out the stub ones if needed. */
4027 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4029 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4031 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4033 prevDefns
[i
].sym
= sym
;
4034 prevDefns
[i
].block
= block
;
4040 struct ada_symbol_info info
;
4044 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4048 /* Number of ada_symbol_info structures currently collected in
4049 current vector in *OBSTACKP. */
4052 num_defns_collected (struct obstack
*obstackp
)
4054 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4057 /* Vector of ada_symbol_info structures currently collected in current
4058 vector in *OBSTACKP. If FINISH, close off the vector and return
4059 its final address. */
4061 static struct ada_symbol_info
*
4062 defns_collected (struct obstack
*obstackp
, int finish
)
4065 return obstack_finish (obstackp
);
4067 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4070 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4071 Check the global symbols if GLOBAL, the static symbols if not.
4072 Do wild-card match if WILD. */
4074 static struct partial_symbol
*
4075 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4076 int global
, domain_enum
namespace, int wild
)
4078 struct partial_symbol
**start
;
4079 int name_len
= strlen (name
);
4080 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4089 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4090 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4094 for (i
= 0; i
< length
; i
+= 1)
4096 struct partial_symbol
*psym
= start
[i
];
4098 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4099 SYMBOL_DOMAIN (psym
), namespace)
4100 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4114 int M
= (U
+ i
) >> 1;
4115 struct partial_symbol
*psym
= start
[M
];
4116 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4118 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4120 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4131 struct partial_symbol
*psym
= start
[i
];
4133 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4134 SYMBOL_DOMAIN (psym
), namespace))
4136 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4144 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4158 int M
= (U
+ i
) >> 1;
4159 struct partial_symbol
*psym
= start
[M
];
4160 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4162 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4164 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4175 struct partial_symbol
*psym
= start
[i
];
4177 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4178 SYMBOL_DOMAIN (psym
), namespace))
4182 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4185 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4187 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4197 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4207 /* Return a minimal symbol matching NAME according to Ada decoding
4208 rules. Returns NULL if there is no such minimal symbol. Names
4209 prefixed with "standard__" are handled specially: "standard__" is
4210 first stripped off, and only static and global symbols are searched. */
4212 struct minimal_symbol
*
4213 ada_lookup_simple_minsym (const char *name
)
4215 struct objfile
*objfile
;
4216 struct minimal_symbol
*msymbol
;
4219 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4221 name
+= sizeof ("standard__") - 1;
4225 wild_match
= (strstr (name
, "__") == NULL
);
4227 ALL_MSYMBOLS (objfile
, msymbol
)
4229 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4230 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4237 /* For all subprograms that statically enclose the subprogram of the
4238 selected frame, add symbols matching identifier NAME in DOMAIN
4239 and their blocks to the list of data in OBSTACKP, as for
4240 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4244 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4245 const char *name
, domain_enum
namespace,
4250 /* True if TYPE is definitely an artificial type supplied to a symbol
4251 for which no debugging information was given in the symbol file. */
4254 is_nondebugging_type (struct type
*type
)
4256 char *name
= ada_type_name (type
);
4257 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4260 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4261 duplicate other symbols in the list (The only case I know of where
4262 this happens is when object files containing stabs-in-ecoff are
4263 linked with files containing ordinary ecoff debugging symbols (or no
4264 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4265 Returns the number of items in the modified list. */
4268 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4277 /* If two symbols have the same name and one of them is a stub type,
4278 the get rid of the stub. */
4280 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4281 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4283 for (j
= 0; j
< nsyms
; j
++)
4286 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4287 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4288 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4289 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4294 /* Two symbols with the same name, same class and same address
4295 should be identical. */
4297 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4298 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4299 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4301 for (j
= 0; j
< nsyms
; j
+= 1)
4304 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4305 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4306 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4307 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4308 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4309 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4316 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4317 syms
[j
- 1] = syms
[j
];
4326 /* Given a type that corresponds to a renaming entity, use the type name
4327 to extract the scope (package name or function name, fully qualified,
4328 and following the GNAT encoding convention) where this renaming has been
4329 defined. The string returned needs to be deallocated after use. */
4332 xget_renaming_scope (struct type
*renaming_type
)
4334 /* The renaming types adhere to the following convention:
4335 <scope>__<rename>___<XR extension>.
4336 So, to extract the scope, we search for the "___XR" extension,
4337 and then backtrack until we find the first "__". */
4339 const char *name
= type_name_no_tag (renaming_type
);
4340 char *suffix
= strstr (name
, "___XR");
4345 /* Now, backtrack a bit until we find the first "__". Start looking
4346 at suffix - 3, as the <rename> part is at least one character long. */
4348 for (last
= suffix
- 3; last
> name
; last
--)
4349 if (last
[0] == '_' && last
[1] == '_')
4352 /* Make a copy of scope and return it. */
4354 scope_len
= last
- name
;
4355 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4357 strncpy (scope
, name
, scope_len
);
4358 scope
[scope_len
] = '\0';
4363 /* Return nonzero if NAME corresponds to a package name. */
4366 is_package_name (const char *name
)
4368 /* Here, We take advantage of the fact that no symbols are generated
4369 for packages, while symbols are generated for each function.
4370 So the condition for NAME represent a package becomes equivalent
4371 to NAME not existing in our list of symbols. There is only one
4372 small complication with library-level functions (see below). */
4376 /* If it is a function that has not been defined at library level,
4377 then we should be able to look it up in the symbols. */
4378 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4381 /* Library-level function names start with "_ada_". See if function
4382 "_ada_" followed by NAME can be found. */
4384 /* Do a quick check that NAME does not contain "__", since library-level
4385 functions names cannot contain "__" in them. */
4386 if (strstr (name
, "__") != NULL
)
4389 fun_name
= xstrprintf ("_ada_%s", name
);
4391 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4394 /* Return nonzero if SYM corresponds to a renaming entity that is
4395 not visible from FUNCTION_NAME. */
4398 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4402 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4405 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4407 make_cleanup (xfree
, scope
);
4409 /* If the rename has been defined in a package, then it is visible. */
4410 if (is_package_name (scope
))
4413 /* Check that the rename is in the current function scope by checking
4414 that its name starts with SCOPE. */
4416 /* If the function name starts with "_ada_", it means that it is
4417 a library-level function. Strip this prefix before doing the
4418 comparison, as the encoding for the renaming does not contain
4420 if (strncmp (function_name
, "_ada_", 5) == 0)
4423 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4426 /* Remove entries from SYMS that corresponds to a renaming entity that
4427 is not visible from the function associated with CURRENT_BLOCK or
4428 that is superfluous due to the presence of more specific renaming
4429 information. Places surviving symbols in the initial entries of
4430 SYMS and returns the number of surviving symbols.
4433 First, in cases where an object renaming is implemented as a
4434 reference variable, GNAT may produce both the actual reference
4435 variable and the renaming encoding. In this case, we discard the
4438 Second, GNAT emits a type following a specified encoding for each renaming
4439 entity. Unfortunately, STABS currently does not support the definition
4440 of types that are local to a given lexical block, so all renamings types
4441 are emitted at library level. As a consequence, if an application
4442 contains two renaming entities using the same name, and a user tries to
4443 print the value of one of these entities, the result of the ada symbol
4444 lookup will also contain the wrong renaming type.
4446 This function partially covers for this limitation by attempting to
4447 remove from the SYMS list renaming symbols that should be visible
4448 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4449 method with the current information available. The implementation
4450 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4452 - When the user tries to print a rename in a function while there
4453 is another rename entity defined in a package: Normally, the
4454 rename in the function has precedence over the rename in the
4455 package, so the latter should be removed from the list. This is
4456 currently not the case.
4458 - This function will incorrectly remove valid renames if
4459 the CURRENT_BLOCK corresponds to a function which symbol name
4460 has been changed by an "Export" pragma. As a consequence,
4461 the user will be unable to print such rename entities. */
4464 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4465 int nsyms
, const struct block
*current_block
)
4467 struct symbol
*current_function
;
4468 char *current_function_name
;
4470 int is_new_style_renaming
;
4472 /* If there is both a renaming foo___XR... encoded as a variable and
4473 a simple variable foo in the same block, discard the latter.
4474 First, zero out such symbols, then compress. */
4475 is_new_style_renaming
= 0;
4476 for (i
= 0; i
< nsyms
; i
+= 1)
4478 struct symbol
*sym
= syms
[i
].sym
;
4479 struct block
*block
= syms
[i
].block
;
4483 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4485 name
= SYMBOL_LINKAGE_NAME (sym
);
4486 suffix
= strstr (name
, "___XR");
4490 int name_len
= suffix
- name
;
4492 is_new_style_renaming
= 1;
4493 for (j
= 0; j
< nsyms
; j
+= 1)
4494 if (i
!= j
&& syms
[j
].sym
!= NULL
4495 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4497 && block
== syms
[j
].block
)
4501 if (is_new_style_renaming
)
4505 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4506 if (syms
[j
].sym
!= NULL
)
4514 /* Extract the function name associated to CURRENT_BLOCK.
4515 Abort if unable to do so. */
4517 if (current_block
== NULL
)
4520 current_function
= block_linkage_function (current_block
);
4521 if (current_function
== NULL
)
4524 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4525 if (current_function_name
== NULL
)
4528 /* Check each of the symbols, and remove it from the list if it is
4529 a type corresponding to a renaming that is out of the scope of
4530 the current block. */
4535 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4536 == ADA_OBJECT_RENAMING
4537 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4540 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4541 syms
[j
- 1] = syms
[j
];
4551 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4552 whose name and domain match NAME and DOMAIN respectively.
4553 If no match was found, then extend the search to "enclosing"
4554 routines (in other words, if we're inside a nested function,
4555 search the symbols defined inside the enclosing functions).
4557 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4560 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4561 struct block
*block
, domain_enum domain
,
4564 int block_depth
= 0;
4566 while (block
!= NULL
)
4569 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4571 /* If we found a non-function match, assume that's the one. */
4572 if (is_nonfunction (defns_collected (obstackp
, 0),
4573 num_defns_collected (obstackp
)))
4576 block
= BLOCK_SUPERBLOCK (block
);
4579 /* If no luck so far, try to find NAME as a local symbol in some lexically
4580 enclosing subprogram. */
4581 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4582 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4585 /* Add to OBSTACKP all non-local symbols whose name and domain match
4586 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4587 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4590 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4591 domain_enum domain
, int global
,
4594 struct objfile
*objfile
;
4595 struct partial_symtab
*ps
;
4597 ALL_PSYMTABS (objfile
, ps
)
4601 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4603 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4604 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4606 if (s
== NULL
|| !s
->primary
)
4608 ada_add_block_symbols (obstackp
,
4609 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4610 name
, domain
, objfile
, wild_match
);
4615 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4616 scope and in global scopes, returning the number of matches. Sets
4617 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4618 indicating the symbols found and the blocks and symbol tables (if
4619 any) in which they were found. This vector are transient---good only to
4620 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4621 symbol match within the nest of blocks whose innermost member is BLOCK0,
4622 is the one match returned (no other matches in that or
4623 enclosing blocks is returned). If there are any matches in or
4624 surrounding BLOCK0, then these alone are returned. Otherwise, the
4625 search extends to global and file-scope (static) symbol tables.
4626 Names prefixed with "standard__" are handled specially: "standard__"
4627 is first stripped off, and only static and global symbols are searched. */
4630 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4631 domain_enum
namespace,
4632 struct ada_symbol_info
**results
)
4635 struct block
*block
;
4641 obstack_free (&symbol_list_obstack
, NULL
);
4642 obstack_init (&symbol_list_obstack
);
4646 /* Search specified block and its superiors. */
4648 wild_match
= (strstr (name0
, "__") == NULL
);
4650 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4651 needed, but adding const will
4652 have a cascade effect. */
4654 /* Special case: If the user specifies a symbol name inside package
4655 Standard, do a non-wild matching of the symbol name without
4656 the "standard__" prefix. This was primarily introduced in order
4657 to allow the user to specifically access the standard exceptions
4658 using, for instance, Standard.Constraint_Error when Constraint_Error
4659 is ambiguous (due to the user defining its own Constraint_Error
4660 entity inside its program). */
4661 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4665 name
= name0
+ sizeof ("standard__") - 1;
4668 /* Check the non-global symbols. If we have ANY match, then we're done. */
4670 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4672 if (num_defns_collected (&symbol_list_obstack
) > 0)
4675 /* No non-global symbols found. Check our cache to see if we have
4676 already performed this search before. If we have, then return
4680 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4683 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4687 /* Search symbols from all global blocks. */
4689 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4692 /* Now add symbols from all per-file blocks if we've gotten no hits
4693 (not strictly correct, but perhaps better than an error). */
4695 if (num_defns_collected (&symbol_list_obstack
) == 0)
4696 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4700 ndefns
= num_defns_collected (&symbol_list_obstack
);
4701 *results
= defns_collected (&symbol_list_obstack
, 1);
4703 ndefns
= remove_extra_symbols (*results
, ndefns
);
4706 cache_symbol (name0
, namespace, NULL
, NULL
);
4708 if (ndefns
== 1 && cacheIfUnique
)
4709 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4711 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4717 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4718 domain_enum
namespace, struct block
**block_found
)
4720 struct ada_symbol_info
*candidates
;
4723 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4725 if (n_candidates
== 0)
4728 if (block_found
!= NULL
)
4729 *block_found
= candidates
[0].block
;
4731 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4734 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4735 scope and in global scopes, or NULL if none. NAME is folded and
4736 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4737 choosing the first symbol if there are multiple choices.
4738 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4739 table in which the symbol was found (in both cases, these
4740 assignments occur only if the pointers are non-null). */
4742 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4743 domain_enum
namespace, int *is_a_field_of_this
)
4745 if (is_a_field_of_this
!= NULL
)
4746 *is_a_field_of_this
= 0;
4749 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4750 block0
, namespace, NULL
);
4753 static struct symbol
*
4754 ada_lookup_symbol_nonlocal (const char *name
,
4755 const char *linkage_name
,
4756 const struct block
*block
,
4757 const domain_enum domain
)
4759 if (linkage_name
== NULL
)
4760 linkage_name
= name
;
4761 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4766 /* True iff STR is a possible encoded suffix of a normal Ada name
4767 that is to be ignored for matching purposes. Suffixes of parallel
4768 names (e.g., XVE) are not included here. Currently, the possible suffixes
4769 are given by any of the regular expressions:
4771 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4772 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4773 _E[0-9]+[bs]$ [protected object entry suffixes]
4774 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4776 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4777 match is performed. This sequence is used to differentiate homonyms,
4778 is an optional part of a valid name suffix. */
4781 is_name_suffix (const char *str
)
4784 const char *matching
;
4785 const int len
= strlen (str
);
4787 /* Skip optional leading __[0-9]+. */
4789 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4792 while (isdigit (str
[0]))
4798 if (str
[0] == '.' || str
[0] == '$')
4801 while (isdigit (matching
[0]))
4803 if (matching
[0] == '\0')
4809 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4812 while (isdigit (matching
[0]))
4814 if (matching
[0] == '\0')
4819 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4820 with a N at the end. Unfortunately, the compiler uses the same
4821 convention for other internal types it creates. So treating
4822 all entity names that end with an "N" as a name suffix causes
4823 some regressions. For instance, consider the case of an enumerated
4824 type. To support the 'Image attribute, it creates an array whose
4826 Having a single character like this as a suffix carrying some
4827 information is a bit risky. Perhaps we should change the encoding
4828 to be something like "_N" instead. In the meantime, do not do
4829 the following check. */
4830 /* Protected Object Subprograms */
4831 if (len
== 1 && str
[0] == 'N')
4836 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4839 while (isdigit (matching
[0]))
4841 if ((matching
[0] == 'b' || matching
[0] == 's')
4842 && matching
[1] == '\0')
4846 /* ??? We should not modify STR directly, as we are doing below. This
4847 is fine in this case, but may become problematic later if we find
4848 that this alternative did not work, and want to try matching
4849 another one from the begining of STR. Since we modified it, we
4850 won't be able to find the begining of the string anymore! */
4854 while (str
[0] != '_' && str
[0] != '\0')
4856 if (str
[0] != 'n' && str
[0] != 'b')
4862 if (str
[0] == '\000')
4867 if (str
[1] != '_' || str
[2] == '\000')
4871 if (strcmp (str
+ 3, "JM") == 0)
4873 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4874 the LJM suffix in favor of the JM one. But we will
4875 still accept LJM as a valid suffix for a reasonable
4876 amount of time, just to allow ourselves to debug programs
4877 compiled using an older version of GNAT. */
4878 if (strcmp (str
+ 3, "LJM") == 0)
4882 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4883 || str
[4] == 'U' || str
[4] == 'P')
4885 if (str
[4] == 'R' && str
[5] != 'T')
4889 if (!isdigit (str
[2]))
4891 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4892 if (!isdigit (str
[k
]) && str
[k
] != '_')
4896 if (str
[0] == '$' && isdigit (str
[1]))
4898 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4899 if (!isdigit (str
[k
]) && str
[k
] != '_')
4906 /* Return non-zero if the string starting at NAME and ending before
4907 NAME_END contains no capital letters. */
4910 is_valid_name_for_wild_match (const char *name0
)
4912 const char *decoded_name
= ada_decode (name0
);
4915 /* If the decoded name starts with an angle bracket, it means that
4916 NAME0 does not follow the GNAT encoding format. It should then
4917 not be allowed as a possible wild match. */
4918 if (decoded_name
[0] == '<')
4921 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4922 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4928 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4929 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4930 informational suffixes of NAME (i.e., for which is_name_suffix is
4934 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4941 match
= strstr (start
, patn0
);
4946 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4947 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4948 && is_name_suffix (match
+ patn_len
))
4949 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
4954 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4955 vector *defn_symbols, updating the list of symbols in OBSTACKP
4956 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4957 OBJFILE is the section containing BLOCK.
4958 SYMTAB is recorded with each symbol added. */
4961 ada_add_block_symbols (struct obstack
*obstackp
,
4962 struct block
*block
, const char *name
,
4963 domain_enum domain
, struct objfile
*objfile
,
4966 struct dict_iterator iter
;
4967 int name_len
= strlen (name
);
4968 /* A matching argument symbol, if any. */
4969 struct symbol
*arg_sym
;
4970 /* Set true when we find a matching non-argument symbol. */
4979 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4981 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4982 SYMBOL_DOMAIN (sym
), domain
)
4983 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
4985 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4987 else if (SYMBOL_IS_ARGUMENT (sym
))
4992 add_defn_to_vec (obstackp
,
4993 fixup_symbol_section (sym
, objfile
),
5001 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5003 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5004 SYMBOL_DOMAIN (sym
), domain
))
5006 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5008 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5010 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5012 if (SYMBOL_IS_ARGUMENT (sym
))
5017 add_defn_to_vec (obstackp
,
5018 fixup_symbol_section (sym
, objfile
),
5027 if (!found_sym
&& arg_sym
!= NULL
)
5029 add_defn_to_vec (obstackp
,
5030 fixup_symbol_section (arg_sym
, objfile
),
5039 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5041 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5042 SYMBOL_DOMAIN (sym
), domain
))
5046 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5049 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5051 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5056 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5058 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5060 if (SYMBOL_IS_ARGUMENT (sym
))
5065 add_defn_to_vec (obstackp
,
5066 fixup_symbol_section (sym
, objfile
),
5074 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5075 They aren't parameters, right? */
5076 if (!found_sym
&& arg_sym
!= NULL
)
5078 add_defn_to_vec (obstackp
,
5079 fixup_symbol_section (arg_sym
, objfile
),
5086 /* Symbol Completion */
5088 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5089 name in a form that's appropriate for the completion. The result
5090 does not need to be deallocated, but is only good until the next call.
5092 TEXT_LEN is equal to the length of TEXT.
5093 Perform a wild match if WILD_MATCH is set.
5094 ENCODED should be set if TEXT represents the start of a symbol name
5095 in its encoded form. */
5098 symbol_completion_match (const char *sym_name
,
5099 const char *text
, int text_len
,
5100 int wild_match
, int encoded
)
5103 const int verbatim_match
= (text
[0] == '<');
5108 /* Strip the leading angle bracket. */
5113 /* First, test against the fully qualified name of the symbol. */
5115 if (strncmp (sym_name
, text
, text_len
) == 0)
5118 if (match
&& !encoded
)
5120 /* One needed check before declaring a positive match is to verify
5121 that iff we are doing a verbatim match, the decoded version
5122 of the symbol name starts with '<'. Otherwise, this symbol name
5123 is not a suitable completion. */
5124 const char *sym_name_copy
= sym_name
;
5125 int has_angle_bracket
;
5127 sym_name
= ada_decode (sym_name
);
5128 has_angle_bracket
= (sym_name
[0] == '<');
5129 match
= (has_angle_bracket
== verbatim_match
);
5130 sym_name
= sym_name_copy
;
5133 if (match
&& !verbatim_match
)
5135 /* When doing non-verbatim match, another check that needs to
5136 be done is to verify that the potentially matching symbol name
5137 does not include capital letters, because the ada-mode would
5138 not be able to understand these symbol names without the
5139 angle bracket notation. */
5142 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5147 /* Second: Try wild matching... */
5149 if (!match
&& wild_match
)
5151 /* Since we are doing wild matching, this means that TEXT
5152 may represent an unqualified symbol name. We therefore must
5153 also compare TEXT against the unqualified name of the symbol. */
5154 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5156 if (strncmp (sym_name
, text
, text_len
) == 0)
5160 /* Finally: If we found a mach, prepare the result to return. */
5166 sym_name
= add_angle_brackets (sym_name
);
5169 sym_name
= ada_decode (sym_name
);
5174 typedef char *char_ptr
;
5175 DEF_VEC_P (char_ptr
);
5177 /* A companion function to ada_make_symbol_completion_list().
5178 Check if SYM_NAME represents a symbol which name would be suitable
5179 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5180 it is appended at the end of the given string vector SV.
5182 ORIG_TEXT is the string original string from the user command
5183 that needs to be completed. WORD is the entire command on which
5184 completion should be performed. These two parameters are used to
5185 determine which part of the symbol name should be added to the
5187 if WILD_MATCH is set, then wild matching is performed.
5188 ENCODED should be set if TEXT represents a symbol name in its
5189 encoded formed (in which case the completion should also be
5193 symbol_completion_add (VEC(char_ptr
) **sv
,
5194 const char *sym_name
,
5195 const char *text
, int text_len
,
5196 const char *orig_text
, const char *word
,
5197 int wild_match
, int encoded
)
5199 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5200 wild_match
, encoded
);
5206 /* We found a match, so add the appropriate completion to the given
5209 if (word
== orig_text
)
5211 completion
= xmalloc (strlen (match
) + 5);
5212 strcpy (completion
, match
);
5214 else if (word
> orig_text
)
5216 /* Return some portion of sym_name. */
5217 completion
= xmalloc (strlen (match
) + 5);
5218 strcpy (completion
, match
+ (word
- orig_text
));
5222 /* Return some of ORIG_TEXT plus sym_name. */
5223 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5224 strncpy (completion
, word
, orig_text
- word
);
5225 completion
[orig_text
- word
] = '\0';
5226 strcat (completion
, match
);
5229 VEC_safe_push (char_ptr
, *sv
, completion
);
5232 /* Return a list of possible symbol names completing TEXT0. The list
5233 is NULL terminated. WORD is the entire command on which completion
5237 ada_make_symbol_completion_list (char *text0
, char *word
)
5243 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5246 struct partial_symtab
*ps
;
5247 struct minimal_symbol
*msymbol
;
5248 struct objfile
*objfile
;
5249 struct block
*b
, *surrounding_static_block
= 0;
5251 struct dict_iterator iter
;
5253 if (text0
[0] == '<')
5255 text
= xstrdup (text0
);
5256 make_cleanup (xfree
, text
);
5257 text_len
= strlen (text
);
5263 text
= xstrdup (ada_encode (text0
));
5264 make_cleanup (xfree
, text
);
5265 text_len
= strlen (text
);
5266 for (i
= 0; i
< text_len
; i
++)
5267 text
[i
] = tolower (text
[i
]);
5269 encoded
= (strstr (text0
, "__") != NULL
);
5270 /* If the name contains a ".", then the user is entering a fully
5271 qualified entity name, and the match must not be done in wild
5272 mode. Similarly, if the user wants to complete what looks like
5273 an encoded name, the match must not be done in wild mode. */
5274 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5277 /* First, look at the partial symtab symbols. */
5278 ALL_PSYMTABS (objfile
, ps
)
5280 struct partial_symbol
**psym
;
5282 /* If the psymtab's been read in we'll get it when we search
5283 through the blockvector. */
5287 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5288 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5289 + ps
->n_global_syms
); psym
++)
5292 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5293 text
, text_len
, text0
, word
,
5294 wild_match
, encoded
);
5297 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5298 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5299 + ps
->n_static_syms
); psym
++)
5302 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5303 text
, text_len
, text0
, word
,
5304 wild_match
, encoded
);
5308 /* At this point scan through the misc symbol vectors and add each
5309 symbol you find to the list. Eventually we want to ignore
5310 anything that isn't a text symbol (everything else will be
5311 handled by the psymtab code above). */
5313 ALL_MSYMBOLS (objfile
, msymbol
)
5316 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5317 text
, text_len
, text0
, word
, wild_match
, encoded
);
5320 /* Search upwards from currently selected frame (so that we can
5321 complete on local vars. */
5323 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5325 if (!BLOCK_SUPERBLOCK (b
))
5326 surrounding_static_block
= b
; /* For elmin of dups */
5328 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5330 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5331 text
, text_len
, text0
, word
,
5332 wild_match
, encoded
);
5336 /* Go through the symtabs and check the externs and statics for
5337 symbols which match. */
5339 ALL_SYMTABS (objfile
, s
)
5342 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5343 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5345 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5346 text
, text_len
, text0
, word
,
5347 wild_match
, encoded
);
5351 ALL_SYMTABS (objfile
, s
)
5354 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5355 /* Don't do this block twice. */
5356 if (b
== surrounding_static_block
)
5358 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5360 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5361 text
, text_len
, text0
, word
,
5362 wild_match
, encoded
);
5366 /* Append the closing NULL entry. */
5367 VEC_safe_push (char_ptr
, completions
, NULL
);
5369 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5370 return the copy. It's unfortunate that we have to make a copy
5371 of an array that we're about to destroy, but there is nothing much
5372 we can do about it. Fortunately, it's typically not a very large
5375 const size_t completions_size
=
5376 VEC_length (char_ptr
, completions
) * sizeof (char *);
5377 char **result
= malloc (completions_size
);
5379 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5381 VEC_free (char_ptr
, completions
);
5388 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5389 for tagged types. */
5392 ada_is_dispatch_table_ptr_type (struct type
*type
)
5396 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5399 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5403 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5406 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5407 to be invisible to users. */
5410 ada_is_ignored_field (struct type
*type
, int field_num
)
5412 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5415 /* Check the name of that field. */
5417 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5419 /* Anonymous field names should not be printed.
5420 brobecker/2007-02-20: I don't think this can actually happen
5421 but we don't want to print the value of annonymous fields anyway. */
5425 /* A field named "_parent" is internally generated by GNAT for
5426 tagged types, and should not be printed either. */
5427 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5431 /* If this is the dispatch table of a tagged type, then ignore. */
5432 if (ada_is_tagged_type (type
, 1)
5433 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5436 /* Not a special field, so it should not be ignored. */
5440 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5441 pointer or reference type whose ultimate target has a tag field. */
5444 ada_is_tagged_type (struct type
*type
, int refok
)
5446 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5449 /* True iff TYPE represents the type of X'Tag */
5452 ada_is_tag_type (struct type
*type
)
5454 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5458 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5459 return (name
!= NULL
5460 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5464 /* The type of the tag on VAL. */
5467 ada_tag_type (struct value
*val
)
5469 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5472 /* The value of the tag on VAL. */
5475 ada_value_tag (struct value
*val
)
5477 return ada_value_struct_elt (val
, "_tag", 0);
5480 /* The value of the tag on the object of type TYPE whose contents are
5481 saved at VALADDR, if it is non-null, or is at memory address
5484 static struct value
*
5485 value_tag_from_contents_and_address (struct type
*type
,
5486 const gdb_byte
*valaddr
,
5489 int tag_byte_offset
, dummy1
, dummy2
;
5490 struct type
*tag_type
;
5491 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5494 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5496 : valaddr
+ tag_byte_offset
);
5497 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5499 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5504 static struct type
*
5505 type_from_tag (struct value
*tag
)
5507 const char *type_name
= ada_tag_name (tag
);
5508 if (type_name
!= NULL
)
5509 return ada_find_any_type (ada_encode (type_name
));
5520 static int ada_tag_name_1 (void *);
5521 static int ada_tag_name_2 (struct tag_args
*);
5523 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5524 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5525 The value stored in ARGS->name is valid until the next call to
5529 ada_tag_name_1 (void *args0
)
5531 struct tag_args
*args
= (struct tag_args
*) args0
;
5532 static char name
[1024];
5536 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5538 return ada_tag_name_2 (args
);
5539 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5542 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5543 for (p
= name
; *p
!= '\0'; p
+= 1)
5550 /* Utility function for ada_tag_name_1 that tries the second
5551 representation for the dispatch table (in which there is no
5552 explicit 'tsd' field in the referent of the tag pointer, and instead
5553 the tsd pointer is stored just before the dispatch table. */
5556 ada_tag_name_2 (struct tag_args
*args
)
5558 struct type
*info_type
;
5559 static char name
[1024];
5561 struct value
*val
, *valp
;
5564 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5565 if (info_type
== NULL
)
5567 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5568 valp
= value_cast (info_type
, args
->tag
);
5571 val
= value_ind (value_ptradd (valp
,
5572 value_from_longest (builtin_type_int8
, -1)));
5575 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5578 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5579 for (p
= name
; *p
!= '\0'; p
+= 1)
5586 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5590 ada_tag_name (struct value
*tag
)
5592 struct tag_args args
;
5593 if (!ada_is_tag_type (value_type (tag
)))
5597 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5601 /* The parent type of TYPE, or NULL if none. */
5604 ada_parent_type (struct type
*type
)
5608 type
= ada_check_typedef (type
);
5610 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5613 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5614 if (ada_is_parent_field (type
, i
))
5616 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5618 /* If the _parent field is a pointer, then dereference it. */
5619 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5620 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5621 /* If there is a parallel XVS type, get the actual base type. */
5622 parent_type
= ada_get_base_type (parent_type
);
5624 return ada_check_typedef (parent_type
);
5630 /* True iff field number FIELD_NUM of structure type TYPE contains the
5631 parent-type (inherited) fields of a derived type. Assumes TYPE is
5632 a structure type with at least FIELD_NUM+1 fields. */
5635 ada_is_parent_field (struct type
*type
, int field_num
)
5637 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5638 return (name
!= NULL
5639 && (strncmp (name
, "PARENT", 6) == 0
5640 || strncmp (name
, "_parent", 7) == 0));
5643 /* True iff field number FIELD_NUM of structure type TYPE is a
5644 transparent wrapper field (which should be silently traversed when doing
5645 field selection and flattened when printing). Assumes TYPE is a
5646 structure type with at least FIELD_NUM+1 fields. Such fields are always
5650 ada_is_wrapper_field (struct type
*type
, int field_num
)
5652 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5653 return (name
!= NULL
5654 && (strncmp (name
, "PARENT", 6) == 0
5655 || strcmp (name
, "REP") == 0
5656 || strncmp (name
, "_parent", 7) == 0
5657 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5660 /* True iff field number FIELD_NUM of structure or union type TYPE
5661 is a variant wrapper. Assumes TYPE is a structure type with at least
5662 FIELD_NUM+1 fields. */
5665 ada_is_variant_part (struct type
*type
, int field_num
)
5667 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5668 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5669 || (is_dynamic_field (type
, field_num
)
5670 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5671 == TYPE_CODE_UNION
)));
5674 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5675 whose discriminants are contained in the record type OUTER_TYPE,
5676 returns the type of the controlling discriminant for the variant. */
5679 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5681 char *name
= ada_variant_discrim_name (var_type
);
5683 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5685 return builtin_type_int32
;
5690 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5691 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5692 represents a 'when others' clause; otherwise 0. */
5695 ada_is_others_clause (struct type
*type
, int field_num
)
5697 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5698 return (name
!= NULL
&& name
[0] == 'O');
5701 /* Assuming that TYPE0 is the type of the variant part of a record,
5702 returns the name of the discriminant controlling the variant.
5703 The value is valid until the next call to ada_variant_discrim_name. */
5706 ada_variant_discrim_name (struct type
*type0
)
5708 static char *result
= NULL
;
5709 static size_t result_len
= 0;
5712 const char *discrim_end
;
5713 const char *discrim_start
;
5715 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5716 type
= TYPE_TARGET_TYPE (type0
);
5720 name
= ada_type_name (type
);
5722 if (name
== NULL
|| name
[0] == '\000')
5725 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5728 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5731 if (discrim_end
== name
)
5734 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5737 if (discrim_start
== name
+ 1)
5739 if ((discrim_start
> name
+ 3
5740 && strncmp (discrim_start
- 3, "___", 3) == 0)
5741 || discrim_start
[-1] == '.')
5745 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5746 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5747 result
[discrim_end
- discrim_start
] = '\0';
5751 /* Scan STR for a subtype-encoded number, beginning at position K.
5752 Put the position of the character just past the number scanned in
5753 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5754 Return 1 if there was a valid number at the given position, and 0
5755 otherwise. A "subtype-encoded" number consists of the absolute value
5756 in decimal, followed by the letter 'm' to indicate a negative number.
5757 Assumes 0m does not occur. */
5760 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5764 if (!isdigit (str
[k
]))
5767 /* Do it the hard way so as not to make any assumption about
5768 the relationship of unsigned long (%lu scan format code) and
5771 while (isdigit (str
[k
]))
5773 RU
= RU
* 10 + (str
[k
] - '0');
5780 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5786 /* NOTE on the above: Technically, C does not say what the results of
5787 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5788 number representable as a LONGEST (although either would probably work
5789 in most implementations). When RU>0, the locution in the then branch
5790 above is always equivalent to the negative of RU. */
5797 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5798 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5799 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5802 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5804 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5817 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5826 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5827 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5829 if (val
>= L
&& val
<= U
)
5841 /* FIXME: Lots of redundancy below. Try to consolidate. */
5843 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5844 ARG_TYPE, extract and return the value of one of its (non-static)
5845 fields. FIELDNO says which field. Differs from value_primitive_field
5846 only in that it can handle packed values of arbitrary type. */
5848 static struct value
*
5849 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5850 struct type
*arg_type
)
5854 arg_type
= ada_check_typedef (arg_type
);
5855 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5857 /* Handle packed fields. */
5859 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5861 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5862 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5864 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5865 offset
+ bit_pos
/ 8,
5866 bit_pos
% 8, bit_size
, type
);
5869 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5872 /* Find field with name NAME in object of type TYPE. If found,
5873 set the following for each argument that is non-null:
5874 - *FIELD_TYPE_P to the field's type;
5875 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5876 an object of that type;
5877 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5878 - *BIT_SIZE_P to its size in bits if the field is packed, and
5880 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5881 fields up to but not including the desired field, or by the total
5882 number of fields if not found. A NULL value of NAME never
5883 matches; the function just counts visible fields in this case.
5885 Returns 1 if found, 0 otherwise. */
5888 find_struct_field (char *name
, struct type
*type
, int offset
,
5889 struct type
**field_type_p
,
5890 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5895 type
= ada_check_typedef (type
);
5897 if (field_type_p
!= NULL
)
5898 *field_type_p
= NULL
;
5899 if (byte_offset_p
!= NULL
)
5901 if (bit_offset_p
!= NULL
)
5903 if (bit_size_p
!= NULL
)
5906 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5908 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5909 int fld_offset
= offset
+ bit_pos
/ 8;
5910 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5912 if (t_field_name
== NULL
)
5915 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5917 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5918 if (field_type_p
!= NULL
)
5919 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5920 if (byte_offset_p
!= NULL
)
5921 *byte_offset_p
= fld_offset
;
5922 if (bit_offset_p
!= NULL
)
5923 *bit_offset_p
= bit_pos
% 8;
5924 if (bit_size_p
!= NULL
)
5925 *bit_size_p
= bit_size
;
5928 else if (ada_is_wrapper_field (type
, i
))
5930 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5931 field_type_p
, byte_offset_p
, bit_offset_p
,
5932 bit_size_p
, index_p
))
5935 else if (ada_is_variant_part (type
, i
))
5937 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5940 struct type
*field_type
5941 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5943 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5945 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5947 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5948 field_type_p
, byte_offset_p
,
5949 bit_offset_p
, bit_size_p
, index_p
))
5953 else if (index_p
!= NULL
)
5959 /* Number of user-visible fields in record type TYPE. */
5962 num_visible_fields (struct type
*type
)
5966 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5970 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5971 and search in it assuming it has (class) type TYPE.
5972 If found, return value, else return NULL.
5974 Searches recursively through wrapper fields (e.g., '_parent'). */
5976 static struct value
*
5977 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5981 type
= ada_check_typedef (type
);
5983 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5985 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5987 if (t_field_name
== NULL
)
5990 else if (field_name_match (t_field_name
, name
))
5991 return ada_value_primitive_field (arg
, offset
, i
, type
);
5993 else if (ada_is_wrapper_field (type
, i
))
5995 struct value
*v
= /* Do not let indent join lines here. */
5996 ada_search_struct_field (name
, arg
,
5997 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5998 TYPE_FIELD_TYPE (type
, i
));
6003 else if (ada_is_variant_part (type
, i
))
6005 /* PNH: Do we ever get here? See find_struct_field. */
6007 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6008 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6010 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6012 struct value
*v
= ada_search_struct_field
/* Force line break. */
6014 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6015 TYPE_FIELD_TYPE (field_type
, j
));
6024 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6025 int, struct type
*);
6028 /* Return field #INDEX in ARG, where the index is that returned by
6029 * find_struct_field through its INDEX_P argument. Adjust the address
6030 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6031 * If found, return value, else return NULL. */
6033 static struct value
*
6034 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6037 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6041 /* Auxiliary function for ada_index_struct_field. Like
6042 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6045 static struct value
*
6046 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6050 type
= ada_check_typedef (type
);
6052 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6054 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6056 else if (ada_is_wrapper_field (type
, i
))
6058 struct value
*v
= /* Do not let indent join lines here. */
6059 ada_index_struct_field_1 (index_p
, arg
,
6060 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6061 TYPE_FIELD_TYPE (type
, i
));
6066 else if (ada_is_variant_part (type
, i
))
6068 /* PNH: Do we ever get here? See ada_search_struct_field,
6069 find_struct_field. */
6070 error (_("Cannot assign this kind of variant record"));
6072 else if (*index_p
== 0)
6073 return ada_value_primitive_field (arg
, offset
, i
, type
);
6080 /* Given ARG, a value of type (pointer or reference to a)*
6081 structure/union, extract the component named NAME from the ultimate
6082 target structure/union and return it as a value with its
6085 The routine searches for NAME among all members of the structure itself
6086 and (recursively) among all members of any wrapper members
6089 If NO_ERR, then simply return NULL in case of error, rather than
6093 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6095 struct type
*t
, *t1
;
6099 t1
= t
= ada_check_typedef (value_type (arg
));
6100 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6102 t1
= TYPE_TARGET_TYPE (t
);
6105 t1
= ada_check_typedef (t1
);
6106 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6108 arg
= coerce_ref (arg
);
6113 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6115 t1
= TYPE_TARGET_TYPE (t
);
6118 t1
= ada_check_typedef (t1
);
6119 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6121 arg
= value_ind (arg
);
6128 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6132 v
= ada_search_struct_field (name
, arg
, 0, t
);
6135 int bit_offset
, bit_size
, byte_offset
;
6136 struct type
*field_type
;
6139 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6140 address
= value_as_address (arg
);
6142 address
= unpack_pointer (t
, value_contents (arg
));
6144 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6145 if (find_struct_field (name
, t1
, 0,
6146 &field_type
, &byte_offset
, &bit_offset
,
6151 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6152 arg
= ada_coerce_ref (arg
);
6154 arg
= ada_value_ind (arg
);
6155 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6156 bit_offset
, bit_size
,
6160 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6164 if (v
!= NULL
|| no_err
)
6167 error (_("There is no member named %s."), name
);
6173 error (_("Attempt to extract a component of a value that is not a record."));
6176 /* Given a type TYPE, look up the type of the component of type named NAME.
6177 If DISPP is non-null, add its byte displacement from the beginning of a
6178 structure (pointed to by a value) of type TYPE to *DISPP (does not
6179 work for packed fields).
6181 Matches any field whose name has NAME as a prefix, possibly
6184 TYPE can be either a struct or union. If REFOK, TYPE may also
6185 be a (pointer or reference)+ to a struct or union, and the
6186 ultimate target type will be searched.
6188 Looks recursively into variant clauses and parent types.
6190 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6191 TYPE is not a type of the right kind. */
6193 static struct type
*
6194 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6195 int noerr
, int *dispp
)
6202 if (refok
&& type
!= NULL
)
6205 type
= ada_check_typedef (type
);
6206 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6207 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6209 type
= TYPE_TARGET_TYPE (type
);
6213 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6214 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6220 target_terminal_ours ();
6221 gdb_flush (gdb_stdout
);
6223 error (_("Type (null) is not a structure or union type"));
6226 /* XXX: type_sprint */
6227 fprintf_unfiltered (gdb_stderr
, _("Type "));
6228 type_print (type
, "", gdb_stderr
, -1);
6229 error (_(" is not a structure or union type"));
6234 type
= to_static_fixed_type (type
);
6236 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6238 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6242 if (t_field_name
== NULL
)
6245 else if (field_name_match (t_field_name
, name
))
6248 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6249 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6252 else if (ada_is_wrapper_field (type
, i
))
6255 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6260 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6265 else if (ada_is_variant_part (type
, i
))
6268 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6270 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6272 /* FIXME pnh 2008/01/26: We check for a field that is
6273 NOT wrapped in a struct, since the compiler sometimes
6274 generates these for unchecked variant types. Revisit
6275 if the compiler changes this practice. */
6276 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6278 if (v_field_name
!= NULL
6279 && field_name_match (v_field_name
, name
))
6280 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6282 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6288 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6299 target_terminal_ours ();
6300 gdb_flush (gdb_stdout
);
6303 /* XXX: type_sprint */
6304 fprintf_unfiltered (gdb_stderr
, _("Type "));
6305 type_print (type
, "", gdb_stderr
, -1);
6306 error (_(" has no component named <null>"));
6310 /* XXX: type_sprint */
6311 fprintf_unfiltered (gdb_stderr
, _("Type "));
6312 type_print (type
, "", gdb_stderr
, -1);
6313 error (_(" has no component named %s"), name
);
6320 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6321 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6322 represents an unchecked union (that is, the variant part of a
6323 record that is named in an Unchecked_Union pragma). */
6326 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6328 char *discrim_name
= ada_variant_discrim_name (var_type
);
6329 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6334 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6335 within a value of type OUTER_TYPE that is stored in GDB at
6336 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6337 numbering from 0) is applicable. Returns -1 if none are. */
6340 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6341 const gdb_byte
*outer_valaddr
)
6345 char *discrim_name
= ada_variant_discrim_name (var_type
);
6346 struct value
*outer
;
6347 struct value
*discrim
;
6348 LONGEST discrim_val
;
6350 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6351 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6352 if (discrim
== NULL
)
6354 discrim_val
= value_as_long (discrim
);
6357 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6359 if (ada_is_others_clause (var_type
, i
))
6361 else if (ada_in_variant (discrim_val
, var_type
, i
))
6365 return others_clause
;
6370 /* Dynamic-Sized Records */
6372 /* Strategy: The type ostensibly attached to a value with dynamic size
6373 (i.e., a size that is not statically recorded in the debugging
6374 data) does not accurately reflect the size or layout of the value.
6375 Our strategy is to convert these values to values with accurate,
6376 conventional types that are constructed on the fly. */
6378 /* There is a subtle and tricky problem here. In general, we cannot
6379 determine the size of dynamic records without its data. However,
6380 the 'struct value' data structure, which GDB uses to represent
6381 quantities in the inferior process (the target), requires the size
6382 of the type at the time of its allocation in order to reserve space
6383 for GDB's internal copy of the data. That's why the
6384 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6385 rather than struct value*s.
6387 However, GDB's internal history variables ($1, $2, etc.) are
6388 struct value*s containing internal copies of the data that are not, in
6389 general, the same as the data at their corresponding addresses in
6390 the target. Fortunately, the types we give to these values are all
6391 conventional, fixed-size types (as per the strategy described
6392 above), so that we don't usually have to perform the
6393 'to_fixed_xxx_type' conversions to look at their values.
6394 Unfortunately, there is one exception: if one of the internal
6395 history variables is an array whose elements are unconstrained
6396 records, then we will need to create distinct fixed types for each
6397 element selected. */
6399 /* The upshot of all of this is that many routines take a (type, host
6400 address, target address) triple as arguments to represent a value.
6401 The host address, if non-null, is supposed to contain an internal
6402 copy of the relevant data; otherwise, the program is to consult the
6403 target at the target address. */
6405 /* Assuming that VAL0 represents a pointer value, the result of
6406 dereferencing it. Differs from value_ind in its treatment of
6407 dynamic-sized types. */
6410 ada_value_ind (struct value
*val0
)
6412 struct value
*val
= unwrap_value (value_ind (val0
));
6413 return ada_to_fixed_value (val
);
6416 /* The value resulting from dereferencing any "reference to"
6417 qualifiers on VAL0. */
6419 static struct value
*
6420 ada_coerce_ref (struct value
*val0
)
6422 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6424 struct value
*val
= val0
;
6425 val
= coerce_ref (val
);
6426 val
= unwrap_value (val
);
6427 return ada_to_fixed_value (val
);
6433 /* Return OFF rounded upward if necessary to a multiple of
6434 ALIGNMENT (a power of 2). */
6437 align_value (unsigned int off
, unsigned int alignment
)
6439 return (off
+ alignment
- 1) & ~(alignment
- 1);
6442 /* Return the bit alignment required for field #F of template type TYPE. */
6445 field_alignment (struct type
*type
, int f
)
6447 const char *name
= TYPE_FIELD_NAME (type
, f
);
6451 /* The field name should never be null, unless the debugging information
6452 is somehow malformed. In this case, we assume the field does not
6453 require any alignment. */
6457 len
= strlen (name
);
6459 if (!isdigit (name
[len
- 1]))
6462 if (isdigit (name
[len
- 2]))
6463 align_offset
= len
- 2;
6465 align_offset
= len
- 1;
6467 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6468 return TARGET_CHAR_BIT
;
6470 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6473 /* Find a symbol named NAME. Ignores ambiguity. */
6476 ada_find_any_symbol (const char *name
)
6480 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6481 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6484 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6488 /* Find a type named NAME. Ignores ambiguity. This routine will look
6489 solely for types defined by debug info, it will not search the GDB
6493 ada_find_any_type (const char *name
)
6495 struct symbol
*sym
= ada_find_any_symbol (name
);
6498 return SYMBOL_TYPE (sym
);
6503 /* Given NAME and an associated BLOCK, search all symbols for
6504 NAME suffixed with "___XR", which is the ``renaming'' symbol
6505 associated to NAME. Return this symbol if found, return
6509 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6513 sym
= find_old_style_renaming_symbol (name
, block
);
6518 /* Not right yet. FIXME pnh 7/20/2007. */
6519 sym
= ada_find_any_symbol (name
);
6520 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6526 static struct symbol
*
6527 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6529 const struct symbol
*function_sym
= block_linkage_function (block
);
6532 if (function_sym
!= NULL
)
6534 /* If the symbol is defined inside a function, NAME is not fully
6535 qualified. This means we need to prepend the function name
6536 as well as adding the ``___XR'' suffix to build the name of
6537 the associated renaming symbol. */
6538 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6539 /* Function names sometimes contain suffixes used
6540 for instance to qualify nested subprograms. When building
6541 the XR type name, we need to make sure that this suffix is
6542 not included. So do not include any suffix in the function
6543 name length below. */
6544 const int function_name_len
= ada_name_prefix_len (function_name
);
6545 const int rename_len
= function_name_len
+ 2 /* "__" */
6546 + strlen (name
) + 6 /* "___XR\0" */ ;
6548 /* Strip the suffix if necessary. */
6549 function_name
[function_name_len
] = '\0';
6551 /* Library-level functions are a special case, as GNAT adds
6552 a ``_ada_'' prefix to the function name to avoid namespace
6553 pollution. However, the renaming symbols themselves do not
6554 have this prefix, so we need to skip this prefix if present. */
6555 if (function_name_len
> 5 /* "_ada_" */
6556 && strstr (function_name
, "_ada_") == function_name
)
6557 function_name
= function_name
+ 5;
6559 rename
= (char *) alloca (rename_len
* sizeof (char));
6560 xsnprintf (rename
, rename_len
* sizeof (char), "%s__%s___XR",
6561 function_name
, name
);
6565 const int rename_len
= strlen (name
) + 6;
6566 rename
= (char *) alloca (rename_len
* sizeof (char));
6567 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6570 return ada_find_any_symbol (rename
);
6573 /* Because of GNAT encoding conventions, several GDB symbols may match a
6574 given type name. If the type denoted by TYPE0 is to be preferred to
6575 that of TYPE1 for purposes of type printing, return non-zero;
6576 otherwise return 0. */
6579 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6583 else if (type0
== NULL
)
6585 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6587 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6589 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6591 else if (ada_is_packed_array_type (type0
))
6593 else if (ada_is_array_descriptor_type (type0
)
6594 && !ada_is_array_descriptor_type (type1
))
6598 const char *type0_name
= type_name_no_tag (type0
);
6599 const char *type1_name
= type_name_no_tag (type1
);
6601 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6602 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6608 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6609 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6612 ada_type_name (struct type
*type
)
6616 else if (TYPE_NAME (type
) != NULL
)
6617 return TYPE_NAME (type
);
6619 return TYPE_TAG_NAME (type
);
6622 /* Find a parallel type to TYPE whose name is formed by appending
6623 SUFFIX to the name of TYPE. */
6626 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6629 static size_t name_len
= 0;
6631 char *typename
= ada_type_name (type
);
6633 if (typename
== NULL
)
6636 len
= strlen (typename
);
6638 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6640 strcpy (name
, typename
);
6641 strcpy (name
+ len
, suffix
);
6643 return ada_find_any_type (name
);
6647 /* If TYPE is a variable-size record type, return the corresponding template
6648 type describing its fields. Otherwise, return NULL. */
6650 static struct type
*
6651 dynamic_template_type (struct type
*type
)
6653 type
= ada_check_typedef (type
);
6655 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6656 || ada_type_name (type
) == NULL
)
6660 int len
= strlen (ada_type_name (type
));
6661 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6664 return ada_find_parallel_type (type
, "___XVE");
6668 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6669 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6672 is_dynamic_field (struct type
*templ_type
, int field_num
)
6674 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6676 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6677 && strstr (name
, "___XVL") != NULL
;
6680 /* The index of the variant field of TYPE, or -1 if TYPE does not
6681 represent a variant record type. */
6684 variant_field_index (struct type
*type
)
6688 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6691 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6693 if (ada_is_variant_part (type
, f
))
6699 /* A record type with no fields. */
6701 static struct type
*
6702 empty_record (struct objfile
*objfile
)
6704 struct type
*type
= alloc_type (objfile
);
6705 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6706 TYPE_NFIELDS (type
) = 0;
6707 TYPE_FIELDS (type
) = NULL
;
6708 INIT_CPLUS_SPECIFIC (type
);
6709 TYPE_NAME (type
) = "<empty>";
6710 TYPE_TAG_NAME (type
) = NULL
;
6711 TYPE_LENGTH (type
) = 0;
6715 /* An ordinary record type (with fixed-length fields) that describes
6716 the value of type TYPE at VALADDR or ADDRESS (see comments at
6717 the beginning of this section) VAL according to GNAT conventions.
6718 DVAL0 should describe the (portion of a) record that contains any
6719 necessary discriminants. It should be NULL if value_type (VAL) is
6720 an outer-level type (i.e., as opposed to a branch of a variant.) A
6721 variant field (unless unchecked) is replaced by a particular branch
6724 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6725 length are not statically known are discarded. As a consequence,
6726 VALADDR, ADDRESS and DVAL0 are ignored.
6728 NOTE: Limitations: For now, we assume that dynamic fields and
6729 variants occupy whole numbers of bytes. However, they need not be
6733 ada_template_to_fixed_record_type_1 (struct type
*type
,
6734 const gdb_byte
*valaddr
,
6735 CORE_ADDR address
, struct value
*dval0
,
6736 int keep_dynamic_fields
)
6738 struct value
*mark
= value_mark ();
6741 int nfields
, bit_len
;
6744 int fld_bit_len
, bit_incr
;
6747 /* Compute the number of fields in this record type that are going
6748 to be processed: unless keep_dynamic_fields, this includes only
6749 fields whose position and length are static will be processed. */
6750 if (keep_dynamic_fields
)
6751 nfields
= TYPE_NFIELDS (type
);
6755 while (nfields
< TYPE_NFIELDS (type
)
6756 && !ada_is_variant_part (type
, nfields
)
6757 && !is_dynamic_field (type
, nfields
))
6761 rtype
= alloc_type (TYPE_OBJFILE (type
));
6762 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6763 INIT_CPLUS_SPECIFIC (rtype
);
6764 TYPE_NFIELDS (rtype
) = nfields
;
6765 TYPE_FIELDS (rtype
) = (struct field
*)
6766 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6767 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6768 TYPE_NAME (rtype
) = ada_type_name (type
);
6769 TYPE_TAG_NAME (rtype
) = NULL
;
6770 TYPE_FIXED_INSTANCE (rtype
) = 1;
6776 for (f
= 0; f
< nfields
; f
+= 1)
6778 off
= align_value (off
, field_alignment (type
, f
))
6779 + TYPE_FIELD_BITPOS (type
, f
);
6780 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6781 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6783 if (ada_is_variant_part (type
, f
))
6786 fld_bit_len
= bit_incr
= 0;
6788 else if (is_dynamic_field (type
, f
))
6790 const gdb_byte
*field_valaddr
= valaddr
;
6791 CORE_ADDR field_address
= address
;
6792 struct type
*field_type
=
6793 TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
));
6797 /* rtype's length is computed based on the run-time
6798 value of discriminants. If the discriminants are not
6799 initialized, the type size may be completely bogus and
6800 GDB may fail to allocate a value for it. So check the
6801 size first before creating the value. */
6803 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6808 /* If the type referenced by this field is an aligner type, we need
6809 to unwrap that aligner type, because its size might not be set.
6810 Keeping the aligner type would cause us to compute the wrong
6811 size for this field, impacting the offset of the all the fields
6812 that follow this one. */
6813 if (ada_is_aligner_type (field_type
))
6815 long field_offset
= TYPE_FIELD_BITPOS (field_type
, f
);
6817 field_valaddr
= cond_offset_host (field_valaddr
, field_offset
);
6818 field_address
= cond_offset_target (field_address
, field_offset
);
6819 field_type
= ada_aligned_type (field_type
);
6822 field_valaddr
= cond_offset_host (field_valaddr
,
6823 off
/ TARGET_CHAR_BIT
);
6824 field_address
= cond_offset_target (field_address
,
6825 off
/ TARGET_CHAR_BIT
);
6827 /* Get the fixed type of the field. Note that, in this case,
6828 we do not want to get the real type out of the tag: if
6829 the current field is the parent part of a tagged record,
6830 we will get the tag of the object. Clearly wrong: the real
6831 type of the parent is not the real type of the child. We
6832 would end up in an infinite loop. */
6833 field_type
= ada_get_base_type (field_type
);
6834 field_type
= ada_to_fixed_type (field_type
, field_valaddr
,
6835 field_address
, dval
, 0);
6837 TYPE_FIELD_TYPE (rtype
, f
) = field_type
;
6838 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6839 bit_incr
= fld_bit_len
=
6840 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6844 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6845 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6846 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6847 bit_incr
= fld_bit_len
=
6848 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6850 bit_incr
= fld_bit_len
=
6851 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6853 if (off
+ fld_bit_len
> bit_len
)
6854 bit_len
= off
+ fld_bit_len
;
6856 TYPE_LENGTH (rtype
) =
6857 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6860 /* We handle the variant part, if any, at the end because of certain
6861 odd cases in which it is re-ordered so as NOT to be the last field of
6862 the record. This can happen in the presence of representation
6864 if (variant_field
>= 0)
6866 struct type
*branch_type
;
6868 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6871 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6876 to_fixed_variant_branch_type
6877 (TYPE_FIELD_TYPE (type
, variant_field
),
6878 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6879 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6880 if (branch_type
== NULL
)
6882 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6883 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6884 TYPE_NFIELDS (rtype
) -= 1;
6888 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6889 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6891 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6893 if (off
+ fld_bit_len
> bit_len
)
6894 bit_len
= off
+ fld_bit_len
;
6895 TYPE_LENGTH (rtype
) =
6896 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6900 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6901 should contain the alignment of that record, which should be a strictly
6902 positive value. If null or negative, then something is wrong, most
6903 probably in the debug info. In that case, we don't round up the size
6904 of the resulting type. If this record is not part of another structure,
6905 the current RTYPE length might be good enough for our purposes. */
6906 if (TYPE_LENGTH (type
) <= 0)
6908 if (TYPE_NAME (rtype
))
6909 warning (_("Invalid type size for `%s' detected: %d."),
6910 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6912 warning (_("Invalid type size for <unnamed> detected: %d."),
6913 TYPE_LENGTH (type
));
6917 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6918 TYPE_LENGTH (type
));
6921 value_free_to_mark (mark
);
6922 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6923 error (_("record type with dynamic size is larger than varsize-limit"));
6927 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6930 static struct type
*
6931 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6932 CORE_ADDR address
, struct value
*dval0
)
6934 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6938 /* An ordinary record type in which ___XVL-convention fields and
6939 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6940 static approximations, containing all possible fields. Uses
6941 no runtime values. Useless for use in values, but that's OK,
6942 since the results are used only for type determinations. Works on both
6943 structs and unions. Representation note: to save space, we memorize
6944 the result of this function in the TYPE_TARGET_TYPE of the
6947 static struct type
*
6948 template_to_static_fixed_type (struct type
*type0
)
6954 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6955 return TYPE_TARGET_TYPE (type0
);
6957 nfields
= TYPE_NFIELDS (type0
);
6960 for (f
= 0; f
< nfields
; f
+= 1)
6962 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6963 struct type
*new_type
;
6965 if (is_dynamic_field (type0
, f
))
6966 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6968 new_type
= static_unwrap_type (field_type
);
6969 if (type
== type0
&& new_type
!= field_type
)
6971 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6972 TYPE_CODE (type
) = TYPE_CODE (type0
);
6973 INIT_CPLUS_SPECIFIC (type
);
6974 TYPE_NFIELDS (type
) = nfields
;
6975 TYPE_FIELDS (type
) = (struct field
*)
6976 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6977 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6978 sizeof (struct field
) * nfields
);
6979 TYPE_NAME (type
) = ada_type_name (type0
);
6980 TYPE_TAG_NAME (type
) = NULL
;
6981 TYPE_FIXED_INSTANCE (type
) = 1;
6982 TYPE_LENGTH (type
) = 0;
6984 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6985 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6990 /* Given an object of type TYPE whose contents are at VALADDR and
6991 whose address in memory is ADDRESS, returns a revision of TYPE,
6992 which should be a non-dynamic-sized record, in which the variant
6993 part, if any, is replaced with the appropriate branch. Looks
6994 for discriminant values in DVAL0, which can be NULL if the record
6995 contains the necessary discriminant values. */
6997 static struct type
*
6998 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6999 CORE_ADDR address
, struct value
*dval0
)
7001 struct value
*mark
= value_mark ();
7004 struct type
*branch_type
;
7005 int nfields
= TYPE_NFIELDS (type
);
7006 int variant_field
= variant_field_index (type
);
7008 if (variant_field
== -1)
7012 dval
= value_from_contents_and_address (type
, valaddr
, address
);
7016 rtype
= alloc_type (TYPE_OBJFILE (type
));
7017 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
7018 INIT_CPLUS_SPECIFIC (rtype
);
7019 TYPE_NFIELDS (rtype
) = nfields
;
7020 TYPE_FIELDS (rtype
) =
7021 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
7022 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
7023 sizeof (struct field
) * nfields
);
7024 TYPE_NAME (rtype
) = ada_type_name (type
);
7025 TYPE_TAG_NAME (rtype
) = NULL
;
7026 TYPE_FIXED_INSTANCE (rtype
) = 1;
7027 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7029 branch_type
= to_fixed_variant_branch_type
7030 (TYPE_FIELD_TYPE (type
, variant_field
),
7031 cond_offset_host (valaddr
,
7032 TYPE_FIELD_BITPOS (type
, variant_field
)
7034 cond_offset_target (address
,
7035 TYPE_FIELD_BITPOS (type
, variant_field
)
7036 / TARGET_CHAR_BIT
), dval
);
7037 if (branch_type
== NULL
)
7040 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7041 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7042 TYPE_NFIELDS (rtype
) -= 1;
7046 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7047 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7048 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7049 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7051 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7053 value_free_to_mark (mark
);
7057 /* An ordinary record type (with fixed-length fields) that describes
7058 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7059 beginning of this section]. Any necessary discriminants' values
7060 should be in DVAL, a record value; it may be NULL if the object
7061 at ADDR itself contains any necessary discriminant values.
7062 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7063 values from the record are needed. Except in the case that DVAL,
7064 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7065 unchecked) is replaced by a particular branch of the variant.
7067 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7068 is questionable and may be removed. It can arise during the
7069 processing of an unconstrained-array-of-record type where all the
7070 variant branches have exactly the same size. This is because in
7071 such cases, the compiler does not bother to use the XVS convention
7072 when encoding the record. I am currently dubious of this
7073 shortcut and suspect the compiler should be altered. FIXME. */
7075 static struct type
*
7076 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7077 CORE_ADDR address
, struct value
*dval
)
7079 struct type
*templ_type
;
7081 if (TYPE_FIXED_INSTANCE (type0
))
7084 templ_type
= dynamic_template_type (type0
);
7086 if (templ_type
!= NULL
)
7087 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7088 else if (variant_field_index (type0
) >= 0)
7090 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7092 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7097 TYPE_FIXED_INSTANCE (type0
) = 1;
7103 /* An ordinary record type (with fixed-length fields) that describes
7104 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7105 union type. Any necessary discriminants' values should be in DVAL,
7106 a record value. That is, this routine selects the appropriate
7107 branch of the union at ADDR according to the discriminant value
7108 indicated in the union's type name. Returns VAR_TYPE0 itself if
7109 it represents a variant subject to a pragma Unchecked_Union. */
7111 static struct type
*
7112 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7113 CORE_ADDR address
, struct value
*dval
)
7116 struct type
*templ_type
;
7117 struct type
*var_type
;
7119 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7120 var_type
= TYPE_TARGET_TYPE (var_type0
);
7122 var_type
= var_type0
;
7124 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7126 if (templ_type
!= NULL
)
7127 var_type
= templ_type
;
7129 if (is_unchecked_variant (var_type
, value_type (dval
)))
7132 ada_which_variant_applies (var_type
,
7133 value_type (dval
), value_contents (dval
));
7136 return empty_record (TYPE_OBJFILE (var_type
));
7137 else if (is_dynamic_field (var_type
, which
))
7138 return to_fixed_record_type
7139 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7140 valaddr
, address
, dval
);
7141 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7143 to_fixed_record_type
7144 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7146 return TYPE_FIELD_TYPE (var_type
, which
);
7149 /* Assuming that TYPE0 is an array type describing the type of a value
7150 at ADDR, and that DVAL describes a record containing any
7151 discriminants used in TYPE0, returns a type for the value that
7152 contains no dynamic components (that is, no components whose sizes
7153 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7154 true, gives an error message if the resulting type's size is over
7157 static struct type
*
7158 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7161 struct type
*index_type_desc
;
7162 struct type
*result
;
7165 if (TYPE_FIXED_INSTANCE (type0
))
7168 packed_array_p
= ada_is_packed_array_type (type0
);
7170 type0
= decode_packed_array_type (type0
);
7172 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7173 if (index_type_desc
== NULL
)
7175 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7176 /* NOTE: elt_type---the fixed version of elt_type0---should never
7177 depend on the contents of the array in properly constructed
7179 /* Create a fixed version of the array element type.
7180 We're not providing the address of an element here,
7181 and thus the actual object value cannot be inspected to do
7182 the conversion. This should not be a problem, since arrays of
7183 unconstrained objects are not allowed. In particular, all
7184 the elements of an array of a tagged type should all be of
7185 the same type specified in the debugging info. No need to
7186 consult the object tag. */
7187 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7189 /* Make sure we always create a new array type when dealing with
7190 packed array types, since we're going to fix-up the array
7191 type length and element bitsize a little further down. */
7192 if (elt_type0
== elt_type
&& !packed_array_p
)
7195 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7196 elt_type
, TYPE_INDEX_TYPE (type0
));
7201 struct type
*elt_type0
;
7204 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7205 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7207 /* NOTE: result---the fixed version of elt_type0---should never
7208 depend on the contents of the array in properly constructed
7210 /* Create a fixed version of the array element type.
7211 We're not providing the address of an element here,
7212 and thus the actual object value cannot be inspected to do
7213 the conversion. This should not be a problem, since arrays of
7214 unconstrained objects are not allowed. In particular, all
7215 the elements of an array of a tagged type should all be of
7216 the same type specified in the debugging info. No need to
7217 consult the object tag. */
7219 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7220 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7222 struct type
*range_type
=
7223 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7224 dval
, TYPE_OBJFILE (type0
));
7225 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7226 result
, range_type
);
7228 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7229 error (_("array type with dynamic size is larger than varsize-limit"));
7234 /* So far, the resulting type has been created as if the original
7235 type was a regular (non-packed) array type. As a result, the
7236 bitsize of the array elements needs to be set again, and the array
7237 length needs to be recomputed based on that bitsize. */
7238 int len
= TYPE_LENGTH (result
) / TYPE_LENGTH (TYPE_TARGET_TYPE (result
));
7239 int elt_bitsize
= TYPE_FIELD_BITSIZE (type0
, 0);
7241 TYPE_FIELD_BITSIZE (result
, 0) = TYPE_FIELD_BITSIZE (type0
, 0);
7242 TYPE_LENGTH (result
) = len
* elt_bitsize
/ HOST_CHAR_BIT
;
7243 if (TYPE_LENGTH (result
) * HOST_CHAR_BIT
< len
* elt_bitsize
)
7244 TYPE_LENGTH (result
)++;
7247 TYPE_FIXED_INSTANCE (result
) = 1;
7252 /* A standard type (containing no dynamically sized components)
7253 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7254 DVAL describes a record containing any discriminants used in TYPE0,
7255 and may be NULL if there are none, or if the object of type TYPE at
7256 ADDRESS or in VALADDR contains these discriminants.
7258 If CHECK_TAG is not null, in the case of tagged types, this function
7259 attempts to locate the object's tag and use it to compute the actual
7260 type. However, when ADDRESS is null, we cannot use it to determine the
7261 location of the tag, and therefore compute the tagged type's actual type.
7262 So we return the tagged type without consulting the tag. */
7264 static struct type
*
7265 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7266 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7268 type
= ada_check_typedef (type
);
7269 switch (TYPE_CODE (type
))
7273 case TYPE_CODE_STRUCT
:
7275 struct type
*static_type
= to_static_fixed_type (type
);
7276 struct type
*fixed_record_type
=
7277 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7278 /* If STATIC_TYPE is a tagged type and we know the object's address,
7279 then we can determine its tag, and compute the object's actual
7280 type from there. Note that we have to use the fixed record
7281 type (the parent part of the record may have dynamic fields
7282 and the way the location of _tag is expressed may depend on
7285 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7287 struct type
*real_type
=
7288 type_from_tag (value_tag_from_contents_and_address
7292 if (real_type
!= NULL
)
7293 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7296 /* Check to see if there is a parallel ___XVZ variable.
7297 If there is, then it provides the actual size of our type. */
7298 else if (ada_type_name (fixed_record_type
) != NULL
)
7300 char *name
= ada_type_name (fixed_record_type
);
7301 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7305 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7306 size
= get_int_var_value (xvz_name
, &xvz_found
);
7307 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7309 fixed_record_type
= copy_type (fixed_record_type
);
7310 TYPE_LENGTH (fixed_record_type
) = size
;
7312 /* The FIXED_RECORD_TYPE may have be a stub. We have
7313 observed this when the debugging info is STABS, and
7314 apparently it is something that is hard to fix.
7316 In practice, we don't need the actual type definition
7317 at all, because the presence of the XVZ variable allows us
7318 to assume that there must be a XVS type as well, which we
7319 should be able to use later, when we need the actual type
7322 In the meantime, pretend that the "fixed" type we are
7323 returning is NOT a stub, because this can cause trouble
7324 when using this type to create new types targeting it.
7325 Indeed, the associated creation routines often check
7326 whether the target type is a stub and will try to replace
7327 it, thus using a type with the wrong size. This, in turn,
7328 might cause the new type to have the wrong size too.
7329 Consider the case of an array, for instance, where the size
7330 of the array is computed from the number of elements in
7331 our array multiplied by the size of its element. */
7332 TYPE_STUB (fixed_record_type
) = 0;
7335 return fixed_record_type
;
7337 case TYPE_CODE_ARRAY
:
7338 return to_fixed_array_type (type
, dval
, 1);
7339 case TYPE_CODE_UNION
:
7343 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7347 /* The same as ada_to_fixed_type_1, except that it preserves the type
7348 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7349 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7352 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7353 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7356 struct type
*fixed_type
=
7357 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7359 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7360 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7366 /* A standard (static-sized) type corresponding as well as possible to
7367 TYPE0, but based on no runtime data. */
7369 static struct type
*
7370 to_static_fixed_type (struct type
*type0
)
7377 if (TYPE_FIXED_INSTANCE (type0
))
7380 type0
= ada_check_typedef (type0
);
7382 switch (TYPE_CODE (type0
))
7386 case TYPE_CODE_STRUCT
:
7387 type
= dynamic_template_type (type0
);
7389 return template_to_static_fixed_type (type
);
7391 return template_to_static_fixed_type (type0
);
7392 case TYPE_CODE_UNION
:
7393 type
= ada_find_parallel_type (type0
, "___XVU");
7395 return template_to_static_fixed_type (type
);
7397 return template_to_static_fixed_type (type0
);
7401 /* A static approximation of TYPE with all type wrappers removed. */
7403 static struct type
*
7404 static_unwrap_type (struct type
*type
)
7406 if (ada_is_aligner_type (type
))
7408 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7409 if (ada_type_name (type1
) == NULL
)
7410 TYPE_NAME (type1
) = ada_type_name (type
);
7412 return static_unwrap_type (type1
);
7416 struct type
*raw_real_type
= ada_get_base_type (type
);
7417 if (raw_real_type
== type
)
7420 return to_static_fixed_type (raw_real_type
);
7424 /* In some cases, incomplete and private types require
7425 cross-references that are not resolved as records (for example,
7427 type FooP is access Foo;
7429 type Foo is array ...;
7430 ). In these cases, since there is no mechanism for producing
7431 cross-references to such types, we instead substitute for FooP a
7432 stub enumeration type that is nowhere resolved, and whose tag is
7433 the name of the actual type. Call these types "non-record stubs". */
7435 /* A type equivalent to TYPE that is not a non-record stub, if one
7436 exists, otherwise TYPE. */
7439 ada_check_typedef (struct type
*type
)
7444 CHECK_TYPEDEF (type
);
7445 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7446 || !TYPE_STUB (type
)
7447 || TYPE_TAG_NAME (type
) == NULL
)
7451 char *name
= TYPE_TAG_NAME (type
);
7452 struct type
*type1
= ada_find_any_type (name
);
7453 return (type1
== NULL
) ? type
: type1
;
7457 /* A value representing the data at VALADDR/ADDRESS as described by
7458 type TYPE0, but with a standard (static-sized) type that correctly
7459 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7460 type, then return VAL0 [this feature is simply to avoid redundant
7461 creation of struct values]. */
7463 static struct value
*
7464 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7467 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7468 if (type
== type0
&& val0
!= NULL
)
7471 return value_from_contents_and_address (type
, 0, address
);
7474 /* A value representing VAL, but with a standard (static-sized) type
7475 that correctly describes it. Does not necessarily create a new
7478 static struct value
*
7479 ada_to_fixed_value (struct value
*val
)
7481 return ada_to_fixed_value_create (value_type (val
),
7482 value_address (val
),
7486 /* A value representing VAL, but with a standard (static-sized) type
7487 chosen to approximate the real type of VAL as well as possible, but
7488 without consulting any runtime values. For Ada dynamic-sized
7489 types, therefore, the type of the result is likely to be inaccurate. */
7491 static struct value
*
7492 ada_to_static_fixed_value (struct value
*val
)
7495 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7496 if (type
== value_type (val
))
7499 return coerce_unspec_val_to_type (val
, type
);
7505 /* Table mapping attribute numbers to names.
7506 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7508 static const char *attribute_names
[] = {
7526 ada_attribute_name (enum exp_opcode n
)
7528 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7529 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7531 return attribute_names
[0];
7534 /* Evaluate the 'POS attribute applied to ARG. */
7537 pos_atr (struct value
*arg
)
7539 struct value
*val
= coerce_ref (arg
);
7540 struct type
*type
= value_type (val
);
7542 if (!discrete_type_p (type
))
7543 error (_("'POS only defined on discrete types"));
7545 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7548 LONGEST v
= value_as_long (val
);
7550 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7552 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7555 error (_("enumeration value is invalid: can't find 'POS"));
7558 return value_as_long (val
);
7561 static struct value
*
7562 value_pos_atr (struct type
*type
, struct value
*arg
)
7564 return value_from_longest (type
, pos_atr (arg
));
7567 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7569 static struct value
*
7570 value_val_atr (struct type
*type
, struct value
*arg
)
7572 if (!discrete_type_p (type
))
7573 error (_("'VAL only defined on discrete types"));
7574 if (!integer_type_p (value_type (arg
)))
7575 error (_("'VAL requires integral argument"));
7577 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7579 long pos
= value_as_long (arg
);
7580 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7581 error (_("argument to 'VAL out of range"));
7582 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7585 return value_from_longest (type
, value_as_long (arg
));
7591 /* True if TYPE appears to be an Ada character type.
7592 [At the moment, this is true only for Character and Wide_Character;
7593 It is a heuristic test that could stand improvement]. */
7596 ada_is_character_type (struct type
*type
)
7600 /* If the type code says it's a character, then assume it really is,
7601 and don't check any further. */
7602 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7605 /* Otherwise, assume it's a character type iff it is a discrete type
7606 with a known character type name. */
7607 name
= ada_type_name (type
);
7608 return (name
!= NULL
7609 && (TYPE_CODE (type
) == TYPE_CODE_INT
7610 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7611 && (strcmp (name
, "character") == 0
7612 || strcmp (name
, "wide_character") == 0
7613 || strcmp (name
, "wide_wide_character") == 0
7614 || strcmp (name
, "unsigned char") == 0));
7617 /* True if TYPE appears to be an Ada string type. */
7620 ada_is_string_type (struct type
*type
)
7622 type
= ada_check_typedef (type
);
7624 && TYPE_CODE (type
) != TYPE_CODE_PTR
7625 && (ada_is_simple_array_type (type
)
7626 || ada_is_array_descriptor_type (type
))
7627 && ada_array_arity (type
) == 1)
7629 struct type
*elttype
= ada_array_element_type (type
, 1);
7631 return ada_is_character_type (elttype
);
7638 /* True if TYPE is a struct type introduced by the compiler to force the
7639 alignment of a value. Such types have a single field with a
7640 distinctive name. */
7643 ada_is_aligner_type (struct type
*type
)
7645 type
= ada_check_typedef (type
);
7647 /* If we can find a parallel XVS type, then the XVS type should
7648 be used instead of this type. And hence, this is not an aligner
7650 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7653 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7654 && TYPE_NFIELDS (type
) == 1
7655 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7658 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7659 the parallel type. */
7662 ada_get_base_type (struct type
*raw_type
)
7664 struct type
*real_type_namer
;
7665 struct type
*raw_real_type
;
7667 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7670 if (ada_is_aligner_type (raw_type
))
7671 /* The encoding specifies that we should always use the aligner type.
7672 So, even if this aligner type has an associated XVS type, we should
7675 According to the compiler gurus, an XVS type parallel to an aligner
7676 type may exist because of a stabs limitation. In stabs, aligner
7677 types are empty because the field has a variable-sized type, and
7678 thus cannot actually be used as an aligner type. As a result,
7679 we need the associated parallel XVS type to decode the type.
7680 Since the policy in the compiler is to not change the internal
7681 representation based on the debugging info format, we sometimes
7682 end up having a redundant XVS type parallel to the aligner type. */
7685 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7686 if (real_type_namer
== NULL
7687 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7688 || TYPE_NFIELDS (real_type_namer
) != 1)
7691 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7692 if (raw_real_type
== NULL
)
7695 return raw_real_type
;
7698 /* The type of value designated by TYPE, with all aligners removed. */
7701 ada_aligned_type (struct type
*type
)
7703 if (ada_is_aligner_type (type
))
7704 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7706 return ada_get_base_type (type
);
7710 /* The address of the aligned value in an object at address VALADDR
7711 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7714 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7716 if (ada_is_aligner_type (type
))
7717 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7719 TYPE_FIELD_BITPOS (type
,
7720 0) / TARGET_CHAR_BIT
);
7727 /* The printed representation of an enumeration literal with encoded
7728 name NAME. The value is good to the next call of ada_enum_name. */
7730 ada_enum_name (const char *name
)
7732 static char *result
;
7733 static size_t result_len
= 0;
7736 /* First, unqualify the enumeration name:
7737 1. Search for the last '.' character. If we find one, then skip
7738 all the preceeding characters, the unqualified name starts
7739 right after that dot.
7740 2. Otherwise, we may be debugging on a target where the compiler
7741 translates dots into "__". Search forward for double underscores,
7742 but stop searching when we hit an overloading suffix, which is
7743 of the form "__" followed by digits. */
7745 tmp
= strrchr (name
, '.');
7750 while ((tmp
= strstr (name
, "__")) != NULL
)
7752 if (isdigit (tmp
[2]))
7762 if (name
[1] == 'U' || name
[1] == 'W')
7764 if (sscanf (name
+ 2, "%x", &v
) != 1)
7770 GROW_VECT (result
, result_len
, 16);
7771 if (isascii (v
) && isprint (v
))
7772 xsnprintf (result
, result_len
, "'%c'", v
);
7773 else if (name
[1] == 'U')
7774 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7776 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7782 tmp
= strstr (name
, "__");
7784 tmp
= strstr (name
, "$");
7787 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7788 strncpy (result
, name
, tmp
- name
);
7789 result
[tmp
- name
] = '\0';
7797 /* Evaluate the subexpression of EXP starting at *POS as for
7798 evaluate_type, updating *POS to point just past the evaluated
7801 static struct value
*
7802 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7804 return evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7807 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7810 static struct value
*
7811 unwrap_value (struct value
*val
)
7813 struct type
*type
= ada_check_typedef (value_type (val
));
7814 if (ada_is_aligner_type (type
))
7816 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7817 struct type
*val_type
= ada_check_typedef (value_type (v
));
7818 if (ada_type_name (val_type
) == NULL
)
7819 TYPE_NAME (val_type
) = ada_type_name (type
);
7821 return unwrap_value (v
);
7825 struct type
*raw_real_type
=
7826 ada_check_typedef (ada_get_base_type (type
));
7828 if (type
== raw_real_type
)
7832 coerce_unspec_val_to_type
7833 (val
, ada_to_fixed_type (raw_real_type
, 0,
7834 value_address (val
),
7839 static struct value
*
7840 cast_to_fixed (struct type
*type
, struct value
*arg
)
7844 if (type
== value_type (arg
))
7846 else if (ada_is_fixed_point_type (value_type (arg
)))
7847 val
= ada_float_to_fixed (type
,
7848 ada_fixed_to_float (value_type (arg
),
7849 value_as_long (arg
)));
7852 DOUBLEST argd
= value_as_double (arg
);
7853 val
= ada_float_to_fixed (type
, argd
);
7856 return value_from_longest (type
, val
);
7859 static struct value
*
7860 cast_from_fixed (struct type
*type
, struct value
*arg
)
7862 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7863 value_as_long (arg
));
7864 return value_from_double (type
, val
);
7867 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7868 return the converted value. */
7870 static struct value
*
7871 coerce_for_assign (struct type
*type
, struct value
*val
)
7873 struct type
*type2
= value_type (val
);
7877 type2
= ada_check_typedef (type2
);
7878 type
= ada_check_typedef (type
);
7880 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7881 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7883 val
= ada_value_ind (val
);
7884 type2
= value_type (val
);
7887 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7888 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7890 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7891 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7892 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7893 error (_("Incompatible types in assignment"));
7894 deprecated_set_value_type (val
, type
);
7899 static struct value
*
7900 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7903 struct type
*type1
, *type2
;
7906 arg1
= coerce_ref (arg1
);
7907 arg2
= coerce_ref (arg2
);
7908 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7909 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7911 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7912 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7913 return value_binop (arg1
, arg2
, op
);
7922 return value_binop (arg1
, arg2
, op
);
7925 v2
= value_as_long (arg2
);
7927 error (_("second operand of %s must not be zero."), op_string (op
));
7929 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7930 return value_binop (arg1
, arg2
, op
);
7932 v1
= value_as_long (arg1
);
7937 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7938 v
+= v
> 0 ? -1 : 1;
7946 /* Should not reach this point. */
7950 val
= allocate_value (type1
);
7951 store_unsigned_integer (value_contents_raw (val
),
7952 TYPE_LENGTH (value_type (val
)), v
);
7957 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7959 if (ada_is_direct_array_type (value_type (arg1
))
7960 || ada_is_direct_array_type (value_type (arg2
)))
7962 /* Automatically dereference any array reference before
7963 we attempt to perform the comparison. */
7964 arg1
= ada_coerce_ref (arg1
);
7965 arg2
= ada_coerce_ref (arg2
);
7967 arg1
= ada_coerce_to_simple_array (arg1
);
7968 arg2
= ada_coerce_to_simple_array (arg2
);
7969 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7970 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7971 error (_("Attempt to compare array with non-array"));
7972 /* FIXME: The following works only for types whose
7973 representations use all bits (no padding or undefined bits)
7974 and do not have user-defined equality. */
7976 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7977 && memcmp (value_contents (arg1
), value_contents (arg2
),
7978 TYPE_LENGTH (value_type (arg1
))) == 0;
7980 return value_equal (arg1
, arg2
);
7983 /* Total number of component associations in the aggregate starting at
7984 index PC in EXP. Assumes that index PC is the start of an
7988 num_component_specs (struct expression
*exp
, int pc
)
7991 m
= exp
->elts
[pc
+ 1].longconst
;
7994 for (i
= 0; i
< m
; i
+= 1)
7996 switch (exp
->elts
[pc
].opcode
)
8002 n
+= exp
->elts
[pc
+ 1].longconst
;
8005 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
8010 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
8011 component of LHS (a simple array or a record), updating *POS past
8012 the expression, assuming that LHS is contained in CONTAINER. Does
8013 not modify the inferior's memory, nor does it modify LHS (unless
8014 LHS == CONTAINER). */
8017 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
8018 struct expression
*exp
, int *pos
)
8020 struct value
*mark
= value_mark ();
8022 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
8024 struct value
*index_val
= value_from_longest (builtin_type_int32
, index
);
8025 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
8029 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
8030 elt
= ada_to_fixed_value (unwrap_value (elt
));
8033 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8034 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
8036 value_assign_to_component (container
, elt
,
8037 ada_evaluate_subexp (NULL
, exp
, pos
,
8040 value_free_to_mark (mark
);
8043 /* Assuming that LHS represents an lvalue having a record or array
8044 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
8045 of that aggregate's value to LHS, advancing *POS past the
8046 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
8047 lvalue containing LHS (possibly LHS itself). Does not modify
8048 the inferior's memory, nor does it modify the contents of
8049 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
8051 static struct value
*
8052 assign_aggregate (struct value
*container
,
8053 struct value
*lhs
, struct expression
*exp
,
8054 int *pos
, enum noside noside
)
8056 struct type
*lhs_type
;
8057 int n
= exp
->elts
[*pos
+1].longconst
;
8058 LONGEST low_index
, high_index
;
8061 int max_indices
, num_indices
;
8062 int is_array_aggregate
;
8064 struct value
*mark
= value_mark ();
8067 if (noside
!= EVAL_NORMAL
)
8070 for (i
= 0; i
< n
; i
+= 1)
8071 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8075 container
= ada_coerce_ref (container
);
8076 if (ada_is_direct_array_type (value_type (container
)))
8077 container
= ada_coerce_to_simple_array (container
);
8078 lhs
= ada_coerce_ref (lhs
);
8079 if (!deprecated_value_modifiable (lhs
))
8080 error (_("Left operand of assignment is not a modifiable lvalue."));
8082 lhs_type
= value_type (lhs
);
8083 if (ada_is_direct_array_type (lhs_type
))
8085 lhs
= ada_coerce_to_simple_array (lhs
);
8086 lhs_type
= value_type (lhs
);
8087 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8088 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8089 is_array_aggregate
= 1;
8091 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8094 high_index
= num_visible_fields (lhs_type
) - 1;
8095 is_array_aggregate
= 0;
8098 error (_("Left-hand side must be array or record."));
8100 num_specs
= num_component_specs (exp
, *pos
- 3);
8101 max_indices
= 4 * num_specs
+ 4;
8102 indices
= alloca (max_indices
* sizeof (indices
[0]));
8103 indices
[0] = indices
[1] = low_index
- 1;
8104 indices
[2] = indices
[3] = high_index
+ 1;
8107 for (i
= 0; i
< n
; i
+= 1)
8109 switch (exp
->elts
[*pos
].opcode
)
8112 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8113 &num_indices
, max_indices
,
8114 low_index
, high_index
);
8117 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8118 &num_indices
, max_indices
,
8119 low_index
, high_index
);
8123 error (_("Misplaced 'others' clause"));
8124 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8125 num_indices
, low_index
, high_index
);
8128 error (_("Internal error: bad aggregate clause"));
8135 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8136 construct at *POS, updating *POS past the construct, given that
8137 the positions are relative to lower bound LOW, where HIGH is the
8138 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8139 updating *NUM_INDICES as needed. CONTAINER is as for
8140 assign_aggregate. */
8142 aggregate_assign_positional (struct value
*container
,
8143 struct value
*lhs
, struct expression
*exp
,
8144 int *pos
, LONGEST
*indices
, int *num_indices
,
8145 int max_indices
, LONGEST low
, LONGEST high
)
8147 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8149 if (ind
- 1 == high
)
8150 warning (_("Extra components in aggregate ignored."));
8153 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8155 assign_component (container
, lhs
, ind
, exp
, pos
);
8158 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8161 /* Assign into the components of LHS indexed by the OP_CHOICES
8162 construct at *POS, updating *POS past the construct, given that
8163 the allowable indices are LOW..HIGH. Record the indices assigned
8164 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8165 needed. CONTAINER is as for assign_aggregate. */
8167 aggregate_assign_from_choices (struct value
*container
,
8168 struct value
*lhs
, struct expression
*exp
,
8169 int *pos
, LONGEST
*indices
, int *num_indices
,
8170 int max_indices
, LONGEST low
, LONGEST high
)
8173 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8174 int choice_pos
, expr_pc
;
8175 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8177 choice_pos
= *pos
+= 3;
8179 for (j
= 0; j
< n_choices
; j
+= 1)
8180 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8182 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8184 for (j
= 0; j
< n_choices
; j
+= 1)
8186 LONGEST lower
, upper
;
8187 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8188 if (op
== OP_DISCRETE_RANGE
)
8191 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8193 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8198 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8209 name
= &exp
->elts
[choice_pos
+ 2].string
;
8212 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8215 error (_("Invalid record component association."));
8217 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8219 if (! find_struct_field (name
, value_type (lhs
), 0,
8220 NULL
, NULL
, NULL
, NULL
, &ind
))
8221 error (_("Unknown component name: %s."), name
);
8222 lower
= upper
= ind
;
8225 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8226 error (_("Index in component association out of bounds."));
8228 add_component_interval (lower
, upper
, indices
, num_indices
,
8230 while (lower
<= upper
)
8234 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8240 /* Assign the value of the expression in the OP_OTHERS construct in
8241 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8242 have not been previously assigned. The index intervals already assigned
8243 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8244 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8246 aggregate_assign_others (struct value
*container
,
8247 struct value
*lhs
, struct expression
*exp
,
8248 int *pos
, LONGEST
*indices
, int num_indices
,
8249 LONGEST low
, LONGEST high
)
8252 int expr_pc
= *pos
+1;
8254 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8257 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8261 assign_component (container
, lhs
, ind
, exp
, &pos
);
8264 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8267 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8268 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8269 modifying *SIZE as needed. It is an error if *SIZE exceeds
8270 MAX_SIZE. The resulting intervals do not overlap. */
8272 add_component_interval (LONGEST low
, LONGEST high
,
8273 LONGEST
* indices
, int *size
, int max_size
)
8276 for (i
= 0; i
< *size
; i
+= 2) {
8277 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8280 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8281 if (high
< indices
[kh
])
8283 if (low
< indices
[i
])
8285 indices
[i
+ 1] = indices
[kh
- 1];
8286 if (high
> indices
[i
+ 1])
8287 indices
[i
+ 1] = high
;
8288 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8289 *size
-= kh
- i
- 2;
8292 else if (high
< indices
[i
])
8296 if (*size
== max_size
)
8297 error (_("Internal error: miscounted aggregate components."));
8299 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8300 indices
[j
] = indices
[j
- 2];
8302 indices
[i
+ 1] = high
;
8305 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8308 static struct value
*
8309 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8311 if (type
== ada_check_typedef (value_type (arg2
)))
8314 if (ada_is_fixed_point_type (type
))
8315 return (cast_to_fixed (type
, arg2
));
8317 if (ada_is_fixed_point_type (value_type (arg2
)))
8318 return cast_from_fixed (type
, arg2
);
8320 return value_cast (type
, arg2
);
8323 /* Evaluating Ada expressions, and printing their result.
8324 ------------------------------------------------------
8326 We usually evaluate an Ada expression in order to print its value.
8327 We also evaluate an expression in order to print its type, which
8328 happens during the EVAL_AVOID_SIDE_EFFECTS phase of the evaluation,
8329 but we'll focus mostly on the EVAL_NORMAL phase. In practice, the
8330 EVAL_AVOID_SIDE_EFFECTS phase allows us to simplify certain aspects of
8331 the evaluation compared to the EVAL_NORMAL, but is otherwise very
8334 Evaluating expressions is a little more complicated for Ada entities
8335 than it is for entities in languages such as C. The main reason for
8336 this is that Ada provides types whose definition might be dynamic.
8337 One example of such types is variant records. Or another example
8338 would be an array whose bounds can only be known at run time.
8340 The following description is a general guide as to what should be
8341 done (and what should NOT be done) in order to evaluate an expression
8342 involving such types, and when. This does not cover how the semantic
8343 information is encoded by GNAT as this is covered separatly. For the
8344 document used as the reference for the GNAT encoding, see exp_dbug.ads
8345 in the GNAT sources.
8347 Ideally, we should embed each part of this description next to its
8348 associated code. Unfortunately, the amount of code is so vast right
8349 now that it's hard to see whether the code handling a particular
8350 situation might be duplicated or not. One day, when the code is
8351 cleaned up, this guide might become redundant with the comments
8352 inserted in the code, and we might want to remove it.
8354 When evaluating Ada expressions, the tricky issue is that they may
8355 reference entities whose type contents and size are not statically
8356 known. Consider for instance a variant record:
8358 type Rec (Empty : Boolean := True) is record
8361 when False => Value : Integer;
8364 Yes : Rec := (Empty => False, Value => 1);
8365 No : Rec := (empty => True);
8367 The size and contents of that record depends on the value of the
8368 descriminant (Rec.Empty). At this point, neither the debugging
8369 information nor the associated type structure in GDB are able to
8370 express such dynamic types. So what the debugger does is to create
8371 "fixed" versions of the type that applies to the specific object.
8372 We also informally refer to this opperation as "fixing" an object,
8373 which means creating its associated fixed type.
8375 Example: when printing the value of variable "Yes" above, its fixed
8376 type would look like this:
8383 On the other hand, if we printed the value of "No", its fixed type
8390 Things become a little more complicated when trying to fix an entity
8391 with a dynamic type that directly contains another dynamic type,
8392 such as an array of variant records, for instance. There are
8393 two possible cases: Arrays, and records.
8395 Arrays are a little simpler to handle, because the same amount of
8396 memory is allocated for each element of the array, even if the amount
8397 of space used by each element changes from element to element.
8398 Consider for instance the following array of type Rec:
8400 type Rec_Array is array (1 .. 2) of Rec;
8402 The type structure in GDB describes an array in terms of its
8403 bounds, and the type of its elements. By design, all elements
8404 in the array have the same type. So we cannot use a fixed type
8405 for the array elements in this case, since the fixed type depends
8406 on the actual value of each element.
8408 Fortunately, what happens in practice is that each element of
8409 the array has the same size, which is the maximum size that
8410 might be needed in order to hold an object of the element type.
8411 And the compiler shows it in the debugging information by wrapping
8412 the array element inside a private PAD type. This type should not
8413 be shown to the user, and must be "unwrap"'ed before printing. Note
8414 that we also use the adjective "aligner" in our code to designate
8415 these wrapper types.
8417 These wrapper types should have a constant size, which is the size
8418 of each element of the array. In the case when the size is statically
8419 known, the PAD type will already have the right size, and the array
8420 element type should remain unfixed. But there are cases when
8421 this size is not statically known. For instance, assuming that
8422 "Five" is an integer variable:
8424 type Dynamic is array (1 .. Five) of Integer;
8425 type Wrapper (Has_Length : Boolean := False) is record
8428 when True => Length : Integer;
8432 type Wrapper_Array is array (1 .. 2) of Wrapper;
8434 Hello : Wrapper_Array := (others => (Has_Length => True,
8435 Data => (others => 17),
8439 The debugging info would describe variable Hello as being an
8440 array of a PAD type. The size of that PAD type is not statically
8441 known, but can be determined using a parallel XVZ variable.
8442 In that case, a copy of the PAD type with the correct size should
8443 be used for the fixed array.
8445 However, things are slightly different in the case of dynamic
8446 record types. In this case, in order to compute the associated
8447 fixed type, we need to determine the size and offset of each of
8448 its components. This, in turn, requires us to compute the fixed
8449 type of each of these components.
8451 Consider for instance the example:
8453 type Bounded_String (Max_Size : Natural) is record
8454 Str : String (1 .. Max_Size);
8457 My_String : Bounded_String (Max_Size => 10);
8459 In that case, the position of field "Length" depends on the size
8460 of field Str, which itself depends on the value of the Max_Size
8461 discriminant. In order to fix the type of variable My_String,
8462 we need to fix the type of field Str. Therefore, fixing a variant
8463 record requires us to fix each of its components.
8465 However, if a component does not have a dynamic size, the component
8466 should not be fixed. In particular, fields that use a PAD type
8467 should not fixed. Here is an example where this might happen
8468 (assuming type Rec above):
8470 type Container (Big : Boolean) is record
8474 when True => Another : Integer;
8478 My_Container : Container := (Big => False,
8479 First => (Empty => True),
8482 In that example, the compiler creates a PAD type for component First,
8483 whose size is constant, and then positions the component After just
8484 right after it. The offset of component After is therefore constant
8487 The debugger computes the position of each field based on an algorithm
8488 that uses, among other things, the actual position and size of the field
8489 preceding it. Let's now imagine that the user is trying to print the
8490 value of My_Container. If the type fixing was recursive, we would
8491 end up computing the offset of field After based on the size of the
8492 fixed version of field First. And since in our example First has
8493 only one actual field, the size of the fixed type is actually smaller
8494 than the amount of space allocated to that field, and thus we would
8495 compute the wrong offset of field After.
8497 Unfortunately, we need to watch out for dynamic components of variant
8498 records (identified by the ___XVL suffix in the component name).
8499 Even if the target type is a PAD type, the size of that type might
8500 not be statically known. So the PAD type needs to be unwrapped and
8501 the resulting type needs to be fixed. Otherwise, we might end up
8502 with the wrong size for our component. This can be observed with
8503 the following type declarations:
8505 type Octal is new Integer range 0 .. 7;
8506 type Octal_Array is array (Positive range <>) of Octal;
8507 pragma Pack (Octal_Array);
8509 type Octal_Buffer (Size : Positive) is record
8510 Buffer : Octal_Array (1 .. Size);
8514 In that case, Buffer is a PAD type whose size is unset and needs
8515 to be computed by fixing the unwrapped type.
8517 Lastly, when should the sub-elements of a type that remained unfixed
8518 thus far, be actually fixed?
8520 The answer is: Only when referencing that element. For instance
8521 when selecting one component of a record, this specific component
8522 should be fixed at that point in time. Or when printing the value
8523 of a record, each component should be fixed before its value gets
8524 printed. Similarly for arrays, the element of the array should be
8525 fixed when printing each element of the array, or when extracting
8526 one element out of that array. On the other hand, fixing should
8527 not be performed on the elements when taking a slice of an array!
8529 Note that one of the side-effects of miscomputing the offset and
8530 size of each field is that we end up also miscomputing the size
8531 of the containing type. This can have adverse results when computing
8532 the value of an entity. GDB fetches the value of an entity based
8533 on the size of its type, and thus a wrong size causes GDB to fetch
8534 the wrong amount of memory. In the case where the computed size is
8535 too small, GDB fetches too little data to print the value of our
8536 entiry. Results in this case as unpredicatble, as we usually read
8537 past the buffer containing the data =:-o. */
8539 /* Implement the evaluate_exp routine in the exp_descriptor structure
8540 for the Ada language. */
8542 static struct value
*
8543 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8544 int *pos
, enum noside noside
)
8547 int tem
, tem2
, tem3
;
8549 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8552 struct value
**argvec
;
8556 op
= exp
->elts
[pc
].opcode
;
8562 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8563 arg1
= unwrap_value (arg1
);
8565 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8566 then we need to perform the conversion manually, because
8567 evaluate_subexp_standard doesn't do it. This conversion is
8568 necessary in Ada because the different kinds of float/fixed
8569 types in Ada have different representations.
8571 Similarly, we need to perform the conversion from OP_LONG
8573 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8574 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8580 struct value
*result
;
8582 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8583 /* The result type will have code OP_STRING, bashed there from
8584 OP_ARRAY. Bash it back. */
8585 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8586 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8592 type
= exp
->elts
[pc
+ 1].type
;
8593 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8594 if (noside
== EVAL_SKIP
)
8596 arg1
= ada_value_cast (type
, arg1
, noside
);
8601 type
= exp
->elts
[pc
+ 1].type
;
8602 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8605 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8606 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8608 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8609 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8611 return ada_value_assign (arg1
, arg1
);
8613 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8614 except if the lhs of our assignment is a convenience variable.
8615 In the case of assigning to a convenience variable, the lhs
8616 should be exactly the result of the evaluation of the rhs. */
8617 type
= value_type (arg1
);
8618 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8620 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8621 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8623 if (ada_is_fixed_point_type (value_type (arg1
)))
8624 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8625 else if (ada_is_fixed_point_type (value_type (arg2
)))
8627 (_("Fixed-point values must be assigned to fixed-point variables"));
8629 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8630 return ada_value_assign (arg1
, arg2
);
8633 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8634 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8635 if (noside
== EVAL_SKIP
)
8637 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8638 return (value_from_longest
8640 value_as_long (arg1
) + value_as_long (arg2
)));
8641 if ((ada_is_fixed_point_type (value_type (arg1
))
8642 || ada_is_fixed_point_type (value_type (arg2
)))
8643 && value_type (arg1
) != value_type (arg2
))
8644 error (_("Operands of fixed-point addition must have the same type"));
8645 /* Do the addition, and cast the result to the type of the first
8646 argument. We cannot cast the result to a reference type, so if
8647 ARG1 is a reference type, find its underlying type. */
8648 type
= value_type (arg1
);
8649 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8650 type
= TYPE_TARGET_TYPE (type
);
8651 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8652 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8655 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8656 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8657 if (noside
== EVAL_SKIP
)
8659 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8660 return (value_from_longest
8662 value_as_long (arg1
) - value_as_long (arg2
)));
8663 if ((ada_is_fixed_point_type (value_type (arg1
))
8664 || ada_is_fixed_point_type (value_type (arg2
)))
8665 && value_type (arg1
) != value_type (arg2
))
8666 error (_("Operands of fixed-point subtraction must have the same type"));
8667 /* Do the substraction, and cast the result to the type of the first
8668 argument. We cannot cast the result to a reference type, so if
8669 ARG1 is a reference type, find its underlying type. */
8670 type
= value_type (arg1
);
8671 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8672 type
= TYPE_TARGET_TYPE (type
);
8673 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8674 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8680 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8681 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8682 if (noside
== EVAL_SKIP
)
8684 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8686 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8687 return value_zero (value_type (arg1
), not_lval
);
8691 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8692 if (ada_is_fixed_point_type (value_type (arg1
)))
8693 arg1
= cast_from_fixed (type
, arg1
);
8694 if (ada_is_fixed_point_type (value_type (arg2
)))
8695 arg2
= cast_from_fixed (type
, arg2
);
8696 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8697 return ada_value_binop (arg1
, arg2
, op
);
8701 case BINOP_NOTEQUAL
:
8702 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8703 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8704 if (noside
== EVAL_SKIP
)
8706 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8710 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8711 tem
= ada_value_equal (arg1
, arg2
);
8713 if (op
== BINOP_NOTEQUAL
)
8715 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8716 return value_from_longest (type
, (LONGEST
) tem
);
8719 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8720 if (noside
== EVAL_SKIP
)
8722 else if (ada_is_fixed_point_type (value_type (arg1
)))
8723 return value_cast (value_type (arg1
), value_neg (arg1
));
8726 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8727 return value_neg (arg1
);
8730 case BINOP_LOGICAL_AND
:
8731 case BINOP_LOGICAL_OR
:
8732 case UNOP_LOGICAL_NOT
:
8737 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8738 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8739 return value_cast (type
, val
);
8742 case BINOP_BITWISE_AND
:
8743 case BINOP_BITWISE_IOR
:
8744 case BINOP_BITWISE_XOR
:
8748 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8750 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8752 return value_cast (value_type (arg1
), val
);
8758 if (noside
== EVAL_SKIP
)
8763 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8764 /* Only encountered when an unresolved symbol occurs in a
8765 context other than a function call, in which case, it is
8767 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8768 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8769 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8771 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8772 if (ada_is_tagged_type (type
, 0))
8774 /* Tagged types are a little special in the fact that the real
8775 type is dynamic and can only be determined by inspecting the
8776 object's tag. This means that we need to get the object's
8777 value first (EVAL_NORMAL) and then extract the actual object
8780 Note that we cannot skip the final step where we extract
8781 the object type from its tag, because the EVAL_NORMAL phase
8782 results in dynamic components being resolved into fixed ones.
8783 This can cause problems when trying to print the type
8784 description of tagged types whose parent has a dynamic size:
8785 We use the type name of the "_parent" component in order
8786 to print the name of the ancestor type in the type description.
8787 If that component had a dynamic size, the resolution into
8788 a fixed type would result in the loss of that type name,
8789 thus preventing us from printing the name of the ancestor
8790 type in the type description. */
8791 struct type
*actual_type
;
8793 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8794 actual_type
= type_from_tag (ada_value_tag (arg1
));
8795 if (actual_type
== NULL
)
8796 /* If, for some reason, we were unable to determine
8797 the actual type from the tag, then use the static
8798 approximation that we just computed as a fallback.
8799 This can happen if the debugging information is
8800 incomplete, for instance. */
8803 return value_zero (actual_type
, not_lval
);
8808 (to_static_fixed_type
8809 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8814 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8815 arg1
= unwrap_value (arg1
);
8816 return ada_to_fixed_value (arg1
);
8822 /* Allocate arg vector, including space for the function to be
8823 called in argvec[0] and a terminating NULL. */
8824 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8826 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8828 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8829 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8830 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8831 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8834 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8835 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8838 if (noside
== EVAL_SKIP
)
8842 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8843 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8844 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8845 && TYPE_FIELD_BITSIZE (value_type (argvec
[0]), 0) != 0)
8846 /* This is a packed array that has already been fixed, and
8847 therefore already coerced to a simple array. Nothing further
8850 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8851 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8852 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8853 argvec
[0] = value_addr (argvec
[0]);
8855 type
= ada_check_typedef (value_type (argvec
[0]));
8856 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8858 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8860 case TYPE_CODE_FUNC
:
8861 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8863 case TYPE_CODE_ARRAY
:
8865 case TYPE_CODE_STRUCT
:
8866 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8867 argvec
[0] = ada_value_ind (argvec
[0]);
8868 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8871 error (_("cannot subscript or call something of type `%s'"),
8872 ada_type_name (value_type (argvec
[0])));
8877 switch (TYPE_CODE (type
))
8879 case TYPE_CODE_FUNC
:
8880 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8881 return allocate_value (TYPE_TARGET_TYPE (type
));
8882 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8883 case TYPE_CODE_STRUCT
:
8887 arity
= ada_array_arity (type
);
8888 type
= ada_array_element_type (type
, nargs
);
8890 error (_("cannot subscript or call a record"));
8892 error (_("wrong number of subscripts; expecting %d"), arity
);
8893 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8894 return value_zero (ada_aligned_type (type
), lval_memory
);
8896 unwrap_value (ada_value_subscript
8897 (argvec
[0], nargs
, argvec
+ 1));
8899 case TYPE_CODE_ARRAY
:
8900 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8902 type
= ada_array_element_type (type
, nargs
);
8904 error (_("element type of array unknown"));
8906 return value_zero (ada_aligned_type (type
), lval_memory
);
8909 unwrap_value (ada_value_subscript
8910 (ada_coerce_to_simple_array (argvec
[0]),
8911 nargs
, argvec
+ 1));
8912 case TYPE_CODE_PTR
: /* Pointer to array */
8913 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8914 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8916 type
= ada_array_element_type (type
, nargs
);
8918 error (_("element type of array unknown"));
8920 return value_zero (ada_aligned_type (type
), lval_memory
);
8923 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8924 nargs
, argvec
+ 1));
8927 error (_("Attempt to index or call something other than an "
8928 "array or function"));
8933 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8934 struct value
*low_bound_val
=
8935 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8936 struct value
*high_bound_val
=
8937 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8940 low_bound_val
= coerce_ref (low_bound_val
);
8941 high_bound_val
= coerce_ref (high_bound_val
);
8942 low_bound
= pos_atr (low_bound_val
);
8943 high_bound
= pos_atr (high_bound_val
);
8945 if (noside
== EVAL_SKIP
)
8948 /* If this is a reference to an aligner type, then remove all
8950 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8951 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8952 TYPE_TARGET_TYPE (value_type (array
)) =
8953 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8955 if (ada_is_packed_array_type (value_type (array
)))
8956 error (_("cannot slice a packed array"));
8958 /* If this is a reference to an array or an array lvalue,
8959 convert to a pointer. */
8960 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8961 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8962 && VALUE_LVAL (array
) == lval_memory
))
8963 array
= value_addr (array
);
8965 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8966 && ada_is_array_descriptor_type (ada_check_typedef
8967 (value_type (array
))))
8968 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8970 array
= ada_coerce_to_simple_array_ptr (array
);
8972 /* If we have more than one level of pointer indirection,
8973 dereference the value until we get only one level. */
8974 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8975 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8977 array
= value_ind (array
);
8979 /* Make sure we really do have an array type before going further,
8980 to avoid a SEGV when trying to get the index type or the target
8981 type later down the road if the debug info generated by
8982 the compiler is incorrect or incomplete. */
8983 if (!ada_is_simple_array_type (value_type (array
)))
8984 error (_("cannot take slice of non-array"));
8986 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8988 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8989 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8993 struct type
*arr_type0
=
8994 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8996 return ada_value_slice_from_ptr (array
, arr_type0
,
8997 longest_to_int (low_bound
),
8998 longest_to_int (high_bound
));
9001 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9003 else if (high_bound
< low_bound
)
9004 return empty_array (value_type (array
), low_bound
);
9006 return ada_value_slice (array
, longest_to_int (low_bound
),
9007 longest_to_int (high_bound
));
9012 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9013 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
9015 if (noside
== EVAL_SKIP
)
9018 switch (TYPE_CODE (type
))
9021 lim_warning (_("Membership test incompletely implemented; "
9022 "always returns true"));
9023 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9024 return value_from_longest (type
, (LONGEST
) 1);
9026 case TYPE_CODE_RANGE
:
9027 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
9028 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
9029 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9030 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9031 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9033 value_from_longest (type
,
9034 (value_less (arg1
, arg3
)
9035 || value_equal (arg1
, arg3
))
9036 && (value_less (arg2
, arg1
)
9037 || value_equal (arg2
, arg1
)));
9040 case BINOP_IN_BOUNDS
:
9042 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9043 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9045 if (noside
== EVAL_SKIP
)
9048 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9050 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9051 return value_zero (type
, not_lval
);
9054 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9056 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
9057 error (_("invalid dimension number to 'range"));
9059 arg3
= ada_array_bound (arg2
, tem
, 1);
9060 arg2
= ada_array_bound (arg2
, tem
, 0);
9062 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9063 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9064 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9066 value_from_longest (type
,
9067 (value_less (arg1
, arg3
)
9068 || value_equal (arg1
, arg3
))
9069 && (value_less (arg2
, arg1
)
9070 || value_equal (arg2
, arg1
)));
9072 case TERNOP_IN_RANGE
:
9073 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9074 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9075 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9077 if (noside
== EVAL_SKIP
)
9080 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9081 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
9082 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
9084 value_from_longest (type
,
9085 (value_less (arg1
, arg3
)
9086 || value_equal (arg1
, arg3
))
9087 && (value_less (arg2
, arg1
)
9088 || value_equal (arg2
, arg1
)));
9094 struct type
*type_arg
;
9095 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
9097 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9099 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9103 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9107 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
9108 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
9109 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
9112 if (noside
== EVAL_SKIP
)
9115 if (type_arg
== NULL
)
9117 arg1
= ada_coerce_ref (arg1
);
9119 if (ada_is_packed_array_type (value_type (arg1
)))
9120 arg1
= ada_coerce_to_simple_array (arg1
);
9122 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
9123 error (_("invalid dimension number to '%s"),
9124 ada_attribute_name (op
));
9126 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9128 type
= ada_index_type (value_type (arg1
), tem
);
9131 (_("attempt to take bound of something that is not an array"));
9132 return allocate_value (type
);
9137 default: /* Should never happen. */
9138 error (_("unexpected attribute encountered"));
9140 return ada_array_bound (arg1
, tem
, 0);
9142 return ada_array_bound (arg1
, tem
, 1);
9144 return ada_array_length (arg1
, tem
);
9147 else if (discrete_type_p (type_arg
))
9149 struct type
*range_type
;
9150 char *name
= ada_type_name (type_arg
);
9152 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
9154 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
9155 if (range_type
== NULL
)
9156 range_type
= type_arg
;
9160 error (_("unexpected attribute encountered"));
9162 return value_from_longest
9163 (range_type
, discrete_type_low_bound (range_type
));
9165 return value_from_longest
9166 (range_type
, discrete_type_high_bound (range_type
));
9168 error (_("the 'length attribute applies only to array types"));
9171 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
9172 error (_("unimplemented type attribute"));
9177 if (ada_is_packed_array_type (type_arg
))
9178 type_arg
= decode_packed_array_type (type_arg
);
9180 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
9181 error (_("invalid dimension number to '%s"),
9182 ada_attribute_name (op
));
9184 type
= ada_index_type (type_arg
, tem
);
9187 (_("attempt to take bound of something that is not an array"));
9188 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9189 return allocate_value (type
);
9194 error (_("unexpected attribute encountered"));
9196 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9197 return value_from_longest (type
, low
);
9199 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
9200 return value_from_longest (type
, high
);
9202 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
9203 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
9204 return value_from_longest (type
, high
- low
+ 1);
9210 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9211 if (noside
== EVAL_SKIP
)
9214 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9215 return value_zero (ada_tag_type (arg1
), not_lval
);
9217 return ada_value_tag (arg1
);
9221 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9222 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9223 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9224 if (noside
== EVAL_SKIP
)
9226 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9227 return value_zero (value_type (arg1
), not_lval
);
9230 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9231 return value_binop (arg1
, arg2
,
9232 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
9235 case OP_ATR_MODULUS
:
9237 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
9238 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9240 if (noside
== EVAL_SKIP
)
9243 if (!ada_is_modular_type (type_arg
))
9244 error (_("'modulus must be applied to modular type"));
9246 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
9247 ada_modulus (type_arg
));
9252 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9253 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9254 if (noside
== EVAL_SKIP
)
9256 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
9257 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9258 return value_zero (type
, not_lval
);
9260 return value_pos_atr (type
, arg1
);
9263 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9264 type
= value_type (arg1
);
9266 /* If the argument is a reference, then dereference its type, since
9267 the user is really asking for the size of the actual object,
9268 not the size of the pointer. */
9269 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
9270 type
= TYPE_TARGET_TYPE (type
);
9272 if (noside
== EVAL_SKIP
)
9274 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9275 return value_zero (builtin_type_int32
, not_lval
);
9277 return value_from_longest (builtin_type_int32
,
9278 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9281 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9282 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9283 type
= exp
->elts
[pc
+ 2].type
;
9284 if (noside
== EVAL_SKIP
)
9286 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9287 return value_zero (type
, not_lval
);
9289 return value_val_atr (type
, arg1
);
9292 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9293 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9294 if (noside
== EVAL_SKIP
)
9296 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9297 return value_zero (value_type (arg1
), not_lval
);
9300 /* For integer exponentiation operations,
9301 only promote the first argument. */
9302 if (is_integral_type (value_type (arg2
)))
9303 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9305 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9307 return value_binop (arg1
, arg2
, op
);
9311 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9312 if (noside
== EVAL_SKIP
)
9318 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9319 if (noside
== EVAL_SKIP
)
9321 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9322 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9323 return value_neg (arg1
);
9328 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9329 if (noside
== EVAL_SKIP
)
9331 type
= ada_check_typedef (value_type (arg1
));
9332 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9334 if (ada_is_array_descriptor_type (type
))
9335 /* GDB allows dereferencing GNAT array descriptors. */
9337 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9338 if (arrType
== NULL
)
9339 error (_("Attempt to dereference null array pointer."));
9340 return value_at_lazy (arrType
, 0);
9342 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9343 || TYPE_CODE (type
) == TYPE_CODE_REF
9344 /* In C you can dereference an array to get the 1st elt. */
9345 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9347 type
= to_static_fixed_type
9349 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9351 return value_zero (type
, lval_memory
);
9353 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9355 /* GDB allows dereferencing an int. */
9356 if (expect_type
== NULL
)
9357 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9362 to_static_fixed_type (ada_aligned_type (expect_type
));
9363 return value_zero (expect_type
, lval_memory
);
9367 error (_("Attempt to take contents of a non-pointer value."));
9369 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9370 type
= ada_check_typedef (value_type (arg1
));
9372 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9373 /* GDB allows dereferencing an int. If we were given
9374 the expect_type, then use that as the target type.
9375 Otherwise, assume that the target type is an int. */
9377 if (expect_type
!= NULL
)
9378 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9381 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9382 (CORE_ADDR
) value_as_address (arg1
));
9385 if (ada_is_array_descriptor_type (type
))
9386 /* GDB allows dereferencing GNAT array descriptors. */
9387 return ada_coerce_to_simple_array (arg1
);
9389 return ada_value_ind (arg1
);
9391 case STRUCTOP_STRUCT
:
9392 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9393 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9394 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9395 if (noside
== EVAL_SKIP
)
9397 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9399 struct type
*type1
= value_type (arg1
);
9400 if (ada_is_tagged_type (type1
, 1))
9402 type
= ada_lookup_struct_elt_type (type1
,
9403 &exp
->elts
[pc
+ 2].string
,
9406 /* In this case, we assume that the field COULD exist
9407 in some extension of the type. Return an object of
9408 "type" void, which will match any formal
9409 (see ada_type_match). */
9410 return value_zero (builtin_type_void
, lval_memory
);
9414 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9417 return value_zero (ada_aligned_type (type
), lval_memory
);
9420 arg1
= ada_value_struct_elt (arg1
, &exp
->elts
[pc
+ 2].string
, 0);
9421 arg1
= unwrap_value (arg1
);
9422 return ada_to_fixed_value (arg1
);
9425 /* The value is not supposed to be used. This is here to make it
9426 easier to accommodate expressions that contain types. */
9428 if (noside
== EVAL_SKIP
)
9430 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9431 return allocate_value (exp
->elts
[pc
+ 1].type
);
9433 error (_("Attempt to use a type name as an expression"));
9438 case OP_DISCRETE_RANGE
:
9441 if (noside
== EVAL_NORMAL
)
9445 error (_("Undefined name, ambiguous name, or renaming used in "
9446 "component association: %s."), &exp
->elts
[pc
+2].string
);
9448 error (_("Aggregates only allowed on the right of an assignment"));
9450 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9453 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9455 for (tem
= 0; tem
< nargs
; tem
+= 1)
9456 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9461 return value_from_longest (builtin_type_int8
, (LONGEST
) 1);
9467 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9468 type name that encodes the 'small and 'delta information.
9469 Otherwise, return NULL. */
9472 fixed_type_info (struct type
*type
)
9474 const char *name
= ada_type_name (type
);
9475 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9477 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9479 const char *tail
= strstr (name
, "___XF_");
9485 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9486 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9491 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9494 ada_is_fixed_point_type (struct type
*type
)
9496 return fixed_type_info (type
) != NULL
;
9499 /* Return non-zero iff TYPE represents a System.Address type. */
9502 ada_is_system_address_type (struct type
*type
)
9504 return (TYPE_NAME (type
)
9505 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9508 /* Assuming that TYPE is the representation of an Ada fixed-point
9509 type, return its delta, or -1 if the type is malformed and the
9510 delta cannot be determined. */
9513 ada_delta (struct type
*type
)
9515 const char *encoding
= fixed_type_info (type
);
9518 /* Strictly speaking, num and den are encoded as integer. However,
9519 they may not fit into a long, and they will have to be converted
9520 to DOUBLEST anyway. So scan them as DOUBLEST. */
9521 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9528 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9529 factor ('SMALL value) associated with the type. */
9532 scaling_factor (struct type
*type
)
9534 const char *encoding
= fixed_type_info (type
);
9535 DOUBLEST num0
, den0
, num1
, den1
;
9538 /* Strictly speaking, num's and den's are encoded as integer. However,
9539 they may not fit into a long, and they will have to be converted
9540 to DOUBLEST anyway. So scan them as DOUBLEST. */
9541 n
= sscanf (encoding
,
9542 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9543 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9544 &num0
, &den0
, &num1
, &den1
);
9555 /* Assuming that X is the representation of a value of fixed-point
9556 type TYPE, return its floating-point equivalent. */
9559 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9561 return (DOUBLEST
) x
*scaling_factor (type
);
9564 /* The representation of a fixed-point value of type TYPE
9565 corresponding to the value X. */
9568 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9570 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9574 /* VAX floating formats */
9576 /* Non-zero iff TYPE represents one of the special VAX floating-point
9580 ada_is_vax_floating_type (struct type
*type
)
9583 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9586 && (TYPE_CODE (type
) == TYPE_CODE_INT
9587 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9588 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9591 /* The type of special VAX floating-point type this is, assuming
9592 ada_is_vax_floating_point. */
9595 ada_vax_float_type_suffix (struct type
*type
)
9597 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9600 /* A value representing the special debugging function that outputs
9601 VAX floating-point values of the type represented by TYPE. Assumes
9602 ada_is_vax_floating_type (TYPE). */
9605 ada_vax_float_print_function (struct type
*type
)
9607 switch (ada_vax_float_type_suffix (type
))
9610 return get_var_value ("DEBUG_STRING_F", 0);
9612 return get_var_value ("DEBUG_STRING_D", 0);
9614 return get_var_value ("DEBUG_STRING_G", 0);
9616 error (_("invalid VAX floating-point type"));
9623 /* Scan STR beginning at position K for a discriminant name, and
9624 return the value of that discriminant field of DVAL in *PX. If
9625 PNEW_K is not null, put the position of the character beyond the
9626 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9627 not alter *PX and *PNEW_K if unsuccessful. */
9630 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9633 static char *bound_buffer
= NULL
;
9634 static size_t bound_buffer_len
= 0;
9637 struct value
*bound_val
;
9639 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9642 pend
= strstr (str
+ k
, "__");
9646 k
+= strlen (bound
);
9650 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9651 bound
= bound_buffer
;
9652 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9653 bound
[pend
- (str
+ k
)] = '\0';
9657 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9658 if (bound_val
== NULL
)
9661 *px
= value_as_long (bound_val
);
9667 /* Value of variable named NAME in the current environment. If
9668 no such variable found, then if ERR_MSG is null, returns 0, and
9669 otherwise causes an error with message ERR_MSG. */
9671 static struct value
*
9672 get_var_value (char *name
, char *err_msg
)
9674 struct ada_symbol_info
*syms
;
9677 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9682 if (err_msg
== NULL
)
9685 error (("%s"), err_msg
);
9688 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9691 /* Value of integer variable named NAME in the current environment. If
9692 no such variable found, returns 0, and sets *FLAG to 0. If
9693 successful, sets *FLAG to 1. */
9696 get_int_var_value (char *name
, int *flag
)
9698 struct value
*var_val
= get_var_value (name
, 0);
9710 return value_as_long (var_val
);
9715 /* Return a range type whose base type is that of the range type named
9716 NAME in the current environment, and whose bounds are calculated
9717 from NAME according to the GNAT range encoding conventions.
9718 Extract discriminant values, if needed, from DVAL. If a new type
9719 must be created, allocate in OBJFILE's space. The bounds
9720 information, in general, is encoded in NAME, the base type given in
9721 the named range type. */
9723 static struct type
*
9724 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9726 struct type
*raw_type
= ada_find_any_type (name
);
9727 struct type
*base_type
;
9730 /* Also search primitive types if type symbol could not be found. */
9731 if (raw_type
== NULL
)
9732 raw_type
= language_lookup_primitive_type_by_name
9733 (language_def (language_ada
), current_gdbarch
, name
);
9735 if (raw_type
== NULL
)
9736 base_type
= builtin_type_int32
;
9737 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9738 base_type
= TYPE_TARGET_TYPE (raw_type
);
9740 base_type
= raw_type
;
9742 subtype_info
= strstr (name
, "___XD");
9743 if (subtype_info
== NULL
)
9745 LONGEST L
= discrete_type_low_bound (raw_type
);
9746 LONGEST U
= discrete_type_high_bound (raw_type
);
9747 if (L
< INT_MIN
|| U
> INT_MAX
)
9750 return create_range_type (alloc_type (objfile
), raw_type
,
9751 discrete_type_low_bound (raw_type
),
9752 discrete_type_high_bound (raw_type
));
9756 static char *name_buf
= NULL
;
9757 static size_t name_len
= 0;
9758 int prefix_len
= subtype_info
- name
;
9764 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9765 strncpy (name_buf
, name
, prefix_len
);
9766 name_buf
[prefix_len
] = '\0';
9769 bounds_str
= strchr (subtype_info
, '_');
9772 if (*subtype_info
== 'L')
9774 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9775 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9777 if (bounds_str
[n
] == '_')
9779 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9786 strcpy (name_buf
+ prefix_len
, "___L");
9787 L
= get_int_var_value (name_buf
, &ok
);
9790 lim_warning (_("Unknown lower bound, using 1."));
9795 if (*subtype_info
== 'U')
9797 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9798 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9804 strcpy (name_buf
+ prefix_len
, "___U");
9805 U
= get_int_var_value (name_buf
, &ok
);
9808 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9813 if (objfile
== NULL
)
9814 objfile
= TYPE_OBJFILE (base_type
);
9815 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9816 TYPE_NAME (type
) = name
;
9821 /* True iff NAME is the name of a range type. */
9824 ada_is_range_type_name (const char *name
)
9826 return (name
!= NULL
&& strstr (name
, "___XD"));
9832 /* True iff TYPE is an Ada modular type. */
9835 ada_is_modular_type (struct type
*type
)
9837 struct type
*subranged_type
= base_type (type
);
9839 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9840 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9841 && TYPE_UNSIGNED (subranged_type
));
9844 /* Try to determine the lower and upper bounds of the given modular type
9845 using the type name only. Return non-zero and set L and U as the lower
9846 and upper bounds (respectively) if successful. */
9849 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9851 char *name
= ada_type_name (type
);
9859 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9860 we are looking for static bounds, which means an __XDLU suffix.
9861 Moreover, we know that the lower bound of modular types is always
9862 zero, so the actual suffix should start with "__XDLU_0__", and
9863 then be followed by the upper bound value. */
9864 suffix
= strstr (name
, "__XDLU_0__");
9868 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9871 *modulus
= (ULONGEST
) U
+ 1;
9875 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9878 ada_modulus (struct type
*type
)
9882 /* Normally, the modulus of a modular type is equal to the value of
9883 its upper bound + 1. However, the upper bound is currently stored
9884 as an int, which is not always big enough to hold the actual bound
9885 value. To workaround this, try to take advantage of the encoding
9886 that GNAT uses with with discrete types. To avoid some unnecessary
9887 parsing, we do this only when the size of TYPE is greater than
9888 the size of the field holding the bound. */
9889 if (TYPE_LENGTH (type
) > sizeof (TYPE_HIGH_BOUND (type
))
9890 && ada_modulus_from_name (type
, &modulus
))
9893 return (ULONGEST
) (unsigned int) TYPE_HIGH_BOUND (type
) + 1;
9897 /* Ada exception catchpoint support:
9898 ---------------------------------
9900 We support 3 kinds of exception catchpoints:
9901 . catchpoints on Ada exceptions
9902 . catchpoints on unhandled Ada exceptions
9903 . catchpoints on failed assertions
9905 Exceptions raised during failed assertions, or unhandled exceptions
9906 could perfectly be caught with the general catchpoint on Ada exceptions.
9907 However, we can easily differentiate these two special cases, and having
9908 the option to distinguish these two cases from the rest can be useful
9909 to zero-in on certain situations.
9911 Exception catchpoints are a specialized form of breakpoint,
9912 since they rely on inserting breakpoints inside known routines
9913 of the GNAT runtime. The implementation therefore uses a standard
9914 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9917 Support in the runtime for exception catchpoints have been changed
9918 a few times already, and these changes affect the implementation
9919 of these catchpoints. In order to be able to support several
9920 variants of the runtime, we use a sniffer that will determine
9921 the runtime variant used by the program being debugged.
9923 At this time, we do not support the use of conditions on Ada exception
9924 catchpoints. The COND and COND_STRING fields are therefore set
9925 to NULL (most of the time, see below).
9927 Conditions where EXP_STRING, COND, and COND_STRING are used:
9929 When a user specifies the name of a specific exception in the case
9930 of catchpoints on Ada exceptions, we store the name of that exception
9931 in the EXP_STRING. We then translate this request into an actual
9932 condition stored in COND_STRING, and then parse it into an expression
9935 /* The different types of catchpoints that we introduced for catching
9938 enum exception_catchpoint_kind
9941 ex_catch_exception_unhandled
,
9945 /* Ada's standard exceptions. */
9947 static char *standard_exc
[] = {
9954 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9956 /* A structure that describes how to support exception catchpoints
9957 for a given executable. */
9959 struct exception_support_info
9961 /* The name of the symbol to break on in order to insert
9962 a catchpoint on exceptions. */
9963 const char *catch_exception_sym
;
9965 /* The name of the symbol to break on in order to insert
9966 a catchpoint on unhandled exceptions. */
9967 const char *catch_exception_unhandled_sym
;
9969 /* The name of the symbol to break on in order to insert
9970 a catchpoint on failed assertions. */
9971 const char *catch_assert_sym
;
9973 /* Assuming that the inferior just triggered an unhandled exception
9974 catchpoint, this function is responsible for returning the address
9975 in inferior memory where the name of that exception is stored.
9976 Return zero if the address could not be computed. */
9977 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9980 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9981 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9983 /* The following exception support info structure describes how to
9984 implement exception catchpoints with the latest version of the
9985 Ada runtime (as of 2007-03-06). */
9987 static const struct exception_support_info default_exception_support_info
=
9989 "__gnat_debug_raise_exception", /* catch_exception_sym */
9990 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9991 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9992 ada_unhandled_exception_name_addr
9995 /* The following exception support info structure describes how to
9996 implement exception catchpoints with a slightly older version
9997 of the Ada runtime. */
9999 static const struct exception_support_info exception_support_info_fallback
=
10001 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
10002 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
10003 "system__assertions__raise_assert_failure", /* catch_assert_sym */
10004 ada_unhandled_exception_name_addr_from_raise
10007 /* For each executable, we sniff which exception info structure to use
10008 and cache it in the following global variable. */
10010 static const struct exception_support_info
*exception_info
= NULL
;
10012 /* Inspect the Ada runtime and determine which exception info structure
10013 should be used to provide support for exception catchpoints.
10015 This function will always set exception_info, or raise an error. */
10018 ada_exception_support_info_sniffer (void)
10020 struct symbol
*sym
;
10022 /* If the exception info is already known, then no need to recompute it. */
10023 if (exception_info
!= NULL
)
10026 /* Check the latest (default) exception support info. */
10027 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
10031 exception_info
= &default_exception_support_info
;
10035 /* Try our fallback exception suport info. */
10036 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
10040 exception_info
= &exception_support_info_fallback
;
10044 /* Sometimes, it is normal for us to not be able to find the routine
10045 we are looking for. This happens when the program is linked with
10046 the shared version of the GNAT runtime, and the program has not been
10047 started yet. Inform the user of these two possible causes if
10050 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
10051 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
10053 /* If the symbol does not exist, then check that the program is
10054 already started, to make sure that shared libraries have been
10055 loaded. If it is not started, this may mean that the symbol is
10056 in a shared library. */
10058 if (ptid_get_pid (inferior_ptid
) == 0)
10059 error (_("Unable to insert catchpoint. Try to start the program first."));
10061 /* At this point, we know that we are debugging an Ada program and
10062 that the inferior has been started, but we still are not able to
10063 find the run-time symbols. That can mean that we are in
10064 configurable run time mode, or that a-except as been optimized
10065 out by the linker... In any case, at this point it is not worth
10066 supporting this feature. */
10068 error (_("Cannot insert catchpoints in this configuration."));
10071 /* An observer of "executable_changed" events.
10072 Its role is to clear certain cached values that need to be recomputed
10073 each time a new executable is loaded by GDB. */
10076 ada_executable_changed_observer (void)
10078 /* If the executable changed, then it is possible that the Ada runtime
10079 is different. So we need to invalidate the exception support info
10081 exception_info
= NULL
;
10084 /* Return the name of the function at PC, NULL if could not find it.
10085 This function only checks the debugging information, not the symbol
10089 function_name_from_pc (CORE_ADDR pc
)
10093 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
10099 /* True iff FRAME is very likely to be that of a function that is
10100 part of the runtime system. This is all very heuristic, but is
10101 intended to be used as advice as to what frames are uninteresting
10105 is_known_support_routine (struct frame_info
*frame
)
10107 struct symtab_and_line sal
;
10111 /* If this code does not have any debugging information (no symtab),
10112 This cannot be any user code. */
10114 find_frame_sal (frame
, &sal
);
10115 if (sal
.symtab
== NULL
)
10118 /* If there is a symtab, but the associated source file cannot be
10119 located, then assume this is not user code: Selecting a frame
10120 for which we cannot display the code would not be very helpful
10121 for the user. This should also take care of case such as VxWorks
10122 where the kernel has some debugging info provided for a few units. */
10124 if (symtab_to_fullname (sal
.symtab
) == NULL
)
10127 /* Check the unit filename againt the Ada runtime file naming.
10128 We also check the name of the objfile against the name of some
10129 known system libraries that sometimes come with debugging info
10132 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
10134 re_comp (known_runtime_file_name_patterns
[i
]);
10135 if (re_exec (sal
.symtab
->filename
))
10137 if (sal
.symtab
->objfile
!= NULL
10138 && re_exec (sal
.symtab
->objfile
->name
))
10142 /* Check whether the function is a GNAT-generated entity. */
10144 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
10145 if (func_name
== NULL
)
10148 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
10150 re_comp (known_auxiliary_function_name_patterns
[i
]);
10151 if (re_exec (func_name
))
10158 /* Find the first frame that contains debugging information and that is not
10159 part of the Ada run-time, starting from FI and moving upward. */
10162 ada_find_printable_frame (struct frame_info
*fi
)
10164 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
10166 if (!is_known_support_routine (fi
))
10175 /* Assuming that the inferior just triggered an unhandled exception
10176 catchpoint, return the address in inferior memory where the name
10177 of the exception is stored.
10179 Return zero if the address could not be computed. */
10182 ada_unhandled_exception_name_addr (void)
10184 return parse_and_eval_address ("e.full_name");
10187 /* Same as ada_unhandled_exception_name_addr, except that this function
10188 should be used when the inferior uses an older version of the runtime,
10189 where the exception name needs to be extracted from a specific frame
10190 several frames up in the callstack. */
10193 ada_unhandled_exception_name_addr_from_raise (void)
10196 struct frame_info
*fi
;
10198 /* To determine the name of this exception, we need to select
10199 the frame corresponding to RAISE_SYM_NAME. This frame is
10200 at least 3 levels up, so we simply skip the first 3 frames
10201 without checking the name of their associated function. */
10202 fi
= get_current_frame ();
10203 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
10205 fi
= get_prev_frame (fi
);
10209 const char *func_name
=
10210 function_name_from_pc (get_frame_address_in_block (fi
));
10211 if (func_name
!= NULL
10212 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
10213 break; /* We found the frame we were looking for... */
10214 fi
= get_prev_frame (fi
);
10221 return parse_and_eval_address ("id.full_name");
10224 /* Assuming the inferior just triggered an Ada exception catchpoint
10225 (of any type), return the address in inferior memory where the name
10226 of the exception is stored, if applicable.
10228 Return zero if the address could not be computed, or if not relevant. */
10231 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
10232 struct breakpoint
*b
)
10236 case ex_catch_exception
:
10237 return (parse_and_eval_address ("e.full_name"));
10240 case ex_catch_exception_unhandled
:
10241 return exception_info
->unhandled_exception_name_addr ();
10244 case ex_catch_assert
:
10245 return 0; /* Exception name is not relevant in this case. */
10249 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10253 return 0; /* Should never be reached. */
10256 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
10257 any error that ada_exception_name_addr_1 might cause to be thrown.
10258 When an error is intercepted, a warning with the error message is printed,
10259 and zero is returned. */
10262 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
10263 struct breakpoint
*b
)
10265 struct gdb_exception e
;
10266 CORE_ADDR result
= 0;
10268 TRY_CATCH (e
, RETURN_MASK_ERROR
)
10270 result
= ada_exception_name_addr_1 (ex
, b
);
10275 warning (_("failed to get exception name: %s"), e
.message
);
10282 /* Implement the PRINT_IT method in the breakpoint_ops structure
10283 for all exception catchpoint kinds. */
10285 static enum print_stop_action
10286 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10288 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10289 char exception_name
[256];
10293 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10294 exception_name
[sizeof (exception_name
) - 1] = '\0';
10297 ada_find_printable_frame (get_current_frame ());
10299 annotate_catchpoint (b
->number
);
10302 case ex_catch_exception
:
10304 printf_filtered (_("\nCatchpoint %d, %s at "),
10305 b
->number
, exception_name
);
10307 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10309 case ex_catch_exception_unhandled
:
10311 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10312 b
->number
, exception_name
);
10314 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10317 case ex_catch_assert
:
10318 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10323 return PRINT_SRC_AND_LOC
;
10326 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10327 for all exception catchpoint kinds. */
10330 print_one_exception (enum exception_catchpoint_kind ex
,
10331 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10333 struct value_print_options opts
;
10335 get_user_print_options (&opts
);
10336 if (opts
.addressprint
)
10338 annotate_field (4);
10339 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10342 annotate_field (5);
10343 *last_addr
= b
->loc
->address
;
10346 case ex_catch_exception
:
10347 if (b
->exp_string
!= NULL
)
10349 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10351 ui_out_field_string (uiout
, "what", msg
);
10355 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10359 case ex_catch_exception_unhandled
:
10360 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10363 case ex_catch_assert
:
10364 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10368 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10373 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10374 for all exception catchpoint kinds. */
10377 print_mention_exception (enum exception_catchpoint_kind ex
,
10378 struct breakpoint
*b
)
10382 case ex_catch_exception
:
10383 if (b
->exp_string
!= NULL
)
10384 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10385 b
->number
, b
->exp_string
);
10387 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10391 case ex_catch_exception_unhandled
:
10392 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10396 case ex_catch_assert
:
10397 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10401 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10406 /* Virtual table for "catch exception" breakpoints. */
10408 static enum print_stop_action
10409 print_it_catch_exception (struct breakpoint
*b
)
10411 return print_it_exception (ex_catch_exception
, b
);
10415 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10417 print_one_exception (ex_catch_exception
, b
, last_addr
);
10421 print_mention_catch_exception (struct breakpoint
*b
)
10423 print_mention_exception (ex_catch_exception
, b
);
10426 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10430 NULL
, /* breakpoint_hit */
10431 print_it_catch_exception
,
10432 print_one_catch_exception
,
10433 print_mention_catch_exception
10436 /* Virtual table for "catch exception unhandled" breakpoints. */
10438 static enum print_stop_action
10439 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10441 return print_it_exception (ex_catch_exception_unhandled
, b
);
10445 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10447 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10451 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10453 print_mention_exception (ex_catch_exception_unhandled
, b
);
10456 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10459 NULL
, /* breakpoint_hit */
10460 print_it_catch_exception_unhandled
,
10461 print_one_catch_exception_unhandled
,
10462 print_mention_catch_exception_unhandled
10465 /* Virtual table for "catch assert" breakpoints. */
10467 static enum print_stop_action
10468 print_it_catch_assert (struct breakpoint
*b
)
10470 return print_it_exception (ex_catch_assert
, b
);
10474 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10476 print_one_exception (ex_catch_assert
, b
, last_addr
);
10480 print_mention_catch_assert (struct breakpoint
*b
)
10482 print_mention_exception (ex_catch_assert
, b
);
10485 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10488 NULL
, /* breakpoint_hit */
10489 print_it_catch_assert
,
10490 print_one_catch_assert
,
10491 print_mention_catch_assert
10494 /* Return non-zero if B is an Ada exception catchpoint. */
10497 ada_exception_catchpoint_p (struct breakpoint
*b
)
10499 return (b
->ops
== &catch_exception_breakpoint_ops
10500 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10501 || b
->ops
== &catch_assert_breakpoint_ops
);
10504 /* Return a newly allocated copy of the first space-separated token
10505 in ARGSP, and then adjust ARGSP to point immediately after that
10508 Return NULL if ARGPS does not contain any more tokens. */
10511 ada_get_next_arg (char **argsp
)
10513 char *args
= *argsp
;
10517 /* Skip any leading white space. */
10519 while (isspace (*args
))
10522 if (args
[0] == '\0')
10523 return NULL
; /* No more arguments. */
10525 /* Find the end of the current argument. */
10528 while (*end
!= '\0' && !isspace (*end
))
10531 /* Adjust ARGSP to point to the start of the next argument. */
10535 /* Make a copy of the current argument and return it. */
10537 result
= xmalloc (end
- args
+ 1);
10538 strncpy (result
, args
, end
- args
);
10539 result
[end
- args
] = '\0';
10544 /* Split the arguments specified in a "catch exception" command.
10545 Set EX to the appropriate catchpoint type.
10546 Set EXP_STRING to the name of the specific exception if
10547 specified by the user. */
10550 catch_ada_exception_command_split (char *args
,
10551 enum exception_catchpoint_kind
*ex
,
10554 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10555 char *exception_name
;
10557 exception_name
= ada_get_next_arg (&args
);
10558 make_cleanup (xfree
, exception_name
);
10560 /* Check that we do not have any more arguments. Anything else
10563 while (isspace (*args
))
10566 if (args
[0] != '\0')
10567 error (_("Junk at end of expression"));
10569 discard_cleanups (old_chain
);
10571 if (exception_name
== NULL
)
10573 /* Catch all exceptions. */
10574 *ex
= ex_catch_exception
;
10575 *exp_string
= NULL
;
10577 else if (strcmp (exception_name
, "unhandled") == 0)
10579 /* Catch unhandled exceptions. */
10580 *ex
= ex_catch_exception_unhandled
;
10581 *exp_string
= NULL
;
10585 /* Catch a specific exception. */
10586 *ex
= ex_catch_exception
;
10587 *exp_string
= exception_name
;
10591 /* Return the name of the symbol on which we should break in order to
10592 implement a catchpoint of the EX kind. */
10594 static const char *
10595 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10597 gdb_assert (exception_info
!= NULL
);
10601 case ex_catch_exception
:
10602 return (exception_info
->catch_exception_sym
);
10604 case ex_catch_exception_unhandled
:
10605 return (exception_info
->catch_exception_unhandled_sym
);
10607 case ex_catch_assert
:
10608 return (exception_info
->catch_assert_sym
);
10611 internal_error (__FILE__
, __LINE__
,
10612 _("unexpected catchpoint kind (%d)"), ex
);
10616 /* Return the breakpoint ops "virtual table" used for catchpoints
10619 static struct breakpoint_ops
*
10620 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10624 case ex_catch_exception
:
10625 return (&catch_exception_breakpoint_ops
);
10627 case ex_catch_exception_unhandled
:
10628 return (&catch_exception_unhandled_breakpoint_ops
);
10630 case ex_catch_assert
:
10631 return (&catch_assert_breakpoint_ops
);
10634 internal_error (__FILE__
, __LINE__
,
10635 _("unexpected catchpoint kind (%d)"), ex
);
10639 /* Return the condition that will be used to match the current exception
10640 being raised with the exception that the user wants to catch. This
10641 assumes that this condition is used when the inferior just triggered
10642 an exception catchpoint.
10644 The string returned is a newly allocated string that needs to be
10645 deallocated later. */
10648 ada_exception_catchpoint_cond_string (const char *exp_string
)
10652 /* The standard exceptions are a special case. They are defined in
10653 runtime units that have been compiled without debugging info; if
10654 EXP_STRING is the not-fully-qualified name of a standard
10655 exception (e.g. "constraint_error") then, during the evaluation
10656 of the condition expression, the symbol lookup on this name would
10657 *not* return this standard exception. The catchpoint condition
10658 may then be set only on user-defined exceptions which have the
10659 same not-fully-qualified name (e.g. my_package.constraint_error).
10661 To avoid this unexcepted behavior, these standard exceptions are
10662 systematically prefixed by "standard". This means that "catch
10663 exception constraint_error" is rewritten into "catch exception
10664 standard.constraint_error".
10666 If an exception named contraint_error is defined in another package of
10667 the inferior program, then the only way to specify this exception as a
10668 breakpoint condition is to use its fully-qualified named:
10669 e.g. my_package.constraint_error. */
10671 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10673 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10675 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10679 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10682 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10684 static struct expression
*
10685 ada_parse_catchpoint_condition (char *cond_string
,
10686 struct symtab_and_line sal
)
10688 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10691 /* Return the symtab_and_line that should be used to insert an exception
10692 catchpoint of the TYPE kind.
10694 EX_STRING should contain the name of a specific exception
10695 that the catchpoint should catch, or NULL otherwise.
10697 The idea behind all the remaining parameters is that their names match
10698 the name of certain fields in the breakpoint structure that are used to
10699 handle exception catchpoints. This function returns the value to which
10700 these fields should be set, depending on the type of catchpoint we need
10703 If COND and COND_STRING are both non-NULL, any value they might
10704 hold will be free'ed, and then replaced by newly allocated ones.
10705 These parameters are left untouched otherwise. */
10707 static struct symtab_and_line
10708 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10709 char **addr_string
, char **cond_string
,
10710 struct expression
**cond
, struct breakpoint_ops
**ops
)
10712 const char *sym_name
;
10713 struct symbol
*sym
;
10714 struct symtab_and_line sal
;
10716 /* First, find out which exception support info to use. */
10717 ada_exception_support_info_sniffer ();
10719 /* Then lookup the function on which we will break in order to catch
10720 the Ada exceptions requested by the user. */
10722 sym_name
= ada_exception_sym_name (ex
);
10723 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10725 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10726 that should be compiled with debugging information. As a result, we
10727 expect to find that symbol in the symtabs. If we don't find it, then
10728 the target most likely does not support Ada exceptions, or we cannot
10729 insert exception breakpoints yet, because the GNAT runtime hasn't been
10732 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10733 in such a way that no debugging information is produced for the symbol
10734 we are looking for. In this case, we could search the minimal symbols
10735 as a fall-back mechanism. This would still be operating in degraded
10736 mode, however, as we would still be missing the debugging information
10737 that is needed in order to extract the name of the exception being
10738 raised (this name is printed in the catchpoint message, and is also
10739 used when trying to catch a specific exception). We do not handle
10740 this case for now. */
10743 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10745 /* Make sure that the symbol we found corresponds to a function. */
10746 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10747 error (_("Symbol \"%s\" is not a function (class = %d)"),
10748 sym_name
, SYMBOL_CLASS (sym
));
10750 sal
= find_function_start_sal (sym
, 1);
10752 /* Set ADDR_STRING. */
10754 *addr_string
= xstrdup (sym_name
);
10756 /* Set the COND and COND_STRING (if not NULL). */
10758 if (cond_string
!= NULL
&& cond
!= NULL
)
10760 if (*cond_string
!= NULL
)
10762 xfree (*cond_string
);
10763 *cond_string
= NULL
;
10770 if (exp_string
!= NULL
)
10772 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10773 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10778 *ops
= ada_exception_breakpoint_ops (ex
);
10783 /* Parse the arguments (ARGS) of the "catch exception" command.
10785 Set TYPE to the appropriate exception catchpoint type.
10786 If the user asked the catchpoint to catch only a specific
10787 exception, then save the exception name in ADDR_STRING.
10789 See ada_exception_sal for a description of all the remaining
10790 function arguments of this function. */
10792 struct symtab_and_line
10793 ada_decode_exception_location (char *args
, char **addr_string
,
10794 char **exp_string
, char **cond_string
,
10795 struct expression
**cond
,
10796 struct breakpoint_ops
**ops
)
10798 enum exception_catchpoint_kind ex
;
10800 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10801 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10805 struct symtab_and_line
10806 ada_decode_assert_location (char *args
, char **addr_string
,
10807 struct breakpoint_ops
**ops
)
10809 /* Check that no argument where provided at the end of the command. */
10813 while (isspace (*args
))
10816 error (_("Junk at end of arguments."));
10819 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10824 /* Information about operators given special treatment in functions
10826 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10828 #define ADA_OPERATORS \
10829 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10830 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10831 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10832 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10833 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10834 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10835 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10836 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10837 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10838 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10839 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10840 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10841 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10842 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10843 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10844 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10845 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10846 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10847 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10850 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10852 switch (exp
->elts
[pc
- 1].opcode
)
10855 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10858 #define OP_DEFN(op, len, args, binop) \
10859 case op: *oplenp = len; *argsp = args; break;
10865 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10870 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10876 ada_op_name (enum exp_opcode opcode
)
10881 return op_name_standard (opcode
);
10883 #define OP_DEFN(op, len, args, binop) case op: return #op;
10888 return "OP_AGGREGATE";
10890 return "OP_CHOICES";
10896 /* As for operator_length, but assumes PC is pointing at the first
10897 element of the operator, and gives meaningful results only for the
10898 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10901 ada_forward_operator_length (struct expression
*exp
, int pc
,
10902 int *oplenp
, int *argsp
)
10904 switch (exp
->elts
[pc
].opcode
)
10907 *oplenp
= *argsp
= 0;
10910 #define OP_DEFN(op, len, args, binop) \
10911 case op: *oplenp = len; *argsp = args; break;
10917 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10922 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10928 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10929 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10937 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10939 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10944 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10948 /* Ada attributes ('Foo). */
10951 case OP_ATR_LENGTH
:
10955 case OP_ATR_MODULUS
:
10962 case UNOP_IN_RANGE
:
10964 /* XXX: gdb_sprint_host_address, type_sprint */
10965 fprintf_filtered (stream
, _("Type @"));
10966 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10967 fprintf_filtered (stream
, " (");
10968 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10969 fprintf_filtered (stream
, ")");
10971 case BINOP_IN_BOUNDS
:
10972 fprintf_filtered (stream
, " (%d)",
10973 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10975 case TERNOP_IN_RANGE
:
10980 case OP_DISCRETE_RANGE
:
10981 case OP_POSITIONAL
:
10988 char *name
= &exp
->elts
[elt
+ 2].string
;
10989 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10990 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10995 return dump_subexp_body_standard (exp
, stream
, elt
);
10999 for (i
= 0; i
< nargs
; i
+= 1)
11000 elt
= dump_subexp (exp
, stream
, elt
);
11005 /* The Ada extension of print_subexp (q.v.). */
11008 ada_print_subexp (struct expression
*exp
, int *pos
,
11009 struct ui_file
*stream
, enum precedence prec
)
11011 int oplen
, nargs
, i
;
11013 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
11015 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
11022 print_subexp_standard (exp
, pos
, stream
, prec
);
11026 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
11029 case BINOP_IN_BOUNDS
:
11030 /* XXX: sprint_subexp */
11031 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11032 fputs_filtered (" in ", stream
);
11033 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11034 fputs_filtered ("'range", stream
);
11035 if (exp
->elts
[pc
+ 1].longconst
> 1)
11036 fprintf_filtered (stream
, "(%ld)",
11037 (long) exp
->elts
[pc
+ 1].longconst
);
11040 case TERNOP_IN_RANGE
:
11041 if (prec
>= PREC_EQUAL
)
11042 fputs_filtered ("(", stream
);
11043 /* XXX: sprint_subexp */
11044 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11045 fputs_filtered (" in ", stream
);
11046 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11047 fputs_filtered (" .. ", stream
);
11048 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
11049 if (prec
>= PREC_EQUAL
)
11050 fputs_filtered (")", stream
);
11055 case OP_ATR_LENGTH
:
11059 case OP_ATR_MODULUS
:
11064 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
11066 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
11067 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
11071 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11072 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
11076 for (tem
= 1; tem
< nargs
; tem
+= 1)
11078 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
11079 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
11081 fputs_filtered (")", stream
);
11086 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
11087 fputs_filtered ("'(", stream
);
11088 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
11089 fputs_filtered (")", stream
);
11092 case UNOP_IN_RANGE
:
11093 /* XXX: sprint_subexp */
11094 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11095 fputs_filtered (" in ", stream
);
11096 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
11099 case OP_DISCRETE_RANGE
:
11100 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11101 fputs_filtered ("..", stream
);
11102 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11106 fputs_filtered ("others => ", stream
);
11107 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11111 for (i
= 0; i
< nargs
-1; i
+= 1)
11114 fputs_filtered ("|", stream
);
11115 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11117 fputs_filtered (" => ", stream
);
11118 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11121 case OP_POSITIONAL
:
11122 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11126 fputs_filtered ("(", stream
);
11127 for (i
= 0; i
< nargs
; i
+= 1)
11130 fputs_filtered (", ", stream
);
11131 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
11133 fputs_filtered (")", stream
);
11138 /* Table mapping opcodes into strings for printing operators
11139 and precedences of the operators. */
11141 static const struct op_print ada_op_print_tab
[] = {
11142 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
11143 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
11144 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
11145 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
11146 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
11147 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
11148 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
11149 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
11150 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
11151 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
11152 {">", BINOP_GTR
, PREC_ORDER
, 0},
11153 {"<", BINOP_LESS
, PREC_ORDER
, 0},
11154 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
11155 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
11156 {"+", BINOP_ADD
, PREC_ADD
, 0},
11157 {"-", BINOP_SUB
, PREC_ADD
, 0},
11158 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
11159 {"*", BINOP_MUL
, PREC_MUL
, 0},
11160 {"/", BINOP_DIV
, PREC_MUL
, 0},
11161 {"rem", BINOP_REM
, PREC_MUL
, 0},
11162 {"mod", BINOP_MOD
, PREC_MUL
, 0},
11163 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
11164 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
11165 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
11166 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
11167 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
11168 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
11169 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
11170 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
11171 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
11172 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
11176 enum ada_primitive_types
{
11177 ada_primitive_type_int
,
11178 ada_primitive_type_long
,
11179 ada_primitive_type_short
,
11180 ada_primitive_type_char
,
11181 ada_primitive_type_float
,
11182 ada_primitive_type_double
,
11183 ada_primitive_type_void
,
11184 ada_primitive_type_long_long
,
11185 ada_primitive_type_long_double
,
11186 ada_primitive_type_natural
,
11187 ada_primitive_type_positive
,
11188 ada_primitive_type_system_address
,
11189 nr_ada_primitive_types
11193 ada_language_arch_info (struct gdbarch
*gdbarch
,
11194 struct language_arch_info
*lai
)
11196 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
11197 lai
->primitive_type_vector
11198 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
11200 lai
->primitive_type_vector
[ada_primitive_type_int
] =
11201 init_type (TYPE_CODE_INT
,
11202 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
11203 0, "integer", (struct objfile
*) NULL
);
11204 lai
->primitive_type_vector
[ada_primitive_type_long
] =
11205 init_type (TYPE_CODE_INT
,
11206 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
11207 0, "long_integer", (struct objfile
*) NULL
);
11208 lai
->primitive_type_vector
[ada_primitive_type_short
] =
11209 init_type (TYPE_CODE_INT
,
11210 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
11211 0, "short_integer", (struct objfile
*) NULL
);
11212 lai
->string_char_type
=
11213 lai
->primitive_type_vector
[ada_primitive_type_char
] =
11214 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
11215 0, "character", (struct objfile
*) NULL
);
11216 lai
->primitive_type_vector
[ada_primitive_type_float
] =
11217 init_type (TYPE_CODE_FLT
,
11218 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
11219 0, "float", (struct objfile
*) NULL
);
11220 lai
->primitive_type_vector
[ada_primitive_type_double
] =
11221 init_type (TYPE_CODE_FLT
,
11222 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
11223 0, "long_float", (struct objfile
*) NULL
);
11224 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
11225 init_type (TYPE_CODE_INT
,
11226 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
11227 0, "long_long_integer", (struct objfile
*) NULL
);
11228 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
11229 init_type (TYPE_CODE_FLT
,
11230 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
11231 0, "long_long_float", (struct objfile
*) NULL
);
11232 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
11233 init_type (TYPE_CODE_INT
,
11234 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
11235 0, "natural", (struct objfile
*) NULL
);
11236 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
11237 init_type (TYPE_CODE_INT
,
11238 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
11239 0, "positive", (struct objfile
*) NULL
);
11240 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
11242 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
11243 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
11244 (struct objfile
*) NULL
));
11245 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
11246 = "system__address";
11248 lai
->bool_type_symbol
= NULL
;
11249 lai
->bool_type_default
= builtin
->builtin_bool
;
11252 /* Language vector */
11254 /* Not really used, but needed in the ada_language_defn. */
11257 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
11259 ada_emit_char (c
, type
, stream
, quoter
, 1);
11265 warnings_issued
= 0;
11266 return ada_parse ();
11269 static const struct exp_descriptor ada_exp_descriptor
= {
11271 ada_operator_length
,
11273 ada_dump_subexp_body
,
11274 ada_evaluate_subexp
11277 const struct language_defn ada_language_defn
= {
11278 "ada", /* Language name */
11282 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11283 that's not quite what this means. */
11285 macro_expansion_no
,
11286 &ada_exp_descriptor
,
11290 ada_printchar
, /* Print a character constant */
11291 ada_printstr
, /* Function to print string constant */
11292 emit_char
, /* Function to print single char (not used) */
11293 ada_print_type
, /* Print a type using appropriate syntax */
11294 default_print_typedef
, /* Print a typedef using appropriate syntax */
11295 ada_val_print
, /* Print a value using appropriate syntax */
11296 ada_value_print
, /* Print a top-level value */
11297 NULL
, /* Language specific skip_trampoline */
11298 NULL
, /* name_of_this */
11299 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11300 basic_lookup_transparent_type
, /* lookup_transparent_type */
11301 ada_la_decode
, /* Language specific symbol demangler */
11302 NULL
, /* Language specific class_name_from_physname */
11303 ada_op_print_tab
, /* expression operators for printing */
11304 0, /* c-style arrays */
11305 1, /* String lower bound */
11306 ada_get_gdb_completer_word_break_characters
,
11307 ada_make_symbol_completion_list
,
11308 ada_language_arch_info
,
11309 ada_print_array_index
,
11310 default_pass_by_reference
,
11315 /* Provide a prototype to silence -Wmissing-prototypes. */
11316 extern initialize_file_ftype _initialize_ada_language
;
11319 _initialize_ada_language (void)
11321 add_language (&ada_language_defn
);
11323 varsize_limit
= 65536;
11325 obstack_init (&symbol_list_obstack
);
11327 decoded_names_store
= htab_create_alloc
11328 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11329 NULL
, xcalloc
, xfree
);
11331 observer_attach_executable_changed (ada_executable_changed_observer
);