1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
60 /* Define whether or not the C operator '/' truncates towards zero for
61 differently signed operands (truncation direction is undefined in C).
62 Copied from valarith.c. */
64 #ifndef TRUNCATION_TOWARDS_ZERO
65 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
68 static void extract_string (CORE_ADDR addr
, char *buf
);
70 static void modify_general_field (char *, LONGEST
, int, int);
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_type (struct type
*);
84 static struct value
*desc_data (struct value
*);
86 static int fat_pntr_data_bitpos (struct type
*);
88 static int fat_pntr_data_bitsize (struct type
*);
90 static struct value
*desc_one_bound (struct value
*, int, int);
92 static int desc_bound_bitpos (struct type
*, int, int);
94 static int desc_bound_bitsize (struct type
*, int, int);
96 static struct type
*desc_index_type (struct type
*, int);
98 static int desc_arity (struct type
*);
100 static int ada_type_match (struct type
*, struct type
*, int);
102 static int ada_args_match (struct symbol
*, struct value
**, int);
104 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
106 static struct value
*convert_actual (struct value
*, struct type
*,
109 static struct value
*make_array_descriptor (struct type
*, struct value
*,
112 static void ada_add_block_symbols (struct obstack
*,
113 struct block
*, const char *,
114 domain_enum
, struct objfile
*, int);
116 static int is_nonfunction (struct ada_symbol_info
*, int);
118 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
121 static int num_defns_collected (struct obstack
*);
123 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
125 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
126 *, const char *, int,
129 static struct 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 (struct type
*, struct expression
*,
163 static struct value
*evaluate_subexp_type (struct expression
*, int *);
165 static int is_dynamic_field (struct type
*, int);
167 static struct type
*to_fixed_variant_branch_type (struct type
*,
169 CORE_ADDR
, struct value
*);
171 static struct type
*to_fixed_array_type (struct type
*, struct value
*, int);
173 static struct type
*to_fixed_range_type (char *, struct value
*,
176 static struct type
*to_static_fixed_type (struct type
*);
177 static struct type
*static_unwrap_type (struct type
*type
);
179 static struct value
*unwrap_value (struct value
*);
181 static struct type
*packed_array_type (struct type
*, long *);
183 static struct type
*decode_packed_array_type (struct type
*);
185 static struct value
*decode_packed_array (struct value
*);
187 static struct value
*value_subscript_packed (struct value
*, int,
190 static void move_bits (gdb_byte
*, int, const gdb_byte
*, int, int);
192 static struct value
*coerce_unspec_val_to_type (struct value
*,
195 static struct value
*get_var_value (char *, char *);
197 static int lesseq_defined_than (struct symbol
*, struct symbol
*);
199 static int equiv_types (struct type
*, struct type
*);
201 static int is_name_suffix (const char *);
203 static int wild_match (const char *, int, const char *);
205 static struct value
*ada_coerce_ref (struct value
*);
207 static LONGEST
pos_atr (struct value
*);
209 static struct value
*value_pos_atr (struct type
*, struct value
*);
211 static struct value
*value_val_atr (struct type
*, struct value
*);
213 static struct symbol
*standard_lookup (const char *, const struct block
*,
216 static struct value
*ada_search_struct_field (char *, struct value
*, int,
219 static struct value
*ada_value_primitive_field (struct value
*, int, int,
222 static int find_struct_field (char *, struct type
*, int,
223 struct type
**, int *, int *, int *, int *);
225 static struct value
*ada_to_fixed_value_create (struct type
*, CORE_ADDR
,
228 static struct value
*ada_to_fixed_value (struct value
*);
230 static int ada_resolve_function (struct ada_symbol_info
*, int,
231 struct value
**, int, const char *,
234 static struct value
*ada_coerce_to_simple_array (struct value
*);
236 static int ada_is_direct_array_type (struct type
*);
238 static void ada_language_arch_info (struct gdbarch
*,
239 struct language_arch_info
*);
241 static void check_size (const struct type
*);
243 static struct value
*ada_index_struct_field (int, struct value
*, int,
246 static struct value
*assign_aggregate (struct value
*, struct value
*,
247 struct expression
*, int *, enum noside
);
249 static void aggregate_assign_from_choices (struct value
*, struct value
*,
251 int *, LONGEST
*, int *,
252 int, LONGEST
, LONGEST
);
254 static void aggregate_assign_positional (struct value
*, struct value
*,
256 int *, LONGEST
*, int *, int,
260 static void aggregate_assign_others (struct value
*, struct value
*,
262 int *, LONGEST
*, int, LONGEST
, LONGEST
);
265 static void add_component_interval (LONGEST
, LONGEST
, LONGEST
*, int *, int);
268 static struct value
*ada_evaluate_subexp (struct type
*, struct expression
*,
271 static void ada_forward_operator_length (struct expression
*, int, int *,
276 /* Maximum-sized dynamic type. */
277 static unsigned int varsize_limit
;
279 /* FIXME: brobecker/2003-09-17: No longer a const because it is
280 returned by a function that does not return a const char *. */
281 static char *ada_completer_word_break_characters
=
283 " \t\n!@#%^&*()+=|~`}{[]\";:?/,-";
285 " \t\n!@#$%^&*()+=|~`}{[]\";:?/,-";
288 /* The name of the symbol to use to get the name of the main subprogram. */
289 static const char ADA_MAIN_PROGRAM_SYMBOL_NAME
[]
290 = "__gnat_ada_main_program_name";
292 /* Limit on the number of warnings to raise per expression evaluation. */
293 static int warning_limit
= 2;
295 /* Number of warning messages issued; reset to 0 by cleanups after
296 expression evaluation. */
297 static int warnings_issued
= 0;
299 static const char *known_runtime_file_name_patterns
[] = {
300 ADA_KNOWN_RUNTIME_FILE_NAME_PATTERNS NULL
303 static const char *known_auxiliary_function_name_patterns
[] = {
304 ADA_KNOWN_AUXILIARY_FUNCTION_NAME_PATTERNS NULL
307 /* Space for allocating results of ada_lookup_symbol_list. */
308 static struct obstack symbol_list_obstack
;
312 /* Given DECODED_NAME a string holding a symbol name in its
313 decoded form (ie using the Ada dotted notation), returns
314 its unqualified name. */
317 ada_unqualified_name (const char *decoded_name
)
319 const char *result
= strrchr (decoded_name
, '.');
322 result
++; /* Skip the dot... */
324 result
= decoded_name
;
329 /* Return a string starting with '<', followed by STR, and '>'.
330 The result is good until the next call. */
333 add_angle_brackets (const char *str
)
335 static char *result
= NULL
;
338 result
= xstrprintf ("<%s>", str
);
343 ada_get_gdb_completer_word_break_characters (void)
345 return ada_completer_word_break_characters
;
348 /* Print an array element index using the Ada syntax. */
351 ada_print_array_index (struct value
*index_value
, struct ui_file
*stream
,
352 const struct value_print_options
*options
)
354 LA_VALUE_PRINT (index_value
, stream
, options
);
355 fprintf_filtered (stream
, " => ");
358 /* Read the string located at ADDR from the inferior and store the
362 extract_string (CORE_ADDR addr
, char *buf
)
366 /* Loop, reading one byte at a time, until we reach the '\000'
367 end-of-string marker. */
370 target_read_memory (addr
+ char_index
* sizeof (char),
371 buf
+ char_index
* sizeof (char), sizeof (char));
374 while (buf
[char_index
- 1] != '\000');
377 /* Assuming VECT points to an array of *SIZE objects of size
378 ELEMENT_SIZE, grow it to contain at least MIN_SIZE objects,
379 updating *SIZE as necessary and returning the (new) array. */
382 grow_vect (void *vect
, size_t *size
, size_t min_size
, int element_size
)
384 if (*size
< min_size
)
387 if (*size
< min_size
)
389 vect
= xrealloc (vect
, *size
* element_size
);
394 /* True (non-zero) iff TARGET matches FIELD_NAME up to any trailing
395 suffix of FIELD_NAME beginning "___". */
398 field_name_match (const char *field_name
, const char *target
)
400 int len
= strlen (target
);
402 (strncmp (field_name
, target
, len
) == 0
403 && (field_name
[len
] == '\0'
404 || (strncmp (field_name
+ len
, "___", 3) == 0
405 && strcmp (field_name
+ strlen (field_name
) - 6,
410 /* Assuming TYPE is a TYPE_CODE_STRUCT or a TYPE_CODE_TYPDEF to
411 a TYPE_CODE_STRUCT, find the field whose name matches FIELD_NAME,
412 and return its index. This function also handles fields whose name
413 have ___ suffixes because the compiler sometimes alters their name
414 by adding such a suffix to represent fields with certain constraints.
415 If the field could not be found, return a negative number if
416 MAYBE_MISSING is set. Otherwise raise an error. */
419 ada_get_field_index (const struct type
*type
, const char *field_name
,
423 struct type
*struct_type
= check_typedef ((struct type
*) type
);
425 for (fieldno
= 0; fieldno
< TYPE_NFIELDS (struct_type
); fieldno
++)
426 if (field_name_match (TYPE_FIELD_NAME (struct_type
, fieldno
), field_name
))
430 error (_("Unable to find field %s in struct %s. Aborting"),
431 field_name
, TYPE_NAME (struct_type
));
436 /* The length of the prefix of NAME prior to any "___" suffix. */
439 ada_name_prefix_len (const char *name
)
445 const char *p
= strstr (name
, "___");
447 return strlen (name
);
453 /* Return non-zero if SUFFIX is a suffix of STR.
454 Return zero if STR is null. */
457 is_suffix (const char *str
, const char *suffix
)
463 len2
= strlen (suffix
);
464 return (len1
>= len2
&& strcmp (str
+ len1
- len2
, suffix
) == 0);
467 /* The contents of value VAL, treated as a value of type TYPE. The
468 result is an lval in memory if VAL is. */
470 static struct value
*
471 coerce_unspec_val_to_type (struct value
*val
, struct type
*type
)
473 type
= ada_check_typedef (type
);
474 if (value_type (val
) == type
)
478 struct value
*result
;
480 /* Make sure that the object size is not unreasonable before
481 trying to allocate some memory for it. */
484 result
= allocate_value (type
);
485 set_value_component_location (result
, val
);
486 set_value_bitsize (result
, value_bitsize (val
));
487 set_value_bitpos (result
, value_bitpos (val
));
488 VALUE_ADDRESS (result
) += value_offset (val
);
490 || TYPE_LENGTH (type
) > TYPE_LENGTH (value_type (val
)))
491 set_value_lazy (result
, 1);
493 memcpy (value_contents_raw (result
), value_contents (val
),
499 static const gdb_byte
*
500 cond_offset_host (const gdb_byte
*valaddr
, long offset
)
505 return valaddr
+ offset
;
509 cond_offset_target (CORE_ADDR address
, long offset
)
514 return address
+ offset
;
517 /* Issue a warning (as for the definition of warning in utils.c, but
518 with exactly one argument rather than ...), unless the limit on the
519 number of warnings has passed during the evaluation of the current
522 /* FIXME: cagney/2004-10-10: This function is mimicking the behavior
523 provided by "complaint". */
524 static void lim_warning (const char *format
, ...) ATTR_FORMAT (printf
, 1, 2);
527 lim_warning (const char *format
, ...)
530 va_start (args
, format
);
532 warnings_issued
+= 1;
533 if (warnings_issued
<= warning_limit
)
534 vwarning (format
, args
);
539 /* Issue an error if the size of an object of type T is unreasonable,
540 i.e. if it would be a bad idea to allocate a value of this type in
544 check_size (const struct type
*type
)
546 if (TYPE_LENGTH (type
) > varsize_limit
)
547 error (_("object size is larger than varsize-limit"));
551 /* Note: would have used MAX_OF_TYPE and MIN_OF_TYPE macros from
552 gdbtypes.h, but some of the necessary definitions in that file
553 seem to have gone missing. */
555 /* Maximum value of a SIZE-byte signed integer type. */
557 max_of_size (int size
)
559 LONGEST top_bit
= (LONGEST
) 1 << (size
* 8 - 2);
560 return top_bit
| (top_bit
- 1);
563 /* Minimum value of a SIZE-byte signed integer type. */
565 min_of_size (int size
)
567 return -max_of_size (size
) - 1;
570 /* Maximum value of a SIZE-byte unsigned integer type. */
572 umax_of_size (int size
)
574 ULONGEST top_bit
= (ULONGEST
) 1 << (size
* 8 - 1);
575 return top_bit
| (top_bit
- 1);
578 /* Maximum value of integral type T, as a signed quantity. */
580 max_of_type (struct type
*t
)
582 if (TYPE_UNSIGNED (t
))
583 return (LONGEST
) umax_of_size (TYPE_LENGTH (t
));
585 return max_of_size (TYPE_LENGTH (t
));
588 /* Minimum value of integral type T, as a signed quantity. */
590 min_of_type (struct type
*t
)
592 if (TYPE_UNSIGNED (t
))
595 return min_of_size (TYPE_LENGTH (t
));
598 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
600 discrete_type_high_bound (struct type
*type
)
602 switch (TYPE_CODE (type
))
604 case TYPE_CODE_RANGE
:
605 return TYPE_HIGH_BOUND (type
);
607 return TYPE_FIELD_BITPOS (type
, TYPE_NFIELDS (type
) - 1);
612 return max_of_type (type
);
614 error (_("Unexpected type in discrete_type_high_bound."));
618 /* The largest value in the domain of TYPE, a discrete type, as an integer. */
620 discrete_type_low_bound (struct type
*type
)
622 switch (TYPE_CODE (type
))
624 case TYPE_CODE_RANGE
:
625 return TYPE_LOW_BOUND (type
);
627 return TYPE_FIELD_BITPOS (type
, 0);
632 return min_of_type (type
);
634 error (_("Unexpected type in discrete_type_low_bound."));
638 /* The identity on non-range types. For range types, the underlying
639 non-range scalar type. */
642 base_type (struct type
*type
)
644 while (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
)
646 if (type
== TYPE_TARGET_TYPE (type
) || TYPE_TARGET_TYPE (type
) == NULL
)
648 type
= TYPE_TARGET_TYPE (type
);
654 /* Language Selection */
656 /* If the main program is in Ada, return language_ada, otherwise return LANG
657 (the main program is in Ada iif the adainit symbol is found).
659 MAIN_PST is not used. */
662 ada_update_initial_language (enum language lang
,
663 struct partial_symtab
*main_pst
)
665 if (lookup_minimal_symbol ("adainit", (const char *) NULL
,
666 (struct objfile
*) NULL
) != NULL
)
672 /* If the main procedure is written in Ada, then return its name.
673 The result is good until the next call. Return NULL if the main
674 procedure doesn't appear to be in Ada. */
679 struct minimal_symbol
*msym
;
680 static char *main_program_name
= NULL
;
682 /* For Ada, the name of the main procedure is stored in a specific
683 string constant, generated by the binder. Look for that symbol,
684 extract its address, and then read that string. If we didn't find
685 that string, then most probably the main procedure is not written
687 msym
= lookup_minimal_symbol (ADA_MAIN_PROGRAM_SYMBOL_NAME
, NULL
, NULL
);
691 CORE_ADDR main_program_name_addr
;
694 main_program_name_addr
= SYMBOL_VALUE_ADDRESS (msym
);
695 if (main_program_name_addr
== 0)
696 error (_("Invalid address for Ada main program name."));
698 xfree (main_program_name
);
699 target_read_string (main_program_name_addr
, &main_program_name
,
704 return main_program_name
;
707 /* The main procedure doesn't seem to be in Ada. */
713 /* Table of Ada operators and their GNAT-encoded names. Last entry is pair
716 const struct ada_opname_map ada_opname_table
[] = {
717 {"Oadd", "\"+\"", BINOP_ADD
},
718 {"Osubtract", "\"-\"", BINOP_SUB
},
719 {"Omultiply", "\"*\"", BINOP_MUL
},
720 {"Odivide", "\"/\"", BINOP_DIV
},
721 {"Omod", "\"mod\"", BINOP_MOD
},
722 {"Orem", "\"rem\"", BINOP_REM
},
723 {"Oexpon", "\"**\"", BINOP_EXP
},
724 {"Olt", "\"<\"", BINOP_LESS
},
725 {"Ole", "\"<=\"", BINOP_LEQ
},
726 {"Ogt", "\">\"", BINOP_GTR
},
727 {"Oge", "\">=\"", BINOP_GEQ
},
728 {"Oeq", "\"=\"", BINOP_EQUAL
},
729 {"One", "\"/=\"", BINOP_NOTEQUAL
},
730 {"Oand", "\"and\"", BINOP_BITWISE_AND
},
731 {"Oor", "\"or\"", BINOP_BITWISE_IOR
},
732 {"Oxor", "\"xor\"", BINOP_BITWISE_XOR
},
733 {"Oconcat", "\"&\"", BINOP_CONCAT
},
734 {"Oabs", "\"abs\"", UNOP_ABS
},
735 {"Onot", "\"not\"", UNOP_LOGICAL_NOT
},
736 {"Oadd", "\"+\"", UNOP_PLUS
},
737 {"Osubtract", "\"-\"", UNOP_NEG
},
741 /* The "encoded" form of DECODED, according to GNAT conventions.
742 The result is valid until the next call to ada_encode. */
745 ada_encode (const char *decoded
)
747 static char *encoding_buffer
= NULL
;
748 static size_t encoding_buffer_size
= 0;
755 GROW_VECT (encoding_buffer
, encoding_buffer_size
,
756 2 * strlen (decoded
) + 10);
759 for (p
= decoded
; *p
!= '\0'; p
+= 1)
763 encoding_buffer
[k
] = encoding_buffer
[k
+ 1] = '_';
768 const struct ada_opname_map
*mapping
;
770 for (mapping
= ada_opname_table
;
771 mapping
->encoded
!= NULL
772 && strncmp (mapping
->decoded
, p
,
773 strlen (mapping
->decoded
)) != 0; mapping
+= 1)
775 if (mapping
->encoded
== NULL
)
776 error (_("invalid Ada operator name: %s"), p
);
777 strcpy (encoding_buffer
+ k
, mapping
->encoded
);
778 k
+= strlen (mapping
->encoded
);
783 encoding_buffer
[k
] = *p
;
788 encoding_buffer
[k
] = '\0';
789 return encoding_buffer
;
792 /* Return NAME folded to lower case, or, if surrounded by single
793 quotes, unfolded, but with the quotes stripped away. Result good
797 ada_fold_name (const char *name
)
799 static char *fold_buffer
= NULL
;
800 static size_t fold_buffer_size
= 0;
802 int len
= strlen (name
);
803 GROW_VECT (fold_buffer
, fold_buffer_size
, len
+ 1);
807 strncpy (fold_buffer
, name
+ 1, len
- 2);
808 fold_buffer
[len
- 2] = '\000';
813 for (i
= 0; i
<= len
; i
+= 1)
814 fold_buffer
[i
] = tolower (name
[i
]);
820 /* Return nonzero if C is either a digit or a lowercase alphabet character. */
823 is_lower_alphanum (const char c
)
825 return (isdigit (c
) || (isalpha (c
) && islower (c
)));
828 /* Remove either of these suffixes:
833 These are suffixes introduced by the compiler for entities such as
834 nested subprogram for instance, in order to avoid name clashes.
835 They do not serve any purpose for the debugger. */
838 ada_remove_trailing_digits (const char *encoded
, int *len
)
840 if (*len
> 1 && isdigit (encoded
[*len
- 1]))
843 while (i
> 0 && isdigit (encoded
[i
]))
845 if (i
>= 0 && encoded
[i
] == '.')
847 else if (i
>= 0 && encoded
[i
] == '$')
849 else if (i
>= 2 && strncmp (encoded
+ i
- 2, "___", 3) == 0)
851 else if (i
>= 1 && strncmp (encoded
+ i
- 1, "__", 2) == 0)
856 /* Remove the suffix introduced by the compiler for protected object
860 ada_remove_po_subprogram_suffix (const char *encoded
, int *len
)
862 /* Remove trailing N. */
864 /* Protected entry subprograms are broken into two
865 separate subprograms: The first one is unprotected, and has
866 a 'N' suffix; the second is the protected version, and has
867 the 'P' suffix. The second calls the first one after handling
868 the protection. Since the P subprograms are internally generated,
869 we leave these names undecoded, giving the user a clue that this
870 entity is internal. */
873 && encoded
[*len
- 1] == 'N'
874 && (isdigit (encoded
[*len
- 2]) || islower (encoded
[*len
- 2])))
878 /* If ENCODED follows the GNAT entity encoding conventions, then return
879 the decoded form of ENCODED. Otherwise, return "<%s>" where "%s" is
882 The resulting string is valid until the next call of ada_decode.
883 If the string is unchanged by decoding, the original string pointer
887 ada_decode (const char *encoded
)
894 static char *decoding_buffer
= NULL
;
895 static size_t decoding_buffer_size
= 0;
897 /* The name of the Ada main procedure starts with "_ada_".
898 This prefix is not part of the decoded name, so skip this part
899 if we see this prefix. */
900 if (strncmp (encoded
, "_ada_", 5) == 0)
903 /* If the name starts with '_', then it is not a properly encoded
904 name, so do not attempt to decode it. Similarly, if the name
905 starts with '<', the name should not be decoded. */
906 if (encoded
[0] == '_' || encoded
[0] == '<')
909 len0
= strlen (encoded
);
911 ada_remove_trailing_digits (encoded
, &len0
);
912 ada_remove_po_subprogram_suffix (encoded
, &len0
);
914 /* Remove the ___X.* suffix if present. Do not forget to verify that
915 the suffix is located before the current "end" of ENCODED. We want
916 to avoid re-matching parts of ENCODED that have previously been
917 marked as discarded (by decrementing LEN0). */
918 p
= strstr (encoded
, "___");
919 if (p
!= NULL
&& p
- encoded
< len0
- 3)
927 /* Remove any trailing TKB suffix. It tells us that this symbol
928 is for the body of a task, but that information does not actually
929 appear in the decoded name. */
931 if (len0
> 3 && strncmp (encoded
+ len0
- 3, "TKB", 3) == 0)
934 /* Remove trailing "B" suffixes. */
935 /* FIXME: brobecker/2006-04-19: Not sure what this are used for... */
937 if (len0
> 1 && strncmp (encoded
+ len0
- 1, "B", 1) == 0)
940 /* Make decoded big enough for possible expansion by operator name. */
942 GROW_VECT (decoding_buffer
, decoding_buffer_size
, 2 * len0
+ 1);
943 decoded
= decoding_buffer
;
945 /* Remove trailing __{digit}+ or trailing ${digit}+. */
947 if (len0
> 1 && isdigit (encoded
[len0
- 1]))
950 while ((i
>= 0 && isdigit (encoded
[i
]))
951 || (i
>= 1 && encoded
[i
] == '_' && isdigit (encoded
[i
- 1])))
953 if (i
> 1 && encoded
[i
] == '_' && encoded
[i
- 1] == '_')
955 else if (encoded
[i
] == '$')
959 /* The first few characters that are not alphabetic are not part
960 of any encoding we use, so we can copy them over verbatim. */
962 for (i
= 0, j
= 0; i
< len0
&& !isalpha (encoded
[i
]); i
+= 1, j
+= 1)
963 decoded
[j
] = encoded
[i
];
968 /* Is this a symbol function? */
969 if (at_start_name
&& encoded
[i
] == 'O')
972 for (k
= 0; ada_opname_table
[k
].encoded
!= NULL
; k
+= 1)
974 int op_len
= strlen (ada_opname_table
[k
].encoded
);
975 if ((strncmp (ada_opname_table
[k
].encoded
+ 1, encoded
+ i
+ 1,
977 && !isalnum (encoded
[i
+ op_len
]))
979 strcpy (decoded
+ j
, ada_opname_table
[k
].decoded
);
982 j
+= strlen (ada_opname_table
[k
].decoded
);
986 if (ada_opname_table
[k
].encoded
!= NULL
)
991 /* Replace "TK__" with "__", which will eventually be translated
992 into "." (just below). */
994 if (i
< len0
- 4 && strncmp (encoded
+ i
, "TK__", 4) == 0)
997 /* Replace "__B_{DIGITS}+__" sequences by "__", which will eventually
998 be translated into "." (just below). These are internal names
999 generated for anonymous blocks inside which our symbol is nested. */
1001 if (len0
- i
> 5 && encoded
[i
] == '_' && encoded
[i
+1] == '_'
1002 && encoded
[i
+2] == 'B' && encoded
[i
+3] == '_'
1003 && isdigit (encoded
[i
+4]))
1007 while (k
< len0
&& isdigit (encoded
[k
]))
1008 k
++; /* Skip any extra digit. */
1010 /* Double-check that the "__B_{DIGITS}+" sequence we found
1011 is indeed followed by "__". */
1012 if (len0
- k
> 2 && encoded
[k
] == '_' && encoded
[k
+1] == '_')
1016 /* Remove _E{DIGITS}+[sb] */
1018 /* Just as for protected object subprograms, there are 2 categories
1019 of subprograms created by the compiler for each entry. The first
1020 one implements the actual entry code, and has a suffix following
1021 the convention above; the second one implements the barrier and
1022 uses the same convention as above, except that the 'E' is replaced
1025 Just as above, we do not decode the name of barrier functions
1026 to give the user a clue that the code he is debugging has been
1027 internally generated. */
1029 if (len0
- i
> 3 && encoded
[i
] == '_' && encoded
[i
+1] == 'E'
1030 && isdigit (encoded
[i
+2]))
1034 while (k
< len0
&& isdigit (encoded
[k
]))
1038 && (encoded
[k
] == 'b' || encoded
[k
] == 's'))
1041 /* Just as an extra precaution, make sure that if this
1042 suffix is followed by anything else, it is a '_'.
1043 Otherwise, we matched this sequence by accident. */
1045 || (k
< len0
&& encoded
[k
] == '_'))
1050 /* Remove trailing "N" in [a-z0-9]+N__. The N is added by
1051 the GNAT front-end in protected object subprograms. */
1054 && encoded
[i
] == 'N' && encoded
[i
+1] == '_' && encoded
[i
+2] == '_')
1056 /* Backtrack a bit up until we reach either the begining of
1057 the encoded name, or "__". Make sure that we only find
1058 digits or lowercase characters. */
1059 const char *ptr
= encoded
+ i
- 1;
1061 while (ptr
>= encoded
&& is_lower_alphanum (ptr
[0]))
1064 || (ptr
> encoded
&& ptr
[0] == '_' && ptr
[-1] == '_'))
1068 if (encoded
[i
] == 'X' && i
!= 0 && isalnum (encoded
[i
- 1]))
1070 /* This is a X[bn]* sequence not separated from the previous
1071 part of the name with a non-alpha-numeric character (in other
1072 words, immediately following an alpha-numeric character), then
1073 verify that it is placed at the end of the encoded name. If
1074 not, then the encoding is not valid and we should abort the
1075 decoding. Otherwise, just skip it, it is used in body-nested
1079 while (i
< len0
&& (encoded
[i
] == 'b' || encoded
[i
] == 'n'));
1083 else if (i
< len0
- 2 && encoded
[i
] == '_' && encoded
[i
+ 1] == '_')
1085 /* Replace '__' by '.'. */
1093 /* It's a character part of the decoded name, so just copy it
1095 decoded
[j
] = encoded
[i
];
1100 decoded
[j
] = '\000';
1102 /* Decoded names should never contain any uppercase character.
1103 Double-check this, and abort the decoding if we find one. */
1105 for (i
= 0; decoded
[i
] != '\0'; i
+= 1)
1106 if (isupper (decoded
[i
]) || decoded
[i
] == ' ')
1109 if (strcmp (decoded
, encoded
) == 0)
1115 GROW_VECT (decoding_buffer
, decoding_buffer_size
, strlen (encoded
) + 3);
1116 decoded
= decoding_buffer
;
1117 if (encoded
[0] == '<')
1118 strcpy (decoded
, encoded
);
1120 xsnprintf (decoded
, decoding_buffer_size
, "<%s>", encoded
);
1125 /* Table for keeping permanent unique copies of decoded names. Once
1126 allocated, names in this table are never released. While this is a
1127 storage leak, it should not be significant unless there are massive
1128 changes in the set of decoded names in successive versions of a
1129 symbol table loaded during a single session. */
1130 static struct htab
*decoded_names_store
;
1132 /* Returns the decoded name of GSYMBOL, as for ada_decode, caching it
1133 in the language-specific part of GSYMBOL, if it has not been
1134 previously computed. Tries to save the decoded name in the same
1135 obstack as GSYMBOL, if possible, and otherwise on the heap (so that,
1136 in any case, the decoded symbol has a lifetime at least that of
1138 The GSYMBOL parameter is "mutable" in the C++ sense: logically
1139 const, but nevertheless modified to a semantically equivalent form
1140 when a decoded name is cached in it.
1144 ada_decode_symbol (const struct general_symbol_info
*gsymbol
)
1147 (char **) &gsymbol
->language_specific
.cplus_specific
.demangled_name
;
1148 if (*resultp
== NULL
)
1150 const char *decoded
= ada_decode (gsymbol
->name
);
1151 if (gsymbol
->obj_section
!= NULL
)
1153 struct objfile
*objf
= gsymbol
->obj_section
->objfile
;
1154 *resultp
= obsavestring (decoded
, strlen (decoded
),
1155 &objf
->objfile_obstack
);
1157 /* Sometimes, we can't find a corresponding objfile, in which
1158 case, we put the result on the heap. Since we only decode
1159 when needed, we hope this usually does not cause a
1160 significant memory leak (FIXME). */
1161 if (*resultp
== NULL
)
1163 char **slot
= (char **) htab_find_slot (decoded_names_store
,
1166 *slot
= xstrdup (decoded
);
1175 ada_la_decode (const char *encoded
, int options
)
1177 return xstrdup (ada_decode (encoded
));
1180 /* Returns non-zero iff SYM_NAME matches NAME, ignoring any trailing
1181 suffixes that encode debugging information or leading _ada_ on
1182 SYM_NAME (see is_name_suffix commentary for the debugging
1183 information that is ignored). If WILD, then NAME need only match a
1184 suffix of SYM_NAME minus the same suffixes. Also returns 0 if
1185 either argument is NULL. */
1188 ada_match_name (const char *sym_name
, const char *name
, int wild
)
1190 if (sym_name
== NULL
|| name
== NULL
)
1193 return wild_match (name
, strlen (name
), sym_name
);
1196 int len_name
= strlen (name
);
1197 return (strncmp (sym_name
, name
, len_name
) == 0
1198 && is_name_suffix (sym_name
+ len_name
))
1199 || (strncmp (sym_name
, "_ada_", 5) == 0
1200 && strncmp (sym_name
+ 5, name
, len_name
) == 0
1201 && is_name_suffix (sym_name
+ len_name
+ 5));
1208 /* Names of MAX_ADA_DIMENS bounds in P_BOUNDS fields of array descriptors. */
1210 static char *bound_name
[] = {
1211 "LB0", "UB0", "LB1", "UB1", "LB2", "UB2", "LB3", "UB3",
1212 "LB4", "UB4", "LB5", "UB5", "LB6", "UB6", "LB7", "UB7"
1215 /* Maximum number of array dimensions we are prepared to handle. */
1217 #define MAX_ADA_DIMENS (sizeof(bound_name) / (2*sizeof(char *)))
1219 /* Like modify_field, but allows bitpos > wordlength. */
1222 modify_general_field (char *addr
, LONGEST fieldval
, int bitpos
, int bitsize
)
1224 modify_field (addr
+ bitpos
/ 8, fieldval
, bitpos
% 8, bitsize
);
1228 /* The desc_* routines return primitive portions of array descriptors
1231 /* The descriptor or array type, if any, indicated by TYPE; removes
1232 level of indirection, if needed. */
1234 static struct type
*
1235 desc_base_type (struct type
*type
)
1239 type
= ada_check_typedef (type
);
1241 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1242 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1243 return ada_check_typedef (TYPE_TARGET_TYPE (type
));
1248 /* True iff TYPE indicates a "thin" array pointer type. */
1251 is_thin_pntr (struct type
*type
)
1254 is_suffix (ada_type_name (desc_base_type (type
)), "___XUT")
1255 || is_suffix (ada_type_name (desc_base_type (type
)), "___XUT___XVE");
1258 /* The descriptor type for thin pointer type TYPE. */
1260 static struct type
*
1261 thin_descriptor_type (struct type
*type
)
1263 struct type
*base_type
= desc_base_type (type
);
1264 if (base_type
== NULL
)
1266 if (is_suffix (ada_type_name (base_type
), "___XVE"))
1270 struct type
*alt_type
= ada_find_parallel_type (base_type
, "___XVE");
1271 if (alt_type
== NULL
)
1278 /* A pointer to the array data for thin-pointer value VAL. */
1280 static struct value
*
1281 thin_data_pntr (struct value
*val
)
1283 struct type
*type
= value_type (val
);
1284 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1285 return value_cast (desc_data_type (thin_descriptor_type (type
)),
1288 return value_from_longest (desc_data_type (thin_descriptor_type (type
)),
1289 VALUE_ADDRESS (val
) + value_offset (val
));
1292 /* True iff TYPE indicates a "thick" array pointer type. */
1295 is_thick_pntr (struct type
*type
)
1297 type
= desc_base_type (type
);
1298 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1299 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1302 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1303 pointer to one, the type of its bounds data; otherwise, NULL. */
1305 static struct type
*
1306 desc_bounds_type (struct type
*type
)
1310 type
= desc_base_type (type
);
1314 else if (is_thin_pntr (type
))
1316 type
= thin_descriptor_type (type
);
1319 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1321 return ada_check_typedef (r
);
1323 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1325 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1327 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1332 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1333 one, a pointer to its bounds data. Otherwise NULL. */
1335 static struct value
*
1336 desc_bounds (struct value
*arr
)
1338 struct type
*type
= ada_check_typedef (value_type (arr
));
1339 if (is_thin_pntr (type
))
1341 struct type
*bounds_type
=
1342 desc_bounds_type (thin_descriptor_type (type
));
1345 if (bounds_type
== NULL
)
1346 error (_("Bad GNAT array descriptor"));
1348 /* NOTE: The following calculation is not really kosher, but
1349 since desc_type is an XVE-encoded type (and shouldn't be),
1350 the correct calculation is a real pain. FIXME (and fix GCC). */
1351 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1352 addr
= value_as_long (arr
);
1354 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1357 value_from_longest (lookup_pointer_type (bounds_type
),
1358 addr
- TYPE_LENGTH (bounds_type
));
1361 else if (is_thick_pntr (type
))
1362 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1363 _("Bad GNAT array descriptor"));
1368 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1369 position of the field containing the address of the bounds data. */
1372 fat_pntr_bounds_bitpos (struct type
*type
)
1374 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1377 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1378 size of the field containing the address of the bounds data. */
1381 fat_pntr_bounds_bitsize (struct type
*type
)
1383 type
= desc_base_type (type
);
1385 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1386 return TYPE_FIELD_BITSIZE (type
, 1);
1388 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1391 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1392 pointer to one, the type of its array data (a
1393 pointer-to-array-with-no-bounds type); otherwise, NULL. Use
1394 ada_type_of_array to get an array type with bounds data. */
1396 static struct type
*
1397 desc_data_type (struct type
*type
)
1399 type
= desc_base_type (type
);
1401 /* NOTE: The following is bogus; see comment in desc_bounds. */
1402 if (is_thin_pntr (type
))
1403 return lookup_pointer_type
1404 (desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1)));
1405 else if (is_thick_pntr (type
))
1406 return lookup_struct_elt_type (type
, "P_ARRAY", 1);
1411 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1414 static struct value
*
1415 desc_data (struct value
*arr
)
1417 struct type
*type
= value_type (arr
);
1418 if (is_thin_pntr (type
))
1419 return thin_data_pntr (arr
);
1420 else if (is_thick_pntr (type
))
1421 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1422 _("Bad GNAT array descriptor"));
1428 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1429 position of the field containing the address of the data. */
1432 fat_pntr_data_bitpos (struct type
*type
)
1434 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1437 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1438 size of the field containing the address of the data. */
1441 fat_pntr_data_bitsize (struct type
*type
)
1443 type
= desc_base_type (type
);
1445 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1446 return TYPE_FIELD_BITSIZE (type
, 0);
1448 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1451 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1452 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1453 bound, if WHICH is 1. The first bound is I=1. */
1455 static struct value
*
1456 desc_one_bound (struct value
*bounds
, int i
, int which
)
1458 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1459 _("Bad GNAT array descriptor bounds"));
1462 /* If BOUNDS is an array-bounds structure type, return the bit position
1463 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1464 bound, if WHICH is 1. The first bound is I=1. */
1467 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1469 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1472 /* If BOUNDS is an array-bounds structure type, return the bit field size
1473 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1474 bound, if WHICH is 1. The first bound is I=1. */
1477 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1479 type
= desc_base_type (type
);
1481 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1482 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1484 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1487 /* If TYPE is the type of an array-bounds structure, the type of its
1488 Ith bound (numbering from 1). Otherwise, NULL. */
1490 static struct type
*
1491 desc_index_type (struct type
*type
, int i
)
1493 type
= desc_base_type (type
);
1495 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1496 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1501 /* The number of index positions in the array-bounds type TYPE.
1502 Return 0 if TYPE is NULL. */
1505 desc_arity (struct type
*type
)
1507 type
= desc_base_type (type
);
1510 return TYPE_NFIELDS (type
) / 2;
1514 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1515 an array descriptor type (representing an unconstrained array
1519 ada_is_direct_array_type (struct type
*type
)
1523 type
= ada_check_typedef (type
);
1524 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1525 || ada_is_array_descriptor_type (type
));
1528 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1532 ada_is_array_type (struct type
*type
)
1535 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1536 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1537 type
= TYPE_TARGET_TYPE (type
);
1538 return ada_is_direct_array_type (type
);
1541 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1544 ada_is_simple_array_type (struct type
*type
)
1548 type
= ada_check_typedef (type
);
1549 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1550 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1551 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1554 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1557 ada_is_array_descriptor_type (struct type
*type
)
1559 struct type
*data_type
= desc_data_type (type
);
1563 type
= ada_check_typedef (type
);
1566 && ((TYPE_CODE (data_type
) == TYPE_CODE_PTR
1567 && TYPE_TARGET_TYPE (data_type
) != NULL
1568 && TYPE_CODE (TYPE_TARGET_TYPE (data_type
)) == TYPE_CODE_ARRAY
)
1569 || TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
)
1570 && desc_arity (desc_bounds_type (type
)) > 0;
1573 /* Non-zero iff type is a partially mal-formed GNAT array
1574 descriptor. FIXME: This is to compensate for some problems with
1575 debugging output from GNAT. Re-examine periodically to see if it
1579 ada_is_bogus_array_descriptor (struct type
*type
)
1583 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1584 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1585 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1586 && !ada_is_array_descriptor_type (type
);
1590 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1591 (fat pointer) returns the type of the array data described---specifically,
1592 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1593 in from the descriptor; otherwise, they are left unspecified. If
1594 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1595 returns NULL. The result is simply the type of ARR if ARR is not
1598 ada_type_of_array (struct value
*arr
, int bounds
)
1600 if (ada_is_packed_array_type (value_type (arr
)))
1601 return decode_packed_array_type (value_type (arr
));
1603 if (!ada_is_array_descriptor_type (value_type (arr
)))
1604 return value_type (arr
);
1608 ada_check_typedef (TYPE_TARGET_TYPE (desc_data_type (value_type (arr
))));
1611 struct type
*elt_type
;
1613 struct value
*descriptor
;
1614 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1616 elt_type
= ada_array_element_type (value_type (arr
), -1);
1617 arity
= ada_array_arity (value_type (arr
));
1619 if (elt_type
== NULL
|| arity
== 0)
1620 return ada_check_typedef (value_type (arr
));
1622 descriptor
= desc_bounds (arr
);
1623 if (value_as_long (descriptor
) == 0)
1627 struct type
*range_type
= alloc_type (objf
);
1628 struct type
*array_type
= alloc_type (objf
);
1629 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1630 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1633 create_range_type (range_type
, value_type (low
),
1634 longest_to_int (value_as_long (low
)),
1635 longest_to_int (value_as_long (high
)));
1636 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1639 return lookup_pointer_type (elt_type
);
1643 /* If ARR does not represent an array, returns ARR unchanged.
1644 Otherwise, returns either a standard GDB array with bounds set
1645 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1646 GDB array. Returns NULL if ARR is a null fat pointer. */
1649 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1651 if (ada_is_array_descriptor_type (value_type (arr
)))
1653 struct type
*arrType
= ada_type_of_array (arr
, 1);
1654 if (arrType
== NULL
)
1656 return value_cast (arrType
, value_copy (desc_data (arr
)));
1658 else if (ada_is_packed_array_type (value_type (arr
)))
1659 return decode_packed_array (arr
);
1664 /* If ARR does not represent an array, returns ARR unchanged.
1665 Otherwise, returns a standard GDB array describing ARR (which may
1666 be ARR itself if it already is in the proper form). */
1668 static struct value
*
1669 ada_coerce_to_simple_array (struct value
*arr
)
1671 if (ada_is_array_descriptor_type (value_type (arr
)))
1673 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1675 error (_("Bounds unavailable for null array pointer."));
1676 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1677 return value_ind (arrVal
);
1679 else if (ada_is_packed_array_type (value_type (arr
)))
1680 return decode_packed_array (arr
);
1685 /* If TYPE represents a GNAT array type, return it translated to an
1686 ordinary GDB array type (possibly with BITSIZE fields indicating
1687 packing). For other types, is the identity. */
1690 ada_coerce_to_simple_array_type (struct type
*type
)
1692 struct value
*mark
= value_mark ();
1693 struct value
*dummy
= value_from_longest (builtin_type_int32
, 0);
1694 struct type
*result
;
1695 deprecated_set_value_type (dummy
, type
);
1696 result
= ada_type_of_array (dummy
, 0);
1697 value_free_to_mark (mark
);
1701 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1704 ada_is_packed_array_type (struct type
*type
)
1708 type
= desc_base_type (type
);
1709 type
= ada_check_typedef (type
);
1711 ada_type_name (type
) != NULL
1712 && strstr (ada_type_name (type
), "___XP") != NULL
;
1715 /* Given that TYPE is a standard GDB array type with all bounds filled
1716 in, and that the element size of its ultimate scalar constituents
1717 (that is, either its elements, or, if it is an array of arrays, its
1718 elements' elements, etc.) is *ELT_BITS, return an identical type,
1719 but with the bit sizes of its elements (and those of any
1720 constituent arrays) recorded in the BITSIZE components of its
1721 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1724 static struct type
*
1725 packed_array_type (struct type
*type
, long *elt_bits
)
1727 struct type
*new_elt_type
;
1728 struct type
*new_type
;
1729 LONGEST low_bound
, high_bound
;
1731 type
= ada_check_typedef (type
);
1732 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1735 new_type
= alloc_type (TYPE_OBJFILE (type
));
1736 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1738 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1739 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1740 TYPE_NAME (new_type
) = ada_type_name (type
);
1742 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1743 &low_bound
, &high_bound
) < 0)
1744 low_bound
= high_bound
= 0;
1745 if (high_bound
< low_bound
)
1746 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1749 *elt_bits
*= (high_bound
- low_bound
+ 1);
1750 TYPE_LENGTH (new_type
) =
1751 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1754 TYPE_FIXED_INSTANCE (new_type
) = 1;
1758 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1760 static struct type
*
1761 decode_packed_array_type (struct type
*type
)
1764 struct block
**blocks
;
1765 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1768 struct type
*shadow_type
;
1773 raw_name
= ada_type_name (desc_base_type (type
));
1778 name
= (char *) alloca (strlen (raw_name
) + 1);
1779 tail
= strstr (raw_name
, "___XP");
1780 type
= desc_base_type (type
);
1782 memcpy (name
, raw_name
, tail
- raw_name
);
1783 name
[tail
- raw_name
] = '\000';
1785 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1786 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1788 lim_warning (_("could not find bounds information on packed array"));
1791 shadow_type
= SYMBOL_TYPE (sym
);
1792 CHECK_TYPEDEF (shadow_type
);
1794 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1796 lim_warning (_("could not understand bounds information on packed array"));
1800 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1803 (_("could not understand bit size information on packed array"));
1807 return packed_array_type (shadow_type
, &bits
);
1810 /* Given that ARR is a struct value *indicating a GNAT packed array,
1811 returns a simple array that denotes that array. Its type is a
1812 standard GDB array type except that the BITSIZEs of the array
1813 target types are set to the number of bits in each element, and the
1814 type length is set appropriately. */
1816 static struct value
*
1817 decode_packed_array (struct value
*arr
)
1821 arr
= ada_coerce_ref (arr
);
1822 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1823 arr
= ada_value_ind (arr
);
1825 type
= decode_packed_array_type (value_type (arr
));
1828 error (_("can't unpack array"));
1832 if (gdbarch_bits_big_endian (current_gdbarch
)
1833 && ada_is_modular_type (value_type (arr
)))
1835 /* This is a (right-justified) modular type representing a packed
1836 array with no wrapper. In order to interpret the value through
1837 the (left-justified) packed array type we just built, we must
1838 first left-justify it. */
1839 int bit_size
, bit_pos
;
1842 mod
= ada_modulus (value_type (arr
)) - 1;
1849 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1850 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1851 bit_pos
/ HOST_CHAR_BIT
,
1852 bit_pos
% HOST_CHAR_BIT
,
1857 return coerce_unspec_val_to_type (arr
, type
);
1861 /* The value of the element of packed array ARR at the ARITY indices
1862 given in IND. ARR must be a simple array. */
1864 static struct value
*
1865 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1868 int bits
, elt_off
, bit_off
;
1869 long elt_total_bit_offset
;
1870 struct type
*elt_type
;
1874 elt_total_bit_offset
= 0;
1875 elt_type
= ada_check_typedef (value_type (arr
));
1876 for (i
= 0; i
< arity
; i
+= 1)
1878 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1879 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1881 (_("attempt to do packed indexing of something other than a packed array"));
1884 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1885 LONGEST lowerbound
, upperbound
;
1888 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1890 lim_warning (_("don't know bounds of array"));
1891 lowerbound
= upperbound
= 0;
1894 idx
= pos_atr (ind
[i
]);
1895 if (idx
< lowerbound
|| idx
> upperbound
)
1896 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1897 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1898 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1899 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1902 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1903 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1905 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1910 /* Non-zero iff TYPE includes negative integer values. */
1913 has_negatives (struct type
*type
)
1915 switch (TYPE_CODE (type
))
1920 return !TYPE_UNSIGNED (type
);
1921 case TYPE_CODE_RANGE
:
1922 return TYPE_LOW_BOUND (type
) < 0;
1927 /* Create a new value of type TYPE from the contents of OBJ starting
1928 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1929 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1930 assigning through the result will set the field fetched from.
1931 VALADDR is ignored unless OBJ is NULL, in which case,
1932 VALADDR+OFFSET must address the start of storage containing the
1933 packed value. The value returned in this case is never an lval.
1934 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1937 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1938 long offset
, int bit_offset
, int bit_size
,
1942 int src
, /* Index into the source area */
1943 targ
, /* Index into the target area */
1944 srcBitsLeft
, /* Number of source bits left to move */
1945 nsrc
, ntarg
, /* Number of source and target bytes */
1946 unusedLS
, /* Number of bits in next significant
1947 byte of source that are unused */
1948 accumSize
; /* Number of meaningful bits in accum */
1949 unsigned char *bytes
; /* First byte containing data to unpack */
1950 unsigned char *unpacked
;
1951 unsigned long accum
; /* Staging area for bits being transferred */
1953 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1954 /* Transmit bytes from least to most significant; delta is the direction
1955 the indices move. */
1956 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
1958 type
= ada_check_typedef (type
);
1962 v
= allocate_value (type
);
1963 bytes
= (unsigned char *) (valaddr
+ offset
);
1965 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
1968 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
1969 bytes
= (unsigned char *) alloca (len
);
1970 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
1974 v
= allocate_value (type
);
1975 bytes
= (unsigned char *) value_contents (obj
) + offset
;
1980 set_value_component_location (v
, obj
);
1981 VALUE_ADDRESS (v
) += value_offset (obj
) + offset
;
1982 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
1983 set_value_bitsize (v
, bit_size
);
1984 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
1986 VALUE_ADDRESS (v
) += 1;
1987 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
1991 set_value_bitsize (v
, bit_size
);
1992 unpacked
= (unsigned char *) value_contents (v
);
1994 srcBitsLeft
= bit_size
;
1996 ntarg
= TYPE_LENGTH (type
);
2000 memset (unpacked
, 0, TYPE_LENGTH (type
));
2003 else if (gdbarch_bits_big_endian (current_gdbarch
))
2006 if (has_negatives (type
)
2007 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2011 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2014 switch (TYPE_CODE (type
))
2016 case TYPE_CODE_ARRAY
:
2017 case TYPE_CODE_UNION
:
2018 case TYPE_CODE_STRUCT
:
2019 /* Non-scalar values must be aligned at a byte boundary... */
2021 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2022 /* ... And are placed at the beginning (most-significant) bytes
2024 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2029 targ
= TYPE_LENGTH (type
) - 1;
2035 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2038 unusedLS
= bit_offset
;
2041 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2048 /* Mask for removing bits of the next source byte that are not
2049 part of the value. */
2050 unsigned int unusedMSMask
=
2051 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2053 /* Sign-extend bits for this byte. */
2054 unsigned int signMask
= sign
& ~unusedMSMask
;
2056 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2057 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2058 if (accumSize
>= HOST_CHAR_BIT
)
2060 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2061 accumSize
-= HOST_CHAR_BIT
;
2062 accum
>>= HOST_CHAR_BIT
;
2066 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2073 accum
|= sign
<< accumSize
;
2074 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2075 accumSize
-= HOST_CHAR_BIT
;
2076 accum
>>= HOST_CHAR_BIT
;
2084 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2085 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2088 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2089 int src_offset
, int n
)
2091 unsigned int accum
, mask
;
2092 int accum_bits
, chunk_size
;
2094 target
+= targ_offset
/ HOST_CHAR_BIT
;
2095 targ_offset
%= HOST_CHAR_BIT
;
2096 source
+= src_offset
/ HOST_CHAR_BIT
;
2097 src_offset
%= HOST_CHAR_BIT
;
2098 if (gdbarch_bits_big_endian (current_gdbarch
))
2100 accum
= (unsigned char) *source
;
2102 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2107 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2108 accum_bits
+= HOST_CHAR_BIT
;
2110 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2113 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2114 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2117 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2119 accum_bits
-= chunk_size
;
2126 accum
= (unsigned char) *source
>> src_offset
;
2128 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2132 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2133 accum_bits
+= HOST_CHAR_BIT
;
2135 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2138 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2139 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2141 accum_bits
-= chunk_size
;
2142 accum
>>= chunk_size
;
2149 /* Store the contents of FROMVAL into the location of TOVAL.
2150 Return a new value with the location of TOVAL and contents of
2151 FROMVAL. Handles assignment into packed fields that have
2152 floating-point or non-scalar types. */
2154 static struct value
*
2155 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2157 struct type
*type
= value_type (toval
);
2158 int bits
= value_bitsize (toval
);
2160 toval
= ada_coerce_ref (toval
);
2161 fromval
= ada_coerce_ref (fromval
);
2163 if (ada_is_direct_array_type (value_type (toval
)))
2164 toval
= ada_coerce_to_simple_array (toval
);
2165 if (ada_is_direct_array_type (value_type (fromval
)))
2166 fromval
= ada_coerce_to_simple_array (fromval
);
2168 if (!deprecated_value_modifiable (toval
))
2169 error (_("Left operand of assignment is not a modifiable lvalue."));
2171 if (VALUE_LVAL (toval
) == lval_memory
2173 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2174 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2176 int len
= (value_bitpos (toval
)
2177 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2179 char *buffer
= (char *) alloca (len
);
2181 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2183 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2184 fromval
= value_cast (type
, fromval
);
2186 read_memory (to_addr
, buffer
, len
);
2187 from_size
= value_bitsize (fromval
);
2189 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2190 if (gdbarch_bits_big_endian (current_gdbarch
))
2191 move_bits (buffer
, value_bitpos (toval
),
2192 value_contents (fromval
), from_size
- bits
, bits
);
2194 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2196 write_memory (to_addr
, buffer
, len
);
2197 if (deprecated_memory_changed_hook
)
2198 deprecated_memory_changed_hook (to_addr
, len
);
2200 val
= value_copy (toval
);
2201 memcpy (value_contents_raw (val
), value_contents (fromval
),
2202 TYPE_LENGTH (type
));
2203 deprecated_set_value_type (val
, type
);
2208 return value_assign (toval
, fromval
);
2212 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2213 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2214 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2215 * COMPONENT, and not the inferior's memory. The current contents
2216 * of COMPONENT are ignored. */
2218 value_assign_to_component (struct value
*container
, struct value
*component
,
2221 LONGEST offset_in_container
=
2222 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2223 - VALUE_ADDRESS (container
) - value_offset (container
));
2224 int bit_offset_in_container
=
2225 value_bitpos (component
) - value_bitpos (container
);
2228 val
= value_cast (value_type (component
), val
);
2230 if (value_bitsize (component
) == 0)
2231 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2233 bits
= value_bitsize (component
);
2235 if (gdbarch_bits_big_endian (current_gdbarch
))
2236 move_bits (value_contents_writeable (container
) + offset_in_container
,
2237 value_bitpos (container
) + bit_offset_in_container
,
2238 value_contents (val
),
2239 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2242 move_bits (value_contents_writeable (container
) + offset_in_container
,
2243 value_bitpos (container
) + bit_offset_in_container
,
2244 value_contents (val
), 0, bits
);
2247 /* The value of the element of array ARR at the ARITY indices given in IND.
2248 ARR may be either a simple array, GNAT array descriptor, or pointer
2252 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2256 struct type
*elt_type
;
2258 elt
= ada_coerce_to_simple_array (arr
);
2260 elt_type
= ada_check_typedef (value_type (elt
));
2261 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2262 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2263 return value_subscript_packed (elt
, arity
, ind
);
2265 for (k
= 0; k
< arity
; k
+= 1)
2267 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2268 error (_("too many subscripts (%d expected)"), k
);
2269 elt
= value_subscript (elt
, value_pos_atr (builtin_type_int32
, ind
[k
]));
2274 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2275 value of the element of *ARR at the ARITY indices given in
2276 IND. Does not read the entire array into memory. */
2278 static struct value
*
2279 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2284 for (k
= 0; k
< arity
; k
+= 1)
2289 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2290 error (_("too many subscripts (%d expected)"), k
);
2291 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2293 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2294 idx
= value_pos_atr (builtin_type_int32
, ind
[k
]);
2296 idx
= value_binop (idx
, value_from_longest (value_type (idx
), lwb
),
2299 arr
= value_ptradd (arr
, idx
);
2300 type
= TYPE_TARGET_TYPE (type
);
2303 return value_ind (arr
);
2306 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2307 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2308 elements starting at index LOW. The lower bound of this array is LOW, as
2310 static struct value
*
2311 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2314 CORE_ADDR base
= value_as_address (array_ptr
)
2315 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2316 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2317 struct type
*index_type
=
2318 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2320 struct type
*slice_type
=
2321 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2322 return value_at_lazy (slice_type
, base
);
2326 static struct value
*
2327 ada_value_slice (struct value
*array
, int low
, int high
)
2329 struct type
*type
= value_type (array
);
2330 struct type
*index_type
=
2331 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2332 struct type
*slice_type
=
2333 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2334 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2337 /* If type is a record type in the form of a standard GNAT array
2338 descriptor, returns the number of dimensions for type. If arr is a
2339 simple array, returns the number of "array of"s that prefix its
2340 type designation. Otherwise, returns 0. */
2343 ada_array_arity (struct type
*type
)
2350 type
= desc_base_type (type
);
2353 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2354 return desc_arity (desc_bounds_type (type
));
2356 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2359 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2365 /* If TYPE is a record type in the form of a standard GNAT array
2366 descriptor or a simple array type, returns the element type for
2367 TYPE after indexing by NINDICES indices, or by all indices if
2368 NINDICES is -1. Otherwise, returns NULL. */
2371 ada_array_element_type (struct type
*type
, int nindices
)
2373 type
= desc_base_type (type
);
2375 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2378 struct type
*p_array_type
;
2380 p_array_type
= desc_data_type (type
);
2382 k
= ada_array_arity (type
);
2386 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2387 if (nindices
>= 0 && k
> nindices
)
2389 p_array_type
= TYPE_TARGET_TYPE (p_array_type
);
2390 while (k
> 0 && p_array_type
!= NULL
)
2392 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2395 return p_array_type
;
2397 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2399 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2401 type
= TYPE_TARGET_TYPE (type
);
2410 /* The type of nth index in arrays of given type (n numbering from 1).
2411 Does not examine memory. */
2414 ada_index_type (struct type
*type
, int n
)
2416 struct type
*result_type
;
2418 type
= desc_base_type (type
);
2420 if (n
> ada_array_arity (type
))
2423 if (ada_is_simple_array_type (type
))
2427 for (i
= 1; i
< n
; i
+= 1)
2428 type
= TYPE_TARGET_TYPE (type
);
2429 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2430 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2431 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2432 perhaps stabsread.c would make more sense. */
2433 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2434 result_type
= builtin_type_int32
;
2439 return desc_index_type (desc_bounds_type (type
), n
);
2442 /* Given that arr is an array type, returns the lower bound of the
2443 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2444 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2445 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2446 bounds type. It works for other arrays with bounds supplied by
2447 run-time quantities other than discriminants. */
2450 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2451 struct type
** typep
)
2453 struct type
*type
, *index_type_desc
, *index_type
;
2456 gdb_assert (which
== 0 || which
== 1);
2458 if (ada_is_packed_array_type (arr_type
))
2459 arr_type
= decode_packed_array_type (arr_type
);
2461 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2464 *typep
= builtin_type_int32
;
2465 return (LONGEST
) - which
;
2468 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2469 type
= TYPE_TARGET_TYPE (arr_type
);
2473 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2474 if (index_type_desc
!= NULL
)
2475 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2476 NULL
, TYPE_OBJFILE (arr_type
));
2481 type
= TYPE_TARGET_TYPE (type
);
2485 index_type
= TYPE_INDEX_TYPE (type
);
2488 switch (TYPE_CODE (index_type
))
2490 case TYPE_CODE_RANGE
:
2491 retval
= which
== 0 ? TYPE_LOW_BOUND (index_type
)
2492 : TYPE_HIGH_BOUND (index_type
);
2494 case TYPE_CODE_ENUM
:
2495 retval
= which
== 0 ? TYPE_FIELD_BITPOS (index_type
, 0)
2496 : TYPE_FIELD_BITPOS (index_type
,
2497 TYPE_NFIELDS (index_type
) - 1);
2500 internal_error (__FILE__
, __LINE__
, _("invalid type code of index type"));
2504 *typep
= index_type
;
2509 /* Given that arr is an array value, returns the lower bound of the
2510 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2511 WHICH is 1. This routine will also work for arrays with bounds
2512 supplied by run-time quantities other than discriminants. */
2515 ada_array_bound (struct value
*arr
, int n
, int which
)
2517 struct type
*arr_type
= value_type (arr
);
2519 if (ada_is_packed_array_type (arr_type
))
2520 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2521 else if (ada_is_simple_array_type (arr_type
))
2524 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2525 return value_from_longest (type
, v
);
2528 return desc_one_bound (desc_bounds (arr
), n
, which
);
2531 /* Given that arr is an array value, returns the length of the
2532 nth index. This routine will also work for arrays with bounds
2533 supplied by run-time quantities other than discriminants.
2534 Does not work for arrays indexed by enumeration types with representation
2535 clauses at the moment. */
2537 static struct value
*
2538 ada_array_length (struct value
*arr
, int n
)
2540 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2542 if (ada_is_packed_array_type (arr_type
))
2543 return ada_array_length (decode_packed_array (arr
), n
);
2545 if (ada_is_simple_array_type (arr_type
))
2549 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2550 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2551 return value_from_longest (type
, v
);
2555 value_from_longest (builtin_type_int32
,
2556 value_as_long (desc_one_bound (desc_bounds (arr
),
2558 - value_as_long (desc_one_bound (desc_bounds (arr
),
2562 /* An empty array whose type is that of ARR_TYPE (an array type),
2563 with bounds LOW to LOW-1. */
2565 static struct value
*
2566 empty_array (struct type
*arr_type
, int low
)
2568 struct type
*index_type
=
2569 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2571 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2572 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2576 /* Name resolution */
2578 /* The "decoded" name for the user-definable Ada operator corresponding
2582 ada_decoded_op_name (enum exp_opcode op
)
2586 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2588 if (ada_opname_table
[i
].op
== op
)
2589 return ada_opname_table
[i
].decoded
;
2591 error (_("Could not find operator name for opcode"));
2595 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2596 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2597 undefined namespace) and converts operators that are
2598 user-defined into appropriate function calls. If CONTEXT_TYPE is
2599 non-null, it provides a preferred result type [at the moment, only
2600 type void has any effect---causing procedures to be preferred over
2601 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2602 return type is preferred. May change (expand) *EXP. */
2605 resolve (struct expression
**expp
, int void_context_p
)
2609 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2612 /* Resolve the operator of the subexpression beginning at
2613 position *POS of *EXPP. "Resolving" consists of replacing
2614 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2615 with their resolutions, replacing built-in operators with
2616 function calls to user-defined operators, where appropriate, and,
2617 when DEPROCEDURE_P is non-zero, converting function-valued variables
2618 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2619 are as in ada_resolve, above. */
2621 static struct value
*
2622 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2623 struct type
*context_type
)
2627 struct expression
*exp
; /* Convenience: == *expp. */
2628 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2629 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2630 int nargs
; /* Number of operands. */
2637 /* Pass one: resolve operands, saving their types and updating *pos,
2642 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2643 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2648 resolve_subexp (expp
, pos
, 0, NULL
);
2650 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2655 resolve_subexp (expp
, pos
, 0, NULL
);
2660 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2663 case OP_ATR_MODULUS
:
2673 case TERNOP_IN_RANGE
:
2674 case BINOP_IN_BOUNDS
:
2680 case OP_DISCRETE_RANGE
:
2682 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2691 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2693 resolve_subexp (expp
, pos
, 1, NULL
);
2695 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2712 case BINOP_LOGICAL_AND
:
2713 case BINOP_LOGICAL_OR
:
2714 case BINOP_BITWISE_AND
:
2715 case BINOP_BITWISE_IOR
:
2716 case BINOP_BITWISE_XOR
:
2719 case BINOP_NOTEQUAL
:
2726 case BINOP_SUBSCRIPT
:
2734 case UNOP_LOGICAL_NOT
:
2750 case OP_INTERNALVAR
:
2760 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2763 case STRUCTOP_STRUCT
:
2764 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2777 error (_("Unexpected operator during name resolution"));
2780 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2781 for (i
= 0; i
< nargs
; i
+= 1)
2782 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2786 /* Pass two: perform any resolution on principal operator. */
2793 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2795 struct ada_symbol_info
*candidates
;
2799 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2800 (exp
->elts
[pc
+ 2].symbol
),
2801 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2804 if (n_candidates
> 1)
2806 /* Types tend to get re-introduced locally, so if there
2807 are any local symbols that are not types, first filter
2810 for (j
= 0; j
< n_candidates
; j
+= 1)
2811 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2816 case LOC_REGPARM_ADDR
:
2824 if (j
< n_candidates
)
2827 while (j
< n_candidates
)
2829 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2831 candidates
[j
] = candidates
[n_candidates
- 1];
2840 if (n_candidates
== 0)
2841 error (_("No definition found for %s"),
2842 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2843 else if (n_candidates
== 1)
2845 else if (deprocedure_p
2846 && !is_nonfunction (candidates
, n_candidates
))
2848 i
= ada_resolve_function
2849 (candidates
, n_candidates
, NULL
, 0,
2850 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2853 error (_("Could not find a match for %s"),
2854 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2858 printf_filtered (_("Multiple matches for %s\n"),
2859 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2860 user_select_syms (candidates
, n_candidates
, 1);
2864 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2865 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2866 if (innermost_block
== NULL
2867 || contained_in (candidates
[i
].block
, innermost_block
))
2868 innermost_block
= candidates
[i
].block
;
2872 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2875 replace_operator_with_call (expp
, pc
, 0, 0,
2876 exp
->elts
[pc
+ 2].symbol
,
2877 exp
->elts
[pc
+ 1].block
);
2884 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2885 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2887 struct ada_symbol_info
*candidates
;
2891 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2892 (exp
->elts
[pc
+ 5].symbol
),
2893 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2895 if (n_candidates
== 1)
2899 i
= ada_resolve_function
2900 (candidates
, n_candidates
,
2902 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2905 error (_("Could not find a match for %s"),
2906 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2909 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2910 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2911 if (innermost_block
== NULL
2912 || contained_in (candidates
[i
].block
, innermost_block
))
2913 innermost_block
= candidates
[i
].block
;
2924 case BINOP_BITWISE_AND
:
2925 case BINOP_BITWISE_IOR
:
2926 case BINOP_BITWISE_XOR
:
2928 case BINOP_NOTEQUAL
:
2936 case UNOP_LOGICAL_NOT
:
2938 if (possible_user_operator_p (op
, argvec
))
2940 struct ada_symbol_info
*candidates
;
2944 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2945 (struct block
*) NULL
, VAR_DOMAIN
,
2947 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2948 ada_decoded_op_name (op
), NULL
);
2952 replace_operator_with_call (expp
, pc
, nargs
, 1,
2953 candidates
[i
].sym
, candidates
[i
].block
);
2964 return evaluate_subexp_type (exp
, pos
);
2967 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2968 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2969 a non-pointer. A type of 'void' (which is never a valid expression type)
2970 by convention matches anything. */
2971 /* The term "match" here is rather loose. The match is heuristic and
2972 liberal. FIXME: TOO liberal, in fact. */
2975 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
2977 ftype
= ada_check_typedef (ftype
);
2978 atype
= ada_check_typedef (atype
);
2980 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
2981 ftype
= TYPE_TARGET_TYPE (ftype
);
2982 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
2983 atype
= TYPE_TARGET_TYPE (atype
);
2985 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
2986 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
2989 switch (TYPE_CODE (ftype
))
2994 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
2995 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
2996 TYPE_TARGET_TYPE (atype
), 0);
2999 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3001 case TYPE_CODE_ENUM
:
3002 case TYPE_CODE_RANGE
:
3003 switch (TYPE_CODE (atype
))
3006 case TYPE_CODE_ENUM
:
3007 case TYPE_CODE_RANGE
:
3013 case TYPE_CODE_ARRAY
:
3014 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3015 || ada_is_array_descriptor_type (atype
));
3017 case TYPE_CODE_STRUCT
:
3018 if (ada_is_array_descriptor_type (ftype
))
3019 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3020 || ada_is_array_descriptor_type (atype
));
3022 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3023 && !ada_is_array_descriptor_type (atype
));
3025 case TYPE_CODE_UNION
:
3027 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3031 /* Return non-zero if the formals of FUNC "sufficiently match" the
3032 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3033 may also be an enumeral, in which case it is treated as a 0-
3034 argument function. */
3037 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3040 struct type
*func_type
= SYMBOL_TYPE (func
);
3042 if (SYMBOL_CLASS (func
) == LOC_CONST
3043 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3044 return (n_actuals
== 0);
3045 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3048 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3051 for (i
= 0; i
< n_actuals
; i
+= 1)
3053 if (actuals
[i
] == NULL
)
3057 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3058 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3060 if (!ada_type_match (ftype
, atype
, 1))
3067 /* False iff function type FUNC_TYPE definitely does not produce a value
3068 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3069 FUNC_TYPE is not a valid function type with a non-null return type
3070 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3073 return_match (struct type
*func_type
, struct type
*context_type
)
3075 struct type
*return_type
;
3077 if (func_type
== NULL
)
3080 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3081 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3083 return_type
= base_type (func_type
);
3084 if (return_type
== NULL
)
3087 context_type
= base_type (context_type
);
3089 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3090 return context_type
== NULL
|| return_type
== context_type
;
3091 else if (context_type
== NULL
)
3092 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3094 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3098 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3099 function (if any) that matches the types of the NARGS arguments in
3100 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3101 that returns that type, then eliminate matches that don't. If
3102 CONTEXT_TYPE is void and there is at least one match that does not
3103 return void, eliminate all matches that do.
3105 Asks the user if there is more than one match remaining. Returns -1
3106 if there is no such symbol or none is selected. NAME is used
3107 solely for messages. May re-arrange and modify SYMS in
3108 the process; the index returned is for the modified vector. */
3111 ada_resolve_function (struct ada_symbol_info syms
[],
3112 int nsyms
, struct value
**args
, int nargs
,
3113 const char *name
, struct type
*context_type
)
3116 int m
; /* Number of hits */
3117 struct type
*fallback
;
3118 struct type
*return_type
;
3120 return_type
= context_type
;
3121 if (context_type
== NULL
)
3122 fallback
= builtin_type_void
;
3129 for (k
= 0; k
< nsyms
; k
+= 1)
3131 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3133 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3134 && return_match (type
, return_type
))
3140 if (m
> 0 || return_type
== fallback
)
3143 return_type
= fallback
;
3150 printf_filtered (_("Multiple matches for %s\n"), name
);
3151 user_select_syms (syms
, m
, 1);
3157 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3158 in a listing of choices during disambiguation (see sort_choices, below).
3159 The idea is that overloadings of a subprogram name from the
3160 same package should sort in their source order. We settle for ordering
3161 such symbols by their trailing number (__N or $N). */
3164 encoded_ordered_before (char *N0
, char *N1
)
3168 else if (N0
== NULL
)
3173 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3175 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3177 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3178 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3182 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3185 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3187 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3188 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3190 return (strcmp (N0
, N1
) < 0);
3194 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3198 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3201 for (i
= 1; i
< nsyms
; i
+= 1)
3203 struct ada_symbol_info sym
= syms
[i
];
3206 for (j
= i
- 1; j
>= 0; j
-= 1)
3208 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3209 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3211 syms
[j
+ 1] = syms
[j
];
3217 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3218 by asking the user (if necessary), returning the number selected,
3219 and setting the first elements of SYMS items. Error if no symbols
3222 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3223 to be re-integrated one of these days. */
3226 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3229 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3231 int first_choice
= (max_results
== 1) ? 1 : 2;
3232 const char *select_mode
= multiple_symbols_select_mode ();
3234 if (max_results
< 1)
3235 error (_("Request to select 0 symbols!"));
3239 if (select_mode
== multiple_symbols_cancel
)
3241 canceled because the command is ambiguous\n\
3242 See set/show multiple-symbol."));
3244 /* If select_mode is "all", then return all possible symbols.
3245 Only do that if more than one symbol can be selected, of course.
3246 Otherwise, display the menu as usual. */
3247 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3250 printf_unfiltered (_("[0] cancel\n"));
3251 if (max_results
> 1)
3252 printf_unfiltered (_("[1] all\n"));
3254 sort_choices (syms
, nsyms
);
3256 for (i
= 0; i
< nsyms
; i
+= 1)
3258 if (syms
[i
].sym
== NULL
)
3261 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3263 struct symtab_and_line sal
=
3264 find_function_start_sal (syms
[i
].sym
, 1);
3265 if (sal
.symtab
== NULL
)
3266 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3268 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3271 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3272 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3273 sal
.symtab
->filename
, sal
.line
);
3279 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3280 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3281 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3282 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3284 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3285 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3287 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3288 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3289 else if (is_enumeral
3290 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3292 printf_unfiltered (("[%d] "), i
+ first_choice
);
3293 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3295 printf_unfiltered (_("'(%s) (enumeral)\n"),
3296 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3298 else if (symtab
!= NULL
)
3299 printf_unfiltered (is_enumeral
3300 ? _("[%d] %s in %s (enumeral)\n")
3301 : _("[%d] %s at %s:?\n"),
3303 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3306 printf_unfiltered (is_enumeral
3307 ? _("[%d] %s (enumeral)\n")
3308 : _("[%d] %s at ?\n"),
3310 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3314 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3317 for (i
= 0; i
< n_chosen
; i
+= 1)
3318 syms
[i
] = syms
[chosen
[i
]];
3323 /* Read and validate a set of numeric choices from the user in the
3324 range 0 .. N_CHOICES-1. Place the results in increasing
3325 order in CHOICES[0 .. N-1], and return N.
3327 The user types choices as a sequence of numbers on one line
3328 separated by blanks, encoding them as follows:
3330 + A choice of 0 means to cancel the selection, throwing an error.
3331 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3332 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3334 The user is not allowed to choose more than MAX_RESULTS values.
3336 ANNOTATION_SUFFIX, if present, is used to annotate the input
3337 prompts (for use with the -f switch). */
3340 get_selections (int *choices
, int n_choices
, int max_results
,
3341 int is_all_choice
, char *annotation_suffix
)
3346 int first_choice
= is_all_choice
? 2 : 1;
3348 prompt
= getenv ("PS2");
3352 args
= command_line_input (prompt
, 0, annotation_suffix
);
3355 error_no_arg (_("one or more choice numbers"));
3359 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3360 order, as given in args. Choices are validated. */
3366 while (isspace (*args
))
3368 if (*args
== '\0' && n_chosen
== 0)
3369 error_no_arg (_("one or more choice numbers"));
3370 else if (*args
== '\0')
3373 choice
= strtol (args
, &args2
, 10);
3374 if (args
== args2
|| choice
< 0
3375 || choice
> n_choices
+ first_choice
- 1)
3376 error (_("Argument must be choice number"));
3380 error (_("cancelled"));
3382 if (choice
< first_choice
)
3384 n_chosen
= n_choices
;
3385 for (j
= 0; j
< n_choices
; j
+= 1)
3389 choice
-= first_choice
;
3391 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3395 if (j
< 0 || choice
!= choices
[j
])
3398 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3399 choices
[k
+ 1] = choices
[k
];
3400 choices
[j
+ 1] = choice
;
3405 if (n_chosen
> max_results
)
3406 error (_("Select no more than %d of the above"), max_results
);
3411 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3412 on the function identified by SYM and BLOCK, and taking NARGS
3413 arguments. Update *EXPP as needed to hold more space. */
3416 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3417 int oplen
, struct symbol
*sym
,
3418 struct block
*block
)
3420 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3421 symbol, -oplen for operator being replaced). */
3422 struct expression
*newexp
= (struct expression
*)
3423 xmalloc (sizeof (struct expression
)
3424 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3425 struct expression
*exp
= *expp
;
3427 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3428 newexp
->language_defn
= exp
->language_defn
;
3429 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3430 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3431 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3433 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3434 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3436 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3437 newexp
->elts
[pc
+ 4].block
= block
;
3438 newexp
->elts
[pc
+ 5].symbol
= sym
;
3444 /* Type-class predicates */
3446 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3450 numeric_type_p (struct type
*type
)
3456 switch (TYPE_CODE (type
))
3461 case TYPE_CODE_RANGE
:
3462 return (type
== TYPE_TARGET_TYPE (type
)
3463 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3470 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3473 integer_type_p (struct type
*type
)
3479 switch (TYPE_CODE (type
))
3483 case TYPE_CODE_RANGE
:
3484 return (type
== TYPE_TARGET_TYPE (type
)
3485 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3492 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3495 scalar_type_p (struct type
*type
)
3501 switch (TYPE_CODE (type
))
3504 case TYPE_CODE_RANGE
:
3505 case TYPE_CODE_ENUM
:
3514 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3517 discrete_type_p (struct type
*type
)
3523 switch (TYPE_CODE (type
))
3526 case TYPE_CODE_RANGE
:
3527 case TYPE_CODE_ENUM
:
3535 /* Returns non-zero if OP with operands in the vector ARGS could be
3536 a user-defined function. Errs on the side of pre-defined operators
3537 (i.e., result 0). */
3540 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3542 struct type
*type0
=
3543 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3544 struct type
*type1
=
3545 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3559 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3563 case BINOP_BITWISE_AND
:
3564 case BINOP_BITWISE_IOR
:
3565 case BINOP_BITWISE_XOR
:
3566 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3569 case BINOP_NOTEQUAL
:
3574 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3577 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3580 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3584 case UNOP_LOGICAL_NOT
:
3586 return (!numeric_type_p (type0
));
3595 1. In the following, we assume that a renaming type's name may
3596 have an ___XD suffix. It would be nice if this went away at some
3598 2. We handle both the (old) purely type-based representation of
3599 renamings and the (new) variable-based encoding. At some point,
3600 it is devoutly to be hoped that the former goes away
3601 (FIXME: hilfinger-2007-07-09).
3602 3. Subprogram renamings are not implemented, although the XRS
3603 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3605 /* If SYM encodes a renaming,
3607 <renaming> renames <renamed entity>,
3609 sets *LEN to the length of the renamed entity's name,
3610 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3611 the string describing the subcomponent selected from the renamed
3612 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3613 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3614 are undefined). Otherwise, returns a value indicating the category
3615 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3616 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3617 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3618 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3619 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3620 may be NULL, in which case they are not assigned.
3622 [Currently, however, GCC does not generate subprogram renamings.] */
3624 enum ada_renaming_category
3625 ada_parse_renaming (struct symbol
*sym
,
3626 const char **renamed_entity
, int *len
,
3627 const char **renaming_expr
)
3629 enum ada_renaming_category kind
;
3634 return ADA_NOT_RENAMING
;
3635 switch (SYMBOL_CLASS (sym
))
3638 return ADA_NOT_RENAMING
;
3640 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3641 renamed_entity
, len
, renaming_expr
);
3645 case LOC_OPTIMIZED_OUT
:
3646 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3648 return ADA_NOT_RENAMING
;
3652 kind
= ADA_OBJECT_RENAMING
;
3656 kind
= ADA_EXCEPTION_RENAMING
;
3660 kind
= ADA_PACKAGE_RENAMING
;
3664 kind
= ADA_SUBPROGRAM_RENAMING
;
3668 return ADA_NOT_RENAMING
;
3672 if (renamed_entity
!= NULL
)
3673 *renamed_entity
= info
;
3674 suffix
= strstr (info
, "___XE");
3675 if (suffix
== NULL
|| suffix
== info
)
3676 return ADA_NOT_RENAMING
;
3678 *len
= strlen (info
) - strlen (suffix
);
3680 if (renaming_expr
!= NULL
)
3681 *renaming_expr
= suffix
;
3685 /* Assuming TYPE encodes a renaming according to the old encoding in
3686 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3687 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3688 ADA_NOT_RENAMING otherwise. */
3689 static enum ada_renaming_category
3690 parse_old_style_renaming (struct type
*type
,
3691 const char **renamed_entity
, int *len
,
3692 const char **renaming_expr
)
3694 enum ada_renaming_category kind
;
3699 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3700 || TYPE_NFIELDS (type
) != 1)
3701 return ADA_NOT_RENAMING
;
3703 name
= type_name_no_tag (type
);
3705 return ADA_NOT_RENAMING
;
3707 name
= strstr (name
, "___XR");
3709 return ADA_NOT_RENAMING
;
3714 kind
= ADA_OBJECT_RENAMING
;
3717 kind
= ADA_EXCEPTION_RENAMING
;
3720 kind
= ADA_PACKAGE_RENAMING
;
3723 kind
= ADA_SUBPROGRAM_RENAMING
;
3726 return ADA_NOT_RENAMING
;
3729 info
= TYPE_FIELD_NAME (type
, 0);
3731 return ADA_NOT_RENAMING
;
3732 if (renamed_entity
!= NULL
)
3733 *renamed_entity
= info
;
3734 suffix
= strstr (info
, "___XE");
3735 if (renaming_expr
!= NULL
)
3736 *renaming_expr
= suffix
+ 5;
3737 if (suffix
== NULL
|| suffix
== info
)
3738 return ADA_NOT_RENAMING
;
3740 *len
= suffix
- info
;
3746 /* Evaluation: Function Calls */
3748 /* Return an lvalue containing the value VAL. This is the identity on
3749 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3750 on the stack, using and updating *SP as the stack pointer, and
3751 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3753 static struct value
*
3754 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3756 if (! VALUE_LVAL (val
))
3758 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3760 /* The following is taken from the structure-return code in
3761 call_function_by_hand. FIXME: Therefore, some refactoring seems
3763 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3765 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3766 reserving sufficient space. */
3768 if (gdbarch_frame_align_p (current_gdbarch
))
3769 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3770 VALUE_ADDRESS (val
) = *sp
;
3774 /* Stack grows upward. Align the frame, allocate space, and
3775 then again, re-align the frame. */
3776 if (gdbarch_frame_align_p (current_gdbarch
))
3777 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3778 VALUE_ADDRESS (val
) = *sp
;
3780 if (gdbarch_frame_align_p (current_gdbarch
))
3781 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3783 VALUE_LVAL (val
) = lval_memory
;
3785 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3791 /* Return the value ACTUAL, converted to be an appropriate value for a
3792 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3793 allocating any necessary descriptors (fat pointers), or copies of
3794 values not residing in memory, updating it as needed. */
3797 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3800 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3801 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3802 struct type
*formal_target
=
3803 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3804 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3805 struct type
*actual_target
=
3806 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3807 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3809 if (ada_is_array_descriptor_type (formal_target
)
3810 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3811 return make_array_descriptor (formal_type
, actual
, sp
);
3812 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3813 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3815 struct value
*result
;
3816 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3817 && ada_is_array_descriptor_type (actual_target
))
3818 result
= desc_data (actual
);
3819 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3821 if (VALUE_LVAL (actual
) != lval_memory
)
3824 actual_type
= ada_check_typedef (value_type (actual
));
3825 val
= allocate_value (actual_type
);
3826 memcpy ((char *) value_contents_raw (val
),
3827 (char *) value_contents (actual
),
3828 TYPE_LENGTH (actual_type
));
3829 actual
= ensure_lval (val
, sp
);
3831 result
= value_addr (actual
);
3835 return value_cast_pointers (formal_type
, result
);
3837 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3838 return ada_value_ind (actual
);
3844 /* Push a descriptor of type TYPE for array value ARR on the stack at
3845 *SP, updating *SP to reflect the new descriptor. Return either
3846 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3847 to-descriptor type rather than a descriptor type), a struct value *
3848 representing a pointer to this descriptor. */
3850 static struct value
*
3851 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3853 struct type
*bounds_type
= desc_bounds_type (type
);
3854 struct type
*desc_type
= desc_base_type (type
);
3855 struct value
*descriptor
= allocate_value (desc_type
);
3856 struct value
*bounds
= allocate_value (bounds_type
);
3859 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3861 modify_general_field (value_contents_writeable (bounds
),
3862 value_as_long (ada_array_bound (arr
, i
, 0)),
3863 desc_bound_bitpos (bounds_type
, i
, 0),
3864 desc_bound_bitsize (bounds_type
, i
, 0));
3865 modify_general_field (value_contents_writeable (bounds
),
3866 value_as_long (ada_array_bound (arr
, i
, 1)),
3867 desc_bound_bitpos (bounds_type
, i
, 1),
3868 desc_bound_bitsize (bounds_type
, i
, 1));
3871 bounds
= ensure_lval (bounds
, sp
);
3873 modify_general_field (value_contents_writeable (descriptor
),
3874 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3875 fat_pntr_data_bitpos (desc_type
),
3876 fat_pntr_data_bitsize (desc_type
));
3878 modify_general_field (value_contents_writeable (descriptor
),
3879 VALUE_ADDRESS (bounds
),
3880 fat_pntr_bounds_bitpos (desc_type
),
3881 fat_pntr_bounds_bitsize (desc_type
));
3883 descriptor
= ensure_lval (descriptor
, sp
);
3885 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3886 return value_addr (descriptor
);
3891 /* Dummy definitions for an experimental caching module that is not
3892 * used in the public sources. */
3895 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3896 struct symbol
**sym
, struct block
**block
)
3902 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3903 struct block
*block
)
3909 /* Return the result of a standard (literal, C-like) lookup of NAME in
3910 given DOMAIN, visible from lexical block BLOCK. */
3912 static struct symbol
*
3913 standard_lookup (const char *name
, const struct block
*block
,
3918 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3920 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3921 cache_symbol (name
, domain
, sym
, block_found
);
3926 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3927 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3928 since they contend in overloading in the same way. */
3930 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3934 for (i
= 0; i
< n
; i
+= 1)
3935 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3936 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3937 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3943 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3944 struct types. Otherwise, they may not. */
3947 equiv_types (struct type
*type0
, struct type
*type1
)
3951 if (type0
== NULL
|| type1
== NULL
3952 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3954 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3955 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3956 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3957 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3963 /* True iff SYM0 represents the same entity as SYM1, or one that is
3964 no more defined than that of SYM1. */
3967 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
3971 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
3972 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
3975 switch (SYMBOL_CLASS (sym0
))
3981 struct type
*type0
= SYMBOL_TYPE (sym0
);
3982 struct type
*type1
= SYMBOL_TYPE (sym1
);
3983 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
3984 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
3985 int len0
= strlen (name0
);
3987 TYPE_CODE (type0
) == TYPE_CODE (type1
)
3988 && (equiv_types (type0
, type1
)
3989 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
3990 && strncmp (name1
+ len0
, "___XV", 5) == 0));
3993 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
3994 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4000 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4001 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4004 add_defn_to_vec (struct obstack
*obstackp
,
4006 struct block
*block
)
4010 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4012 /* Do not try to complete stub types, as the debugger is probably
4013 already scanning all symbols matching a certain name at the
4014 time when this function is called. Trying to replace the stub
4015 type by its associated full type will cause us to restart a scan
4016 which may lead to an infinite recursion. Instead, the client
4017 collecting the matching symbols will end up collecting several
4018 matches, with at least one of them complete. It can then filter
4019 out the stub ones if needed. */
4021 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4023 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4025 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4027 prevDefns
[i
].sym
= sym
;
4028 prevDefns
[i
].block
= block
;
4034 struct ada_symbol_info info
;
4038 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4042 /* Number of ada_symbol_info structures currently collected in
4043 current vector in *OBSTACKP. */
4046 num_defns_collected (struct obstack
*obstackp
)
4048 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4051 /* Vector of ada_symbol_info structures currently collected in current
4052 vector in *OBSTACKP. If FINISH, close off the vector and return
4053 its final address. */
4055 static struct ada_symbol_info
*
4056 defns_collected (struct obstack
*obstackp
, int finish
)
4059 return obstack_finish (obstackp
);
4061 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4064 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4065 Check the global symbols if GLOBAL, the static symbols if not.
4066 Do wild-card match if WILD. */
4068 static struct partial_symbol
*
4069 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4070 int global
, domain_enum
namespace, int wild
)
4072 struct partial_symbol
**start
;
4073 int name_len
= strlen (name
);
4074 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4083 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4084 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4088 for (i
= 0; i
< length
; i
+= 1)
4090 struct partial_symbol
*psym
= start
[i
];
4092 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4093 SYMBOL_DOMAIN (psym
), namespace)
4094 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4108 int M
= (U
+ i
) >> 1;
4109 struct partial_symbol
*psym
= start
[M
];
4110 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4112 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4114 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4125 struct partial_symbol
*psym
= start
[i
];
4127 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4128 SYMBOL_DOMAIN (psym
), namespace))
4130 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4138 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4152 int M
= (U
+ i
) >> 1;
4153 struct partial_symbol
*psym
= start
[M
];
4154 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4156 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4158 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4169 struct partial_symbol
*psym
= start
[i
];
4171 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4172 SYMBOL_DOMAIN (psym
), namespace))
4176 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4179 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4181 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4191 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4201 /* Return a minimal symbol matching NAME according to Ada decoding
4202 rules. Returns NULL if there is no such minimal symbol. Names
4203 prefixed with "standard__" are handled specially: "standard__" is
4204 first stripped off, and only static and global symbols are searched. */
4206 struct minimal_symbol
*
4207 ada_lookup_simple_minsym (const char *name
)
4209 struct objfile
*objfile
;
4210 struct minimal_symbol
*msymbol
;
4213 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4215 name
+= sizeof ("standard__") - 1;
4219 wild_match
= (strstr (name
, "__") == NULL
);
4221 ALL_MSYMBOLS (objfile
, msymbol
)
4223 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4224 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4231 /* For all subprograms that statically enclose the subprogram of the
4232 selected frame, add symbols matching identifier NAME in DOMAIN
4233 and their blocks to the list of data in OBSTACKP, as for
4234 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4238 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4239 const char *name
, domain_enum
namespace,
4244 /* True if TYPE is definitely an artificial type supplied to a symbol
4245 for which no debugging information was given in the symbol file. */
4248 is_nondebugging_type (struct type
*type
)
4250 char *name
= ada_type_name (type
);
4251 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4254 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4255 duplicate other symbols in the list (The only case I know of where
4256 this happens is when object files containing stabs-in-ecoff are
4257 linked with files containing ordinary ecoff debugging symbols (or no
4258 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4259 Returns the number of items in the modified list. */
4262 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4271 /* If two symbols have the same name and one of them is a stub type,
4272 the get rid of the stub. */
4274 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4275 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4277 for (j
= 0; j
< nsyms
; j
++)
4280 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4281 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4282 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4283 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4288 /* Two symbols with the same name, same class and same address
4289 should be identical. */
4291 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4292 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4293 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4295 for (j
= 0; j
< nsyms
; j
+= 1)
4298 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4299 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4300 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4301 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4302 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4303 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4310 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4311 syms
[j
- 1] = syms
[j
];
4320 /* Given a type that corresponds to a renaming entity, use the type name
4321 to extract the scope (package name or function name, fully qualified,
4322 and following the GNAT encoding convention) where this renaming has been
4323 defined. The string returned needs to be deallocated after use. */
4326 xget_renaming_scope (struct type
*renaming_type
)
4328 /* The renaming types adhere to the following convention:
4329 <scope>__<rename>___<XR extension>.
4330 So, to extract the scope, we search for the "___XR" extension,
4331 and then backtrack until we find the first "__". */
4333 const char *name
= type_name_no_tag (renaming_type
);
4334 char *suffix
= strstr (name
, "___XR");
4339 /* Now, backtrack a bit until we find the first "__". Start looking
4340 at suffix - 3, as the <rename> part is at least one character long. */
4342 for (last
= suffix
- 3; last
> name
; last
--)
4343 if (last
[0] == '_' && last
[1] == '_')
4346 /* Make a copy of scope and return it. */
4348 scope_len
= last
- name
;
4349 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4351 strncpy (scope
, name
, scope_len
);
4352 scope
[scope_len
] = '\0';
4357 /* Return nonzero if NAME corresponds to a package name. */
4360 is_package_name (const char *name
)
4362 /* Here, We take advantage of the fact that no symbols are generated
4363 for packages, while symbols are generated for each function.
4364 So the condition for NAME represent a package becomes equivalent
4365 to NAME not existing in our list of symbols. There is only one
4366 small complication with library-level functions (see below). */
4370 /* If it is a function that has not been defined at library level,
4371 then we should be able to look it up in the symbols. */
4372 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4375 /* Library-level function names start with "_ada_". See if function
4376 "_ada_" followed by NAME can be found. */
4378 /* Do a quick check that NAME does not contain "__", since library-level
4379 functions names cannot contain "__" in them. */
4380 if (strstr (name
, "__") != NULL
)
4383 fun_name
= xstrprintf ("_ada_%s", name
);
4385 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4388 /* Return nonzero if SYM corresponds to a renaming entity that is
4389 not visible from FUNCTION_NAME. */
4392 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4396 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4399 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4401 make_cleanup (xfree
, scope
);
4403 /* If the rename has been defined in a package, then it is visible. */
4404 if (is_package_name (scope
))
4407 /* Check that the rename is in the current function scope by checking
4408 that its name starts with SCOPE. */
4410 /* If the function name starts with "_ada_", it means that it is
4411 a library-level function. Strip this prefix before doing the
4412 comparison, as the encoding for the renaming does not contain
4414 if (strncmp (function_name
, "_ada_", 5) == 0)
4417 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4420 /* Remove entries from SYMS that corresponds to a renaming entity that
4421 is not visible from the function associated with CURRENT_BLOCK or
4422 that is superfluous due to the presence of more specific renaming
4423 information. Places surviving symbols in the initial entries of
4424 SYMS and returns the number of surviving symbols.
4427 First, in cases where an object renaming is implemented as a
4428 reference variable, GNAT may produce both the actual reference
4429 variable and the renaming encoding. In this case, we discard the
4432 Second, GNAT emits a type following a specified encoding for each renaming
4433 entity. Unfortunately, STABS currently does not support the definition
4434 of types that are local to a given lexical block, so all renamings types
4435 are emitted at library level. As a consequence, if an application
4436 contains two renaming entities using the same name, and a user tries to
4437 print the value of one of these entities, the result of the ada symbol
4438 lookup will also contain the wrong renaming type.
4440 This function partially covers for this limitation by attempting to
4441 remove from the SYMS list renaming symbols that should be visible
4442 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4443 method with the current information available. The implementation
4444 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4446 - When the user tries to print a rename in a function while there
4447 is another rename entity defined in a package: Normally, the
4448 rename in the function has precedence over the rename in the
4449 package, so the latter should be removed from the list. This is
4450 currently not the case.
4452 - This function will incorrectly remove valid renames if
4453 the CURRENT_BLOCK corresponds to a function which symbol name
4454 has been changed by an "Export" pragma. As a consequence,
4455 the user will be unable to print such rename entities. */
4458 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4459 int nsyms
, const struct block
*current_block
)
4461 struct symbol
*current_function
;
4462 char *current_function_name
;
4464 int is_new_style_renaming
;
4466 /* If there is both a renaming foo___XR... encoded as a variable and
4467 a simple variable foo in the same block, discard the latter.
4468 First, zero out such symbols, then compress. */
4469 is_new_style_renaming
= 0;
4470 for (i
= 0; i
< nsyms
; i
+= 1)
4472 struct symbol
*sym
= syms
[i
].sym
;
4473 struct block
*block
= syms
[i
].block
;
4477 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4479 name
= SYMBOL_LINKAGE_NAME (sym
);
4480 suffix
= strstr (name
, "___XR");
4484 int name_len
= suffix
- name
;
4486 is_new_style_renaming
= 1;
4487 for (j
= 0; j
< nsyms
; j
+= 1)
4488 if (i
!= j
&& syms
[j
].sym
!= NULL
4489 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4491 && block
== syms
[j
].block
)
4495 if (is_new_style_renaming
)
4499 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4500 if (syms
[j
].sym
!= NULL
)
4508 /* Extract the function name associated to CURRENT_BLOCK.
4509 Abort if unable to do so. */
4511 if (current_block
== NULL
)
4514 current_function
= block_linkage_function (current_block
);
4515 if (current_function
== NULL
)
4518 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4519 if (current_function_name
== NULL
)
4522 /* Check each of the symbols, and remove it from the list if it is
4523 a type corresponding to a renaming that is out of the scope of
4524 the current block. */
4529 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4530 == ADA_OBJECT_RENAMING
4531 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4534 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4535 syms
[j
- 1] = syms
[j
];
4545 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4546 whose name and domain match NAME and DOMAIN respectively.
4547 If no match was found, then extend the search to "enclosing"
4548 routines (in other words, if we're inside a nested function,
4549 search the symbols defined inside the enclosing functions).
4551 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4554 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4555 struct block
*block
, domain_enum domain
,
4558 int block_depth
= 0;
4560 while (block
!= NULL
)
4563 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4565 /* If we found a non-function match, assume that's the one. */
4566 if (is_nonfunction (defns_collected (obstackp
, 0),
4567 num_defns_collected (obstackp
)))
4570 block
= BLOCK_SUPERBLOCK (block
);
4573 /* If no luck so far, try to find NAME as a local symbol in some lexically
4574 enclosing subprogram. */
4575 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4576 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4579 /* Add to OBSTACKP all non-local symbols whose name and domain match
4580 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4581 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4584 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4585 domain_enum domain
, int global
,
4588 struct objfile
*objfile
;
4589 struct partial_symtab
*ps
;
4591 ALL_PSYMTABS (objfile
, ps
)
4595 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4597 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4598 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4600 if (s
== NULL
|| !s
->primary
)
4602 ada_add_block_symbols (obstackp
,
4603 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4604 name
, domain
, objfile
, wild_match
);
4609 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4610 scope and in global scopes, returning the number of matches. Sets
4611 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4612 indicating the symbols found and the blocks and symbol tables (if
4613 any) in which they were found. This vector are transient---good only to
4614 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4615 symbol match within the nest of blocks whose innermost member is BLOCK0,
4616 is the one match returned (no other matches in that or
4617 enclosing blocks is returned). If there are any matches in or
4618 surrounding BLOCK0, then these alone are returned. Otherwise, the
4619 search extends to global and file-scope (static) symbol tables.
4620 Names prefixed with "standard__" are handled specially: "standard__"
4621 is first stripped off, and only static and global symbols are searched. */
4624 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4625 domain_enum
namespace,
4626 struct ada_symbol_info
**results
)
4629 struct block
*block
;
4635 obstack_free (&symbol_list_obstack
, NULL
);
4636 obstack_init (&symbol_list_obstack
);
4640 /* Search specified block and its superiors. */
4642 wild_match
= (strstr (name0
, "__") == NULL
);
4644 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4645 needed, but adding const will
4646 have a cascade effect. */
4648 /* Special case: If the user specifies a symbol name inside package
4649 Standard, do a non-wild matching of the symbol name without
4650 the "standard__" prefix. This was primarily introduced in order
4651 to allow the user to specifically access the standard exceptions
4652 using, for instance, Standard.Constraint_Error when Constraint_Error
4653 is ambiguous (due to the user defining its own Constraint_Error
4654 entity inside its program). */
4655 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4659 name
= name0
+ sizeof ("standard__") - 1;
4662 /* Check the non-global symbols. If we have ANY match, then we're done. */
4664 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4666 if (num_defns_collected (&symbol_list_obstack
) > 0)
4669 /* No non-global symbols found. Check our cache to see if we have
4670 already performed this search before. If we have, then return
4674 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4677 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4681 /* Search symbols from all global blocks. */
4683 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4686 /* Now add symbols from all per-file blocks if we've gotten no hits
4687 (not strictly correct, but perhaps better than an error). */
4689 if (num_defns_collected (&symbol_list_obstack
) == 0)
4690 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4694 ndefns
= num_defns_collected (&symbol_list_obstack
);
4695 *results
= defns_collected (&symbol_list_obstack
, 1);
4697 ndefns
= remove_extra_symbols (*results
, ndefns
);
4700 cache_symbol (name0
, namespace, NULL
, NULL
);
4702 if (ndefns
== 1 && cacheIfUnique
)
4703 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4705 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4711 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4712 domain_enum
namespace, struct block
**block_found
)
4714 struct ada_symbol_info
*candidates
;
4717 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4719 if (n_candidates
== 0)
4722 if (block_found
!= NULL
)
4723 *block_found
= candidates
[0].block
;
4725 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4728 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4729 scope and in global scopes, or NULL if none. NAME is folded and
4730 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4731 choosing the first symbol if there are multiple choices.
4732 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4733 table in which the symbol was found (in both cases, these
4734 assignments occur only if the pointers are non-null). */
4736 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4737 domain_enum
namespace, int *is_a_field_of_this
)
4739 if (is_a_field_of_this
!= NULL
)
4740 *is_a_field_of_this
= 0;
4743 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4744 block0
, namespace, NULL
);
4747 static struct symbol
*
4748 ada_lookup_symbol_nonlocal (const char *name
,
4749 const char *linkage_name
,
4750 const struct block
*block
,
4751 const domain_enum domain
)
4753 if (linkage_name
== NULL
)
4754 linkage_name
= name
;
4755 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4760 /* True iff STR is a possible encoded suffix of a normal Ada name
4761 that is to be ignored for matching purposes. Suffixes of parallel
4762 names (e.g., XVE) are not included here. Currently, the possible suffixes
4763 are given by any of the regular expressions:
4765 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4766 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4767 _E[0-9]+[bs]$ [protected object entry suffixes]
4768 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4770 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4771 match is performed. This sequence is used to differentiate homonyms,
4772 is an optional part of a valid name suffix. */
4775 is_name_suffix (const char *str
)
4778 const char *matching
;
4779 const int len
= strlen (str
);
4781 /* Skip optional leading __[0-9]+. */
4783 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4786 while (isdigit (str
[0]))
4792 if (str
[0] == '.' || str
[0] == '$')
4795 while (isdigit (matching
[0]))
4797 if (matching
[0] == '\0')
4803 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4806 while (isdigit (matching
[0]))
4808 if (matching
[0] == '\0')
4813 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4814 with a N at the end. Unfortunately, the compiler uses the same
4815 convention for other internal types it creates. So treating
4816 all entity names that end with an "N" as a name suffix causes
4817 some regressions. For instance, consider the case of an enumerated
4818 type. To support the 'Image attribute, it creates an array whose
4820 Having a single character like this as a suffix carrying some
4821 information is a bit risky. Perhaps we should change the encoding
4822 to be something like "_N" instead. In the meantime, do not do
4823 the following check. */
4824 /* Protected Object Subprograms */
4825 if (len
== 1 && str
[0] == 'N')
4830 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4833 while (isdigit (matching
[0]))
4835 if ((matching
[0] == 'b' || matching
[0] == 's')
4836 && matching
[1] == '\0')
4840 /* ??? We should not modify STR directly, as we are doing below. This
4841 is fine in this case, but may become problematic later if we find
4842 that this alternative did not work, and want to try matching
4843 another one from the begining of STR. Since we modified it, we
4844 won't be able to find the begining of the string anymore! */
4848 while (str
[0] != '_' && str
[0] != '\0')
4850 if (str
[0] != 'n' && str
[0] != 'b')
4856 if (str
[0] == '\000')
4861 if (str
[1] != '_' || str
[2] == '\000')
4865 if (strcmp (str
+ 3, "JM") == 0)
4867 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4868 the LJM suffix in favor of the JM one. But we will
4869 still accept LJM as a valid suffix for a reasonable
4870 amount of time, just to allow ourselves to debug programs
4871 compiled using an older version of GNAT. */
4872 if (strcmp (str
+ 3, "LJM") == 0)
4876 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4877 || str
[4] == 'U' || str
[4] == 'P')
4879 if (str
[4] == 'R' && str
[5] != 'T')
4883 if (!isdigit (str
[2]))
4885 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4886 if (!isdigit (str
[k
]) && str
[k
] != '_')
4890 if (str
[0] == '$' && isdigit (str
[1]))
4892 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4893 if (!isdigit (str
[k
]) && str
[k
] != '_')
4900 /* Return non-zero if the string starting at NAME and ending before
4901 NAME_END contains no capital letters. */
4904 is_valid_name_for_wild_match (const char *name0
)
4906 const char *decoded_name
= ada_decode (name0
);
4909 /* If the decoded name starts with an angle bracket, it means that
4910 NAME0 does not follow the GNAT encoding format. It should then
4911 not be allowed as a possible wild match. */
4912 if (decoded_name
[0] == '<')
4915 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4916 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4922 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4923 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4924 informational suffixes of NAME (i.e., for which is_name_suffix is
4928 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4935 match
= strstr (start
, patn0
);
4940 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4941 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4942 && is_name_suffix (match
+ patn_len
))
4943 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
4948 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4949 vector *defn_symbols, updating the list of symbols in OBSTACKP
4950 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4951 OBJFILE is the section containing BLOCK.
4952 SYMTAB is recorded with each symbol added. */
4955 ada_add_block_symbols (struct obstack
*obstackp
,
4956 struct block
*block
, const char *name
,
4957 domain_enum domain
, struct objfile
*objfile
,
4960 struct dict_iterator iter
;
4961 int name_len
= strlen (name
);
4962 /* A matching argument symbol, if any. */
4963 struct symbol
*arg_sym
;
4964 /* Set true when we find a matching non-argument symbol. */
4973 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4975 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4976 SYMBOL_DOMAIN (sym
), domain
)
4977 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
4979 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4981 else if (SYMBOL_IS_ARGUMENT (sym
))
4986 add_defn_to_vec (obstackp
,
4987 fixup_symbol_section (sym
, objfile
),
4995 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4997 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4998 SYMBOL_DOMAIN (sym
), domain
))
5000 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5002 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5004 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5006 if (SYMBOL_IS_ARGUMENT (sym
))
5011 add_defn_to_vec (obstackp
,
5012 fixup_symbol_section (sym
, objfile
),
5021 if (!found_sym
&& arg_sym
!= NULL
)
5023 add_defn_to_vec (obstackp
,
5024 fixup_symbol_section (arg_sym
, objfile
),
5033 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5035 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5036 SYMBOL_DOMAIN (sym
), domain
))
5040 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5043 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5045 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5050 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5052 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5054 if (SYMBOL_IS_ARGUMENT (sym
))
5059 add_defn_to_vec (obstackp
,
5060 fixup_symbol_section (sym
, objfile
),
5068 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5069 They aren't parameters, right? */
5070 if (!found_sym
&& arg_sym
!= NULL
)
5072 add_defn_to_vec (obstackp
,
5073 fixup_symbol_section (arg_sym
, objfile
),
5080 /* Symbol Completion */
5082 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5083 name in a form that's appropriate for the completion. The result
5084 does not need to be deallocated, but is only good until the next call.
5086 TEXT_LEN is equal to the length of TEXT.
5087 Perform a wild match if WILD_MATCH is set.
5088 ENCODED should be set if TEXT represents the start of a symbol name
5089 in its encoded form. */
5092 symbol_completion_match (const char *sym_name
,
5093 const char *text
, int text_len
,
5094 int wild_match
, int encoded
)
5097 const int verbatim_match
= (text
[0] == '<');
5102 /* Strip the leading angle bracket. */
5107 /* First, test against the fully qualified name of the symbol. */
5109 if (strncmp (sym_name
, text
, text_len
) == 0)
5112 if (match
&& !encoded
)
5114 /* One needed check before declaring a positive match is to verify
5115 that iff we are doing a verbatim match, the decoded version
5116 of the symbol name starts with '<'. Otherwise, this symbol name
5117 is not a suitable completion. */
5118 const char *sym_name_copy
= sym_name
;
5119 int has_angle_bracket
;
5121 sym_name
= ada_decode (sym_name
);
5122 has_angle_bracket
= (sym_name
[0] == '<');
5123 match
= (has_angle_bracket
== verbatim_match
);
5124 sym_name
= sym_name_copy
;
5127 if (match
&& !verbatim_match
)
5129 /* When doing non-verbatim match, another check that needs to
5130 be done is to verify that the potentially matching symbol name
5131 does not include capital letters, because the ada-mode would
5132 not be able to understand these symbol names without the
5133 angle bracket notation. */
5136 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5141 /* Second: Try wild matching... */
5143 if (!match
&& wild_match
)
5145 /* Since we are doing wild matching, this means that TEXT
5146 may represent an unqualified symbol name. We therefore must
5147 also compare TEXT against the unqualified name of the symbol. */
5148 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5150 if (strncmp (sym_name
, text
, text_len
) == 0)
5154 /* Finally: If we found a mach, prepare the result to return. */
5160 sym_name
= add_angle_brackets (sym_name
);
5163 sym_name
= ada_decode (sym_name
);
5168 typedef char *char_ptr
;
5169 DEF_VEC_P (char_ptr
);
5171 /* A companion function to ada_make_symbol_completion_list().
5172 Check if SYM_NAME represents a symbol which name would be suitable
5173 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5174 it is appended at the end of the given string vector SV.
5176 ORIG_TEXT is the string original string from the user command
5177 that needs to be completed. WORD is the entire command on which
5178 completion should be performed. These two parameters are used to
5179 determine which part of the symbol name should be added to the
5181 if WILD_MATCH is set, then wild matching is performed.
5182 ENCODED should be set if TEXT represents a symbol name in its
5183 encoded formed (in which case the completion should also be
5187 symbol_completion_add (VEC(char_ptr
) **sv
,
5188 const char *sym_name
,
5189 const char *text
, int text_len
,
5190 const char *orig_text
, const char *word
,
5191 int wild_match
, int encoded
)
5193 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5194 wild_match
, encoded
);
5200 /* We found a match, so add the appropriate completion to the given
5203 if (word
== orig_text
)
5205 completion
= xmalloc (strlen (match
) + 5);
5206 strcpy (completion
, match
);
5208 else if (word
> orig_text
)
5210 /* Return some portion of sym_name. */
5211 completion
= xmalloc (strlen (match
) + 5);
5212 strcpy (completion
, match
+ (word
- orig_text
));
5216 /* Return some of ORIG_TEXT plus sym_name. */
5217 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5218 strncpy (completion
, word
, orig_text
- word
);
5219 completion
[orig_text
- word
] = '\0';
5220 strcat (completion
, match
);
5223 VEC_safe_push (char_ptr
, *sv
, completion
);
5226 /* Return a list of possible symbol names completing TEXT0. The list
5227 is NULL terminated. WORD is the entire command on which completion
5231 ada_make_symbol_completion_list (char *text0
, char *word
)
5237 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5240 struct partial_symtab
*ps
;
5241 struct minimal_symbol
*msymbol
;
5242 struct objfile
*objfile
;
5243 struct block
*b
, *surrounding_static_block
= 0;
5245 struct dict_iterator iter
;
5247 if (text0
[0] == '<')
5249 text
= xstrdup (text0
);
5250 make_cleanup (xfree
, text
);
5251 text_len
= strlen (text
);
5257 text
= xstrdup (ada_encode (text0
));
5258 make_cleanup (xfree
, text
);
5259 text_len
= strlen (text
);
5260 for (i
= 0; i
< text_len
; i
++)
5261 text
[i
] = tolower (text
[i
]);
5263 encoded
= (strstr (text0
, "__") != NULL
);
5264 /* If the name contains a ".", then the user is entering a fully
5265 qualified entity name, and the match must not be done in wild
5266 mode. Similarly, if the user wants to complete what looks like
5267 an encoded name, the match must not be done in wild mode. */
5268 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5271 /* First, look at the partial symtab symbols. */
5272 ALL_PSYMTABS (objfile
, ps
)
5274 struct partial_symbol
**psym
;
5276 /* If the psymtab's been read in we'll get it when we search
5277 through the blockvector. */
5281 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5282 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5283 + ps
->n_global_syms
); psym
++)
5286 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5287 text
, text_len
, text0
, word
,
5288 wild_match
, encoded
);
5291 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5292 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5293 + ps
->n_static_syms
); psym
++)
5296 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5297 text
, text_len
, text0
, word
,
5298 wild_match
, encoded
);
5302 /* At this point scan through the misc symbol vectors and add each
5303 symbol you find to the list. Eventually we want to ignore
5304 anything that isn't a text symbol (everything else will be
5305 handled by the psymtab code above). */
5307 ALL_MSYMBOLS (objfile
, msymbol
)
5310 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5311 text
, text_len
, text0
, word
, wild_match
, encoded
);
5314 /* Search upwards from currently selected frame (so that we can
5315 complete on local vars. */
5317 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5319 if (!BLOCK_SUPERBLOCK (b
))
5320 surrounding_static_block
= b
; /* For elmin of dups */
5322 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5324 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5325 text
, text_len
, text0
, word
,
5326 wild_match
, encoded
);
5330 /* Go through the symtabs and check the externs and statics for
5331 symbols which match. */
5333 ALL_SYMTABS (objfile
, s
)
5336 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5337 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5339 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5340 text
, text_len
, text0
, word
,
5341 wild_match
, encoded
);
5345 ALL_SYMTABS (objfile
, s
)
5348 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5349 /* Don't do this block twice. */
5350 if (b
== surrounding_static_block
)
5352 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5354 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5355 text
, text_len
, text0
, word
,
5356 wild_match
, encoded
);
5360 /* Append the closing NULL entry. */
5361 VEC_safe_push (char_ptr
, completions
, NULL
);
5363 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5364 return the copy. It's unfortunate that we have to make a copy
5365 of an array that we're about to destroy, but there is nothing much
5366 we can do about it. Fortunately, it's typically not a very large
5369 const size_t completions_size
=
5370 VEC_length (char_ptr
, completions
) * sizeof (char *);
5371 char **result
= malloc (completions_size
);
5373 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5375 VEC_free (char_ptr
, completions
);
5382 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5383 for tagged types. */
5386 ada_is_dispatch_table_ptr_type (struct type
*type
)
5390 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5393 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5397 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5400 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5401 to be invisible to users. */
5404 ada_is_ignored_field (struct type
*type
, int field_num
)
5406 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5409 /* Check the name of that field. */
5411 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5413 /* Anonymous field names should not be printed.
5414 brobecker/2007-02-20: I don't think this can actually happen
5415 but we don't want to print the value of annonymous fields anyway. */
5419 /* A field named "_parent" is internally generated by GNAT for
5420 tagged types, and should not be printed either. */
5421 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5425 /* If this is the dispatch table of a tagged type, then ignore. */
5426 if (ada_is_tagged_type (type
, 1)
5427 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5430 /* Not a special field, so it should not be ignored. */
5434 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5435 pointer or reference type whose ultimate target has a tag field. */
5438 ada_is_tagged_type (struct type
*type
, int refok
)
5440 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5443 /* True iff TYPE represents the type of X'Tag */
5446 ada_is_tag_type (struct type
*type
)
5448 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5452 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5453 return (name
!= NULL
5454 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5458 /* The type of the tag on VAL. */
5461 ada_tag_type (struct value
*val
)
5463 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5466 /* The value of the tag on VAL. */
5469 ada_value_tag (struct value
*val
)
5471 return ada_value_struct_elt (val
, "_tag", 0);
5474 /* The value of the tag on the object of type TYPE whose contents are
5475 saved at VALADDR, if it is non-null, or is at memory address
5478 static struct value
*
5479 value_tag_from_contents_and_address (struct type
*type
,
5480 const gdb_byte
*valaddr
,
5483 int tag_byte_offset
, dummy1
, dummy2
;
5484 struct type
*tag_type
;
5485 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5488 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5490 : valaddr
+ tag_byte_offset
);
5491 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5493 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5498 static struct type
*
5499 type_from_tag (struct value
*tag
)
5501 const char *type_name
= ada_tag_name (tag
);
5502 if (type_name
!= NULL
)
5503 return ada_find_any_type (ada_encode (type_name
));
5514 static int ada_tag_name_1 (void *);
5515 static int ada_tag_name_2 (struct tag_args
*);
5517 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5518 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5519 The value stored in ARGS->name is valid until the next call to
5523 ada_tag_name_1 (void *args0
)
5525 struct tag_args
*args
= (struct tag_args
*) args0
;
5526 static char name
[1024];
5530 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5532 return ada_tag_name_2 (args
);
5533 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5536 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5537 for (p
= name
; *p
!= '\0'; p
+= 1)
5544 /* Utility function for ada_tag_name_1 that tries the second
5545 representation for the dispatch table (in which there is no
5546 explicit 'tsd' field in the referent of the tag pointer, and instead
5547 the tsd pointer is stored just before the dispatch table. */
5550 ada_tag_name_2 (struct tag_args
*args
)
5552 struct type
*info_type
;
5553 static char name
[1024];
5555 struct value
*val
, *valp
;
5558 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5559 if (info_type
== NULL
)
5561 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5562 valp
= value_cast (info_type
, args
->tag
);
5565 val
= value_ind (value_ptradd (valp
,
5566 value_from_longest (builtin_type_int8
, -1)));
5569 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5572 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5573 for (p
= name
; *p
!= '\0'; p
+= 1)
5580 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5584 ada_tag_name (struct value
*tag
)
5586 struct tag_args args
;
5587 if (!ada_is_tag_type (value_type (tag
)))
5591 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5595 /* The parent type of TYPE, or NULL if none. */
5598 ada_parent_type (struct type
*type
)
5602 type
= ada_check_typedef (type
);
5604 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5607 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5608 if (ada_is_parent_field (type
, i
))
5610 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5612 /* If the _parent field is a pointer, then dereference it. */
5613 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5614 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5615 /* If there is a parallel XVS type, get the actual base type. */
5616 parent_type
= ada_get_base_type (parent_type
);
5618 return ada_check_typedef (parent_type
);
5624 /* True iff field number FIELD_NUM of structure type TYPE contains the
5625 parent-type (inherited) fields of a derived type. Assumes TYPE is
5626 a structure type with at least FIELD_NUM+1 fields. */
5629 ada_is_parent_field (struct type
*type
, int field_num
)
5631 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5632 return (name
!= NULL
5633 && (strncmp (name
, "PARENT", 6) == 0
5634 || strncmp (name
, "_parent", 7) == 0));
5637 /* True iff field number FIELD_NUM of structure type TYPE is a
5638 transparent wrapper field (which should be silently traversed when doing
5639 field selection and flattened when printing). Assumes TYPE is a
5640 structure type with at least FIELD_NUM+1 fields. Such fields are always
5644 ada_is_wrapper_field (struct type
*type
, int field_num
)
5646 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5647 return (name
!= NULL
5648 && (strncmp (name
, "PARENT", 6) == 0
5649 || strcmp (name
, "REP") == 0
5650 || strncmp (name
, "_parent", 7) == 0
5651 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5654 /* True iff field number FIELD_NUM of structure or union type TYPE
5655 is a variant wrapper. Assumes TYPE is a structure type with at least
5656 FIELD_NUM+1 fields. */
5659 ada_is_variant_part (struct type
*type
, int field_num
)
5661 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5662 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5663 || (is_dynamic_field (type
, field_num
)
5664 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5665 == TYPE_CODE_UNION
)));
5668 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5669 whose discriminants are contained in the record type OUTER_TYPE,
5670 returns the type of the controlling discriminant for the variant. */
5673 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5675 char *name
= ada_variant_discrim_name (var_type
);
5677 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5679 return builtin_type_int32
;
5684 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5685 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5686 represents a 'when others' clause; otherwise 0. */
5689 ada_is_others_clause (struct type
*type
, int field_num
)
5691 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5692 return (name
!= NULL
&& name
[0] == 'O');
5695 /* Assuming that TYPE0 is the type of the variant part of a record,
5696 returns the name of the discriminant controlling the variant.
5697 The value is valid until the next call to ada_variant_discrim_name. */
5700 ada_variant_discrim_name (struct type
*type0
)
5702 static char *result
= NULL
;
5703 static size_t result_len
= 0;
5706 const char *discrim_end
;
5707 const char *discrim_start
;
5709 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5710 type
= TYPE_TARGET_TYPE (type0
);
5714 name
= ada_type_name (type
);
5716 if (name
== NULL
|| name
[0] == '\000')
5719 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5722 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5725 if (discrim_end
== name
)
5728 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5731 if (discrim_start
== name
+ 1)
5733 if ((discrim_start
> name
+ 3
5734 && strncmp (discrim_start
- 3, "___", 3) == 0)
5735 || discrim_start
[-1] == '.')
5739 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5740 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5741 result
[discrim_end
- discrim_start
] = '\0';
5745 /* Scan STR for a subtype-encoded number, beginning at position K.
5746 Put the position of the character just past the number scanned in
5747 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5748 Return 1 if there was a valid number at the given position, and 0
5749 otherwise. A "subtype-encoded" number consists of the absolute value
5750 in decimal, followed by the letter 'm' to indicate a negative number.
5751 Assumes 0m does not occur. */
5754 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5758 if (!isdigit (str
[k
]))
5761 /* Do it the hard way so as not to make any assumption about
5762 the relationship of unsigned long (%lu scan format code) and
5765 while (isdigit (str
[k
]))
5767 RU
= RU
* 10 + (str
[k
] - '0');
5774 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5780 /* NOTE on the above: Technically, C does not say what the results of
5781 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5782 number representable as a LONGEST (although either would probably work
5783 in most implementations). When RU>0, the locution in the then branch
5784 above is always equivalent to the negative of RU. */
5791 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5792 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5793 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5796 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5798 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5811 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5820 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5821 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5823 if (val
>= L
&& val
<= U
)
5835 /* FIXME: Lots of redundancy below. Try to consolidate. */
5837 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5838 ARG_TYPE, extract and return the value of one of its (non-static)
5839 fields. FIELDNO says which field. Differs from value_primitive_field
5840 only in that it can handle packed values of arbitrary type. */
5842 static struct value
*
5843 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5844 struct type
*arg_type
)
5848 arg_type
= ada_check_typedef (arg_type
);
5849 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5851 /* Handle packed fields. */
5853 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5855 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5856 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5858 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5859 offset
+ bit_pos
/ 8,
5860 bit_pos
% 8, bit_size
, type
);
5863 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5866 /* Find field with name NAME in object of type TYPE. If found,
5867 set the following for each argument that is non-null:
5868 - *FIELD_TYPE_P to the field's type;
5869 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5870 an object of that type;
5871 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5872 - *BIT_SIZE_P to its size in bits if the field is packed, and
5874 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5875 fields up to but not including the desired field, or by the total
5876 number of fields if not found. A NULL value of NAME never
5877 matches; the function just counts visible fields in this case.
5879 Returns 1 if found, 0 otherwise. */
5882 find_struct_field (char *name
, struct type
*type
, int offset
,
5883 struct type
**field_type_p
,
5884 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5889 type
= ada_check_typedef (type
);
5891 if (field_type_p
!= NULL
)
5892 *field_type_p
= NULL
;
5893 if (byte_offset_p
!= NULL
)
5895 if (bit_offset_p
!= NULL
)
5897 if (bit_size_p
!= NULL
)
5900 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5902 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5903 int fld_offset
= offset
+ bit_pos
/ 8;
5904 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5906 if (t_field_name
== NULL
)
5909 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5911 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5912 if (field_type_p
!= NULL
)
5913 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5914 if (byte_offset_p
!= NULL
)
5915 *byte_offset_p
= fld_offset
;
5916 if (bit_offset_p
!= NULL
)
5917 *bit_offset_p
= bit_pos
% 8;
5918 if (bit_size_p
!= NULL
)
5919 *bit_size_p
= bit_size
;
5922 else if (ada_is_wrapper_field (type
, i
))
5924 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5925 field_type_p
, byte_offset_p
, bit_offset_p
,
5926 bit_size_p
, index_p
))
5929 else if (ada_is_variant_part (type
, i
))
5931 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5934 struct type
*field_type
5935 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5937 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5939 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5941 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5942 field_type_p
, byte_offset_p
,
5943 bit_offset_p
, bit_size_p
, index_p
))
5947 else if (index_p
!= NULL
)
5953 /* Number of user-visible fields in record type TYPE. */
5956 num_visible_fields (struct type
*type
)
5960 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5964 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5965 and search in it assuming it has (class) type TYPE.
5966 If found, return value, else return NULL.
5968 Searches recursively through wrapper fields (e.g., '_parent'). */
5970 static struct value
*
5971 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5975 type
= ada_check_typedef (type
);
5977 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5979 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5981 if (t_field_name
== NULL
)
5984 else if (field_name_match (t_field_name
, name
))
5985 return ada_value_primitive_field (arg
, offset
, i
, type
);
5987 else if (ada_is_wrapper_field (type
, i
))
5989 struct value
*v
= /* Do not let indent join lines here. */
5990 ada_search_struct_field (name
, arg
,
5991 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5992 TYPE_FIELD_TYPE (type
, i
));
5997 else if (ada_is_variant_part (type
, i
))
5999 /* PNH: Do we ever get here? See find_struct_field. */
6001 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6002 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6004 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6006 struct value
*v
= ada_search_struct_field
/* Force line break. */
6008 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6009 TYPE_FIELD_TYPE (field_type
, j
));
6018 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6019 int, struct type
*);
6022 /* Return field #INDEX in ARG, where the index is that returned by
6023 * find_struct_field through its INDEX_P argument. Adjust the address
6024 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6025 * If found, return value, else return NULL. */
6027 static struct value
*
6028 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6031 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6035 /* Auxiliary function for ada_index_struct_field. Like
6036 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6039 static struct value
*
6040 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6044 type
= ada_check_typedef (type
);
6046 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6048 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6050 else if (ada_is_wrapper_field (type
, i
))
6052 struct value
*v
= /* Do not let indent join lines here. */
6053 ada_index_struct_field_1 (index_p
, arg
,
6054 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6055 TYPE_FIELD_TYPE (type
, i
));
6060 else if (ada_is_variant_part (type
, i
))
6062 /* PNH: Do we ever get here? See ada_search_struct_field,
6063 find_struct_field. */
6064 error (_("Cannot assign this kind of variant record"));
6066 else if (*index_p
== 0)
6067 return ada_value_primitive_field (arg
, offset
, i
, type
);
6074 /* Given ARG, a value of type (pointer or reference to a)*
6075 structure/union, extract the component named NAME from the ultimate
6076 target structure/union and return it as a value with its
6079 The routine searches for NAME among all members of the structure itself
6080 and (recursively) among all members of any wrapper members
6083 If NO_ERR, then simply return NULL in case of error, rather than
6087 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6089 struct type
*t
, *t1
;
6093 t1
= t
= ada_check_typedef (value_type (arg
));
6094 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6096 t1
= TYPE_TARGET_TYPE (t
);
6099 t1
= ada_check_typedef (t1
);
6100 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6102 arg
= coerce_ref (arg
);
6107 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6109 t1
= TYPE_TARGET_TYPE (t
);
6112 t1
= ada_check_typedef (t1
);
6113 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6115 arg
= value_ind (arg
);
6122 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6126 v
= ada_search_struct_field (name
, arg
, 0, t
);
6129 int bit_offset
, bit_size
, byte_offset
;
6130 struct type
*field_type
;
6133 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6134 address
= value_as_address (arg
);
6136 address
= unpack_pointer (t
, value_contents (arg
));
6138 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6139 if (find_struct_field (name
, t1
, 0,
6140 &field_type
, &byte_offset
, &bit_offset
,
6145 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6146 arg
= ada_coerce_ref (arg
);
6148 arg
= ada_value_ind (arg
);
6149 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6150 bit_offset
, bit_size
,
6154 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6158 if (v
!= NULL
|| no_err
)
6161 error (_("There is no member named %s."), name
);
6167 error (_("Attempt to extract a component of a value that is not a record."));
6170 /* Given a type TYPE, look up the type of the component of type named NAME.
6171 If DISPP is non-null, add its byte displacement from the beginning of a
6172 structure (pointed to by a value) of type TYPE to *DISPP (does not
6173 work for packed fields).
6175 Matches any field whose name has NAME as a prefix, possibly
6178 TYPE can be either a struct or union. If REFOK, TYPE may also
6179 be a (pointer or reference)+ to a struct or union, and the
6180 ultimate target type will be searched.
6182 Looks recursively into variant clauses and parent types.
6184 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6185 TYPE is not a type of the right kind. */
6187 static struct type
*
6188 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6189 int noerr
, int *dispp
)
6196 if (refok
&& type
!= NULL
)
6199 type
= ada_check_typedef (type
);
6200 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6201 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6203 type
= TYPE_TARGET_TYPE (type
);
6207 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6208 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6214 target_terminal_ours ();
6215 gdb_flush (gdb_stdout
);
6217 error (_("Type (null) is not a structure or union type"));
6220 /* XXX: type_sprint */
6221 fprintf_unfiltered (gdb_stderr
, _("Type "));
6222 type_print (type
, "", gdb_stderr
, -1);
6223 error (_(" is not a structure or union type"));
6228 type
= to_static_fixed_type (type
);
6230 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6232 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6236 if (t_field_name
== NULL
)
6239 else if (field_name_match (t_field_name
, name
))
6242 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6243 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6246 else if (ada_is_wrapper_field (type
, i
))
6249 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6254 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6259 else if (ada_is_variant_part (type
, i
))
6262 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6264 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6266 /* FIXME pnh 2008/01/26: We check for a field that is
6267 NOT wrapped in a struct, since the compiler sometimes
6268 generates these for unchecked variant types. Revisit
6269 if the compiler changes this practice. */
6270 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6272 if (v_field_name
!= NULL
6273 && field_name_match (v_field_name
, name
))
6274 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6276 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6282 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6293 target_terminal_ours ();
6294 gdb_flush (gdb_stdout
);
6297 /* XXX: type_sprint */
6298 fprintf_unfiltered (gdb_stderr
, _("Type "));
6299 type_print (type
, "", gdb_stderr
, -1);
6300 error (_(" has no component named <null>"));
6304 /* XXX: type_sprint */
6305 fprintf_unfiltered (gdb_stderr
, _("Type "));
6306 type_print (type
, "", gdb_stderr
, -1);
6307 error (_(" has no component named %s"), name
);
6314 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6315 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6316 represents an unchecked union (that is, the variant part of a
6317 record that is named in an Unchecked_Union pragma). */
6320 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6322 char *discrim_name
= ada_variant_discrim_name (var_type
);
6323 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6328 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6329 within a value of type OUTER_TYPE that is stored in GDB at
6330 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6331 numbering from 0) is applicable. Returns -1 if none are. */
6334 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6335 const gdb_byte
*outer_valaddr
)
6339 char *discrim_name
= ada_variant_discrim_name (var_type
);
6340 struct value
*outer
;
6341 struct value
*discrim
;
6342 LONGEST discrim_val
;
6344 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6345 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6346 if (discrim
== NULL
)
6348 discrim_val
= value_as_long (discrim
);
6351 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6353 if (ada_is_others_clause (var_type
, i
))
6355 else if (ada_in_variant (discrim_val
, var_type
, i
))
6359 return others_clause
;
6364 /* Dynamic-Sized Records */
6366 /* Strategy: The type ostensibly attached to a value with dynamic size
6367 (i.e., a size that is not statically recorded in the debugging
6368 data) does not accurately reflect the size or layout of the value.
6369 Our strategy is to convert these values to values with accurate,
6370 conventional types that are constructed on the fly. */
6372 /* There is a subtle and tricky problem here. In general, we cannot
6373 determine the size of dynamic records without its data. However,
6374 the 'struct value' data structure, which GDB uses to represent
6375 quantities in the inferior process (the target), requires the size
6376 of the type at the time of its allocation in order to reserve space
6377 for GDB's internal copy of the data. That's why the
6378 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6379 rather than struct value*s.
6381 However, GDB's internal history variables ($1, $2, etc.) are
6382 struct value*s containing internal copies of the data that are not, in
6383 general, the same as the data at their corresponding addresses in
6384 the target. Fortunately, the types we give to these values are all
6385 conventional, fixed-size types (as per the strategy described
6386 above), so that we don't usually have to perform the
6387 'to_fixed_xxx_type' conversions to look at their values.
6388 Unfortunately, there is one exception: if one of the internal
6389 history variables is an array whose elements are unconstrained
6390 records, then we will need to create distinct fixed types for each
6391 element selected. */
6393 /* The upshot of all of this is that many routines take a (type, host
6394 address, target address) triple as arguments to represent a value.
6395 The host address, if non-null, is supposed to contain an internal
6396 copy of the relevant data; otherwise, the program is to consult the
6397 target at the target address. */
6399 /* Assuming that VAL0 represents a pointer value, the result of
6400 dereferencing it. Differs from value_ind in its treatment of
6401 dynamic-sized types. */
6404 ada_value_ind (struct value
*val0
)
6406 struct value
*val
= unwrap_value (value_ind (val0
));
6407 return ada_to_fixed_value (val
);
6410 /* The value resulting from dereferencing any "reference to"
6411 qualifiers on VAL0. */
6413 static struct value
*
6414 ada_coerce_ref (struct value
*val0
)
6416 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6418 struct value
*val
= val0
;
6419 val
= coerce_ref (val
);
6420 val
= unwrap_value (val
);
6421 return ada_to_fixed_value (val
);
6427 /* Return OFF rounded upward if necessary to a multiple of
6428 ALIGNMENT (a power of 2). */
6431 align_value (unsigned int off
, unsigned int alignment
)
6433 return (off
+ alignment
- 1) & ~(alignment
- 1);
6436 /* Return the bit alignment required for field #F of template type TYPE. */
6439 field_alignment (struct type
*type
, int f
)
6441 const char *name
= TYPE_FIELD_NAME (type
, f
);
6445 /* The field name should never be null, unless the debugging information
6446 is somehow malformed. In this case, we assume the field does not
6447 require any alignment. */
6451 len
= strlen (name
);
6453 if (!isdigit (name
[len
- 1]))
6456 if (isdigit (name
[len
- 2]))
6457 align_offset
= len
- 2;
6459 align_offset
= len
- 1;
6461 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6462 return TARGET_CHAR_BIT
;
6464 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6467 /* Find a symbol named NAME. Ignores ambiguity. */
6470 ada_find_any_symbol (const char *name
)
6474 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6475 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6478 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6482 /* Find a type named NAME. Ignores ambiguity. */
6485 ada_find_any_type (const char *name
)
6487 struct symbol
*sym
= ada_find_any_symbol (name
);
6488 struct type
*type
= NULL
;
6491 type
= SYMBOL_TYPE (sym
);
6494 type
= language_lookup_primitive_type_by_name
6495 (language_def (language_ada
), current_gdbarch
, name
);
6500 /* Given NAME and an associated BLOCK, search all symbols for
6501 NAME suffixed with "___XR", which is the ``renaming'' symbol
6502 associated to NAME. Return this symbol if found, return
6506 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6510 sym
= find_old_style_renaming_symbol (name
, block
);
6515 /* Not right yet. FIXME pnh 7/20/2007. */
6516 sym
= ada_find_any_symbol (name
);
6517 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6523 static struct symbol
*
6524 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6526 const struct symbol
*function_sym
= block_linkage_function (block
);
6529 if (function_sym
!= NULL
)
6531 /* If the symbol is defined inside a function, NAME is not fully
6532 qualified. This means we need to prepend the function name
6533 as well as adding the ``___XR'' suffix to build the name of
6534 the associated renaming symbol. */
6535 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6536 /* Function names sometimes contain suffixes used
6537 for instance to qualify nested subprograms. When building
6538 the XR type name, we need to make sure that this suffix is
6539 not included. So do not include any suffix in the function
6540 name length below. */
6541 const int function_name_len
= ada_name_prefix_len (function_name
);
6542 const int rename_len
= function_name_len
+ 2 /* "__" */
6543 + strlen (name
) + 6 /* "___XR\0" */ ;
6545 /* Strip the suffix if necessary. */
6546 function_name
[function_name_len
] = '\0';
6548 /* Library-level functions are a special case, as GNAT adds
6549 a ``_ada_'' prefix to the function name to avoid namespace
6550 pollution. However, the renaming symbols themselves do not
6551 have this prefix, so we need to skip this prefix if present. */
6552 if (function_name_len
> 5 /* "_ada_" */
6553 && strstr (function_name
, "_ada_") == function_name
)
6554 function_name
= function_name
+ 5;
6556 rename
= (char *) alloca (rename_len
* sizeof (char));
6557 xsnprintf (rename
, rename_len
* sizeof (char), "%s__%s___XR",
6558 function_name
, name
);
6562 const int rename_len
= strlen (name
) + 6;
6563 rename
= (char *) alloca (rename_len
* sizeof (char));
6564 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6567 return ada_find_any_symbol (rename
);
6570 /* Because of GNAT encoding conventions, several GDB symbols may match a
6571 given type name. If the type denoted by TYPE0 is to be preferred to
6572 that of TYPE1 for purposes of type printing, return non-zero;
6573 otherwise return 0. */
6576 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6580 else if (type0
== NULL
)
6582 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6584 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6586 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6588 else if (ada_is_packed_array_type (type0
))
6590 else if (ada_is_array_descriptor_type (type0
)
6591 && !ada_is_array_descriptor_type (type1
))
6595 const char *type0_name
= type_name_no_tag (type0
);
6596 const char *type1_name
= type_name_no_tag (type1
);
6598 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6599 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6605 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6606 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6609 ada_type_name (struct type
*type
)
6613 else if (TYPE_NAME (type
) != NULL
)
6614 return TYPE_NAME (type
);
6616 return TYPE_TAG_NAME (type
);
6619 /* Find a parallel type to TYPE whose name is formed by appending
6620 SUFFIX to the name of TYPE. */
6623 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6626 static size_t name_len
= 0;
6628 char *typename
= ada_type_name (type
);
6630 if (typename
== NULL
)
6633 len
= strlen (typename
);
6635 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6637 strcpy (name
, typename
);
6638 strcpy (name
+ len
, suffix
);
6640 return ada_find_any_type (name
);
6644 /* If TYPE is a variable-size record type, return the corresponding template
6645 type describing its fields. Otherwise, return NULL. */
6647 static struct type
*
6648 dynamic_template_type (struct type
*type
)
6650 type
= ada_check_typedef (type
);
6652 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6653 || ada_type_name (type
) == NULL
)
6657 int len
= strlen (ada_type_name (type
));
6658 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6661 return ada_find_parallel_type (type
, "___XVE");
6665 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6666 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6669 is_dynamic_field (struct type
*templ_type
, int field_num
)
6671 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6673 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6674 && strstr (name
, "___XVL") != NULL
;
6677 /* The index of the variant field of TYPE, or -1 if TYPE does not
6678 represent a variant record type. */
6681 variant_field_index (struct type
*type
)
6685 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6688 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6690 if (ada_is_variant_part (type
, f
))
6696 /* A record type with no fields. */
6698 static struct type
*
6699 empty_record (struct objfile
*objfile
)
6701 struct type
*type
= alloc_type (objfile
);
6702 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6703 TYPE_NFIELDS (type
) = 0;
6704 TYPE_FIELDS (type
) = NULL
;
6705 INIT_CPLUS_SPECIFIC (type
);
6706 TYPE_NAME (type
) = "<empty>";
6707 TYPE_TAG_NAME (type
) = NULL
;
6708 TYPE_LENGTH (type
) = 0;
6712 /* An ordinary record type (with fixed-length fields) that describes
6713 the value of type TYPE at VALADDR or ADDRESS (see comments at
6714 the beginning of this section) VAL according to GNAT conventions.
6715 DVAL0 should describe the (portion of a) record that contains any
6716 necessary discriminants. It should be NULL if value_type (VAL) is
6717 an outer-level type (i.e., as opposed to a branch of a variant.) A
6718 variant field (unless unchecked) is replaced by a particular branch
6721 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6722 length are not statically known are discarded. As a consequence,
6723 VALADDR, ADDRESS and DVAL0 are ignored.
6725 NOTE: Limitations: For now, we assume that dynamic fields and
6726 variants occupy whole numbers of bytes. However, they need not be
6730 ada_template_to_fixed_record_type_1 (struct type
*type
,
6731 const gdb_byte
*valaddr
,
6732 CORE_ADDR address
, struct value
*dval0
,
6733 int keep_dynamic_fields
)
6735 struct value
*mark
= value_mark ();
6738 int nfields
, bit_len
;
6741 int fld_bit_len
, bit_incr
;
6744 /* Compute the number of fields in this record type that are going
6745 to be processed: unless keep_dynamic_fields, this includes only
6746 fields whose position and length are static will be processed. */
6747 if (keep_dynamic_fields
)
6748 nfields
= TYPE_NFIELDS (type
);
6752 while (nfields
< TYPE_NFIELDS (type
)
6753 && !ada_is_variant_part (type
, nfields
)
6754 && !is_dynamic_field (type
, nfields
))
6758 rtype
= alloc_type (TYPE_OBJFILE (type
));
6759 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6760 INIT_CPLUS_SPECIFIC (rtype
);
6761 TYPE_NFIELDS (rtype
) = nfields
;
6762 TYPE_FIELDS (rtype
) = (struct field
*)
6763 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6764 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6765 TYPE_NAME (rtype
) = ada_type_name (type
);
6766 TYPE_TAG_NAME (rtype
) = NULL
;
6767 TYPE_FIXED_INSTANCE (rtype
) = 1;
6773 for (f
= 0; f
< nfields
; f
+= 1)
6775 off
= align_value (off
, field_alignment (type
, f
))
6776 + TYPE_FIELD_BITPOS (type
, f
);
6777 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6778 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6780 if (ada_is_variant_part (type
, f
))
6783 fld_bit_len
= bit_incr
= 0;
6785 else if (is_dynamic_field (type
, f
))
6789 /* rtype's length is computed based on the run-time
6790 value of discriminants. If the discriminants are not
6791 initialized, the type size may be completely bogus and
6792 GDB may fail to allocate a value for it. So check the
6793 size first before creating the value. */
6795 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6800 /* Get the fixed type of the field. Note that, in this case, we
6801 do not want to get the real type out of the tag: if the current
6802 field is the parent part of a tagged record, we will get the
6803 tag of the object. Clearly wrong: the real type of the parent
6804 is not the real type of the child. We would end up in an infinite
6806 TYPE_FIELD_TYPE (rtype
, f
) =
6809 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6810 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6811 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6812 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6813 bit_incr
= fld_bit_len
=
6814 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6818 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6819 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6820 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6821 bit_incr
= fld_bit_len
=
6822 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6824 bit_incr
= fld_bit_len
=
6825 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6827 if (off
+ fld_bit_len
> bit_len
)
6828 bit_len
= off
+ fld_bit_len
;
6830 TYPE_LENGTH (rtype
) =
6831 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6834 /* We handle the variant part, if any, at the end because of certain
6835 odd cases in which it is re-ordered so as NOT to be the last field of
6836 the record. This can happen in the presence of representation
6838 if (variant_field
>= 0)
6840 struct type
*branch_type
;
6842 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6845 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6850 to_fixed_variant_branch_type
6851 (TYPE_FIELD_TYPE (type
, variant_field
),
6852 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6853 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6854 if (branch_type
== NULL
)
6856 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6857 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6858 TYPE_NFIELDS (rtype
) -= 1;
6862 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6863 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6865 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6867 if (off
+ fld_bit_len
> bit_len
)
6868 bit_len
= off
+ fld_bit_len
;
6869 TYPE_LENGTH (rtype
) =
6870 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6874 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6875 should contain the alignment of that record, which should be a strictly
6876 positive value. If null or negative, then something is wrong, most
6877 probably in the debug info. In that case, we don't round up the size
6878 of the resulting type. If this record is not part of another structure,
6879 the current RTYPE length might be good enough for our purposes. */
6880 if (TYPE_LENGTH (type
) <= 0)
6882 if (TYPE_NAME (rtype
))
6883 warning (_("Invalid type size for `%s' detected: %d."),
6884 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6886 warning (_("Invalid type size for <unnamed> detected: %d."),
6887 TYPE_LENGTH (type
));
6891 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6892 TYPE_LENGTH (type
));
6895 value_free_to_mark (mark
);
6896 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6897 error (_("record type with dynamic size is larger than varsize-limit"));
6901 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6904 static struct type
*
6905 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6906 CORE_ADDR address
, struct value
*dval0
)
6908 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6912 /* An ordinary record type in which ___XVL-convention fields and
6913 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6914 static approximations, containing all possible fields. Uses
6915 no runtime values. Useless for use in values, but that's OK,
6916 since the results are used only for type determinations. Works on both
6917 structs and unions. Representation note: to save space, we memorize
6918 the result of this function in the TYPE_TARGET_TYPE of the
6921 static struct type
*
6922 template_to_static_fixed_type (struct type
*type0
)
6928 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6929 return TYPE_TARGET_TYPE (type0
);
6931 nfields
= TYPE_NFIELDS (type0
);
6934 for (f
= 0; f
< nfields
; f
+= 1)
6936 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6937 struct type
*new_type
;
6939 if (is_dynamic_field (type0
, f
))
6940 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6942 new_type
= static_unwrap_type (field_type
);
6943 if (type
== type0
&& new_type
!= field_type
)
6945 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6946 TYPE_CODE (type
) = TYPE_CODE (type0
);
6947 INIT_CPLUS_SPECIFIC (type
);
6948 TYPE_NFIELDS (type
) = nfields
;
6949 TYPE_FIELDS (type
) = (struct field
*)
6950 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6951 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6952 sizeof (struct field
) * nfields
);
6953 TYPE_NAME (type
) = ada_type_name (type0
);
6954 TYPE_TAG_NAME (type
) = NULL
;
6955 TYPE_FIXED_INSTANCE (type
) = 1;
6956 TYPE_LENGTH (type
) = 0;
6958 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6959 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6964 /* Given an object of type TYPE whose contents are at VALADDR and
6965 whose address in memory is ADDRESS, returns a revision of TYPE,
6966 which should be a non-dynamic-sized record, in which the variant
6967 part, if any, is replaced with the appropriate branch. Looks
6968 for discriminant values in DVAL0, which can be NULL if the record
6969 contains the necessary discriminant values. */
6971 static struct type
*
6972 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6973 CORE_ADDR address
, struct value
*dval0
)
6975 struct value
*mark
= value_mark ();
6978 struct type
*branch_type
;
6979 int nfields
= TYPE_NFIELDS (type
);
6980 int variant_field
= variant_field_index (type
);
6982 if (variant_field
== -1)
6986 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6990 rtype
= alloc_type (TYPE_OBJFILE (type
));
6991 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6992 INIT_CPLUS_SPECIFIC (rtype
);
6993 TYPE_NFIELDS (rtype
) = nfields
;
6994 TYPE_FIELDS (rtype
) =
6995 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6996 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6997 sizeof (struct field
) * nfields
);
6998 TYPE_NAME (rtype
) = ada_type_name (type
);
6999 TYPE_TAG_NAME (rtype
) = NULL
;
7000 TYPE_FIXED_INSTANCE (rtype
) = 1;
7001 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7003 branch_type
= to_fixed_variant_branch_type
7004 (TYPE_FIELD_TYPE (type
, variant_field
),
7005 cond_offset_host (valaddr
,
7006 TYPE_FIELD_BITPOS (type
, variant_field
)
7008 cond_offset_target (address
,
7009 TYPE_FIELD_BITPOS (type
, variant_field
)
7010 / TARGET_CHAR_BIT
), dval
);
7011 if (branch_type
== NULL
)
7014 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7015 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7016 TYPE_NFIELDS (rtype
) -= 1;
7020 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7021 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7022 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7023 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7025 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7027 value_free_to_mark (mark
);
7031 /* An ordinary record type (with fixed-length fields) that describes
7032 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7033 beginning of this section]. Any necessary discriminants' values
7034 should be in DVAL, a record value; it may be NULL if the object
7035 at ADDR itself contains any necessary discriminant values.
7036 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7037 values from the record are needed. Except in the case that DVAL,
7038 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7039 unchecked) is replaced by a particular branch of the variant.
7041 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7042 is questionable and may be removed. It can arise during the
7043 processing of an unconstrained-array-of-record type where all the
7044 variant branches have exactly the same size. This is because in
7045 such cases, the compiler does not bother to use the XVS convention
7046 when encoding the record. I am currently dubious of this
7047 shortcut and suspect the compiler should be altered. FIXME. */
7049 static struct type
*
7050 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7051 CORE_ADDR address
, struct value
*dval
)
7053 struct type
*templ_type
;
7055 if (TYPE_FIXED_INSTANCE (type0
))
7058 templ_type
= dynamic_template_type (type0
);
7060 if (templ_type
!= NULL
)
7061 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7062 else if (variant_field_index (type0
) >= 0)
7064 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7066 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7071 TYPE_FIXED_INSTANCE (type0
) = 1;
7077 /* An ordinary record type (with fixed-length fields) that describes
7078 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7079 union type. Any necessary discriminants' values should be in DVAL,
7080 a record value. That is, this routine selects the appropriate
7081 branch of the union at ADDR according to the discriminant value
7082 indicated in the union's type name. Returns VAR_TYPE0 itself if
7083 it represents a variant subject to a pragma Unchecked_Union. */
7085 static struct type
*
7086 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7087 CORE_ADDR address
, struct value
*dval
)
7090 struct type
*templ_type
;
7091 struct type
*var_type
;
7093 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7094 var_type
= TYPE_TARGET_TYPE (var_type0
);
7096 var_type
= var_type0
;
7098 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7100 if (templ_type
!= NULL
)
7101 var_type
= templ_type
;
7103 if (is_unchecked_variant (var_type
, value_type (dval
)))
7106 ada_which_variant_applies (var_type
,
7107 value_type (dval
), value_contents (dval
));
7110 return empty_record (TYPE_OBJFILE (var_type
));
7111 else if (is_dynamic_field (var_type
, which
))
7112 return to_fixed_record_type
7113 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7114 valaddr
, address
, dval
);
7115 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7117 to_fixed_record_type
7118 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7120 return TYPE_FIELD_TYPE (var_type
, which
);
7123 /* Assuming that TYPE0 is an array type describing the type of a value
7124 at ADDR, and that DVAL describes a record containing any
7125 discriminants used in TYPE0, returns a type for the value that
7126 contains no dynamic components (that is, no components whose sizes
7127 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7128 true, gives an error message if the resulting type's size is over
7131 static struct type
*
7132 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7135 struct type
*index_type_desc
;
7136 struct type
*result
;
7138 if (ada_is_packed_array_type (type0
) /* revisit? */
7139 || TYPE_FIXED_INSTANCE (type0
))
7142 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7143 if (index_type_desc
== NULL
)
7145 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7146 /* NOTE: elt_type---the fixed version of elt_type0---should never
7147 depend on the contents of the array in properly constructed
7149 /* Create a fixed version of the array element type.
7150 We're not providing the address of an element here,
7151 and thus the actual object value cannot be inspected to do
7152 the conversion. This should not be a problem, since arrays of
7153 unconstrained objects are not allowed. In particular, all
7154 the elements of an array of a tagged type should all be of
7155 the same type specified in the debugging info. No need to
7156 consult the object tag. */
7157 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7159 if (elt_type0
== elt_type
)
7162 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7163 elt_type
, TYPE_INDEX_TYPE (type0
));
7168 struct type
*elt_type0
;
7171 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7172 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7174 /* NOTE: result---the fixed version of elt_type0---should never
7175 depend on the contents of the array in properly constructed
7177 /* Create a fixed version of the array element type.
7178 We're not providing the address of an element here,
7179 and thus the actual object value cannot be inspected to do
7180 the conversion. This should not be a problem, since arrays of
7181 unconstrained objects are not allowed. In particular, all
7182 the elements of an array of a tagged type should all be of
7183 the same type specified in the debugging info. No need to
7184 consult the object tag. */
7186 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7187 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7189 struct type
*range_type
=
7190 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7191 dval
, TYPE_OBJFILE (type0
));
7192 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7193 result
, range_type
);
7195 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7196 error (_("array type with dynamic size is larger than varsize-limit"));
7199 TYPE_FIXED_INSTANCE (result
) = 1;
7204 /* A standard type (containing no dynamically sized components)
7205 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7206 DVAL describes a record containing any discriminants used in TYPE0,
7207 and may be NULL if there are none, or if the object of type TYPE at
7208 ADDRESS or in VALADDR contains these discriminants.
7210 If CHECK_TAG is not null, in the case of tagged types, this function
7211 attempts to locate the object's tag and use it to compute the actual
7212 type. However, when ADDRESS is null, we cannot use it to determine the
7213 location of the tag, and therefore compute the tagged type's actual type.
7214 So we return the tagged type without consulting the tag. */
7216 static struct type
*
7217 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7218 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7220 type
= ada_check_typedef (type
);
7221 switch (TYPE_CODE (type
))
7225 case TYPE_CODE_STRUCT
:
7227 struct type
*static_type
= to_static_fixed_type (type
);
7228 struct type
*fixed_record_type
=
7229 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7230 /* If STATIC_TYPE is a tagged type and we know the object's address,
7231 then we can determine its tag, and compute the object's actual
7232 type from there. Note that we have to use the fixed record
7233 type (the parent part of the record may have dynamic fields
7234 and the way the location of _tag is expressed may depend on
7237 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7239 struct type
*real_type
=
7240 type_from_tag (value_tag_from_contents_and_address
7244 if (real_type
!= NULL
)
7245 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7248 /* Check to see if there is a parallel ___XVZ variable.
7249 If there is, then it provides the actual size of our type. */
7250 else if (ada_type_name (fixed_record_type
) != NULL
)
7252 char *name
= ada_type_name (fixed_record_type
);
7253 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7257 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7258 size
= get_int_var_value (xvz_name
, &xvz_found
);
7259 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7261 fixed_record_type
= copy_type (fixed_record_type
);
7262 TYPE_LENGTH (fixed_record_type
) = size
;
7264 /* The FIXED_RECORD_TYPE may have be a stub. We have
7265 observed this when the debugging info is STABS, and
7266 apparently it is something that is hard to fix.
7268 In practice, we don't need the actual type definition
7269 at all, because the presence of the XVZ variable allows us
7270 to assume that there must be a XVS type as well, which we
7271 should be able to use later, when we need the actual type
7274 In the meantime, pretend that the "fixed" type we are
7275 returning is NOT a stub, because this can cause trouble
7276 when using this type to create new types targeting it.
7277 Indeed, the associated creation routines often check
7278 whether the target type is a stub and will try to replace
7279 it, thus using a type with the wrong size. This, in turn,
7280 might cause the new type to have the wrong size too.
7281 Consider the case of an array, for instance, where the size
7282 of the array is computed from the number of elements in
7283 our array multiplied by the size of its element. */
7284 TYPE_STUB (fixed_record_type
) = 0;
7287 return fixed_record_type
;
7289 case TYPE_CODE_ARRAY
:
7290 return to_fixed_array_type (type
, dval
, 1);
7291 case TYPE_CODE_UNION
:
7295 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7299 /* The same as ada_to_fixed_type_1, except that it preserves the type
7300 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7301 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7304 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7305 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7308 struct type
*fixed_type
=
7309 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7311 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7312 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7318 /* A standard (static-sized) type corresponding as well as possible to
7319 TYPE0, but based on no runtime data. */
7321 static struct type
*
7322 to_static_fixed_type (struct type
*type0
)
7329 if (TYPE_FIXED_INSTANCE (type0
))
7332 type0
= ada_check_typedef (type0
);
7334 switch (TYPE_CODE (type0
))
7338 case TYPE_CODE_STRUCT
:
7339 type
= dynamic_template_type (type0
);
7341 return template_to_static_fixed_type (type
);
7343 return template_to_static_fixed_type (type0
);
7344 case TYPE_CODE_UNION
:
7345 type
= ada_find_parallel_type (type0
, "___XVU");
7347 return template_to_static_fixed_type (type
);
7349 return template_to_static_fixed_type (type0
);
7353 /* A static approximation of TYPE with all type wrappers removed. */
7355 static struct type
*
7356 static_unwrap_type (struct type
*type
)
7358 if (ada_is_aligner_type (type
))
7360 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7361 if (ada_type_name (type1
) == NULL
)
7362 TYPE_NAME (type1
) = ada_type_name (type
);
7364 return static_unwrap_type (type1
);
7368 struct type
*raw_real_type
= ada_get_base_type (type
);
7369 if (raw_real_type
== type
)
7372 return to_static_fixed_type (raw_real_type
);
7376 /* In some cases, incomplete and private types require
7377 cross-references that are not resolved as records (for example,
7379 type FooP is access Foo;
7381 type Foo is array ...;
7382 ). In these cases, since there is no mechanism for producing
7383 cross-references to such types, we instead substitute for FooP a
7384 stub enumeration type that is nowhere resolved, and whose tag is
7385 the name of the actual type. Call these types "non-record stubs". */
7387 /* A type equivalent to TYPE that is not a non-record stub, if one
7388 exists, otherwise TYPE. */
7391 ada_check_typedef (struct type
*type
)
7396 CHECK_TYPEDEF (type
);
7397 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7398 || !TYPE_STUB (type
)
7399 || TYPE_TAG_NAME (type
) == NULL
)
7403 char *name
= TYPE_TAG_NAME (type
);
7404 struct type
*type1
= ada_find_any_type (name
);
7405 return (type1
== NULL
) ? type
: type1
;
7409 /* A value representing the data at VALADDR/ADDRESS as described by
7410 type TYPE0, but with a standard (static-sized) type that correctly
7411 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7412 type, then return VAL0 [this feature is simply to avoid redundant
7413 creation of struct values]. */
7415 static struct value
*
7416 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7419 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7420 if (type
== type0
&& val0
!= NULL
)
7423 return value_from_contents_and_address (type
, 0, address
);
7426 /* A value representing VAL, but with a standard (static-sized) type
7427 that correctly describes it. Does not necessarily create a new
7430 static struct value
*
7431 ada_to_fixed_value (struct value
*val
)
7433 return ada_to_fixed_value_create (value_type (val
),
7434 VALUE_ADDRESS (val
) + value_offset (val
),
7438 /* A value representing VAL, but with a standard (static-sized) type
7439 chosen to approximate the real type of VAL as well as possible, but
7440 without consulting any runtime values. For Ada dynamic-sized
7441 types, therefore, the type of the result is likely to be inaccurate. */
7443 static struct value
*
7444 ada_to_static_fixed_value (struct value
*val
)
7447 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7448 if (type
== value_type (val
))
7451 return coerce_unspec_val_to_type (val
, type
);
7457 /* Table mapping attribute numbers to names.
7458 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7460 static const char *attribute_names
[] = {
7478 ada_attribute_name (enum exp_opcode n
)
7480 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7481 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7483 return attribute_names
[0];
7486 /* Evaluate the 'POS attribute applied to ARG. */
7489 pos_atr (struct value
*arg
)
7491 struct value
*val
= coerce_ref (arg
);
7492 struct type
*type
= value_type (val
);
7494 if (!discrete_type_p (type
))
7495 error (_("'POS only defined on discrete types"));
7497 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7500 LONGEST v
= value_as_long (val
);
7502 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7504 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7507 error (_("enumeration value is invalid: can't find 'POS"));
7510 return value_as_long (val
);
7513 static struct value
*
7514 value_pos_atr (struct type
*type
, struct value
*arg
)
7516 return value_from_longest (type
, pos_atr (arg
));
7519 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7521 static struct value
*
7522 value_val_atr (struct type
*type
, struct value
*arg
)
7524 if (!discrete_type_p (type
))
7525 error (_("'VAL only defined on discrete types"));
7526 if (!integer_type_p (value_type (arg
)))
7527 error (_("'VAL requires integral argument"));
7529 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7531 long pos
= value_as_long (arg
);
7532 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7533 error (_("argument to 'VAL out of range"));
7534 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7537 return value_from_longest (type
, value_as_long (arg
));
7543 /* True if TYPE appears to be an Ada character type.
7544 [At the moment, this is true only for Character and Wide_Character;
7545 It is a heuristic test that could stand improvement]. */
7548 ada_is_character_type (struct type
*type
)
7552 /* If the type code says it's a character, then assume it really is,
7553 and don't check any further. */
7554 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7557 /* Otherwise, assume it's a character type iff it is a discrete type
7558 with a known character type name. */
7559 name
= ada_type_name (type
);
7560 return (name
!= NULL
7561 && (TYPE_CODE (type
) == TYPE_CODE_INT
7562 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7563 && (strcmp (name
, "character") == 0
7564 || strcmp (name
, "wide_character") == 0
7565 || strcmp (name
, "wide_wide_character") == 0
7566 || strcmp (name
, "unsigned char") == 0));
7569 /* True if TYPE appears to be an Ada string type. */
7572 ada_is_string_type (struct type
*type
)
7574 type
= ada_check_typedef (type
);
7576 && TYPE_CODE (type
) != TYPE_CODE_PTR
7577 && (ada_is_simple_array_type (type
)
7578 || ada_is_array_descriptor_type (type
))
7579 && ada_array_arity (type
) == 1)
7581 struct type
*elttype
= ada_array_element_type (type
, 1);
7583 return ada_is_character_type (elttype
);
7590 /* True if TYPE is a struct type introduced by the compiler to force the
7591 alignment of a value. Such types have a single field with a
7592 distinctive name. */
7595 ada_is_aligner_type (struct type
*type
)
7597 type
= ada_check_typedef (type
);
7599 /* If we can find a parallel XVS type, then the XVS type should
7600 be used instead of this type. And hence, this is not an aligner
7602 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7605 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7606 && TYPE_NFIELDS (type
) == 1
7607 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7610 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7611 the parallel type. */
7614 ada_get_base_type (struct type
*raw_type
)
7616 struct type
*real_type_namer
;
7617 struct type
*raw_real_type
;
7619 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7622 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7623 if (real_type_namer
== NULL
7624 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7625 || TYPE_NFIELDS (real_type_namer
) != 1)
7628 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7629 if (raw_real_type
== NULL
)
7632 return raw_real_type
;
7635 /* The type of value designated by TYPE, with all aligners removed. */
7638 ada_aligned_type (struct type
*type
)
7640 if (ada_is_aligner_type (type
))
7641 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7643 return ada_get_base_type (type
);
7647 /* The address of the aligned value in an object at address VALADDR
7648 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7651 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7653 if (ada_is_aligner_type (type
))
7654 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7656 TYPE_FIELD_BITPOS (type
,
7657 0) / TARGET_CHAR_BIT
);
7664 /* The printed representation of an enumeration literal with encoded
7665 name NAME. The value is good to the next call of ada_enum_name. */
7667 ada_enum_name (const char *name
)
7669 static char *result
;
7670 static size_t result_len
= 0;
7673 /* First, unqualify the enumeration name:
7674 1. Search for the last '.' character. If we find one, then skip
7675 all the preceeding characters, the unqualified name starts
7676 right after that dot.
7677 2. Otherwise, we may be debugging on a target where the compiler
7678 translates dots into "__". Search forward for double underscores,
7679 but stop searching when we hit an overloading suffix, which is
7680 of the form "__" followed by digits. */
7682 tmp
= strrchr (name
, '.');
7687 while ((tmp
= strstr (name
, "__")) != NULL
)
7689 if (isdigit (tmp
[2]))
7699 if (name
[1] == 'U' || name
[1] == 'W')
7701 if (sscanf (name
+ 2, "%x", &v
) != 1)
7707 GROW_VECT (result
, result_len
, 16);
7708 if (isascii (v
) && isprint (v
))
7709 xsnprintf (result
, result_len
, "'%c'", v
);
7710 else if (name
[1] == 'U')
7711 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7713 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7719 tmp
= strstr (name
, "__");
7721 tmp
= strstr (name
, "$");
7724 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7725 strncpy (result
, name
, tmp
- name
);
7726 result
[tmp
- name
] = '\0';
7734 static struct value
*
7735 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7738 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7739 (expect_type
, exp
, pos
, noside
);
7742 /* Evaluate the subexpression of EXP starting at *POS as for
7743 evaluate_type, updating *POS to point just past the evaluated
7746 static struct value
*
7747 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7749 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7750 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7753 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7756 static struct value
*
7757 unwrap_value (struct value
*val
)
7759 struct type
*type
= ada_check_typedef (value_type (val
));
7760 if (ada_is_aligner_type (type
))
7762 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7763 struct type
*val_type
= ada_check_typedef (value_type (v
));
7764 if (ada_type_name (val_type
) == NULL
)
7765 TYPE_NAME (val_type
) = ada_type_name (type
);
7767 return unwrap_value (v
);
7771 struct type
*raw_real_type
=
7772 ada_check_typedef (ada_get_base_type (type
));
7774 if (type
== raw_real_type
)
7778 coerce_unspec_val_to_type
7779 (val
, ada_to_fixed_type (raw_real_type
, 0,
7780 VALUE_ADDRESS (val
) + value_offset (val
),
7785 static struct value
*
7786 cast_to_fixed (struct type
*type
, struct value
*arg
)
7790 if (type
== value_type (arg
))
7792 else if (ada_is_fixed_point_type (value_type (arg
)))
7793 val
= ada_float_to_fixed (type
,
7794 ada_fixed_to_float (value_type (arg
),
7795 value_as_long (arg
)));
7798 DOUBLEST argd
= value_as_double (arg
);
7799 val
= ada_float_to_fixed (type
, argd
);
7802 return value_from_longest (type
, val
);
7805 static struct value
*
7806 cast_from_fixed (struct type
*type
, struct value
*arg
)
7808 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7809 value_as_long (arg
));
7810 return value_from_double (type
, val
);
7813 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7814 return the converted value. */
7816 static struct value
*
7817 coerce_for_assign (struct type
*type
, struct value
*val
)
7819 struct type
*type2
= value_type (val
);
7823 type2
= ada_check_typedef (type2
);
7824 type
= ada_check_typedef (type
);
7826 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7827 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7829 val
= ada_value_ind (val
);
7830 type2
= value_type (val
);
7833 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7834 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7836 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7837 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7838 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7839 error (_("Incompatible types in assignment"));
7840 deprecated_set_value_type (val
, type
);
7845 static struct value
*
7846 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7849 struct type
*type1
, *type2
;
7852 arg1
= coerce_ref (arg1
);
7853 arg2
= coerce_ref (arg2
);
7854 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7855 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7857 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7858 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7859 return value_binop (arg1
, arg2
, op
);
7868 return value_binop (arg1
, arg2
, op
);
7871 v2
= value_as_long (arg2
);
7873 error (_("second operand of %s must not be zero."), op_string (op
));
7875 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7876 return value_binop (arg1
, arg2
, op
);
7878 v1
= value_as_long (arg1
);
7883 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7884 v
+= v
> 0 ? -1 : 1;
7892 /* Should not reach this point. */
7896 val
= allocate_value (type1
);
7897 store_unsigned_integer (value_contents_raw (val
),
7898 TYPE_LENGTH (value_type (val
)), v
);
7903 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7905 if (ada_is_direct_array_type (value_type (arg1
))
7906 || ada_is_direct_array_type (value_type (arg2
)))
7908 /* Automatically dereference any array reference before
7909 we attempt to perform the comparison. */
7910 arg1
= ada_coerce_ref (arg1
);
7911 arg2
= ada_coerce_ref (arg2
);
7913 arg1
= ada_coerce_to_simple_array (arg1
);
7914 arg2
= ada_coerce_to_simple_array (arg2
);
7915 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7916 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7917 error (_("Attempt to compare array with non-array"));
7918 /* FIXME: The following works only for types whose
7919 representations use all bits (no padding or undefined bits)
7920 and do not have user-defined equality. */
7922 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7923 && memcmp (value_contents (arg1
), value_contents (arg2
),
7924 TYPE_LENGTH (value_type (arg1
))) == 0;
7926 return value_equal (arg1
, arg2
);
7929 /* Total number of component associations in the aggregate starting at
7930 index PC in EXP. Assumes that index PC is the start of an
7934 num_component_specs (struct expression
*exp
, int pc
)
7937 m
= exp
->elts
[pc
+ 1].longconst
;
7940 for (i
= 0; i
< m
; i
+= 1)
7942 switch (exp
->elts
[pc
].opcode
)
7948 n
+= exp
->elts
[pc
+ 1].longconst
;
7951 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7956 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7957 component of LHS (a simple array or a record), updating *POS past
7958 the expression, assuming that LHS is contained in CONTAINER. Does
7959 not modify the inferior's memory, nor does it modify LHS (unless
7960 LHS == CONTAINER). */
7963 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7964 struct expression
*exp
, int *pos
)
7966 struct value
*mark
= value_mark ();
7968 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7970 struct value
*index_val
= value_from_longest (builtin_type_int32
, index
);
7971 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7975 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7976 elt
= ada_to_fixed_value (unwrap_value (elt
));
7979 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7980 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7982 value_assign_to_component (container
, elt
,
7983 ada_evaluate_subexp (NULL
, exp
, pos
,
7986 value_free_to_mark (mark
);
7989 /* Assuming that LHS represents an lvalue having a record or array
7990 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7991 of that aggregate's value to LHS, advancing *POS past the
7992 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7993 lvalue containing LHS (possibly LHS itself). Does not modify
7994 the inferior's memory, nor does it modify the contents of
7995 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7997 static struct value
*
7998 assign_aggregate (struct value
*container
,
7999 struct value
*lhs
, struct expression
*exp
,
8000 int *pos
, enum noside noside
)
8002 struct type
*lhs_type
;
8003 int n
= exp
->elts
[*pos
+1].longconst
;
8004 LONGEST low_index
, high_index
;
8007 int max_indices
, num_indices
;
8008 int is_array_aggregate
;
8010 struct value
*mark
= value_mark ();
8013 if (noside
!= EVAL_NORMAL
)
8016 for (i
= 0; i
< n
; i
+= 1)
8017 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8021 container
= ada_coerce_ref (container
);
8022 if (ada_is_direct_array_type (value_type (container
)))
8023 container
= ada_coerce_to_simple_array (container
);
8024 lhs
= ada_coerce_ref (lhs
);
8025 if (!deprecated_value_modifiable (lhs
))
8026 error (_("Left operand of assignment is not a modifiable lvalue."));
8028 lhs_type
= value_type (lhs
);
8029 if (ada_is_direct_array_type (lhs_type
))
8031 lhs
= ada_coerce_to_simple_array (lhs
);
8032 lhs_type
= value_type (lhs
);
8033 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8034 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8035 is_array_aggregate
= 1;
8037 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8040 high_index
= num_visible_fields (lhs_type
) - 1;
8041 is_array_aggregate
= 0;
8044 error (_("Left-hand side must be array or record."));
8046 num_specs
= num_component_specs (exp
, *pos
- 3);
8047 max_indices
= 4 * num_specs
+ 4;
8048 indices
= alloca (max_indices
* sizeof (indices
[0]));
8049 indices
[0] = indices
[1] = low_index
- 1;
8050 indices
[2] = indices
[3] = high_index
+ 1;
8053 for (i
= 0; i
< n
; i
+= 1)
8055 switch (exp
->elts
[*pos
].opcode
)
8058 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8059 &num_indices
, max_indices
,
8060 low_index
, high_index
);
8063 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8064 &num_indices
, max_indices
,
8065 low_index
, high_index
);
8069 error (_("Misplaced 'others' clause"));
8070 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8071 num_indices
, low_index
, high_index
);
8074 error (_("Internal error: bad aggregate clause"));
8081 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8082 construct at *POS, updating *POS past the construct, given that
8083 the positions are relative to lower bound LOW, where HIGH is the
8084 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8085 updating *NUM_INDICES as needed. CONTAINER is as for
8086 assign_aggregate. */
8088 aggregate_assign_positional (struct value
*container
,
8089 struct value
*lhs
, struct expression
*exp
,
8090 int *pos
, LONGEST
*indices
, int *num_indices
,
8091 int max_indices
, LONGEST low
, LONGEST high
)
8093 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8095 if (ind
- 1 == high
)
8096 warning (_("Extra components in aggregate ignored."));
8099 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8101 assign_component (container
, lhs
, ind
, exp
, pos
);
8104 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8107 /* Assign into the components of LHS indexed by the OP_CHOICES
8108 construct at *POS, updating *POS past the construct, given that
8109 the allowable indices are LOW..HIGH. Record the indices assigned
8110 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8111 needed. CONTAINER is as for assign_aggregate. */
8113 aggregate_assign_from_choices (struct value
*container
,
8114 struct value
*lhs
, struct expression
*exp
,
8115 int *pos
, LONGEST
*indices
, int *num_indices
,
8116 int max_indices
, LONGEST low
, LONGEST high
)
8119 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8120 int choice_pos
, expr_pc
;
8121 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8123 choice_pos
= *pos
+= 3;
8125 for (j
= 0; j
< n_choices
; j
+= 1)
8126 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8128 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8130 for (j
= 0; j
< n_choices
; j
+= 1)
8132 LONGEST lower
, upper
;
8133 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8134 if (op
== OP_DISCRETE_RANGE
)
8137 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8139 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8144 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8155 name
= &exp
->elts
[choice_pos
+ 2].string
;
8158 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8161 error (_("Invalid record component association."));
8163 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8165 if (! find_struct_field (name
, value_type (lhs
), 0,
8166 NULL
, NULL
, NULL
, NULL
, &ind
))
8167 error (_("Unknown component name: %s."), name
);
8168 lower
= upper
= ind
;
8171 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8172 error (_("Index in component association out of bounds."));
8174 add_component_interval (lower
, upper
, indices
, num_indices
,
8176 while (lower
<= upper
)
8180 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8186 /* Assign the value of the expression in the OP_OTHERS construct in
8187 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8188 have not been previously assigned. The index intervals already assigned
8189 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8190 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8192 aggregate_assign_others (struct value
*container
,
8193 struct value
*lhs
, struct expression
*exp
,
8194 int *pos
, LONGEST
*indices
, int num_indices
,
8195 LONGEST low
, LONGEST high
)
8198 int expr_pc
= *pos
+1;
8200 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8203 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8207 assign_component (container
, lhs
, ind
, exp
, &pos
);
8210 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8213 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8214 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8215 modifying *SIZE as needed. It is an error if *SIZE exceeds
8216 MAX_SIZE. The resulting intervals do not overlap. */
8218 add_component_interval (LONGEST low
, LONGEST high
,
8219 LONGEST
* indices
, int *size
, int max_size
)
8222 for (i
= 0; i
< *size
; i
+= 2) {
8223 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8226 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8227 if (high
< indices
[kh
])
8229 if (low
< indices
[i
])
8231 indices
[i
+ 1] = indices
[kh
- 1];
8232 if (high
> indices
[i
+ 1])
8233 indices
[i
+ 1] = high
;
8234 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8235 *size
-= kh
- i
- 2;
8238 else if (high
< indices
[i
])
8242 if (*size
== max_size
)
8243 error (_("Internal error: miscounted aggregate components."));
8245 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8246 indices
[j
] = indices
[j
- 2];
8248 indices
[i
+ 1] = high
;
8251 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8254 static struct value
*
8255 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8257 if (type
== ada_check_typedef (value_type (arg2
)))
8260 if (ada_is_fixed_point_type (type
))
8261 return (cast_to_fixed (type
, arg2
));
8263 if (ada_is_fixed_point_type (value_type (arg2
)))
8264 return cast_from_fixed (type
, arg2
);
8266 return value_cast (type
, arg2
);
8269 static struct value
*
8270 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8271 int *pos
, enum noside noside
)
8274 int tem
, tem2
, tem3
;
8276 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8279 struct value
**argvec
;
8283 op
= exp
->elts
[pc
].opcode
;
8289 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8290 arg1
= unwrap_value (arg1
);
8292 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8293 then we need to perform the conversion manually, because
8294 evaluate_subexp_standard doesn't do it. This conversion is
8295 necessary in Ada because the different kinds of float/fixed
8296 types in Ada have different representations.
8298 Similarly, we need to perform the conversion from OP_LONG
8300 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8301 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8307 struct value
*result
;
8309 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8310 /* The result type will have code OP_STRING, bashed there from
8311 OP_ARRAY. Bash it back. */
8312 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8313 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8319 type
= exp
->elts
[pc
+ 1].type
;
8320 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8321 if (noside
== EVAL_SKIP
)
8323 arg1
= ada_value_cast (type
, arg1
, noside
);
8328 type
= exp
->elts
[pc
+ 1].type
;
8329 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8332 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8333 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8335 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8336 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8338 return ada_value_assign (arg1
, arg1
);
8340 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8341 except if the lhs of our assignment is a convenience variable.
8342 In the case of assigning to a convenience variable, the lhs
8343 should be exactly the result of the evaluation of the rhs. */
8344 type
= value_type (arg1
);
8345 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8347 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8348 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8350 if (ada_is_fixed_point_type (value_type (arg1
)))
8351 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8352 else if (ada_is_fixed_point_type (value_type (arg2
)))
8354 (_("Fixed-point values must be assigned to fixed-point variables"));
8356 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8357 return ada_value_assign (arg1
, arg2
);
8360 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8361 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8362 if (noside
== EVAL_SKIP
)
8364 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8365 return (value_from_longest
8367 value_as_long (arg1
) + value_as_long (arg2
)));
8368 if ((ada_is_fixed_point_type (value_type (arg1
))
8369 || ada_is_fixed_point_type (value_type (arg2
)))
8370 && value_type (arg1
) != value_type (arg2
))
8371 error (_("Operands of fixed-point addition must have the same type"));
8372 /* Do the addition, and cast the result to the type of the first
8373 argument. We cannot cast the result to a reference type, so if
8374 ARG1 is a reference type, find its underlying type. */
8375 type
= value_type (arg1
);
8376 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8377 type
= TYPE_TARGET_TYPE (type
);
8378 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8379 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8382 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8383 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8384 if (noside
== EVAL_SKIP
)
8386 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8387 return (value_from_longest
8389 value_as_long (arg1
) - value_as_long (arg2
)));
8390 if ((ada_is_fixed_point_type (value_type (arg1
))
8391 || ada_is_fixed_point_type (value_type (arg2
)))
8392 && value_type (arg1
) != value_type (arg2
))
8393 error (_("Operands of fixed-point subtraction must have the same type"));
8394 /* Do the substraction, and cast the result to the type of the first
8395 argument. We cannot cast the result to a reference type, so if
8396 ARG1 is a reference type, find its underlying type. */
8397 type
= value_type (arg1
);
8398 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8399 type
= TYPE_TARGET_TYPE (type
);
8400 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8401 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8407 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8408 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8409 if (noside
== EVAL_SKIP
)
8411 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8413 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8414 return value_zero (value_type (arg1
), not_lval
);
8418 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8419 if (ada_is_fixed_point_type (value_type (arg1
)))
8420 arg1
= cast_from_fixed (type
, arg1
);
8421 if (ada_is_fixed_point_type (value_type (arg2
)))
8422 arg2
= cast_from_fixed (type
, arg2
);
8423 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8424 return ada_value_binop (arg1
, arg2
, op
);
8428 case BINOP_NOTEQUAL
:
8429 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8430 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8431 if (noside
== EVAL_SKIP
)
8433 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8437 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8438 tem
= ada_value_equal (arg1
, arg2
);
8440 if (op
== BINOP_NOTEQUAL
)
8442 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8443 return value_from_longest (type
, (LONGEST
) tem
);
8446 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8447 if (noside
== EVAL_SKIP
)
8449 else if (ada_is_fixed_point_type (value_type (arg1
)))
8450 return value_cast (value_type (arg1
), value_neg (arg1
));
8453 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8454 return value_neg (arg1
);
8457 case BINOP_LOGICAL_AND
:
8458 case BINOP_LOGICAL_OR
:
8459 case UNOP_LOGICAL_NOT
:
8464 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8465 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8466 return value_cast (type
, val
);
8469 case BINOP_BITWISE_AND
:
8470 case BINOP_BITWISE_IOR
:
8471 case BINOP_BITWISE_XOR
:
8475 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8477 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8479 return value_cast (value_type (arg1
), val
);
8485 if (noside
== EVAL_SKIP
)
8490 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8491 /* Only encountered when an unresolved symbol occurs in a
8492 context other than a function call, in which case, it is
8494 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8495 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8496 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8498 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8499 if (ada_is_tagged_type (type
, 0))
8501 /* Tagged types are a little special in the fact that the real
8502 type is dynamic and can only be determined by inspecting the
8503 object's tag. This means that we need to get the object's
8504 value first (EVAL_NORMAL) and then extract the actual object
8507 Note that we cannot skip the final step where we extract
8508 the object type from its tag, because the EVAL_NORMAL phase
8509 results in dynamic components being resolved into fixed ones.
8510 This can cause problems when trying to print the type
8511 description of tagged types whose parent has a dynamic size:
8512 We use the type name of the "_parent" component in order
8513 to print the name of the ancestor type in the type description.
8514 If that component had a dynamic size, the resolution into
8515 a fixed type would result in the loss of that type name,
8516 thus preventing us from printing the name of the ancestor
8517 type in the type description. */
8518 struct type
*actual_type
;
8520 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8521 actual_type
= type_from_tag (ada_value_tag (arg1
));
8522 if (actual_type
== NULL
)
8523 /* If, for some reason, we were unable to determine
8524 the actual type from the tag, then use the static
8525 approximation that we just computed as a fallback.
8526 This can happen if the debugging information is
8527 incomplete, for instance. */
8530 return value_zero (actual_type
, not_lval
);
8535 (to_static_fixed_type
8536 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8542 unwrap_value (evaluate_subexp_standard
8543 (expect_type
, exp
, pos
, noside
));
8544 return ada_to_fixed_value (arg1
);
8550 /* Allocate arg vector, including space for the function to be
8551 called in argvec[0] and a terminating NULL. */
8552 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8554 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8556 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8557 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8558 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8559 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8562 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8563 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8566 if (noside
== EVAL_SKIP
)
8570 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8571 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8572 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8573 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8574 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8575 argvec
[0] = value_addr (argvec
[0]);
8577 type
= ada_check_typedef (value_type (argvec
[0]));
8578 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8580 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8582 case TYPE_CODE_FUNC
:
8583 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8585 case TYPE_CODE_ARRAY
:
8587 case TYPE_CODE_STRUCT
:
8588 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8589 argvec
[0] = ada_value_ind (argvec
[0]);
8590 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8593 error (_("cannot subscript or call something of type `%s'"),
8594 ada_type_name (value_type (argvec
[0])));
8599 switch (TYPE_CODE (type
))
8601 case TYPE_CODE_FUNC
:
8602 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8603 return allocate_value (TYPE_TARGET_TYPE (type
));
8604 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8605 case TYPE_CODE_STRUCT
:
8609 arity
= ada_array_arity (type
);
8610 type
= ada_array_element_type (type
, nargs
);
8612 error (_("cannot subscript or call a record"));
8614 error (_("wrong number of subscripts; expecting %d"), arity
);
8615 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8616 return value_zero (ada_aligned_type (type
), lval_memory
);
8618 unwrap_value (ada_value_subscript
8619 (argvec
[0], nargs
, argvec
+ 1));
8621 case TYPE_CODE_ARRAY
:
8622 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8624 type
= ada_array_element_type (type
, nargs
);
8626 error (_("element type of array unknown"));
8628 return value_zero (ada_aligned_type (type
), lval_memory
);
8631 unwrap_value (ada_value_subscript
8632 (ada_coerce_to_simple_array (argvec
[0]),
8633 nargs
, argvec
+ 1));
8634 case TYPE_CODE_PTR
: /* Pointer to array */
8635 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8636 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8638 type
= ada_array_element_type (type
, nargs
);
8640 error (_("element type of array unknown"));
8642 return value_zero (ada_aligned_type (type
), lval_memory
);
8645 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8646 nargs
, argvec
+ 1));
8649 error (_("Attempt to index or call something other than an "
8650 "array or function"));
8655 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8656 struct value
*low_bound_val
=
8657 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8658 struct value
*high_bound_val
=
8659 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8662 low_bound_val
= coerce_ref (low_bound_val
);
8663 high_bound_val
= coerce_ref (high_bound_val
);
8664 low_bound
= pos_atr (low_bound_val
);
8665 high_bound
= pos_atr (high_bound_val
);
8667 if (noside
== EVAL_SKIP
)
8670 /* If this is a reference to an aligner type, then remove all
8672 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8673 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8674 TYPE_TARGET_TYPE (value_type (array
)) =
8675 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8677 if (ada_is_packed_array_type (value_type (array
)))
8678 error (_("cannot slice a packed array"));
8680 /* If this is a reference to an array or an array lvalue,
8681 convert to a pointer. */
8682 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8683 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8684 && VALUE_LVAL (array
) == lval_memory
))
8685 array
= value_addr (array
);
8687 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8688 && ada_is_array_descriptor_type (ada_check_typedef
8689 (value_type (array
))))
8690 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8692 array
= ada_coerce_to_simple_array_ptr (array
);
8694 /* If we have more than one level of pointer indirection,
8695 dereference the value until we get only one level. */
8696 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8697 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8699 array
= value_ind (array
);
8701 /* Make sure we really do have an array type before going further,
8702 to avoid a SEGV when trying to get the index type or the target
8703 type later down the road if the debug info generated by
8704 the compiler is incorrect or incomplete. */
8705 if (!ada_is_simple_array_type (value_type (array
)))
8706 error (_("cannot take slice of non-array"));
8708 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8710 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8711 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8715 struct type
*arr_type0
=
8716 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8718 return ada_value_slice_from_ptr (array
, arr_type0
,
8719 longest_to_int (low_bound
),
8720 longest_to_int (high_bound
));
8723 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8725 else if (high_bound
< low_bound
)
8726 return empty_array (value_type (array
), low_bound
);
8728 return ada_value_slice (array
, longest_to_int (low_bound
),
8729 longest_to_int (high_bound
));
8734 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8735 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
8737 if (noside
== EVAL_SKIP
)
8740 switch (TYPE_CODE (type
))
8743 lim_warning (_("Membership test incompletely implemented; "
8744 "always returns true"));
8745 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8746 return value_from_longest (type
, (LONGEST
) 1);
8748 case TYPE_CODE_RANGE
:
8749 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
8750 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
8751 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8752 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8753 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8755 value_from_longest (type
,
8756 (value_less (arg1
, arg3
)
8757 || value_equal (arg1
, arg3
))
8758 && (value_less (arg2
, arg1
)
8759 || value_equal (arg2
, arg1
)));
8762 case BINOP_IN_BOUNDS
:
8764 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8765 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8767 if (noside
== EVAL_SKIP
)
8770 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8772 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8773 return value_zero (type
, not_lval
);
8776 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8778 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8779 error (_("invalid dimension number to 'range"));
8781 arg3
= ada_array_bound (arg2
, tem
, 1);
8782 arg2
= ada_array_bound (arg2
, tem
, 0);
8784 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8785 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8786 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8788 value_from_longest (type
,
8789 (value_less (arg1
, arg3
)
8790 || value_equal (arg1
, arg3
))
8791 && (value_less (arg2
, arg1
)
8792 || value_equal (arg2
, arg1
)));
8794 case TERNOP_IN_RANGE
:
8795 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8796 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8797 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8799 if (noside
== EVAL_SKIP
)
8802 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8803 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8804 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8806 value_from_longest (type
,
8807 (value_less (arg1
, arg3
)
8808 || value_equal (arg1
, arg3
))
8809 && (value_less (arg2
, arg1
)
8810 || value_equal (arg2
, arg1
)));
8816 struct type
*type_arg
;
8817 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8819 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8821 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
8825 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8829 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8830 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8831 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8834 if (noside
== EVAL_SKIP
)
8837 if (type_arg
== NULL
)
8839 arg1
= ada_coerce_ref (arg1
);
8841 if (ada_is_packed_array_type (value_type (arg1
)))
8842 arg1
= ada_coerce_to_simple_array (arg1
);
8844 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8845 error (_("invalid dimension number to '%s"),
8846 ada_attribute_name (op
));
8848 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8850 type
= ada_index_type (value_type (arg1
), tem
);
8853 (_("attempt to take bound of something that is not an array"));
8854 return allocate_value (type
);
8859 default: /* Should never happen. */
8860 error (_("unexpected attribute encountered"));
8862 return ada_array_bound (arg1
, tem
, 0);
8864 return ada_array_bound (arg1
, tem
, 1);
8866 return ada_array_length (arg1
, tem
);
8869 else if (discrete_type_p (type_arg
))
8871 struct type
*range_type
;
8872 char *name
= ada_type_name (type_arg
);
8874 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8876 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8877 if (range_type
== NULL
)
8878 range_type
= type_arg
;
8882 error (_("unexpected attribute encountered"));
8884 return value_from_longest
8885 (range_type
, discrete_type_low_bound (range_type
));
8887 return value_from_longest
8888 (range_type
, discrete_type_high_bound (range_type
));
8890 error (_("the 'length attribute applies only to array types"));
8893 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8894 error (_("unimplemented type attribute"));
8899 if (ada_is_packed_array_type (type_arg
))
8900 type_arg
= decode_packed_array_type (type_arg
);
8902 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8903 error (_("invalid dimension number to '%s"),
8904 ada_attribute_name (op
));
8906 type
= ada_index_type (type_arg
, tem
);
8909 (_("attempt to take bound of something that is not an array"));
8910 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8911 return allocate_value (type
);
8916 error (_("unexpected attribute encountered"));
8918 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8919 return value_from_longest (type
, low
);
8921 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8922 return value_from_longest (type
, high
);
8924 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8925 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8926 return value_from_longest (type
, high
- low
+ 1);
8932 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8933 if (noside
== EVAL_SKIP
)
8936 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8937 return value_zero (ada_tag_type (arg1
), not_lval
);
8939 return ada_value_tag (arg1
);
8943 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8944 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8945 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8946 if (noside
== EVAL_SKIP
)
8948 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8949 return value_zero (value_type (arg1
), not_lval
);
8952 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8953 return value_binop (arg1
, arg2
,
8954 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8957 case OP_ATR_MODULUS
:
8959 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
8960 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8962 if (noside
== EVAL_SKIP
)
8965 if (!ada_is_modular_type (type_arg
))
8966 error (_("'modulus must be applied to modular type"));
8968 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8969 ada_modulus (type_arg
));
8974 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8975 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8976 if (noside
== EVAL_SKIP
)
8978 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8979 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8980 return value_zero (type
, not_lval
);
8982 return value_pos_atr (type
, arg1
);
8985 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8986 type
= value_type (arg1
);
8988 /* If the argument is a reference, then dereference its type, since
8989 the user is really asking for the size of the actual object,
8990 not the size of the pointer. */
8991 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
8992 type
= TYPE_TARGET_TYPE (type
);
8994 if (noside
== EVAL_SKIP
)
8996 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8997 return value_zero (builtin_type_int32
, not_lval
);
8999 return value_from_longest (builtin_type_int32
,
9000 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9003 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9004 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9005 type
= exp
->elts
[pc
+ 2].type
;
9006 if (noside
== EVAL_SKIP
)
9008 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9009 return value_zero (type
, not_lval
);
9011 return value_val_atr (type
, arg1
);
9014 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9015 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9016 if (noside
== EVAL_SKIP
)
9018 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9019 return value_zero (value_type (arg1
), not_lval
);
9022 /* For integer exponentiation operations,
9023 only promote the first argument. */
9024 if (is_integral_type (value_type (arg2
)))
9025 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9027 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9029 return value_binop (arg1
, arg2
, op
);
9033 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9034 if (noside
== EVAL_SKIP
)
9040 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9041 if (noside
== EVAL_SKIP
)
9043 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9044 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9045 return value_neg (arg1
);
9050 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9051 if (noside
== EVAL_SKIP
)
9053 type
= ada_check_typedef (value_type (arg1
));
9054 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9056 if (ada_is_array_descriptor_type (type
))
9057 /* GDB allows dereferencing GNAT array descriptors. */
9059 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9060 if (arrType
== NULL
)
9061 error (_("Attempt to dereference null array pointer."));
9062 return value_at_lazy (arrType
, 0);
9064 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9065 || TYPE_CODE (type
) == TYPE_CODE_REF
9066 /* In C you can dereference an array to get the 1st elt. */
9067 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9069 type
= to_static_fixed_type
9071 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9073 return value_zero (type
, lval_memory
);
9075 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9077 /* GDB allows dereferencing an int. */
9078 if (expect_type
== NULL
)
9079 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9084 to_static_fixed_type (ada_aligned_type (expect_type
));
9085 return value_zero (expect_type
, lval_memory
);
9089 error (_("Attempt to take contents of a non-pointer value."));
9091 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9092 type
= ada_check_typedef (value_type (arg1
));
9094 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9095 /* GDB allows dereferencing an int. If we were given
9096 the expect_type, then use that as the target type.
9097 Otherwise, assume that the target type is an int. */
9099 if (expect_type
!= NULL
)
9100 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9103 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9104 (CORE_ADDR
) value_as_address (arg1
));
9107 if (ada_is_array_descriptor_type (type
))
9108 /* GDB allows dereferencing GNAT array descriptors. */
9109 return ada_coerce_to_simple_array (arg1
);
9111 return ada_value_ind (arg1
);
9113 case STRUCTOP_STRUCT
:
9114 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9115 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9116 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9117 if (noside
== EVAL_SKIP
)
9119 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9121 struct type
*type1
= value_type (arg1
);
9122 if (ada_is_tagged_type (type1
, 1))
9124 type
= ada_lookup_struct_elt_type (type1
,
9125 &exp
->elts
[pc
+ 2].string
,
9128 /* In this case, we assume that the field COULD exist
9129 in some extension of the type. Return an object of
9130 "type" void, which will match any formal
9131 (see ada_type_match). */
9132 return value_zero (builtin_type_void
, lval_memory
);
9136 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9139 return value_zero (ada_aligned_type (type
), lval_memory
);
9143 ada_to_fixed_value (unwrap_value
9144 (ada_value_struct_elt
9145 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9147 /* The value is not supposed to be used. This is here to make it
9148 easier to accommodate expressions that contain types. */
9150 if (noside
== EVAL_SKIP
)
9152 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9153 return allocate_value (exp
->elts
[pc
+ 1].type
);
9155 error (_("Attempt to use a type name as an expression"));
9160 case OP_DISCRETE_RANGE
:
9163 if (noside
== EVAL_NORMAL
)
9167 error (_("Undefined name, ambiguous name, or renaming used in "
9168 "component association: %s."), &exp
->elts
[pc
+2].string
);
9170 error (_("Aggregates only allowed on the right of an assignment"));
9172 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9175 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9177 for (tem
= 0; tem
< nargs
; tem
+= 1)
9178 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9183 return value_from_longest (builtin_type_int8
, (LONGEST
) 1);
9189 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9190 type name that encodes the 'small and 'delta information.
9191 Otherwise, return NULL. */
9194 fixed_type_info (struct type
*type
)
9196 const char *name
= ada_type_name (type
);
9197 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9199 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9201 const char *tail
= strstr (name
, "___XF_");
9207 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9208 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9213 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9216 ada_is_fixed_point_type (struct type
*type
)
9218 return fixed_type_info (type
) != NULL
;
9221 /* Return non-zero iff TYPE represents a System.Address type. */
9224 ada_is_system_address_type (struct type
*type
)
9226 return (TYPE_NAME (type
)
9227 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9230 /* Assuming that TYPE is the representation of an Ada fixed-point
9231 type, return its delta, or -1 if the type is malformed and the
9232 delta cannot be determined. */
9235 ada_delta (struct type
*type
)
9237 const char *encoding
= fixed_type_info (type
);
9240 /* Strictly speaking, num and den are encoded as integer. However,
9241 they may not fit into a long, and they will have to be converted
9242 to DOUBLEST anyway. So scan them as DOUBLEST. */
9243 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9250 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9251 factor ('SMALL value) associated with the type. */
9254 scaling_factor (struct type
*type
)
9256 const char *encoding
= fixed_type_info (type
);
9257 DOUBLEST num0
, den0
, num1
, den1
;
9260 /* Strictly speaking, num's and den's are encoded as integer. However,
9261 they may not fit into a long, and they will have to be converted
9262 to DOUBLEST anyway. So scan them as DOUBLEST. */
9263 n
= sscanf (encoding
,
9264 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9265 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9266 &num0
, &den0
, &num1
, &den1
);
9277 /* Assuming that X is the representation of a value of fixed-point
9278 type TYPE, return its floating-point equivalent. */
9281 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9283 return (DOUBLEST
) x
*scaling_factor (type
);
9286 /* The representation of a fixed-point value of type TYPE
9287 corresponding to the value X. */
9290 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9292 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9296 /* VAX floating formats */
9298 /* Non-zero iff TYPE represents one of the special VAX floating-point
9302 ada_is_vax_floating_type (struct type
*type
)
9305 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9308 && (TYPE_CODE (type
) == TYPE_CODE_INT
9309 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9310 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9313 /* The type of special VAX floating-point type this is, assuming
9314 ada_is_vax_floating_point. */
9317 ada_vax_float_type_suffix (struct type
*type
)
9319 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9322 /* A value representing the special debugging function that outputs
9323 VAX floating-point values of the type represented by TYPE. Assumes
9324 ada_is_vax_floating_type (TYPE). */
9327 ada_vax_float_print_function (struct type
*type
)
9329 switch (ada_vax_float_type_suffix (type
))
9332 return get_var_value ("DEBUG_STRING_F", 0);
9334 return get_var_value ("DEBUG_STRING_D", 0);
9336 return get_var_value ("DEBUG_STRING_G", 0);
9338 error (_("invalid VAX floating-point type"));
9345 /* Scan STR beginning at position K for a discriminant name, and
9346 return the value of that discriminant field of DVAL in *PX. If
9347 PNEW_K is not null, put the position of the character beyond the
9348 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9349 not alter *PX and *PNEW_K if unsuccessful. */
9352 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9355 static char *bound_buffer
= NULL
;
9356 static size_t bound_buffer_len
= 0;
9359 struct value
*bound_val
;
9361 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9364 pend
= strstr (str
+ k
, "__");
9368 k
+= strlen (bound
);
9372 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9373 bound
= bound_buffer
;
9374 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9375 bound
[pend
- (str
+ k
)] = '\0';
9379 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9380 if (bound_val
== NULL
)
9383 *px
= value_as_long (bound_val
);
9389 /* Value of variable named NAME in the current environment. If
9390 no such variable found, then if ERR_MSG is null, returns 0, and
9391 otherwise causes an error with message ERR_MSG. */
9393 static struct value
*
9394 get_var_value (char *name
, char *err_msg
)
9396 struct ada_symbol_info
*syms
;
9399 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9404 if (err_msg
== NULL
)
9407 error (("%s"), err_msg
);
9410 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9413 /* Value of integer variable named NAME in the current environment. If
9414 no such variable found, returns 0, and sets *FLAG to 0. If
9415 successful, sets *FLAG to 1. */
9418 get_int_var_value (char *name
, int *flag
)
9420 struct value
*var_val
= get_var_value (name
, 0);
9432 return value_as_long (var_val
);
9437 /* Return a range type whose base type is that of the range type named
9438 NAME in the current environment, and whose bounds are calculated
9439 from NAME according to the GNAT range encoding conventions.
9440 Extract discriminant values, if needed, from DVAL. If a new type
9441 must be created, allocate in OBJFILE's space. The bounds
9442 information, in general, is encoded in NAME, the base type given in
9443 the named range type. */
9445 static struct type
*
9446 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9448 struct type
*raw_type
= ada_find_any_type (name
);
9449 struct type
*base_type
;
9452 if (raw_type
== NULL
)
9453 base_type
= builtin_type_int32
;
9454 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9455 base_type
= TYPE_TARGET_TYPE (raw_type
);
9457 base_type
= raw_type
;
9459 subtype_info
= strstr (name
, "___XD");
9460 if (subtype_info
== NULL
)
9462 LONGEST L
= discrete_type_low_bound (raw_type
);
9463 LONGEST U
= discrete_type_high_bound (raw_type
);
9464 if (L
< INT_MIN
|| U
> INT_MAX
)
9467 return create_range_type (alloc_type (objfile
), raw_type
,
9468 discrete_type_low_bound (raw_type
),
9469 discrete_type_high_bound (raw_type
));
9473 static char *name_buf
= NULL
;
9474 static size_t name_len
= 0;
9475 int prefix_len
= subtype_info
- name
;
9481 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9482 strncpy (name_buf
, name
, prefix_len
);
9483 name_buf
[prefix_len
] = '\0';
9486 bounds_str
= strchr (subtype_info
, '_');
9489 if (*subtype_info
== 'L')
9491 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9492 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9494 if (bounds_str
[n
] == '_')
9496 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9503 strcpy (name_buf
+ prefix_len
, "___L");
9504 L
= get_int_var_value (name_buf
, &ok
);
9507 lim_warning (_("Unknown lower bound, using 1."));
9512 if (*subtype_info
== 'U')
9514 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9515 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9521 strcpy (name_buf
+ prefix_len
, "___U");
9522 U
= get_int_var_value (name_buf
, &ok
);
9525 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9530 if (objfile
== NULL
)
9531 objfile
= TYPE_OBJFILE (base_type
);
9532 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9533 TYPE_NAME (type
) = name
;
9538 /* True iff NAME is the name of a range type. */
9541 ada_is_range_type_name (const char *name
)
9543 return (name
!= NULL
&& strstr (name
, "___XD"));
9549 /* True iff TYPE is an Ada modular type. */
9552 ada_is_modular_type (struct type
*type
)
9554 struct type
*subranged_type
= base_type (type
);
9556 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9557 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9558 && TYPE_UNSIGNED (subranged_type
));
9561 /* Try to determine the lower and upper bounds of the given modular type
9562 using the type name only. Return non-zero and set L and U as the lower
9563 and upper bounds (respectively) if successful. */
9566 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9568 char *name
= ada_type_name (type
);
9576 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9577 we are looking for static bounds, which means an __XDLU suffix.
9578 Moreover, we know that the lower bound of modular types is always
9579 zero, so the actual suffix should start with "__XDLU_0__", and
9580 then be followed by the upper bound value. */
9581 suffix
= strstr (name
, "__XDLU_0__");
9585 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9588 *modulus
= (ULONGEST
) U
+ 1;
9592 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9595 ada_modulus (struct type
*type
)
9599 /* Normally, the modulus of a modular type is equal to the value of
9600 its upper bound + 1. However, the upper bound is currently stored
9601 as an int, which is not always big enough to hold the actual bound
9602 value. To workaround this, try to take advantage of the encoding
9603 that GNAT uses with with discrete types. To avoid some unnecessary
9604 parsing, we do this only when the size of TYPE is greater than
9605 the size of the field holding the bound. */
9606 if (TYPE_LENGTH (type
) > sizeof (TYPE_HIGH_BOUND (type
))
9607 && ada_modulus_from_name (type
, &modulus
))
9610 return (ULONGEST
) (unsigned int) TYPE_HIGH_BOUND (type
) + 1;
9614 /* Ada exception catchpoint support:
9615 ---------------------------------
9617 We support 3 kinds of exception catchpoints:
9618 . catchpoints on Ada exceptions
9619 . catchpoints on unhandled Ada exceptions
9620 . catchpoints on failed assertions
9622 Exceptions raised during failed assertions, or unhandled exceptions
9623 could perfectly be caught with the general catchpoint on Ada exceptions.
9624 However, we can easily differentiate these two special cases, and having
9625 the option to distinguish these two cases from the rest can be useful
9626 to zero-in on certain situations.
9628 Exception catchpoints are a specialized form of breakpoint,
9629 since they rely on inserting breakpoints inside known routines
9630 of the GNAT runtime. The implementation therefore uses a standard
9631 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9634 Support in the runtime for exception catchpoints have been changed
9635 a few times already, and these changes affect the implementation
9636 of these catchpoints. In order to be able to support several
9637 variants of the runtime, we use a sniffer that will determine
9638 the runtime variant used by the program being debugged.
9640 At this time, we do not support the use of conditions on Ada exception
9641 catchpoints. The COND and COND_STRING fields are therefore set
9642 to NULL (most of the time, see below).
9644 Conditions where EXP_STRING, COND, and COND_STRING are used:
9646 When a user specifies the name of a specific exception in the case
9647 of catchpoints on Ada exceptions, we store the name of that exception
9648 in the EXP_STRING. We then translate this request into an actual
9649 condition stored in COND_STRING, and then parse it into an expression
9652 /* The different types of catchpoints that we introduced for catching
9655 enum exception_catchpoint_kind
9658 ex_catch_exception_unhandled
,
9662 /* Ada's standard exceptions. */
9664 static char *standard_exc
[] = {
9671 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9673 /* A structure that describes how to support exception catchpoints
9674 for a given executable. */
9676 struct exception_support_info
9678 /* The name of the symbol to break on in order to insert
9679 a catchpoint on exceptions. */
9680 const char *catch_exception_sym
;
9682 /* The name of the symbol to break on in order to insert
9683 a catchpoint on unhandled exceptions. */
9684 const char *catch_exception_unhandled_sym
;
9686 /* The name of the symbol to break on in order to insert
9687 a catchpoint on failed assertions. */
9688 const char *catch_assert_sym
;
9690 /* Assuming that the inferior just triggered an unhandled exception
9691 catchpoint, this function is responsible for returning the address
9692 in inferior memory where the name of that exception is stored.
9693 Return zero if the address could not be computed. */
9694 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9697 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9698 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9700 /* The following exception support info structure describes how to
9701 implement exception catchpoints with the latest version of the
9702 Ada runtime (as of 2007-03-06). */
9704 static const struct exception_support_info default_exception_support_info
=
9706 "__gnat_debug_raise_exception", /* catch_exception_sym */
9707 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9708 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9709 ada_unhandled_exception_name_addr
9712 /* The following exception support info structure describes how to
9713 implement exception catchpoints with a slightly older version
9714 of the Ada runtime. */
9716 static const struct exception_support_info exception_support_info_fallback
=
9718 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9719 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9720 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9721 ada_unhandled_exception_name_addr_from_raise
9724 /* For each executable, we sniff which exception info structure to use
9725 and cache it in the following global variable. */
9727 static const struct exception_support_info
*exception_info
= NULL
;
9729 /* Inspect the Ada runtime and determine which exception info structure
9730 should be used to provide support for exception catchpoints.
9732 This function will always set exception_info, or raise an error. */
9735 ada_exception_support_info_sniffer (void)
9739 /* If the exception info is already known, then no need to recompute it. */
9740 if (exception_info
!= NULL
)
9743 /* Check the latest (default) exception support info. */
9744 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9748 exception_info
= &default_exception_support_info
;
9752 /* Try our fallback exception suport info. */
9753 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9757 exception_info
= &exception_support_info_fallback
;
9761 /* Sometimes, it is normal for us to not be able to find the routine
9762 we are looking for. This happens when the program is linked with
9763 the shared version of the GNAT runtime, and the program has not been
9764 started yet. Inform the user of these two possible causes if
9767 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9768 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9770 /* If the symbol does not exist, then check that the program is
9771 already started, to make sure that shared libraries have been
9772 loaded. If it is not started, this may mean that the symbol is
9773 in a shared library. */
9775 if (ptid_get_pid (inferior_ptid
) == 0)
9776 error (_("Unable to insert catchpoint. Try to start the program first."));
9778 /* At this point, we know that we are debugging an Ada program and
9779 that the inferior has been started, but we still are not able to
9780 find the run-time symbols. That can mean that we are in
9781 configurable run time mode, or that a-except as been optimized
9782 out by the linker... In any case, at this point it is not worth
9783 supporting this feature. */
9785 error (_("Cannot insert catchpoints in this configuration."));
9788 /* An observer of "executable_changed" events.
9789 Its role is to clear certain cached values that need to be recomputed
9790 each time a new executable is loaded by GDB. */
9793 ada_executable_changed_observer (void)
9795 /* If the executable changed, then it is possible that the Ada runtime
9796 is different. So we need to invalidate the exception support info
9798 exception_info
= NULL
;
9801 /* Return the name of the function at PC, NULL if could not find it.
9802 This function only checks the debugging information, not the symbol
9806 function_name_from_pc (CORE_ADDR pc
)
9810 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9816 /* True iff FRAME is very likely to be that of a function that is
9817 part of the runtime system. This is all very heuristic, but is
9818 intended to be used as advice as to what frames are uninteresting
9822 is_known_support_routine (struct frame_info
*frame
)
9824 struct symtab_and_line sal
;
9828 /* If this code does not have any debugging information (no symtab),
9829 This cannot be any user code. */
9831 find_frame_sal (frame
, &sal
);
9832 if (sal
.symtab
== NULL
)
9835 /* If there is a symtab, but the associated source file cannot be
9836 located, then assume this is not user code: Selecting a frame
9837 for which we cannot display the code would not be very helpful
9838 for the user. This should also take care of case such as VxWorks
9839 where the kernel has some debugging info provided for a few units. */
9841 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9844 /* Check the unit filename againt the Ada runtime file naming.
9845 We also check the name of the objfile against the name of some
9846 known system libraries that sometimes come with debugging info
9849 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9851 re_comp (known_runtime_file_name_patterns
[i
]);
9852 if (re_exec (sal
.symtab
->filename
))
9854 if (sal
.symtab
->objfile
!= NULL
9855 && re_exec (sal
.symtab
->objfile
->name
))
9859 /* Check whether the function is a GNAT-generated entity. */
9861 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9862 if (func_name
== NULL
)
9865 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9867 re_comp (known_auxiliary_function_name_patterns
[i
]);
9868 if (re_exec (func_name
))
9875 /* Find the first frame that contains debugging information and that is not
9876 part of the Ada run-time, starting from FI and moving upward. */
9879 ada_find_printable_frame (struct frame_info
*fi
)
9881 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9883 if (!is_known_support_routine (fi
))
9892 /* Assuming that the inferior just triggered an unhandled exception
9893 catchpoint, return the address in inferior memory where the name
9894 of the exception is stored.
9896 Return zero if the address could not be computed. */
9899 ada_unhandled_exception_name_addr (void)
9901 return parse_and_eval_address ("e.full_name");
9904 /* Same as ada_unhandled_exception_name_addr, except that this function
9905 should be used when the inferior uses an older version of the runtime,
9906 where the exception name needs to be extracted from a specific frame
9907 several frames up in the callstack. */
9910 ada_unhandled_exception_name_addr_from_raise (void)
9913 struct frame_info
*fi
;
9915 /* To determine the name of this exception, we need to select
9916 the frame corresponding to RAISE_SYM_NAME. This frame is
9917 at least 3 levels up, so we simply skip the first 3 frames
9918 without checking the name of their associated function. */
9919 fi
= get_current_frame ();
9920 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9922 fi
= get_prev_frame (fi
);
9926 const char *func_name
=
9927 function_name_from_pc (get_frame_address_in_block (fi
));
9928 if (func_name
!= NULL
9929 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9930 break; /* We found the frame we were looking for... */
9931 fi
= get_prev_frame (fi
);
9938 return parse_and_eval_address ("id.full_name");
9941 /* Assuming the inferior just triggered an Ada exception catchpoint
9942 (of any type), return the address in inferior memory where the name
9943 of the exception is stored, if applicable.
9945 Return zero if the address could not be computed, or if not relevant. */
9948 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9949 struct breakpoint
*b
)
9953 case ex_catch_exception
:
9954 return (parse_and_eval_address ("e.full_name"));
9957 case ex_catch_exception_unhandled
:
9958 return exception_info
->unhandled_exception_name_addr ();
9961 case ex_catch_assert
:
9962 return 0; /* Exception name is not relevant in this case. */
9966 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9970 return 0; /* Should never be reached. */
9973 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9974 any error that ada_exception_name_addr_1 might cause to be thrown.
9975 When an error is intercepted, a warning with the error message is printed,
9976 and zero is returned. */
9979 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9980 struct breakpoint
*b
)
9982 struct gdb_exception e
;
9983 CORE_ADDR result
= 0;
9985 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9987 result
= ada_exception_name_addr_1 (ex
, b
);
9992 warning (_("failed to get exception name: %s"), e
.message
);
9999 /* Implement the PRINT_IT method in the breakpoint_ops structure
10000 for all exception catchpoint kinds. */
10002 static enum print_stop_action
10003 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10005 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10006 char exception_name
[256];
10010 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10011 exception_name
[sizeof (exception_name
) - 1] = '\0';
10014 ada_find_printable_frame (get_current_frame ());
10016 annotate_catchpoint (b
->number
);
10019 case ex_catch_exception
:
10021 printf_filtered (_("\nCatchpoint %d, %s at "),
10022 b
->number
, exception_name
);
10024 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10026 case ex_catch_exception_unhandled
:
10028 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10029 b
->number
, exception_name
);
10031 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10034 case ex_catch_assert
:
10035 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10040 return PRINT_SRC_AND_LOC
;
10043 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10044 for all exception catchpoint kinds. */
10047 print_one_exception (enum exception_catchpoint_kind ex
,
10048 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10050 struct value_print_options opts
;
10052 get_user_print_options (&opts
);
10053 if (opts
.addressprint
)
10055 annotate_field (4);
10056 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10059 annotate_field (5);
10060 *last_addr
= b
->loc
->address
;
10063 case ex_catch_exception
:
10064 if (b
->exp_string
!= NULL
)
10066 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10068 ui_out_field_string (uiout
, "what", msg
);
10072 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10076 case ex_catch_exception_unhandled
:
10077 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10080 case ex_catch_assert
:
10081 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10085 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10090 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10091 for all exception catchpoint kinds. */
10094 print_mention_exception (enum exception_catchpoint_kind ex
,
10095 struct breakpoint
*b
)
10099 case ex_catch_exception
:
10100 if (b
->exp_string
!= NULL
)
10101 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10102 b
->number
, b
->exp_string
);
10104 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10108 case ex_catch_exception_unhandled
:
10109 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10113 case ex_catch_assert
:
10114 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10118 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10123 /* Virtual table for "catch exception" breakpoints. */
10125 static enum print_stop_action
10126 print_it_catch_exception (struct breakpoint
*b
)
10128 return print_it_exception (ex_catch_exception
, b
);
10132 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10134 print_one_exception (ex_catch_exception
, b
, last_addr
);
10138 print_mention_catch_exception (struct breakpoint
*b
)
10140 print_mention_exception (ex_catch_exception
, b
);
10143 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10147 NULL
, /* breakpoint_hit */
10148 print_it_catch_exception
,
10149 print_one_catch_exception
,
10150 print_mention_catch_exception
10153 /* Virtual table for "catch exception unhandled" breakpoints. */
10155 static enum print_stop_action
10156 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10158 return print_it_exception (ex_catch_exception_unhandled
, b
);
10162 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10164 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10168 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10170 print_mention_exception (ex_catch_exception_unhandled
, b
);
10173 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10176 NULL
, /* breakpoint_hit */
10177 print_it_catch_exception_unhandled
,
10178 print_one_catch_exception_unhandled
,
10179 print_mention_catch_exception_unhandled
10182 /* Virtual table for "catch assert" breakpoints. */
10184 static enum print_stop_action
10185 print_it_catch_assert (struct breakpoint
*b
)
10187 return print_it_exception (ex_catch_assert
, b
);
10191 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10193 print_one_exception (ex_catch_assert
, b
, last_addr
);
10197 print_mention_catch_assert (struct breakpoint
*b
)
10199 print_mention_exception (ex_catch_assert
, b
);
10202 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10205 NULL
, /* breakpoint_hit */
10206 print_it_catch_assert
,
10207 print_one_catch_assert
,
10208 print_mention_catch_assert
10211 /* Return non-zero if B is an Ada exception catchpoint. */
10214 ada_exception_catchpoint_p (struct breakpoint
*b
)
10216 return (b
->ops
== &catch_exception_breakpoint_ops
10217 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10218 || b
->ops
== &catch_assert_breakpoint_ops
);
10221 /* Return a newly allocated copy of the first space-separated token
10222 in ARGSP, and then adjust ARGSP to point immediately after that
10225 Return NULL if ARGPS does not contain any more tokens. */
10228 ada_get_next_arg (char **argsp
)
10230 char *args
= *argsp
;
10234 /* Skip any leading white space. */
10236 while (isspace (*args
))
10239 if (args
[0] == '\0')
10240 return NULL
; /* No more arguments. */
10242 /* Find the end of the current argument. */
10245 while (*end
!= '\0' && !isspace (*end
))
10248 /* Adjust ARGSP to point to the start of the next argument. */
10252 /* Make a copy of the current argument and return it. */
10254 result
= xmalloc (end
- args
+ 1);
10255 strncpy (result
, args
, end
- args
);
10256 result
[end
- args
] = '\0';
10261 /* Split the arguments specified in a "catch exception" command.
10262 Set EX to the appropriate catchpoint type.
10263 Set EXP_STRING to the name of the specific exception if
10264 specified by the user. */
10267 catch_ada_exception_command_split (char *args
,
10268 enum exception_catchpoint_kind
*ex
,
10271 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10272 char *exception_name
;
10274 exception_name
= ada_get_next_arg (&args
);
10275 make_cleanup (xfree
, exception_name
);
10277 /* Check that we do not have any more arguments. Anything else
10280 while (isspace (*args
))
10283 if (args
[0] != '\0')
10284 error (_("Junk at end of expression"));
10286 discard_cleanups (old_chain
);
10288 if (exception_name
== NULL
)
10290 /* Catch all exceptions. */
10291 *ex
= ex_catch_exception
;
10292 *exp_string
= NULL
;
10294 else if (strcmp (exception_name
, "unhandled") == 0)
10296 /* Catch unhandled exceptions. */
10297 *ex
= ex_catch_exception_unhandled
;
10298 *exp_string
= NULL
;
10302 /* Catch a specific exception. */
10303 *ex
= ex_catch_exception
;
10304 *exp_string
= exception_name
;
10308 /* Return the name of the symbol on which we should break in order to
10309 implement a catchpoint of the EX kind. */
10311 static const char *
10312 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10314 gdb_assert (exception_info
!= NULL
);
10318 case ex_catch_exception
:
10319 return (exception_info
->catch_exception_sym
);
10321 case ex_catch_exception_unhandled
:
10322 return (exception_info
->catch_exception_unhandled_sym
);
10324 case ex_catch_assert
:
10325 return (exception_info
->catch_assert_sym
);
10328 internal_error (__FILE__
, __LINE__
,
10329 _("unexpected catchpoint kind (%d)"), ex
);
10333 /* Return the breakpoint ops "virtual table" used for catchpoints
10336 static struct breakpoint_ops
*
10337 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10341 case ex_catch_exception
:
10342 return (&catch_exception_breakpoint_ops
);
10344 case ex_catch_exception_unhandled
:
10345 return (&catch_exception_unhandled_breakpoint_ops
);
10347 case ex_catch_assert
:
10348 return (&catch_assert_breakpoint_ops
);
10351 internal_error (__FILE__
, __LINE__
,
10352 _("unexpected catchpoint kind (%d)"), ex
);
10356 /* Return the condition that will be used to match the current exception
10357 being raised with the exception that the user wants to catch. This
10358 assumes that this condition is used when the inferior just triggered
10359 an exception catchpoint.
10361 The string returned is a newly allocated string that needs to be
10362 deallocated later. */
10365 ada_exception_catchpoint_cond_string (const char *exp_string
)
10369 /* The standard exceptions are a special case. They are defined in
10370 runtime units that have been compiled without debugging info; if
10371 EXP_STRING is the not-fully-qualified name of a standard
10372 exception (e.g. "constraint_error") then, during the evaluation
10373 of the condition expression, the symbol lookup on this name would
10374 *not* return this standard exception. The catchpoint condition
10375 may then be set only on user-defined exceptions which have the
10376 same not-fully-qualified name (e.g. my_package.constraint_error).
10378 To avoid this unexcepted behavior, these standard exceptions are
10379 systematically prefixed by "standard". This means that "catch
10380 exception constraint_error" is rewritten into "catch exception
10381 standard.constraint_error".
10383 If an exception named contraint_error is defined in another package of
10384 the inferior program, then the only way to specify this exception as a
10385 breakpoint condition is to use its fully-qualified named:
10386 e.g. my_package.constraint_error. */
10388 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10390 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10392 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10396 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10399 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10401 static struct expression
*
10402 ada_parse_catchpoint_condition (char *cond_string
,
10403 struct symtab_and_line sal
)
10405 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10408 /* Return the symtab_and_line that should be used to insert an exception
10409 catchpoint of the TYPE kind.
10411 EX_STRING should contain the name of a specific exception
10412 that the catchpoint should catch, or NULL otherwise.
10414 The idea behind all the remaining parameters is that their names match
10415 the name of certain fields in the breakpoint structure that are used to
10416 handle exception catchpoints. This function returns the value to which
10417 these fields should be set, depending on the type of catchpoint we need
10420 If COND and COND_STRING are both non-NULL, any value they might
10421 hold will be free'ed, and then replaced by newly allocated ones.
10422 These parameters are left untouched otherwise. */
10424 static struct symtab_and_line
10425 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10426 char **addr_string
, char **cond_string
,
10427 struct expression
**cond
, struct breakpoint_ops
**ops
)
10429 const char *sym_name
;
10430 struct symbol
*sym
;
10431 struct symtab_and_line sal
;
10433 /* First, find out which exception support info to use. */
10434 ada_exception_support_info_sniffer ();
10436 /* Then lookup the function on which we will break in order to catch
10437 the Ada exceptions requested by the user. */
10439 sym_name
= ada_exception_sym_name (ex
);
10440 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10442 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10443 that should be compiled with debugging information. As a result, we
10444 expect to find that symbol in the symtabs. If we don't find it, then
10445 the target most likely does not support Ada exceptions, or we cannot
10446 insert exception breakpoints yet, because the GNAT runtime hasn't been
10449 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10450 in such a way that no debugging information is produced for the symbol
10451 we are looking for. In this case, we could search the minimal symbols
10452 as a fall-back mechanism. This would still be operating in degraded
10453 mode, however, as we would still be missing the debugging information
10454 that is needed in order to extract the name of the exception being
10455 raised (this name is printed in the catchpoint message, and is also
10456 used when trying to catch a specific exception). We do not handle
10457 this case for now. */
10460 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10462 /* Make sure that the symbol we found corresponds to a function. */
10463 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10464 error (_("Symbol \"%s\" is not a function (class = %d)"),
10465 sym_name
, SYMBOL_CLASS (sym
));
10467 sal
= find_function_start_sal (sym
, 1);
10469 /* Set ADDR_STRING. */
10471 *addr_string
= xstrdup (sym_name
);
10473 /* Set the COND and COND_STRING (if not NULL). */
10475 if (cond_string
!= NULL
&& cond
!= NULL
)
10477 if (*cond_string
!= NULL
)
10479 xfree (*cond_string
);
10480 *cond_string
= NULL
;
10487 if (exp_string
!= NULL
)
10489 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10490 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10495 *ops
= ada_exception_breakpoint_ops (ex
);
10500 /* Parse the arguments (ARGS) of the "catch exception" command.
10502 Set TYPE to the appropriate exception catchpoint type.
10503 If the user asked the catchpoint to catch only a specific
10504 exception, then save the exception name in ADDR_STRING.
10506 See ada_exception_sal for a description of all the remaining
10507 function arguments of this function. */
10509 struct symtab_and_line
10510 ada_decode_exception_location (char *args
, char **addr_string
,
10511 char **exp_string
, char **cond_string
,
10512 struct expression
**cond
,
10513 struct breakpoint_ops
**ops
)
10515 enum exception_catchpoint_kind ex
;
10517 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10518 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10522 struct symtab_and_line
10523 ada_decode_assert_location (char *args
, char **addr_string
,
10524 struct breakpoint_ops
**ops
)
10526 /* Check that no argument where provided at the end of the command. */
10530 while (isspace (*args
))
10533 error (_("Junk at end of arguments."));
10536 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10541 /* Information about operators given special treatment in functions
10543 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10545 #define ADA_OPERATORS \
10546 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10547 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10548 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10549 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10550 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10551 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10552 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10553 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10554 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10555 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10556 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10557 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10558 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10559 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10560 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10561 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10562 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10563 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10564 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10567 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10569 switch (exp
->elts
[pc
- 1].opcode
)
10572 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10575 #define OP_DEFN(op, len, args, binop) \
10576 case op: *oplenp = len; *argsp = args; break;
10582 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10587 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10593 ada_op_name (enum exp_opcode opcode
)
10598 return op_name_standard (opcode
);
10600 #define OP_DEFN(op, len, args, binop) case op: return #op;
10605 return "OP_AGGREGATE";
10607 return "OP_CHOICES";
10613 /* As for operator_length, but assumes PC is pointing at the first
10614 element of the operator, and gives meaningful results only for the
10615 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10618 ada_forward_operator_length (struct expression
*exp
, int pc
,
10619 int *oplenp
, int *argsp
)
10621 switch (exp
->elts
[pc
].opcode
)
10624 *oplenp
= *argsp
= 0;
10627 #define OP_DEFN(op, len, args, binop) \
10628 case op: *oplenp = len; *argsp = args; break;
10634 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10639 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10645 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10646 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10654 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10656 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10661 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10665 /* Ada attributes ('Foo). */
10668 case OP_ATR_LENGTH
:
10672 case OP_ATR_MODULUS
:
10679 case UNOP_IN_RANGE
:
10681 /* XXX: gdb_sprint_host_address, type_sprint */
10682 fprintf_filtered (stream
, _("Type @"));
10683 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10684 fprintf_filtered (stream
, " (");
10685 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10686 fprintf_filtered (stream
, ")");
10688 case BINOP_IN_BOUNDS
:
10689 fprintf_filtered (stream
, " (%d)",
10690 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10692 case TERNOP_IN_RANGE
:
10697 case OP_DISCRETE_RANGE
:
10698 case OP_POSITIONAL
:
10705 char *name
= &exp
->elts
[elt
+ 2].string
;
10706 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10707 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10712 return dump_subexp_body_standard (exp
, stream
, elt
);
10716 for (i
= 0; i
< nargs
; i
+= 1)
10717 elt
= dump_subexp (exp
, stream
, elt
);
10722 /* The Ada extension of print_subexp (q.v.). */
10725 ada_print_subexp (struct expression
*exp
, int *pos
,
10726 struct ui_file
*stream
, enum precedence prec
)
10728 int oplen
, nargs
, i
;
10730 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10732 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10739 print_subexp_standard (exp
, pos
, stream
, prec
);
10743 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10746 case BINOP_IN_BOUNDS
:
10747 /* XXX: sprint_subexp */
10748 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10749 fputs_filtered (" in ", stream
);
10750 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10751 fputs_filtered ("'range", stream
);
10752 if (exp
->elts
[pc
+ 1].longconst
> 1)
10753 fprintf_filtered (stream
, "(%ld)",
10754 (long) exp
->elts
[pc
+ 1].longconst
);
10757 case TERNOP_IN_RANGE
:
10758 if (prec
>= PREC_EQUAL
)
10759 fputs_filtered ("(", stream
);
10760 /* XXX: sprint_subexp */
10761 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10762 fputs_filtered (" in ", stream
);
10763 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10764 fputs_filtered (" .. ", stream
);
10765 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10766 if (prec
>= PREC_EQUAL
)
10767 fputs_filtered (")", stream
);
10772 case OP_ATR_LENGTH
:
10776 case OP_ATR_MODULUS
:
10781 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10783 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10784 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10788 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10789 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10793 for (tem
= 1; tem
< nargs
; tem
+= 1)
10795 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10796 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10798 fputs_filtered (")", stream
);
10803 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10804 fputs_filtered ("'(", stream
);
10805 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10806 fputs_filtered (")", stream
);
10809 case UNOP_IN_RANGE
:
10810 /* XXX: sprint_subexp */
10811 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10812 fputs_filtered (" in ", stream
);
10813 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10816 case OP_DISCRETE_RANGE
:
10817 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10818 fputs_filtered ("..", stream
);
10819 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10823 fputs_filtered ("others => ", stream
);
10824 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10828 for (i
= 0; i
< nargs
-1; i
+= 1)
10831 fputs_filtered ("|", stream
);
10832 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10834 fputs_filtered (" => ", stream
);
10835 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10838 case OP_POSITIONAL
:
10839 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10843 fputs_filtered ("(", stream
);
10844 for (i
= 0; i
< nargs
; i
+= 1)
10847 fputs_filtered (", ", stream
);
10848 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10850 fputs_filtered (")", stream
);
10855 /* Table mapping opcodes into strings for printing operators
10856 and precedences of the operators. */
10858 static const struct op_print ada_op_print_tab
[] = {
10859 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10860 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10861 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10862 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10863 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10864 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10865 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10866 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10867 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10868 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10869 {">", BINOP_GTR
, PREC_ORDER
, 0},
10870 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10871 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10872 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10873 {"+", BINOP_ADD
, PREC_ADD
, 0},
10874 {"-", BINOP_SUB
, PREC_ADD
, 0},
10875 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10876 {"*", BINOP_MUL
, PREC_MUL
, 0},
10877 {"/", BINOP_DIV
, PREC_MUL
, 0},
10878 {"rem", BINOP_REM
, PREC_MUL
, 0},
10879 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10880 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10881 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10882 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10883 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10884 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10885 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10886 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10887 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10888 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10889 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10893 enum ada_primitive_types
{
10894 ada_primitive_type_int
,
10895 ada_primitive_type_long
,
10896 ada_primitive_type_short
,
10897 ada_primitive_type_char
,
10898 ada_primitive_type_float
,
10899 ada_primitive_type_double
,
10900 ada_primitive_type_void
,
10901 ada_primitive_type_long_long
,
10902 ada_primitive_type_long_double
,
10903 ada_primitive_type_natural
,
10904 ada_primitive_type_positive
,
10905 ada_primitive_type_system_address
,
10906 nr_ada_primitive_types
10910 ada_language_arch_info (struct gdbarch
*gdbarch
,
10911 struct language_arch_info
*lai
)
10913 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10914 lai
->primitive_type_vector
10915 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10917 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10918 init_type (TYPE_CODE_INT
,
10919 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10920 0, "integer", (struct objfile
*) NULL
);
10921 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10922 init_type (TYPE_CODE_INT
,
10923 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10924 0, "long_integer", (struct objfile
*) NULL
);
10925 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10926 init_type (TYPE_CODE_INT
,
10927 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10928 0, "short_integer", (struct objfile
*) NULL
);
10929 lai
->string_char_type
=
10930 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10931 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10932 0, "character", (struct objfile
*) NULL
);
10933 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10934 init_type (TYPE_CODE_FLT
,
10935 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10936 0, "float", (struct objfile
*) NULL
);
10937 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10938 init_type (TYPE_CODE_FLT
,
10939 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10940 0, "long_float", (struct objfile
*) NULL
);
10941 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10942 init_type (TYPE_CODE_INT
,
10943 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10944 0, "long_long_integer", (struct objfile
*) NULL
);
10945 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10946 init_type (TYPE_CODE_FLT
,
10947 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10948 0, "long_long_float", (struct objfile
*) NULL
);
10949 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10950 init_type (TYPE_CODE_INT
,
10951 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10952 0, "natural", (struct objfile
*) NULL
);
10953 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10954 init_type (TYPE_CODE_INT
,
10955 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10956 0, "positive", (struct objfile
*) NULL
);
10957 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10959 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10960 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10961 (struct objfile
*) NULL
));
10962 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10963 = "system__address";
10965 lai
->bool_type_symbol
= NULL
;
10966 lai
->bool_type_default
= builtin
->builtin_bool
;
10969 /* Language vector */
10971 /* Not really used, but needed in the ada_language_defn. */
10974 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
10976 ada_emit_char (c
, type
, stream
, quoter
, 1);
10982 warnings_issued
= 0;
10983 return ada_parse ();
10986 static const struct exp_descriptor ada_exp_descriptor
= {
10988 ada_operator_length
,
10990 ada_dump_subexp_body
,
10991 ada_evaluate_subexp
10994 const struct language_defn ada_language_defn
= {
10995 "ada", /* Language name */
10999 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11000 that's not quite what this means. */
11002 macro_expansion_no
,
11003 &ada_exp_descriptor
,
11007 ada_printchar
, /* Print a character constant */
11008 ada_printstr
, /* Function to print string constant */
11009 emit_char
, /* Function to print single char (not used) */
11010 ada_print_type
, /* Print a type using appropriate syntax */
11011 default_print_typedef
, /* Print a typedef using appropriate syntax */
11012 ada_val_print
, /* Print a value using appropriate syntax */
11013 ada_value_print
, /* Print a top-level value */
11014 NULL
, /* Language specific skip_trampoline */
11015 NULL
, /* name_of_this */
11016 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11017 basic_lookup_transparent_type
, /* lookup_transparent_type */
11018 ada_la_decode
, /* Language specific symbol demangler */
11019 NULL
, /* Language specific class_name_from_physname */
11020 ada_op_print_tab
, /* expression operators for printing */
11021 0, /* c-style arrays */
11022 1, /* String lower bound */
11023 ada_get_gdb_completer_word_break_characters
,
11024 ada_make_symbol_completion_list
,
11025 ada_language_arch_info
,
11026 ada_print_array_index
,
11027 default_pass_by_reference
,
11032 /* Provide a prototype to silence -Wmissing-prototypes. */
11033 extern initialize_file_ftype _initialize_ada_language
;
11036 _initialize_ada_language (void)
11038 add_language (&ada_language_defn
);
11040 varsize_limit
= 65536;
11042 obstack_init (&symbol_list_obstack
);
11044 decoded_names_store
= htab_create_alloc
11045 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11046 NULL
, xcalloc
, xfree
);
11048 observer_attach_executable_changed (ada_executable_changed_observer
);