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
));
4949 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4950 vector *defn_symbols, updating the list of symbols in OBSTACKP
4951 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4952 OBJFILE is the section containing BLOCK.
4953 SYMTAB is recorded with each symbol added. */
4956 ada_add_block_symbols (struct obstack
*obstackp
,
4957 struct block
*block
, const char *name
,
4958 domain_enum domain
, struct objfile
*objfile
,
4961 struct dict_iterator iter
;
4962 int name_len
= strlen (name
);
4963 /* A matching argument symbol, if any. */
4964 struct symbol
*arg_sym
;
4965 /* Set true when we find a matching non-argument symbol. */
4974 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4976 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4977 SYMBOL_DOMAIN (sym
), domain
)
4978 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
4980 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4982 else if (SYMBOL_IS_ARGUMENT (sym
))
4987 add_defn_to_vec (obstackp
,
4988 fixup_symbol_section (sym
, objfile
),
4996 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4998 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4999 SYMBOL_DOMAIN (sym
), domain
))
5001 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5003 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5005 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5007 if (SYMBOL_IS_ARGUMENT (sym
))
5012 add_defn_to_vec (obstackp
,
5013 fixup_symbol_section (sym
, objfile
),
5022 if (!found_sym
&& arg_sym
!= NULL
)
5024 add_defn_to_vec (obstackp
,
5025 fixup_symbol_section (arg_sym
, objfile
),
5034 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5036 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5037 SYMBOL_DOMAIN (sym
), domain
))
5041 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5044 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5046 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5051 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5053 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5055 if (SYMBOL_IS_ARGUMENT (sym
))
5060 add_defn_to_vec (obstackp
,
5061 fixup_symbol_section (sym
, objfile
),
5069 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5070 They aren't parameters, right? */
5071 if (!found_sym
&& arg_sym
!= NULL
)
5073 add_defn_to_vec (obstackp
,
5074 fixup_symbol_section (arg_sym
, objfile
),
5081 /* Symbol Completion */
5083 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5084 name in a form that's appropriate for the completion. The result
5085 does not need to be deallocated, but is only good until the next call.
5087 TEXT_LEN is equal to the length of TEXT.
5088 Perform a wild match if WILD_MATCH is set.
5089 ENCODED should be set if TEXT represents the start of a symbol name
5090 in its encoded form. */
5093 symbol_completion_match (const char *sym_name
,
5094 const char *text
, int text_len
,
5095 int wild_match
, int encoded
)
5098 const int verbatim_match
= (text
[0] == '<');
5103 /* Strip the leading angle bracket. */
5108 /* First, test against the fully qualified name of the symbol. */
5110 if (strncmp (sym_name
, text
, text_len
) == 0)
5113 if (match
&& !encoded
)
5115 /* One needed check before declaring a positive match is to verify
5116 that iff we are doing a verbatim match, the decoded version
5117 of the symbol name starts with '<'. Otherwise, this symbol name
5118 is not a suitable completion. */
5119 const char *sym_name_copy
= sym_name
;
5120 int has_angle_bracket
;
5122 sym_name
= ada_decode (sym_name
);
5123 has_angle_bracket
= (sym_name
[0] == '<');
5124 match
= (has_angle_bracket
== verbatim_match
);
5125 sym_name
= sym_name_copy
;
5128 if (match
&& !verbatim_match
)
5130 /* When doing non-verbatim match, another check that needs to
5131 be done is to verify that the potentially matching symbol name
5132 does not include capital letters, because the ada-mode would
5133 not be able to understand these symbol names without the
5134 angle bracket notation. */
5137 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5142 /* Second: Try wild matching... */
5144 if (!match
&& wild_match
)
5146 /* Since we are doing wild matching, this means that TEXT
5147 may represent an unqualified symbol name. We therefore must
5148 also compare TEXT against the unqualified name of the symbol. */
5149 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5151 if (strncmp (sym_name
, text
, text_len
) == 0)
5155 /* Finally: If we found a mach, prepare the result to return. */
5161 sym_name
= add_angle_brackets (sym_name
);
5164 sym_name
= ada_decode (sym_name
);
5169 typedef char *char_ptr
;
5170 DEF_VEC_P (char_ptr
);
5172 /* A companion function to ada_make_symbol_completion_list().
5173 Check if SYM_NAME represents a symbol which name would be suitable
5174 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5175 it is appended at the end of the given string vector SV.
5177 ORIG_TEXT is the string original string from the user command
5178 that needs to be completed. WORD is the entire command on which
5179 completion should be performed. These two parameters are used to
5180 determine which part of the symbol name should be added to the
5182 if WILD_MATCH is set, then wild matching is performed.
5183 ENCODED should be set if TEXT represents a symbol name in its
5184 encoded formed (in which case the completion should also be
5188 symbol_completion_add (VEC(char_ptr
) **sv
,
5189 const char *sym_name
,
5190 const char *text
, int text_len
,
5191 const char *orig_text
, const char *word
,
5192 int wild_match
, int encoded
)
5194 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5195 wild_match
, encoded
);
5201 /* We found a match, so add the appropriate completion to the given
5204 if (word
== orig_text
)
5206 completion
= xmalloc (strlen (match
) + 5);
5207 strcpy (completion
, match
);
5209 else if (word
> orig_text
)
5211 /* Return some portion of sym_name. */
5212 completion
= xmalloc (strlen (match
) + 5);
5213 strcpy (completion
, match
+ (word
- orig_text
));
5217 /* Return some of ORIG_TEXT plus sym_name. */
5218 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5219 strncpy (completion
, word
, orig_text
- word
);
5220 completion
[orig_text
- word
] = '\0';
5221 strcat (completion
, match
);
5224 VEC_safe_push (char_ptr
, *sv
, completion
);
5227 /* Return a list of possible symbol names completing TEXT0. The list
5228 is NULL terminated. WORD is the entire command on which completion
5232 ada_make_symbol_completion_list (char *text0
, char *word
)
5238 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5241 struct partial_symtab
*ps
;
5242 struct minimal_symbol
*msymbol
;
5243 struct objfile
*objfile
;
5244 struct block
*b
, *surrounding_static_block
= 0;
5246 struct dict_iterator iter
;
5248 if (text0
[0] == '<')
5250 text
= xstrdup (text0
);
5251 make_cleanup (xfree
, text
);
5252 text_len
= strlen (text
);
5258 text
= xstrdup (ada_encode (text0
));
5259 make_cleanup (xfree
, text
);
5260 text_len
= strlen (text
);
5261 for (i
= 0; i
< text_len
; i
++)
5262 text
[i
] = tolower (text
[i
]);
5264 encoded
= (strstr (text0
, "__") != NULL
);
5265 /* If the name contains a ".", then the user is entering a fully
5266 qualified entity name, and the match must not be done in wild
5267 mode. Similarly, if the user wants to complete what looks like
5268 an encoded name, the match must not be done in wild mode. */
5269 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5272 /* First, look at the partial symtab symbols. */
5273 ALL_PSYMTABS (objfile
, ps
)
5275 struct partial_symbol
**psym
;
5277 /* If the psymtab's been read in we'll get it when we search
5278 through the blockvector. */
5282 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5283 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5284 + ps
->n_global_syms
); psym
++)
5287 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5288 text
, text_len
, text0
, word
,
5289 wild_match
, encoded
);
5292 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5293 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5294 + ps
->n_static_syms
); psym
++)
5297 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5298 text
, text_len
, text0
, word
,
5299 wild_match
, encoded
);
5303 /* At this point scan through the misc symbol vectors and add each
5304 symbol you find to the list. Eventually we want to ignore
5305 anything that isn't a text symbol (everything else will be
5306 handled by the psymtab code above). */
5308 ALL_MSYMBOLS (objfile
, msymbol
)
5311 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5312 text
, text_len
, text0
, word
, wild_match
, encoded
);
5315 /* Search upwards from currently selected frame (so that we can
5316 complete on local vars. */
5318 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5320 if (!BLOCK_SUPERBLOCK (b
))
5321 surrounding_static_block
= b
; /* For elmin of dups */
5323 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5325 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5326 text
, text_len
, text0
, word
,
5327 wild_match
, encoded
);
5331 /* Go through the symtabs and check the externs and statics for
5332 symbols which match. */
5334 ALL_SYMTABS (objfile
, s
)
5337 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5338 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5340 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5341 text
, text_len
, text0
, word
,
5342 wild_match
, encoded
);
5346 ALL_SYMTABS (objfile
, s
)
5349 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5350 /* Don't do this block twice. */
5351 if (b
== surrounding_static_block
)
5353 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5355 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5356 text
, text_len
, text0
, word
,
5357 wild_match
, encoded
);
5361 /* Append the closing NULL entry. */
5362 VEC_safe_push (char_ptr
, completions
, NULL
);
5364 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5365 return the copy. It's unfortunate that we have to make a copy
5366 of an array that we're about to destroy, but there is nothing much
5367 we can do about it. Fortunately, it's typically not a very large
5370 const size_t completions_size
=
5371 VEC_length (char_ptr
, completions
) * sizeof (char *);
5372 char **result
= malloc (completions_size
);
5374 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5376 VEC_free (char_ptr
, completions
);
5383 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5384 for tagged types. */
5387 ada_is_dispatch_table_ptr_type (struct type
*type
)
5391 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5394 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5398 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5401 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5402 to be invisible to users. */
5405 ada_is_ignored_field (struct type
*type
, int field_num
)
5407 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5410 /* Check the name of that field. */
5412 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5414 /* Anonymous field names should not be printed.
5415 brobecker/2007-02-20: I don't think this can actually happen
5416 but we don't want to print the value of annonymous fields anyway. */
5420 /* A field named "_parent" is internally generated by GNAT for
5421 tagged types, and should not be printed either. */
5422 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5426 /* If this is the dispatch table of a tagged type, then ignore. */
5427 if (ada_is_tagged_type (type
, 1)
5428 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5431 /* Not a special field, so it should not be ignored. */
5435 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5436 pointer or reference type whose ultimate target has a tag field. */
5439 ada_is_tagged_type (struct type
*type
, int refok
)
5441 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5444 /* True iff TYPE represents the type of X'Tag */
5447 ada_is_tag_type (struct type
*type
)
5449 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5453 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5454 return (name
!= NULL
5455 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5459 /* The type of the tag on VAL. */
5462 ada_tag_type (struct value
*val
)
5464 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5467 /* The value of the tag on VAL. */
5470 ada_value_tag (struct value
*val
)
5472 return ada_value_struct_elt (val
, "_tag", 0);
5475 /* The value of the tag on the object of type TYPE whose contents are
5476 saved at VALADDR, if it is non-null, or is at memory address
5479 static struct value
*
5480 value_tag_from_contents_and_address (struct type
*type
,
5481 const gdb_byte
*valaddr
,
5484 int tag_byte_offset
, dummy1
, dummy2
;
5485 struct type
*tag_type
;
5486 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5489 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5491 : valaddr
+ tag_byte_offset
);
5492 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5494 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5499 static struct type
*
5500 type_from_tag (struct value
*tag
)
5502 const char *type_name
= ada_tag_name (tag
);
5503 if (type_name
!= NULL
)
5504 return ada_find_any_type (ada_encode (type_name
));
5515 static int ada_tag_name_1 (void *);
5516 static int ada_tag_name_2 (struct tag_args
*);
5518 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5519 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5520 The value stored in ARGS->name is valid until the next call to
5524 ada_tag_name_1 (void *args0
)
5526 struct tag_args
*args
= (struct tag_args
*) args0
;
5527 static char name
[1024];
5531 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5533 return ada_tag_name_2 (args
);
5534 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5537 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5538 for (p
= name
; *p
!= '\0'; p
+= 1)
5545 /* Utility function for ada_tag_name_1 that tries the second
5546 representation for the dispatch table (in which there is no
5547 explicit 'tsd' field in the referent of the tag pointer, and instead
5548 the tsd pointer is stored just before the dispatch table. */
5551 ada_tag_name_2 (struct tag_args
*args
)
5553 struct type
*info_type
;
5554 static char name
[1024];
5556 struct value
*val
, *valp
;
5559 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5560 if (info_type
== NULL
)
5562 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5563 valp
= value_cast (info_type
, args
->tag
);
5566 val
= value_ind (value_ptradd (valp
,
5567 value_from_longest (builtin_type_int8
, -1)));
5570 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5573 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5574 for (p
= name
; *p
!= '\0'; p
+= 1)
5581 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5585 ada_tag_name (struct value
*tag
)
5587 struct tag_args args
;
5588 if (!ada_is_tag_type (value_type (tag
)))
5592 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5596 /* The parent type of TYPE, or NULL if none. */
5599 ada_parent_type (struct type
*type
)
5603 type
= ada_check_typedef (type
);
5605 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5608 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5609 if (ada_is_parent_field (type
, i
))
5611 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5613 /* If the _parent field is a pointer, then dereference it. */
5614 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5615 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5616 /* If there is a parallel XVS type, get the actual base type. */
5617 parent_type
= ada_get_base_type (parent_type
);
5619 return ada_check_typedef (parent_type
);
5625 /* True iff field number FIELD_NUM of structure type TYPE contains the
5626 parent-type (inherited) fields of a derived type. Assumes TYPE is
5627 a structure type with at least FIELD_NUM+1 fields. */
5630 ada_is_parent_field (struct type
*type
, int field_num
)
5632 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5633 return (name
!= NULL
5634 && (strncmp (name
, "PARENT", 6) == 0
5635 || strncmp (name
, "_parent", 7) == 0));
5638 /* True iff field number FIELD_NUM of structure type TYPE is a
5639 transparent wrapper field (which should be silently traversed when doing
5640 field selection and flattened when printing). Assumes TYPE is a
5641 structure type with at least FIELD_NUM+1 fields. Such fields are always
5645 ada_is_wrapper_field (struct type
*type
, int field_num
)
5647 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5648 return (name
!= NULL
5649 && (strncmp (name
, "PARENT", 6) == 0
5650 || strcmp (name
, "REP") == 0
5651 || strncmp (name
, "_parent", 7) == 0
5652 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5655 /* True iff field number FIELD_NUM of structure or union type TYPE
5656 is a variant wrapper. Assumes TYPE is a structure type with at least
5657 FIELD_NUM+1 fields. */
5660 ada_is_variant_part (struct type
*type
, int field_num
)
5662 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5663 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5664 || (is_dynamic_field (type
, field_num
)
5665 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5666 == TYPE_CODE_UNION
)));
5669 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5670 whose discriminants are contained in the record type OUTER_TYPE,
5671 returns the type of the controlling discriminant for the variant. */
5674 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5676 char *name
= ada_variant_discrim_name (var_type
);
5678 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5680 return builtin_type_int32
;
5685 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5686 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5687 represents a 'when others' clause; otherwise 0. */
5690 ada_is_others_clause (struct type
*type
, int field_num
)
5692 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5693 return (name
!= NULL
&& name
[0] == 'O');
5696 /* Assuming that TYPE0 is the type of the variant part of a record,
5697 returns the name of the discriminant controlling the variant.
5698 The value is valid until the next call to ada_variant_discrim_name. */
5701 ada_variant_discrim_name (struct type
*type0
)
5703 static char *result
= NULL
;
5704 static size_t result_len
= 0;
5707 const char *discrim_end
;
5708 const char *discrim_start
;
5710 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5711 type
= TYPE_TARGET_TYPE (type0
);
5715 name
= ada_type_name (type
);
5717 if (name
== NULL
|| name
[0] == '\000')
5720 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5723 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5726 if (discrim_end
== name
)
5729 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5732 if (discrim_start
== name
+ 1)
5734 if ((discrim_start
> name
+ 3
5735 && strncmp (discrim_start
- 3, "___", 3) == 0)
5736 || discrim_start
[-1] == '.')
5740 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5741 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5742 result
[discrim_end
- discrim_start
] = '\0';
5746 /* Scan STR for a subtype-encoded number, beginning at position K.
5747 Put the position of the character just past the number scanned in
5748 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5749 Return 1 if there was a valid number at the given position, and 0
5750 otherwise. A "subtype-encoded" number consists of the absolute value
5751 in decimal, followed by the letter 'm' to indicate a negative number.
5752 Assumes 0m does not occur. */
5755 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5759 if (!isdigit (str
[k
]))
5762 /* Do it the hard way so as not to make any assumption about
5763 the relationship of unsigned long (%lu scan format code) and
5766 while (isdigit (str
[k
]))
5768 RU
= RU
* 10 + (str
[k
] - '0');
5775 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5781 /* NOTE on the above: Technically, C does not say what the results of
5782 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5783 number representable as a LONGEST (although either would probably work
5784 in most implementations). When RU>0, the locution in the then branch
5785 above is always equivalent to the negative of RU. */
5792 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5793 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5794 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5797 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5799 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5812 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5821 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5822 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5824 if (val
>= L
&& val
<= U
)
5836 /* FIXME: Lots of redundancy below. Try to consolidate. */
5838 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5839 ARG_TYPE, extract and return the value of one of its (non-static)
5840 fields. FIELDNO says which field. Differs from value_primitive_field
5841 only in that it can handle packed values of arbitrary type. */
5843 static struct value
*
5844 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5845 struct type
*arg_type
)
5849 arg_type
= ada_check_typedef (arg_type
);
5850 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5852 /* Handle packed fields. */
5854 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5856 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5857 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5859 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5860 offset
+ bit_pos
/ 8,
5861 bit_pos
% 8, bit_size
, type
);
5864 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5867 /* Find field with name NAME in object of type TYPE. If found,
5868 set the following for each argument that is non-null:
5869 - *FIELD_TYPE_P to the field's type;
5870 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5871 an object of that type;
5872 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5873 - *BIT_SIZE_P to its size in bits if the field is packed, and
5875 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5876 fields up to but not including the desired field, or by the total
5877 number of fields if not found. A NULL value of NAME never
5878 matches; the function just counts visible fields in this case.
5880 Returns 1 if found, 0 otherwise. */
5883 find_struct_field (char *name
, struct type
*type
, int offset
,
5884 struct type
**field_type_p
,
5885 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5890 type
= ada_check_typedef (type
);
5892 if (field_type_p
!= NULL
)
5893 *field_type_p
= NULL
;
5894 if (byte_offset_p
!= NULL
)
5896 if (bit_offset_p
!= NULL
)
5898 if (bit_size_p
!= NULL
)
5901 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5903 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5904 int fld_offset
= offset
+ bit_pos
/ 8;
5905 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5907 if (t_field_name
== NULL
)
5910 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5912 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5913 if (field_type_p
!= NULL
)
5914 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5915 if (byte_offset_p
!= NULL
)
5916 *byte_offset_p
= fld_offset
;
5917 if (bit_offset_p
!= NULL
)
5918 *bit_offset_p
= bit_pos
% 8;
5919 if (bit_size_p
!= NULL
)
5920 *bit_size_p
= bit_size
;
5923 else if (ada_is_wrapper_field (type
, i
))
5925 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5926 field_type_p
, byte_offset_p
, bit_offset_p
,
5927 bit_size_p
, index_p
))
5930 else if (ada_is_variant_part (type
, i
))
5932 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5935 struct type
*field_type
5936 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5938 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5940 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5942 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5943 field_type_p
, byte_offset_p
,
5944 bit_offset_p
, bit_size_p
, index_p
))
5948 else if (index_p
!= NULL
)
5954 /* Number of user-visible fields in record type TYPE. */
5957 num_visible_fields (struct type
*type
)
5961 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5965 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5966 and search in it assuming it has (class) type TYPE.
5967 If found, return value, else return NULL.
5969 Searches recursively through wrapper fields (e.g., '_parent'). */
5971 static struct value
*
5972 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5976 type
= ada_check_typedef (type
);
5978 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5980 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5982 if (t_field_name
== NULL
)
5985 else if (field_name_match (t_field_name
, name
))
5986 return ada_value_primitive_field (arg
, offset
, i
, type
);
5988 else if (ada_is_wrapper_field (type
, i
))
5990 struct value
*v
= /* Do not let indent join lines here. */
5991 ada_search_struct_field (name
, arg
,
5992 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5993 TYPE_FIELD_TYPE (type
, i
));
5998 else if (ada_is_variant_part (type
, i
))
6000 /* PNH: Do we ever get here? See find_struct_field. */
6002 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6003 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6005 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6007 struct value
*v
= ada_search_struct_field
/* Force line break. */
6009 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6010 TYPE_FIELD_TYPE (field_type
, j
));
6019 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6020 int, struct type
*);
6023 /* Return field #INDEX in ARG, where the index is that returned by
6024 * find_struct_field through its INDEX_P argument. Adjust the address
6025 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6026 * If found, return value, else return NULL. */
6028 static struct value
*
6029 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6032 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6036 /* Auxiliary function for ada_index_struct_field. Like
6037 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6040 static struct value
*
6041 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6045 type
= ada_check_typedef (type
);
6047 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6049 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6051 else if (ada_is_wrapper_field (type
, i
))
6053 struct value
*v
= /* Do not let indent join lines here. */
6054 ada_index_struct_field_1 (index_p
, arg
,
6055 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6056 TYPE_FIELD_TYPE (type
, i
));
6061 else if (ada_is_variant_part (type
, i
))
6063 /* PNH: Do we ever get here? See ada_search_struct_field,
6064 find_struct_field. */
6065 error (_("Cannot assign this kind of variant record"));
6067 else if (*index_p
== 0)
6068 return ada_value_primitive_field (arg
, offset
, i
, type
);
6075 /* Given ARG, a value of type (pointer or reference to a)*
6076 structure/union, extract the component named NAME from the ultimate
6077 target structure/union and return it as a value with its
6080 The routine searches for NAME among all members of the structure itself
6081 and (recursively) among all members of any wrapper members
6084 If NO_ERR, then simply return NULL in case of error, rather than
6088 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6090 struct type
*t
, *t1
;
6094 t1
= t
= ada_check_typedef (value_type (arg
));
6095 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6097 t1
= TYPE_TARGET_TYPE (t
);
6100 t1
= ada_check_typedef (t1
);
6101 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6103 arg
= coerce_ref (arg
);
6108 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6110 t1
= TYPE_TARGET_TYPE (t
);
6113 t1
= ada_check_typedef (t1
);
6114 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6116 arg
= value_ind (arg
);
6123 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6127 v
= ada_search_struct_field (name
, arg
, 0, t
);
6130 int bit_offset
, bit_size
, byte_offset
;
6131 struct type
*field_type
;
6134 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6135 address
= value_as_address (arg
);
6137 address
= unpack_pointer (t
, value_contents (arg
));
6139 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6140 if (find_struct_field (name
, t1
, 0,
6141 &field_type
, &byte_offset
, &bit_offset
,
6146 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6147 arg
= ada_coerce_ref (arg
);
6149 arg
= ada_value_ind (arg
);
6150 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6151 bit_offset
, bit_size
,
6155 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6159 if (v
!= NULL
|| no_err
)
6162 error (_("There is no member named %s."), name
);
6168 error (_("Attempt to extract a component of a value that is not a record."));
6171 /* Given a type TYPE, look up the type of the component of type named NAME.
6172 If DISPP is non-null, add its byte displacement from the beginning of a
6173 structure (pointed to by a value) of type TYPE to *DISPP (does not
6174 work for packed fields).
6176 Matches any field whose name has NAME as a prefix, possibly
6179 TYPE can be either a struct or union. If REFOK, TYPE may also
6180 be a (pointer or reference)+ to a struct or union, and the
6181 ultimate target type will be searched.
6183 Looks recursively into variant clauses and parent types.
6185 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6186 TYPE is not a type of the right kind. */
6188 static struct type
*
6189 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6190 int noerr
, int *dispp
)
6197 if (refok
&& type
!= NULL
)
6200 type
= ada_check_typedef (type
);
6201 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6202 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6204 type
= TYPE_TARGET_TYPE (type
);
6208 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6209 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6215 target_terminal_ours ();
6216 gdb_flush (gdb_stdout
);
6218 error (_("Type (null) is not a structure or union type"));
6221 /* XXX: type_sprint */
6222 fprintf_unfiltered (gdb_stderr
, _("Type "));
6223 type_print (type
, "", gdb_stderr
, -1);
6224 error (_(" is not a structure or union type"));
6229 type
= to_static_fixed_type (type
);
6231 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6233 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6237 if (t_field_name
== NULL
)
6240 else if (field_name_match (t_field_name
, name
))
6243 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6244 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6247 else if (ada_is_wrapper_field (type
, i
))
6250 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6255 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6260 else if (ada_is_variant_part (type
, i
))
6263 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6265 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6267 /* FIXME pnh 2008/01/26: We check for a field that is
6268 NOT wrapped in a struct, since the compiler sometimes
6269 generates these for unchecked variant types. Revisit
6270 if the compiler changes this practice. */
6271 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6273 if (v_field_name
!= NULL
6274 && field_name_match (v_field_name
, name
))
6275 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6277 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6283 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6294 target_terminal_ours ();
6295 gdb_flush (gdb_stdout
);
6298 /* XXX: type_sprint */
6299 fprintf_unfiltered (gdb_stderr
, _("Type "));
6300 type_print (type
, "", gdb_stderr
, -1);
6301 error (_(" has no component named <null>"));
6305 /* XXX: type_sprint */
6306 fprintf_unfiltered (gdb_stderr
, _("Type "));
6307 type_print (type
, "", gdb_stderr
, -1);
6308 error (_(" has no component named %s"), name
);
6315 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6316 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6317 represents an unchecked union (that is, the variant part of a
6318 record that is named in an Unchecked_Union pragma). */
6321 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6323 char *discrim_name
= ada_variant_discrim_name (var_type
);
6324 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6329 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6330 within a value of type OUTER_TYPE that is stored in GDB at
6331 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6332 numbering from 0) is applicable. Returns -1 if none are. */
6335 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6336 const gdb_byte
*outer_valaddr
)
6340 char *discrim_name
= ada_variant_discrim_name (var_type
);
6341 struct value
*outer
;
6342 struct value
*discrim
;
6343 LONGEST discrim_val
;
6345 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6346 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6347 if (discrim
== NULL
)
6349 discrim_val
= value_as_long (discrim
);
6352 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6354 if (ada_is_others_clause (var_type
, i
))
6356 else if (ada_in_variant (discrim_val
, var_type
, i
))
6360 return others_clause
;
6365 /* Dynamic-Sized Records */
6367 /* Strategy: The type ostensibly attached to a value with dynamic size
6368 (i.e., a size that is not statically recorded in the debugging
6369 data) does not accurately reflect the size or layout of the value.
6370 Our strategy is to convert these values to values with accurate,
6371 conventional types that are constructed on the fly. */
6373 /* There is a subtle and tricky problem here. In general, we cannot
6374 determine the size of dynamic records without its data. However,
6375 the 'struct value' data structure, which GDB uses to represent
6376 quantities in the inferior process (the target), requires the size
6377 of the type at the time of its allocation in order to reserve space
6378 for GDB's internal copy of the data. That's why the
6379 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6380 rather than struct value*s.
6382 However, GDB's internal history variables ($1, $2, etc.) are
6383 struct value*s containing internal copies of the data that are not, in
6384 general, the same as the data at their corresponding addresses in
6385 the target. Fortunately, the types we give to these values are all
6386 conventional, fixed-size types (as per the strategy described
6387 above), so that we don't usually have to perform the
6388 'to_fixed_xxx_type' conversions to look at their values.
6389 Unfortunately, there is one exception: if one of the internal
6390 history variables is an array whose elements are unconstrained
6391 records, then we will need to create distinct fixed types for each
6392 element selected. */
6394 /* The upshot of all of this is that many routines take a (type, host
6395 address, target address) triple as arguments to represent a value.
6396 The host address, if non-null, is supposed to contain an internal
6397 copy of the relevant data; otherwise, the program is to consult the
6398 target at the target address. */
6400 /* Assuming that VAL0 represents a pointer value, the result of
6401 dereferencing it. Differs from value_ind in its treatment of
6402 dynamic-sized types. */
6405 ada_value_ind (struct value
*val0
)
6407 struct value
*val
= unwrap_value (value_ind (val0
));
6408 return ada_to_fixed_value (val
);
6411 /* The value resulting from dereferencing any "reference to"
6412 qualifiers on VAL0. */
6414 static struct value
*
6415 ada_coerce_ref (struct value
*val0
)
6417 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6419 struct value
*val
= val0
;
6420 val
= coerce_ref (val
);
6421 val
= unwrap_value (val
);
6422 return ada_to_fixed_value (val
);
6428 /* Return OFF rounded upward if necessary to a multiple of
6429 ALIGNMENT (a power of 2). */
6432 align_value (unsigned int off
, unsigned int alignment
)
6434 return (off
+ alignment
- 1) & ~(alignment
- 1);
6437 /* Return the bit alignment required for field #F of template type TYPE. */
6440 field_alignment (struct type
*type
, int f
)
6442 const char *name
= TYPE_FIELD_NAME (type
, f
);
6446 /* The field name should never be null, unless the debugging information
6447 is somehow malformed. In this case, we assume the field does not
6448 require any alignment. */
6452 len
= strlen (name
);
6454 if (!isdigit (name
[len
- 1]))
6457 if (isdigit (name
[len
- 2]))
6458 align_offset
= len
- 2;
6460 align_offset
= len
- 1;
6462 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6463 return TARGET_CHAR_BIT
;
6465 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6468 /* Find a symbol named NAME. Ignores ambiguity. */
6471 ada_find_any_symbol (const char *name
)
6475 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6476 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6479 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6483 /* Find a type named NAME. Ignores ambiguity. */
6486 ada_find_any_type (const char *name
)
6488 struct symbol
*sym
= ada_find_any_symbol (name
);
6489 struct type
*type
= NULL
;
6492 type
= SYMBOL_TYPE (sym
);
6495 type
= language_lookup_primitive_type_by_name
6496 (language_def (language_ada
), current_gdbarch
, name
);
6501 /* Given NAME and an associated BLOCK, search all symbols for
6502 NAME suffixed with "___XR", which is the ``renaming'' symbol
6503 associated to NAME. Return this symbol if found, return
6507 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6511 sym
= find_old_style_renaming_symbol (name
, block
);
6516 /* Not right yet. FIXME pnh 7/20/2007. */
6517 sym
= ada_find_any_symbol (name
);
6518 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6524 static struct symbol
*
6525 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6527 const struct symbol
*function_sym
= block_linkage_function (block
);
6530 if (function_sym
!= NULL
)
6532 /* If the symbol is defined inside a function, NAME is not fully
6533 qualified. This means we need to prepend the function name
6534 as well as adding the ``___XR'' suffix to build the name of
6535 the associated renaming symbol. */
6536 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6537 /* Function names sometimes contain suffixes used
6538 for instance to qualify nested subprograms. When building
6539 the XR type name, we need to make sure that this suffix is
6540 not included. So do not include any suffix in the function
6541 name length below. */
6542 const int function_name_len
= ada_name_prefix_len (function_name
);
6543 const int rename_len
= function_name_len
+ 2 /* "__" */
6544 + strlen (name
) + 6 /* "___XR\0" */ ;
6546 /* Strip the suffix if necessary. */
6547 function_name
[function_name_len
] = '\0';
6549 /* Library-level functions are a special case, as GNAT adds
6550 a ``_ada_'' prefix to the function name to avoid namespace
6551 pollution. However, the renaming symbols themselves do not
6552 have this prefix, so we need to skip this prefix if present. */
6553 if (function_name_len
> 5 /* "_ada_" */
6554 && strstr (function_name
, "_ada_") == function_name
)
6555 function_name
= function_name
+ 5;
6557 rename
= (char *) alloca (rename_len
* sizeof (char));
6558 xsnprintf (rename
, rename_len
* sizeof (char), "%s__%s___XR",
6559 function_name
, name
);
6563 const int rename_len
= strlen (name
) + 6;
6564 rename
= (char *) alloca (rename_len
* sizeof (char));
6565 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6568 return ada_find_any_symbol (rename
);
6571 /* Because of GNAT encoding conventions, several GDB symbols may match a
6572 given type name. If the type denoted by TYPE0 is to be preferred to
6573 that of TYPE1 for purposes of type printing, return non-zero;
6574 otherwise return 0. */
6577 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6581 else if (type0
== NULL
)
6583 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6585 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6587 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6589 else if (ada_is_packed_array_type (type0
))
6591 else if (ada_is_array_descriptor_type (type0
)
6592 && !ada_is_array_descriptor_type (type1
))
6596 const char *type0_name
= type_name_no_tag (type0
);
6597 const char *type1_name
= type_name_no_tag (type1
);
6599 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6600 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6606 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6607 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6610 ada_type_name (struct type
*type
)
6614 else if (TYPE_NAME (type
) != NULL
)
6615 return TYPE_NAME (type
);
6617 return TYPE_TAG_NAME (type
);
6620 /* Find a parallel type to TYPE whose name is formed by appending
6621 SUFFIX to the name of TYPE. */
6624 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6627 static size_t name_len
= 0;
6629 char *typename
= ada_type_name (type
);
6631 if (typename
== NULL
)
6634 len
= strlen (typename
);
6636 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6638 strcpy (name
, typename
);
6639 strcpy (name
+ len
, suffix
);
6641 return ada_find_any_type (name
);
6645 /* If TYPE is a variable-size record type, return the corresponding template
6646 type describing its fields. Otherwise, return NULL. */
6648 static struct type
*
6649 dynamic_template_type (struct type
*type
)
6651 type
= ada_check_typedef (type
);
6653 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6654 || ada_type_name (type
) == NULL
)
6658 int len
= strlen (ada_type_name (type
));
6659 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6662 return ada_find_parallel_type (type
, "___XVE");
6666 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6667 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6670 is_dynamic_field (struct type
*templ_type
, int field_num
)
6672 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6674 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6675 && strstr (name
, "___XVL") != NULL
;
6678 /* The index of the variant field of TYPE, or -1 if TYPE does not
6679 represent a variant record type. */
6682 variant_field_index (struct type
*type
)
6686 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6689 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6691 if (ada_is_variant_part (type
, f
))
6697 /* A record type with no fields. */
6699 static struct type
*
6700 empty_record (struct objfile
*objfile
)
6702 struct type
*type
= alloc_type (objfile
);
6703 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6704 TYPE_NFIELDS (type
) = 0;
6705 TYPE_FIELDS (type
) = NULL
;
6706 INIT_CPLUS_SPECIFIC (type
);
6707 TYPE_NAME (type
) = "<empty>";
6708 TYPE_TAG_NAME (type
) = NULL
;
6709 TYPE_LENGTH (type
) = 0;
6713 /* An ordinary record type (with fixed-length fields) that describes
6714 the value of type TYPE at VALADDR or ADDRESS (see comments at
6715 the beginning of this section) VAL according to GNAT conventions.
6716 DVAL0 should describe the (portion of a) record that contains any
6717 necessary discriminants. It should be NULL if value_type (VAL) is
6718 an outer-level type (i.e., as opposed to a branch of a variant.) A
6719 variant field (unless unchecked) is replaced by a particular branch
6722 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6723 length are not statically known are discarded. As a consequence,
6724 VALADDR, ADDRESS and DVAL0 are ignored.
6726 NOTE: Limitations: For now, we assume that dynamic fields and
6727 variants occupy whole numbers of bytes. However, they need not be
6731 ada_template_to_fixed_record_type_1 (struct type
*type
,
6732 const gdb_byte
*valaddr
,
6733 CORE_ADDR address
, struct value
*dval0
,
6734 int keep_dynamic_fields
)
6736 struct value
*mark
= value_mark ();
6739 int nfields
, bit_len
;
6742 int fld_bit_len
, bit_incr
;
6745 /* Compute the number of fields in this record type that are going
6746 to be processed: unless keep_dynamic_fields, this includes only
6747 fields whose position and length are static will be processed. */
6748 if (keep_dynamic_fields
)
6749 nfields
= TYPE_NFIELDS (type
);
6753 while (nfields
< TYPE_NFIELDS (type
)
6754 && !ada_is_variant_part (type
, nfields
)
6755 && !is_dynamic_field (type
, nfields
))
6759 rtype
= alloc_type (TYPE_OBJFILE (type
));
6760 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6761 INIT_CPLUS_SPECIFIC (rtype
);
6762 TYPE_NFIELDS (rtype
) = nfields
;
6763 TYPE_FIELDS (rtype
) = (struct field
*)
6764 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6765 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6766 TYPE_NAME (rtype
) = ada_type_name (type
);
6767 TYPE_TAG_NAME (rtype
) = NULL
;
6768 TYPE_FIXED_INSTANCE (rtype
) = 1;
6774 for (f
= 0; f
< nfields
; f
+= 1)
6776 off
= align_value (off
, field_alignment (type
, f
))
6777 + TYPE_FIELD_BITPOS (type
, f
);
6778 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6779 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6781 if (ada_is_variant_part (type
, f
))
6784 fld_bit_len
= bit_incr
= 0;
6786 else if (is_dynamic_field (type
, f
))
6790 /* rtype's length is computed based on the run-time
6791 value of discriminants. If the discriminants are not
6792 initialized, the type size may be completely bogus and
6793 GDB may fail to allocate a value for it. So check the
6794 size first before creating the value. */
6796 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6801 /* Get the fixed type of the field. Note that, in this case, we
6802 do not want to get the real type out of the tag: if the current
6803 field is the parent part of a tagged record, we will get the
6804 tag of the object. Clearly wrong: the real type of the parent
6805 is not the real type of the child. We would end up in an infinite
6807 TYPE_FIELD_TYPE (rtype
, f
) =
6810 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6811 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6812 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6813 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6814 bit_incr
= fld_bit_len
=
6815 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6819 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6820 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6821 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6822 bit_incr
= fld_bit_len
=
6823 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6825 bit_incr
= fld_bit_len
=
6826 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6828 if (off
+ fld_bit_len
> bit_len
)
6829 bit_len
= off
+ fld_bit_len
;
6831 TYPE_LENGTH (rtype
) =
6832 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6835 /* We handle the variant part, if any, at the end because of certain
6836 odd cases in which it is re-ordered so as NOT to be the last field of
6837 the record. This can happen in the presence of representation
6839 if (variant_field
>= 0)
6841 struct type
*branch_type
;
6843 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6846 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6851 to_fixed_variant_branch_type
6852 (TYPE_FIELD_TYPE (type
, variant_field
),
6853 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6854 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6855 if (branch_type
== NULL
)
6857 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6858 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6859 TYPE_NFIELDS (rtype
) -= 1;
6863 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6864 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6866 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6868 if (off
+ fld_bit_len
> bit_len
)
6869 bit_len
= off
+ fld_bit_len
;
6870 TYPE_LENGTH (rtype
) =
6871 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6875 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6876 should contain the alignment of that record, which should be a strictly
6877 positive value. If null or negative, then something is wrong, most
6878 probably in the debug info. In that case, we don't round up the size
6879 of the resulting type. If this record is not part of another structure,
6880 the current RTYPE length might be good enough for our purposes. */
6881 if (TYPE_LENGTH (type
) <= 0)
6883 if (TYPE_NAME (rtype
))
6884 warning (_("Invalid type size for `%s' detected: %d."),
6885 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6887 warning (_("Invalid type size for <unnamed> detected: %d."),
6888 TYPE_LENGTH (type
));
6892 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6893 TYPE_LENGTH (type
));
6896 value_free_to_mark (mark
);
6897 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6898 error (_("record type with dynamic size is larger than varsize-limit"));
6902 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6905 static struct type
*
6906 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6907 CORE_ADDR address
, struct value
*dval0
)
6909 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6913 /* An ordinary record type in which ___XVL-convention fields and
6914 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6915 static approximations, containing all possible fields. Uses
6916 no runtime values. Useless for use in values, but that's OK,
6917 since the results are used only for type determinations. Works on both
6918 structs and unions. Representation note: to save space, we memorize
6919 the result of this function in the TYPE_TARGET_TYPE of the
6922 static struct type
*
6923 template_to_static_fixed_type (struct type
*type0
)
6929 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6930 return TYPE_TARGET_TYPE (type0
);
6932 nfields
= TYPE_NFIELDS (type0
);
6935 for (f
= 0; f
< nfields
; f
+= 1)
6937 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6938 struct type
*new_type
;
6940 if (is_dynamic_field (type0
, f
))
6941 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6943 new_type
= static_unwrap_type (field_type
);
6944 if (type
== type0
&& new_type
!= field_type
)
6946 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6947 TYPE_CODE (type
) = TYPE_CODE (type0
);
6948 INIT_CPLUS_SPECIFIC (type
);
6949 TYPE_NFIELDS (type
) = nfields
;
6950 TYPE_FIELDS (type
) = (struct field
*)
6951 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6952 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6953 sizeof (struct field
) * nfields
);
6954 TYPE_NAME (type
) = ada_type_name (type0
);
6955 TYPE_TAG_NAME (type
) = NULL
;
6956 TYPE_FIXED_INSTANCE (type
) = 1;
6957 TYPE_LENGTH (type
) = 0;
6959 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6960 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6965 /* Given an object of type TYPE whose contents are at VALADDR and
6966 whose address in memory is ADDRESS, returns a revision of TYPE,
6967 which should be a non-dynamic-sized record, in which the variant
6968 part, if any, is replaced with the appropriate branch. Looks
6969 for discriminant values in DVAL0, which can be NULL if the record
6970 contains the necessary discriminant values. */
6972 static struct type
*
6973 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6974 CORE_ADDR address
, struct value
*dval0
)
6976 struct value
*mark
= value_mark ();
6979 struct type
*branch_type
;
6980 int nfields
= TYPE_NFIELDS (type
);
6981 int variant_field
= variant_field_index (type
);
6983 if (variant_field
== -1)
6987 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6991 rtype
= alloc_type (TYPE_OBJFILE (type
));
6992 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6993 INIT_CPLUS_SPECIFIC (rtype
);
6994 TYPE_NFIELDS (rtype
) = nfields
;
6995 TYPE_FIELDS (rtype
) =
6996 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6997 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6998 sizeof (struct field
) * nfields
);
6999 TYPE_NAME (rtype
) = ada_type_name (type
);
7000 TYPE_TAG_NAME (rtype
) = NULL
;
7001 TYPE_FIXED_INSTANCE (rtype
) = 1;
7002 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7004 branch_type
= to_fixed_variant_branch_type
7005 (TYPE_FIELD_TYPE (type
, variant_field
),
7006 cond_offset_host (valaddr
,
7007 TYPE_FIELD_BITPOS (type
, variant_field
)
7009 cond_offset_target (address
,
7010 TYPE_FIELD_BITPOS (type
, variant_field
)
7011 / TARGET_CHAR_BIT
), dval
);
7012 if (branch_type
== NULL
)
7015 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7016 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7017 TYPE_NFIELDS (rtype
) -= 1;
7021 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7022 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7023 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7024 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7026 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7028 value_free_to_mark (mark
);
7032 /* An ordinary record type (with fixed-length fields) that describes
7033 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7034 beginning of this section]. Any necessary discriminants' values
7035 should be in DVAL, a record value; it may be NULL if the object
7036 at ADDR itself contains any necessary discriminant values.
7037 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7038 values from the record are needed. Except in the case that DVAL,
7039 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7040 unchecked) is replaced by a particular branch of the variant.
7042 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7043 is questionable and may be removed. It can arise during the
7044 processing of an unconstrained-array-of-record type where all the
7045 variant branches have exactly the same size. This is because in
7046 such cases, the compiler does not bother to use the XVS convention
7047 when encoding the record. I am currently dubious of this
7048 shortcut and suspect the compiler should be altered. FIXME. */
7050 static struct type
*
7051 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7052 CORE_ADDR address
, struct value
*dval
)
7054 struct type
*templ_type
;
7056 if (TYPE_FIXED_INSTANCE (type0
))
7059 templ_type
= dynamic_template_type (type0
);
7061 if (templ_type
!= NULL
)
7062 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7063 else if (variant_field_index (type0
) >= 0)
7065 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7067 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7072 TYPE_FIXED_INSTANCE (type0
) = 1;
7078 /* An ordinary record type (with fixed-length fields) that describes
7079 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7080 union type. Any necessary discriminants' values should be in DVAL,
7081 a record value. That is, this routine selects the appropriate
7082 branch of the union at ADDR according to the discriminant value
7083 indicated in the union's type name. Returns VAR_TYPE0 itself if
7084 it represents a variant subject to a pragma Unchecked_Union. */
7086 static struct type
*
7087 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7088 CORE_ADDR address
, struct value
*dval
)
7091 struct type
*templ_type
;
7092 struct type
*var_type
;
7094 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7095 var_type
= TYPE_TARGET_TYPE (var_type0
);
7097 var_type
= var_type0
;
7099 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7101 if (templ_type
!= NULL
)
7102 var_type
= templ_type
;
7104 if (is_unchecked_variant (var_type
, value_type (dval
)))
7107 ada_which_variant_applies (var_type
,
7108 value_type (dval
), value_contents (dval
));
7111 return empty_record (TYPE_OBJFILE (var_type
));
7112 else if (is_dynamic_field (var_type
, which
))
7113 return to_fixed_record_type
7114 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7115 valaddr
, address
, dval
);
7116 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7118 to_fixed_record_type
7119 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7121 return TYPE_FIELD_TYPE (var_type
, which
);
7124 /* Assuming that TYPE0 is an array type describing the type of a value
7125 at ADDR, and that DVAL describes a record containing any
7126 discriminants used in TYPE0, returns a type for the value that
7127 contains no dynamic components (that is, no components whose sizes
7128 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7129 true, gives an error message if the resulting type's size is over
7132 static struct type
*
7133 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7136 struct type
*index_type_desc
;
7137 struct type
*result
;
7139 if (ada_is_packed_array_type (type0
) /* revisit? */
7140 || TYPE_FIXED_INSTANCE (type0
))
7143 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7144 if (index_type_desc
== NULL
)
7146 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7147 /* NOTE: elt_type---the fixed version of elt_type0---should never
7148 depend on the contents of the array in properly constructed
7150 /* Create a fixed version of the array element type.
7151 We're not providing the address of an element here,
7152 and thus the actual object value cannot be inspected to do
7153 the conversion. This should not be a problem, since arrays of
7154 unconstrained objects are not allowed. In particular, all
7155 the elements of an array of a tagged type should all be of
7156 the same type specified in the debugging info. No need to
7157 consult the object tag. */
7158 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7160 if (elt_type0
== elt_type
)
7163 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7164 elt_type
, TYPE_INDEX_TYPE (type0
));
7169 struct type
*elt_type0
;
7172 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7173 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7175 /* NOTE: result---the fixed version of elt_type0---should never
7176 depend on the contents of the array in properly constructed
7178 /* Create a fixed version of the array element type.
7179 We're not providing the address of an element here,
7180 and thus the actual object value cannot be inspected to do
7181 the conversion. This should not be a problem, since arrays of
7182 unconstrained objects are not allowed. In particular, all
7183 the elements of an array of a tagged type should all be of
7184 the same type specified in the debugging info. No need to
7185 consult the object tag. */
7187 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7188 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7190 struct type
*range_type
=
7191 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7192 dval
, TYPE_OBJFILE (type0
));
7193 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7194 result
, range_type
);
7196 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7197 error (_("array type with dynamic size is larger than varsize-limit"));
7200 TYPE_FIXED_INSTANCE (result
) = 1;
7205 /* A standard type (containing no dynamically sized components)
7206 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7207 DVAL describes a record containing any discriminants used in TYPE0,
7208 and may be NULL if there are none, or if the object of type TYPE at
7209 ADDRESS or in VALADDR contains these discriminants.
7211 If CHECK_TAG is not null, in the case of tagged types, this function
7212 attempts to locate the object's tag and use it to compute the actual
7213 type. However, when ADDRESS is null, we cannot use it to determine the
7214 location of the tag, and therefore compute the tagged type's actual type.
7215 So we return the tagged type without consulting the tag. */
7217 static struct type
*
7218 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7219 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7221 type
= ada_check_typedef (type
);
7222 switch (TYPE_CODE (type
))
7226 case TYPE_CODE_STRUCT
:
7228 struct type
*static_type
= to_static_fixed_type (type
);
7229 struct type
*fixed_record_type
=
7230 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7231 /* If STATIC_TYPE is a tagged type and we know the object's address,
7232 then we can determine its tag, and compute the object's actual
7233 type from there. Note that we have to use the fixed record
7234 type (the parent part of the record may have dynamic fields
7235 and the way the location of _tag is expressed may depend on
7238 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7240 struct type
*real_type
=
7241 type_from_tag (value_tag_from_contents_and_address
7245 if (real_type
!= NULL
)
7246 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7249 /* Check to see if there is a parallel ___XVZ variable.
7250 If there is, then it provides the actual size of our type. */
7251 else if (ada_type_name (fixed_record_type
) != NULL
)
7253 char *name
= ada_type_name (fixed_record_type
);
7254 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7258 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7259 size
= get_int_var_value (xvz_name
, &xvz_found
);
7260 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7262 fixed_record_type
= copy_type (fixed_record_type
);
7263 TYPE_LENGTH (fixed_record_type
) = size
;
7265 /* The FIXED_RECORD_TYPE may have be a stub. We have
7266 observed this when the debugging info is STABS, and
7267 apparently it is something that is hard to fix.
7269 In practice, we don't need the actual type definition
7270 at all, because the presence of the XVZ variable allows us
7271 to assume that there must be a XVS type as well, which we
7272 should be able to use later, when we need the actual type
7275 In the meantime, pretend that the "fixed" type we are
7276 returning is NOT a stub, because this can cause trouble
7277 when using this type to create new types targeting it.
7278 Indeed, the associated creation routines often check
7279 whether the target type is a stub and will try to replace
7280 it, thus using a type with the wrong size. This, in turn,
7281 might cause the new type to have the wrong size too.
7282 Consider the case of an array, for instance, where the size
7283 of the array is computed from the number of elements in
7284 our array multiplied by the size of its element. */
7285 TYPE_STUB (fixed_record_type
) = 0;
7288 return fixed_record_type
;
7290 case TYPE_CODE_ARRAY
:
7291 return to_fixed_array_type (type
, dval
, 1);
7292 case TYPE_CODE_UNION
:
7296 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7300 /* The same as ada_to_fixed_type_1, except that it preserves the type
7301 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7302 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7305 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7306 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7309 struct type
*fixed_type
=
7310 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7312 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7313 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7319 /* A standard (static-sized) type corresponding as well as possible to
7320 TYPE0, but based on no runtime data. */
7322 static struct type
*
7323 to_static_fixed_type (struct type
*type0
)
7330 if (TYPE_FIXED_INSTANCE (type0
))
7333 type0
= ada_check_typedef (type0
);
7335 switch (TYPE_CODE (type0
))
7339 case TYPE_CODE_STRUCT
:
7340 type
= dynamic_template_type (type0
);
7342 return template_to_static_fixed_type (type
);
7344 return template_to_static_fixed_type (type0
);
7345 case TYPE_CODE_UNION
:
7346 type
= ada_find_parallel_type (type0
, "___XVU");
7348 return template_to_static_fixed_type (type
);
7350 return template_to_static_fixed_type (type0
);
7354 /* A static approximation of TYPE with all type wrappers removed. */
7356 static struct type
*
7357 static_unwrap_type (struct type
*type
)
7359 if (ada_is_aligner_type (type
))
7361 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7362 if (ada_type_name (type1
) == NULL
)
7363 TYPE_NAME (type1
) = ada_type_name (type
);
7365 return static_unwrap_type (type1
);
7369 struct type
*raw_real_type
= ada_get_base_type (type
);
7370 if (raw_real_type
== type
)
7373 return to_static_fixed_type (raw_real_type
);
7377 /* In some cases, incomplete and private types require
7378 cross-references that are not resolved as records (for example,
7380 type FooP is access Foo;
7382 type Foo is array ...;
7383 ). In these cases, since there is no mechanism for producing
7384 cross-references to such types, we instead substitute for FooP a
7385 stub enumeration type that is nowhere resolved, and whose tag is
7386 the name of the actual type. Call these types "non-record stubs". */
7388 /* A type equivalent to TYPE that is not a non-record stub, if one
7389 exists, otherwise TYPE. */
7392 ada_check_typedef (struct type
*type
)
7397 CHECK_TYPEDEF (type
);
7398 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7399 || !TYPE_STUB (type
)
7400 || TYPE_TAG_NAME (type
) == NULL
)
7404 char *name
= TYPE_TAG_NAME (type
);
7405 struct type
*type1
= ada_find_any_type (name
);
7406 return (type1
== NULL
) ? type
: type1
;
7410 /* A value representing the data at VALADDR/ADDRESS as described by
7411 type TYPE0, but with a standard (static-sized) type that correctly
7412 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7413 type, then return VAL0 [this feature is simply to avoid redundant
7414 creation of struct values]. */
7416 static struct value
*
7417 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7420 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7421 if (type
== type0
&& val0
!= NULL
)
7424 return value_from_contents_and_address (type
, 0, address
);
7427 /* A value representing VAL, but with a standard (static-sized) type
7428 that correctly describes it. Does not necessarily create a new
7431 static struct value
*
7432 ada_to_fixed_value (struct value
*val
)
7434 return ada_to_fixed_value_create (value_type (val
),
7435 VALUE_ADDRESS (val
) + value_offset (val
),
7439 /* A value representing VAL, but with a standard (static-sized) type
7440 chosen to approximate the real type of VAL as well as possible, but
7441 without consulting any runtime values. For Ada dynamic-sized
7442 types, therefore, the type of the result is likely to be inaccurate. */
7444 static struct value
*
7445 ada_to_static_fixed_value (struct value
*val
)
7448 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7449 if (type
== value_type (val
))
7452 return coerce_unspec_val_to_type (val
, type
);
7458 /* Table mapping attribute numbers to names.
7459 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7461 static const char *attribute_names
[] = {
7479 ada_attribute_name (enum exp_opcode n
)
7481 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7482 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7484 return attribute_names
[0];
7487 /* Evaluate the 'POS attribute applied to ARG. */
7490 pos_atr (struct value
*arg
)
7492 struct value
*val
= coerce_ref (arg
);
7493 struct type
*type
= value_type (val
);
7495 if (!discrete_type_p (type
))
7496 error (_("'POS only defined on discrete types"));
7498 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7501 LONGEST v
= value_as_long (val
);
7503 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7505 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7508 error (_("enumeration value is invalid: can't find 'POS"));
7511 return value_as_long (val
);
7514 static struct value
*
7515 value_pos_atr (struct type
*type
, struct value
*arg
)
7517 return value_from_longest (type
, pos_atr (arg
));
7520 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7522 static struct value
*
7523 value_val_atr (struct type
*type
, struct value
*arg
)
7525 if (!discrete_type_p (type
))
7526 error (_("'VAL only defined on discrete types"));
7527 if (!integer_type_p (value_type (arg
)))
7528 error (_("'VAL requires integral argument"));
7530 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7532 long pos
= value_as_long (arg
);
7533 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7534 error (_("argument to 'VAL out of range"));
7535 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7538 return value_from_longest (type
, value_as_long (arg
));
7544 /* True if TYPE appears to be an Ada character type.
7545 [At the moment, this is true only for Character and Wide_Character;
7546 It is a heuristic test that could stand improvement]. */
7549 ada_is_character_type (struct type
*type
)
7553 /* If the type code says it's a character, then assume it really is,
7554 and don't check any further. */
7555 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7558 /* Otherwise, assume it's a character type iff it is a discrete type
7559 with a known character type name. */
7560 name
= ada_type_name (type
);
7561 return (name
!= NULL
7562 && (TYPE_CODE (type
) == TYPE_CODE_INT
7563 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7564 && (strcmp (name
, "character") == 0
7565 || strcmp (name
, "wide_character") == 0
7566 || strcmp (name
, "wide_wide_character") == 0
7567 || strcmp (name
, "unsigned char") == 0));
7570 /* True if TYPE appears to be an Ada string type. */
7573 ada_is_string_type (struct type
*type
)
7575 type
= ada_check_typedef (type
);
7577 && TYPE_CODE (type
) != TYPE_CODE_PTR
7578 && (ada_is_simple_array_type (type
)
7579 || ada_is_array_descriptor_type (type
))
7580 && ada_array_arity (type
) == 1)
7582 struct type
*elttype
= ada_array_element_type (type
, 1);
7584 return ada_is_character_type (elttype
);
7591 /* True if TYPE is a struct type introduced by the compiler to force the
7592 alignment of a value. Such types have a single field with a
7593 distinctive name. */
7596 ada_is_aligner_type (struct type
*type
)
7598 type
= ada_check_typedef (type
);
7600 /* If we can find a parallel XVS type, then the XVS type should
7601 be used instead of this type. And hence, this is not an aligner
7603 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7606 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7607 && TYPE_NFIELDS (type
) == 1
7608 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7611 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7612 the parallel type. */
7615 ada_get_base_type (struct type
*raw_type
)
7617 struct type
*real_type_namer
;
7618 struct type
*raw_real_type
;
7620 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7623 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7624 if (real_type_namer
== NULL
7625 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7626 || TYPE_NFIELDS (real_type_namer
) != 1)
7629 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7630 if (raw_real_type
== NULL
)
7633 return raw_real_type
;
7636 /* The type of value designated by TYPE, with all aligners removed. */
7639 ada_aligned_type (struct type
*type
)
7641 if (ada_is_aligner_type (type
))
7642 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7644 return ada_get_base_type (type
);
7648 /* The address of the aligned value in an object at address VALADDR
7649 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7652 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7654 if (ada_is_aligner_type (type
))
7655 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7657 TYPE_FIELD_BITPOS (type
,
7658 0) / TARGET_CHAR_BIT
);
7665 /* The printed representation of an enumeration literal with encoded
7666 name NAME. The value is good to the next call of ada_enum_name. */
7668 ada_enum_name (const char *name
)
7670 static char *result
;
7671 static size_t result_len
= 0;
7674 /* First, unqualify the enumeration name:
7675 1. Search for the last '.' character. If we find one, then skip
7676 all the preceeding characters, the unqualified name starts
7677 right after that dot.
7678 2. Otherwise, we may be debugging on a target where the compiler
7679 translates dots into "__". Search forward for double underscores,
7680 but stop searching when we hit an overloading suffix, which is
7681 of the form "__" followed by digits. */
7683 tmp
= strrchr (name
, '.');
7688 while ((tmp
= strstr (name
, "__")) != NULL
)
7690 if (isdigit (tmp
[2]))
7700 if (name
[1] == 'U' || name
[1] == 'W')
7702 if (sscanf (name
+ 2, "%x", &v
) != 1)
7708 GROW_VECT (result
, result_len
, 16);
7709 if (isascii (v
) && isprint (v
))
7710 xsnprintf (result
, result_len
, "'%c'", v
);
7711 else if (name
[1] == 'U')
7712 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7714 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7720 tmp
= strstr (name
, "__");
7722 tmp
= strstr (name
, "$");
7725 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7726 strncpy (result
, name
, tmp
- name
);
7727 result
[tmp
- name
] = '\0';
7735 static struct value
*
7736 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7739 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7740 (expect_type
, exp
, pos
, noside
);
7743 /* Evaluate the subexpression of EXP starting at *POS as for
7744 evaluate_type, updating *POS to point just past the evaluated
7747 static struct value
*
7748 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7750 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7751 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7754 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7757 static struct value
*
7758 unwrap_value (struct value
*val
)
7760 struct type
*type
= ada_check_typedef (value_type (val
));
7761 if (ada_is_aligner_type (type
))
7763 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7764 struct type
*val_type
= ada_check_typedef (value_type (v
));
7765 if (ada_type_name (val_type
) == NULL
)
7766 TYPE_NAME (val_type
) = ada_type_name (type
);
7768 return unwrap_value (v
);
7772 struct type
*raw_real_type
=
7773 ada_check_typedef (ada_get_base_type (type
));
7775 if (type
== raw_real_type
)
7779 coerce_unspec_val_to_type
7780 (val
, ada_to_fixed_type (raw_real_type
, 0,
7781 VALUE_ADDRESS (val
) + value_offset (val
),
7786 static struct value
*
7787 cast_to_fixed (struct type
*type
, struct value
*arg
)
7791 if (type
== value_type (arg
))
7793 else if (ada_is_fixed_point_type (value_type (arg
)))
7794 val
= ada_float_to_fixed (type
,
7795 ada_fixed_to_float (value_type (arg
),
7796 value_as_long (arg
)));
7799 DOUBLEST argd
= value_as_double (arg
);
7800 val
= ada_float_to_fixed (type
, argd
);
7803 return value_from_longest (type
, val
);
7806 static struct value
*
7807 cast_from_fixed (struct type
*type
, struct value
*arg
)
7809 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7810 value_as_long (arg
));
7811 return value_from_double (type
, val
);
7814 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7815 return the converted value. */
7817 static struct value
*
7818 coerce_for_assign (struct type
*type
, struct value
*val
)
7820 struct type
*type2
= value_type (val
);
7824 type2
= ada_check_typedef (type2
);
7825 type
= ada_check_typedef (type
);
7827 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7828 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7830 val
= ada_value_ind (val
);
7831 type2
= value_type (val
);
7834 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7835 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7837 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7838 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7839 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7840 error (_("Incompatible types in assignment"));
7841 deprecated_set_value_type (val
, type
);
7846 static struct value
*
7847 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7850 struct type
*type1
, *type2
;
7853 arg1
= coerce_ref (arg1
);
7854 arg2
= coerce_ref (arg2
);
7855 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7856 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7858 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7859 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7860 return value_binop (arg1
, arg2
, op
);
7869 return value_binop (arg1
, arg2
, op
);
7872 v2
= value_as_long (arg2
);
7874 error (_("second operand of %s must not be zero."), op_string (op
));
7876 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7877 return value_binop (arg1
, arg2
, op
);
7879 v1
= value_as_long (arg1
);
7884 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7885 v
+= v
> 0 ? -1 : 1;
7893 /* Should not reach this point. */
7897 val
= allocate_value (type1
);
7898 store_unsigned_integer (value_contents_raw (val
),
7899 TYPE_LENGTH (value_type (val
)), v
);
7904 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7906 if (ada_is_direct_array_type (value_type (arg1
))
7907 || ada_is_direct_array_type (value_type (arg2
)))
7909 /* Automatically dereference any array reference before
7910 we attempt to perform the comparison. */
7911 arg1
= ada_coerce_ref (arg1
);
7912 arg2
= ada_coerce_ref (arg2
);
7914 arg1
= ada_coerce_to_simple_array (arg1
);
7915 arg2
= ada_coerce_to_simple_array (arg2
);
7916 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7917 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7918 error (_("Attempt to compare array with non-array"));
7919 /* FIXME: The following works only for types whose
7920 representations use all bits (no padding or undefined bits)
7921 and do not have user-defined equality. */
7923 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7924 && memcmp (value_contents (arg1
), value_contents (arg2
),
7925 TYPE_LENGTH (value_type (arg1
))) == 0;
7927 return value_equal (arg1
, arg2
);
7930 /* Total number of component associations in the aggregate starting at
7931 index PC in EXP. Assumes that index PC is the start of an
7935 num_component_specs (struct expression
*exp
, int pc
)
7938 m
= exp
->elts
[pc
+ 1].longconst
;
7941 for (i
= 0; i
< m
; i
+= 1)
7943 switch (exp
->elts
[pc
].opcode
)
7949 n
+= exp
->elts
[pc
+ 1].longconst
;
7952 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7957 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7958 component of LHS (a simple array or a record), updating *POS past
7959 the expression, assuming that LHS is contained in CONTAINER. Does
7960 not modify the inferior's memory, nor does it modify LHS (unless
7961 LHS == CONTAINER). */
7964 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7965 struct expression
*exp
, int *pos
)
7967 struct value
*mark
= value_mark ();
7969 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7971 struct value
*index_val
= value_from_longest (builtin_type_int32
, index
);
7972 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7976 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7977 elt
= ada_to_fixed_value (unwrap_value (elt
));
7980 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7981 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7983 value_assign_to_component (container
, elt
,
7984 ada_evaluate_subexp (NULL
, exp
, pos
,
7987 value_free_to_mark (mark
);
7990 /* Assuming that LHS represents an lvalue having a record or array
7991 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7992 of that aggregate's value to LHS, advancing *POS past the
7993 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7994 lvalue containing LHS (possibly LHS itself). Does not modify
7995 the inferior's memory, nor does it modify the contents of
7996 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7998 static struct value
*
7999 assign_aggregate (struct value
*container
,
8000 struct value
*lhs
, struct expression
*exp
,
8001 int *pos
, enum noside noside
)
8003 struct type
*lhs_type
;
8004 int n
= exp
->elts
[*pos
+1].longconst
;
8005 LONGEST low_index
, high_index
;
8008 int max_indices
, num_indices
;
8009 int is_array_aggregate
;
8011 struct value
*mark
= value_mark ();
8014 if (noside
!= EVAL_NORMAL
)
8017 for (i
= 0; i
< n
; i
+= 1)
8018 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8022 container
= ada_coerce_ref (container
);
8023 if (ada_is_direct_array_type (value_type (container
)))
8024 container
= ada_coerce_to_simple_array (container
);
8025 lhs
= ada_coerce_ref (lhs
);
8026 if (!deprecated_value_modifiable (lhs
))
8027 error (_("Left operand of assignment is not a modifiable lvalue."));
8029 lhs_type
= value_type (lhs
);
8030 if (ada_is_direct_array_type (lhs_type
))
8032 lhs
= ada_coerce_to_simple_array (lhs
);
8033 lhs_type
= value_type (lhs
);
8034 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8035 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8036 is_array_aggregate
= 1;
8038 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8041 high_index
= num_visible_fields (lhs_type
) - 1;
8042 is_array_aggregate
= 0;
8045 error (_("Left-hand side must be array or record."));
8047 num_specs
= num_component_specs (exp
, *pos
- 3);
8048 max_indices
= 4 * num_specs
+ 4;
8049 indices
= alloca (max_indices
* sizeof (indices
[0]));
8050 indices
[0] = indices
[1] = low_index
- 1;
8051 indices
[2] = indices
[3] = high_index
+ 1;
8054 for (i
= 0; i
< n
; i
+= 1)
8056 switch (exp
->elts
[*pos
].opcode
)
8059 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8060 &num_indices
, max_indices
,
8061 low_index
, high_index
);
8064 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8065 &num_indices
, max_indices
,
8066 low_index
, high_index
);
8070 error (_("Misplaced 'others' clause"));
8071 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8072 num_indices
, low_index
, high_index
);
8075 error (_("Internal error: bad aggregate clause"));
8082 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8083 construct at *POS, updating *POS past the construct, given that
8084 the positions are relative to lower bound LOW, where HIGH is the
8085 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8086 updating *NUM_INDICES as needed. CONTAINER is as for
8087 assign_aggregate. */
8089 aggregate_assign_positional (struct value
*container
,
8090 struct value
*lhs
, struct expression
*exp
,
8091 int *pos
, LONGEST
*indices
, int *num_indices
,
8092 int max_indices
, LONGEST low
, LONGEST high
)
8094 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8096 if (ind
- 1 == high
)
8097 warning (_("Extra components in aggregate ignored."));
8100 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8102 assign_component (container
, lhs
, ind
, exp
, pos
);
8105 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8108 /* Assign into the components of LHS indexed by the OP_CHOICES
8109 construct at *POS, updating *POS past the construct, given that
8110 the allowable indices are LOW..HIGH. Record the indices assigned
8111 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8112 needed. CONTAINER is as for assign_aggregate. */
8114 aggregate_assign_from_choices (struct value
*container
,
8115 struct value
*lhs
, struct expression
*exp
,
8116 int *pos
, LONGEST
*indices
, int *num_indices
,
8117 int max_indices
, LONGEST low
, LONGEST high
)
8120 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8121 int choice_pos
, expr_pc
;
8122 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8124 choice_pos
= *pos
+= 3;
8126 for (j
= 0; j
< n_choices
; j
+= 1)
8127 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8129 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8131 for (j
= 0; j
< n_choices
; j
+= 1)
8133 LONGEST lower
, upper
;
8134 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8135 if (op
== OP_DISCRETE_RANGE
)
8138 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8140 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8145 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8156 name
= &exp
->elts
[choice_pos
+ 2].string
;
8159 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8162 error (_("Invalid record component association."));
8164 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8166 if (! find_struct_field (name
, value_type (lhs
), 0,
8167 NULL
, NULL
, NULL
, NULL
, &ind
))
8168 error (_("Unknown component name: %s."), name
);
8169 lower
= upper
= ind
;
8172 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8173 error (_("Index in component association out of bounds."));
8175 add_component_interval (lower
, upper
, indices
, num_indices
,
8177 while (lower
<= upper
)
8181 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8187 /* Assign the value of the expression in the OP_OTHERS construct in
8188 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8189 have not been previously assigned. The index intervals already assigned
8190 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8191 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8193 aggregate_assign_others (struct value
*container
,
8194 struct value
*lhs
, struct expression
*exp
,
8195 int *pos
, LONGEST
*indices
, int num_indices
,
8196 LONGEST low
, LONGEST high
)
8199 int expr_pc
= *pos
+1;
8201 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8204 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8208 assign_component (container
, lhs
, ind
, exp
, &pos
);
8211 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8214 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8215 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8216 modifying *SIZE as needed. It is an error if *SIZE exceeds
8217 MAX_SIZE. The resulting intervals do not overlap. */
8219 add_component_interval (LONGEST low
, LONGEST high
,
8220 LONGEST
* indices
, int *size
, int max_size
)
8223 for (i
= 0; i
< *size
; i
+= 2) {
8224 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8227 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8228 if (high
< indices
[kh
])
8230 if (low
< indices
[i
])
8232 indices
[i
+ 1] = indices
[kh
- 1];
8233 if (high
> indices
[i
+ 1])
8234 indices
[i
+ 1] = high
;
8235 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8236 *size
-= kh
- i
- 2;
8239 else if (high
< indices
[i
])
8243 if (*size
== max_size
)
8244 error (_("Internal error: miscounted aggregate components."));
8246 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8247 indices
[j
] = indices
[j
- 2];
8249 indices
[i
+ 1] = high
;
8252 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8255 static struct value
*
8256 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8258 if (type
== ada_check_typedef (value_type (arg2
)))
8261 if (ada_is_fixed_point_type (type
))
8262 return (cast_to_fixed (type
, arg2
));
8264 if (ada_is_fixed_point_type (value_type (arg2
)))
8265 return cast_from_fixed (type
, arg2
);
8267 return value_cast (type
, arg2
);
8270 static struct value
*
8271 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8272 int *pos
, enum noside noside
)
8275 int tem
, tem2
, tem3
;
8277 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8280 struct value
**argvec
;
8284 op
= exp
->elts
[pc
].opcode
;
8290 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8291 arg1
= unwrap_value (arg1
);
8293 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8294 then we need to perform the conversion manually, because
8295 evaluate_subexp_standard doesn't do it. This conversion is
8296 necessary in Ada because the different kinds of float/fixed
8297 types in Ada have different representations.
8299 Similarly, we need to perform the conversion from OP_LONG
8301 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8302 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8308 struct value
*result
;
8310 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8311 /* The result type will have code OP_STRING, bashed there from
8312 OP_ARRAY. Bash it back. */
8313 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8314 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8320 type
= exp
->elts
[pc
+ 1].type
;
8321 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8322 if (noside
== EVAL_SKIP
)
8324 arg1
= ada_value_cast (type
, arg1
, noside
);
8329 type
= exp
->elts
[pc
+ 1].type
;
8330 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8333 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8334 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8336 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8337 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8339 return ada_value_assign (arg1
, arg1
);
8341 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8342 except if the lhs of our assignment is a convenience variable.
8343 In the case of assigning to a convenience variable, the lhs
8344 should be exactly the result of the evaluation of the rhs. */
8345 type
= value_type (arg1
);
8346 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8348 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8349 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8351 if (ada_is_fixed_point_type (value_type (arg1
)))
8352 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8353 else if (ada_is_fixed_point_type (value_type (arg2
)))
8355 (_("Fixed-point values must be assigned to fixed-point variables"));
8357 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8358 return ada_value_assign (arg1
, arg2
);
8361 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8362 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8363 if (noside
== EVAL_SKIP
)
8365 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8366 return (value_from_longest
8368 value_as_long (arg1
) + value_as_long (arg2
)));
8369 if ((ada_is_fixed_point_type (value_type (arg1
))
8370 || ada_is_fixed_point_type (value_type (arg2
)))
8371 && value_type (arg1
) != value_type (arg2
))
8372 error (_("Operands of fixed-point addition must have the same type"));
8373 /* Do the addition, and cast the result to the type of the first
8374 argument. We cannot cast the result to a reference type, so if
8375 ARG1 is a reference type, find its underlying type. */
8376 type
= value_type (arg1
);
8377 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8378 type
= TYPE_TARGET_TYPE (type
);
8379 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8380 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8383 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8384 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8385 if (noside
== EVAL_SKIP
)
8387 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8388 return (value_from_longest
8390 value_as_long (arg1
) - value_as_long (arg2
)));
8391 if ((ada_is_fixed_point_type (value_type (arg1
))
8392 || ada_is_fixed_point_type (value_type (arg2
)))
8393 && value_type (arg1
) != value_type (arg2
))
8394 error (_("Operands of fixed-point subtraction must have the same type"));
8395 /* Do the substraction, and cast the result to the type of the first
8396 argument. We cannot cast the result to a reference type, so if
8397 ARG1 is a reference type, find its underlying type. */
8398 type
= value_type (arg1
);
8399 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8400 type
= TYPE_TARGET_TYPE (type
);
8401 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8402 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8408 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8409 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8410 if (noside
== EVAL_SKIP
)
8412 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8414 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8415 return value_zero (value_type (arg1
), not_lval
);
8419 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8420 if (ada_is_fixed_point_type (value_type (arg1
)))
8421 arg1
= cast_from_fixed (type
, arg1
);
8422 if (ada_is_fixed_point_type (value_type (arg2
)))
8423 arg2
= cast_from_fixed (type
, arg2
);
8424 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8425 return ada_value_binop (arg1
, arg2
, op
);
8429 case BINOP_NOTEQUAL
:
8430 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8431 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8432 if (noside
== EVAL_SKIP
)
8434 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8438 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8439 tem
= ada_value_equal (arg1
, arg2
);
8441 if (op
== BINOP_NOTEQUAL
)
8443 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8444 return value_from_longest (type
, (LONGEST
) tem
);
8447 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8448 if (noside
== EVAL_SKIP
)
8450 else if (ada_is_fixed_point_type (value_type (arg1
)))
8451 return value_cast (value_type (arg1
), value_neg (arg1
));
8454 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8455 return value_neg (arg1
);
8458 case BINOP_LOGICAL_AND
:
8459 case BINOP_LOGICAL_OR
:
8460 case UNOP_LOGICAL_NOT
:
8465 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8466 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8467 return value_cast (type
, val
);
8470 case BINOP_BITWISE_AND
:
8471 case BINOP_BITWISE_IOR
:
8472 case BINOP_BITWISE_XOR
:
8476 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8478 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8480 return value_cast (value_type (arg1
), val
);
8486 if (noside
== EVAL_SKIP
)
8491 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8492 /* Only encountered when an unresolved symbol occurs in a
8493 context other than a function call, in which case, it is
8495 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8496 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8497 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8499 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8500 if (ada_is_tagged_type (type
, 0))
8502 /* Tagged types are a little special in the fact that the real
8503 type is dynamic and can only be determined by inspecting the
8504 object's tag. This means that we need to get the object's
8505 value first (EVAL_NORMAL) and then extract the actual object
8508 Note that we cannot skip the final step where we extract
8509 the object type from its tag, because the EVAL_NORMAL phase
8510 results in dynamic components being resolved into fixed ones.
8511 This can cause problems when trying to print the type
8512 description of tagged types whose parent has a dynamic size:
8513 We use the type name of the "_parent" component in order
8514 to print the name of the ancestor type in the type description.
8515 If that component had a dynamic size, the resolution into
8516 a fixed type would result in the loss of that type name,
8517 thus preventing us from printing the name of the ancestor
8518 type in the type description. */
8519 struct type
*actual_type
;
8521 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8522 actual_type
= type_from_tag (ada_value_tag (arg1
));
8523 if (actual_type
== NULL
)
8524 /* If, for some reason, we were unable to determine
8525 the actual type from the tag, then use the static
8526 approximation that we just computed as a fallback.
8527 This can happen if the debugging information is
8528 incomplete, for instance. */
8531 return value_zero (actual_type
, not_lval
);
8536 (to_static_fixed_type
8537 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8543 unwrap_value (evaluate_subexp_standard
8544 (expect_type
, exp
, pos
, noside
));
8545 return ada_to_fixed_value (arg1
);
8551 /* Allocate arg vector, including space for the function to be
8552 called in argvec[0] and a terminating NULL. */
8553 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8555 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8557 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8558 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8559 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8560 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8563 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8564 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8567 if (noside
== EVAL_SKIP
)
8571 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8572 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8573 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8574 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8575 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8576 argvec
[0] = value_addr (argvec
[0]);
8578 type
= ada_check_typedef (value_type (argvec
[0]));
8579 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8581 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8583 case TYPE_CODE_FUNC
:
8584 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8586 case TYPE_CODE_ARRAY
:
8588 case TYPE_CODE_STRUCT
:
8589 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8590 argvec
[0] = ada_value_ind (argvec
[0]);
8591 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8594 error (_("cannot subscript or call something of type `%s'"),
8595 ada_type_name (value_type (argvec
[0])));
8600 switch (TYPE_CODE (type
))
8602 case TYPE_CODE_FUNC
:
8603 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8604 return allocate_value (TYPE_TARGET_TYPE (type
));
8605 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8606 case TYPE_CODE_STRUCT
:
8610 arity
= ada_array_arity (type
);
8611 type
= ada_array_element_type (type
, nargs
);
8613 error (_("cannot subscript or call a record"));
8615 error (_("wrong number of subscripts; expecting %d"), arity
);
8616 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8617 return value_zero (ada_aligned_type (type
), lval_memory
);
8619 unwrap_value (ada_value_subscript
8620 (argvec
[0], nargs
, argvec
+ 1));
8622 case TYPE_CODE_ARRAY
:
8623 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8625 type
= ada_array_element_type (type
, nargs
);
8627 error (_("element type of array unknown"));
8629 return value_zero (ada_aligned_type (type
), lval_memory
);
8632 unwrap_value (ada_value_subscript
8633 (ada_coerce_to_simple_array (argvec
[0]),
8634 nargs
, argvec
+ 1));
8635 case TYPE_CODE_PTR
: /* Pointer to array */
8636 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8637 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8639 type
= ada_array_element_type (type
, nargs
);
8641 error (_("element type of array unknown"));
8643 return value_zero (ada_aligned_type (type
), lval_memory
);
8646 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8647 nargs
, argvec
+ 1));
8650 error (_("Attempt to index or call something other than an "
8651 "array or function"));
8656 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8657 struct value
*low_bound_val
=
8658 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8659 struct value
*high_bound_val
=
8660 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8663 low_bound_val
= coerce_ref (low_bound_val
);
8664 high_bound_val
= coerce_ref (high_bound_val
);
8665 low_bound
= pos_atr (low_bound_val
);
8666 high_bound
= pos_atr (high_bound_val
);
8668 if (noside
== EVAL_SKIP
)
8671 /* If this is a reference to an aligner type, then remove all
8673 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8674 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8675 TYPE_TARGET_TYPE (value_type (array
)) =
8676 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8678 if (ada_is_packed_array_type (value_type (array
)))
8679 error (_("cannot slice a packed array"));
8681 /* If this is a reference to an array or an array lvalue,
8682 convert to a pointer. */
8683 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8684 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8685 && VALUE_LVAL (array
) == lval_memory
))
8686 array
= value_addr (array
);
8688 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8689 && ada_is_array_descriptor_type (ada_check_typedef
8690 (value_type (array
))))
8691 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8693 array
= ada_coerce_to_simple_array_ptr (array
);
8695 /* If we have more than one level of pointer indirection,
8696 dereference the value until we get only one level. */
8697 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8698 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8700 array
= value_ind (array
);
8702 /* Make sure we really do have an array type before going further,
8703 to avoid a SEGV when trying to get the index type or the target
8704 type later down the road if the debug info generated by
8705 the compiler is incorrect or incomplete. */
8706 if (!ada_is_simple_array_type (value_type (array
)))
8707 error (_("cannot take slice of non-array"));
8709 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8711 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8712 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8716 struct type
*arr_type0
=
8717 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8719 return ada_value_slice_from_ptr (array
, arr_type0
,
8720 longest_to_int (low_bound
),
8721 longest_to_int (high_bound
));
8724 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8726 else if (high_bound
< low_bound
)
8727 return empty_array (value_type (array
), low_bound
);
8729 return ada_value_slice (array
, longest_to_int (low_bound
),
8730 longest_to_int (high_bound
));
8735 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8736 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
8738 if (noside
== EVAL_SKIP
)
8741 switch (TYPE_CODE (type
))
8744 lim_warning (_("Membership test incompletely implemented; "
8745 "always returns true"));
8746 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8747 return value_from_longest (type
, (LONGEST
) 1);
8749 case TYPE_CODE_RANGE
:
8750 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
8751 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
8752 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8753 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8754 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8756 value_from_longest (type
,
8757 (value_less (arg1
, arg3
)
8758 || value_equal (arg1
, arg3
))
8759 && (value_less (arg2
, arg1
)
8760 || value_equal (arg2
, arg1
)));
8763 case BINOP_IN_BOUNDS
:
8765 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8766 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8768 if (noside
== EVAL_SKIP
)
8771 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8773 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8774 return value_zero (type
, not_lval
);
8777 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8779 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8780 error (_("invalid dimension number to 'range"));
8782 arg3
= ada_array_bound (arg2
, tem
, 1);
8783 arg2
= ada_array_bound (arg2
, tem
, 0);
8785 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8786 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8787 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8789 value_from_longest (type
,
8790 (value_less (arg1
, arg3
)
8791 || value_equal (arg1
, arg3
))
8792 && (value_less (arg2
, arg1
)
8793 || value_equal (arg2
, arg1
)));
8795 case TERNOP_IN_RANGE
:
8796 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8797 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8798 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8800 if (noside
== EVAL_SKIP
)
8803 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8804 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8805 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8807 value_from_longest (type
,
8808 (value_less (arg1
, arg3
)
8809 || value_equal (arg1
, arg3
))
8810 && (value_less (arg2
, arg1
)
8811 || value_equal (arg2
, arg1
)));
8817 struct type
*type_arg
;
8818 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8820 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8822 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
8826 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8830 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8831 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8832 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8835 if (noside
== EVAL_SKIP
)
8838 if (type_arg
== NULL
)
8840 arg1
= ada_coerce_ref (arg1
);
8842 if (ada_is_packed_array_type (value_type (arg1
)))
8843 arg1
= ada_coerce_to_simple_array (arg1
);
8845 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8846 error (_("invalid dimension number to '%s"),
8847 ada_attribute_name (op
));
8849 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8851 type
= ada_index_type (value_type (arg1
), tem
);
8854 (_("attempt to take bound of something that is not an array"));
8855 return allocate_value (type
);
8860 default: /* Should never happen. */
8861 error (_("unexpected attribute encountered"));
8863 return ada_array_bound (arg1
, tem
, 0);
8865 return ada_array_bound (arg1
, tem
, 1);
8867 return ada_array_length (arg1
, tem
);
8870 else if (discrete_type_p (type_arg
))
8872 struct type
*range_type
;
8873 char *name
= ada_type_name (type_arg
);
8875 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8877 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8878 if (range_type
== NULL
)
8879 range_type
= type_arg
;
8883 error (_("unexpected attribute encountered"));
8885 return value_from_longest
8886 (range_type
, discrete_type_low_bound (range_type
));
8888 return value_from_longest
8889 (range_type
, discrete_type_high_bound (range_type
));
8891 error (_("the 'length attribute applies only to array types"));
8894 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8895 error (_("unimplemented type attribute"));
8900 if (ada_is_packed_array_type (type_arg
))
8901 type_arg
= decode_packed_array_type (type_arg
);
8903 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8904 error (_("invalid dimension number to '%s"),
8905 ada_attribute_name (op
));
8907 type
= ada_index_type (type_arg
, tem
);
8910 (_("attempt to take bound of something that is not an array"));
8911 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8912 return allocate_value (type
);
8917 error (_("unexpected attribute encountered"));
8919 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8920 return value_from_longest (type
, low
);
8922 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8923 return value_from_longest (type
, high
);
8925 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8926 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8927 return value_from_longest (type
, high
- low
+ 1);
8933 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8934 if (noside
== EVAL_SKIP
)
8937 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8938 return value_zero (ada_tag_type (arg1
), not_lval
);
8940 return ada_value_tag (arg1
);
8944 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8945 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8946 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8947 if (noside
== EVAL_SKIP
)
8949 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8950 return value_zero (value_type (arg1
), not_lval
);
8953 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8954 return value_binop (arg1
, arg2
,
8955 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8958 case OP_ATR_MODULUS
:
8960 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
8961 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8963 if (noside
== EVAL_SKIP
)
8966 if (!ada_is_modular_type (type_arg
))
8967 error (_("'modulus must be applied to modular type"));
8969 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8970 ada_modulus (type_arg
));
8975 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8976 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8977 if (noside
== EVAL_SKIP
)
8979 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8980 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8981 return value_zero (type
, not_lval
);
8983 return value_pos_atr (type
, arg1
);
8986 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8987 type
= value_type (arg1
);
8989 /* If the argument is a reference, then dereference its type, since
8990 the user is really asking for the size of the actual object,
8991 not the size of the pointer. */
8992 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
8993 type
= TYPE_TARGET_TYPE (type
);
8995 if (noside
== EVAL_SKIP
)
8997 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8998 return value_zero (builtin_type_int32
, not_lval
);
9000 return value_from_longest (builtin_type_int32
,
9001 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9004 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9005 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9006 type
= exp
->elts
[pc
+ 2].type
;
9007 if (noside
== EVAL_SKIP
)
9009 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9010 return value_zero (type
, not_lval
);
9012 return value_val_atr (type
, arg1
);
9015 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9016 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9017 if (noside
== EVAL_SKIP
)
9019 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9020 return value_zero (value_type (arg1
), not_lval
);
9023 /* For integer exponentiation operations,
9024 only promote the first argument. */
9025 if (is_integral_type (value_type (arg2
)))
9026 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9028 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9030 return value_binop (arg1
, arg2
, op
);
9034 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9035 if (noside
== EVAL_SKIP
)
9041 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9042 if (noside
== EVAL_SKIP
)
9044 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9045 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9046 return value_neg (arg1
);
9051 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9052 if (noside
== EVAL_SKIP
)
9054 type
= ada_check_typedef (value_type (arg1
));
9055 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9057 if (ada_is_array_descriptor_type (type
))
9058 /* GDB allows dereferencing GNAT array descriptors. */
9060 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9061 if (arrType
== NULL
)
9062 error (_("Attempt to dereference null array pointer."));
9063 return value_at_lazy (arrType
, 0);
9065 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9066 || TYPE_CODE (type
) == TYPE_CODE_REF
9067 /* In C you can dereference an array to get the 1st elt. */
9068 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9070 type
= to_static_fixed_type
9072 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9074 return value_zero (type
, lval_memory
);
9076 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9078 /* GDB allows dereferencing an int. */
9079 if (expect_type
== NULL
)
9080 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9085 to_static_fixed_type (ada_aligned_type (expect_type
));
9086 return value_zero (expect_type
, lval_memory
);
9090 error (_("Attempt to take contents of a non-pointer value."));
9092 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9093 type
= ada_check_typedef (value_type (arg1
));
9095 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9096 /* GDB allows dereferencing an int. If we were given
9097 the expect_type, then use that as the target type.
9098 Otherwise, assume that the target type is an int. */
9100 if (expect_type
!= NULL
)
9101 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9104 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9105 (CORE_ADDR
) value_as_address (arg1
));
9108 if (ada_is_array_descriptor_type (type
))
9109 /* GDB allows dereferencing GNAT array descriptors. */
9110 return ada_coerce_to_simple_array (arg1
);
9112 return ada_value_ind (arg1
);
9114 case STRUCTOP_STRUCT
:
9115 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9116 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9117 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9118 if (noside
== EVAL_SKIP
)
9120 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9122 struct type
*type1
= value_type (arg1
);
9123 if (ada_is_tagged_type (type1
, 1))
9125 type
= ada_lookup_struct_elt_type (type1
,
9126 &exp
->elts
[pc
+ 2].string
,
9129 /* In this case, we assume that the field COULD exist
9130 in some extension of the type. Return an object of
9131 "type" void, which will match any formal
9132 (see ada_type_match). */
9133 return value_zero (builtin_type_void
, lval_memory
);
9137 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9140 return value_zero (ada_aligned_type (type
), lval_memory
);
9144 ada_to_fixed_value (unwrap_value
9145 (ada_value_struct_elt
9146 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9148 /* The value is not supposed to be used. This is here to make it
9149 easier to accommodate expressions that contain types. */
9151 if (noside
== EVAL_SKIP
)
9153 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9154 return allocate_value (exp
->elts
[pc
+ 1].type
);
9156 error (_("Attempt to use a type name as an expression"));
9161 case OP_DISCRETE_RANGE
:
9164 if (noside
== EVAL_NORMAL
)
9168 error (_("Undefined name, ambiguous name, or renaming used in "
9169 "component association: %s."), &exp
->elts
[pc
+2].string
);
9171 error (_("Aggregates only allowed on the right of an assignment"));
9173 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9176 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9178 for (tem
= 0; tem
< nargs
; tem
+= 1)
9179 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9184 return value_from_longest (builtin_type_int8
, (LONGEST
) 1);
9190 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9191 type name that encodes the 'small and 'delta information.
9192 Otherwise, return NULL. */
9195 fixed_type_info (struct type
*type
)
9197 const char *name
= ada_type_name (type
);
9198 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9200 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9202 const char *tail
= strstr (name
, "___XF_");
9208 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9209 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9214 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9217 ada_is_fixed_point_type (struct type
*type
)
9219 return fixed_type_info (type
) != NULL
;
9222 /* Return non-zero iff TYPE represents a System.Address type. */
9225 ada_is_system_address_type (struct type
*type
)
9227 return (TYPE_NAME (type
)
9228 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9231 /* Assuming that TYPE is the representation of an Ada fixed-point
9232 type, return its delta, or -1 if the type is malformed and the
9233 delta cannot be determined. */
9236 ada_delta (struct type
*type
)
9238 const char *encoding
= fixed_type_info (type
);
9241 /* Strictly speaking, num and den are encoded as integer. However,
9242 they may not fit into a long, and they will have to be converted
9243 to DOUBLEST anyway. So scan them as DOUBLEST. */
9244 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9251 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9252 factor ('SMALL value) associated with the type. */
9255 scaling_factor (struct type
*type
)
9257 const char *encoding
= fixed_type_info (type
);
9258 DOUBLEST num0
, den0
, num1
, den1
;
9261 /* Strictly speaking, num's and den's are encoded as integer. However,
9262 they may not fit into a long, and they will have to be converted
9263 to DOUBLEST anyway. So scan them as DOUBLEST. */
9264 n
= sscanf (encoding
,
9265 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9266 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9267 &num0
, &den0
, &num1
, &den1
);
9278 /* Assuming that X is the representation of a value of fixed-point
9279 type TYPE, return its floating-point equivalent. */
9282 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9284 return (DOUBLEST
) x
*scaling_factor (type
);
9287 /* The representation of a fixed-point value of type TYPE
9288 corresponding to the value X. */
9291 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9293 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9297 /* VAX floating formats */
9299 /* Non-zero iff TYPE represents one of the special VAX floating-point
9303 ada_is_vax_floating_type (struct type
*type
)
9306 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9309 && (TYPE_CODE (type
) == TYPE_CODE_INT
9310 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9311 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9314 /* The type of special VAX floating-point type this is, assuming
9315 ada_is_vax_floating_point. */
9318 ada_vax_float_type_suffix (struct type
*type
)
9320 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9323 /* A value representing the special debugging function that outputs
9324 VAX floating-point values of the type represented by TYPE. Assumes
9325 ada_is_vax_floating_type (TYPE). */
9328 ada_vax_float_print_function (struct type
*type
)
9330 switch (ada_vax_float_type_suffix (type
))
9333 return get_var_value ("DEBUG_STRING_F", 0);
9335 return get_var_value ("DEBUG_STRING_D", 0);
9337 return get_var_value ("DEBUG_STRING_G", 0);
9339 error (_("invalid VAX floating-point type"));
9346 /* Scan STR beginning at position K for a discriminant name, and
9347 return the value of that discriminant field of DVAL in *PX. If
9348 PNEW_K is not null, put the position of the character beyond the
9349 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9350 not alter *PX and *PNEW_K if unsuccessful. */
9353 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9356 static char *bound_buffer
= NULL
;
9357 static size_t bound_buffer_len
= 0;
9360 struct value
*bound_val
;
9362 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9365 pend
= strstr (str
+ k
, "__");
9369 k
+= strlen (bound
);
9373 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9374 bound
= bound_buffer
;
9375 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9376 bound
[pend
- (str
+ k
)] = '\0';
9380 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9381 if (bound_val
== NULL
)
9384 *px
= value_as_long (bound_val
);
9390 /* Value of variable named NAME in the current environment. If
9391 no such variable found, then if ERR_MSG is null, returns 0, and
9392 otherwise causes an error with message ERR_MSG. */
9394 static struct value
*
9395 get_var_value (char *name
, char *err_msg
)
9397 struct ada_symbol_info
*syms
;
9400 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9405 if (err_msg
== NULL
)
9408 error (("%s"), err_msg
);
9411 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9414 /* Value of integer variable named NAME in the current environment. If
9415 no such variable found, returns 0, and sets *FLAG to 0. If
9416 successful, sets *FLAG to 1. */
9419 get_int_var_value (char *name
, int *flag
)
9421 struct value
*var_val
= get_var_value (name
, 0);
9433 return value_as_long (var_val
);
9438 /* Return a range type whose base type is that of the range type named
9439 NAME in the current environment, and whose bounds are calculated
9440 from NAME according to the GNAT range encoding conventions.
9441 Extract discriminant values, if needed, from DVAL. If a new type
9442 must be created, allocate in OBJFILE's space. The bounds
9443 information, in general, is encoded in NAME, the base type given in
9444 the named range type. */
9446 static struct type
*
9447 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9449 struct type
*raw_type
= ada_find_any_type (name
);
9450 struct type
*base_type
;
9453 if (raw_type
== NULL
)
9454 base_type
= builtin_type_int32
;
9455 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9456 base_type
= TYPE_TARGET_TYPE (raw_type
);
9458 base_type
= raw_type
;
9460 subtype_info
= strstr (name
, "___XD");
9461 if (subtype_info
== NULL
)
9463 LONGEST L
= discrete_type_low_bound (raw_type
);
9464 LONGEST U
= discrete_type_high_bound (raw_type
);
9465 if (L
< INT_MIN
|| U
> INT_MAX
)
9468 return create_range_type (alloc_type (objfile
), raw_type
,
9469 discrete_type_low_bound (raw_type
),
9470 discrete_type_high_bound (raw_type
));
9474 static char *name_buf
= NULL
;
9475 static size_t name_len
= 0;
9476 int prefix_len
= subtype_info
- name
;
9482 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9483 strncpy (name_buf
, name
, prefix_len
);
9484 name_buf
[prefix_len
] = '\0';
9487 bounds_str
= strchr (subtype_info
, '_');
9490 if (*subtype_info
== 'L')
9492 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9493 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9495 if (bounds_str
[n
] == '_')
9497 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9504 strcpy (name_buf
+ prefix_len
, "___L");
9505 L
= get_int_var_value (name_buf
, &ok
);
9508 lim_warning (_("Unknown lower bound, using 1."));
9513 if (*subtype_info
== 'U')
9515 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9516 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9522 strcpy (name_buf
+ prefix_len
, "___U");
9523 U
= get_int_var_value (name_buf
, &ok
);
9526 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9531 if (objfile
== NULL
)
9532 objfile
= TYPE_OBJFILE (base_type
);
9533 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9534 TYPE_NAME (type
) = name
;
9539 /* True iff NAME is the name of a range type. */
9542 ada_is_range_type_name (const char *name
)
9544 return (name
!= NULL
&& strstr (name
, "___XD"));
9550 /* True iff TYPE is an Ada modular type. */
9553 ada_is_modular_type (struct type
*type
)
9555 struct type
*subranged_type
= base_type (type
);
9557 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9558 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9559 && TYPE_UNSIGNED (subranged_type
));
9562 /* Try to determine the lower and upper bounds of the given modular type
9563 using the type name only. Return non-zero and set L and U as the lower
9564 and upper bounds (respectively) if successful. */
9567 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9569 char *name
= ada_type_name (type
);
9577 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9578 we are looking for static bounds, which means an __XDLU suffix.
9579 Moreover, we know that the lower bound of modular types is always
9580 zero, so the actual suffix should start with "__XDLU_0__", and
9581 then be followed by the upper bound value. */
9582 suffix
= strstr (name
, "__XDLU_0__");
9586 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9589 *modulus
= (ULONGEST
) U
+ 1;
9593 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9596 ada_modulus (struct type
*type
)
9600 /* Normally, the modulus of a modular type is equal to the value of
9601 its upper bound + 1. However, the upper bound is currently stored
9602 as an int, which is not always big enough to hold the actual bound
9603 value. To workaround this, try to take advantage of the encoding
9604 that GNAT uses with with discrete types. To avoid some unnecessary
9605 parsing, we do this only when the size of TYPE is greater than
9606 the size of the field holding the bound. */
9607 if (TYPE_LENGTH (type
) > sizeof (TYPE_HIGH_BOUND (type
))
9608 && ada_modulus_from_name (type
, &modulus
))
9611 return (ULONGEST
) (unsigned int) TYPE_HIGH_BOUND (type
) + 1;
9615 /* Ada exception catchpoint support:
9616 ---------------------------------
9618 We support 3 kinds of exception catchpoints:
9619 . catchpoints on Ada exceptions
9620 . catchpoints on unhandled Ada exceptions
9621 . catchpoints on failed assertions
9623 Exceptions raised during failed assertions, or unhandled exceptions
9624 could perfectly be caught with the general catchpoint on Ada exceptions.
9625 However, we can easily differentiate these two special cases, and having
9626 the option to distinguish these two cases from the rest can be useful
9627 to zero-in on certain situations.
9629 Exception catchpoints are a specialized form of breakpoint,
9630 since they rely on inserting breakpoints inside known routines
9631 of the GNAT runtime. The implementation therefore uses a standard
9632 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9635 Support in the runtime for exception catchpoints have been changed
9636 a few times already, and these changes affect the implementation
9637 of these catchpoints. In order to be able to support several
9638 variants of the runtime, we use a sniffer that will determine
9639 the runtime variant used by the program being debugged.
9641 At this time, we do not support the use of conditions on Ada exception
9642 catchpoints. The COND and COND_STRING fields are therefore set
9643 to NULL (most of the time, see below).
9645 Conditions where EXP_STRING, COND, and COND_STRING are used:
9647 When a user specifies the name of a specific exception in the case
9648 of catchpoints on Ada exceptions, we store the name of that exception
9649 in the EXP_STRING. We then translate this request into an actual
9650 condition stored in COND_STRING, and then parse it into an expression
9653 /* The different types of catchpoints that we introduced for catching
9656 enum exception_catchpoint_kind
9659 ex_catch_exception_unhandled
,
9663 /* Ada's standard exceptions. */
9665 static char *standard_exc
[] = {
9672 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9674 /* A structure that describes how to support exception catchpoints
9675 for a given executable. */
9677 struct exception_support_info
9679 /* The name of the symbol to break on in order to insert
9680 a catchpoint on exceptions. */
9681 const char *catch_exception_sym
;
9683 /* The name of the symbol to break on in order to insert
9684 a catchpoint on unhandled exceptions. */
9685 const char *catch_exception_unhandled_sym
;
9687 /* The name of the symbol to break on in order to insert
9688 a catchpoint on failed assertions. */
9689 const char *catch_assert_sym
;
9691 /* Assuming that the inferior just triggered an unhandled exception
9692 catchpoint, this function is responsible for returning the address
9693 in inferior memory where the name of that exception is stored.
9694 Return zero if the address could not be computed. */
9695 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9698 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9699 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9701 /* The following exception support info structure describes how to
9702 implement exception catchpoints with the latest version of the
9703 Ada runtime (as of 2007-03-06). */
9705 static const struct exception_support_info default_exception_support_info
=
9707 "__gnat_debug_raise_exception", /* catch_exception_sym */
9708 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9709 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9710 ada_unhandled_exception_name_addr
9713 /* The following exception support info structure describes how to
9714 implement exception catchpoints with a slightly older version
9715 of the Ada runtime. */
9717 static const struct exception_support_info exception_support_info_fallback
=
9719 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9720 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9721 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9722 ada_unhandled_exception_name_addr_from_raise
9725 /* For each executable, we sniff which exception info structure to use
9726 and cache it in the following global variable. */
9728 static const struct exception_support_info
*exception_info
= NULL
;
9730 /* Inspect the Ada runtime and determine which exception info structure
9731 should be used to provide support for exception catchpoints.
9733 This function will always set exception_info, or raise an error. */
9736 ada_exception_support_info_sniffer (void)
9740 /* If the exception info is already known, then no need to recompute it. */
9741 if (exception_info
!= NULL
)
9744 /* Check the latest (default) exception support info. */
9745 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9749 exception_info
= &default_exception_support_info
;
9753 /* Try our fallback exception suport info. */
9754 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9758 exception_info
= &exception_support_info_fallback
;
9762 /* Sometimes, it is normal for us to not be able to find the routine
9763 we are looking for. This happens when the program is linked with
9764 the shared version of the GNAT runtime, and the program has not been
9765 started yet. Inform the user of these two possible causes if
9768 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9769 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9771 /* If the symbol does not exist, then check that the program is
9772 already started, to make sure that shared libraries have been
9773 loaded. If it is not started, this may mean that the symbol is
9774 in a shared library. */
9776 if (ptid_get_pid (inferior_ptid
) == 0)
9777 error (_("Unable to insert catchpoint. Try to start the program first."));
9779 /* At this point, we know that we are debugging an Ada program and
9780 that the inferior has been started, but we still are not able to
9781 find the run-time symbols. That can mean that we are in
9782 configurable run time mode, or that a-except as been optimized
9783 out by the linker... In any case, at this point it is not worth
9784 supporting this feature. */
9786 error (_("Cannot insert catchpoints in this configuration."));
9789 /* An observer of "executable_changed" events.
9790 Its role is to clear certain cached values that need to be recomputed
9791 each time a new executable is loaded by GDB. */
9794 ada_executable_changed_observer (void)
9796 /* If the executable changed, then it is possible that the Ada runtime
9797 is different. So we need to invalidate the exception support info
9799 exception_info
= NULL
;
9802 /* Return the name of the function at PC, NULL if could not find it.
9803 This function only checks the debugging information, not the symbol
9807 function_name_from_pc (CORE_ADDR pc
)
9811 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9817 /* True iff FRAME is very likely to be that of a function that is
9818 part of the runtime system. This is all very heuristic, but is
9819 intended to be used as advice as to what frames are uninteresting
9823 is_known_support_routine (struct frame_info
*frame
)
9825 struct symtab_and_line sal
;
9829 /* If this code does not have any debugging information (no symtab),
9830 This cannot be any user code. */
9832 find_frame_sal (frame
, &sal
);
9833 if (sal
.symtab
== NULL
)
9836 /* If there is a symtab, but the associated source file cannot be
9837 located, then assume this is not user code: Selecting a frame
9838 for which we cannot display the code would not be very helpful
9839 for the user. This should also take care of case such as VxWorks
9840 where the kernel has some debugging info provided for a few units. */
9842 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9845 /* Check the unit filename againt the Ada runtime file naming.
9846 We also check the name of the objfile against the name of some
9847 known system libraries that sometimes come with debugging info
9850 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9852 re_comp (known_runtime_file_name_patterns
[i
]);
9853 if (re_exec (sal
.symtab
->filename
))
9855 if (sal
.symtab
->objfile
!= NULL
9856 && re_exec (sal
.symtab
->objfile
->name
))
9860 /* Check whether the function is a GNAT-generated entity. */
9862 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9863 if (func_name
== NULL
)
9866 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9868 re_comp (known_auxiliary_function_name_patterns
[i
]);
9869 if (re_exec (func_name
))
9876 /* Find the first frame that contains debugging information and that is not
9877 part of the Ada run-time, starting from FI and moving upward. */
9880 ada_find_printable_frame (struct frame_info
*fi
)
9882 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9884 if (!is_known_support_routine (fi
))
9893 /* Assuming that the inferior just triggered an unhandled exception
9894 catchpoint, return the address in inferior memory where the name
9895 of the exception is stored.
9897 Return zero if the address could not be computed. */
9900 ada_unhandled_exception_name_addr (void)
9902 return parse_and_eval_address ("e.full_name");
9905 /* Same as ada_unhandled_exception_name_addr, except that this function
9906 should be used when the inferior uses an older version of the runtime,
9907 where the exception name needs to be extracted from a specific frame
9908 several frames up in the callstack. */
9911 ada_unhandled_exception_name_addr_from_raise (void)
9914 struct frame_info
*fi
;
9916 /* To determine the name of this exception, we need to select
9917 the frame corresponding to RAISE_SYM_NAME. This frame is
9918 at least 3 levels up, so we simply skip the first 3 frames
9919 without checking the name of their associated function. */
9920 fi
= get_current_frame ();
9921 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9923 fi
= get_prev_frame (fi
);
9927 const char *func_name
=
9928 function_name_from_pc (get_frame_address_in_block (fi
));
9929 if (func_name
!= NULL
9930 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9931 break; /* We found the frame we were looking for... */
9932 fi
= get_prev_frame (fi
);
9939 return parse_and_eval_address ("id.full_name");
9942 /* Assuming the inferior just triggered an Ada exception catchpoint
9943 (of any type), return the address in inferior memory where the name
9944 of the exception is stored, if applicable.
9946 Return zero if the address could not be computed, or if not relevant. */
9949 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9950 struct breakpoint
*b
)
9954 case ex_catch_exception
:
9955 return (parse_and_eval_address ("e.full_name"));
9958 case ex_catch_exception_unhandled
:
9959 return exception_info
->unhandled_exception_name_addr ();
9962 case ex_catch_assert
:
9963 return 0; /* Exception name is not relevant in this case. */
9967 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9971 return 0; /* Should never be reached. */
9974 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9975 any error that ada_exception_name_addr_1 might cause to be thrown.
9976 When an error is intercepted, a warning with the error message is printed,
9977 and zero is returned. */
9980 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9981 struct breakpoint
*b
)
9983 struct gdb_exception e
;
9984 CORE_ADDR result
= 0;
9986 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9988 result
= ada_exception_name_addr_1 (ex
, b
);
9993 warning (_("failed to get exception name: %s"), e
.message
);
10000 /* Implement the PRINT_IT method in the breakpoint_ops structure
10001 for all exception catchpoint kinds. */
10003 static enum print_stop_action
10004 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10006 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10007 char exception_name
[256];
10011 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10012 exception_name
[sizeof (exception_name
) - 1] = '\0';
10015 ada_find_printable_frame (get_current_frame ());
10017 annotate_catchpoint (b
->number
);
10020 case ex_catch_exception
:
10022 printf_filtered (_("\nCatchpoint %d, %s at "),
10023 b
->number
, exception_name
);
10025 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10027 case ex_catch_exception_unhandled
:
10029 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10030 b
->number
, exception_name
);
10032 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10035 case ex_catch_assert
:
10036 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10041 return PRINT_SRC_AND_LOC
;
10044 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10045 for all exception catchpoint kinds. */
10048 print_one_exception (enum exception_catchpoint_kind ex
,
10049 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10051 struct value_print_options opts
;
10053 get_user_print_options (&opts
);
10054 if (opts
.addressprint
)
10056 annotate_field (4);
10057 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10060 annotate_field (5);
10061 *last_addr
= b
->loc
->address
;
10064 case ex_catch_exception
:
10065 if (b
->exp_string
!= NULL
)
10067 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10069 ui_out_field_string (uiout
, "what", msg
);
10073 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10077 case ex_catch_exception_unhandled
:
10078 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10081 case ex_catch_assert
:
10082 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10086 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10091 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10092 for all exception catchpoint kinds. */
10095 print_mention_exception (enum exception_catchpoint_kind ex
,
10096 struct breakpoint
*b
)
10100 case ex_catch_exception
:
10101 if (b
->exp_string
!= NULL
)
10102 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10103 b
->number
, b
->exp_string
);
10105 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10109 case ex_catch_exception_unhandled
:
10110 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10114 case ex_catch_assert
:
10115 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10119 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10124 /* Virtual table for "catch exception" breakpoints. */
10126 static enum print_stop_action
10127 print_it_catch_exception (struct breakpoint
*b
)
10129 return print_it_exception (ex_catch_exception
, b
);
10133 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10135 print_one_exception (ex_catch_exception
, b
, last_addr
);
10139 print_mention_catch_exception (struct breakpoint
*b
)
10141 print_mention_exception (ex_catch_exception
, b
);
10144 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10148 NULL
, /* breakpoint_hit */
10149 print_it_catch_exception
,
10150 print_one_catch_exception
,
10151 print_mention_catch_exception
10154 /* Virtual table for "catch exception unhandled" breakpoints. */
10156 static enum print_stop_action
10157 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10159 return print_it_exception (ex_catch_exception_unhandled
, b
);
10163 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10165 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10169 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10171 print_mention_exception (ex_catch_exception_unhandled
, b
);
10174 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10177 NULL
, /* breakpoint_hit */
10178 print_it_catch_exception_unhandled
,
10179 print_one_catch_exception_unhandled
,
10180 print_mention_catch_exception_unhandled
10183 /* Virtual table for "catch assert" breakpoints. */
10185 static enum print_stop_action
10186 print_it_catch_assert (struct breakpoint
*b
)
10188 return print_it_exception (ex_catch_assert
, b
);
10192 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10194 print_one_exception (ex_catch_assert
, b
, last_addr
);
10198 print_mention_catch_assert (struct breakpoint
*b
)
10200 print_mention_exception (ex_catch_assert
, b
);
10203 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10206 NULL
, /* breakpoint_hit */
10207 print_it_catch_assert
,
10208 print_one_catch_assert
,
10209 print_mention_catch_assert
10212 /* Return non-zero if B is an Ada exception catchpoint. */
10215 ada_exception_catchpoint_p (struct breakpoint
*b
)
10217 return (b
->ops
== &catch_exception_breakpoint_ops
10218 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10219 || b
->ops
== &catch_assert_breakpoint_ops
);
10222 /* Return a newly allocated copy of the first space-separated token
10223 in ARGSP, and then adjust ARGSP to point immediately after that
10226 Return NULL if ARGPS does not contain any more tokens. */
10229 ada_get_next_arg (char **argsp
)
10231 char *args
= *argsp
;
10235 /* Skip any leading white space. */
10237 while (isspace (*args
))
10240 if (args
[0] == '\0')
10241 return NULL
; /* No more arguments. */
10243 /* Find the end of the current argument. */
10246 while (*end
!= '\0' && !isspace (*end
))
10249 /* Adjust ARGSP to point to the start of the next argument. */
10253 /* Make a copy of the current argument and return it. */
10255 result
= xmalloc (end
- args
+ 1);
10256 strncpy (result
, args
, end
- args
);
10257 result
[end
- args
] = '\0';
10262 /* Split the arguments specified in a "catch exception" command.
10263 Set EX to the appropriate catchpoint type.
10264 Set EXP_STRING to the name of the specific exception if
10265 specified by the user. */
10268 catch_ada_exception_command_split (char *args
,
10269 enum exception_catchpoint_kind
*ex
,
10272 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10273 char *exception_name
;
10275 exception_name
= ada_get_next_arg (&args
);
10276 make_cleanup (xfree
, exception_name
);
10278 /* Check that we do not have any more arguments. Anything else
10281 while (isspace (*args
))
10284 if (args
[0] != '\0')
10285 error (_("Junk at end of expression"));
10287 discard_cleanups (old_chain
);
10289 if (exception_name
== NULL
)
10291 /* Catch all exceptions. */
10292 *ex
= ex_catch_exception
;
10293 *exp_string
= NULL
;
10295 else if (strcmp (exception_name
, "unhandled") == 0)
10297 /* Catch unhandled exceptions. */
10298 *ex
= ex_catch_exception_unhandled
;
10299 *exp_string
= NULL
;
10303 /* Catch a specific exception. */
10304 *ex
= ex_catch_exception
;
10305 *exp_string
= exception_name
;
10309 /* Return the name of the symbol on which we should break in order to
10310 implement a catchpoint of the EX kind. */
10312 static const char *
10313 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10315 gdb_assert (exception_info
!= NULL
);
10319 case ex_catch_exception
:
10320 return (exception_info
->catch_exception_sym
);
10322 case ex_catch_exception_unhandled
:
10323 return (exception_info
->catch_exception_unhandled_sym
);
10325 case ex_catch_assert
:
10326 return (exception_info
->catch_assert_sym
);
10329 internal_error (__FILE__
, __LINE__
,
10330 _("unexpected catchpoint kind (%d)"), ex
);
10334 /* Return the breakpoint ops "virtual table" used for catchpoints
10337 static struct breakpoint_ops
*
10338 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10342 case ex_catch_exception
:
10343 return (&catch_exception_breakpoint_ops
);
10345 case ex_catch_exception_unhandled
:
10346 return (&catch_exception_unhandled_breakpoint_ops
);
10348 case ex_catch_assert
:
10349 return (&catch_assert_breakpoint_ops
);
10352 internal_error (__FILE__
, __LINE__
,
10353 _("unexpected catchpoint kind (%d)"), ex
);
10357 /* Return the condition that will be used to match the current exception
10358 being raised with the exception that the user wants to catch. This
10359 assumes that this condition is used when the inferior just triggered
10360 an exception catchpoint.
10362 The string returned is a newly allocated string that needs to be
10363 deallocated later. */
10366 ada_exception_catchpoint_cond_string (const char *exp_string
)
10370 /* The standard exceptions are a special case. They are defined in
10371 runtime units that have been compiled without debugging info; if
10372 EXP_STRING is the not-fully-qualified name of a standard
10373 exception (e.g. "constraint_error") then, during the evaluation
10374 of the condition expression, the symbol lookup on this name would
10375 *not* return this standard exception. The catchpoint condition
10376 may then be set only on user-defined exceptions which have the
10377 same not-fully-qualified name (e.g. my_package.constraint_error).
10379 To avoid this unexcepted behavior, these standard exceptions are
10380 systematically prefixed by "standard". This means that "catch
10381 exception constraint_error" is rewritten into "catch exception
10382 standard.constraint_error".
10384 If an exception named contraint_error is defined in another package of
10385 the inferior program, then the only way to specify this exception as a
10386 breakpoint condition is to use its fully-qualified named:
10387 e.g. my_package.constraint_error. */
10389 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10391 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10393 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10397 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10400 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10402 static struct expression
*
10403 ada_parse_catchpoint_condition (char *cond_string
,
10404 struct symtab_and_line sal
)
10406 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10409 /* Return the symtab_and_line that should be used to insert an exception
10410 catchpoint of the TYPE kind.
10412 EX_STRING should contain the name of a specific exception
10413 that the catchpoint should catch, or NULL otherwise.
10415 The idea behind all the remaining parameters is that their names match
10416 the name of certain fields in the breakpoint structure that are used to
10417 handle exception catchpoints. This function returns the value to which
10418 these fields should be set, depending on the type of catchpoint we need
10421 If COND and COND_STRING are both non-NULL, any value they might
10422 hold will be free'ed, and then replaced by newly allocated ones.
10423 These parameters are left untouched otherwise. */
10425 static struct symtab_and_line
10426 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10427 char **addr_string
, char **cond_string
,
10428 struct expression
**cond
, struct breakpoint_ops
**ops
)
10430 const char *sym_name
;
10431 struct symbol
*sym
;
10432 struct symtab_and_line sal
;
10434 /* First, find out which exception support info to use. */
10435 ada_exception_support_info_sniffer ();
10437 /* Then lookup the function on which we will break in order to catch
10438 the Ada exceptions requested by the user. */
10440 sym_name
= ada_exception_sym_name (ex
);
10441 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10443 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10444 that should be compiled with debugging information. As a result, we
10445 expect to find that symbol in the symtabs. If we don't find it, then
10446 the target most likely does not support Ada exceptions, or we cannot
10447 insert exception breakpoints yet, because the GNAT runtime hasn't been
10450 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10451 in such a way that no debugging information is produced for the symbol
10452 we are looking for. In this case, we could search the minimal symbols
10453 as a fall-back mechanism. This would still be operating in degraded
10454 mode, however, as we would still be missing the debugging information
10455 that is needed in order to extract the name of the exception being
10456 raised (this name is printed in the catchpoint message, and is also
10457 used when trying to catch a specific exception). We do not handle
10458 this case for now. */
10461 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10463 /* Make sure that the symbol we found corresponds to a function. */
10464 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10465 error (_("Symbol \"%s\" is not a function (class = %d)"),
10466 sym_name
, SYMBOL_CLASS (sym
));
10468 sal
= find_function_start_sal (sym
, 1);
10470 /* Set ADDR_STRING. */
10472 *addr_string
= xstrdup (sym_name
);
10474 /* Set the COND and COND_STRING (if not NULL). */
10476 if (cond_string
!= NULL
&& cond
!= NULL
)
10478 if (*cond_string
!= NULL
)
10480 xfree (*cond_string
);
10481 *cond_string
= NULL
;
10488 if (exp_string
!= NULL
)
10490 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10491 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10496 *ops
= ada_exception_breakpoint_ops (ex
);
10501 /* Parse the arguments (ARGS) of the "catch exception" command.
10503 Set TYPE to the appropriate exception catchpoint type.
10504 If the user asked the catchpoint to catch only a specific
10505 exception, then save the exception name in ADDR_STRING.
10507 See ada_exception_sal for a description of all the remaining
10508 function arguments of this function. */
10510 struct symtab_and_line
10511 ada_decode_exception_location (char *args
, char **addr_string
,
10512 char **exp_string
, char **cond_string
,
10513 struct expression
**cond
,
10514 struct breakpoint_ops
**ops
)
10516 enum exception_catchpoint_kind ex
;
10518 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10519 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10523 struct symtab_and_line
10524 ada_decode_assert_location (char *args
, char **addr_string
,
10525 struct breakpoint_ops
**ops
)
10527 /* Check that no argument where provided at the end of the command. */
10531 while (isspace (*args
))
10534 error (_("Junk at end of arguments."));
10537 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10542 /* Information about operators given special treatment in functions
10544 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10546 #define ADA_OPERATORS \
10547 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10548 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10549 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10550 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10551 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10552 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10553 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10554 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10555 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10556 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10557 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10558 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10559 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10560 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10561 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10562 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10563 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10564 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10565 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10568 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10570 switch (exp
->elts
[pc
- 1].opcode
)
10573 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10576 #define OP_DEFN(op, len, args, binop) \
10577 case op: *oplenp = len; *argsp = args; break;
10583 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10588 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10594 ada_op_name (enum exp_opcode opcode
)
10599 return op_name_standard (opcode
);
10601 #define OP_DEFN(op, len, args, binop) case op: return #op;
10606 return "OP_AGGREGATE";
10608 return "OP_CHOICES";
10614 /* As for operator_length, but assumes PC is pointing at the first
10615 element of the operator, and gives meaningful results only for the
10616 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10619 ada_forward_operator_length (struct expression
*exp
, int pc
,
10620 int *oplenp
, int *argsp
)
10622 switch (exp
->elts
[pc
].opcode
)
10625 *oplenp
= *argsp
= 0;
10628 #define OP_DEFN(op, len, args, binop) \
10629 case op: *oplenp = len; *argsp = args; break;
10635 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10640 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10646 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10647 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10655 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10657 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10662 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10666 /* Ada attributes ('Foo). */
10669 case OP_ATR_LENGTH
:
10673 case OP_ATR_MODULUS
:
10680 case UNOP_IN_RANGE
:
10682 /* XXX: gdb_sprint_host_address, type_sprint */
10683 fprintf_filtered (stream
, _("Type @"));
10684 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10685 fprintf_filtered (stream
, " (");
10686 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10687 fprintf_filtered (stream
, ")");
10689 case BINOP_IN_BOUNDS
:
10690 fprintf_filtered (stream
, " (%d)",
10691 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10693 case TERNOP_IN_RANGE
:
10698 case OP_DISCRETE_RANGE
:
10699 case OP_POSITIONAL
:
10706 char *name
= &exp
->elts
[elt
+ 2].string
;
10707 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10708 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10713 return dump_subexp_body_standard (exp
, stream
, elt
);
10717 for (i
= 0; i
< nargs
; i
+= 1)
10718 elt
= dump_subexp (exp
, stream
, elt
);
10723 /* The Ada extension of print_subexp (q.v.). */
10726 ada_print_subexp (struct expression
*exp
, int *pos
,
10727 struct ui_file
*stream
, enum precedence prec
)
10729 int oplen
, nargs
, i
;
10731 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10733 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10740 print_subexp_standard (exp
, pos
, stream
, prec
);
10744 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10747 case BINOP_IN_BOUNDS
:
10748 /* XXX: sprint_subexp */
10749 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10750 fputs_filtered (" in ", stream
);
10751 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10752 fputs_filtered ("'range", stream
);
10753 if (exp
->elts
[pc
+ 1].longconst
> 1)
10754 fprintf_filtered (stream
, "(%ld)",
10755 (long) exp
->elts
[pc
+ 1].longconst
);
10758 case TERNOP_IN_RANGE
:
10759 if (prec
>= PREC_EQUAL
)
10760 fputs_filtered ("(", stream
);
10761 /* XXX: sprint_subexp */
10762 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10763 fputs_filtered (" in ", stream
);
10764 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10765 fputs_filtered (" .. ", stream
);
10766 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10767 if (prec
>= PREC_EQUAL
)
10768 fputs_filtered (")", stream
);
10773 case OP_ATR_LENGTH
:
10777 case OP_ATR_MODULUS
:
10782 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10784 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10785 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10789 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10790 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10794 for (tem
= 1; tem
< nargs
; tem
+= 1)
10796 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10797 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10799 fputs_filtered (")", stream
);
10804 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10805 fputs_filtered ("'(", stream
);
10806 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10807 fputs_filtered (")", stream
);
10810 case UNOP_IN_RANGE
:
10811 /* XXX: sprint_subexp */
10812 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10813 fputs_filtered (" in ", stream
);
10814 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10817 case OP_DISCRETE_RANGE
:
10818 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10819 fputs_filtered ("..", stream
);
10820 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10824 fputs_filtered ("others => ", stream
);
10825 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10829 for (i
= 0; i
< nargs
-1; i
+= 1)
10832 fputs_filtered ("|", stream
);
10833 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10835 fputs_filtered (" => ", stream
);
10836 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10839 case OP_POSITIONAL
:
10840 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10844 fputs_filtered ("(", stream
);
10845 for (i
= 0; i
< nargs
; i
+= 1)
10848 fputs_filtered (", ", stream
);
10849 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10851 fputs_filtered (")", stream
);
10856 /* Table mapping opcodes into strings for printing operators
10857 and precedences of the operators. */
10859 static const struct op_print ada_op_print_tab
[] = {
10860 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10861 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10862 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10863 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10864 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10865 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10866 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10867 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10868 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10869 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10870 {">", BINOP_GTR
, PREC_ORDER
, 0},
10871 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10872 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10873 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10874 {"+", BINOP_ADD
, PREC_ADD
, 0},
10875 {"-", BINOP_SUB
, PREC_ADD
, 0},
10876 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10877 {"*", BINOP_MUL
, PREC_MUL
, 0},
10878 {"/", BINOP_DIV
, PREC_MUL
, 0},
10879 {"rem", BINOP_REM
, PREC_MUL
, 0},
10880 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10881 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10882 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10883 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10884 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10885 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10886 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10887 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10888 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10889 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10890 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10894 enum ada_primitive_types
{
10895 ada_primitive_type_int
,
10896 ada_primitive_type_long
,
10897 ada_primitive_type_short
,
10898 ada_primitive_type_char
,
10899 ada_primitive_type_float
,
10900 ada_primitive_type_double
,
10901 ada_primitive_type_void
,
10902 ada_primitive_type_long_long
,
10903 ada_primitive_type_long_double
,
10904 ada_primitive_type_natural
,
10905 ada_primitive_type_positive
,
10906 ada_primitive_type_system_address
,
10907 nr_ada_primitive_types
10911 ada_language_arch_info (struct gdbarch
*gdbarch
,
10912 struct language_arch_info
*lai
)
10914 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10915 lai
->primitive_type_vector
10916 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10918 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10919 init_type (TYPE_CODE_INT
,
10920 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10921 0, "integer", (struct objfile
*) NULL
);
10922 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10923 init_type (TYPE_CODE_INT
,
10924 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10925 0, "long_integer", (struct objfile
*) NULL
);
10926 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10927 init_type (TYPE_CODE_INT
,
10928 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10929 0, "short_integer", (struct objfile
*) NULL
);
10930 lai
->string_char_type
=
10931 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10932 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10933 0, "character", (struct objfile
*) NULL
);
10934 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10935 init_type (TYPE_CODE_FLT
,
10936 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10937 0, "float", (struct objfile
*) NULL
);
10938 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10939 init_type (TYPE_CODE_FLT
,
10940 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10941 0, "long_float", (struct objfile
*) NULL
);
10942 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10943 init_type (TYPE_CODE_INT
,
10944 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10945 0, "long_long_integer", (struct objfile
*) NULL
);
10946 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10947 init_type (TYPE_CODE_FLT
,
10948 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10949 0, "long_long_float", (struct objfile
*) NULL
);
10950 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10951 init_type (TYPE_CODE_INT
,
10952 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10953 0, "natural", (struct objfile
*) NULL
);
10954 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10955 init_type (TYPE_CODE_INT
,
10956 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10957 0, "positive", (struct objfile
*) NULL
);
10958 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10960 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10961 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10962 (struct objfile
*) NULL
));
10963 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10964 = "system__address";
10966 lai
->bool_type_symbol
= NULL
;
10967 lai
->bool_type_default
= builtin
->builtin_bool
;
10970 /* Language vector */
10972 /* Not really used, but needed in the ada_language_defn. */
10975 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
10977 ada_emit_char (c
, type
, stream
, quoter
, 1);
10983 warnings_issued
= 0;
10984 return ada_parse ();
10987 static const struct exp_descriptor ada_exp_descriptor
= {
10989 ada_operator_length
,
10991 ada_dump_subexp_body
,
10992 ada_evaluate_subexp
10995 const struct language_defn ada_language_defn
= {
10996 "ada", /* Language name */
11000 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11001 that's not quite what this means. */
11003 macro_expansion_no
,
11004 &ada_exp_descriptor
,
11008 ada_printchar
, /* Print a character constant */
11009 ada_printstr
, /* Function to print string constant */
11010 emit_char
, /* Function to print single char (not used) */
11011 ada_print_type
, /* Print a type using appropriate syntax */
11012 default_print_typedef
, /* Print a typedef using appropriate syntax */
11013 ada_val_print
, /* Print a value using appropriate syntax */
11014 ada_value_print
, /* Print a top-level value */
11015 NULL
, /* Language specific skip_trampoline */
11016 NULL
, /* name_of_this */
11017 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11018 basic_lookup_transparent_type
, /* lookup_transparent_type */
11019 ada_la_decode
, /* Language specific symbol demangler */
11020 NULL
, /* Language specific class_name_from_physname */
11021 ada_op_print_tab
, /* expression operators for printing */
11022 0, /* c-style arrays */
11023 1, /* String lower bound */
11024 ada_get_gdb_completer_word_break_characters
,
11025 ada_make_symbol_completion_list
,
11026 ada_language_arch_info
,
11027 ada_print_array_index
,
11028 default_pass_by_reference
,
11033 /* Provide a prototype to silence -Wmissing-prototypes. */
11034 extern initialize_file_ftype _initialize_ada_language
;
11037 _initialize_ada_language (void)
11039 add_language (&ada_language_defn
);
11041 varsize_limit
= 65536;
11043 obstack_init (&symbol_list_obstack
);
11045 decoded_names_store
= htab_create_alloc
11046 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11047 NULL
, xcalloc
, xfree
);
11049 observer_attach_executable_changed (ada_executable_changed_observer
);