1 /* Ada language support routines for GDB, the GNU debugger. Copyright (C)
3 1992, 1993, 1994, 1997, 1998, 1999, 2000, 2003, 2004, 2005, 2007, 2008,
4 2009 Free Software Foundation, Inc.
6 This file is part of GDB.
8 This program is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 3 of the License, or
11 (at your option) any later version.
13 This program is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "gdb_string.h"
28 #include "gdb_regex.h"
33 #include "expression.h"
34 #include "parser-defs.h"
40 #include "breakpoint.h"
43 #include "gdb_obstack.h"
45 #include "completer.h"
52 #include "dictionary.h"
53 #include "exceptions.h"
60 /* Define whether or not the C operator '/' truncates towards zero for
61 differently signed operands (truncation direction is undefined in C).
62 Copied from valarith.c. */
64 #ifndef TRUNCATION_TOWARDS_ZERO
65 #define TRUNCATION_TOWARDS_ZERO ((-5 / 2) == -2)
68 static void extract_string (CORE_ADDR addr
, char *buf
);
70 static void modify_general_field (char *, LONGEST
, int, int);
72 static struct type
*desc_base_type (struct type
*);
74 static struct type
*desc_bounds_type (struct type
*);
76 static struct value
*desc_bounds (struct value
*);
78 static int fat_pntr_bounds_bitpos (struct type
*);
80 static int fat_pntr_bounds_bitsize (struct type
*);
82 static struct type
*desc_data_target_type (struct type
*);
84 static struct value
*desc_data (struct value
*);
86 static int fat_pntr_data_bitpos (struct type
*);
88 static int fat_pntr_data_bitsize (struct type
*);
90 static struct value
*desc_one_bound (struct value
*, int, int);
92 static int desc_bound_bitpos (struct type
*, int, int);
94 static int desc_bound_bitsize (struct type
*, int, int);
96 static struct type
*desc_index_type (struct type
*, int);
98 static int desc_arity (struct type
*);
100 static int ada_type_match (struct type
*, struct type
*, int);
102 static int ada_args_match (struct symbol
*, struct value
**, int);
104 static struct value
*ensure_lval (struct value
*, CORE_ADDR
*);
106 static struct value
*convert_actual (struct value
*, struct type
*,
109 static struct value
*make_array_descriptor (struct type
*, struct value
*,
112 static void ada_add_block_symbols (struct obstack
*,
113 struct block
*, const char *,
114 domain_enum
, struct objfile
*, int);
116 static int is_nonfunction (struct ada_symbol_info
*, int);
118 static void add_defn_to_vec (struct obstack
*, struct symbol
*,
121 static int num_defns_collected (struct obstack
*);
123 static struct ada_symbol_info
*defns_collected (struct obstack
*, int);
125 static struct partial_symbol
*ada_lookup_partial_symbol (struct partial_symtab
126 *, const char *, int,
129 static struct value
*resolve_subexp (struct expression
**, int *, int,
132 static void replace_operator_with_call (struct expression
**, int, int, int,
133 struct symbol
*, struct block
*);
135 static int possible_user_operator_p (enum exp_opcode
, struct value
**);
137 static char *ada_op_name (enum exp_opcode
);
139 static const char *ada_decoded_op_name (enum exp_opcode
);
141 static int numeric_type_p (struct type
*);
143 static int integer_type_p (struct type
*);
145 static int scalar_type_p (struct type
*);
147 static int discrete_type_p (struct type
*);
149 static enum ada_renaming_category
parse_old_style_renaming (struct type
*,
154 static struct symbol
*find_old_style_renaming_symbol (const char *,
157 static struct type
*ada_lookup_struct_elt_type (struct type
*, char *,
160 static struct value
*evaluate_subexp (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 struct type
*data_type
= desc_data_target_type (thin_descriptor_type (type
));
1285 data_type
= lookup_pointer_type (data_type
);
1287 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1288 return value_cast (data_type
, value_copy (val
));
1290 return value_from_longest (data_type
,
1291 VALUE_ADDRESS (val
) + value_offset (val
));
1294 /* True iff TYPE indicates a "thick" array pointer type. */
1297 is_thick_pntr (struct type
*type
)
1299 type
= desc_base_type (type
);
1300 return (type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_STRUCT
1301 && lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
);
1304 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1305 pointer to one, the type of its bounds data; otherwise, NULL. */
1307 static struct type
*
1308 desc_bounds_type (struct type
*type
)
1312 type
= desc_base_type (type
);
1316 else if (is_thin_pntr (type
))
1318 type
= thin_descriptor_type (type
);
1321 r
= lookup_struct_elt_type (type
, "BOUNDS", 1);
1323 return ada_check_typedef (r
);
1325 else if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1327 r
= lookup_struct_elt_type (type
, "P_BOUNDS", 1);
1329 return ada_check_typedef (TYPE_TARGET_TYPE (ada_check_typedef (r
)));
1334 /* If ARR is an array descriptor (fat or thin pointer), or pointer to
1335 one, a pointer to its bounds data. Otherwise NULL. */
1337 static struct value
*
1338 desc_bounds (struct value
*arr
)
1340 struct type
*type
= ada_check_typedef (value_type (arr
));
1341 if (is_thin_pntr (type
))
1343 struct type
*bounds_type
=
1344 desc_bounds_type (thin_descriptor_type (type
));
1347 if (bounds_type
== NULL
)
1348 error (_("Bad GNAT array descriptor"));
1350 /* NOTE: The following calculation is not really kosher, but
1351 since desc_type is an XVE-encoded type (and shouldn't be),
1352 the correct calculation is a real pain. FIXME (and fix GCC). */
1353 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
1354 addr
= value_as_long (arr
);
1356 addr
= VALUE_ADDRESS (arr
) + value_offset (arr
);
1359 value_from_longest (lookup_pointer_type (bounds_type
),
1360 addr
- TYPE_LENGTH (bounds_type
));
1363 else if (is_thick_pntr (type
))
1364 return value_struct_elt (&arr
, NULL
, "P_BOUNDS", NULL
,
1365 _("Bad GNAT array descriptor"));
1370 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1371 position of the field containing the address of the bounds data. */
1374 fat_pntr_bounds_bitpos (struct type
*type
)
1376 return TYPE_FIELD_BITPOS (desc_base_type (type
), 1);
1379 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1380 size of the field containing the address of the bounds data. */
1383 fat_pntr_bounds_bitsize (struct type
*type
)
1385 type
= desc_base_type (type
);
1387 if (TYPE_FIELD_BITSIZE (type
, 1) > 0)
1388 return TYPE_FIELD_BITSIZE (type
, 1);
1390 return 8 * TYPE_LENGTH (ada_check_typedef (TYPE_FIELD_TYPE (type
, 1)));
1393 /* If TYPE is the type of an array descriptor (fat or thin pointer) or a
1394 pointer to one, the type of its array data (a array-with-no-bounds type);
1395 otherwise, NULL. Use ada_type_of_array to get an array type with bounds
1398 static struct type
*
1399 desc_data_target_type (struct type
*type
)
1401 type
= desc_base_type (type
);
1403 /* NOTE: The following is bogus; see comment in desc_bounds. */
1404 if (is_thin_pntr (type
))
1405 return desc_base_type (TYPE_FIELD_TYPE (thin_descriptor_type (type
), 1));
1406 else if (is_thick_pntr (type
))
1408 struct type
*data_type
= lookup_struct_elt_type (type
, "P_ARRAY", 1);
1411 && TYPE_CODE (ada_check_typedef (data_type
)) == TYPE_CODE_PTR
)
1412 return TYPE_TARGET_TYPE (data_type
);
1418 /* If ARR is an array descriptor (fat or thin pointer), a pointer to
1421 static struct value
*
1422 desc_data (struct value
*arr
)
1424 struct type
*type
= value_type (arr
);
1425 if (is_thin_pntr (type
))
1426 return thin_data_pntr (arr
);
1427 else if (is_thick_pntr (type
))
1428 return value_struct_elt (&arr
, NULL
, "P_ARRAY", NULL
,
1429 _("Bad GNAT array descriptor"));
1435 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1436 position of the field containing the address of the data. */
1439 fat_pntr_data_bitpos (struct type
*type
)
1441 return TYPE_FIELD_BITPOS (desc_base_type (type
), 0);
1444 /* If TYPE is the type of an array-descriptor (fat pointer), the bit
1445 size of the field containing the address of the data. */
1448 fat_pntr_data_bitsize (struct type
*type
)
1450 type
= desc_base_type (type
);
1452 if (TYPE_FIELD_BITSIZE (type
, 0) > 0)
1453 return TYPE_FIELD_BITSIZE (type
, 0);
1455 return TARGET_CHAR_BIT
* TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 0));
1458 /* If BOUNDS is an array-bounds structure (or pointer to one), return
1459 the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1460 bound, if WHICH is 1. The first bound is I=1. */
1462 static struct value
*
1463 desc_one_bound (struct value
*bounds
, int i
, int which
)
1465 return value_struct_elt (&bounds
, NULL
, bound_name
[2 * i
+ which
- 2], NULL
,
1466 _("Bad GNAT array descriptor bounds"));
1469 /* If BOUNDS is an array-bounds structure type, return the bit position
1470 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1471 bound, if WHICH is 1. The first bound is I=1. */
1474 desc_bound_bitpos (struct type
*type
, int i
, int which
)
1476 return TYPE_FIELD_BITPOS (desc_base_type (type
), 2 * i
+ which
- 2);
1479 /* If BOUNDS is an array-bounds structure type, return the bit field size
1480 of the Ith lower bound stored in it, if WHICH is 0, and the Ith upper
1481 bound, if WHICH is 1. The first bound is I=1. */
1484 desc_bound_bitsize (struct type
*type
, int i
, int which
)
1486 type
= desc_base_type (type
);
1488 if (TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2) > 0)
1489 return TYPE_FIELD_BITSIZE (type
, 2 * i
+ which
- 2);
1491 return 8 * TYPE_LENGTH (TYPE_FIELD_TYPE (type
, 2 * i
+ which
- 2));
1494 /* If TYPE is the type of an array-bounds structure, the type of its
1495 Ith bound (numbering from 1). Otherwise, NULL. */
1497 static struct type
*
1498 desc_index_type (struct type
*type
, int i
)
1500 type
= desc_base_type (type
);
1502 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
1503 return lookup_struct_elt_type (type
, bound_name
[2 * i
- 2], 1);
1508 /* The number of index positions in the array-bounds type TYPE.
1509 Return 0 if TYPE is NULL. */
1512 desc_arity (struct type
*type
)
1514 type
= desc_base_type (type
);
1517 return TYPE_NFIELDS (type
) / 2;
1521 /* Non-zero iff TYPE is a simple array type (not a pointer to one) or
1522 an array descriptor type (representing an unconstrained array
1526 ada_is_direct_array_type (struct type
*type
)
1530 type
= ada_check_typedef (type
);
1531 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1532 || ada_is_array_descriptor_type (type
));
1535 /* Non-zero iff TYPE represents any kind of array in Ada, or a pointer
1539 ada_is_array_type (struct type
*type
)
1542 && (TYPE_CODE (type
) == TYPE_CODE_PTR
1543 || TYPE_CODE (type
) == TYPE_CODE_REF
))
1544 type
= TYPE_TARGET_TYPE (type
);
1545 return ada_is_direct_array_type (type
);
1548 /* Non-zero iff TYPE is a simple array type or pointer to one. */
1551 ada_is_simple_array_type (struct type
*type
)
1555 type
= ada_check_typedef (type
);
1556 return (TYPE_CODE (type
) == TYPE_CODE_ARRAY
1557 || (TYPE_CODE (type
) == TYPE_CODE_PTR
1558 && TYPE_CODE (TYPE_TARGET_TYPE (type
)) == TYPE_CODE_ARRAY
));
1561 /* Non-zero iff TYPE belongs to a GNAT array descriptor. */
1564 ada_is_array_descriptor_type (struct type
*type
)
1566 struct type
*data_type
= desc_data_target_type (type
);
1570 type
= ada_check_typedef (type
);
1571 return (data_type
!= NULL
1572 && TYPE_CODE (data_type
) == TYPE_CODE_ARRAY
1573 && desc_arity (desc_bounds_type (type
)) > 0);
1576 /* Non-zero iff type is a partially mal-formed GNAT array
1577 descriptor. FIXME: This is to compensate for some problems with
1578 debugging output from GNAT. Re-examine periodically to see if it
1582 ada_is_bogus_array_descriptor (struct type
*type
)
1586 && TYPE_CODE (type
) == TYPE_CODE_STRUCT
1587 && (lookup_struct_elt_type (type
, "P_BOUNDS", 1) != NULL
1588 || lookup_struct_elt_type (type
, "P_ARRAY", 1) != NULL
)
1589 && !ada_is_array_descriptor_type (type
);
1593 /* If ARR has a record type in the form of a standard GNAT array descriptor,
1594 (fat pointer) returns the type of the array data described---specifically,
1595 a pointer-to-array type. If BOUNDS is non-zero, the bounds data are filled
1596 in from the descriptor; otherwise, they are left unspecified. If
1597 the ARR denotes a null array descriptor and BOUNDS is non-zero,
1598 returns NULL. The result is simply the type of ARR if ARR is not
1601 ada_type_of_array (struct value
*arr
, int bounds
)
1603 if (ada_is_packed_array_type (value_type (arr
)))
1604 return decode_packed_array_type (value_type (arr
));
1606 if (!ada_is_array_descriptor_type (value_type (arr
)))
1607 return value_type (arr
);
1611 ada_check_typedef (desc_data_target_type (value_type (arr
)));
1614 struct type
*elt_type
;
1616 struct value
*descriptor
;
1617 struct objfile
*objf
= TYPE_OBJFILE (value_type (arr
));
1619 elt_type
= ada_array_element_type (value_type (arr
), -1);
1620 arity
= ada_array_arity (value_type (arr
));
1622 if (elt_type
== NULL
|| arity
== 0)
1623 return ada_check_typedef (value_type (arr
));
1625 descriptor
= desc_bounds (arr
);
1626 if (value_as_long (descriptor
) == 0)
1630 struct type
*range_type
= alloc_type (objf
);
1631 struct type
*array_type
= alloc_type (objf
);
1632 struct value
*low
= desc_one_bound (descriptor
, arity
, 0);
1633 struct value
*high
= desc_one_bound (descriptor
, arity
, 1);
1636 create_range_type (range_type
, value_type (low
),
1637 longest_to_int (value_as_long (low
)),
1638 longest_to_int (value_as_long (high
)));
1639 elt_type
= create_array_type (array_type
, elt_type
, range_type
);
1642 return lookup_pointer_type (elt_type
);
1646 /* If ARR does not represent an array, returns ARR unchanged.
1647 Otherwise, returns either a standard GDB array with bounds set
1648 appropriately or, if ARR is a non-null fat pointer, a pointer to a standard
1649 GDB array. Returns NULL if ARR is a null fat pointer. */
1652 ada_coerce_to_simple_array_ptr (struct value
*arr
)
1654 if (ada_is_array_descriptor_type (value_type (arr
)))
1656 struct type
*arrType
= ada_type_of_array (arr
, 1);
1657 if (arrType
== NULL
)
1659 return value_cast (arrType
, value_copy (desc_data (arr
)));
1661 else if (ada_is_packed_array_type (value_type (arr
)))
1662 return decode_packed_array (arr
);
1667 /* If ARR does not represent an array, returns ARR unchanged.
1668 Otherwise, returns a standard GDB array describing ARR (which may
1669 be ARR itself if it already is in the proper form). */
1671 static struct value
*
1672 ada_coerce_to_simple_array (struct value
*arr
)
1674 if (ada_is_array_descriptor_type (value_type (arr
)))
1676 struct value
*arrVal
= ada_coerce_to_simple_array_ptr (arr
);
1678 error (_("Bounds unavailable for null array pointer."));
1679 check_size (TYPE_TARGET_TYPE (value_type (arrVal
)));
1680 return value_ind (arrVal
);
1682 else if (ada_is_packed_array_type (value_type (arr
)))
1683 return decode_packed_array (arr
);
1688 /* If TYPE represents a GNAT array type, return it translated to an
1689 ordinary GDB array type (possibly with BITSIZE fields indicating
1690 packing). For other types, is the identity. */
1693 ada_coerce_to_simple_array_type (struct type
*type
)
1695 if (ada_is_packed_array_type (type
))
1696 return decode_packed_array_type (type
);
1698 if (ada_is_array_descriptor_type (type
))
1699 return ada_check_typedef (desc_data_target_type (type
));
1704 /* Non-zero iff TYPE represents a standard GNAT packed-array type. */
1707 ada_is_packed_array_type (struct type
*type
)
1711 type
= desc_base_type (type
);
1712 type
= ada_check_typedef (type
);
1714 ada_type_name (type
) != NULL
1715 && strstr (ada_type_name (type
), "___XP") != NULL
;
1718 /* Given that TYPE is a standard GDB array type with all bounds filled
1719 in, and that the element size of its ultimate scalar constituents
1720 (that is, either its elements, or, if it is an array of arrays, its
1721 elements' elements, etc.) is *ELT_BITS, return an identical type,
1722 but with the bit sizes of its elements (and those of any
1723 constituent arrays) recorded in the BITSIZE components of its
1724 TYPE_FIELD_BITSIZE values, and with *ELT_BITS set to its total size
1727 static struct type
*
1728 packed_array_type (struct type
*type
, long *elt_bits
)
1730 struct type
*new_elt_type
;
1731 struct type
*new_type
;
1732 LONGEST low_bound
, high_bound
;
1734 type
= ada_check_typedef (type
);
1735 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
1738 new_type
= alloc_type (TYPE_OBJFILE (type
));
1739 new_elt_type
= packed_array_type (ada_check_typedef (TYPE_TARGET_TYPE (type
)),
1741 create_array_type (new_type
, new_elt_type
, TYPE_INDEX_TYPE (type
));
1742 TYPE_FIELD_BITSIZE (new_type
, 0) = *elt_bits
;
1743 TYPE_NAME (new_type
) = ada_type_name (type
);
1745 if (get_discrete_bounds (TYPE_INDEX_TYPE (type
),
1746 &low_bound
, &high_bound
) < 0)
1747 low_bound
= high_bound
= 0;
1748 if (high_bound
< low_bound
)
1749 *elt_bits
= TYPE_LENGTH (new_type
) = 0;
1752 *elt_bits
*= (high_bound
- low_bound
+ 1);
1753 TYPE_LENGTH (new_type
) =
1754 (*elt_bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
1757 TYPE_FIXED_INSTANCE (new_type
) = 1;
1761 /* The array type encoded by TYPE, where ada_is_packed_array_type (TYPE). */
1763 static struct type
*
1764 decode_packed_array_type (struct type
*type
)
1767 struct block
**blocks
;
1768 char *raw_name
= ada_type_name (ada_check_typedef (type
));
1771 struct type
*shadow_type
;
1776 raw_name
= ada_type_name (desc_base_type (type
));
1781 name
= (char *) alloca (strlen (raw_name
) + 1);
1782 tail
= strstr (raw_name
, "___XP");
1783 type
= desc_base_type (type
);
1785 memcpy (name
, raw_name
, tail
- raw_name
);
1786 name
[tail
- raw_name
] = '\000';
1788 sym
= standard_lookup (name
, get_selected_block (0), VAR_DOMAIN
);
1789 if (sym
== NULL
|| SYMBOL_TYPE (sym
) == NULL
)
1791 lim_warning (_("could not find bounds information on packed array"));
1794 shadow_type
= SYMBOL_TYPE (sym
);
1795 CHECK_TYPEDEF (shadow_type
);
1797 if (TYPE_CODE (shadow_type
) != TYPE_CODE_ARRAY
)
1799 lim_warning (_("could not understand bounds information on packed array"));
1803 if (sscanf (tail
+ sizeof ("___XP") - 1, "%ld", &bits
) != 1)
1806 (_("could not understand bit size information on packed array"));
1810 return packed_array_type (shadow_type
, &bits
);
1813 /* Given that ARR is a struct value *indicating a GNAT packed array,
1814 returns a simple array that denotes that array. Its type is a
1815 standard GDB array type except that the BITSIZEs of the array
1816 target types are set to the number of bits in each element, and the
1817 type length is set appropriately. */
1819 static struct value
*
1820 decode_packed_array (struct value
*arr
)
1824 arr
= ada_coerce_ref (arr
);
1825 if (TYPE_CODE (value_type (arr
)) == TYPE_CODE_PTR
)
1826 arr
= ada_value_ind (arr
);
1828 type
= decode_packed_array_type (value_type (arr
));
1831 error (_("can't unpack array"));
1835 if (gdbarch_bits_big_endian (current_gdbarch
)
1836 && ada_is_modular_type (value_type (arr
)))
1838 /* This is a (right-justified) modular type representing a packed
1839 array with no wrapper. In order to interpret the value through
1840 the (left-justified) packed array type we just built, we must
1841 first left-justify it. */
1842 int bit_size
, bit_pos
;
1845 mod
= ada_modulus (value_type (arr
)) - 1;
1852 bit_pos
= HOST_CHAR_BIT
* TYPE_LENGTH (value_type (arr
)) - bit_size
;
1853 arr
= ada_value_primitive_packed_val (arr
, NULL
,
1854 bit_pos
/ HOST_CHAR_BIT
,
1855 bit_pos
% HOST_CHAR_BIT
,
1860 return coerce_unspec_val_to_type (arr
, type
);
1864 /* The value of the element of packed array ARR at the ARITY indices
1865 given in IND. ARR must be a simple array. */
1867 static struct value
*
1868 value_subscript_packed (struct value
*arr
, int arity
, struct value
**ind
)
1871 int bits
, elt_off
, bit_off
;
1872 long elt_total_bit_offset
;
1873 struct type
*elt_type
;
1877 elt_total_bit_offset
= 0;
1878 elt_type
= ada_check_typedef (value_type (arr
));
1879 for (i
= 0; i
< arity
; i
+= 1)
1881 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
1882 || TYPE_FIELD_BITSIZE (elt_type
, 0) == 0)
1884 (_("attempt to do packed indexing of something other than a packed array"));
1887 struct type
*range_type
= TYPE_INDEX_TYPE (elt_type
);
1888 LONGEST lowerbound
, upperbound
;
1891 if (get_discrete_bounds (range_type
, &lowerbound
, &upperbound
) < 0)
1893 lim_warning (_("don't know bounds of array"));
1894 lowerbound
= upperbound
= 0;
1897 idx
= pos_atr (ind
[i
]);
1898 if (idx
< lowerbound
|| idx
> upperbound
)
1899 lim_warning (_("packed array index %ld out of bounds"), (long) idx
);
1900 bits
= TYPE_FIELD_BITSIZE (elt_type
, 0);
1901 elt_total_bit_offset
+= (idx
- lowerbound
) * bits
;
1902 elt_type
= ada_check_typedef (TYPE_TARGET_TYPE (elt_type
));
1905 elt_off
= elt_total_bit_offset
/ HOST_CHAR_BIT
;
1906 bit_off
= elt_total_bit_offset
% HOST_CHAR_BIT
;
1908 v
= ada_value_primitive_packed_val (arr
, NULL
, elt_off
, bit_off
,
1913 /* Non-zero iff TYPE includes negative integer values. */
1916 has_negatives (struct type
*type
)
1918 switch (TYPE_CODE (type
))
1923 return !TYPE_UNSIGNED (type
);
1924 case TYPE_CODE_RANGE
:
1925 return TYPE_LOW_BOUND (type
) < 0;
1930 /* Create a new value of type TYPE from the contents of OBJ starting
1931 at byte OFFSET, and bit offset BIT_OFFSET within that byte,
1932 proceeding for BIT_SIZE bits. If OBJ is an lval in memory, then
1933 assigning through the result will set the field fetched from.
1934 VALADDR is ignored unless OBJ is NULL, in which case,
1935 VALADDR+OFFSET must address the start of storage containing the
1936 packed value. The value returned in this case is never an lval.
1937 Assumes 0 <= BIT_OFFSET < HOST_CHAR_BIT. */
1940 ada_value_primitive_packed_val (struct value
*obj
, const gdb_byte
*valaddr
,
1941 long offset
, int bit_offset
, int bit_size
,
1945 int src
, /* Index into the source area */
1946 targ
, /* Index into the target area */
1947 srcBitsLeft
, /* Number of source bits left to move */
1948 nsrc
, ntarg
, /* Number of source and target bytes */
1949 unusedLS
, /* Number of bits in next significant
1950 byte of source that are unused */
1951 accumSize
; /* Number of meaningful bits in accum */
1952 unsigned char *bytes
; /* First byte containing data to unpack */
1953 unsigned char *unpacked
;
1954 unsigned long accum
; /* Staging area for bits being transferred */
1956 int len
= (bit_size
+ bit_offset
+ HOST_CHAR_BIT
- 1) / 8;
1957 /* Transmit bytes from least to most significant; delta is the direction
1958 the indices move. */
1959 int delta
= gdbarch_bits_big_endian (current_gdbarch
) ? -1 : 1;
1961 type
= ada_check_typedef (type
);
1965 v
= allocate_value (type
);
1966 bytes
= (unsigned char *) (valaddr
+ offset
);
1968 else if (VALUE_LVAL (obj
) == lval_memory
&& value_lazy (obj
))
1971 VALUE_ADDRESS (obj
) + value_offset (obj
) + offset
);
1972 bytes
= (unsigned char *) alloca (len
);
1973 read_memory (VALUE_ADDRESS (v
), bytes
, len
);
1977 v
= allocate_value (type
);
1978 bytes
= (unsigned char *) value_contents (obj
) + offset
;
1983 set_value_component_location (v
, obj
);
1984 VALUE_ADDRESS (v
) += value_offset (obj
) + offset
;
1985 set_value_bitpos (v
, bit_offset
+ value_bitpos (obj
));
1986 set_value_bitsize (v
, bit_size
);
1987 if (value_bitpos (v
) >= HOST_CHAR_BIT
)
1989 VALUE_ADDRESS (v
) += 1;
1990 set_value_bitpos (v
, value_bitpos (v
) - HOST_CHAR_BIT
);
1994 set_value_bitsize (v
, bit_size
);
1995 unpacked
= (unsigned char *) value_contents (v
);
1997 srcBitsLeft
= bit_size
;
1999 ntarg
= TYPE_LENGTH (type
);
2003 memset (unpacked
, 0, TYPE_LENGTH (type
));
2006 else if (gdbarch_bits_big_endian (current_gdbarch
))
2009 if (has_negatives (type
)
2010 && ((bytes
[0] << bit_offset
) & (1 << (HOST_CHAR_BIT
- 1))))
2014 (HOST_CHAR_BIT
- (bit_size
+ bit_offset
) % HOST_CHAR_BIT
)
2017 switch (TYPE_CODE (type
))
2019 case TYPE_CODE_ARRAY
:
2020 case TYPE_CODE_UNION
:
2021 case TYPE_CODE_STRUCT
:
2022 /* Non-scalar values must be aligned at a byte boundary... */
2024 (HOST_CHAR_BIT
- bit_size
% HOST_CHAR_BIT
) % HOST_CHAR_BIT
;
2025 /* ... And are placed at the beginning (most-significant) bytes
2027 targ
= (bit_size
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
- 1;
2032 targ
= TYPE_LENGTH (type
) - 1;
2038 int sign_bit_offset
= (bit_size
+ bit_offset
- 1) % 8;
2041 unusedLS
= bit_offset
;
2044 if (has_negatives (type
) && (bytes
[len
- 1] & (1 << sign_bit_offset
)))
2051 /* Mask for removing bits of the next source byte that are not
2052 part of the value. */
2053 unsigned int unusedMSMask
=
2054 (1 << (srcBitsLeft
>= HOST_CHAR_BIT
? HOST_CHAR_BIT
: srcBitsLeft
)) -
2056 /* Sign-extend bits for this byte. */
2057 unsigned int signMask
= sign
& ~unusedMSMask
;
2059 (((bytes
[src
] >> unusedLS
) & unusedMSMask
) | signMask
) << accumSize
;
2060 accumSize
+= HOST_CHAR_BIT
- unusedLS
;
2061 if (accumSize
>= HOST_CHAR_BIT
)
2063 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2064 accumSize
-= HOST_CHAR_BIT
;
2065 accum
>>= HOST_CHAR_BIT
;
2069 srcBitsLeft
-= HOST_CHAR_BIT
- unusedLS
;
2076 accum
|= sign
<< accumSize
;
2077 unpacked
[targ
] = accum
& ~(~0L << HOST_CHAR_BIT
);
2078 accumSize
-= HOST_CHAR_BIT
;
2079 accum
>>= HOST_CHAR_BIT
;
2087 /* Move N bits from SOURCE, starting at bit offset SRC_OFFSET to
2088 TARGET, starting at bit offset TARG_OFFSET. SOURCE and TARGET must
2091 move_bits (gdb_byte
*target
, int targ_offset
, const gdb_byte
*source
,
2092 int src_offset
, int n
)
2094 unsigned int accum
, mask
;
2095 int accum_bits
, chunk_size
;
2097 target
+= targ_offset
/ HOST_CHAR_BIT
;
2098 targ_offset
%= HOST_CHAR_BIT
;
2099 source
+= src_offset
/ HOST_CHAR_BIT
;
2100 src_offset
%= HOST_CHAR_BIT
;
2101 if (gdbarch_bits_big_endian (current_gdbarch
))
2103 accum
= (unsigned char) *source
;
2105 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2110 accum
= (accum
<< HOST_CHAR_BIT
) + (unsigned char) *source
;
2111 accum_bits
+= HOST_CHAR_BIT
;
2113 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2116 unused_right
= HOST_CHAR_BIT
- (chunk_size
+ targ_offset
);
2117 mask
= ((1 << chunk_size
) - 1) << unused_right
;
2120 | ((accum
>> (accum_bits
- chunk_size
- unused_right
)) & mask
);
2122 accum_bits
-= chunk_size
;
2129 accum
= (unsigned char) *source
>> src_offset
;
2131 accum_bits
= HOST_CHAR_BIT
- src_offset
;
2135 accum
= accum
+ ((unsigned char) *source
<< accum_bits
);
2136 accum_bits
+= HOST_CHAR_BIT
;
2138 chunk_size
= HOST_CHAR_BIT
- targ_offset
;
2141 mask
= ((1 << chunk_size
) - 1) << targ_offset
;
2142 *target
= (*target
& ~mask
) | ((accum
<< targ_offset
) & mask
);
2144 accum_bits
-= chunk_size
;
2145 accum
>>= chunk_size
;
2152 /* Store the contents of FROMVAL into the location of TOVAL.
2153 Return a new value with the location of TOVAL and contents of
2154 FROMVAL. Handles assignment into packed fields that have
2155 floating-point or non-scalar types. */
2157 static struct value
*
2158 ada_value_assign (struct value
*toval
, struct value
*fromval
)
2160 struct type
*type
= value_type (toval
);
2161 int bits
= value_bitsize (toval
);
2163 toval
= ada_coerce_ref (toval
);
2164 fromval
= ada_coerce_ref (fromval
);
2166 if (ada_is_direct_array_type (value_type (toval
)))
2167 toval
= ada_coerce_to_simple_array (toval
);
2168 if (ada_is_direct_array_type (value_type (fromval
)))
2169 fromval
= ada_coerce_to_simple_array (fromval
);
2171 if (!deprecated_value_modifiable (toval
))
2172 error (_("Left operand of assignment is not a modifiable lvalue."));
2174 if (VALUE_LVAL (toval
) == lval_memory
2176 && (TYPE_CODE (type
) == TYPE_CODE_FLT
2177 || TYPE_CODE (type
) == TYPE_CODE_STRUCT
))
2179 int len
= (value_bitpos (toval
)
2180 + bits
+ HOST_CHAR_BIT
- 1) / HOST_CHAR_BIT
;
2182 char *buffer
= (char *) alloca (len
);
2184 CORE_ADDR to_addr
= VALUE_ADDRESS (toval
) + value_offset (toval
);
2186 if (TYPE_CODE (type
) == TYPE_CODE_FLT
)
2187 fromval
= value_cast (type
, fromval
);
2189 read_memory (to_addr
, buffer
, len
);
2190 from_size
= value_bitsize (fromval
);
2192 from_size
= TYPE_LENGTH (value_type (fromval
)) * TARGET_CHAR_BIT
;
2193 if (gdbarch_bits_big_endian (current_gdbarch
))
2194 move_bits (buffer
, value_bitpos (toval
),
2195 value_contents (fromval
), from_size
- bits
, bits
);
2197 move_bits (buffer
, value_bitpos (toval
), value_contents (fromval
),
2199 write_memory (to_addr
, buffer
, len
);
2200 if (deprecated_memory_changed_hook
)
2201 deprecated_memory_changed_hook (to_addr
, len
);
2203 val
= value_copy (toval
);
2204 memcpy (value_contents_raw (val
), value_contents (fromval
),
2205 TYPE_LENGTH (type
));
2206 deprecated_set_value_type (val
, type
);
2211 return value_assign (toval
, fromval
);
2215 /* Given that COMPONENT is a memory lvalue that is part of the lvalue
2216 * CONTAINER, assign the contents of VAL to COMPONENTS's place in
2217 * CONTAINER. Modifies the VALUE_CONTENTS of CONTAINER only, not
2218 * COMPONENT, and not the inferior's memory. The current contents
2219 * of COMPONENT are ignored. */
2221 value_assign_to_component (struct value
*container
, struct value
*component
,
2224 LONGEST offset_in_container
=
2225 (LONGEST
) (VALUE_ADDRESS (component
) + value_offset (component
)
2226 - VALUE_ADDRESS (container
) - value_offset (container
));
2227 int bit_offset_in_container
=
2228 value_bitpos (component
) - value_bitpos (container
);
2231 val
= value_cast (value_type (component
), val
);
2233 if (value_bitsize (component
) == 0)
2234 bits
= TARGET_CHAR_BIT
* TYPE_LENGTH (value_type (component
));
2236 bits
= value_bitsize (component
);
2238 if (gdbarch_bits_big_endian (current_gdbarch
))
2239 move_bits (value_contents_writeable (container
) + offset_in_container
,
2240 value_bitpos (container
) + bit_offset_in_container
,
2241 value_contents (val
),
2242 TYPE_LENGTH (value_type (component
)) * TARGET_CHAR_BIT
- bits
,
2245 move_bits (value_contents_writeable (container
) + offset_in_container
,
2246 value_bitpos (container
) + bit_offset_in_container
,
2247 value_contents (val
), 0, bits
);
2250 /* The value of the element of array ARR at the ARITY indices given in IND.
2251 ARR may be either a simple array, GNAT array descriptor, or pointer
2255 ada_value_subscript (struct value
*arr
, int arity
, struct value
**ind
)
2259 struct type
*elt_type
;
2261 elt
= ada_coerce_to_simple_array (arr
);
2263 elt_type
= ada_check_typedef (value_type (elt
));
2264 if (TYPE_CODE (elt_type
) == TYPE_CODE_ARRAY
2265 && TYPE_FIELD_BITSIZE (elt_type
, 0) > 0)
2266 return value_subscript_packed (elt
, arity
, ind
);
2268 for (k
= 0; k
< arity
; k
+= 1)
2270 if (TYPE_CODE (elt_type
) != TYPE_CODE_ARRAY
)
2271 error (_("too many subscripts (%d expected)"), k
);
2272 elt
= value_subscript (elt
, value_pos_atr (builtin_type_int32
, ind
[k
]));
2277 /* Assuming ARR is a pointer to a standard GDB array of type TYPE, the
2278 value of the element of *ARR at the ARITY indices given in
2279 IND. Does not read the entire array into memory. */
2281 static struct value
*
2282 ada_value_ptr_subscript (struct value
*arr
, struct type
*type
, int arity
,
2287 for (k
= 0; k
< arity
; k
+= 1)
2292 if (TYPE_CODE (type
) != TYPE_CODE_ARRAY
)
2293 error (_("too many subscripts (%d expected)"), k
);
2294 arr
= value_cast (lookup_pointer_type (TYPE_TARGET_TYPE (type
)),
2296 get_discrete_bounds (TYPE_INDEX_TYPE (type
), &lwb
, &upb
);
2297 idx
= value_pos_atr (builtin_type_int32
, ind
[k
]);
2299 idx
= value_binop (idx
, value_from_longest (value_type (idx
), lwb
),
2302 arr
= value_ptradd (arr
, idx
);
2303 type
= TYPE_TARGET_TYPE (type
);
2306 return value_ind (arr
);
2309 /* Given that ARRAY_PTR is a pointer or reference to an array of type TYPE (the
2310 actual type of ARRAY_PTR is ignored), returns the Ada slice of HIGH-LOW+1
2311 elements starting at index LOW. The lower bound of this array is LOW, as
2313 static struct value
*
2314 ada_value_slice_from_ptr (struct value
*array_ptr
, struct type
*type
,
2317 CORE_ADDR base
= value_as_address (array_ptr
)
2318 + ((low
- TYPE_LOW_BOUND (TYPE_INDEX_TYPE (type
)))
2319 * TYPE_LENGTH (TYPE_TARGET_TYPE (type
)));
2320 struct type
*index_type
=
2321 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
)),
2323 struct type
*slice_type
=
2324 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2325 return value_at_lazy (slice_type
, base
);
2329 static struct value
*
2330 ada_value_slice (struct value
*array
, int low
, int high
)
2332 struct type
*type
= value_type (array
);
2333 struct type
*index_type
=
2334 create_range_type (NULL
, TYPE_INDEX_TYPE (type
), low
, high
);
2335 struct type
*slice_type
=
2336 create_array_type (NULL
, TYPE_TARGET_TYPE (type
), index_type
);
2337 return value_cast (slice_type
, value_slice (array
, low
, high
- low
+ 1));
2340 /* If type is a record type in the form of a standard GNAT array
2341 descriptor, returns the number of dimensions for type. If arr is a
2342 simple array, returns the number of "array of"s that prefix its
2343 type designation. Otherwise, returns 0. */
2346 ada_array_arity (struct type
*type
)
2353 type
= desc_base_type (type
);
2356 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2357 return desc_arity (desc_bounds_type (type
));
2359 while (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2362 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
2368 /* If TYPE is a record type in the form of a standard GNAT array
2369 descriptor or a simple array type, returns the element type for
2370 TYPE after indexing by NINDICES indices, or by all indices if
2371 NINDICES is -1. Otherwise, returns NULL. */
2374 ada_array_element_type (struct type
*type
, int nindices
)
2376 type
= desc_base_type (type
);
2378 if (TYPE_CODE (type
) == TYPE_CODE_STRUCT
)
2381 struct type
*p_array_type
;
2383 p_array_type
= desc_data_target_type (type
);
2385 k
= ada_array_arity (type
);
2389 /* Initially p_array_type = elt_type(*)[]...(k times)...[]. */
2390 if (nindices
>= 0 && k
> nindices
)
2392 while (k
> 0 && p_array_type
!= NULL
)
2394 p_array_type
= ada_check_typedef (TYPE_TARGET_TYPE (p_array_type
));
2397 return p_array_type
;
2399 else if (TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2401 while (nindices
!= 0 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
2403 type
= TYPE_TARGET_TYPE (type
);
2412 /* The type of nth index in arrays of given type (n numbering from 1).
2413 Does not examine memory. */
2416 ada_index_type (struct type
*type
, int n
)
2418 struct type
*result_type
;
2420 type
= desc_base_type (type
);
2422 if (n
> ada_array_arity (type
))
2425 if (ada_is_simple_array_type (type
))
2429 for (i
= 1; i
< n
; i
+= 1)
2430 type
= TYPE_TARGET_TYPE (type
);
2431 result_type
= TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (type
));
2432 /* FIXME: The stabs type r(0,0);bound;bound in an array type
2433 has a target type of TYPE_CODE_UNDEF. We compensate here, but
2434 perhaps stabsread.c would make more sense. */
2435 if (result_type
== NULL
|| TYPE_CODE (result_type
) == TYPE_CODE_UNDEF
)
2436 result_type
= builtin_type_int32
;
2441 return desc_index_type (desc_bounds_type (type
), n
);
2444 /* Given that arr is an array type, returns the lower bound of the
2445 Nth index (numbering from 1) if WHICH is 0, and the upper bound if
2446 WHICH is 1. This returns bounds 0 .. -1 if ARR_TYPE is an
2447 array-descriptor type. If TYPEP is non-null, *TYPEP is set to the
2448 bounds type. It works for other arrays with bounds supplied by
2449 run-time quantities other than discriminants. */
2452 ada_array_bound_from_type (struct type
* arr_type
, int n
, int which
,
2453 struct type
** typep
)
2455 struct type
*type
, *index_type_desc
, *index_type
;
2458 gdb_assert (which
== 0 || which
== 1);
2460 if (ada_is_packed_array_type (arr_type
))
2461 arr_type
= decode_packed_array_type (arr_type
);
2463 if (arr_type
== NULL
|| !ada_is_simple_array_type (arr_type
))
2466 *typep
= builtin_type_int32
;
2467 return (LONGEST
) - which
;
2470 if (TYPE_CODE (arr_type
) == TYPE_CODE_PTR
)
2471 type
= TYPE_TARGET_TYPE (arr_type
);
2475 index_type_desc
= ada_find_parallel_type (type
, "___XA");
2476 if (index_type_desc
!= NULL
)
2477 index_type
= to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, n
- 1),
2478 NULL
, TYPE_OBJFILE (arr_type
));
2483 type
= TYPE_TARGET_TYPE (type
);
2487 index_type
= TYPE_INDEX_TYPE (type
);
2490 switch (TYPE_CODE (index_type
))
2492 case TYPE_CODE_RANGE
:
2493 retval
= which
== 0 ? TYPE_LOW_BOUND (index_type
)
2494 : TYPE_HIGH_BOUND (index_type
);
2496 case TYPE_CODE_ENUM
:
2497 retval
= which
== 0 ? TYPE_FIELD_BITPOS (index_type
, 0)
2498 : TYPE_FIELD_BITPOS (index_type
,
2499 TYPE_NFIELDS (index_type
) - 1);
2502 internal_error (__FILE__
, __LINE__
, _("invalid type code of index type"));
2506 *typep
= index_type
;
2511 /* Given that arr is an array value, returns the lower bound of the
2512 nth index (numbering from 1) if WHICH is 0, and the upper bound if
2513 WHICH is 1. This routine will also work for arrays with bounds
2514 supplied by run-time quantities other than discriminants. */
2517 ada_array_bound (struct value
*arr
, int n
, int which
)
2519 struct type
*arr_type
= value_type (arr
);
2521 if (ada_is_packed_array_type (arr_type
))
2522 return ada_array_bound (decode_packed_array (arr
), n
, which
);
2523 else if (ada_is_simple_array_type (arr_type
))
2526 LONGEST v
= ada_array_bound_from_type (arr_type
, n
, which
, &type
);
2527 return value_from_longest (type
, v
);
2530 return desc_one_bound (desc_bounds (arr
), n
, which
);
2533 /* Given that arr is an array value, returns the length of the
2534 nth index. This routine will also work for arrays with bounds
2535 supplied by run-time quantities other than discriminants.
2536 Does not work for arrays indexed by enumeration types with representation
2537 clauses at the moment. */
2539 static struct value
*
2540 ada_array_length (struct value
*arr
, int n
)
2542 struct type
*arr_type
= ada_check_typedef (value_type (arr
));
2544 if (ada_is_packed_array_type (arr_type
))
2545 return ada_array_length (decode_packed_array (arr
), n
);
2547 if (ada_is_simple_array_type (arr_type
))
2551 ada_array_bound_from_type (arr_type
, n
, 1, &type
) -
2552 ada_array_bound_from_type (arr_type
, n
, 0, NULL
) + 1;
2553 return value_from_longest (type
, v
);
2557 value_from_longest (builtin_type_int32
,
2558 value_as_long (desc_one_bound (desc_bounds (arr
),
2560 - value_as_long (desc_one_bound (desc_bounds (arr
),
2564 /* An empty array whose type is that of ARR_TYPE (an array type),
2565 with bounds LOW to LOW-1. */
2567 static struct value
*
2568 empty_array (struct type
*arr_type
, int low
)
2570 struct type
*index_type
=
2571 create_range_type (NULL
, TYPE_TARGET_TYPE (TYPE_INDEX_TYPE (arr_type
)),
2573 struct type
*elt_type
= ada_array_element_type (arr_type
, 1);
2574 return allocate_value (create_array_type (NULL
, elt_type
, index_type
));
2578 /* Name resolution */
2580 /* The "decoded" name for the user-definable Ada operator corresponding
2584 ada_decoded_op_name (enum exp_opcode op
)
2588 for (i
= 0; ada_opname_table
[i
].encoded
!= NULL
; i
+= 1)
2590 if (ada_opname_table
[i
].op
== op
)
2591 return ada_opname_table
[i
].decoded
;
2593 error (_("Could not find operator name for opcode"));
2597 /* Same as evaluate_type (*EXP), but resolves ambiguous symbol
2598 references (marked by OP_VAR_VALUE nodes in which the symbol has an
2599 undefined namespace) and converts operators that are
2600 user-defined into appropriate function calls. If CONTEXT_TYPE is
2601 non-null, it provides a preferred result type [at the moment, only
2602 type void has any effect---causing procedures to be preferred over
2603 functions in calls]. A null CONTEXT_TYPE indicates that a non-void
2604 return type is preferred. May change (expand) *EXP. */
2607 resolve (struct expression
**expp
, int void_context_p
)
2611 resolve_subexp (expp
, &pc
, 1, void_context_p
? builtin_type_void
: NULL
);
2614 /* Resolve the operator of the subexpression beginning at
2615 position *POS of *EXPP. "Resolving" consists of replacing
2616 the symbols that have undefined namespaces in OP_VAR_VALUE nodes
2617 with their resolutions, replacing built-in operators with
2618 function calls to user-defined operators, where appropriate, and,
2619 when DEPROCEDURE_P is non-zero, converting function-valued variables
2620 into parameterless calls. May expand *EXPP. The CONTEXT_TYPE functions
2621 are as in ada_resolve, above. */
2623 static struct value
*
2624 resolve_subexp (struct expression
**expp
, int *pos
, int deprocedure_p
,
2625 struct type
*context_type
)
2629 struct expression
*exp
; /* Convenience: == *expp. */
2630 enum exp_opcode op
= (*expp
)->elts
[pc
].opcode
;
2631 struct value
**argvec
; /* Vector of operand types (alloca'ed). */
2632 int nargs
; /* Number of operands. */
2639 /* Pass one: resolve operands, saving their types and updating *pos,
2644 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2645 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2650 resolve_subexp (expp
, pos
, 0, NULL
);
2652 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
2657 resolve_subexp (expp
, pos
, 0, NULL
);
2662 resolve_subexp (expp
, pos
, 1, check_typedef (exp
->elts
[pc
+ 1].type
));
2665 case OP_ATR_MODULUS
:
2675 case TERNOP_IN_RANGE
:
2676 case BINOP_IN_BOUNDS
:
2682 case OP_DISCRETE_RANGE
:
2684 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
2693 arg1
= resolve_subexp (expp
, pos
, 0, NULL
);
2695 resolve_subexp (expp
, pos
, 1, NULL
);
2697 resolve_subexp (expp
, pos
, 1, value_type (arg1
));
2714 case BINOP_LOGICAL_AND
:
2715 case BINOP_LOGICAL_OR
:
2716 case BINOP_BITWISE_AND
:
2717 case BINOP_BITWISE_IOR
:
2718 case BINOP_BITWISE_XOR
:
2721 case BINOP_NOTEQUAL
:
2728 case BINOP_SUBSCRIPT
:
2736 case UNOP_LOGICAL_NOT
:
2752 case OP_INTERNALVAR
:
2762 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2765 case STRUCTOP_STRUCT
:
2766 *pos
+= 4 + BYTES_TO_EXP_ELEM (exp
->elts
[pc
+ 1].longconst
+ 1);
2779 error (_("Unexpected operator during name resolution"));
2782 argvec
= (struct value
* *) alloca (sizeof (struct value
*) * (nargs
+ 1));
2783 for (i
= 0; i
< nargs
; i
+= 1)
2784 argvec
[i
] = resolve_subexp (expp
, pos
, 1, NULL
);
2788 /* Pass two: perform any resolution on principal operator. */
2795 if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
2797 struct ada_symbol_info
*candidates
;
2801 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2802 (exp
->elts
[pc
+ 2].symbol
),
2803 exp
->elts
[pc
+ 1].block
, VAR_DOMAIN
,
2806 if (n_candidates
> 1)
2808 /* Types tend to get re-introduced locally, so if there
2809 are any local symbols that are not types, first filter
2812 for (j
= 0; j
< n_candidates
; j
+= 1)
2813 switch (SYMBOL_CLASS (candidates
[j
].sym
))
2818 case LOC_REGPARM_ADDR
:
2826 if (j
< n_candidates
)
2829 while (j
< n_candidates
)
2831 if (SYMBOL_CLASS (candidates
[j
].sym
) == LOC_TYPEDEF
)
2833 candidates
[j
] = candidates
[n_candidates
- 1];
2842 if (n_candidates
== 0)
2843 error (_("No definition found for %s"),
2844 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2845 else if (n_candidates
== 1)
2847 else if (deprocedure_p
2848 && !is_nonfunction (candidates
, n_candidates
))
2850 i
= ada_resolve_function
2851 (candidates
, n_candidates
, NULL
, 0,
2852 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 2].symbol
),
2855 error (_("Could not find a match for %s"),
2856 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2860 printf_filtered (_("Multiple matches for %s\n"),
2861 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
2862 user_select_syms (candidates
, n_candidates
, 1);
2866 exp
->elts
[pc
+ 1].block
= candidates
[i
].block
;
2867 exp
->elts
[pc
+ 2].symbol
= candidates
[i
].sym
;
2868 if (innermost_block
== NULL
2869 || contained_in (candidates
[i
].block
, innermost_block
))
2870 innermost_block
= candidates
[i
].block
;
2874 && (TYPE_CODE (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))
2877 replace_operator_with_call (expp
, pc
, 0, 0,
2878 exp
->elts
[pc
+ 2].symbol
,
2879 exp
->elts
[pc
+ 1].block
);
2886 if (exp
->elts
[pc
+ 3].opcode
== OP_VAR_VALUE
2887 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
2889 struct ada_symbol_info
*candidates
;
2893 ada_lookup_symbol_list (SYMBOL_LINKAGE_NAME
2894 (exp
->elts
[pc
+ 5].symbol
),
2895 exp
->elts
[pc
+ 4].block
, VAR_DOMAIN
,
2897 if (n_candidates
== 1)
2901 i
= ada_resolve_function
2902 (candidates
, n_candidates
,
2904 SYMBOL_LINKAGE_NAME (exp
->elts
[pc
+ 5].symbol
),
2907 error (_("Could not find a match for %s"),
2908 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
2911 exp
->elts
[pc
+ 4].block
= candidates
[i
].block
;
2912 exp
->elts
[pc
+ 5].symbol
= candidates
[i
].sym
;
2913 if (innermost_block
== NULL
2914 || contained_in (candidates
[i
].block
, innermost_block
))
2915 innermost_block
= candidates
[i
].block
;
2926 case BINOP_BITWISE_AND
:
2927 case BINOP_BITWISE_IOR
:
2928 case BINOP_BITWISE_XOR
:
2930 case BINOP_NOTEQUAL
:
2938 case UNOP_LOGICAL_NOT
:
2940 if (possible_user_operator_p (op
, argvec
))
2942 struct ada_symbol_info
*candidates
;
2946 ada_lookup_symbol_list (ada_encode (ada_decoded_op_name (op
)),
2947 (struct block
*) NULL
, VAR_DOMAIN
,
2949 i
= ada_resolve_function (candidates
, n_candidates
, argvec
, nargs
,
2950 ada_decoded_op_name (op
), NULL
);
2954 replace_operator_with_call (expp
, pc
, nargs
, 1,
2955 candidates
[i
].sym
, candidates
[i
].block
);
2966 return evaluate_subexp_type (exp
, pos
);
2969 /* Return non-zero if formal type FTYPE matches actual type ATYPE. If
2970 MAY_DEREF is non-zero, the formal may be a pointer and the actual
2971 a non-pointer. A type of 'void' (which is never a valid expression type)
2972 by convention matches anything. */
2973 /* The term "match" here is rather loose. The match is heuristic and
2974 liberal. FIXME: TOO liberal, in fact. */
2977 ada_type_match (struct type
*ftype
, struct type
*atype
, int may_deref
)
2979 ftype
= ada_check_typedef (ftype
);
2980 atype
= ada_check_typedef (atype
);
2982 if (TYPE_CODE (ftype
) == TYPE_CODE_REF
)
2983 ftype
= TYPE_TARGET_TYPE (ftype
);
2984 if (TYPE_CODE (atype
) == TYPE_CODE_REF
)
2985 atype
= TYPE_TARGET_TYPE (atype
);
2987 if (TYPE_CODE (ftype
) == TYPE_CODE_VOID
2988 || TYPE_CODE (atype
) == TYPE_CODE_VOID
)
2991 switch (TYPE_CODE (ftype
))
2996 if (TYPE_CODE (atype
) == TYPE_CODE_PTR
)
2997 return ada_type_match (TYPE_TARGET_TYPE (ftype
),
2998 TYPE_TARGET_TYPE (atype
), 0);
3001 && ada_type_match (TYPE_TARGET_TYPE (ftype
), atype
, 0));
3003 case TYPE_CODE_ENUM
:
3004 case TYPE_CODE_RANGE
:
3005 switch (TYPE_CODE (atype
))
3008 case TYPE_CODE_ENUM
:
3009 case TYPE_CODE_RANGE
:
3015 case TYPE_CODE_ARRAY
:
3016 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3017 || ada_is_array_descriptor_type (atype
));
3019 case TYPE_CODE_STRUCT
:
3020 if (ada_is_array_descriptor_type (ftype
))
3021 return (TYPE_CODE (atype
) == TYPE_CODE_ARRAY
3022 || ada_is_array_descriptor_type (atype
));
3024 return (TYPE_CODE (atype
) == TYPE_CODE_STRUCT
3025 && !ada_is_array_descriptor_type (atype
));
3027 case TYPE_CODE_UNION
:
3029 return (TYPE_CODE (atype
) == TYPE_CODE (ftype
));
3033 /* Return non-zero if the formals of FUNC "sufficiently match" the
3034 vector of actual argument types ACTUALS of size N_ACTUALS. FUNC
3035 may also be an enumeral, in which case it is treated as a 0-
3036 argument function. */
3039 ada_args_match (struct symbol
*func
, struct value
**actuals
, int n_actuals
)
3042 struct type
*func_type
= SYMBOL_TYPE (func
);
3044 if (SYMBOL_CLASS (func
) == LOC_CONST
3045 && TYPE_CODE (func_type
) == TYPE_CODE_ENUM
)
3046 return (n_actuals
== 0);
3047 else if (func_type
== NULL
|| TYPE_CODE (func_type
) != TYPE_CODE_FUNC
)
3050 if (TYPE_NFIELDS (func_type
) != n_actuals
)
3053 for (i
= 0; i
< n_actuals
; i
+= 1)
3055 if (actuals
[i
] == NULL
)
3059 struct type
*ftype
= ada_check_typedef (TYPE_FIELD_TYPE (func_type
, i
));
3060 struct type
*atype
= ada_check_typedef (value_type (actuals
[i
]));
3062 if (!ada_type_match (ftype
, atype
, 1))
3069 /* False iff function type FUNC_TYPE definitely does not produce a value
3070 compatible with type CONTEXT_TYPE. Conservatively returns 1 if
3071 FUNC_TYPE is not a valid function type with a non-null return type
3072 or an enumerated type. A null CONTEXT_TYPE indicates any non-void type. */
3075 return_match (struct type
*func_type
, struct type
*context_type
)
3077 struct type
*return_type
;
3079 if (func_type
== NULL
)
3082 if (TYPE_CODE (func_type
) == TYPE_CODE_FUNC
)
3083 return_type
= base_type (TYPE_TARGET_TYPE (func_type
));
3085 return_type
= base_type (func_type
);
3086 if (return_type
== NULL
)
3089 context_type
= base_type (context_type
);
3091 if (TYPE_CODE (return_type
) == TYPE_CODE_ENUM
)
3092 return context_type
== NULL
|| return_type
== context_type
;
3093 else if (context_type
== NULL
)
3094 return TYPE_CODE (return_type
) != TYPE_CODE_VOID
;
3096 return TYPE_CODE (return_type
) == TYPE_CODE (context_type
);
3100 /* Returns the index in SYMS[0..NSYMS-1] that contains the symbol for the
3101 function (if any) that matches the types of the NARGS arguments in
3102 ARGS. If CONTEXT_TYPE is non-null and there is at least one match
3103 that returns that type, then eliminate matches that don't. If
3104 CONTEXT_TYPE is void and there is at least one match that does not
3105 return void, eliminate all matches that do.
3107 Asks the user if there is more than one match remaining. Returns -1
3108 if there is no such symbol or none is selected. NAME is used
3109 solely for messages. May re-arrange and modify SYMS in
3110 the process; the index returned is for the modified vector. */
3113 ada_resolve_function (struct ada_symbol_info syms
[],
3114 int nsyms
, struct value
**args
, int nargs
,
3115 const char *name
, struct type
*context_type
)
3118 int m
; /* Number of hits */
3119 struct type
*fallback
;
3120 struct type
*return_type
;
3122 return_type
= context_type
;
3123 if (context_type
== NULL
)
3124 fallback
= builtin_type_void
;
3131 for (k
= 0; k
< nsyms
; k
+= 1)
3133 struct type
*type
= ada_check_typedef (SYMBOL_TYPE (syms
[k
].sym
));
3135 if (ada_args_match (syms
[k
].sym
, args
, nargs
)
3136 && return_match (type
, return_type
))
3142 if (m
> 0 || return_type
== fallback
)
3145 return_type
= fallback
;
3152 printf_filtered (_("Multiple matches for %s\n"), name
);
3153 user_select_syms (syms
, m
, 1);
3159 /* Returns true (non-zero) iff decoded name N0 should appear before N1
3160 in a listing of choices during disambiguation (see sort_choices, below).
3161 The idea is that overloadings of a subprogram name from the
3162 same package should sort in their source order. We settle for ordering
3163 such symbols by their trailing number (__N or $N). */
3166 encoded_ordered_before (char *N0
, char *N1
)
3170 else if (N0
== NULL
)
3175 for (k0
= strlen (N0
) - 1; k0
> 0 && isdigit (N0
[k0
]); k0
-= 1)
3177 for (k1
= strlen (N1
) - 1; k1
> 0 && isdigit (N1
[k1
]); k1
-= 1)
3179 if ((N0
[k0
] == '_' || N0
[k0
] == '$') && N0
[k0
+ 1] != '\000'
3180 && (N1
[k1
] == '_' || N1
[k1
] == '$') && N1
[k1
+ 1] != '\000')
3184 while (N0
[n0
] == '_' && n0
> 0 && N0
[n0
- 1] == '_')
3187 while (N1
[n1
] == '_' && n1
> 0 && N1
[n1
- 1] == '_')
3189 if (n0
== n1
&& strncmp (N0
, N1
, n0
) == 0)
3190 return (atoi (N0
+ k0
+ 1) < atoi (N1
+ k1
+ 1));
3192 return (strcmp (N0
, N1
) < 0);
3196 /* Sort SYMS[0..NSYMS-1] to put the choices in a canonical order by the
3200 sort_choices (struct ada_symbol_info syms
[], int nsyms
)
3203 for (i
= 1; i
< nsyms
; i
+= 1)
3205 struct ada_symbol_info sym
= syms
[i
];
3208 for (j
= i
- 1; j
>= 0; j
-= 1)
3210 if (encoded_ordered_before (SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
3211 SYMBOL_LINKAGE_NAME (sym
.sym
)))
3213 syms
[j
+ 1] = syms
[j
];
3219 /* Given a list of NSYMS symbols in SYMS, select up to MAX_RESULTS>0
3220 by asking the user (if necessary), returning the number selected,
3221 and setting the first elements of SYMS items. Error if no symbols
3224 /* NOTE: Adapted from decode_line_2 in symtab.c, with which it ought
3225 to be re-integrated one of these days. */
3228 user_select_syms (struct ada_symbol_info
*syms
, int nsyms
, int max_results
)
3231 int *chosen
= (int *) alloca (sizeof (int) * nsyms
);
3233 int first_choice
= (max_results
== 1) ? 1 : 2;
3234 const char *select_mode
= multiple_symbols_select_mode ();
3236 if (max_results
< 1)
3237 error (_("Request to select 0 symbols!"));
3241 if (select_mode
== multiple_symbols_cancel
)
3243 canceled because the command is ambiguous\n\
3244 See set/show multiple-symbol."));
3246 /* If select_mode is "all", then return all possible symbols.
3247 Only do that if more than one symbol can be selected, of course.
3248 Otherwise, display the menu as usual. */
3249 if (select_mode
== multiple_symbols_all
&& max_results
> 1)
3252 printf_unfiltered (_("[0] cancel\n"));
3253 if (max_results
> 1)
3254 printf_unfiltered (_("[1] all\n"));
3256 sort_choices (syms
, nsyms
);
3258 for (i
= 0; i
< nsyms
; i
+= 1)
3260 if (syms
[i
].sym
== NULL
)
3263 if (SYMBOL_CLASS (syms
[i
].sym
) == LOC_BLOCK
)
3265 struct symtab_and_line sal
=
3266 find_function_start_sal (syms
[i
].sym
, 1);
3267 if (sal
.symtab
== NULL
)
3268 printf_unfiltered (_("[%d] %s at <no source file available>:%d\n"),
3270 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3273 printf_unfiltered (_("[%d] %s at %s:%d\n"), i
+ first_choice
,
3274 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3275 sal
.symtab
->filename
, sal
.line
);
3281 (SYMBOL_CLASS (syms
[i
].sym
) == LOC_CONST
3282 && SYMBOL_TYPE (syms
[i
].sym
) != NULL
3283 && TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) == TYPE_CODE_ENUM
);
3284 struct symtab
*symtab
= syms
[i
].sym
->symtab
;
3286 if (SYMBOL_LINE (syms
[i
].sym
) != 0 && symtab
!= NULL
)
3287 printf_unfiltered (_("[%d] %s at %s:%d\n"),
3289 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3290 symtab
->filename
, SYMBOL_LINE (syms
[i
].sym
));
3291 else if (is_enumeral
3292 && TYPE_NAME (SYMBOL_TYPE (syms
[i
].sym
)) != NULL
)
3294 printf_unfiltered (("[%d] "), i
+ first_choice
);
3295 ada_print_type (SYMBOL_TYPE (syms
[i
].sym
), NULL
,
3297 printf_unfiltered (_("'(%s) (enumeral)\n"),
3298 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3300 else if (symtab
!= NULL
)
3301 printf_unfiltered (is_enumeral
3302 ? _("[%d] %s in %s (enumeral)\n")
3303 : _("[%d] %s at %s:?\n"),
3305 SYMBOL_PRINT_NAME (syms
[i
].sym
),
3308 printf_unfiltered (is_enumeral
3309 ? _("[%d] %s (enumeral)\n")
3310 : _("[%d] %s at ?\n"),
3312 SYMBOL_PRINT_NAME (syms
[i
].sym
));
3316 n_chosen
= get_selections (chosen
, nsyms
, max_results
, max_results
> 1,
3319 for (i
= 0; i
< n_chosen
; i
+= 1)
3320 syms
[i
] = syms
[chosen
[i
]];
3325 /* Read and validate a set of numeric choices from the user in the
3326 range 0 .. N_CHOICES-1. Place the results in increasing
3327 order in CHOICES[0 .. N-1], and return N.
3329 The user types choices as a sequence of numbers on one line
3330 separated by blanks, encoding them as follows:
3332 + A choice of 0 means to cancel the selection, throwing an error.
3333 + If IS_ALL_CHOICE, a choice of 1 selects the entire set 0 .. N_CHOICES-1.
3334 + The user chooses k by typing k+IS_ALL_CHOICE+1.
3336 The user is not allowed to choose more than MAX_RESULTS values.
3338 ANNOTATION_SUFFIX, if present, is used to annotate the input
3339 prompts (for use with the -f switch). */
3342 get_selections (int *choices
, int n_choices
, int max_results
,
3343 int is_all_choice
, char *annotation_suffix
)
3348 int first_choice
= is_all_choice
? 2 : 1;
3350 prompt
= getenv ("PS2");
3354 args
= command_line_input (prompt
, 0, annotation_suffix
);
3357 error_no_arg (_("one or more choice numbers"));
3361 /* Set choices[0 .. n_chosen-1] to the users' choices in ascending
3362 order, as given in args. Choices are validated. */
3368 while (isspace (*args
))
3370 if (*args
== '\0' && n_chosen
== 0)
3371 error_no_arg (_("one or more choice numbers"));
3372 else if (*args
== '\0')
3375 choice
= strtol (args
, &args2
, 10);
3376 if (args
== args2
|| choice
< 0
3377 || choice
> n_choices
+ first_choice
- 1)
3378 error (_("Argument must be choice number"));
3382 error (_("cancelled"));
3384 if (choice
< first_choice
)
3386 n_chosen
= n_choices
;
3387 for (j
= 0; j
< n_choices
; j
+= 1)
3391 choice
-= first_choice
;
3393 for (j
= n_chosen
- 1; j
>= 0 && choice
< choices
[j
]; j
-= 1)
3397 if (j
< 0 || choice
!= choices
[j
])
3400 for (k
= n_chosen
- 1; k
> j
; k
-= 1)
3401 choices
[k
+ 1] = choices
[k
];
3402 choices
[j
+ 1] = choice
;
3407 if (n_chosen
> max_results
)
3408 error (_("Select no more than %d of the above"), max_results
);
3413 /* Replace the operator of length OPLEN at position PC in *EXPP with a call
3414 on the function identified by SYM and BLOCK, and taking NARGS
3415 arguments. Update *EXPP as needed to hold more space. */
3418 replace_operator_with_call (struct expression
**expp
, int pc
, int nargs
,
3419 int oplen
, struct symbol
*sym
,
3420 struct block
*block
)
3422 /* A new expression, with 6 more elements (3 for funcall, 4 for function
3423 symbol, -oplen for operator being replaced). */
3424 struct expression
*newexp
= (struct expression
*)
3425 xmalloc (sizeof (struct expression
)
3426 + EXP_ELEM_TO_BYTES ((*expp
)->nelts
+ 7 - oplen
));
3427 struct expression
*exp
= *expp
;
3429 newexp
->nelts
= exp
->nelts
+ 7 - oplen
;
3430 newexp
->language_defn
= exp
->language_defn
;
3431 memcpy (newexp
->elts
, exp
->elts
, EXP_ELEM_TO_BYTES (pc
));
3432 memcpy (newexp
->elts
+ pc
+ 7, exp
->elts
+ pc
+ oplen
,
3433 EXP_ELEM_TO_BYTES (exp
->nelts
- pc
- oplen
));
3435 newexp
->elts
[pc
].opcode
= newexp
->elts
[pc
+ 2].opcode
= OP_FUNCALL
;
3436 newexp
->elts
[pc
+ 1].longconst
= (LONGEST
) nargs
;
3438 newexp
->elts
[pc
+ 3].opcode
= newexp
->elts
[pc
+ 6].opcode
= OP_VAR_VALUE
;
3439 newexp
->elts
[pc
+ 4].block
= block
;
3440 newexp
->elts
[pc
+ 5].symbol
= sym
;
3446 /* Type-class predicates */
3448 /* True iff TYPE is numeric (i.e., an INT, RANGE (of numeric type),
3452 numeric_type_p (struct type
*type
)
3458 switch (TYPE_CODE (type
))
3463 case TYPE_CODE_RANGE
:
3464 return (type
== TYPE_TARGET_TYPE (type
)
3465 || numeric_type_p (TYPE_TARGET_TYPE (type
)));
3472 /* True iff TYPE is integral (an INT or RANGE of INTs). */
3475 integer_type_p (struct type
*type
)
3481 switch (TYPE_CODE (type
))
3485 case TYPE_CODE_RANGE
:
3486 return (type
== TYPE_TARGET_TYPE (type
)
3487 || integer_type_p (TYPE_TARGET_TYPE (type
)));
3494 /* True iff TYPE is scalar (INT, RANGE, FLOAT, ENUM). */
3497 scalar_type_p (struct type
*type
)
3503 switch (TYPE_CODE (type
))
3506 case TYPE_CODE_RANGE
:
3507 case TYPE_CODE_ENUM
:
3516 /* True iff TYPE is discrete (INT, RANGE, ENUM). */
3519 discrete_type_p (struct type
*type
)
3525 switch (TYPE_CODE (type
))
3528 case TYPE_CODE_RANGE
:
3529 case TYPE_CODE_ENUM
:
3537 /* Returns non-zero if OP with operands in the vector ARGS could be
3538 a user-defined function. Errs on the side of pre-defined operators
3539 (i.e., result 0). */
3542 possible_user_operator_p (enum exp_opcode op
, struct value
*args
[])
3544 struct type
*type0
=
3545 (args
[0] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[0]));
3546 struct type
*type1
=
3547 (args
[1] == NULL
) ? NULL
: ada_check_typedef (value_type (args
[1]));
3561 return (!(numeric_type_p (type0
) && numeric_type_p (type1
)));
3565 case BINOP_BITWISE_AND
:
3566 case BINOP_BITWISE_IOR
:
3567 case BINOP_BITWISE_XOR
:
3568 return (!(integer_type_p (type0
) && integer_type_p (type1
)));
3571 case BINOP_NOTEQUAL
:
3576 return (!(scalar_type_p (type0
) && scalar_type_p (type1
)));
3579 return !ada_is_array_type (type0
) || !ada_is_array_type (type1
);
3582 return (!(numeric_type_p (type0
) && integer_type_p (type1
)));
3586 case UNOP_LOGICAL_NOT
:
3588 return (!numeric_type_p (type0
));
3597 1. In the following, we assume that a renaming type's name may
3598 have an ___XD suffix. It would be nice if this went away at some
3600 2. We handle both the (old) purely type-based representation of
3601 renamings and the (new) variable-based encoding. At some point,
3602 it is devoutly to be hoped that the former goes away
3603 (FIXME: hilfinger-2007-07-09).
3604 3. Subprogram renamings are not implemented, although the XRS
3605 suffix is recognized (FIXME: hilfinger-2007-07-09). */
3607 /* If SYM encodes a renaming,
3609 <renaming> renames <renamed entity>,
3611 sets *LEN to the length of the renamed entity's name,
3612 *RENAMED_ENTITY to that name (not null-terminated), and *RENAMING_EXPR to
3613 the string describing the subcomponent selected from the renamed
3614 entity. Returns ADA_NOT_RENAMING if SYM does not encode a renaming
3615 (in which case, the values of *RENAMED_ENTITY, *LEN, and *RENAMING_EXPR
3616 are undefined). Otherwise, returns a value indicating the category
3617 of entity renamed: an object (ADA_OBJECT_RENAMING), exception
3618 (ADA_EXCEPTION_RENAMING), package (ADA_PACKAGE_RENAMING), or
3619 subprogram (ADA_SUBPROGRAM_RENAMING). Does no allocation; the
3620 strings returned in *RENAMED_ENTITY and *RENAMING_EXPR should not be
3621 deallocated. The values of RENAMED_ENTITY, LEN, or RENAMING_EXPR
3622 may be NULL, in which case they are not assigned.
3624 [Currently, however, GCC does not generate subprogram renamings.] */
3626 enum ada_renaming_category
3627 ada_parse_renaming (struct symbol
*sym
,
3628 const char **renamed_entity
, int *len
,
3629 const char **renaming_expr
)
3631 enum ada_renaming_category kind
;
3636 return ADA_NOT_RENAMING
;
3637 switch (SYMBOL_CLASS (sym
))
3640 return ADA_NOT_RENAMING
;
3642 return parse_old_style_renaming (SYMBOL_TYPE (sym
),
3643 renamed_entity
, len
, renaming_expr
);
3647 case LOC_OPTIMIZED_OUT
:
3648 info
= strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR");
3650 return ADA_NOT_RENAMING
;
3654 kind
= ADA_OBJECT_RENAMING
;
3658 kind
= ADA_EXCEPTION_RENAMING
;
3662 kind
= ADA_PACKAGE_RENAMING
;
3666 kind
= ADA_SUBPROGRAM_RENAMING
;
3670 return ADA_NOT_RENAMING
;
3674 if (renamed_entity
!= NULL
)
3675 *renamed_entity
= info
;
3676 suffix
= strstr (info
, "___XE");
3677 if (suffix
== NULL
|| suffix
== info
)
3678 return ADA_NOT_RENAMING
;
3680 *len
= strlen (info
) - strlen (suffix
);
3682 if (renaming_expr
!= NULL
)
3683 *renaming_expr
= suffix
;
3687 /* Assuming TYPE encodes a renaming according to the old encoding in
3688 exp_dbug.ads, returns details of that renaming in *RENAMED_ENTITY,
3689 *LEN, and *RENAMING_EXPR, as for ada_parse_renaming, above. Returns
3690 ADA_NOT_RENAMING otherwise. */
3691 static enum ada_renaming_category
3692 parse_old_style_renaming (struct type
*type
,
3693 const char **renamed_entity
, int *len
,
3694 const char **renaming_expr
)
3696 enum ada_renaming_category kind
;
3701 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
3702 || TYPE_NFIELDS (type
) != 1)
3703 return ADA_NOT_RENAMING
;
3705 name
= type_name_no_tag (type
);
3707 return ADA_NOT_RENAMING
;
3709 name
= strstr (name
, "___XR");
3711 return ADA_NOT_RENAMING
;
3716 kind
= ADA_OBJECT_RENAMING
;
3719 kind
= ADA_EXCEPTION_RENAMING
;
3722 kind
= ADA_PACKAGE_RENAMING
;
3725 kind
= ADA_SUBPROGRAM_RENAMING
;
3728 return ADA_NOT_RENAMING
;
3731 info
= TYPE_FIELD_NAME (type
, 0);
3733 return ADA_NOT_RENAMING
;
3734 if (renamed_entity
!= NULL
)
3735 *renamed_entity
= info
;
3736 suffix
= strstr (info
, "___XE");
3737 if (renaming_expr
!= NULL
)
3738 *renaming_expr
= suffix
+ 5;
3739 if (suffix
== NULL
|| suffix
== info
)
3740 return ADA_NOT_RENAMING
;
3742 *len
= suffix
- info
;
3748 /* Evaluation: Function Calls */
3750 /* Return an lvalue containing the value VAL. This is the identity on
3751 lvalues, and otherwise has the side-effect of pushing a copy of VAL
3752 on the stack, using and updating *SP as the stack pointer, and
3753 returning an lvalue whose VALUE_ADDRESS points to the copy. */
3755 static struct value
*
3756 ensure_lval (struct value
*val
, CORE_ADDR
*sp
)
3758 if (! VALUE_LVAL (val
))
3760 int len
= TYPE_LENGTH (ada_check_typedef (value_type (val
)));
3762 /* The following is taken from the structure-return code in
3763 call_function_by_hand. FIXME: Therefore, some refactoring seems
3765 if (gdbarch_inner_than (current_gdbarch
, 1, 2))
3767 /* Stack grows downward. Align SP and VALUE_ADDRESS (val) after
3768 reserving sufficient space. */
3770 if (gdbarch_frame_align_p (current_gdbarch
))
3771 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3772 VALUE_ADDRESS (val
) = *sp
;
3776 /* Stack grows upward. Align the frame, allocate space, and
3777 then again, re-align the frame. */
3778 if (gdbarch_frame_align_p (current_gdbarch
))
3779 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3780 VALUE_ADDRESS (val
) = *sp
;
3782 if (gdbarch_frame_align_p (current_gdbarch
))
3783 *sp
= gdbarch_frame_align (current_gdbarch
, *sp
);
3785 VALUE_LVAL (val
) = lval_memory
;
3787 write_memory (VALUE_ADDRESS (val
), value_contents_raw (val
), len
);
3793 /* Return the value ACTUAL, converted to be an appropriate value for a
3794 formal of type FORMAL_TYPE. Use *SP as a stack pointer for
3795 allocating any necessary descriptors (fat pointers), or copies of
3796 values not residing in memory, updating it as needed. */
3799 ada_convert_actual (struct value
*actual
, struct type
*formal_type0
,
3802 struct type
*actual_type
= ada_check_typedef (value_type (actual
));
3803 struct type
*formal_type
= ada_check_typedef (formal_type0
);
3804 struct type
*formal_target
=
3805 TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3806 ? ada_check_typedef (TYPE_TARGET_TYPE (formal_type
)) : formal_type
;
3807 struct type
*actual_target
=
3808 TYPE_CODE (actual_type
) == TYPE_CODE_PTR
3809 ? ada_check_typedef (TYPE_TARGET_TYPE (actual_type
)) : actual_type
;
3811 if (ada_is_array_descriptor_type (formal_target
)
3812 && TYPE_CODE (actual_target
) == TYPE_CODE_ARRAY
)
3813 return make_array_descriptor (formal_type
, actual
, sp
);
3814 else if (TYPE_CODE (formal_type
) == TYPE_CODE_PTR
3815 || TYPE_CODE (formal_type
) == TYPE_CODE_REF
)
3817 struct value
*result
;
3818 if (TYPE_CODE (formal_target
) == TYPE_CODE_ARRAY
3819 && ada_is_array_descriptor_type (actual_target
))
3820 result
= desc_data (actual
);
3821 else if (TYPE_CODE (actual_type
) != TYPE_CODE_PTR
)
3823 if (VALUE_LVAL (actual
) != lval_memory
)
3826 actual_type
= ada_check_typedef (value_type (actual
));
3827 val
= allocate_value (actual_type
);
3828 memcpy ((char *) value_contents_raw (val
),
3829 (char *) value_contents (actual
),
3830 TYPE_LENGTH (actual_type
));
3831 actual
= ensure_lval (val
, sp
);
3833 result
= value_addr (actual
);
3837 return value_cast_pointers (formal_type
, result
);
3839 else if (TYPE_CODE (actual_type
) == TYPE_CODE_PTR
)
3840 return ada_value_ind (actual
);
3846 /* Push a descriptor of type TYPE for array value ARR on the stack at
3847 *SP, updating *SP to reflect the new descriptor. Return either
3848 an lvalue representing the new descriptor, or (if TYPE is a pointer-
3849 to-descriptor type rather than a descriptor type), a struct value *
3850 representing a pointer to this descriptor. */
3852 static struct value
*
3853 make_array_descriptor (struct type
*type
, struct value
*arr
, CORE_ADDR
*sp
)
3855 struct type
*bounds_type
= desc_bounds_type (type
);
3856 struct type
*desc_type
= desc_base_type (type
);
3857 struct value
*descriptor
= allocate_value (desc_type
);
3858 struct value
*bounds
= allocate_value (bounds_type
);
3861 for (i
= ada_array_arity (ada_check_typedef (value_type (arr
))); i
> 0; i
-= 1)
3863 modify_general_field (value_contents_writeable (bounds
),
3864 value_as_long (ada_array_bound (arr
, i
, 0)),
3865 desc_bound_bitpos (bounds_type
, i
, 0),
3866 desc_bound_bitsize (bounds_type
, i
, 0));
3867 modify_general_field (value_contents_writeable (bounds
),
3868 value_as_long (ada_array_bound (arr
, i
, 1)),
3869 desc_bound_bitpos (bounds_type
, i
, 1),
3870 desc_bound_bitsize (bounds_type
, i
, 1));
3873 bounds
= ensure_lval (bounds
, sp
);
3875 modify_general_field (value_contents_writeable (descriptor
),
3876 VALUE_ADDRESS (ensure_lval (arr
, sp
)),
3877 fat_pntr_data_bitpos (desc_type
),
3878 fat_pntr_data_bitsize (desc_type
));
3880 modify_general_field (value_contents_writeable (descriptor
),
3881 VALUE_ADDRESS (bounds
),
3882 fat_pntr_bounds_bitpos (desc_type
),
3883 fat_pntr_bounds_bitsize (desc_type
));
3885 descriptor
= ensure_lval (descriptor
, sp
);
3887 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
3888 return value_addr (descriptor
);
3893 /* Dummy definitions for an experimental caching module that is not
3894 * used in the public sources. */
3897 lookup_cached_symbol (const char *name
, domain_enum
namespace,
3898 struct symbol
**sym
, struct block
**block
)
3904 cache_symbol (const char *name
, domain_enum
namespace, struct symbol
*sym
,
3905 struct block
*block
)
3911 /* Return the result of a standard (literal, C-like) lookup of NAME in
3912 given DOMAIN, visible from lexical block BLOCK. */
3914 static struct symbol
*
3915 standard_lookup (const char *name
, const struct block
*block
,
3920 if (lookup_cached_symbol (name
, domain
, &sym
, NULL
))
3922 sym
= lookup_symbol_in_language (name
, block
, domain
, language_c
, 0);
3923 cache_symbol (name
, domain
, sym
, block_found
);
3928 /* Non-zero iff there is at least one non-function/non-enumeral symbol
3929 in the symbol fields of SYMS[0..N-1]. We treat enumerals as functions,
3930 since they contend in overloading in the same way. */
3932 is_nonfunction (struct ada_symbol_info syms
[], int n
)
3936 for (i
= 0; i
< n
; i
+= 1)
3937 if (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_FUNC
3938 && (TYPE_CODE (SYMBOL_TYPE (syms
[i
].sym
)) != TYPE_CODE_ENUM
3939 || SYMBOL_CLASS (syms
[i
].sym
) != LOC_CONST
))
3945 /* If true (non-zero), then TYPE0 and TYPE1 represent equivalent
3946 struct types. Otherwise, they may not. */
3949 equiv_types (struct type
*type0
, struct type
*type1
)
3953 if (type0
== NULL
|| type1
== NULL
3954 || TYPE_CODE (type0
) != TYPE_CODE (type1
))
3956 if ((TYPE_CODE (type0
) == TYPE_CODE_STRUCT
3957 || TYPE_CODE (type0
) == TYPE_CODE_ENUM
)
3958 && ada_type_name (type0
) != NULL
&& ada_type_name (type1
) != NULL
3959 && strcmp (ada_type_name (type0
), ada_type_name (type1
)) == 0)
3965 /* True iff SYM0 represents the same entity as SYM1, or one that is
3966 no more defined than that of SYM1. */
3969 lesseq_defined_than (struct symbol
*sym0
, struct symbol
*sym1
)
3973 if (SYMBOL_DOMAIN (sym0
) != SYMBOL_DOMAIN (sym1
)
3974 || SYMBOL_CLASS (sym0
) != SYMBOL_CLASS (sym1
))
3977 switch (SYMBOL_CLASS (sym0
))
3983 struct type
*type0
= SYMBOL_TYPE (sym0
);
3984 struct type
*type1
= SYMBOL_TYPE (sym1
);
3985 char *name0
= SYMBOL_LINKAGE_NAME (sym0
);
3986 char *name1
= SYMBOL_LINKAGE_NAME (sym1
);
3987 int len0
= strlen (name0
);
3989 TYPE_CODE (type0
) == TYPE_CODE (type1
)
3990 && (equiv_types (type0
, type1
)
3991 || (len0
< strlen (name1
) && strncmp (name0
, name1
, len0
) == 0
3992 && strncmp (name1
+ len0
, "___XV", 5) == 0));
3995 return SYMBOL_VALUE (sym0
) == SYMBOL_VALUE (sym1
)
3996 && equiv_types (SYMBOL_TYPE (sym0
), SYMBOL_TYPE (sym1
));
4002 /* Append (SYM,BLOCK,SYMTAB) to the end of the array of struct ada_symbol_info
4003 records in OBSTACKP. Do nothing if SYM is a duplicate. */
4006 add_defn_to_vec (struct obstack
*obstackp
,
4008 struct block
*block
)
4012 struct ada_symbol_info
*prevDefns
= defns_collected (obstackp
, 0);
4014 /* Do not try to complete stub types, as the debugger is probably
4015 already scanning all symbols matching a certain name at the
4016 time when this function is called. Trying to replace the stub
4017 type by its associated full type will cause us to restart a scan
4018 which may lead to an infinite recursion. Instead, the client
4019 collecting the matching symbols will end up collecting several
4020 matches, with at least one of them complete. It can then filter
4021 out the stub ones if needed. */
4023 for (i
= num_defns_collected (obstackp
) - 1; i
>= 0; i
-= 1)
4025 if (lesseq_defined_than (sym
, prevDefns
[i
].sym
))
4027 else if (lesseq_defined_than (prevDefns
[i
].sym
, sym
))
4029 prevDefns
[i
].sym
= sym
;
4030 prevDefns
[i
].block
= block
;
4036 struct ada_symbol_info info
;
4040 obstack_grow (obstackp
, &info
, sizeof (struct ada_symbol_info
));
4044 /* Number of ada_symbol_info structures currently collected in
4045 current vector in *OBSTACKP. */
4048 num_defns_collected (struct obstack
*obstackp
)
4050 return obstack_object_size (obstackp
) / sizeof (struct ada_symbol_info
);
4053 /* Vector of ada_symbol_info structures currently collected in current
4054 vector in *OBSTACKP. If FINISH, close off the vector and return
4055 its final address. */
4057 static struct ada_symbol_info
*
4058 defns_collected (struct obstack
*obstackp
, int finish
)
4061 return obstack_finish (obstackp
);
4063 return (struct ada_symbol_info
*) obstack_base (obstackp
);
4066 /* Look, in partial_symtab PST, for symbol NAME in given namespace.
4067 Check the global symbols if GLOBAL, the static symbols if not.
4068 Do wild-card match if WILD. */
4070 static struct partial_symbol
*
4071 ada_lookup_partial_symbol (struct partial_symtab
*pst
, const char *name
,
4072 int global
, domain_enum
namespace, int wild
)
4074 struct partial_symbol
**start
;
4075 int name_len
= strlen (name
);
4076 int length
= (global
? pst
->n_global_syms
: pst
->n_static_syms
);
4085 pst
->objfile
->global_psymbols
.list
+ pst
->globals_offset
:
4086 pst
->objfile
->static_psymbols
.list
+ pst
->statics_offset
);
4090 for (i
= 0; i
< length
; i
+= 1)
4092 struct partial_symbol
*psym
= start
[i
];
4094 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4095 SYMBOL_DOMAIN (psym
), namespace)
4096 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (psym
)))
4110 int M
= (U
+ i
) >> 1;
4111 struct partial_symbol
*psym
= start
[M
];
4112 if (SYMBOL_LINKAGE_NAME (psym
)[0] < name
[0])
4114 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > name
[0])
4116 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), name
) < 0)
4127 struct partial_symbol
*psym
= start
[i
];
4129 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4130 SYMBOL_DOMAIN (psym
), namespace))
4132 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
), name_len
);
4140 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4154 int M
= (U
+ i
) >> 1;
4155 struct partial_symbol
*psym
= start
[M
];
4156 if (SYMBOL_LINKAGE_NAME (psym
)[0] < '_')
4158 else if (SYMBOL_LINKAGE_NAME (psym
)[0] > '_')
4160 else if (strcmp (SYMBOL_LINKAGE_NAME (psym
), "_ada_") < 0)
4171 struct partial_symbol
*psym
= start
[i
];
4173 if (symbol_matches_domain (SYMBOL_LANGUAGE (psym
),
4174 SYMBOL_DOMAIN (psym
), namespace))
4178 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (psym
)[0];
4181 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (psym
), 5);
4183 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (psym
) + 5,
4193 && is_name_suffix (SYMBOL_LINKAGE_NAME (psym
)
4203 /* Return a minimal symbol matching NAME according to Ada decoding
4204 rules. Returns NULL if there is no such minimal symbol. Names
4205 prefixed with "standard__" are handled specially: "standard__" is
4206 first stripped off, and only static and global symbols are searched. */
4208 struct minimal_symbol
*
4209 ada_lookup_simple_minsym (const char *name
)
4211 struct objfile
*objfile
;
4212 struct minimal_symbol
*msymbol
;
4215 if (strncmp (name
, "standard__", sizeof ("standard__") - 1) == 0)
4217 name
+= sizeof ("standard__") - 1;
4221 wild_match
= (strstr (name
, "__") == NULL
);
4223 ALL_MSYMBOLS (objfile
, msymbol
)
4225 if (ada_match_name (SYMBOL_LINKAGE_NAME (msymbol
), name
, wild_match
)
4226 && MSYMBOL_TYPE (msymbol
) != mst_solib_trampoline
)
4233 /* For all subprograms that statically enclose the subprogram of the
4234 selected frame, add symbols matching identifier NAME in DOMAIN
4235 and their blocks to the list of data in OBSTACKP, as for
4236 ada_add_block_symbols (q.v.). If WILD, treat as NAME with a
4240 add_symbols_from_enclosing_procs (struct obstack
*obstackp
,
4241 const char *name
, domain_enum
namespace,
4246 /* True if TYPE is definitely an artificial type supplied to a symbol
4247 for which no debugging information was given in the symbol file. */
4250 is_nondebugging_type (struct type
*type
)
4252 char *name
= ada_type_name (type
);
4253 return (name
!= NULL
&& strcmp (name
, "<variable, no debug info>") == 0);
4256 /* Remove any non-debugging symbols in SYMS[0 .. NSYMS-1] that definitely
4257 duplicate other symbols in the list (The only case I know of where
4258 this happens is when object files containing stabs-in-ecoff are
4259 linked with files containing ordinary ecoff debugging symbols (or no
4260 debugging symbols)). Modifies SYMS to squeeze out deleted entries.
4261 Returns the number of items in the modified list. */
4264 remove_extra_symbols (struct ada_symbol_info
*syms
, int nsyms
)
4273 /* If two symbols have the same name and one of them is a stub type,
4274 the get rid of the stub. */
4276 if (TYPE_STUB (SYMBOL_TYPE (syms
[i
].sym
))
4277 && SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
)
4279 for (j
= 0; j
< nsyms
; j
++)
4282 && !TYPE_STUB (SYMBOL_TYPE (syms
[j
].sym
))
4283 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4284 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4285 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0)
4290 /* Two symbols with the same name, same class and same address
4291 should be identical. */
4293 else if (SYMBOL_LINKAGE_NAME (syms
[i
].sym
) != NULL
4294 && SYMBOL_CLASS (syms
[i
].sym
) == LOC_STATIC
4295 && is_nondebugging_type (SYMBOL_TYPE (syms
[i
].sym
)))
4297 for (j
= 0; j
< nsyms
; j
+= 1)
4300 && SYMBOL_LINKAGE_NAME (syms
[j
].sym
) != NULL
4301 && strcmp (SYMBOL_LINKAGE_NAME (syms
[i
].sym
),
4302 SYMBOL_LINKAGE_NAME (syms
[j
].sym
)) == 0
4303 && SYMBOL_CLASS (syms
[i
].sym
) == SYMBOL_CLASS (syms
[j
].sym
)
4304 && SYMBOL_VALUE_ADDRESS (syms
[i
].sym
)
4305 == SYMBOL_VALUE_ADDRESS (syms
[j
].sym
))
4312 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4313 syms
[j
- 1] = syms
[j
];
4322 /* Given a type that corresponds to a renaming entity, use the type name
4323 to extract the scope (package name or function name, fully qualified,
4324 and following the GNAT encoding convention) where this renaming has been
4325 defined. The string returned needs to be deallocated after use. */
4328 xget_renaming_scope (struct type
*renaming_type
)
4330 /* The renaming types adhere to the following convention:
4331 <scope>__<rename>___<XR extension>.
4332 So, to extract the scope, we search for the "___XR" extension,
4333 and then backtrack until we find the first "__". */
4335 const char *name
= type_name_no_tag (renaming_type
);
4336 char *suffix
= strstr (name
, "___XR");
4341 /* Now, backtrack a bit until we find the first "__". Start looking
4342 at suffix - 3, as the <rename> part is at least one character long. */
4344 for (last
= suffix
- 3; last
> name
; last
--)
4345 if (last
[0] == '_' && last
[1] == '_')
4348 /* Make a copy of scope and return it. */
4350 scope_len
= last
- name
;
4351 scope
= (char *) xmalloc ((scope_len
+ 1) * sizeof (char));
4353 strncpy (scope
, name
, scope_len
);
4354 scope
[scope_len
] = '\0';
4359 /* Return nonzero if NAME corresponds to a package name. */
4362 is_package_name (const char *name
)
4364 /* Here, We take advantage of the fact that no symbols are generated
4365 for packages, while symbols are generated for each function.
4366 So the condition for NAME represent a package becomes equivalent
4367 to NAME not existing in our list of symbols. There is only one
4368 small complication with library-level functions (see below). */
4372 /* If it is a function that has not been defined at library level,
4373 then we should be able to look it up in the symbols. */
4374 if (standard_lookup (name
, NULL
, VAR_DOMAIN
) != NULL
)
4377 /* Library-level function names start with "_ada_". See if function
4378 "_ada_" followed by NAME can be found. */
4380 /* Do a quick check that NAME does not contain "__", since library-level
4381 functions names cannot contain "__" in them. */
4382 if (strstr (name
, "__") != NULL
)
4385 fun_name
= xstrprintf ("_ada_%s", name
);
4387 return (standard_lookup (fun_name
, NULL
, VAR_DOMAIN
) == NULL
);
4390 /* Return nonzero if SYM corresponds to a renaming entity that is
4391 not visible from FUNCTION_NAME. */
4394 old_renaming_is_invisible (const struct symbol
*sym
, char *function_name
)
4398 if (SYMBOL_CLASS (sym
) != LOC_TYPEDEF
)
4401 scope
= xget_renaming_scope (SYMBOL_TYPE (sym
));
4403 make_cleanup (xfree
, scope
);
4405 /* If the rename has been defined in a package, then it is visible. */
4406 if (is_package_name (scope
))
4409 /* Check that the rename is in the current function scope by checking
4410 that its name starts with SCOPE. */
4412 /* If the function name starts with "_ada_", it means that it is
4413 a library-level function. Strip this prefix before doing the
4414 comparison, as the encoding for the renaming does not contain
4416 if (strncmp (function_name
, "_ada_", 5) == 0)
4419 return (strncmp (function_name
, scope
, strlen (scope
)) != 0);
4422 /* Remove entries from SYMS that corresponds to a renaming entity that
4423 is not visible from the function associated with CURRENT_BLOCK or
4424 that is superfluous due to the presence of more specific renaming
4425 information. Places surviving symbols in the initial entries of
4426 SYMS and returns the number of surviving symbols.
4429 First, in cases where an object renaming is implemented as a
4430 reference variable, GNAT may produce both the actual reference
4431 variable and the renaming encoding. In this case, we discard the
4434 Second, GNAT emits a type following a specified encoding for each renaming
4435 entity. Unfortunately, STABS currently does not support the definition
4436 of types that are local to a given lexical block, so all renamings types
4437 are emitted at library level. As a consequence, if an application
4438 contains two renaming entities using the same name, and a user tries to
4439 print the value of one of these entities, the result of the ada symbol
4440 lookup will also contain the wrong renaming type.
4442 This function partially covers for this limitation by attempting to
4443 remove from the SYMS list renaming symbols that should be visible
4444 from CURRENT_BLOCK. However, there does not seem be a 100% reliable
4445 method with the current information available. The implementation
4446 below has a couple of limitations (FIXME: brobecker-2003-05-12):
4448 - When the user tries to print a rename in a function while there
4449 is another rename entity defined in a package: Normally, the
4450 rename in the function has precedence over the rename in the
4451 package, so the latter should be removed from the list. This is
4452 currently not the case.
4454 - This function will incorrectly remove valid renames if
4455 the CURRENT_BLOCK corresponds to a function which symbol name
4456 has been changed by an "Export" pragma. As a consequence,
4457 the user will be unable to print such rename entities. */
4460 remove_irrelevant_renamings (struct ada_symbol_info
*syms
,
4461 int nsyms
, const struct block
*current_block
)
4463 struct symbol
*current_function
;
4464 char *current_function_name
;
4466 int is_new_style_renaming
;
4468 /* If there is both a renaming foo___XR... encoded as a variable and
4469 a simple variable foo in the same block, discard the latter.
4470 First, zero out such symbols, then compress. */
4471 is_new_style_renaming
= 0;
4472 for (i
= 0; i
< nsyms
; i
+= 1)
4474 struct symbol
*sym
= syms
[i
].sym
;
4475 struct block
*block
= syms
[i
].block
;
4479 if (sym
== NULL
|| SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
4481 name
= SYMBOL_LINKAGE_NAME (sym
);
4482 suffix
= strstr (name
, "___XR");
4486 int name_len
= suffix
- name
;
4488 is_new_style_renaming
= 1;
4489 for (j
= 0; j
< nsyms
; j
+= 1)
4490 if (i
!= j
&& syms
[j
].sym
!= NULL
4491 && strncmp (name
, SYMBOL_LINKAGE_NAME (syms
[j
].sym
),
4493 && block
== syms
[j
].block
)
4497 if (is_new_style_renaming
)
4501 for (j
= k
= 0; j
< nsyms
; j
+= 1)
4502 if (syms
[j
].sym
!= NULL
)
4510 /* Extract the function name associated to CURRENT_BLOCK.
4511 Abort if unable to do so. */
4513 if (current_block
== NULL
)
4516 current_function
= block_linkage_function (current_block
);
4517 if (current_function
== NULL
)
4520 current_function_name
= SYMBOL_LINKAGE_NAME (current_function
);
4521 if (current_function_name
== NULL
)
4524 /* Check each of the symbols, and remove it from the list if it is
4525 a type corresponding to a renaming that is out of the scope of
4526 the current block. */
4531 if (ada_parse_renaming (syms
[i
].sym
, NULL
, NULL
, NULL
)
4532 == ADA_OBJECT_RENAMING
4533 && old_renaming_is_invisible (syms
[i
].sym
, current_function_name
))
4536 for (j
= i
+ 1; j
< nsyms
; j
+= 1)
4537 syms
[j
- 1] = syms
[j
];
4547 /* Add to OBSTACKP all symbols from BLOCK (and its super-blocks)
4548 whose name and domain match NAME and DOMAIN respectively.
4549 If no match was found, then extend the search to "enclosing"
4550 routines (in other words, if we're inside a nested function,
4551 search the symbols defined inside the enclosing functions).
4553 Note: This function assumes that OBSTACKP has 0 (zero) element in it. */
4556 ada_add_local_symbols (struct obstack
*obstackp
, const char *name
,
4557 struct block
*block
, domain_enum domain
,
4560 int block_depth
= 0;
4562 while (block
!= NULL
)
4565 ada_add_block_symbols (obstackp
, block
, name
, domain
, NULL
, wild_match
);
4567 /* If we found a non-function match, assume that's the one. */
4568 if (is_nonfunction (defns_collected (obstackp
, 0),
4569 num_defns_collected (obstackp
)))
4572 block
= BLOCK_SUPERBLOCK (block
);
4575 /* If no luck so far, try to find NAME as a local symbol in some lexically
4576 enclosing subprogram. */
4577 if (num_defns_collected (obstackp
) == 0 && block_depth
> 2)
4578 add_symbols_from_enclosing_procs (obstackp
, name
, domain
, wild_match
);
4581 /* Add to OBSTACKP all non-local symbols whose name and domain match
4582 NAME and DOMAIN respectively. The search is performed on GLOBAL_BLOCK
4583 symbols if GLOBAL is non-zero, or on STATIC_BLOCK symbols otherwise. */
4586 ada_add_non_local_symbols (struct obstack
*obstackp
, const char *name
,
4587 domain_enum domain
, int global
,
4590 struct objfile
*objfile
;
4591 struct partial_symtab
*ps
;
4593 ALL_PSYMTABS (objfile
, ps
)
4597 || ada_lookup_partial_symbol (ps
, name
, global
, domain
, wild_match
))
4599 struct symtab
*s
= PSYMTAB_TO_SYMTAB (ps
);
4600 const int block_kind
= global
? GLOBAL_BLOCK
: STATIC_BLOCK
;
4602 if (s
== NULL
|| !s
->primary
)
4604 ada_add_block_symbols (obstackp
,
4605 BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), block_kind
),
4606 name
, domain
, objfile
, wild_match
);
4611 /* Find symbols in DOMAIN matching NAME0, in BLOCK0 and enclosing
4612 scope and in global scopes, returning the number of matches. Sets
4613 *RESULTS to point to a vector of (SYM,BLOCK) tuples,
4614 indicating the symbols found and the blocks and symbol tables (if
4615 any) in which they were found. This vector are transient---good only to
4616 the next call of ada_lookup_symbol_list. Any non-function/non-enumeral
4617 symbol match within the nest of blocks whose innermost member is BLOCK0,
4618 is the one match returned (no other matches in that or
4619 enclosing blocks is returned). If there are any matches in or
4620 surrounding BLOCK0, then these alone are returned. Otherwise, the
4621 search extends to global and file-scope (static) symbol tables.
4622 Names prefixed with "standard__" are handled specially: "standard__"
4623 is first stripped off, and only static and global symbols are searched. */
4626 ada_lookup_symbol_list (const char *name0
, const struct block
*block0
,
4627 domain_enum
namespace,
4628 struct ada_symbol_info
**results
)
4631 struct block
*block
;
4637 obstack_free (&symbol_list_obstack
, NULL
);
4638 obstack_init (&symbol_list_obstack
);
4642 /* Search specified block and its superiors. */
4644 wild_match
= (strstr (name0
, "__") == NULL
);
4646 block
= (struct block
*) block0
; /* FIXME: No cast ought to be
4647 needed, but adding const will
4648 have a cascade effect. */
4650 /* Special case: If the user specifies a symbol name inside package
4651 Standard, do a non-wild matching of the symbol name without
4652 the "standard__" prefix. This was primarily introduced in order
4653 to allow the user to specifically access the standard exceptions
4654 using, for instance, Standard.Constraint_Error when Constraint_Error
4655 is ambiguous (due to the user defining its own Constraint_Error
4656 entity inside its program). */
4657 if (strncmp (name0
, "standard__", sizeof ("standard__") - 1) == 0)
4661 name
= name0
+ sizeof ("standard__") - 1;
4664 /* Check the non-global symbols. If we have ANY match, then we're done. */
4666 ada_add_local_symbols (&symbol_list_obstack
, name
, block
, namespace,
4668 if (num_defns_collected (&symbol_list_obstack
) > 0)
4671 /* No non-global symbols found. Check our cache to see if we have
4672 already performed this search before. If we have, then return
4676 if (lookup_cached_symbol (name0
, namespace, &sym
, &block
))
4679 add_defn_to_vec (&symbol_list_obstack
, sym
, block
);
4683 /* Search symbols from all global blocks. */
4685 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 1,
4688 /* Now add symbols from all per-file blocks if we've gotten no hits
4689 (not strictly correct, but perhaps better than an error). */
4691 if (num_defns_collected (&symbol_list_obstack
) == 0)
4692 ada_add_non_local_symbols (&symbol_list_obstack
, name
, namespace, 0,
4696 ndefns
= num_defns_collected (&symbol_list_obstack
);
4697 *results
= defns_collected (&symbol_list_obstack
, 1);
4699 ndefns
= remove_extra_symbols (*results
, ndefns
);
4702 cache_symbol (name0
, namespace, NULL
, NULL
);
4704 if (ndefns
== 1 && cacheIfUnique
)
4705 cache_symbol (name0
, namespace, (*results
)[0].sym
, (*results
)[0].block
);
4707 ndefns
= remove_irrelevant_renamings (*results
, ndefns
, block0
);
4713 ada_lookup_encoded_symbol (const char *name
, const struct block
*block0
,
4714 domain_enum
namespace, struct block
**block_found
)
4716 struct ada_symbol_info
*candidates
;
4719 n_candidates
= ada_lookup_symbol_list (name
, block0
, namespace, &candidates
);
4721 if (n_candidates
== 0)
4724 if (block_found
!= NULL
)
4725 *block_found
= candidates
[0].block
;
4727 return fixup_symbol_section (candidates
[0].sym
, NULL
);
4730 /* Return a symbol in DOMAIN matching NAME, in BLOCK0 and enclosing
4731 scope and in global scopes, or NULL if none. NAME is folded and
4732 encoded first. Otherwise, the result is as for ada_lookup_symbol_list,
4733 choosing the first symbol if there are multiple choices.
4734 *IS_A_FIELD_OF_THIS is set to 0 and *SYMTAB is set to the symbol
4735 table in which the symbol was found (in both cases, these
4736 assignments occur only if the pointers are non-null). */
4738 ada_lookup_symbol (const char *name
, const struct block
*block0
,
4739 domain_enum
namespace, int *is_a_field_of_this
)
4741 if (is_a_field_of_this
!= NULL
)
4742 *is_a_field_of_this
= 0;
4745 ada_lookup_encoded_symbol (ada_encode (ada_fold_name (name
)),
4746 block0
, namespace, NULL
);
4749 static struct symbol
*
4750 ada_lookup_symbol_nonlocal (const char *name
,
4751 const char *linkage_name
,
4752 const struct block
*block
,
4753 const domain_enum domain
)
4755 if (linkage_name
== NULL
)
4756 linkage_name
= name
;
4757 return ada_lookup_symbol (linkage_name
, block_static_block (block
), domain
,
4762 /* True iff STR is a possible encoded suffix of a normal Ada name
4763 that is to be ignored for matching purposes. Suffixes of parallel
4764 names (e.g., XVE) are not included here. Currently, the possible suffixes
4765 are given by any of the regular expressions:
4767 [.$][0-9]+ [nested subprogram suffix, on platforms such as GNU/Linux]
4768 ___[0-9]+ [nested subprogram suffix, on platforms such as HP/UX]
4769 _E[0-9]+[bs]$ [protected object entry suffixes]
4770 (X[nb]*)?((\$|__)[0-9](_?[0-9]+)|___(JM|LJM|X([FDBUP].*|R[^T]?)))?$
4772 Also, any leading "__[0-9]+" sequence is skipped before the suffix
4773 match is performed. This sequence is used to differentiate homonyms,
4774 is an optional part of a valid name suffix. */
4777 is_name_suffix (const char *str
)
4780 const char *matching
;
4781 const int len
= strlen (str
);
4783 /* Skip optional leading __[0-9]+. */
4785 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && isdigit (str
[2]))
4788 while (isdigit (str
[0]))
4794 if (str
[0] == '.' || str
[0] == '$')
4797 while (isdigit (matching
[0]))
4799 if (matching
[0] == '\0')
4805 if (len
> 3 && str
[0] == '_' && str
[1] == '_' && str
[2] == '_')
4808 while (isdigit (matching
[0]))
4810 if (matching
[0] == '\0')
4815 /* FIXME: brobecker/2005-09-23: Protected Object subprograms end
4816 with a N at the end. Unfortunately, the compiler uses the same
4817 convention for other internal types it creates. So treating
4818 all entity names that end with an "N" as a name suffix causes
4819 some regressions. For instance, consider the case of an enumerated
4820 type. To support the 'Image attribute, it creates an array whose
4822 Having a single character like this as a suffix carrying some
4823 information is a bit risky. Perhaps we should change the encoding
4824 to be something like "_N" instead. In the meantime, do not do
4825 the following check. */
4826 /* Protected Object Subprograms */
4827 if (len
== 1 && str
[0] == 'N')
4832 if (len
> 3 && str
[0] == '_' && str
[1] == 'E' && isdigit (str
[2]))
4835 while (isdigit (matching
[0]))
4837 if ((matching
[0] == 'b' || matching
[0] == 's')
4838 && matching
[1] == '\0')
4842 /* ??? We should not modify STR directly, as we are doing below. This
4843 is fine in this case, but may become problematic later if we find
4844 that this alternative did not work, and want to try matching
4845 another one from the begining of STR. Since we modified it, we
4846 won't be able to find the begining of the string anymore! */
4850 while (str
[0] != '_' && str
[0] != '\0')
4852 if (str
[0] != 'n' && str
[0] != 'b')
4858 if (str
[0] == '\000')
4863 if (str
[1] != '_' || str
[2] == '\000')
4867 if (strcmp (str
+ 3, "JM") == 0)
4869 /* FIXME: brobecker/2004-09-30: GNAT will soon stop using
4870 the LJM suffix in favor of the JM one. But we will
4871 still accept LJM as a valid suffix for a reasonable
4872 amount of time, just to allow ourselves to debug programs
4873 compiled using an older version of GNAT. */
4874 if (strcmp (str
+ 3, "LJM") == 0)
4878 if (str
[4] == 'F' || str
[4] == 'D' || str
[4] == 'B'
4879 || str
[4] == 'U' || str
[4] == 'P')
4881 if (str
[4] == 'R' && str
[5] != 'T')
4885 if (!isdigit (str
[2]))
4887 for (k
= 3; str
[k
] != '\0'; k
+= 1)
4888 if (!isdigit (str
[k
]) && str
[k
] != '_')
4892 if (str
[0] == '$' && isdigit (str
[1]))
4894 for (k
= 2; str
[k
] != '\0'; k
+= 1)
4895 if (!isdigit (str
[k
]) && str
[k
] != '_')
4902 /* Return non-zero if the string starting at NAME and ending before
4903 NAME_END contains no capital letters. */
4906 is_valid_name_for_wild_match (const char *name0
)
4908 const char *decoded_name
= ada_decode (name0
);
4911 /* If the decoded name starts with an angle bracket, it means that
4912 NAME0 does not follow the GNAT encoding format. It should then
4913 not be allowed as a possible wild match. */
4914 if (decoded_name
[0] == '<')
4917 for (i
=0; decoded_name
[i
] != '\0'; i
++)
4918 if (isalpha (decoded_name
[i
]) && !islower (decoded_name
[i
]))
4924 /* True if NAME represents a name of the form A1.A2....An, n>=1 and
4925 PATN[0..PATN_LEN-1] = Ak.Ak+1.....An for some k >= 1. Ignores
4926 informational suffixes of NAME (i.e., for which is_name_suffix is
4930 wild_match (const char *patn0
, int patn_len
, const char *name0
)
4937 match
= strstr (start
, patn0
);
4942 || (match
> name0
+ 1 && match
[-1] == '_' && match
[-2] == '_')
4943 || (match
== name0
+ 5 && strncmp ("_ada_", name0
, 5) == 0))
4944 && is_name_suffix (match
+ patn_len
))
4945 return (match
== name0
|| is_valid_name_for_wild_match (name0
));
4950 /* Add symbols from BLOCK matching identifier NAME in DOMAIN to
4951 vector *defn_symbols, updating the list of symbols in OBSTACKP
4952 (if necessary). If WILD, treat as NAME with a wildcard prefix.
4953 OBJFILE is the section containing BLOCK.
4954 SYMTAB is recorded with each symbol added. */
4957 ada_add_block_symbols (struct obstack
*obstackp
,
4958 struct block
*block
, const char *name
,
4959 domain_enum domain
, struct objfile
*objfile
,
4962 struct dict_iterator iter
;
4963 int name_len
= strlen (name
);
4964 /* A matching argument symbol, if any. */
4965 struct symbol
*arg_sym
;
4966 /* Set true when we find a matching non-argument symbol. */
4975 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4977 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
4978 SYMBOL_DOMAIN (sym
), domain
)
4979 && wild_match (name
, name_len
, SYMBOL_LINKAGE_NAME (sym
)))
4981 if (SYMBOL_CLASS (sym
) == LOC_UNRESOLVED
)
4983 else if (SYMBOL_IS_ARGUMENT (sym
))
4988 add_defn_to_vec (obstackp
,
4989 fixup_symbol_section (sym
, objfile
),
4997 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
4999 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5000 SYMBOL_DOMAIN (sym
), domain
))
5002 int cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
), name_len
);
5004 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
))
5006 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5008 if (SYMBOL_IS_ARGUMENT (sym
))
5013 add_defn_to_vec (obstackp
,
5014 fixup_symbol_section (sym
, objfile
),
5023 if (!found_sym
&& arg_sym
!= NULL
)
5025 add_defn_to_vec (obstackp
,
5026 fixup_symbol_section (arg_sym
, objfile
),
5035 ALL_BLOCK_SYMBOLS (block
, iter
, sym
)
5037 if (symbol_matches_domain (SYMBOL_LANGUAGE (sym
),
5038 SYMBOL_DOMAIN (sym
), domain
))
5042 cmp
= (int) '_' - (int) SYMBOL_LINKAGE_NAME (sym
)[0];
5045 cmp
= strncmp ("_ada_", SYMBOL_LINKAGE_NAME (sym
), 5);
5047 cmp
= strncmp (name
, SYMBOL_LINKAGE_NAME (sym
) + 5,
5052 && is_name_suffix (SYMBOL_LINKAGE_NAME (sym
) + name_len
+ 5))
5054 if (SYMBOL_CLASS (sym
) != LOC_UNRESOLVED
)
5056 if (SYMBOL_IS_ARGUMENT (sym
))
5061 add_defn_to_vec (obstackp
,
5062 fixup_symbol_section (sym
, objfile
),
5070 /* NOTE: This really shouldn't be needed for _ada_ symbols.
5071 They aren't parameters, right? */
5072 if (!found_sym
&& arg_sym
!= NULL
)
5074 add_defn_to_vec (obstackp
,
5075 fixup_symbol_section (arg_sym
, objfile
),
5082 /* Symbol Completion */
5084 /* If SYM_NAME is a completion candidate for TEXT, return this symbol
5085 name in a form that's appropriate for the completion. The result
5086 does not need to be deallocated, but is only good until the next call.
5088 TEXT_LEN is equal to the length of TEXT.
5089 Perform a wild match if WILD_MATCH is set.
5090 ENCODED should be set if TEXT represents the start of a symbol name
5091 in its encoded form. */
5094 symbol_completion_match (const char *sym_name
,
5095 const char *text
, int text_len
,
5096 int wild_match
, int encoded
)
5099 const int verbatim_match
= (text
[0] == '<');
5104 /* Strip the leading angle bracket. */
5109 /* First, test against the fully qualified name of the symbol. */
5111 if (strncmp (sym_name
, text
, text_len
) == 0)
5114 if (match
&& !encoded
)
5116 /* One needed check before declaring a positive match is to verify
5117 that iff we are doing a verbatim match, the decoded version
5118 of the symbol name starts with '<'. Otherwise, this symbol name
5119 is not a suitable completion. */
5120 const char *sym_name_copy
= sym_name
;
5121 int has_angle_bracket
;
5123 sym_name
= ada_decode (sym_name
);
5124 has_angle_bracket
= (sym_name
[0] == '<');
5125 match
= (has_angle_bracket
== verbatim_match
);
5126 sym_name
= sym_name_copy
;
5129 if (match
&& !verbatim_match
)
5131 /* When doing non-verbatim match, another check that needs to
5132 be done is to verify that the potentially matching symbol name
5133 does not include capital letters, because the ada-mode would
5134 not be able to understand these symbol names without the
5135 angle bracket notation. */
5138 for (tmp
= sym_name
; *tmp
!= '\0' && !isupper (*tmp
); tmp
++);
5143 /* Second: Try wild matching... */
5145 if (!match
&& wild_match
)
5147 /* Since we are doing wild matching, this means that TEXT
5148 may represent an unqualified symbol name. We therefore must
5149 also compare TEXT against the unqualified name of the symbol. */
5150 sym_name
= ada_unqualified_name (ada_decode (sym_name
));
5152 if (strncmp (sym_name
, text
, text_len
) == 0)
5156 /* Finally: If we found a mach, prepare the result to return. */
5162 sym_name
= add_angle_brackets (sym_name
);
5165 sym_name
= ada_decode (sym_name
);
5170 typedef char *char_ptr
;
5171 DEF_VEC_P (char_ptr
);
5173 /* A companion function to ada_make_symbol_completion_list().
5174 Check if SYM_NAME represents a symbol which name would be suitable
5175 to complete TEXT (TEXT_LEN is the length of TEXT), in which case
5176 it is appended at the end of the given string vector SV.
5178 ORIG_TEXT is the string original string from the user command
5179 that needs to be completed. WORD is the entire command on which
5180 completion should be performed. These two parameters are used to
5181 determine which part of the symbol name should be added to the
5183 if WILD_MATCH is set, then wild matching is performed.
5184 ENCODED should be set if TEXT represents a symbol name in its
5185 encoded formed (in which case the completion should also be
5189 symbol_completion_add (VEC(char_ptr
) **sv
,
5190 const char *sym_name
,
5191 const char *text
, int text_len
,
5192 const char *orig_text
, const char *word
,
5193 int wild_match
, int encoded
)
5195 const char *match
= symbol_completion_match (sym_name
, text
, text_len
,
5196 wild_match
, encoded
);
5202 /* We found a match, so add the appropriate completion to the given
5205 if (word
== orig_text
)
5207 completion
= xmalloc (strlen (match
) + 5);
5208 strcpy (completion
, match
);
5210 else if (word
> orig_text
)
5212 /* Return some portion of sym_name. */
5213 completion
= xmalloc (strlen (match
) + 5);
5214 strcpy (completion
, match
+ (word
- orig_text
));
5218 /* Return some of ORIG_TEXT plus sym_name. */
5219 completion
= xmalloc (strlen (match
) + (orig_text
- word
) + 5);
5220 strncpy (completion
, word
, orig_text
- word
);
5221 completion
[orig_text
- word
] = '\0';
5222 strcat (completion
, match
);
5225 VEC_safe_push (char_ptr
, *sv
, completion
);
5228 /* Return a list of possible symbol names completing TEXT0. The list
5229 is NULL terminated. WORD is the entire command on which completion
5233 ada_make_symbol_completion_list (char *text0
, char *word
)
5239 VEC(char_ptr
) *completions
= VEC_alloc (char_ptr
, 128);
5242 struct partial_symtab
*ps
;
5243 struct minimal_symbol
*msymbol
;
5244 struct objfile
*objfile
;
5245 struct block
*b
, *surrounding_static_block
= 0;
5247 struct dict_iterator iter
;
5249 if (text0
[0] == '<')
5251 text
= xstrdup (text0
);
5252 make_cleanup (xfree
, text
);
5253 text_len
= strlen (text
);
5259 text
= xstrdup (ada_encode (text0
));
5260 make_cleanup (xfree
, text
);
5261 text_len
= strlen (text
);
5262 for (i
= 0; i
< text_len
; i
++)
5263 text
[i
] = tolower (text
[i
]);
5265 encoded
= (strstr (text0
, "__") != NULL
);
5266 /* If the name contains a ".", then the user is entering a fully
5267 qualified entity name, and the match must not be done in wild
5268 mode. Similarly, if the user wants to complete what looks like
5269 an encoded name, the match must not be done in wild mode. */
5270 wild_match
= (strchr (text0
, '.') == NULL
&& !encoded
);
5273 /* First, look at the partial symtab symbols. */
5274 ALL_PSYMTABS (objfile
, ps
)
5276 struct partial_symbol
**psym
;
5278 /* If the psymtab's been read in we'll get it when we search
5279 through the blockvector. */
5283 for (psym
= objfile
->global_psymbols
.list
+ ps
->globals_offset
;
5284 psym
< (objfile
->global_psymbols
.list
+ ps
->globals_offset
5285 + ps
->n_global_syms
); psym
++)
5288 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5289 text
, text_len
, text0
, word
,
5290 wild_match
, encoded
);
5293 for (psym
= objfile
->static_psymbols
.list
+ ps
->statics_offset
;
5294 psym
< (objfile
->static_psymbols
.list
+ ps
->statics_offset
5295 + ps
->n_static_syms
); psym
++)
5298 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (*psym
),
5299 text
, text_len
, text0
, word
,
5300 wild_match
, encoded
);
5304 /* At this point scan through the misc symbol vectors and add each
5305 symbol you find to the list. Eventually we want to ignore
5306 anything that isn't a text symbol (everything else will be
5307 handled by the psymtab code above). */
5309 ALL_MSYMBOLS (objfile
, msymbol
)
5312 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (msymbol
),
5313 text
, text_len
, text0
, word
, wild_match
, encoded
);
5316 /* Search upwards from currently selected frame (so that we can
5317 complete on local vars. */
5319 for (b
= get_selected_block (0); b
!= NULL
; b
= BLOCK_SUPERBLOCK (b
))
5321 if (!BLOCK_SUPERBLOCK (b
))
5322 surrounding_static_block
= b
; /* For elmin of dups */
5324 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5326 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5327 text
, text_len
, text0
, word
,
5328 wild_match
, encoded
);
5332 /* Go through the symtabs and check the externs and statics for
5333 symbols which match. */
5335 ALL_SYMTABS (objfile
, s
)
5338 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), GLOBAL_BLOCK
);
5339 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5341 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5342 text
, text_len
, text0
, word
,
5343 wild_match
, encoded
);
5347 ALL_SYMTABS (objfile
, s
)
5350 b
= BLOCKVECTOR_BLOCK (BLOCKVECTOR (s
), STATIC_BLOCK
);
5351 /* Don't do this block twice. */
5352 if (b
== surrounding_static_block
)
5354 ALL_BLOCK_SYMBOLS (b
, iter
, sym
)
5356 symbol_completion_add (&completions
, SYMBOL_LINKAGE_NAME (sym
),
5357 text
, text_len
, text0
, word
,
5358 wild_match
, encoded
);
5362 /* Append the closing NULL entry. */
5363 VEC_safe_push (char_ptr
, completions
, NULL
);
5365 /* Make a copy of the COMPLETIONS VEC before we free it, and then
5366 return the copy. It's unfortunate that we have to make a copy
5367 of an array that we're about to destroy, but there is nothing much
5368 we can do about it. Fortunately, it's typically not a very large
5371 const size_t completions_size
=
5372 VEC_length (char_ptr
, completions
) * sizeof (char *);
5373 char **result
= malloc (completions_size
);
5375 memcpy (result
, VEC_address (char_ptr
, completions
), completions_size
);
5377 VEC_free (char_ptr
, completions
);
5384 /* Return non-zero if TYPE is a pointer to the GNAT dispatch table used
5385 for tagged types. */
5388 ada_is_dispatch_table_ptr_type (struct type
*type
)
5392 if (TYPE_CODE (type
) != TYPE_CODE_PTR
)
5395 name
= TYPE_NAME (TYPE_TARGET_TYPE (type
));
5399 return (strcmp (name
, "ada__tags__dispatch_table") == 0);
5402 /* True if field number FIELD_NUM in struct or union type TYPE is supposed
5403 to be invisible to users. */
5406 ada_is_ignored_field (struct type
*type
, int field_num
)
5408 if (field_num
< 0 || field_num
> TYPE_NFIELDS (type
))
5411 /* Check the name of that field. */
5413 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5415 /* Anonymous field names should not be printed.
5416 brobecker/2007-02-20: I don't think this can actually happen
5417 but we don't want to print the value of annonymous fields anyway. */
5421 /* A field named "_parent" is internally generated by GNAT for
5422 tagged types, and should not be printed either. */
5423 if (name
[0] == '_' && strncmp (name
, "_parent", 7) != 0)
5427 /* If this is the dispatch table of a tagged type, then ignore. */
5428 if (ada_is_tagged_type (type
, 1)
5429 && ada_is_dispatch_table_ptr_type (TYPE_FIELD_TYPE (type
, field_num
)))
5432 /* Not a special field, so it should not be ignored. */
5436 /* True iff TYPE has a tag field. If REFOK, then TYPE may also be a
5437 pointer or reference type whose ultimate target has a tag field. */
5440 ada_is_tagged_type (struct type
*type
, int refok
)
5442 return (ada_lookup_struct_elt_type (type
, "_tag", refok
, 1, NULL
) != NULL
);
5445 /* True iff TYPE represents the type of X'Tag */
5448 ada_is_tag_type (struct type
*type
)
5450 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_PTR
)
5454 const char *name
= ada_type_name (TYPE_TARGET_TYPE (type
));
5455 return (name
!= NULL
5456 && strcmp (name
, "ada__tags__dispatch_table") == 0);
5460 /* The type of the tag on VAL. */
5463 ada_tag_type (struct value
*val
)
5465 return ada_lookup_struct_elt_type (value_type (val
), "_tag", 1, 0, NULL
);
5468 /* The value of the tag on VAL. */
5471 ada_value_tag (struct value
*val
)
5473 return ada_value_struct_elt (val
, "_tag", 0);
5476 /* The value of the tag on the object of type TYPE whose contents are
5477 saved at VALADDR, if it is non-null, or is at memory address
5480 static struct value
*
5481 value_tag_from_contents_and_address (struct type
*type
,
5482 const gdb_byte
*valaddr
,
5485 int tag_byte_offset
, dummy1
, dummy2
;
5486 struct type
*tag_type
;
5487 if (find_struct_field ("_tag", type
, 0, &tag_type
, &tag_byte_offset
,
5490 const gdb_byte
*valaddr1
= ((valaddr
== NULL
)
5492 : valaddr
+ tag_byte_offset
);
5493 CORE_ADDR address1
= (address
== 0) ? 0 : address
+ tag_byte_offset
;
5495 return value_from_contents_and_address (tag_type
, valaddr1
, address1
);
5500 static struct type
*
5501 type_from_tag (struct value
*tag
)
5503 const char *type_name
= ada_tag_name (tag
);
5504 if (type_name
!= NULL
)
5505 return ada_find_any_type (ada_encode (type_name
));
5516 static int ada_tag_name_1 (void *);
5517 static int ada_tag_name_2 (struct tag_args
*);
5519 /* Wrapper function used by ada_tag_name. Given a struct tag_args*
5520 value ARGS, sets ARGS->name to the tag name of ARGS->tag.
5521 The value stored in ARGS->name is valid until the next call to
5525 ada_tag_name_1 (void *args0
)
5527 struct tag_args
*args
= (struct tag_args
*) args0
;
5528 static char name
[1024];
5532 val
= ada_value_struct_elt (args
->tag
, "tsd", 1);
5534 return ada_tag_name_2 (args
);
5535 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5538 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5539 for (p
= name
; *p
!= '\0'; p
+= 1)
5546 /* Utility function for ada_tag_name_1 that tries the second
5547 representation for the dispatch table (in which there is no
5548 explicit 'tsd' field in the referent of the tag pointer, and instead
5549 the tsd pointer is stored just before the dispatch table. */
5552 ada_tag_name_2 (struct tag_args
*args
)
5554 struct type
*info_type
;
5555 static char name
[1024];
5557 struct value
*val
, *valp
;
5560 info_type
= ada_find_any_type ("ada__tags__type_specific_data");
5561 if (info_type
== NULL
)
5563 info_type
= lookup_pointer_type (lookup_pointer_type (info_type
));
5564 valp
= value_cast (info_type
, args
->tag
);
5567 val
= value_ind (value_ptradd (valp
,
5568 value_from_longest (builtin_type_int8
, -1)));
5571 val
= ada_value_struct_elt (val
, "expanded_name", 1);
5574 read_memory_string (value_as_address (val
), name
, sizeof (name
) - 1);
5575 for (p
= name
; *p
!= '\0'; p
+= 1)
5582 /* The type name of the dynamic type denoted by the 'tag value TAG, as
5586 ada_tag_name (struct value
*tag
)
5588 struct tag_args args
;
5589 if (!ada_is_tag_type (value_type (tag
)))
5593 catch_errors (ada_tag_name_1
, &args
, NULL
, RETURN_MASK_ALL
);
5597 /* The parent type of TYPE, or NULL if none. */
5600 ada_parent_type (struct type
*type
)
5604 type
= ada_check_typedef (type
);
5606 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
5609 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5610 if (ada_is_parent_field (type
, i
))
5612 struct type
*parent_type
= TYPE_FIELD_TYPE (type
, i
);
5614 /* If the _parent field is a pointer, then dereference it. */
5615 if (TYPE_CODE (parent_type
) == TYPE_CODE_PTR
)
5616 parent_type
= TYPE_TARGET_TYPE (parent_type
);
5617 /* If there is a parallel XVS type, get the actual base type. */
5618 parent_type
= ada_get_base_type (parent_type
);
5620 return ada_check_typedef (parent_type
);
5626 /* True iff field number FIELD_NUM of structure type TYPE contains the
5627 parent-type (inherited) fields of a derived type. Assumes TYPE is
5628 a structure type with at least FIELD_NUM+1 fields. */
5631 ada_is_parent_field (struct type
*type
, int field_num
)
5633 const char *name
= TYPE_FIELD_NAME (ada_check_typedef (type
), field_num
);
5634 return (name
!= NULL
5635 && (strncmp (name
, "PARENT", 6) == 0
5636 || strncmp (name
, "_parent", 7) == 0));
5639 /* True iff field number FIELD_NUM of structure type TYPE is a
5640 transparent wrapper field (which should be silently traversed when doing
5641 field selection and flattened when printing). Assumes TYPE is a
5642 structure type with at least FIELD_NUM+1 fields. Such fields are always
5646 ada_is_wrapper_field (struct type
*type
, int field_num
)
5648 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5649 return (name
!= NULL
5650 && (strncmp (name
, "PARENT", 6) == 0
5651 || strcmp (name
, "REP") == 0
5652 || strncmp (name
, "_parent", 7) == 0
5653 || name
[0] == 'S' || name
[0] == 'R' || name
[0] == 'O'));
5656 /* True iff field number FIELD_NUM of structure or union type TYPE
5657 is a variant wrapper. Assumes TYPE is a structure type with at least
5658 FIELD_NUM+1 fields. */
5661 ada_is_variant_part (struct type
*type
, int field_num
)
5663 struct type
*field_type
= TYPE_FIELD_TYPE (type
, field_num
);
5664 return (TYPE_CODE (field_type
) == TYPE_CODE_UNION
5665 || (is_dynamic_field (type
, field_num
)
5666 && (TYPE_CODE (TYPE_TARGET_TYPE (field_type
))
5667 == TYPE_CODE_UNION
)));
5670 /* Assuming that VAR_TYPE is a variant wrapper (type of the variant part)
5671 whose discriminants are contained in the record type OUTER_TYPE,
5672 returns the type of the controlling discriminant for the variant. */
5675 ada_variant_discrim_type (struct type
*var_type
, struct type
*outer_type
)
5677 char *name
= ada_variant_discrim_name (var_type
);
5679 ada_lookup_struct_elt_type (outer_type
, name
, 1, 1, NULL
);
5681 return builtin_type_int32
;
5686 /* Assuming that TYPE is the type of a variant wrapper, and FIELD_NUM is a
5687 valid field number within it, returns 1 iff field FIELD_NUM of TYPE
5688 represents a 'when others' clause; otherwise 0. */
5691 ada_is_others_clause (struct type
*type
, int field_num
)
5693 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5694 return (name
!= NULL
&& name
[0] == 'O');
5697 /* Assuming that TYPE0 is the type of the variant part of a record,
5698 returns the name of the discriminant controlling the variant.
5699 The value is valid until the next call to ada_variant_discrim_name. */
5702 ada_variant_discrim_name (struct type
*type0
)
5704 static char *result
= NULL
;
5705 static size_t result_len
= 0;
5708 const char *discrim_end
;
5709 const char *discrim_start
;
5711 if (TYPE_CODE (type0
) == TYPE_CODE_PTR
)
5712 type
= TYPE_TARGET_TYPE (type0
);
5716 name
= ada_type_name (type
);
5718 if (name
== NULL
|| name
[0] == '\000')
5721 for (discrim_end
= name
+ strlen (name
) - 6; discrim_end
!= name
;
5724 if (strncmp (discrim_end
, "___XVN", 6) == 0)
5727 if (discrim_end
== name
)
5730 for (discrim_start
= discrim_end
; discrim_start
!= name
+ 3;
5733 if (discrim_start
== name
+ 1)
5735 if ((discrim_start
> name
+ 3
5736 && strncmp (discrim_start
- 3, "___", 3) == 0)
5737 || discrim_start
[-1] == '.')
5741 GROW_VECT (result
, result_len
, discrim_end
- discrim_start
+ 1);
5742 strncpy (result
, discrim_start
, discrim_end
- discrim_start
);
5743 result
[discrim_end
- discrim_start
] = '\0';
5747 /* Scan STR for a subtype-encoded number, beginning at position K.
5748 Put the position of the character just past the number scanned in
5749 *NEW_K, if NEW_K!=NULL. Put the scanned number in *R, if R!=NULL.
5750 Return 1 if there was a valid number at the given position, and 0
5751 otherwise. A "subtype-encoded" number consists of the absolute value
5752 in decimal, followed by the letter 'm' to indicate a negative number.
5753 Assumes 0m does not occur. */
5756 ada_scan_number (const char str
[], int k
, LONGEST
* R
, int *new_k
)
5760 if (!isdigit (str
[k
]))
5763 /* Do it the hard way so as not to make any assumption about
5764 the relationship of unsigned long (%lu scan format code) and
5767 while (isdigit (str
[k
]))
5769 RU
= RU
* 10 + (str
[k
] - '0');
5776 *R
= (-(LONGEST
) (RU
- 1)) - 1;
5782 /* NOTE on the above: Technically, C does not say what the results of
5783 - (LONGEST) RU or (LONGEST) -RU are for RU == largest positive
5784 number representable as a LONGEST (although either would probably work
5785 in most implementations). When RU>0, the locution in the then branch
5786 above is always equivalent to the negative of RU. */
5793 /* Assuming that TYPE is a variant part wrapper type (a VARIANTS field),
5794 and FIELD_NUM is a valid field number within it, returns 1 iff VAL is
5795 in the range encoded by field FIELD_NUM of TYPE; otherwise 0. */
5798 ada_in_variant (LONGEST val
, struct type
*type
, int field_num
)
5800 const char *name
= TYPE_FIELD_NAME (type
, field_num
);
5813 if (!ada_scan_number (name
, p
+ 1, &W
, &p
))
5822 if (!ada_scan_number (name
, p
+ 1, &L
, &p
)
5823 || name
[p
] != 'T' || !ada_scan_number (name
, p
+ 1, &U
, &p
))
5825 if (val
>= L
&& val
<= U
)
5837 /* FIXME: Lots of redundancy below. Try to consolidate. */
5839 /* Given a value ARG1 (offset by OFFSET bytes) of a struct or union type
5840 ARG_TYPE, extract and return the value of one of its (non-static)
5841 fields. FIELDNO says which field. Differs from value_primitive_field
5842 only in that it can handle packed values of arbitrary type. */
5844 static struct value
*
5845 ada_value_primitive_field (struct value
*arg1
, int offset
, int fieldno
,
5846 struct type
*arg_type
)
5850 arg_type
= ada_check_typedef (arg_type
);
5851 type
= TYPE_FIELD_TYPE (arg_type
, fieldno
);
5853 /* Handle packed fields. */
5855 if (TYPE_FIELD_BITSIZE (arg_type
, fieldno
) != 0)
5857 int bit_pos
= TYPE_FIELD_BITPOS (arg_type
, fieldno
);
5858 int bit_size
= TYPE_FIELD_BITSIZE (arg_type
, fieldno
);
5860 return ada_value_primitive_packed_val (arg1
, value_contents (arg1
),
5861 offset
+ bit_pos
/ 8,
5862 bit_pos
% 8, bit_size
, type
);
5865 return value_primitive_field (arg1
, offset
, fieldno
, arg_type
);
5868 /* Find field with name NAME in object of type TYPE. If found,
5869 set the following for each argument that is non-null:
5870 - *FIELD_TYPE_P to the field's type;
5871 - *BYTE_OFFSET_P to OFFSET + the byte offset of the field within
5872 an object of that type;
5873 - *BIT_OFFSET_P to the bit offset modulo byte size of the field;
5874 - *BIT_SIZE_P to its size in bits if the field is packed, and
5876 If INDEX_P is non-null, increment *INDEX_P by the number of source-visible
5877 fields up to but not including the desired field, or by the total
5878 number of fields if not found. A NULL value of NAME never
5879 matches; the function just counts visible fields in this case.
5881 Returns 1 if found, 0 otherwise. */
5884 find_struct_field (char *name
, struct type
*type
, int offset
,
5885 struct type
**field_type_p
,
5886 int *byte_offset_p
, int *bit_offset_p
, int *bit_size_p
,
5891 type
= ada_check_typedef (type
);
5893 if (field_type_p
!= NULL
)
5894 *field_type_p
= NULL
;
5895 if (byte_offset_p
!= NULL
)
5897 if (bit_offset_p
!= NULL
)
5899 if (bit_size_p
!= NULL
)
5902 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5904 int bit_pos
= TYPE_FIELD_BITPOS (type
, i
);
5905 int fld_offset
= offset
+ bit_pos
/ 8;
5906 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5908 if (t_field_name
== NULL
)
5911 else if (name
!= NULL
&& field_name_match (t_field_name
, name
))
5913 int bit_size
= TYPE_FIELD_BITSIZE (type
, i
);
5914 if (field_type_p
!= NULL
)
5915 *field_type_p
= TYPE_FIELD_TYPE (type
, i
);
5916 if (byte_offset_p
!= NULL
)
5917 *byte_offset_p
= fld_offset
;
5918 if (bit_offset_p
!= NULL
)
5919 *bit_offset_p
= bit_pos
% 8;
5920 if (bit_size_p
!= NULL
)
5921 *bit_size_p
= bit_size
;
5924 else if (ada_is_wrapper_field (type
, i
))
5926 if (find_struct_field (name
, TYPE_FIELD_TYPE (type
, i
), fld_offset
,
5927 field_type_p
, byte_offset_p
, bit_offset_p
,
5928 bit_size_p
, index_p
))
5931 else if (ada_is_variant_part (type
, i
))
5933 /* PNH: Wait. Do we ever execute this section, or is ARG always of
5936 struct type
*field_type
5937 = ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
5939 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
5941 if (find_struct_field (name
, TYPE_FIELD_TYPE (field_type
, j
),
5943 + TYPE_FIELD_BITPOS (field_type
, j
) / 8,
5944 field_type_p
, byte_offset_p
,
5945 bit_offset_p
, bit_size_p
, index_p
))
5949 else if (index_p
!= NULL
)
5955 /* Number of user-visible fields in record type TYPE. */
5958 num_visible_fields (struct type
*type
)
5962 find_struct_field (NULL
, type
, 0, NULL
, NULL
, NULL
, NULL
, &n
);
5966 /* Look for a field NAME in ARG. Adjust the address of ARG by OFFSET bytes,
5967 and search in it assuming it has (class) type TYPE.
5968 If found, return value, else return NULL.
5970 Searches recursively through wrapper fields (e.g., '_parent'). */
5972 static struct value
*
5973 ada_search_struct_field (char *name
, struct value
*arg
, int offset
,
5977 type
= ada_check_typedef (type
);
5979 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
5981 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
5983 if (t_field_name
== NULL
)
5986 else if (field_name_match (t_field_name
, name
))
5987 return ada_value_primitive_field (arg
, offset
, i
, type
);
5989 else if (ada_is_wrapper_field (type
, i
))
5991 struct value
*v
= /* Do not let indent join lines here. */
5992 ada_search_struct_field (name
, arg
,
5993 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
5994 TYPE_FIELD_TYPE (type
, i
));
5999 else if (ada_is_variant_part (type
, i
))
6001 /* PNH: Do we ever get here? See find_struct_field. */
6003 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6004 int var_offset
= offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6006 for (j
= 0; j
< TYPE_NFIELDS (field_type
); j
+= 1)
6008 struct value
*v
= ada_search_struct_field
/* Force line break. */
6010 var_offset
+ TYPE_FIELD_BITPOS (field_type
, j
) / 8,
6011 TYPE_FIELD_TYPE (field_type
, j
));
6020 static struct value
*ada_index_struct_field_1 (int *, struct value
*,
6021 int, struct type
*);
6024 /* Return field #INDEX in ARG, where the index is that returned by
6025 * find_struct_field through its INDEX_P argument. Adjust the address
6026 * of ARG by OFFSET bytes, and search in it assuming it has (class) type TYPE.
6027 * If found, return value, else return NULL. */
6029 static struct value
*
6030 ada_index_struct_field (int index
, struct value
*arg
, int offset
,
6033 return ada_index_struct_field_1 (&index
, arg
, offset
, type
);
6037 /* Auxiliary function for ada_index_struct_field. Like
6038 * ada_index_struct_field, but takes index from *INDEX_P and modifies
6041 static struct value
*
6042 ada_index_struct_field_1 (int *index_p
, struct value
*arg
, int offset
,
6046 type
= ada_check_typedef (type
);
6048 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6050 if (TYPE_FIELD_NAME (type
, i
) == NULL
)
6052 else if (ada_is_wrapper_field (type
, i
))
6054 struct value
*v
= /* Do not let indent join lines here. */
6055 ada_index_struct_field_1 (index_p
, arg
,
6056 offset
+ TYPE_FIELD_BITPOS (type
, i
) / 8,
6057 TYPE_FIELD_TYPE (type
, i
));
6062 else if (ada_is_variant_part (type
, i
))
6064 /* PNH: Do we ever get here? See ada_search_struct_field,
6065 find_struct_field. */
6066 error (_("Cannot assign this kind of variant record"));
6068 else if (*index_p
== 0)
6069 return ada_value_primitive_field (arg
, offset
, i
, type
);
6076 /* Given ARG, a value of type (pointer or reference to a)*
6077 structure/union, extract the component named NAME from the ultimate
6078 target structure/union and return it as a value with its
6081 The routine searches for NAME among all members of the structure itself
6082 and (recursively) among all members of any wrapper members
6085 If NO_ERR, then simply return NULL in case of error, rather than
6089 ada_value_struct_elt (struct value
*arg
, char *name
, int no_err
)
6091 struct type
*t
, *t1
;
6095 t1
= t
= ada_check_typedef (value_type (arg
));
6096 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6098 t1
= TYPE_TARGET_TYPE (t
);
6101 t1
= ada_check_typedef (t1
);
6102 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6104 arg
= coerce_ref (arg
);
6109 while (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6111 t1
= TYPE_TARGET_TYPE (t
);
6114 t1
= ada_check_typedef (t1
);
6115 if (TYPE_CODE (t1
) == TYPE_CODE_PTR
)
6117 arg
= value_ind (arg
);
6124 if (TYPE_CODE (t1
) != TYPE_CODE_STRUCT
&& TYPE_CODE (t1
) != TYPE_CODE_UNION
)
6128 v
= ada_search_struct_field (name
, arg
, 0, t
);
6131 int bit_offset
, bit_size
, byte_offset
;
6132 struct type
*field_type
;
6135 if (TYPE_CODE (t
) == TYPE_CODE_PTR
)
6136 address
= value_as_address (arg
);
6138 address
= unpack_pointer (t
, value_contents (arg
));
6140 t1
= ada_to_fixed_type (ada_get_base_type (t1
), NULL
, address
, NULL
, 1);
6141 if (find_struct_field (name
, t1
, 0,
6142 &field_type
, &byte_offset
, &bit_offset
,
6147 if (TYPE_CODE (t
) == TYPE_CODE_REF
)
6148 arg
= ada_coerce_ref (arg
);
6150 arg
= ada_value_ind (arg
);
6151 v
= ada_value_primitive_packed_val (arg
, NULL
, byte_offset
,
6152 bit_offset
, bit_size
,
6156 v
= value_at_lazy (field_type
, address
+ byte_offset
);
6160 if (v
!= NULL
|| no_err
)
6163 error (_("There is no member named %s."), name
);
6169 error (_("Attempt to extract a component of a value that is not a record."));
6172 /* Given a type TYPE, look up the type of the component of type named NAME.
6173 If DISPP is non-null, add its byte displacement from the beginning of a
6174 structure (pointed to by a value) of type TYPE to *DISPP (does not
6175 work for packed fields).
6177 Matches any field whose name has NAME as a prefix, possibly
6180 TYPE can be either a struct or union. If REFOK, TYPE may also
6181 be a (pointer or reference)+ to a struct or union, and the
6182 ultimate target type will be searched.
6184 Looks recursively into variant clauses and parent types.
6186 If NOERR is nonzero, return NULL if NAME is not suitably defined or
6187 TYPE is not a type of the right kind. */
6189 static struct type
*
6190 ada_lookup_struct_elt_type (struct type
*type
, char *name
, int refok
,
6191 int noerr
, int *dispp
)
6198 if (refok
&& type
!= NULL
)
6201 type
= ada_check_typedef (type
);
6202 if (TYPE_CODE (type
) != TYPE_CODE_PTR
6203 && TYPE_CODE (type
) != TYPE_CODE_REF
)
6205 type
= TYPE_TARGET_TYPE (type
);
6209 || (TYPE_CODE (type
) != TYPE_CODE_STRUCT
6210 && TYPE_CODE (type
) != TYPE_CODE_UNION
))
6216 target_terminal_ours ();
6217 gdb_flush (gdb_stdout
);
6219 error (_("Type (null) is not a structure or union type"));
6222 /* XXX: type_sprint */
6223 fprintf_unfiltered (gdb_stderr
, _("Type "));
6224 type_print (type
, "", gdb_stderr
, -1);
6225 error (_(" is not a structure or union type"));
6230 type
= to_static_fixed_type (type
);
6232 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
6234 char *t_field_name
= TYPE_FIELD_NAME (type
, i
);
6238 if (t_field_name
== NULL
)
6241 else if (field_name_match (t_field_name
, name
))
6244 *dispp
+= TYPE_FIELD_BITPOS (type
, i
) / 8;
6245 return ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6248 else if (ada_is_wrapper_field (type
, i
))
6251 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (type
, i
), name
,
6256 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6261 else if (ada_is_variant_part (type
, i
))
6264 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type
, i
));
6266 for (j
= TYPE_NFIELDS (field_type
) - 1; j
>= 0; j
-= 1)
6268 /* FIXME pnh 2008/01/26: We check for a field that is
6269 NOT wrapped in a struct, since the compiler sometimes
6270 generates these for unchecked variant types. Revisit
6271 if the compiler changes this practice. */
6272 char *v_field_name
= TYPE_FIELD_NAME (field_type
, j
);
6274 if (v_field_name
!= NULL
6275 && field_name_match (v_field_name
, name
))
6276 t
= ada_check_typedef (TYPE_FIELD_TYPE (field_type
, j
));
6278 t
= ada_lookup_struct_elt_type (TYPE_FIELD_TYPE (field_type
, j
),
6284 *dispp
+= disp
+ TYPE_FIELD_BITPOS (type
, i
) / 8;
6295 target_terminal_ours ();
6296 gdb_flush (gdb_stdout
);
6299 /* XXX: type_sprint */
6300 fprintf_unfiltered (gdb_stderr
, _("Type "));
6301 type_print (type
, "", gdb_stderr
, -1);
6302 error (_(" has no component named <null>"));
6306 /* XXX: type_sprint */
6307 fprintf_unfiltered (gdb_stderr
, _("Type "));
6308 type_print (type
, "", gdb_stderr
, -1);
6309 error (_(" has no component named %s"), name
);
6316 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6317 within a value of type OUTER_TYPE, return true iff VAR_TYPE
6318 represents an unchecked union (that is, the variant part of a
6319 record that is named in an Unchecked_Union pragma). */
6322 is_unchecked_variant (struct type
*var_type
, struct type
*outer_type
)
6324 char *discrim_name
= ada_variant_discrim_name (var_type
);
6325 return (ada_lookup_struct_elt_type (outer_type
, discrim_name
, 0, 1, NULL
)
6330 /* Assuming that VAR_TYPE is the type of a variant part of a record (a union),
6331 within a value of type OUTER_TYPE that is stored in GDB at
6332 OUTER_VALADDR, determine which variant clause (field number in VAR_TYPE,
6333 numbering from 0) is applicable. Returns -1 if none are. */
6336 ada_which_variant_applies (struct type
*var_type
, struct type
*outer_type
,
6337 const gdb_byte
*outer_valaddr
)
6341 char *discrim_name
= ada_variant_discrim_name (var_type
);
6342 struct value
*outer
;
6343 struct value
*discrim
;
6344 LONGEST discrim_val
;
6346 outer
= value_from_contents_and_address (outer_type
, outer_valaddr
, 0);
6347 discrim
= ada_value_struct_elt (outer
, discrim_name
, 1);
6348 if (discrim
== NULL
)
6350 discrim_val
= value_as_long (discrim
);
6353 for (i
= 0; i
< TYPE_NFIELDS (var_type
); i
+= 1)
6355 if (ada_is_others_clause (var_type
, i
))
6357 else if (ada_in_variant (discrim_val
, var_type
, i
))
6361 return others_clause
;
6366 /* Dynamic-Sized Records */
6368 /* Strategy: The type ostensibly attached to a value with dynamic size
6369 (i.e., a size that is not statically recorded in the debugging
6370 data) does not accurately reflect the size or layout of the value.
6371 Our strategy is to convert these values to values with accurate,
6372 conventional types that are constructed on the fly. */
6374 /* There is a subtle and tricky problem here. In general, we cannot
6375 determine the size of dynamic records without its data. However,
6376 the 'struct value' data structure, which GDB uses to represent
6377 quantities in the inferior process (the target), requires the size
6378 of the type at the time of its allocation in order to reserve space
6379 for GDB's internal copy of the data. That's why the
6380 'to_fixed_xxx_type' routines take (target) addresses as parameters,
6381 rather than struct value*s.
6383 However, GDB's internal history variables ($1, $2, etc.) are
6384 struct value*s containing internal copies of the data that are not, in
6385 general, the same as the data at their corresponding addresses in
6386 the target. Fortunately, the types we give to these values are all
6387 conventional, fixed-size types (as per the strategy described
6388 above), so that we don't usually have to perform the
6389 'to_fixed_xxx_type' conversions to look at their values.
6390 Unfortunately, there is one exception: if one of the internal
6391 history variables is an array whose elements are unconstrained
6392 records, then we will need to create distinct fixed types for each
6393 element selected. */
6395 /* The upshot of all of this is that many routines take a (type, host
6396 address, target address) triple as arguments to represent a value.
6397 The host address, if non-null, is supposed to contain an internal
6398 copy of the relevant data; otherwise, the program is to consult the
6399 target at the target address. */
6401 /* Assuming that VAL0 represents a pointer value, the result of
6402 dereferencing it. Differs from value_ind in its treatment of
6403 dynamic-sized types. */
6406 ada_value_ind (struct value
*val0
)
6408 struct value
*val
= unwrap_value (value_ind (val0
));
6409 return ada_to_fixed_value (val
);
6412 /* The value resulting from dereferencing any "reference to"
6413 qualifiers on VAL0. */
6415 static struct value
*
6416 ada_coerce_ref (struct value
*val0
)
6418 if (TYPE_CODE (value_type (val0
)) == TYPE_CODE_REF
)
6420 struct value
*val
= val0
;
6421 val
= coerce_ref (val
);
6422 val
= unwrap_value (val
);
6423 return ada_to_fixed_value (val
);
6429 /* Return OFF rounded upward if necessary to a multiple of
6430 ALIGNMENT (a power of 2). */
6433 align_value (unsigned int off
, unsigned int alignment
)
6435 return (off
+ alignment
- 1) & ~(alignment
- 1);
6438 /* Return the bit alignment required for field #F of template type TYPE. */
6441 field_alignment (struct type
*type
, int f
)
6443 const char *name
= TYPE_FIELD_NAME (type
, f
);
6447 /* The field name should never be null, unless the debugging information
6448 is somehow malformed. In this case, we assume the field does not
6449 require any alignment. */
6453 len
= strlen (name
);
6455 if (!isdigit (name
[len
- 1]))
6458 if (isdigit (name
[len
- 2]))
6459 align_offset
= len
- 2;
6461 align_offset
= len
- 1;
6463 if (align_offset
< 7 || strncmp ("___XV", name
+ align_offset
- 6, 5) != 0)
6464 return TARGET_CHAR_BIT
;
6466 return atoi (name
+ align_offset
) * TARGET_CHAR_BIT
;
6469 /* Find a symbol named NAME. Ignores ambiguity. */
6472 ada_find_any_symbol (const char *name
)
6476 sym
= standard_lookup (name
, get_selected_block (NULL
), VAR_DOMAIN
);
6477 if (sym
!= NULL
&& SYMBOL_CLASS (sym
) == LOC_TYPEDEF
)
6480 sym
= standard_lookup (name
, NULL
, STRUCT_DOMAIN
);
6484 /* Find a type named NAME. Ignores ambiguity. This routine will look
6485 solely for types defined by debug info, it will not search the GDB
6489 ada_find_any_type (const char *name
)
6491 struct symbol
*sym
= ada_find_any_symbol (name
);
6494 return SYMBOL_TYPE (sym
);
6499 /* Given NAME and an associated BLOCK, search all symbols for
6500 NAME suffixed with "___XR", which is the ``renaming'' symbol
6501 associated to NAME. Return this symbol if found, return
6505 ada_find_renaming_symbol (const char *name
, struct block
*block
)
6509 sym
= find_old_style_renaming_symbol (name
, block
);
6514 /* Not right yet. FIXME pnh 7/20/2007. */
6515 sym
= ada_find_any_symbol (name
);
6516 if (sym
!= NULL
&& strstr (SYMBOL_LINKAGE_NAME (sym
), "___XR") != NULL
)
6522 static struct symbol
*
6523 find_old_style_renaming_symbol (const char *name
, struct block
*block
)
6525 const struct symbol
*function_sym
= block_linkage_function (block
);
6528 if (function_sym
!= NULL
)
6530 /* If the symbol is defined inside a function, NAME is not fully
6531 qualified. This means we need to prepend the function name
6532 as well as adding the ``___XR'' suffix to build the name of
6533 the associated renaming symbol. */
6534 char *function_name
= SYMBOL_LINKAGE_NAME (function_sym
);
6535 /* Function names sometimes contain suffixes used
6536 for instance to qualify nested subprograms. When building
6537 the XR type name, we need to make sure that this suffix is
6538 not included. So do not include any suffix in the function
6539 name length below. */
6540 const int function_name_len
= ada_name_prefix_len (function_name
);
6541 const int rename_len
= function_name_len
+ 2 /* "__" */
6542 + strlen (name
) + 6 /* "___XR\0" */ ;
6544 /* Strip the suffix if necessary. */
6545 function_name
[function_name_len
] = '\0';
6547 /* Library-level functions are a special case, as GNAT adds
6548 a ``_ada_'' prefix to the function name to avoid namespace
6549 pollution. However, the renaming symbols themselves do not
6550 have this prefix, so we need to skip this prefix if present. */
6551 if (function_name_len
> 5 /* "_ada_" */
6552 && strstr (function_name
, "_ada_") == function_name
)
6553 function_name
= function_name
+ 5;
6555 rename
= (char *) alloca (rename_len
* sizeof (char));
6556 xsnprintf (rename
, rename_len
* sizeof (char), "%s__%s___XR",
6557 function_name
, name
);
6561 const int rename_len
= strlen (name
) + 6;
6562 rename
= (char *) alloca (rename_len
* sizeof (char));
6563 xsnprintf (rename
, rename_len
* sizeof (char), "%s___XR", name
);
6566 return ada_find_any_symbol (rename
);
6569 /* Because of GNAT encoding conventions, several GDB symbols may match a
6570 given type name. If the type denoted by TYPE0 is to be preferred to
6571 that of TYPE1 for purposes of type printing, return non-zero;
6572 otherwise return 0. */
6575 ada_prefer_type (struct type
*type0
, struct type
*type1
)
6579 else if (type0
== NULL
)
6581 else if (TYPE_CODE (type1
) == TYPE_CODE_VOID
)
6583 else if (TYPE_CODE (type0
) == TYPE_CODE_VOID
)
6585 else if (TYPE_NAME (type1
) == NULL
&& TYPE_NAME (type0
) != NULL
)
6587 else if (ada_is_packed_array_type (type0
))
6589 else if (ada_is_array_descriptor_type (type0
)
6590 && !ada_is_array_descriptor_type (type1
))
6594 const char *type0_name
= type_name_no_tag (type0
);
6595 const char *type1_name
= type_name_no_tag (type1
);
6597 if (type0_name
!= NULL
&& strstr (type0_name
, "___XR") != NULL
6598 && (type1_name
== NULL
|| strstr (type1_name
, "___XR") == NULL
))
6604 /* The name of TYPE, which is either its TYPE_NAME, or, if that is
6605 null, its TYPE_TAG_NAME. Null if TYPE is null. */
6608 ada_type_name (struct type
*type
)
6612 else if (TYPE_NAME (type
) != NULL
)
6613 return TYPE_NAME (type
);
6615 return TYPE_TAG_NAME (type
);
6618 /* Find a parallel type to TYPE whose name is formed by appending
6619 SUFFIX to the name of TYPE. */
6622 ada_find_parallel_type (struct type
*type
, const char *suffix
)
6625 static size_t name_len
= 0;
6627 char *typename
= ada_type_name (type
);
6629 if (typename
== NULL
)
6632 len
= strlen (typename
);
6634 GROW_VECT (name
, name_len
, len
+ strlen (suffix
) + 1);
6636 strcpy (name
, typename
);
6637 strcpy (name
+ len
, suffix
);
6639 return ada_find_any_type (name
);
6643 /* If TYPE is a variable-size record type, return the corresponding template
6644 type describing its fields. Otherwise, return NULL. */
6646 static struct type
*
6647 dynamic_template_type (struct type
*type
)
6649 type
= ada_check_typedef (type
);
6651 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
6652 || ada_type_name (type
) == NULL
)
6656 int len
= strlen (ada_type_name (type
));
6657 if (len
> 6 && strcmp (ada_type_name (type
) + len
- 6, "___XVE") == 0)
6660 return ada_find_parallel_type (type
, "___XVE");
6664 /* Assuming that TEMPL_TYPE is a union or struct type, returns
6665 non-zero iff field FIELD_NUM of TEMPL_TYPE has dynamic size. */
6668 is_dynamic_field (struct type
*templ_type
, int field_num
)
6670 const char *name
= TYPE_FIELD_NAME (templ_type
, field_num
);
6672 && TYPE_CODE (TYPE_FIELD_TYPE (templ_type
, field_num
)) == TYPE_CODE_PTR
6673 && strstr (name
, "___XVL") != NULL
;
6676 /* The index of the variant field of TYPE, or -1 if TYPE does not
6677 represent a variant record type. */
6680 variant_field_index (struct type
*type
)
6684 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_STRUCT
)
6687 for (f
= 0; f
< TYPE_NFIELDS (type
); f
+= 1)
6689 if (ada_is_variant_part (type
, f
))
6695 /* A record type with no fields. */
6697 static struct type
*
6698 empty_record (struct objfile
*objfile
)
6700 struct type
*type
= alloc_type (objfile
);
6701 TYPE_CODE (type
) = TYPE_CODE_STRUCT
;
6702 TYPE_NFIELDS (type
) = 0;
6703 TYPE_FIELDS (type
) = NULL
;
6704 INIT_CPLUS_SPECIFIC (type
);
6705 TYPE_NAME (type
) = "<empty>";
6706 TYPE_TAG_NAME (type
) = NULL
;
6707 TYPE_LENGTH (type
) = 0;
6711 /* An ordinary record type (with fixed-length fields) that describes
6712 the value of type TYPE at VALADDR or ADDRESS (see comments at
6713 the beginning of this section) VAL according to GNAT conventions.
6714 DVAL0 should describe the (portion of a) record that contains any
6715 necessary discriminants. It should be NULL if value_type (VAL) is
6716 an outer-level type (i.e., as opposed to a branch of a variant.) A
6717 variant field (unless unchecked) is replaced by a particular branch
6720 If not KEEP_DYNAMIC_FIELDS, then all fields whose position or
6721 length are not statically known are discarded. As a consequence,
6722 VALADDR, ADDRESS and DVAL0 are ignored.
6724 NOTE: Limitations: For now, we assume that dynamic fields and
6725 variants occupy whole numbers of bytes. However, they need not be
6729 ada_template_to_fixed_record_type_1 (struct type
*type
,
6730 const gdb_byte
*valaddr
,
6731 CORE_ADDR address
, struct value
*dval0
,
6732 int keep_dynamic_fields
)
6734 struct value
*mark
= value_mark ();
6737 int nfields
, bit_len
;
6740 int fld_bit_len
, bit_incr
;
6743 /* Compute the number of fields in this record type that are going
6744 to be processed: unless keep_dynamic_fields, this includes only
6745 fields whose position and length are static will be processed. */
6746 if (keep_dynamic_fields
)
6747 nfields
= TYPE_NFIELDS (type
);
6751 while (nfields
< TYPE_NFIELDS (type
)
6752 && !ada_is_variant_part (type
, nfields
)
6753 && !is_dynamic_field (type
, nfields
))
6757 rtype
= alloc_type (TYPE_OBJFILE (type
));
6758 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6759 INIT_CPLUS_SPECIFIC (rtype
);
6760 TYPE_NFIELDS (rtype
) = nfields
;
6761 TYPE_FIELDS (rtype
) = (struct field
*)
6762 TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6763 memset (TYPE_FIELDS (rtype
), 0, sizeof (struct field
) * nfields
);
6764 TYPE_NAME (rtype
) = ada_type_name (type
);
6765 TYPE_TAG_NAME (rtype
) = NULL
;
6766 TYPE_FIXED_INSTANCE (rtype
) = 1;
6772 for (f
= 0; f
< nfields
; f
+= 1)
6774 off
= align_value (off
, field_alignment (type
, f
))
6775 + TYPE_FIELD_BITPOS (type
, f
);
6776 TYPE_FIELD_BITPOS (rtype
, f
) = off
;
6777 TYPE_FIELD_BITSIZE (rtype
, f
) = 0;
6779 if (ada_is_variant_part (type
, f
))
6782 fld_bit_len
= bit_incr
= 0;
6784 else if (is_dynamic_field (type
, f
))
6788 /* rtype's length is computed based on the run-time
6789 value of discriminants. If the discriminants are not
6790 initialized, the type size may be completely bogus and
6791 GDB may fail to allocate a value for it. So check the
6792 size first before creating the value. */
6794 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6799 /* Get the fixed type of the field. Note that, in this case, we
6800 do not want to get the real type out of the tag: if the current
6801 field is the parent part of a tagged record, we will get the
6802 tag of the object. Clearly wrong: the real type of the parent
6803 is not the real type of the child. We would end up in an infinite
6805 TYPE_FIELD_TYPE (rtype
, f
) =
6808 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (type
, f
))),
6809 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6810 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
, 0);
6811 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6812 bit_incr
= fld_bit_len
=
6813 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, f
)) * TARGET_CHAR_BIT
;
6817 TYPE_FIELD_TYPE (rtype
, f
) = TYPE_FIELD_TYPE (type
, f
);
6818 TYPE_FIELD_NAME (rtype
, f
) = TYPE_FIELD_NAME (type
, f
);
6819 if (TYPE_FIELD_BITSIZE (type
, f
) > 0)
6820 bit_incr
= fld_bit_len
=
6821 TYPE_FIELD_BITSIZE (rtype
, f
) = TYPE_FIELD_BITSIZE (type
, f
);
6823 bit_incr
= fld_bit_len
=
6824 TYPE_LENGTH (TYPE_FIELD_TYPE (type
, f
)) * TARGET_CHAR_BIT
;
6826 if (off
+ fld_bit_len
> bit_len
)
6827 bit_len
= off
+ fld_bit_len
;
6829 TYPE_LENGTH (rtype
) =
6830 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6833 /* We handle the variant part, if any, at the end because of certain
6834 odd cases in which it is re-ordered so as NOT to be the last field of
6835 the record. This can happen in the presence of representation
6837 if (variant_field
>= 0)
6839 struct type
*branch_type
;
6841 off
= TYPE_FIELD_BITPOS (rtype
, variant_field
);
6844 dval
= value_from_contents_and_address (rtype
, valaddr
, address
);
6849 to_fixed_variant_branch_type
6850 (TYPE_FIELD_TYPE (type
, variant_field
),
6851 cond_offset_host (valaddr
, off
/ TARGET_CHAR_BIT
),
6852 cond_offset_target (address
, off
/ TARGET_CHAR_BIT
), dval
);
6853 if (branch_type
== NULL
)
6855 for (f
= variant_field
+ 1; f
< TYPE_NFIELDS (rtype
); f
+= 1)
6856 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
6857 TYPE_NFIELDS (rtype
) -= 1;
6861 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
6862 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
6864 TYPE_LENGTH (TYPE_FIELD_TYPE (rtype
, variant_field
)) *
6866 if (off
+ fld_bit_len
> bit_len
)
6867 bit_len
= off
+ fld_bit_len
;
6868 TYPE_LENGTH (rtype
) =
6869 align_value (bit_len
, TARGET_CHAR_BIT
) / TARGET_CHAR_BIT
;
6873 /* According to exp_dbug.ads, the size of TYPE for variable-size records
6874 should contain the alignment of that record, which should be a strictly
6875 positive value. If null or negative, then something is wrong, most
6876 probably in the debug info. In that case, we don't round up the size
6877 of the resulting type. If this record is not part of another structure,
6878 the current RTYPE length might be good enough for our purposes. */
6879 if (TYPE_LENGTH (type
) <= 0)
6881 if (TYPE_NAME (rtype
))
6882 warning (_("Invalid type size for `%s' detected: %d."),
6883 TYPE_NAME (rtype
), TYPE_LENGTH (type
));
6885 warning (_("Invalid type size for <unnamed> detected: %d."),
6886 TYPE_LENGTH (type
));
6890 TYPE_LENGTH (rtype
) = align_value (TYPE_LENGTH (rtype
),
6891 TYPE_LENGTH (type
));
6894 value_free_to_mark (mark
);
6895 if (TYPE_LENGTH (rtype
) > varsize_limit
)
6896 error (_("record type with dynamic size is larger than varsize-limit"));
6900 /* As for ada_template_to_fixed_record_type_1 with KEEP_DYNAMIC_FIELDS
6903 static struct type
*
6904 template_to_fixed_record_type (struct type
*type
, const gdb_byte
*valaddr
,
6905 CORE_ADDR address
, struct value
*dval0
)
6907 return ada_template_to_fixed_record_type_1 (type
, valaddr
,
6911 /* An ordinary record type in which ___XVL-convention fields and
6912 ___XVU- and ___XVN-convention field types in TYPE0 are replaced with
6913 static approximations, containing all possible fields. Uses
6914 no runtime values. Useless for use in values, but that's OK,
6915 since the results are used only for type determinations. Works on both
6916 structs and unions. Representation note: to save space, we memorize
6917 the result of this function in the TYPE_TARGET_TYPE of the
6920 static struct type
*
6921 template_to_static_fixed_type (struct type
*type0
)
6927 if (TYPE_TARGET_TYPE (type0
) != NULL
)
6928 return TYPE_TARGET_TYPE (type0
);
6930 nfields
= TYPE_NFIELDS (type0
);
6933 for (f
= 0; f
< nfields
; f
+= 1)
6935 struct type
*field_type
= ada_check_typedef (TYPE_FIELD_TYPE (type0
, f
));
6936 struct type
*new_type
;
6938 if (is_dynamic_field (type0
, f
))
6939 new_type
= to_static_fixed_type (TYPE_TARGET_TYPE (field_type
));
6941 new_type
= static_unwrap_type (field_type
);
6942 if (type
== type0
&& new_type
!= field_type
)
6944 TYPE_TARGET_TYPE (type0
) = type
= alloc_type (TYPE_OBJFILE (type0
));
6945 TYPE_CODE (type
) = TYPE_CODE (type0
);
6946 INIT_CPLUS_SPECIFIC (type
);
6947 TYPE_NFIELDS (type
) = nfields
;
6948 TYPE_FIELDS (type
) = (struct field
*)
6949 TYPE_ALLOC (type
, nfields
* sizeof (struct field
));
6950 memcpy (TYPE_FIELDS (type
), TYPE_FIELDS (type0
),
6951 sizeof (struct field
) * nfields
);
6952 TYPE_NAME (type
) = ada_type_name (type0
);
6953 TYPE_TAG_NAME (type
) = NULL
;
6954 TYPE_FIXED_INSTANCE (type
) = 1;
6955 TYPE_LENGTH (type
) = 0;
6957 TYPE_FIELD_TYPE (type
, f
) = new_type
;
6958 TYPE_FIELD_NAME (type
, f
) = TYPE_FIELD_NAME (type0
, f
);
6963 /* Given an object of type TYPE whose contents are at VALADDR and
6964 whose address in memory is ADDRESS, returns a revision of TYPE,
6965 which should be a non-dynamic-sized record, in which the variant
6966 part, if any, is replaced with the appropriate branch. Looks
6967 for discriminant values in DVAL0, which can be NULL if the record
6968 contains the necessary discriminant values. */
6970 static struct type
*
6971 to_record_with_fixed_variant_part (struct type
*type
, const gdb_byte
*valaddr
,
6972 CORE_ADDR address
, struct value
*dval0
)
6974 struct value
*mark
= value_mark ();
6977 struct type
*branch_type
;
6978 int nfields
= TYPE_NFIELDS (type
);
6979 int variant_field
= variant_field_index (type
);
6981 if (variant_field
== -1)
6985 dval
= value_from_contents_and_address (type
, valaddr
, address
);
6989 rtype
= alloc_type (TYPE_OBJFILE (type
));
6990 TYPE_CODE (rtype
) = TYPE_CODE_STRUCT
;
6991 INIT_CPLUS_SPECIFIC (rtype
);
6992 TYPE_NFIELDS (rtype
) = nfields
;
6993 TYPE_FIELDS (rtype
) =
6994 (struct field
*) TYPE_ALLOC (rtype
, nfields
* sizeof (struct field
));
6995 memcpy (TYPE_FIELDS (rtype
), TYPE_FIELDS (type
),
6996 sizeof (struct field
) * nfields
);
6997 TYPE_NAME (rtype
) = ada_type_name (type
);
6998 TYPE_TAG_NAME (rtype
) = NULL
;
6999 TYPE_FIXED_INSTANCE (rtype
) = 1;
7000 TYPE_LENGTH (rtype
) = TYPE_LENGTH (type
);
7002 branch_type
= to_fixed_variant_branch_type
7003 (TYPE_FIELD_TYPE (type
, variant_field
),
7004 cond_offset_host (valaddr
,
7005 TYPE_FIELD_BITPOS (type
, variant_field
)
7007 cond_offset_target (address
,
7008 TYPE_FIELD_BITPOS (type
, variant_field
)
7009 / TARGET_CHAR_BIT
), dval
);
7010 if (branch_type
== NULL
)
7013 for (f
= variant_field
+ 1; f
< nfields
; f
+= 1)
7014 TYPE_FIELDS (rtype
)[f
- 1] = TYPE_FIELDS (rtype
)[f
];
7015 TYPE_NFIELDS (rtype
) -= 1;
7019 TYPE_FIELD_TYPE (rtype
, variant_field
) = branch_type
;
7020 TYPE_FIELD_NAME (rtype
, variant_field
) = "S";
7021 TYPE_FIELD_BITSIZE (rtype
, variant_field
) = 0;
7022 TYPE_LENGTH (rtype
) += TYPE_LENGTH (branch_type
);
7024 TYPE_LENGTH (rtype
) -= TYPE_LENGTH (TYPE_FIELD_TYPE (type
, variant_field
));
7026 value_free_to_mark (mark
);
7030 /* An ordinary record type (with fixed-length fields) that describes
7031 the value at (TYPE0, VALADDR, ADDRESS) [see explanation at
7032 beginning of this section]. Any necessary discriminants' values
7033 should be in DVAL, a record value; it may be NULL if the object
7034 at ADDR itself contains any necessary discriminant values.
7035 Additionally, VALADDR and ADDRESS may also be NULL if no discriminant
7036 values from the record are needed. Except in the case that DVAL,
7037 VALADDR, and ADDRESS are all 0 or NULL, a variant field (unless
7038 unchecked) is replaced by a particular branch of the variant.
7040 NOTE: the case in which DVAL and VALADDR are NULL and ADDRESS is 0
7041 is questionable and may be removed. It can arise during the
7042 processing of an unconstrained-array-of-record type where all the
7043 variant branches have exactly the same size. This is because in
7044 such cases, the compiler does not bother to use the XVS convention
7045 when encoding the record. I am currently dubious of this
7046 shortcut and suspect the compiler should be altered. FIXME. */
7048 static struct type
*
7049 to_fixed_record_type (struct type
*type0
, const gdb_byte
*valaddr
,
7050 CORE_ADDR address
, struct value
*dval
)
7052 struct type
*templ_type
;
7054 if (TYPE_FIXED_INSTANCE (type0
))
7057 templ_type
= dynamic_template_type (type0
);
7059 if (templ_type
!= NULL
)
7060 return template_to_fixed_record_type (templ_type
, valaddr
, address
, dval
);
7061 else if (variant_field_index (type0
) >= 0)
7063 if (dval
== NULL
&& valaddr
== NULL
&& address
== 0)
7065 return to_record_with_fixed_variant_part (type0
, valaddr
, address
,
7070 TYPE_FIXED_INSTANCE (type0
) = 1;
7076 /* An ordinary record type (with fixed-length fields) that describes
7077 the value at (VAR_TYPE0, VALADDR, ADDRESS), where VAR_TYPE0 is a
7078 union type. Any necessary discriminants' values should be in DVAL,
7079 a record value. That is, this routine selects the appropriate
7080 branch of the union at ADDR according to the discriminant value
7081 indicated in the union's type name. Returns VAR_TYPE0 itself if
7082 it represents a variant subject to a pragma Unchecked_Union. */
7084 static struct type
*
7085 to_fixed_variant_branch_type (struct type
*var_type0
, const gdb_byte
*valaddr
,
7086 CORE_ADDR address
, struct value
*dval
)
7089 struct type
*templ_type
;
7090 struct type
*var_type
;
7092 if (TYPE_CODE (var_type0
) == TYPE_CODE_PTR
)
7093 var_type
= TYPE_TARGET_TYPE (var_type0
);
7095 var_type
= var_type0
;
7097 templ_type
= ada_find_parallel_type (var_type
, "___XVU");
7099 if (templ_type
!= NULL
)
7100 var_type
= templ_type
;
7102 if (is_unchecked_variant (var_type
, value_type (dval
)))
7105 ada_which_variant_applies (var_type
,
7106 value_type (dval
), value_contents (dval
));
7109 return empty_record (TYPE_OBJFILE (var_type
));
7110 else if (is_dynamic_field (var_type
, which
))
7111 return to_fixed_record_type
7112 (TYPE_TARGET_TYPE (TYPE_FIELD_TYPE (var_type
, which
)),
7113 valaddr
, address
, dval
);
7114 else if (variant_field_index (TYPE_FIELD_TYPE (var_type
, which
)) >= 0)
7116 to_fixed_record_type
7117 (TYPE_FIELD_TYPE (var_type
, which
), valaddr
, address
, dval
);
7119 return TYPE_FIELD_TYPE (var_type
, which
);
7122 /* Assuming that TYPE0 is an array type describing the type of a value
7123 at ADDR, and that DVAL describes a record containing any
7124 discriminants used in TYPE0, returns a type for the value that
7125 contains no dynamic components (that is, no components whose sizes
7126 are determined by run-time quantities). Unless IGNORE_TOO_BIG is
7127 true, gives an error message if the resulting type's size is over
7130 static struct type
*
7131 to_fixed_array_type (struct type
*type0
, struct value
*dval
,
7134 struct type
*index_type_desc
;
7135 struct type
*result
;
7137 if (ada_is_packed_array_type (type0
) /* revisit? */
7138 || TYPE_FIXED_INSTANCE (type0
))
7141 index_type_desc
= ada_find_parallel_type (type0
, "___XA");
7142 if (index_type_desc
== NULL
)
7144 struct type
*elt_type0
= ada_check_typedef (TYPE_TARGET_TYPE (type0
));
7145 /* NOTE: elt_type---the fixed version of elt_type0---should never
7146 depend on the contents of the array in properly constructed
7148 /* Create a fixed version of the array element type.
7149 We're not providing the address of an element here,
7150 and thus the actual object value cannot be inspected to do
7151 the conversion. This should not be a problem, since arrays of
7152 unconstrained objects are not allowed. In particular, all
7153 the elements of an array of a tagged type should all be of
7154 the same type specified in the debugging info. No need to
7155 consult the object tag. */
7156 struct type
*elt_type
= ada_to_fixed_type (elt_type0
, 0, 0, dval
, 1);
7158 if (elt_type0
== elt_type
)
7161 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7162 elt_type
, TYPE_INDEX_TYPE (type0
));
7167 struct type
*elt_type0
;
7170 for (i
= TYPE_NFIELDS (index_type_desc
); i
> 0; i
-= 1)
7171 elt_type0
= TYPE_TARGET_TYPE (elt_type0
);
7173 /* NOTE: result---the fixed version of elt_type0---should never
7174 depend on the contents of the array in properly constructed
7176 /* Create a fixed version of the array element type.
7177 We're not providing the address of an element here,
7178 and thus the actual object value cannot be inspected to do
7179 the conversion. This should not be a problem, since arrays of
7180 unconstrained objects are not allowed. In particular, all
7181 the elements of an array of a tagged type should all be of
7182 the same type specified in the debugging info. No need to
7183 consult the object tag. */
7185 ada_to_fixed_type (ada_check_typedef (elt_type0
), 0, 0, dval
, 1);
7186 for (i
= TYPE_NFIELDS (index_type_desc
) - 1; i
>= 0; i
-= 1)
7188 struct type
*range_type
=
7189 to_fixed_range_type (TYPE_FIELD_NAME (index_type_desc
, i
),
7190 dval
, TYPE_OBJFILE (type0
));
7191 result
= create_array_type (alloc_type (TYPE_OBJFILE (type0
)),
7192 result
, range_type
);
7194 if (!ignore_too_big
&& TYPE_LENGTH (result
) > varsize_limit
)
7195 error (_("array type with dynamic size is larger than varsize-limit"));
7198 TYPE_FIXED_INSTANCE (result
) = 1;
7203 /* A standard type (containing no dynamically sized components)
7204 corresponding to TYPE for the value (TYPE, VALADDR, ADDRESS)
7205 DVAL describes a record containing any discriminants used in TYPE0,
7206 and may be NULL if there are none, or if the object of type TYPE at
7207 ADDRESS or in VALADDR contains these discriminants.
7209 If CHECK_TAG is not null, in the case of tagged types, this function
7210 attempts to locate the object's tag and use it to compute the actual
7211 type. However, when ADDRESS is null, we cannot use it to determine the
7212 location of the tag, and therefore compute the tagged type's actual type.
7213 So we return the tagged type without consulting the tag. */
7215 static struct type
*
7216 ada_to_fixed_type_1 (struct type
*type
, const gdb_byte
*valaddr
,
7217 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7219 type
= ada_check_typedef (type
);
7220 switch (TYPE_CODE (type
))
7224 case TYPE_CODE_STRUCT
:
7226 struct type
*static_type
= to_static_fixed_type (type
);
7227 struct type
*fixed_record_type
=
7228 to_fixed_record_type (type
, valaddr
, address
, NULL
);
7229 /* If STATIC_TYPE is a tagged type and we know the object's address,
7230 then we can determine its tag, and compute the object's actual
7231 type from there. Note that we have to use the fixed record
7232 type (the parent part of the record may have dynamic fields
7233 and the way the location of _tag is expressed may depend on
7236 if (check_tag
&& address
!= 0 && ada_is_tagged_type (static_type
, 0))
7238 struct type
*real_type
=
7239 type_from_tag (value_tag_from_contents_and_address
7243 if (real_type
!= NULL
)
7244 return to_fixed_record_type (real_type
, valaddr
, address
, NULL
);
7247 /* Check to see if there is a parallel ___XVZ variable.
7248 If there is, then it provides the actual size of our type. */
7249 else if (ada_type_name (fixed_record_type
) != NULL
)
7251 char *name
= ada_type_name (fixed_record_type
);
7252 char *xvz_name
= alloca (strlen (name
) + 7 /* "___XVZ\0" */);
7256 xsnprintf (xvz_name
, strlen (name
) + 7, "%s___XVZ", name
);
7257 size
= get_int_var_value (xvz_name
, &xvz_found
);
7258 if (xvz_found
&& TYPE_LENGTH (fixed_record_type
) != size
)
7260 fixed_record_type
= copy_type (fixed_record_type
);
7261 TYPE_LENGTH (fixed_record_type
) = size
;
7263 /* The FIXED_RECORD_TYPE may have be a stub. We have
7264 observed this when the debugging info is STABS, and
7265 apparently it is something that is hard to fix.
7267 In practice, we don't need the actual type definition
7268 at all, because the presence of the XVZ variable allows us
7269 to assume that there must be a XVS type as well, which we
7270 should be able to use later, when we need the actual type
7273 In the meantime, pretend that the "fixed" type we are
7274 returning is NOT a stub, because this can cause trouble
7275 when using this type to create new types targeting it.
7276 Indeed, the associated creation routines often check
7277 whether the target type is a stub and will try to replace
7278 it, thus using a type with the wrong size. This, in turn,
7279 might cause the new type to have the wrong size too.
7280 Consider the case of an array, for instance, where the size
7281 of the array is computed from the number of elements in
7282 our array multiplied by the size of its element. */
7283 TYPE_STUB (fixed_record_type
) = 0;
7286 return fixed_record_type
;
7288 case TYPE_CODE_ARRAY
:
7289 return to_fixed_array_type (type
, dval
, 1);
7290 case TYPE_CODE_UNION
:
7294 return to_fixed_variant_branch_type (type
, valaddr
, address
, dval
);
7298 /* The same as ada_to_fixed_type_1, except that it preserves the type
7299 if it is a TYPE_CODE_TYPEDEF of a type that is already fixed.
7300 ada_to_fixed_type_1 would return the type referenced by TYPE. */
7303 ada_to_fixed_type (struct type
*type
, const gdb_byte
*valaddr
,
7304 CORE_ADDR address
, struct value
*dval
, int check_tag
)
7307 struct type
*fixed_type
=
7308 ada_to_fixed_type_1 (type
, valaddr
, address
, dval
, check_tag
);
7310 if (TYPE_CODE (type
) == TYPE_CODE_TYPEDEF
7311 && TYPE_TARGET_TYPE (type
) == fixed_type
)
7317 /* A standard (static-sized) type corresponding as well as possible to
7318 TYPE0, but based on no runtime data. */
7320 static struct type
*
7321 to_static_fixed_type (struct type
*type0
)
7328 if (TYPE_FIXED_INSTANCE (type0
))
7331 type0
= ada_check_typedef (type0
);
7333 switch (TYPE_CODE (type0
))
7337 case TYPE_CODE_STRUCT
:
7338 type
= dynamic_template_type (type0
);
7340 return template_to_static_fixed_type (type
);
7342 return template_to_static_fixed_type (type0
);
7343 case TYPE_CODE_UNION
:
7344 type
= ada_find_parallel_type (type0
, "___XVU");
7346 return template_to_static_fixed_type (type
);
7348 return template_to_static_fixed_type (type0
);
7352 /* A static approximation of TYPE with all type wrappers removed. */
7354 static struct type
*
7355 static_unwrap_type (struct type
*type
)
7357 if (ada_is_aligner_type (type
))
7359 struct type
*type1
= TYPE_FIELD_TYPE (ada_check_typedef (type
), 0);
7360 if (ada_type_name (type1
) == NULL
)
7361 TYPE_NAME (type1
) = ada_type_name (type
);
7363 return static_unwrap_type (type1
);
7367 struct type
*raw_real_type
= ada_get_base_type (type
);
7368 if (raw_real_type
== type
)
7371 return to_static_fixed_type (raw_real_type
);
7375 /* In some cases, incomplete and private types require
7376 cross-references that are not resolved as records (for example,
7378 type FooP is access Foo;
7380 type Foo is array ...;
7381 ). In these cases, since there is no mechanism for producing
7382 cross-references to such types, we instead substitute for FooP a
7383 stub enumeration type that is nowhere resolved, and whose tag is
7384 the name of the actual type. Call these types "non-record stubs". */
7386 /* A type equivalent to TYPE that is not a non-record stub, if one
7387 exists, otherwise TYPE. */
7390 ada_check_typedef (struct type
*type
)
7395 CHECK_TYPEDEF (type
);
7396 if (type
== NULL
|| TYPE_CODE (type
) != TYPE_CODE_ENUM
7397 || !TYPE_STUB (type
)
7398 || TYPE_TAG_NAME (type
) == NULL
)
7402 char *name
= TYPE_TAG_NAME (type
);
7403 struct type
*type1
= ada_find_any_type (name
);
7404 return (type1
== NULL
) ? type
: type1
;
7408 /* A value representing the data at VALADDR/ADDRESS as described by
7409 type TYPE0, but with a standard (static-sized) type that correctly
7410 describes it. If VAL0 is not NULL and TYPE0 already is a standard
7411 type, then return VAL0 [this feature is simply to avoid redundant
7412 creation of struct values]. */
7414 static struct value
*
7415 ada_to_fixed_value_create (struct type
*type0
, CORE_ADDR address
,
7418 struct type
*type
= ada_to_fixed_type (type0
, 0, address
, NULL
, 1);
7419 if (type
== type0
&& val0
!= NULL
)
7422 return value_from_contents_and_address (type
, 0, address
);
7425 /* A value representing VAL, but with a standard (static-sized) type
7426 that correctly describes it. Does not necessarily create a new
7429 static struct value
*
7430 ada_to_fixed_value (struct value
*val
)
7432 return ada_to_fixed_value_create (value_type (val
),
7433 VALUE_ADDRESS (val
) + value_offset (val
),
7437 /* A value representing VAL, but with a standard (static-sized) type
7438 chosen to approximate the real type of VAL as well as possible, but
7439 without consulting any runtime values. For Ada dynamic-sized
7440 types, therefore, the type of the result is likely to be inaccurate. */
7442 static struct value
*
7443 ada_to_static_fixed_value (struct value
*val
)
7446 to_static_fixed_type (static_unwrap_type (value_type (val
)));
7447 if (type
== value_type (val
))
7450 return coerce_unspec_val_to_type (val
, type
);
7456 /* Table mapping attribute numbers to names.
7457 NOTE: Keep up to date with enum ada_attribute definition in ada-lang.h. */
7459 static const char *attribute_names
[] = {
7477 ada_attribute_name (enum exp_opcode n
)
7479 if (n
>= OP_ATR_FIRST
&& n
<= (int) OP_ATR_VAL
)
7480 return attribute_names
[n
- OP_ATR_FIRST
+ 1];
7482 return attribute_names
[0];
7485 /* Evaluate the 'POS attribute applied to ARG. */
7488 pos_atr (struct value
*arg
)
7490 struct value
*val
= coerce_ref (arg
);
7491 struct type
*type
= value_type (val
);
7493 if (!discrete_type_p (type
))
7494 error (_("'POS only defined on discrete types"));
7496 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7499 LONGEST v
= value_as_long (val
);
7501 for (i
= 0; i
< TYPE_NFIELDS (type
); i
+= 1)
7503 if (v
== TYPE_FIELD_BITPOS (type
, i
))
7506 error (_("enumeration value is invalid: can't find 'POS"));
7509 return value_as_long (val
);
7512 static struct value
*
7513 value_pos_atr (struct type
*type
, struct value
*arg
)
7515 return value_from_longest (type
, pos_atr (arg
));
7518 /* Evaluate the TYPE'VAL attribute applied to ARG. */
7520 static struct value
*
7521 value_val_atr (struct type
*type
, struct value
*arg
)
7523 if (!discrete_type_p (type
))
7524 error (_("'VAL only defined on discrete types"));
7525 if (!integer_type_p (value_type (arg
)))
7526 error (_("'VAL requires integral argument"));
7528 if (TYPE_CODE (type
) == TYPE_CODE_ENUM
)
7530 long pos
= value_as_long (arg
);
7531 if (pos
< 0 || pos
>= TYPE_NFIELDS (type
))
7532 error (_("argument to 'VAL out of range"));
7533 return value_from_longest (type
, TYPE_FIELD_BITPOS (type
, pos
));
7536 return value_from_longest (type
, value_as_long (arg
));
7542 /* True if TYPE appears to be an Ada character type.
7543 [At the moment, this is true only for Character and Wide_Character;
7544 It is a heuristic test that could stand improvement]. */
7547 ada_is_character_type (struct type
*type
)
7551 /* If the type code says it's a character, then assume it really is,
7552 and don't check any further. */
7553 if (TYPE_CODE (type
) == TYPE_CODE_CHAR
)
7556 /* Otherwise, assume it's a character type iff it is a discrete type
7557 with a known character type name. */
7558 name
= ada_type_name (type
);
7559 return (name
!= NULL
7560 && (TYPE_CODE (type
) == TYPE_CODE_INT
7561 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
7562 && (strcmp (name
, "character") == 0
7563 || strcmp (name
, "wide_character") == 0
7564 || strcmp (name
, "wide_wide_character") == 0
7565 || strcmp (name
, "unsigned char") == 0));
7568 /* True if TYPE appears to be an Ada string type. */
7571 ada_is_string_type (struct type
*type
)
7573 type
= ada_check_typedef (type
);
7575 && TYPE_CODE (type
) != TYPE_CODE_PTR
7576 && (ada_is_simple_array_type (type
)
7577 || ada_is_array_descriptor_type (type
))
7578 && ada_array_arity (type
) == 1)
7580 struct type
*elttype
= ada_array_element_type (type
, 1);
7582 return ada_is_character_type (elttype
);
7589 /* True if TYPE is a struct type introduced by the compiler to force the
7590 alignment of a value. Such types have a single field with a
7591 distinctive name. */
7594 ada_is_aligner_type (struct type
*type
)
7596 type
= ada_check_typedef (type
);
7598 /* If we can find a parallel XVS type, then the XVS type should
7599 be used instead of this type. And hence, this is not an aligner
7601 if (ada_find_parallel_type (type
, "___XVS") != NULL
)
7604 return (TYPE_CODE (type
) == TYPE_CODE_STRUCT
7605 && TYPE_NFIELDS (type
) == 1
7606 && strcmp (TYPE_FIELD_NAME (type
, 0), "F") == 0);
7609 /* If there is an ___XVS-convention type parallel to SUBTYPE, return
7610 the parallel type. */
7613 ada_get_base_type (struct type
*raw_type
)
7615 struct type
*real_type_namer
;
7616 struct type
*raw_real_type
;
7618 if (raw_type
== NULL
|| TYPE_CODE (raw_type
) != TYPE_CODE_STRUCT
)
7621 real_type_namer
= ada_find_parallel_type (raw_type
, "___XVS");
7622 if (real_type_namer
== NULL
7623 || TYPE_CODE (real_type_namer
) != TYPE_CODE_STRUCT
7624 || TYPE_NFIELDS (real_type_namer
) != 1)
7627 raw_real_type
= ada_find_any_type (TYPE_FIELD_NAME (real_type_namer
, 0));
7628 if (raw_real_type
== NULL
)
7631 return raw_real_type
;
7634 /* The type of value designated by TYPE, with all aligners removed. */
7637 ada_aligned_type (struct type
*type
)
7639 if (ada_is_aligner_type (type
))
7640 return ada_aligned_type (TYPE_FIELD_TYPE (type
, 0));
7642 return ada_get_base_type (type
);
7646 /* The address of the aligned value in an object at address VALADDR
7647 having type TYPE. Assumes ada_is_aligner_type (TYPE). */
7650 ada_aligned_value_addr (struct type
*type
, const gdb_byte
*valaddr
)
7652 if (ada_is_aligner_type (type
))
7653 return ada_aligned_value_addr (TYPE_FIELD_TYPE (type
, 0),
7655 TYPE_FIELD_BITPOS (type
,
7656 0) / TARGET_CHAR_BIT
);
7663 /* The printed representation of an enumeration literal with encoded
7664 name NAME. The value is good to the next call of ada_enum_name. */
7666 ada_enum_name (const char *name
)
7668 static char *result
;
7669 static size_t result_len
= 0;
7672 /* First, unqualify the enumeration name:
7673 1. Search for the last '.' character. If we find one, then skip
7674 all the preceeding characters, the unqualified name starts
7675 right after that dot.
7676 2. Otherwise, we may be debugging on a target where the compiler
7677 translates dots into "__". Search forward for double underscores,
7678 but stop searching when we hit an overloading suffix, which is
7679 of the form "__" followed by digits. */
7681 tmp
= strrchr (name
, '.');
7686 while ((tmp
= strstr (name
, "__")) != NULL
)
7688 if (isdigit (tmp
[2]))
7698 if (name
[1] == 'U' || name
[1] == 'W')
7700 if (sscanf (name
+ 2, "%x", &v
) != 1)
7706 GROW_VECT (result
, result_len
, 16);
7707 if (isascii (v
) && isprint (v
))
7708 xsnprintf (result
, result_len
, "'%c'", v
);
7709 else if (name
[1] == 'U')
7710 xsnprintf (result
, result_len
, "[\"%02x\"]", v
);
7712 xsnprintf (result
, result_len
, "[\"%04x\"]", v
);
7718 tmp
= strstr (name
, "__");
7720 tmp
= strstr (name
, "$");
7723 GROW_VECT (result
, result_len
, tmp
- name
+ 1);
7724 strncpy (result
, name
, tmp
- name
);
7725 result
[tmp
- name
] = '\0';
7733 static struct value
*
7734 evaluate_subexp (struct type
*expect_type
, struct expression
*exp
, int *pos
,
7737 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7738 (expect_type
, exp
, pos
, noside
);
7741 /* Evaluate the subexpression of EXP starting at *POS as for
7742 evaluate_type, updating *POS to point just past the evaluated
7745 static struct value
*
7746 evaluate_subexp_type (struct expression
*exp
, int *pos
)
7748 return (*exp
->language_defn
->la_exp_desc
->evaluate_exp
)
7749 (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
7752 /* If VAL is wrapped in an aligner or subtype wrapper, return the
7755 static struct value
*
7756 unwrap_value (struct value
*val
)
7758 struct type
*type
= ada_check_typedef (value_type (val
));
7759 if (ada_is_aligner_type (type
))
7761 struct value
*v
= ada_value_struct_elt (val
, "F", 0);
7762 struct type
*val_type
= ada_check_typedef (value_type (v
));
7763 if (ada_type_name (val_type
) == NULL
)
7764 TYPE_NAME (val_type
) = ada_type_name (type
);
7766 return unwrap_value (v
);
7770 struct type
*raw_real_type
=
7771 ada_check_typedef (ada_get_base_type (type
));
7773 if (type
== raw_real_type
)
7777 coerce_unspec_val_to_type
7778 (val
, ada_to_fixed_type (raw_real_type
, 0,
7779 VALUE_ADDRESS (val
) + value_offset (val
),
7784 static struct value
*
7785 cast_to_fixed (struct type
*type
, struct value
*arg
)
7789 if (type
== value_type (arg
))
7791 else if (ada_is_fixed_point_type (value_type (arg
)))
7792 val
= ada_float_to_fixed (type
,
7793 ada_fixed_to_float (value_type (arg
),
7794 value_as_long (arg
)));
7797 DOUBLEST argd
= value_as_double (arg
);
7798 val
= ada_float_to_fixed (type
, argd
);
7801 return value_from_longest (type
, val
);
7804 static struct value
*
7805 cast_from_fixed (struct type
*type
, struct value
*arg
)
7807 DOUBLEST val
= ada_fixed_to_float (value_type (arg
),
7808 value_as_long (arg
));
7809 return value_from_double (type
, val
);
7812 /* Coerce VAL as necessary for assignment to an lval of type TYPE, and
7813 return the converted value. */
7815 static struct value
*
7816 coerce_for_assign (struct type
*type
, struct value
*val
)
7818 struct type
*type2
= value_type (val
);
7822 type2
= ada_check_typedef (type2
);
7823 type
= ada_check_typedef (type
);
7825 if (TYPE_CODE (type2
) == TYPE_CODE_PTR
7826 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7828 val
= ada_value_ind (val
);
7829 type2
= value_type (val
);
7832 if (TYPE_CODE (type2
) == TYPE_CODE_ARRAY
7833 && TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
7835 if (TYPE_LENGTH (type2
) != TYPE_LENGTH (type
)
7836 || TYPE_LENGTH (TYPE_TARGET_TYPE (type2
))
7837 != TYPE_LENGTH (TYPE_TARGET_TYPE (type2
)))
7838 error (_("Incompatible types in assignment"));
7839 deprecated_set_value_type (val
, type
);
7844 static struct value
*
7845 ada_value_binop (struct value
*arg1
, struct value
*arg2
, enum exp_opcode op
)
7848 struct type
*type1
, *type2
;
7851 arg1
= coerce_ref (arg1
);
7852 arg2
= coerce_ref (arg2
);
7853 type1
= base_type (ada_check_typedef (value_type (arg1
)));
7854 type2
= base_type (ada_check_typedef (value_type (arg2
)));
7856 if (TYPE_CODE (type1
) != TYPE_CODE_INT
7857 || TYPE_CODE (type2
) != TYPE_CODE_INT
)
7858 return value_binop (arg1
, arg2
, op
);
7867 return value_binop (arg1
, arg2
, op
);
7870 v2
= value_as_long (arg2
);
7872 error (_("second operand of %s must not be zero."), op_string (op
));
7874 if (TYPE_UNSIGNED (type1
) || op
== BINOP_MOD
)
7875 return value_binop (arg1
, arg2
, op
);
7877 v1
= value_as_long (arg1
);
7882 if (!TRUNCATION_TOWARDS_ZERO
&& v1
* (v1
% v2
) < 0)
7883 v
+= v
> 0 ? -1 : 1;
7891 /* Should not reach this point. */
7895 val
= allocate_value (type1
);
7896 store_unsigned_integer (value_contents_raw (val
),
7897 TYPE_LENGTH (value_type (val
)), v
);
7902 ada_value_equal (struct value
*arg1
, struct value
*arg2
)
7904 if (ada_is_direct_array_type (value_type (arg1
))
7905 || ada_is_direct_array_type (value_type (arg2
)))
7907 /* Automatically dereference any array reference before
7908 we attempt to perform the comparison. */
7909 arg1
= ada_coerce_ref (arg1
);
7910 arg2
= ada_coerce_ref (arg2
);
7912 arg1
= ada_coerce_to_simple_array (arg1
);
7913 arg2
= ada_coerce_to_simple_array (arg2
);
7914 if (TYPE_CODE (value_type (arg1
)) != TYPE_CODE_ARRAY
7915 || TYPE_CODE (value_type (arg2
)) != TYPE_CODE_ARRAY
)
7916 error (_("Attempt to compare array with non-array"));
7917 /* FIXME: The following works only for types whose
7918 representations use all bits (no padding or undefined bits)
7919 and do not have user-defined equality. */
7921 TYPE_LENGTH (value_type (arg1
)) == TYPE_LENGTH (value_type (arg2
))
7922 && memcmp (value_contents (arg1
), value_contents (arg2
),
7923 TYPE_LENGTH (value_type (arg1
))) == 0;
7925 return value_equal (arg1
, arg2
);
7928 /* Total number of component associations in the aggregate starting at
7929 index PC in EXP. Assumes that index PC is the start of an
7933 num_component_specs (struct expression
*exp
, int pc
)
7936 m
= exp
->elts
[pc
+ 1].longconst
;
7939 for (i
= 0; i
< m
; i
+= 1)
7941 switch (exp
->elts
[pc
].opcode
)
7947 n
+= exp
->elts
[pc
+ 1].longconst
;
7950 ada_evaluate_subexp (NULL
, exp
, &pc
, EVAL_SKIP
);
7955 /* Assign the result of evaluating EXP starting at *POS to the INDEXth
7956 component of LHS (a simple array or a record), updating *POS past
7957 the expression, assuming that LHS is contained in CONTAINER. Does
7958 not modify the inferior's memory, nor does it modify LHS (unless
7959 LHS == CONTAINER). */
7962 assign_component (struct value
*container
, struct value
*lhs
, LONGEST index
,
7963 struct expression
*exp
, int *pos
)
7965 struct value
*mark
= value_mark ();
7967 if (TYPE_CODE (value_type (lhs
)) == TYPE_CODE_ARRAY
)
7969 struct value
*index_val
= value_from_longest (builtin_type_int32
, index
);
7970 elt
= unwrap_value (ada_value_subscript (lhs
, 1, &index_val
));
7974 elt
= ada_index_struct_field (index
, lhs
, 0, value_type (lhs
));
7975 elt
= ada_to_fixed_value (unwrap_value (elt
));
7978 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
7979 assign_aggregate (container
, elt
, exp
, pos
, EVAL_NORMAL
);
7981 value_assign_to_component (container
, elt
,
7982 ada_evaluate_subexp (NULL
, exp
, pos
,
7985 value_free_to_mark (mark
);
7988 /* Assuming that LHS represents an lvalue having a record or array
7989 type, and EXP->ELTS[*POS] is an OP_AGGREGATE, evaluate an assignment
7990 of that aggregate's value to LHS, advancing *POS past the
7991 aggregate. NOSIDE is as for evaluate_subexp. CONTAINER is an
7992 lvalue containing LHS (possibly LHS itself). Does not modify
7993 the inferior's memory, nor does it modify the contents of
7994 LHS (unless == CONTAINER). Returns the modified CONTAINER. */
7996 static struct value
*
7997 assign_aggregate (struct value
*container
,
7998 struct value
*lhs
, struct expression
*exp
,
7999 int *pos
, enum noside noside
)
8001 struct type
*lhs_type
;
8002 int n
= exp
->elts
[*pos
+1].longconst
;
8003 LONGEST low_index
, high_index
;
8006 int max_indices
, num_indices
;
8007 int is_array_aggregate
;
8009 struct value
*mark
= value_mark ();
8012 if (noside
!= EVAL_NORMAL
)
8015 for (i
= 0; i
< n
; i
+= 1)
8016 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
8020 container
= ada_coerce_ref (container
);
8021 if (ada_is_direct_array_type (value_type (container
)))
8022 container
= ada_coerce_to_simple_array (container
);
8023 lhs
= ada_coerce_ref (lhs
);
8024 if (!deprecated_value_modifiable (lhs
))
8025 error (_("Left operand of assignment is not a modifiable lvalue."));
8027 lhs_type
= value_type (lhs
);
8028 if (ada_is_direct_array_type (lhs_type
))
8030 lhs
= ada_coerce_to_simple_array (lhs
);
8031 lhs_type
= value_type (lhs
);
8032 low_index
= TYPE_ARRAY_LOWER_BOUND_VALUE (lhs_type
);
8033 high_index
= TYPE_ARRAY_UPPER_BOUND_VALUE (lhs_type
);
8034 is_array_aggregate
= 1;
8036 else if (TYPE_CODE (lhs_type
) == TYPE_CODE_STRUCT
)
8039 high_index
= num_visible_fields (lhs_type
) - 1;
8040 is_array_aggregate
= 0;
8043 error (_("Left-hand side must be array or record."));
8045 num_specs
= num_component_specs (exp
, *pos
- 3);
8046 max_indices
= 4 * num_specs
+ 4;
8047 indices
= alloca (max_indices
* sizeof (indices
[0]));
8048 indices
[0] = indices
[1] = low_index
- 1;
8049 indices
[2] = indices
[3] = high_index
+ 1;
8052 for (i
= 0; i
< n
; i
+= 1)
8054 switch (exp
->elts
[*pos
].opcode
)
8057 aggregate_assign_from_choices (container
, lhs
, exp
, pos
, indices
,
8058 &num_indices
, max_indices
,
8059 low_index
, high_index
);
8062 aggregate_assign_positional (container
, lhs
, exp
, pos
, indices
,
8063 &num_indices
, max_indices
,
8064 low_index
, high_index
);
8068 error (_("Misplaced 'others' clause"));
8069 aggregate_assign_others (container
, lhs
, exp
, pos
, indices
,
8070 num_indices
, low_index
, high_index
);
8073 error (_("Internal error: bad aggregate clause"));
8080 /* Assign into the component of LHS indexed by the OP_POSITIONAL
8081 construct at *POS, updating *POS past the construct, given that
8082 the positions are relative to lower bound LOW, where HIGH is the
8083 upper bound. Record the position in INDICES[0 .. MAX_INDICES-1]
8084 updating *NUM_INDICES as needed. CONTAINER is as for
8085 assign_aggregate. */
8087 aggregate_assign_positional (struct value
*container
,
8088 struct value
*lhs
, struct expression
*exp
,
8089 int *pos
, LONGEST
*indices
, int *num_indices
,
8090 int max_indices
, LONGEST low
, LONGEST high
)
8092 LONGEST ind
= longest_to_int (exp
->elts
[*pos
+ 1].longconst
) + low
;
8094 if (ind
- 1 == high
)
8095 warning (_("Extra components in aggregate ignored."));
8098 add_component_interval (ind
, ind
, indices
, num_indices
, max_indices
);
8100 assign_component (container
, lhs
, ind
, exp
, pos
);
8103 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8106 /* Assign into the components of LHS indexed by the OP_CHOICES
8107 construct at *POS, updating *POS past the construct, given that
8108 the allowable indices are LOW..HIGH. Record the indices assigned
8109 to in INDICES[0 .. MAX_INDICES-1], updating *NUM_INDICES as
8110 needed. CONTAINER is as for assign_aggregate. */
8112 aggregate_assign_from_choices (struct value
*container
,
8113 struct value
*lhs
, struct expression
*exp
,
8114 int *pos
, LONGEST
*indices
, int *num_indices
,
8115 int max_indices
, LONGEST low
, LONGEST high
)
8118 int n_choices
= longest_to_int (exp
->elts
[*pos
+1].longconst
);
8119 int choice_pos
, expr_pc
;
8120 int is_array
= ada_is_direct_array_type (value_type (lhs
));
8122 choice_pos
= *pos
+= 3;
8124 for (j
= 0; j
< n_choices
; j
+= 1)
8125 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8127 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8129 for (j
= 0; j
< n_choices
; j
+= 1)
8131 LONGEST lower
, upper
;
8132 enum exp_opcode op
= exp
->elts
[choice_pos
].opcode
;
8133 if (op
== OP_DISCRETE_RANGE
)
8136 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8138 upper
= value_as_long (ada_evaluate_subexp (NULL
, exp
, pos
,
8143 lower
= value_as_long (ada_evaluate_subexp (NULL
, exp
, &choice_pos
,
8154 name
= &exp
->elts
[choice_pos
+ 2].string
;
8157 name
= SYMBOL_NATURAL_NAME (exp
->elts
[choice_pos
+ 2].symbol
);
8160 error (_("Invalid record component association."));
8162 ada_evaluate_subexp (NULL
, exp
, &choice_pos
, EVAL_SKIP
);
8164 if (! find_struct_field (name
, value_type (lhs
), 0,
8165 NULL
, NULL
, NULL
, NULL
, &ind
))
8166 error (_("Unknown component name: %s."), name
);
8167 lower
= upper
= ind
;
8170 if (lower
<= upper
&& (lower
< low
|| upper
> high
))
8171 error (_("Index in component association out of bounds."));
8173 add_component_interval (lower
, upper
, indices
, num_indices
,
8175 while (lower
<= upper
)
8179 assign_component (container
, lhs
, lower
, exp
, &pos1
);
8185 /* Assign the value of the expression in the OP_OTHERS construct in
8186 EXP at *POS into the components of LHS indexed from LOW .. HIGH that
8187 have not been previously assigned. The index intervals already assigned
8188 are in INDICES[0 .. NUM_INDICES-1]. Updates *POS to after the
8189 OP_OTHERS clause. CONTAINER is as for assign_aggregate*/
8191 aggregate_assign_others (struct value
*container
,
8192 struct value
*lhs
, struct expression
*exp
,
8193 int *pos
, LONGEST
*indices
, int num_indices
,
8194 LONGEST low
, LONGEST high
)
8197 int expr_pc
= *pos
+1;
8199 for (i
= 0; i
< num_indices
- 2; i
+= 2)
8202 for (ind
= indices
[i
+ 1] + 1; ind
< indices
[i
+ 2]; ind
+= 1)
8206 assign_component (container
, lhs
, ind
, exp
, &pos
);
8209 ada_evaluate_subexp (NULL
, exp
, pos
, EVAL_SKIP
);
8212 /* Add the interval [LOW .. HIGH] to the sorted set of intervals
8213 [ INDICES[0] .. INDICES[1] ],..., [ INDICES[*SIZE-2] .. INDICES[*SIZE-1] ],
8214 modifying *SIZE as needed. It is an error if *SIZE exceeds
8215 MAX_SIZE. The resulting intervals do not overlap. */
8217 add_component_interval (LONGEST low
, LONGEST high
,
8218 LONGEST
* indices
, int *size
, int max_size
)
8221 for (i
= 0; i
< *size
; i
+= 2) {
8222 if (high
>= indices
[i
] && low
<= indices
[i
+ 1])
8225 for (kh
= i
+ 2; kh
< *size
; kh
+= 2)
8226 if (high
< indices
[kh
])
8228 if (low
< indices
[i
])
8230 indices
[i
+ 1] = indices
[kh
- 1];
8231 if (high
> indices
[i
+ 1])
8232 indices
[i
+ 1] = high
;
8233 memcpy (indices
+ i
+ 2, indices
+ kh
, *size
- kh
);
8234 *size
-= kh
- i
- 2;
8237 else if (high
< indices
[i
])
8241 if (*size
== max_size
)
8242 error (_("Internal error: miscounted aggregate components."));
8244 for (j
= *size
-1; j
>= i
+2; j
-= 1)
8245 indices
[j
] = indices
[j
- 2];
8247 indices
[i
+ 1] = high
;
8250 /* Perform and Ada cast of ARG2 to type TYPE if the type of ARG2
8253 static struct value
*
8254 ada_value_cast (struct type
*type
, struct value
*arg2
, enum noside noside
)
8256 if (type
== ada_check_typedef (value_type (arg2
)))
8259 if (ada_is_fixed_point_type (type
))
8260 return (cast_to_fixed (type
, arg2
));
8262 if (ada_is_fixed_point_type (value_type (arg2
)))
8263 return cast_from_fixed (type
, arg2
);
8265 return value_cast (type
, arg2
);
8268 static struct value
*
8269 ada_evaluate_subexp (struct type
*expect_type
, struct expression
*exp
,
8270 int *pos
, enum noside noside
)
8273 int tem
, tem2
, tem3
;
8275 struct value
*arg1
= NULL
, *arg2
= NULL
, *arg3
;
8278 struct value
**argvec
;
8282 op
= exp
->elts
[pc
].opcode
;
8288 arg1
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8289 arg1
= unwrap_value (arg1
);
8291 /* If evaluating an OP_DOUBLE and an EXPECT_TYPE was provided,
8292 then we need to perform the conversion manually, because
8293 evaluate_subexp_standard doesn't do it. This conversion is
8294 necessary in Ada because the different kinds of float/fixed
8295 types in Ada have different representations.
8297 Similarly, we need to perform the conversion from OP_LONG
8299 if ((op
== OP_DOUBLE
|| op
== OP_LONG
) && expect_type
!= NULL
)
8300 arg1
= ada_value_cast (expect_type
, arg1
, noside
);
8306 struct value
*result
;
8308 result
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8309 /* The result type will have code OP_STRING, bashed there from
8310 OP_ARRAY. Bash it back. */
8311 if (TYPE_CODE (value_type (result
)) == TYPE_CODE_STRING
)
8312 TYPE_CODE (value_type (result
)) = TYPE_CODE_ARRAY
;
8318 type
= exp
->elts
[pc
+ 1].type
;
8319 arg1
= evaluate_subexp (type
, exp
, pos
, noside
);
8320 if (noside
== EVAL_SKIP
)
8322 arg1
= ada_value_cast (type
, arg1
, noside
);
8327 type
= exp
->elts
[pc
+ 1].type
;
8328 return ada_evaluate_subexp (type
, exp
, pos
, noside
);
8331 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8332 if (exp
->elts
[*pos
].opcode
== OP_AGGREGATE
)
8334 arg1
= assign_aggregate (arg1
, arg1
, exp
, pos
, noside
);
8335 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8337 return ada_value_assign (arg1
, arg1
);
8339 /* Force the evaluation of the rhs ARG2 to the type of the lhs ARG1,
8340 except if the lhs of our assignment is a convenience variable.
8341 In the case of assigning to a convenience variable, the lhs
8342 should be exactly the result of the evaluation of the rhs. */
8343 type
= value_type (arg1
);
8344 if (VALUE_LVAL (arg1
) == lval_internalvar
)
8346 arg2
= evaluate_subexp (type
, exp
, pos
, noside
);
8347 if (noside
== EVAL_SKIP
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8349 if (ada_is_fixed_point_type (value_type (arg1
)))
8350 arg2
= cast_to_fixed (value_type (arg1
), arg2
);
8351 else if (ada_is_fixed_point_type (value_type (arg2
)))
8353 (_("Fixed-point values must be assigned to fixed-point variables"));
8355 arg2
= coerce_for_assign (value_type (arg1
), arg2
);
8356 return ada_value_assign (arg1
, arg2
);
8359 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8360 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8361 if (noside
== EVAL_SKIP
)
8363 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8364 return (value_from_longest
8366 value_as_long (arg1
) + value_as_long (arg2
)));
8367 if ((ada_is_fixed_point_type (value_type (arg1
))
8368 || ada_is_fixed_point_type (value_type (arg2
)))
8369 && value_type (arg1
) != value_type (arg2
))
8370 error (_("Operands of fixed-point addition must have the same type"));
8371 /* Do the addition, and cast the result to the type of the first
8372 argument. We cannot cast the result to a reference type, so if
8373 ARG1 is a reference type, find its underlying type. */
8374 type
= value_type (arg1
);
8375 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8376 type
= TYPE_TARGET_TYPE (type
);
8377 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8378 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_ADD
));
8381 arg1
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8382 arg2
= evaluate_subexp_with_coercion (exp
, pos
, noside
);
8383 if (noside
== EVAL_SKIP
)
8385 if (TYPE_CODE (value_type (arg1
)) == TYPE_CODE_PTR
)
8386 return (value_from_longest
8388 value_as_long (arg1
) - value_as_long (arg2
)));
8389 if ((ada_is_fixed_point_type (value_type (arg1
))
8390 || ada_is_fixed_point_type (value_type (arg2
)))
8391 && value_type (arg1
) != value_type (arg2
))
8392 error (_("Operands of fixed-point subtraction must have the same type"));
8393 /* Do the substraction, and cast the result to the type of the first
8394 argument. We cannot cast the result to a reference type, so if
8395 ARG1 is a reference type, find its underlying type. */
8396 type
= value_type (arg1
);
8397 while (TYPE_CODE (type
) == TYPE_CODE_REF
)
8398 type
= TYPE_TARGET_TYPE (type
);
8399 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8400 return value_cast (type
, value_binop (arg1
, arg2
, BINOP_SUB
));
8406 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8407 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8408 if (noside
== EVAL_SKIP
)
8410 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8412 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8413 return value_zero (value_type (arg1
), not_lval
);
8417 type
= builtin_type (exp
->gdbarch
)->builtin_double
;
8418 if (ada_is_fixed_point_type (value_type (arg1
)))
8419 arg1
= cast_from_fixed (type
, arg1
);
8420 if (ada_is_fixed_point_type (value_type (arg2
)))
8421 arg2
= cast_from_fixed (type
, arg2
);
8422 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8423 return ada_value_binop (arg1
, arg2
, op
);
8427 case BINOP_NOTEQUAL
:
8428 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8429 arg2
= evaluate_subexp (value_type (arg1
), exp
, pos
, noside
);
8430 if (noside
== EVAL_SKIP
)
8432 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8436 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8437 tem
= ada_value_equal (arg1
, arg2
);
8439 if (op
== BINOP_NOTEQUAL
)
8441 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8442 return value_from_longest (type
, (LONGEST
) tem
);
8445 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8446 if (noside
== EVAL_SKIP
)
8448 else if (ada_is_fixed_point_type (value_type (arg1
)))
8449 return value_cast (value_type (arg1
), value_neg (arg1
));
8452 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
8453 return value_neg (arg1
);
8456 case BINOP_LOGICAL_AND
:
8457 case BINOP_LOGICAL_OR
:
8458 case UNOP_LOGICAL_NOT
:
8463 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8464 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8465 return value_cast (type
, val
);
8468 case BINOP_BITWISE_AND
:
8469 case BINOP_BITWISE_IOR
:
8470 case BINOP_BITWISE_XOR
:
8474 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_AVOID_SIDE_EFFECTS
);
8476 val
= evaluate_subexp_standard (expect_type
, exp
, pos
, noside
);
8478 return value_cast (value_type (arg1
), val
);
8484 if (noside
== EVAL_SKIP
)
8489 else if (SYMBOL_DOMAIN (exp
->elts
[pc
+ 2].symbol
) == UNDEF_DOMAIN
)
8490 /* Only encountered when an unresolved symbol occurs in a
8491 context other than a function call, in which case, it is
8493 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8494 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 2].symbol
));
8495 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8497 type
= static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
));
8498 if (ada_is_tagged_type (type
, 0))
8500 /* Tagged types are a little special in the fact that the real
8501 type is dynamic and can only be determined by inspecting the
8502 object's tag. This means that we need to get the object's
8503 value first (EVAL_NORMAL) and then extract the actual object
8506 Note that we cannot skip the final step where we extract
8507 the object type from its tag, because the EVAL_NORMAL phase
8508 results in dynamic components being resolved into fixed ones.
8509 This can cause problems when trying to print the type
8510 description of tagged types whose parent has a dynamic size:
8511 We use the type name of the "_parent" component in order
8512 to print the name of the ancestor type in the type description.
8513 If that component had a dynamic size, the resolution into
8514 a fixed type would result in the loss of that type name,
8515 thus preventing us from printing the name of the ancestor
8516 type in the type description. */
8517 struct type
*actual_type
;
8519 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_NORMAL
);
8520 actual_type
= type_from_tag (ada_value_tag (arg1
));
8521 if (actual_type
== NULL
)
8522 /* If, for some reason, we were unable to determine
8523 the actual type from the tag, then use the static
8524 approximation that we just computed as a fallback.
8525 This can happen if the debugging information is
8526 incomplete, for instance. */
8529 return value_zero (actual_type
, not_lval
);
8534 (to_static_fixed_type
8535 (static_unwrap_type (SYMBOL_TYPE (exp
->elts
[pc
+ 2].symbol
))),
8541 unwrap_value (evaluate_subexp_standard
8542 (expect_type
, exp
, pos
, noside
));
8543 return ada_to_fixed_value (arg1
);
8549 /* Allocate arg vector, including space for the function to be
8550 called in argvec[0] and a terminating NULL. */
8551 nargs
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8553 (struct value
**) alloca (sizeof (struct value
*) * (nargs
+ 2));
8555 if (exp
->elts
[*pos
].opcode
== OP_VAR_VALUE
8556 && SYMBOL_DOMAIN (exp
->elts
[pc
+ 5].symbol
) == UNDEF_DOMAIN
)
8557 error (_("Unexpected unresolved symbol, %s, during evaluation"),
8558 SYMBOL_PRINT_NAME (exp
->elts
[pc
+ 5].symbol
));
8561 for (tem
= 0; tem
<= nargs
; tem
+= 1)
8562 argvec
[tem
] = evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8565 if (noside
== EVAL_SKIP
)
8569 if (ada_is_packed_array_type (desc_base_type (value_type (argvec
[0]))))
8570 argvec
[0] = ada_coerce_to_simple_array (argvec
[0]);
8571 else if (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_REF
8572 || (TYPE_CODE (value_type (argvec
[0])) == TYPE_CODE_ARRAY
8573 && VALUE_LVAL (argvec
[0]) == lval_memory
))
8574 argvec
[0] = value_addr (argvec
[0]);
8576 type
= ada_check_typedef (value_type (argvec
[0]));
8577 if (TYPE_CODE (type
) == TYPE_CODE_PTR
)
8579 switch (TYPE_CODE (ada_check_typedef (TYPE_TARGET_TYPE (type
))))
8581 case TYPE_CODE_FUNC
:
8582 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8584 case TYPE_CODE_ARRAY
:
8586 case TYPE_CODE_STRUCT
:
8587 if (noside
!= EVAL_AVOID_SIDE_EFFECTS
)
8588 argvec
[0] = ada_value_ind (argvec
[0]);
8589 type
= ada_check_typedef (TYPE_TARGET_TYPE (type
));
8592 error (_("cannot subscript or call something of type `%s'"),
8593 ada_type_name (value_type (argvec
[0])));
8598 switch (TYPE_CODE (type
))
8600 case TYPE_CODE_FUNC
:
8601 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8602 return allocate_value (TYPE_TARGET_TYPE (type
));
8603 return call_function_by_hand (argvec
[0], nargs
, argvec
+ 1);
8604 case TYPE_CODE_STRUCT
:
8608 arity
= ada_array_arity (type
);
8609 type
= ada_array_element_type (type
, nargs
);
8611 error (_("cannot subscript or call a record"));
8613 error (_("wrong number of subscripts; expecting %d"), arity
);
8614 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8615 return value_zero (ada_aligned_type (type
), lval_memory
);
8617 unwrap_value (ada_value_subscript
8618 (argvec
[0], nargs
, argvec
+ 1));
8620 case TYPE_CODE_ARRAY
:
8621 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8623 type
= ada_array_element_type (type
, nargs
);
8625 error (_("element type of array unknown"));
8627 return value_zero (ada_aligned_type (type
), lval_memory
);
8630 unwrap_value (ada_value_subscript
8631 (ada_coerce_to_simple_array (argvec
[0]),
8632 nargs
, argvec
+ 1));
8633 case TYPE_CODE_PTR
: /* Pointer to array */
8634 type
= to_fixed_array_type (TYPE_TARGET_TYPE (type
), NULL
, 1);
8635 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8637 type
= ada_array_element_type (type
, nargs
);
8639 error (_("element type of array unknown"));
8641 return value_zero (ada_aligned_type (type
), lval_memory
);
8644 unwrap_value (ada_value_ptr_subscript (argvec
[0], type
,
8645 nargs
, argvec
+ 1));
8648 error (_("Attempt to index or call something other than an "
8649 "array or function"));
8654 struct value
*array
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8655 struct value
*low_bound_val
=
8656 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8657 struct value
*high_bound_val
=
8658 evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8661 low_bound_val
= coerce_ref (low_bound_val
);
8662 high_bound_val
= coerce_ref (high_bound_val
);
8663 low_bound
= pos_atr (low_bound_val
);
8664 high_bound
= pos_atr (high_bound_val
);
8666 if (noside
== EVAL_SKIP
)
8669 /* If this is a reference to an aligner type, then remove all
8671 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8672 && ada_is_aligner_type (TYPE_TARGET_TYPE (value_type (array
))))
8673 TYPE_TARGET_TYPE (value_type (array
)) =
8674 ada_aligned_type (TYPE_TARGET_TYPE (value_type (array
)));
8676 if (ada_is_packed_array_type (value_type (array
)))
8677 error (_("cannot slice a packed array"));
8679 /* If this is a reference to an array or an array lvalue,
8680 convert to a pointer. */
8681 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_REF
8682 || (TYPE_CODE (value_type (array
)) == TYPE_CODE_ARRAY
8683 && VALUE_LVAL (array
) == lval_memory
))
8684 array
= value_addr (array
);
8686 if (noside
== EVAL_AVOID_SIDE_EFFECTS
8687 && ada_is_array_descriptor_type (ada_check_typedef
8688 (value_type (array
))))
8689 return empty_array (ada_type_of_array (array
, 0), low_bound
);
8691 array
= ada_coerce_to_simple_array_ptr (array
);
8693 /* If we have more than one level of pointer indirection,
8694 dereference the value until we get only one level. */
8695 while (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
8696 && (TYPE_CODE (TYPE_TARGET_TYPE (value_type (array
)))
8698 array
= value_ind (array
);
8700 /* Make sure we really do have an array type before going further,
8701 to avoid a SEGV when trying to get the index type or the target
8702 type later down the road if the debug info generated by
8703 the compiler is incorrect or incomplete. */
8704 if (!ada_is_simple_array_type (value_type (array
)))
8705 error (_("cannot take slice of non-array"));
8707 if (TYPE_CODE (value_type (array
)) == TYPE_CODE_PTR
)
8709 if (high_bound
< low_bound
|| noside
== EVAL_AVOID_SIDE_EFFECTS
)
8710 return empty_array (TYPE_TARGET_TYPE (value_type (array
)),
8714 struct type
*arr_type0
=
8715 to_fixed_array_type (TYPE_TARGET_TYPE (value_type (array
)),
8717 return ada_value_slice_from_ptr (array
, arr_type0
,
8718 longest_to_int (low_bound
),
8719 longest_to_int (high_bound
));
8722 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8724 else if (high_bound
< low_bound
)
8725 return empty_array (value_type (array
), low_bound
);
8727 return ada_value_slice (array
, longest_to_int (low_bound
),
8728 longest_to_int (high_bound
));
8733 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8734 type
= check_typedef (exp
->elts
[pc
+ 1].type
);
8736 if (noside
== EVAL_SKIP
)
8739 switch (TYPE_CODE (type
))
8742 lim_warning (_("Membership test incompletely implemented; "
8743 "always returns true"));
8744 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8745 return value_from_longest (type
, (LONGEST
) 1);
8747 case TYPE_CODE_RANGE
:
8748 arg2
= value_from_longest (type
, TYPE_LOW_BOUND (type
));
8749 arg3
= value_from_longest (type
, TYPE_HIGH_BOUND (type
));
8750 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8751 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8752 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8754 value_from_longest (type
,
8755 (value_less (arg1
, arg3
)
8756 || value_equal (arg1
, arg3
))
8757 && (value_less (arg2
, arg1
)
8758 || value_equal (arg2
, arg1
)));
8761 case BINOP_IN_BOUNDS
:
8763 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8764 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8766 if (noside
== EVAL_SKIP
)
8769 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8771 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8772 return value_zero (type
, not_lval
);
8775 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
8777 if (tem
< 1 || tem
> ada_array_arity (value_type (arg2
)))
8778 error (_("invalid dimension number to 'range"));
8780 arg3
= ada_array_bound (arg2
, tem
, 1);
8781 arg2
= ada_array_bound (arg2
, tem
, 0);
8783 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8784 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8785 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8787 value_from_longest (type
,
8788 (value_less (arg1
, arg3
)
8789 || value_equal (arg1
, arg3
))
8790 && (value_less (arg2
, arg1
)
8791 || value_equal (arg2
, arg1
)));
8793 case TERNOP_IN_RANGE
:
8794 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8795 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8796 arg3
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8798 if (noside
== EVAL_SKIP
)
8801 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8802 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg3
);
8803 type
= language_bool_type (exp
->language_defn
, exp
->gdbarch
);
8805 value_from_longest (type
,
8806 (value_less (arg1
, arg3
)
8807 || value_equal (arg1
, arg3
))
8808 && (value_less (arg2
, arg1
)
8809 || value_equal (arg2
, arg1
)));
8815 struct type
*type_arg
;
8816 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
8818 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8820 type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
8824 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8828 if (exp
->elts
[*pos
].opcode
!= OP_LONG
)
8829 error (_("Invalid operand to '%s"), ada_attribute_name (op
));
8830 tem
= longest_to_int (exp
->elts
[*pos
+ 2].longconst
);
8833 if (noside
== EVAL_SKIP
)
8836 if (type_arg
== NULL
)
8838 arg1
= ada_coerce_ref (arg1
);
8840 if (ada_is_packed_array_type (value_type (arg1
)))
8841 arg1
= ada_coerce_to_simple_array (arg1
);
8843 if (tem
< 1 || tem
> ada_array_arity (value_type (arg1
)))
8844 error (_("invalid dimension number to '%s"),
8845 ada_attribute_name (op
));
8847 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8849 type
= ada_index_type (value_type (arg1
), tem
);
8852 (_("attempt to take bound of something that is not an array"));
8853 return allocate_value (type
);
8858 default: /* Should never happen. */
8859 error (_("unexpected attribute encountered"));
8861 return ada_array_bound (arg1
, tem
, 0);
8863 return ada_array_bound (arg1
, tem
, 1);
8865 return ada_array_length (arg1
, tem
);
8868 else if (discrete_type_p (type_arg
))
8870 struct type
*range_type
;
8871 char *name
= ada_type_name (type_arg
);
8873 if (name
!= NULL
&& TYPE_CODE (type_arg
) != TYPE_CODE_ENUM
)
8875 to_fixed_range_type (name
, NULL
, TYPE_OBJFILE (type_arg
));
8876 if (range_type
== NULL
)
8877 range_type
= type_arg
;
8881 error (_("unexpected attribute encountered"));
8883 return value_from_longest
8884 (range_type
, discrete_type_low_bound (range_type
));
8886 return value_from_longest
8887 (range_type
, discrete_type_high_bound (range_type
));
8889 error (_("the 'length attribute applies only to array types"));
8892 else if (TYPE_CODE (type_arg
) == TYPE_CODE_FLT
)
8893 error (_("unimplemented type attribute"));
8898 if (ada_is_packed_array_type (type_arg
))
8899 type_arg
= decode_packed_array_type (type_arg
);
8901 if (tem
< 1 || tem
> ada_array_arity (type_arg
))
8902 error (_("invalid dimension number to '%s"),
8903 ada_attribute_name (op
));
8905 type
= ada_index_type (type_arg
, tem
);
8908 (_("attempt to take bound of something that is not an array"));
8909 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8910 return allocate_value (type
);
8915 error (_("unexpected attribute encountered"));
8917 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8918 return value_from_longest (type
, low
);
8920 high
= ada_array_bound_from_type (type_arg
, tem
, 1, &type
);
8921 return value_from_longest (type
, high
);
8923 low
= ada_array_bound_from_type (type_arg
, tem
, 0, &type
);
8924 high
= ada_array_bound_from_type (type_arg
, tem
, 1, NULL
);
8925 return value_from_longest (type
, high
- low
+ 1);
8931 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8932 if (noside
== EVAL_SKIP
)
8935 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8936 return value_zero (ada_tag_type (arg1
), not_lval
);
8938 return ada_value_tag (arg1
);
8942 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8943 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8944 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8945 if (noside
== EVAL_SKIP
)
8947 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8948 return value_zero (value_type (arg1
), not_lval
);
8951 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
8952 return value_binop (arg1
, arg2
,
8953 op
== OP_ATR_MIN
? BINOP_MIN
: BINOP_MAX
);
8956 case OP_ATR_MODULUS
:
8958 struct type
*type_arg
= check_typedef (exp
->elts
[pc
+ 2].type
);
8959 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8961 if (noside
== EVAL_SKIP
)
8964 if (!ada_is_modular_type (type_arg
))
8965 error (_("'modulus must be applied to modular type"));
8967 return value_from_longest (TYPE_TARGET_TYPE (type_arg
),
8968 ada_modulus (type_arg
));
8973 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
8974 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8975 if (noside
== EVAL_SKIP
)
8977 type
= builtin_type (exp
->gdbarch
)->builtin_int
;
8978 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8979 return value_zero (type
, not_lval
);
8981 return value_pos_atr (type
, arg1
);
8984 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
8985 type
= value_type (arg1
);
8987 /* If the argument is a reference, then dereference its type, since
8988 the user is really asking for the size of the actual object,
8989 not the size of the pointer. */
8990 if (TYPE_CODE (type
) == TYPE_CODE_REF
)
8991 type
= TYPE_TARGET_TYPE (type
);
8993 if (noside
== EVAL_SKIP
)
8995 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
8996 return value_zero (builtin_type_int32
, not_lval
);
8998 return value_from_longest (builtin_type_int32
,
8999 TARGET_CHAR_BIT
* TYPE_LENGTH (type
));
9002 evaluate_subexp (NULL_TYPE
, exp
, pos
, EVAL_SKIP
);
9003 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9004 type
= exp
->elts
[pc
+ 2].type
;
9005 if (noside
== EVAL_SKIP
)
9007 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9008 return value_zero (type
, not_lval
);
9010 return value_val_atr (type
, arg1
);
9013 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9014 arg2
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9015 if (noside
== EVAL_SKIP
)
9017 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9018 return value_zero (value_type (arg1
), not_lval
);
9021 /* For integer exponentiation operations,
9022 only promote the first argument. */
9023 if (is_integral_type (value_type (arg2
)))
9024 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9026 binop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
, &arg2
);
9028 return value_binop (arg1
, arg2
, op
);
9032 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9033 if (noside
== EVAL_SKIP
)
9039 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9040 if (noside
== EVAL_SKIP
)
9042 unop_promote (exp
->language_defn
, exp
->gdbarch
, &arg1
);
9043 if (value_less (arg1
, value_zero (value_type (arg1
), not_lval
)))
9044 return value_neg (arg1
);
9049 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9050 if (noside
== EVAL_SKIP
)
9052 type
= ada_check_typedef (value_type (arg1
));
9053 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9055 if (ada_is_array_descriptor_type (type
))
9056 /* GDB allows dereferencing GNAT array descriptors. */
9058 struct type
*arrType
= ada_type_of_array (arg1
, 0);
9059 if (arrType
== NULL
)
9060 error (_("Attempt to dereference null array pointer."));
9061 return value_at_lazy (arrType
, 0);
9063 else if (TYPE_CODE (type
) == TYPE_CODE_PTR
9064 || TYPE_CODE (type
) == TYPE_CODE_REF
9065 /* In C you can dereference an array to get the 1st elt. */
9066 || TYPE_CODE (type
) == TYPE_CODE_ARRAY
)
9068 type
= to_static_fixed_type
9070 (ada_check_typedef (TYPE_TARGET_TYPE (type
))));
9072 return value_zero (type
, lval_memory
);
9074 else if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9076 /* GDB allows dereferencing an int. */
9077 if (expect_type
== NULL
)
9078 return value_zero (builtin_type (exp
->gdbarch
)->builtin_int
,
9083 to_static_fixed_type (ada_aligned_type (expect_type
));
9084 return value_zero (expect_type
, lval_memory
);
9088 error (_("Attempt to take contents of a non-pointer value."));
9090 arg1
= ada_coerce_ref (arg1
); /* FIXME: What is this for?? */
9091 type
= ada_check_typedef (value_type (arg1
));
9093 if (TYPE_CODE (type
) == TYPE_CODE_INT
)
9094 /* GDB allows dereferencing an int. If we were given
9095 the expect_type, then use that as the target type.
9096 Otherwise, assume that the target type is an int. */
9098 if (expect_type
!= NULL
)
9099 return ada_value_ind (value_cast (lookup_pointer_type (expect_type
),
9102 return value_at_lazy (builtin_type (exp
->gdbarch
)->builtin_int
,
9103 (CORE_ADDR
) value_as_address (arg1
));
9106 if (ada_is_array_descriptor_type (type
))
9107 /* GDB allows dereferencing GNAT array descriptors. */
9108 return ada_coerce_to_simple_array (arg1
);
9110 return ada_value_ind (arg1
);
9112 case STRUCTOP_STRUCT
:
9113 tem
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
9114 (*pos
) += 3 + BYTES_TO_EXP_ELEM (tem
+ 1);
9115 arg1
= evaluate_subexp (NULL_TYPE
, exp
, pos
, noside
);
9116 if (noside
== EVAL_SKIP
)
9118 if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9120 struct type
*type1
= value_type (arg1
);
9121 if (ada_is_tagged_type (type1
, 1))
9123 type
= ada_lookup_struct_elt_type (type1
,
9124 &exp
->elts
[pc
+ 2].string
,
9127 /* In this case, we assume that the field COULD exist
9128 in some extension of the type. Return an object of
9129 "type" void, which will match any formal
9130 (see ada_type_match). */
9131 return value_zero (builtin_type_void
, lval_memory
);
9135 ada_lookup_struct_elt_type (type1
, &exp
->elts
[pc
+ 2].string
, 1,
9138 return value_zero (ada_aligned_type (type
), lval_memory
);
9142 ada_to_fixed_value (unwrap_value
9143 (ada_value_struct_elt
9144 (arg1
, &exp
->elts
[pc
+ 2].string
, 0)));
9146 /* The value is not supposed to be used. This is here to make it
9147 easier to accommodate expressions that contain types. */
9149 if (noside
== EVAL_SKIP
)
9151 else if (noside
== EVAL_AVOID_SIDE_EFFECTS
)
9152 return allocate_value (exp
->elts
[pc
+ 1].type
);
9154 error (_("Attempt to use a type name as an expression"));
9159 case OP_DISCRETE_RANGE
:
9162 if (noside
== EVAL_NORMAL
)
9166 error (_("Undefined name, ambiguous name, or renaming used in "
9167 "component association: %s."), &exp
->elts
[pc
+2].string
);
9169 error (_("Aggregates only allowed on the right of an assignment"));
9171 internal_error (__FILE__
, __LINE__
, _("aggregate apparently mangled"));
9174 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
9176 for (tem
= 0; tem
< nargs
; tem
+= 1)
9177 ada_evaluate_subexp (NULL
, exp
, pos
, noside
);
9182 return value_from_longest (builtin_type_int8
, (LONGEST
) 1);
9188 /* If TYPE encodes an Ada fixed-point type, return the suffix of the
9189 type name that encodes the 'small and 'delta information.
9190 Otherwise, return NULL. */
9193 fixed_type_info (struct type
*type
)
9195 const char *name
= ada_type_name (type
);
9196 enum type_code code
= (type
== NULL
) ? TYPE_CODE_UNDEF
: TYPE_CODE (type
);
9198 if ((code
== TYPE_CODE_INT
|| code
== TYPE_CODE_RANGE
) && name
!= NULL
)
9200 const char *tail
= strstr (name
, "___XF_");
9206 else if (code
== TYPE_CODE_RANGE
&& TYPE_TARGET_TYPE (type
) != type
)
9207 return fixed_type_info (TYPE_TARGET_TYPE (type
));
9212 /* Returns non-zero iff TYPE represents an Ada fixed-point type. */
9215 ada_is_fixed_point_type (struct type
*type
)
9217 return fixed_type_info (type
) != NULL
;
9220 /* Return non-zero iff TYPE represents a System.Address type. */
9223 ada_is_system_address_type (struct type
*type
)
9225 return (TYPE_NAME (type
)
9226 && strcmp (TYPE_NAME (type
), "system__address") == 0);
9229 /* Assuming that TYPE is the representation of an Ada fixed-point
9230 type, return its delta, or -1 if the type is malformed and the
9231 delta cannot be determined. */
9234 ada_delta (struct type
*type
)
9236 const char *encoding
= fixed_type_info (type
);
9239 /* Strictly speaking, num and den are encoded as integer. However,
9240 they may not fit into a long, and they will have to be converted
9241 to DOUBLEST anyway. So scan them as DOUBLEST. */
9242 if (sscanf (encoding
, "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9249 /* Assuming that ada_is_fixed_point_type (TYPE), return the scaling
9250 factor ('SMALL value) associated with the type. */
9253 scaling_factor (struct type
*type
)
9255 const char *encoding
= fixed_type_info (type
);
9256 DOUBLEST num0
, den0
, num1
, den1
;
9259 /* Strictly speaking, num's and den's are encoded as integer. However,
9260 they may not fit into a long, and they will have to be converted
9261 to DOUBLEST anyway. So scan them as DOUBLEST. */
9262 n
= sscanf (encoding
,
9263 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
9264 "_%" DOUBLEST_SCAN_FORMAT
"_%" DOUBLEST_SCAN_FORMAT
,
9265 &num0
, &den0
, &num1
, &den1
);
9276 /* Assuming that X is the representation of a value of fixed-point
9277 type TYPE, return its floating-point equivalent. */
9280 ada_fixed_to_float (struct type
*type
, LONGEST x
)
9282 return (DOUBLEST
) x
*scaling_factor (type
);
9285 /* The representation of a fixed-point value of type TYPE
9286 corresponding to the value X. */
9289 ada_float_to_fixed (struct type
*type
, DOUBLEST x
)
9291 return (LONGEST
) (x
/ scaling_factor (type
) + 0.5);
9295 /* VAX floating formats */
9297 /* Non-zero iff TYPE represents one of the special VAX floating-point
9301 ada_is_vax_floating_type (struct type
*type
)
9304 (ada_type_name (type
) == NULL
) ? 0 : strlen (ada_type_name (type
));
9307 && (TYPE_CODE (type
) == TYPE_CODE_INT
9308 || TYPE_CODE (type
) == TYPE_CODE_RANGE
)
9309 && strncmp (ada_type_name (type
) + name_len
- 6, "___XF", 5) == 0;
9312 /* The type of special VAX floating-point type this is, assuming
9313 ada_is_vax_floating_point. */
9316 ada_vax_float_type_suffix (struct type
*type
)
9318 return ada_type_name (type
)[strlen (ada_type_name (type
)) - 1];
9321 /* A value representing the special debugging function that outputs
9322 VAX floating-point values of the type represented by TYPE. Assumes
9323 ada_is_vax_floating_type (TYPE). */
9326 ada_vax_float_print_function (struct type
*type
)
9328 switch (ada_vax_float_type_suffix (type
))
9331 return get_var_value ("DEBUG_STRING_F", 0);
9333 return get_var_value ("DEBUG_STRING_D", 0);
9335 return get_var_value ("DEBUG_STRING_G", 0);
9337 error (_("invalid VAX floating-point type"));
9344 /* Scan STR beginning at position K for a discriminant name, and
9345 return the value of that discriminant field of DVAL in *PX. If
9346 PNEW_K is not null, put the position of the character beyond the
9347 name scanned in *PNEW_K. Return 1 if successful; return 0 and do
9348 not alter *PX and *PNEW_K if unsuccessful. */
9351 scan_discrim_bound (char *str
, int k
, struct value
*dval
, LONGEST
* px
,
9354 static char *bound_buffer
= NULL
;
9355 static size_t bound_buffer_len
= 0;
9358 struct value
*bound_val
;
9360 if (dval
== NULL
|| str
== NULL
|| str
[k
] == '\0')
9363 pend
= strstr (str
+ k
, "__");
9367 k
+= strlen (bound
);
9371 GROW_VECT (bound_buffer
, bound_buffer_len
, pend
- (str
+ k
) + 1);
9372 bound
= bound_buffer
;
9373 strncpy (bound_buffer
, str
+ k
, pend
- (str
+ k
));
9374 bound
[pend
- (str
+ k
)] = '\0';
9378 bound_val
= ada_search_struct_field (bound
, dval
, 0, value_type (dval
));
9379 if (bound_val
== NULL
)
9382 *px
= value_as_long (bound_val
);
9388 /* Value of variable named NAME in the current environment. If
9389 no such variable found, then if ERR_MSG is null, returns 0, and
9390 otherwise causes an error with message ERR_MSG. */
9392 static struct value
*
9393 get_var_value (char *name
, char *err_msg
)
9395 struct ada_symbol_info
*syms
;
9398 nsyms
= ada_lookup_symbol_list (name
, get_selected_block (0), VAR_DOMAIN
,
9403 if (err_msg
== NULL
)
9406 error (("%s"), err_msg
);
9409 return value_of_variable (syms
[0].sym
, syms
[0].block
);
9412 /* Value of integer variable named NAME in the current environment. If
9413 no such variable found, returns 0, and sets *FLAG to 0. If
9414 successful, sets *FLAG to 1. */
9417 get_int_var_value (char *name
, int *flag
)
9419 struct value
*var_val
= get_var_value (name
, 0);
9431 return value_as_long (var_val
);
9436 /* Return a range type whose base type is that of the range type named
9437 NAME in the current environment, and whose bounds are calculated
9438 from NAME according to the GNAT range encoding conventions.
9439 Extract discriminant values, if needed, from DVAL. If a new type
9440 must be created, allocate in OBJFILE's space. The bounds
9441 information, in general, is encoded in NAME, the base type given in
9442 the named range type. */
9444 static struct type
*
9445 to_fixed_range_type (char *name
, struct value
*dval
, struct objfile
*objfile
)
9447 struct type
*raw_type
= ada_find_any_type (name
);
9448 struct type
*base_type
;
9451 /* Also search primitive types if type symbol could not be found. */
9452 if (raw_type
== NULL
)
9453 raw_type
= language_lookup_primitive_type_by_name
9454 (language_def (language_ada
), current_gdbarch
, name
);
9456 if (raw_type
== NULL
)
9457 base_type
= builtin_type_int32
;
9458 else if (TYPE_CODE (raw_type
) == TYPE_CODE_RANGE
)
9459 base_type
= TYPE_TARGET_TYPE (raw_type
);
9461 base_type
= raw_type
;
9463 subtype_info
= strstr (name
, "___XD");
9464 if (subtype_info
== NULL
)
9466 LONGEST L
= discrete_type_low_bound (raw_type
);
9467 LONGEST U
= discrete_type_high_bound (raw_type
);
9468 if (L
< INT_MIN
|| U
> INT_MAX
)
9471 return create_range_type (alloc_type (objfile
), raw_type
,
9472 discrete_type_low_bound (raw_type
),
9473 discrete_type_high_bound (raw_type
));
9477 static char *name_buf
= NULL
;
9478 static size_t name_len
= 0;
9479 int prefix_len
= subtype_info
- name
;
9485 GROW_VECT (name_buf
, name_len
, prefix_len
+ 5);
9486 strncpy (name_buf
, name
, prefix_len
);
9487 name_buf
[prefix_len
] = '\0';
9490 bounds_str
= strchr (subtype_info
, '_');
9493 if (*subtype_info
== 'L')
9495 if (!ada_scan_number (bounds_str
, n
, &L
, &n
)
9496 && !scan_discrim_bound (bounds_str
, n
, dval
, &L
, &n
))
9498 if (bounds_str
[n
] == '_')
9500 else if (bounds_str
[n
] == '.') /* FIXME? SGI Workshop kludge. */
9507 strcpy (name_buf
+ prefix_len
, "___L");
9508 L
= get_int_var_value (name_buf
, &ok
);
9511 lim_warning (_("Unknown lower bound, using 1."));
9516 if (*subtype_info
== 'U')
9518 if (!ada_scan_number (bounds_str
, n
, &U
, &n
)
9519 && !scan_discrim_bound (bounds_str
, n
, dval
, &U
, &n
))
9525 strcpy (name_buf
+ prefix_len
, "___U");
9526 U
= get_int_var_value (name_buf
, &ok
);
9529 lim_warning (_("Unknown upper bound, using %ld."), (long) L
);
9534 if (objfile
== NULL
)
9535 objfile
= TYPE_OBJFILE (base_type
);
9536 type
= create_range_type (alloc_type (objfile
), base_type
, L
, U
);
9537 TYPE_NAME (type
) = name
;
9542 /* True iff NAME is the name of a range type. */
9545 ada_is_range_type_name (const char *name
)
9547 return (name
!= NULL
&& strstr (name
, "___XD"));
9553 /* True iff TYPE is an Ada modular type. */
9556 ada_is_modular_type (struct type
*type
)
9558 struct type
*subranged_type
= base_type (type
);
9560 return (subranged_type
!= NULL
&& TYPE_CODE (type
) == TYPE_CODE_RANGE
9561 && TYPE_CODE (subranged_type
) == TYPE_CODE_INT
9562 && TYPE_UNSIGNED (subranged_type
));
9565 /* Try to determine the lower and upper bounds of the given modular type
9566 using the type name only. Return non-zero and set L and U as the lower
9567 and upper bounds (respectively) if successful. */
9570 ada_modulus_from_name (struct type
*type
, ULONGEST
*modulus
)
9572 char *name
= ada_type_name (type
);
9580 /* Discrete type bounds are encoded using an __XD suffix. In our case,
9581 we are looking for static bounds, which means an __XDLU suffix.
9582 Moreover, we know that the lower bound of modular types is always
9583 zero, so the actual suffix should start with "__XDLU_0__", and
9584 then be followed by the upper bound value. */
9585 suffix
= strstr (name
, "__XDLU_0__");
9589 if (!ada_scan_number (suffix
, k
, &U
, NULL
))
9592 *modulus
= (ULONGEST
) U
+ 1;
9596 /* Assuming ada_is_modular_type (TYPE), the modulus of TYPE. */
9599 ada_modulus (struct type
*type
)
9603 /* Normally, the modulus of a modular type is equal to the value of
9604 its upper bound + 1. However, the upper bound is currently stored
9605 as an int, which is not always big enough to hold the actual bound
9606 value. To workaround this, try to take advantage of the encoding
9607 that GNAT uses with with discrete types. To avoid some unnecessary
9608 parsing, we do this only when the size of TYPE is greater than
9609 the size of the field holding the bound. */
9610 if (TYPE_LENGTH (type
) > sizeof (TYPE_HIGH_BOUND (type
))
9611 && ada_modulus_from_name (type
, &modulus
))
9614 return (ULONGEST
) (unsigned int) TYPE_HIGH_BOUND (type
) + 1;
9618 /* Ada exception catchpoint support:
9619 ---------------------------------
9621 We support 3 kinds of exception catchpoints:
9622 . catchpoints on Ada exceptions
9623 . catchpoints on unhandled Ada exceptions
9624 . catchpoints on failed assertions
9626 Exceptions raised during failed assertions, or unhandled exceptions
9627 could perfectly be caught with the general catchpoint on Ada exceptions.
9628 However, we can easily differentiate these two special cases, and having
9629 the option to distinguish these two cases from the rest can be useful
9630 to zero-in on certain situations.
9632 Exception catchpoints are a specialized form of breakpoint,
9633 since they rely on inserting breakpoints inside known routines
9634 of the GNAT runtime. The implementation therefore uses a standard
9635 breakpoint structure of the BP_BREAKPOINT type, but with its own set
9638 Support in the runtime for exception catchpoints have been changed
9639 a few times already, and these changes affect the implementation
9640 of these catchpoints. In order to be able to support several
9641 variants of the runtime, we use a sniffer that will determine
9642 the runtime variant used by the program being debugged.
9644 At this time, we do not support the use of conditions on Ada exception
9645 catchpoints. The COND and COND_STRING fields are therefore set
9646 to NULL (most of the time, see below).
9648 Conditions where EXP_STRING, COND, and COND_STRING are used:
9650 When a user specifies the name of a specific exception in the case
9651 of catchpoints on Ada exceptions, we store the name of that exception
9652 in the EXP_STRING. We then translate this request into an actual
9653 condition stored in COND_STRING, and then parse it into an expression
9656 /* The different types of catchpoints that we introduced for catching
9659 enum exception_catchpoint_kind
9662 ex_catch_exception_unhandled
,
9666 /* Ada's standard exceptions. */
9668 static char *standard_exc
[] = {
9675 typedef CORE_ADDR (ada_unhandled_exception_name_addr_ftype
) (void);
9677 /* A structure that describes how to support exception catchpoints
9678 for a given executable. */
9680 struct exception_support_info
9682 /* The name of the symbol to break on in order to insert
9683 a catchpoint on exceptions. */
9684 const char *catch_exception_sym
;
9686 /* The name of the symbol to break on in order to insert
9687 a catchpoint on unhandled exceptions. */
9688 const char *catch_exception_unhandled_sym
;
9690 /* The name of the symbol to break on in order to insert
9691 a catchpoint on failed assertions. */
9692 const char *catch_assert_sym
;
9694 /* Assuming that the inferior just triggered an unhandled exception
9695 catchpoint, this function is responsible for returning the address
9696 in inferior memory where the name of that exception is stored.
9697 Return zero if the address could not be computed. */
9698 ada_unhandled_exception_name_addr_ftype
*unhandled_exception_name_addr
;
9701 static CORE_ADDR
ada_unhandled_exception_name_addr (void);
9702 static CORE_ADDR
ada_unhandled_exception_name_addr_from_raise (void);
9704 /* The following exception support info structure describes how to
9705 implement exception catchpoints with the latest version of the
9706 Ada runtime (as of 2007-03-06). */
9708 static const struct exception_support_info default_exception_support_info
=
9710 "__gnat_debug_raise_exception", /* catch_exception_sym */
9711 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9712 "__gnat_debug_raise_assert_failure", /* catch_assert_sym */
9713 ada_unhandled_exception_name_addr
9716 /* The following exception support info structure describes how to
9717 implement exception catchpoints with a slightly older version
9718 of the Ada runtime. */
9720 static const struct exception_support_info exception_support_info_fallback
=
9722 "__gnat_raise_nodefer_with_msg", /* catch_exception_sym */
9723 "__gnat_unhandled_exception", /* catch_exception_unhandled_sym */
9724 "system__assertions__raise_assert_failure", /* catch_assert_sym */
9725 ada_unhandled_exception_name_addr_from_raise
9728 /* For each executable, we sniff which exception info structure to use
9729 and cache it in the following global variable. */
9731 static const struct exception_support_info
*exception_info
= NULL
;
9733 /* Inspect the Ada runtime and determine which exception info structure
9734 should be used to provide support for exception catchpoints.
9736 This function will always set exception_info, or raise an error. */
9739 ada_exception_support_info_sniffer (void)
9743 /* If the exception info is already known, then no need to recompute it. */
9744 if (exception_info
!= NULL
)
9747 /* Check the latest (default) exception support info. */
9748 sym
= standard_lookup (default_exception_support_info
.catch_exception_sym
,
9752 exception_info
= &default_exception_support_info
;
9756 /* Try our fallback exception suport info. */
9757 sym
= standard_lookup (exception_support_info_fallback
.catch_exception_sym
,
9761 exception_info
= &exception_support_info_fallback
;
9765 /* Sometimes, it is normal for us to not be able to find the routine
9766 we are looking for. This happens when the program is linked with
9767 the shared version of the GNAT runtime, and the program has not been
9768 started yet. Inform the user of these two possible causes if
9771 if (ada_update_initial_language (language_unknown
, NULL
) != language_ada
)
9772 error (_("Unable to insert catchpoint. Is this an Ada main program?"));
9774 /* If the symbol does not exist, then check that the program is
9775 already started, to make sure that shared libraries have been
9776 loaded. If it is not started, this may mean that the symbol is
9777 in a shared library. */
9779 if (ptid_get_pid (inferior_ptid
) == 0)
9780 error (_("Unable to insert catchpoint. Try to start the program first."));
9782 /* At this point, we know that we are debugging an Ada program and
9783 that the inferior has been started, but we still are not able to
9784 find the run-time symbols. That can mean that we are in
9785 configurable run time mode, or that a-except as been optimized
9786 out by the linker... In any case, at this point it is not worth
9787 supporting this feature. */
9789 error (_("Cannot insert catchpoints in this configuration."));
9792 /* An observer of "executable_changed" events.
9793 Its role is to clear certain cached values that need to be recomputed
9794 each time a new executable is loaded by GDB. */
9797 ada_executable_changed_observer (void)
9799 /* If the executable changed, then it is possible that the Ada runtime
9800 is different. So we need to invalidate the exception support info
9802 exception_info
= NULL
;
9805 /* Return the name of the function at PC, NULL if could not find it.
9806 This function only checks the debugging information, not the symbol
9810 function_name_from_pc (CORE_ADDR pc
)
9814 if (!find_pc_partial_function (pc
, &func_name
, NULL
, NULL
))
9820 /* True iff FRAME is very likely to be that of a function that is
9821 part of the runtime system. This is all very heuristic, but is
9822 intended to be used as advice as to what frames are uninteresting
9826 is_known_support_routine (struct frame_info
*frame
)
9828 struct symtab_and_line sal
;
9832 /* If this code does not have any debugging information (no symtab),
9833 This cannot be any user code. */
9835 find_frame_sal (frame
, &sal
);
9836 if (sal
.symtab
== NULL
)
9839 /* If there is a symtab, but the associated source file cannot be
9840 located, then assume this is not user code: Selecting a frame
9841 for which we cannot display the code would not be very helpful
9842 for the user. This should also take care of case such as VxWorks
9843 where the kernel has some debugging info provided for a few units. */
9845 if (symtab_to_fullname (sal
.symtab
) == NULL
)
9848 /* Check the unit filename againt the Ada runtime file naming.
9849 We also check the name of the objfile against the name of some
9850 known system libraries that sometimes come with debugging info
9853 for (i
= 0; known_runtime_file_name_patterns
[i
] != NULL
; i
+= 1)
9855 re_comp (known_runtime_file_name_patterns
[i
]);
9856 if (re_exec (sal
.symtab
->filename
))
9858 if (sal
.symtab
->objfile
!= NULL
9859 && re_exec (sal
.symtab
->objfile
->name
))
9863 /* Check whether the function is a GNAT-generated entity. */
9865 func_name
= function_name_from_pc (get_frame_address_in_block (frame
));
9866 if (func_name
== NULL
)
9869 for (i
= 0; known_auxiliary_function_name_patterns
[i
] != NULL
; i
+= 1)
9871 re_comp (known_auxiliary_function_name_patterns
[i
]);
9872 if (re_exec (func_name
))
9879 /* Find the first frame that contains debugging information and that is not
9880 part of the Ada run-time, starting from FI and moving upward. */
9883 ada_find_printable_frame (struct frame_info
*fi
)
9885 for (; fi
!= NULL
; fi
= get_prev_frame (fi
))
9887 if (!is_known_support_routine (fi
))
9896 /* Assuming that the inferior just triggered an unhandled exception
9897 catchpoint, return the address in inferior memory where the name
9898 of the exception is stored.
9900 Return zero if the address could not be computed. */
9903 ada_unhandled_exception_name_addr (void)
9905 return parse_and_eval_address ("e.full_name");
9908 /* Same as ada_unhandled_exception_name_addr, except that this function
9909 should be used when the inferior uses an older version of the runtime,
9910 where the exception name needs to be extracted from a specific frame
9911 several frames up in the callstack. */
9914 ada_unhandled_exception_name_addr_from_raise (void)
9917 struct frame_info
*fi
;
9919 /* To determine the name of this exception, we need to select
9920 the frame corresponding to RAISE_SYM_NAME. This frame is
9921 at least 3 levels up, so we simply skip the first 3 frames
9922 without checking the name of their associated function. */
9923 fi
= get_current_frame ();
9924 for (frame_level
= 0; frame_level
< 3; frame_level
+= 1)
9926 fi
= get_prev_frame (fi
);
9930 const char *func_name
=
9931 function_name_from_pc (get_frame_address_in_block (fi
));
9932 if (func_name
!= NULL
9933 && strcmp (func_name
, exception_info
->catch_exception_sym
) == 0)
9934 break; /* We found the frame we were looking for... */
9935 fi
= get_prev_frame (fi
);
9942 return parse_and_eval_address ("id.full_name");
9945 /* Assuming the inferior just triggered an Ada exception catchpoint
9946 (of any type), return the address in inferior memory where the name
9947 of the exception is stored, if applicable.
9949 Return zero if the address could not be computed, or if not relevant. */
9952 ada_exception_name_addr_1 (enum exception_catchpoint_kind ex
,
9953 struct breakpoint
*b
)
9957 case ex_catch_exception
:
9958 return (parse_and_eval_address ("e.full_name"));
9961 case ex_catch_exception_unhandled
:
9962 return exception_info
->unhandled_exception_name_addr ();
9965 case ex_catch_assert
:
9966 return 0; /* Exception name is not relevant in this case. */
9970 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
9974 return 0; /* Should never be reached. */
9977 /* Same as ada_exception_name_addr_1, except that it intercepts and contains
9978 any error that ada_exception_name_addr_1 might cause to be thrown.
9979 When an error is intercepted, a warning with the error message is printed,
9980 and zero is returned. */
9983 ada_exception_name_addr (enum exception_catchpoint_kind ex
,
9984 struct breakpoint
*b
)
9986 struct gdb_exception e
;
9987 CORE_ADDR result
= 0;
9989 TRY_CATCH (e
, RETURN_MASK_ERROR
)
9991 result
= ada_exception_name_addr_1 (ex
, b
);
9996 warning (_("failed to get exception name: %s"), e
.message
);
10003 /* Implement the PRINT_IT method in the breakpoint_ops structure
10004 for all exception catchpoint kinds. */
10006 static enum print_stop_action
10007 print_it_exception (enum exception_catchpoint_kind ex
, struct breakpoint
*b
)
10009 const CORE_ADDR addr
= ada_exception_name_addr (ex
, b
);
10010 char exception_name
[256];
10014 read_memory (addr
, exception_name
, sizeof (exception_name
) - 1);
10015 exception_name
[sizeof (exception_name
) - 1] = '\0';
10018 ada_find_printable_frame (get_current_frame ());
10020 annotate_catchpoint (b
->number
);
10023 case ex_catch_exception
:
10025 printf_filtered (_("\nCatchpoint %d, %s at "),
10026 b
->number
, exception_name
);
10028 printf_filtered (_("\nCatchpoint %d, exception at "), b
->number
);
10030 case ex_catch_exception_unhandled
:
10032 printf_filtered (_("\nCatchpoint %d, unhandled %s at "),
10033 b
->number
, exception_name
);
10035 printf_filtered (_("\nCatchpoint %d, unhandled exception at "),
10038 case ex_catch_assert
:
10039 printf_filtered (_("\nCatchpoint %d, failed assertion at "),
10044 return PRINT_SRC_AND_LOC
;
10047 /* Implement the PRINT_ONE method in the breakpoint_ops structure
10048 for all exception catchpoint kinds. */
10051 print_one_exception (enum exception_catchpoint_kind ex
,
10052 struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10054 struct value_print_options opts
;
10056 get_user_print_options (&opts
);
10057 if (opts
.addressprint
)
10059 annotate_field (4);
10060 ui_out_field_core_addr (uiout
, "addr", b
->loc
->address
);
10063 annotate_field (5);
10064 *last_addr
= b
->loc
->address
;
10067 case ex_catch_exception
:
10068 if (b
->exp_string
!= NULL
)
10070 char *msg
= xstrprintf (_("`%s' Ada exception"), b
->exp_string
);
10072 ui_out_field_string (uiout
, "what", msg
);
10076 ui_out_field_string (uiout
, "what", "all Ada exceptions");
10080 case ex_catch_exception_unhandled
:
10081 ui_out_field_string (uiout
, "what", "unhandled Ada exceptions");
10084 case ex_catch_assert
:
10085 ui_out_field_string (uiout
, "what", "failed Ada assertions");
10089 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10094 /* Implement the PRINT_MENTION method in the breakpoint_ops structure
10095 for all exception catchpoint kinds. */
10098 print_mention_exception (enum exception_catchpoint_kind ex
,
10099 struct breakpoint
*b
)
10103 case ex_catch_exception
:
10104 if (b
->exp_string
!= NULL
)
10105 printf_filtered (_("Catchpoint %d: `%s' Ada exception"),
10106 b
->number
, b
->exp_string
);
10108 printf_filtered (_("Catchpoint %d: all Ada exceptions"), b
->number
);
10112 case ex_catch_exception_unhandled
:
10113 printf_filtered (_("Catchpoint %d: unhandled Ada exceptions"),
10117 case ex_catch_assert
:
10118 printf_filtered (_("Catchpoint %d: failed Ada assertions"), b
->number
);
10122 internal_error (__FILE__
, __LINE__
, _("unexpected catchpoint type"));
10127 /* Virtual table for "catch exception" breakpoints. */
10129 static enum print_stop_action
10130 print_it_catch_exception (struct breakpoint
*b
)
10132 return print_it_exception (ex_catch_exception
, b
);
10136 print_one_catch_exception (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10138 print_one_exception (ex_catch_exception
, b
, last_addr
);
10142 print_mention_catch_exception (struct breakpoint
*b
)
10144 print_mention_exception (ex_catch_exception
, b
);
10147 static struct breakpoint_ops catch_exception_breakpoint_ops
=
10151 NULL
, /* breakpoint_hit */
10152 print_it_catch_exception
,
10153 print_one_catch_exception
,
10154 print_mention_catch_exception
10157 /* Virtual table for "catch exception unhandled" breakpoints. */
10159 static enum print_stop_action
10160 print_it_catch_exception_unhandled (struct breakpoint
*b
)
10162 return print_it_exception (ex_catch_exception_unhandled
, b
);
10166 print_one_catch_exception_unhandled (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10168 print_one_exception (ex_catch_exception_unhandled
, b
, last_addr
);
10172 print_mention_catch_exception_unhandled (struct breakpoint
*b
)
10174 print_mention_exception (ex_catch_exception_unhandled
, b
);
10177 static struct breakpoint_ops catch_exception_unhandled_breakpoint_ops
= {
10180 NULL
, /* breakpoint_hit */
10181 print_it_catch_exception_unhandled
,
10182 print_one_catch_exception_unhandled
,
10183 print_mention_catch_exception_unhandled
10186 /* Virtual table for "catch assert" breakpoints. */
10188 static enum print_stop_action
10189 print_it_catch_assert (struct breakpoint
*b
)
10191 return print_it_exception (ex_catch_assert
, b
);
10195 print_one_catch_assert (struct breakpoint
*b
, CORE_ADDR
*last_addr
)
10197 print_one_exception (ex_catch_assert
, b
, last_addr
);
10201 print_mention_catch_assert (struct breakpoint
*b
)
10203 print_mention_exception (ex_catch_assert
, b
);
10206 static struct breakpoint_ops catch_assert_breakpoint_ops
= {
10209 NULL
, /* breakpoint_hit */
10210 print_it_catch_assert
,
10211 print_one_catch_assert
,
10212 print_mention_catch_assert
10215 /* Return non-zero if B is an Ada exception catchpoint. */
10218 ada_exception_catchpoint_p (struct breakpoint
*b
)
10220 return (b
->ops
== &catch_exception_breakpoint_ops
10221 || b
->ops
== &catch_exception_unhandled_breakpoint_ops
10222 || b
->ops
== &catch_assert_breakpoint_ops
);
10225 /* Return a newly allocated copy of the first space-separated token
10226 in ARGSP, and then adjust ARGSP to point immediately after that
10229 Return NULL if ARGPS does not contain any more tokens. */
10232 ada_get_next_arg (char **argsp
)
10234 char *args
= *argsp
;
10238 /* Skip any leading white space. */
10240 while (isspace (*args
))
10243 if (args
[0] == '\0')
10244 return NULL
; /* No more arguments. */
10246 /* Find the end of the current argument. */
10249 while (*end
!= '\0' && !isspace (*end
))
10252 /* Adjust ARGSP to point to the start of the next argument. */
10256 /* Make a copy of the current argument and return it. */
10258 result
= xmalloc (end
- args
+ 1);
10259 strncpy (result
, args
, end
- args
);
10260 result
[end
- args
] = '\0';
10265 /* Split the arguments specified in a "catch exception" command.
10266 Set EX to the appropriate catchpoint type.
10267 Set EXP_STRING to the name of the specific exception if
10268 specified by the user. */
10271 catch_ada_exception_command_split (char *args
,
10272 enum exception_catchpoint_kind
*ex
,
10275 struct cleanup
*old_chain
= make_cleanup (null_cleanup
, NULL
);
10276 char *exception_name
;
10278 exception_name
= ada_get_next_arg (&args
);
10279 make_cleanup (xfree
, exception_name
);
10281 /* Check that we do not have any more arguments. Anything else
10284 while (isspace (*args
))
10287 if (args
[0] != '\0')
10288 error (_("Junk at end of expression"));
10290 discard_cleanups (old_chain
);
10292 if (exception_name
== NULL
)
10294 /* Catch all exceptions. */
10295 *ex
= ex_catch_exception
;
10296 *exp_string
= NULL
;
10298 else if (strcmp (exception_name
, "unhandled") == 0)
10300 /* Catch unhandled exceptions. */
10301 *ex
= ex_catch_exception_unhandled
;
10302 *exp_string
= NULL
;
10306 /* Catch a specific exception. */
10307 *ex
= ex_catch_exception
;
10308 *exp_string
= exception_name
;
10312 /* Return the name of the symbol on which we should break in order to
10313 implement a catchpoint of the EX kind. */
10315 static const char *
10316 ada_exception_sym_name (enum exception_catchpoint_kind ex
)
10318 gdb_assert (exception_info
!= NULL
);
10322 case ex_catch_exception
:
10323 return (exception_info
->catch_exception_sym
);
10325 case ex_catch_exception_unhandled
:
10326 return (exception_info
->catch_exception_unhandled_sym
);
10328 case ex_catch_assert
:
10329 return (exception_info
->catch_assert_sym
);
10332 internal_error (__FILE__
, __LINE__
,
10333 _("unexpected catchpoint kind (%d)"), ex
);
10337 /* Return the breakpoint ops "virtual table" used for catchpoints
10340 static struct breakpoint_ops
*
10341 ada_exception_breakpoint_ops (enum exception_catchpoint_kind ex
)
10345 case ex_catch_exception
:
10346 return (&catch_exception_breakpoint_ops
);
10348 case ex_catch_exception_unhandled
:
10349 return (&catch_exception_unhandled_breakpoint_ops
);
10351 case ex_catch_assert
:
10352 return (&catch_assert_breakpoint_ops
);
10355 internal_error (__FILE__
, __LINE__
,
10356 _("unexpected catchpoint kind (%d)"), ex
);
10360 /* Return the condition that will be used to match the current exception
10361 being raised with the exception that the user wants to catch. This
10362 assumes that this condition is used when the inferior just triggered
10363 an exception catchpoint.
10365 The string returned is a newly allocated string that needs to be
10366 deallocated later. */
10369 ada_exception_catchpoint_cond_string (const char *exp_string
)
10373 /* The standard exceptions are a special case. They are defined in
10374 runtime units that have been compiled without debugging info; if
10375 EXP_STRING is the not-fully-qualified name of a standard
10376 exception (e.g. "constraint_error") then, during the evaluation
10377 of the condition expression, the symbol lookup on this name would
10378 *not* return this standard exception. The catchpoint condition
10379 may then be set only on user-defined exceptions which have the
10380 same not-fully-qualified name (e.g. my_package.constraint_error).
10382 To avoid this unexcepted behavior, these standard exceptions are
10383 systematically prefixed by "standard". This means that "catch
10384 exception constraint_error" is rewritten into "catch exception
10385 standard.constraint_error".
10387 If an exception named contraint_error is defined in another package of
10388 the inferior program, then the only way to specify this exception as a
10389 breakpoint condition is to use its fully-qualified named:
10390 e.g. my_package.constraint_error. */
10392 for (i
= 0; i
< sizeof (standard_exc
) / sizeof (char *); i
++)
10394 if (strcmp (standard_exc
[i
], exp_string
) == 0)
10396 return xstrprintf ("long_integer (e) = long_integer (&standard.%s)",
10400 return xstrprintf ("long_integer (e) = long_integer (&%s)", exp_string
);
10403 /* Return the expression corresponding to COND_STRING evaluated at SAL. */
10405 static struct expression
*
10406 ada_parse_catchpoint_condition (char *cond_string
,
10407 struct symtab_and_line sal
)
10409 return (parse_exp_1 (&cond_string
, block_for_pc (sal
.pc
), 0));
10412 /* Return the symtab_and_line that should be used to insert an exception
10413 catchpoint of the TYPE kind.
10415 EX_STRING should contain the name of a specific exception
10416 that the catchpoint should catch, or NULL otherwise.
10418 The idea behind all the remaining parameters is that their names match
10419 the name of certain fields in the breakpoint structure that are used to
10420 handle exception catchpoints. This function returns the value to which
10421 these fields should be set, depending on the type of catchpoint we need
10424 If COND and COND_STRING are both non-NULL, any value they might
10425 hold will be free'ed, and then replaced by newly allocated ones.
10426 These parameters are left untouched otherwise. */
10428 static struct symtab_and_line
10429 ada_exception_sal (enum exception_catchpoint_kind ex
, char *exp_string
,
10430 char **addr_string
, char **cond_string
,
10431 struct expression
**cond
, struct breakpoint_ops
**ops
)
10433 const char *sym_name
;
10434 struct symbol
*sym
;
10435 struct symtab_and_line sal
;
10437 /* First, find out which exception support info to use. */
10438 ada_exception_support_info_sniffer ();
10440 /* Then lookup the function on which we will break in order to catch
10441 the Ada exceptions requested by the user. */
10443 sym_name
= ada_exception_sym_name (ex
);
10444 sym
= standard_lookup (sym_name
, NULL
, VAR_DOMAIN
);
10446 /* The symbol we're looking up is provided by a unit in the GNAT runtime
10447 that should be compiled with debugging information. As a result, we
10448 expect to find that symbol in the symtabs. If we don't find it, then
10449 the target most likely does not support Ada exceptions, or we cannot
10450 insert exception breakpoints yet, because the GNAT runtime hasn't been
10453 /* brobecker/2006-12-26: It is conceivable that the runtime was compiled
10454 in such a way that no debugging information is produced for the symbol
10455 we are looking for. In this case, we could search the minimal symbols
10456 as a fall-back mechanism. This would still be operating in degraded
10457 mode, however, as we would still be missing the debugging information
10458 that is needed in order to extract the name of the exception being
10459 raised (this name is printed in the catchpoint message, and is also
10460 used when trying to catch a specific exception). We do not handle
10461 this case for now. */
10464 error (_("Unable to break on '%s' in this configuration."), sym_name
);
10466 /* Make sure that the symbol we found corresponds to a function. */
10467 if (SYMBOL_CLASS (sym
) != LOC_BLOCK
)
10468 error (_("Symbol \"%s\" is not a function (class = %d)"),
10469 sym_name
, SYMBOL_CLASS (sym
));
10471 sal
= find_function_start_sal (sym
, 1);
10473 /* Set ADDR_STRING. */
10475 *addr_string
= xstrdup (sym_name
);
10477 /* Set the COND and COND_STRING (if not NULL). */
10479 if (cond_string
!= NULL
&& cond
!= NULL
)
10481 if (*cond_string
!= NULL
)
10483 xfree (*cond_string
);
10484 *cond_string
= NULL
;
10491 if (exp_string
!= NULL
)
10493 *cond_string
= ada_exception_catchpoint_cond_string (exp_string
);
10494 *cond
= ada_parse_catchpoint_condition (*cond_string
, sal
);
10499 *ops
= ada_exception_breakpoint_ops (ex
);
10504 /* Parse the arguments (ARGS) of the "catch exception" command.
10506 Set TYPE to the appropriate exception catchpoint type.
10507 If the user asked the catchpoint to catch only a specific
10508 exception, then save the exception name in ADDR_STRING.
10510 See ada_exception_sal for a description of all the remaining
10511 function arguments of this function. */
10513 struct symtab_and_line
10514 ada_decode_exception_location (char *args
, char **addr_string
,
10515 char **exp_string
, char **cond_string
,
10516 struct expression
**cond
,
10517 struct breakpoint_ops
**ops
)
10519 enum exception_catchpoint_kind ex
;
10521 catch_ada_exception_command_split (args
, &ex
, exp_string
);
10522 return ada_exception_sal (ex
, *exp_string
, addr_string
, cond_string
,
10526 struct symtab_and_line
10527 ada_decode_assert_location (char *args
, char **addr_string
,
10528 struct breakpoint_ops
**ops
)
10530 /* Check that no argument where provided at the end of the command. */
10534 while (isspace (*args
))
10537 error (_("Junk at end of arguments."));
10540 return ada_exception_sal (ex_catch_assert
, NULL
, addr_string
, NULL
, NULL
,
10545 /* Information about operators given special treatment in functions
10547 /* Format: OP_DEFN (<operator>, <operator length>, <# args>, <binop>). */
10549 #define ADA_OPERATORS \
10550 OP_DEFN (OP_VAR_VALUE, 4, 0, 0) \
10551 OP_DEFN (BINOP_IN_BOUNDS, 3, 2, 0) \
10552 OP_DEFN (TERNOP_IN_RANGE, 1, 3, 0) \
10553 OP_DEFN (OP_ATR_FIRST, 1, 2, 0) \
10554 OP_DEFN (OP_ATR_LAST, 1, 2, 0) \
10555 OP_DEFN (OP_ATR_LENGTH, 1, 2, 0) \
10556 OP_DEFN (OP_ATR_IMAGE, 1, 2, 0) \
10557 OP_DEFN (OP_ATR_MAX, 1, 3, 0) \
10558 OP_DEFN (OP_ATR_MIN, 1, 3, 0) \
10559 OP_DEFN (OP_ATR_MODULUS, 1, 1, 0) \
10560 OP_DEFN (OP_ATR_POS, 1, 2, 0) \
10561 OP_DEFN (OP_ATR_SIZE, 1, 1, 0) \
10562 OP_DEFN (OP_ATR_TAG, 1, 1, 0) \
10563 OP_DEFN (OP_ATR_VAL, 1, 2, 0) \
10564 OP_DEFN (UNOP_QUAL, 3, 1, 0) \
10565 OP_DEFN (UNOP_IN_RANGE, 3, 1, 0) \
10566 OP_DEFN (OP_OTHERS, 1, 1, 0) \
10567 OP_DEFN (OP_POSITIONAL, 3, 1, 0) \
10568 OP_DEFN (OP_DISCRETE_RANGE, 1, 2, 0)
10571 ada_operator_length (struct expression
*exp
, int pc
, int *oplenp
, int *argsp
)
10573 switch (exp
->elts
[pc
- 1].opcode
)
10576 operator_length_standard (exp
, pc
, oplenp
, argsp
);
10579 #define OP_DEFN(op, len, args, binop) \
10580 case op: *oplenp = len; *argsp = args; break;
10586 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
);
10591 *argsp
= longest_to_int (exp
->elts
[pc
- 2].longconst
) + 1;
10597 ada_op_name (enum exp_opcode opcode
)
10602 return op_name_standard (opcode
);
10604 #define OP_DEFN(op, len, args, binop) case op: return #op;
10609 return "OP_AGGREGATE";
10611 return "OP_CHOICES";
10617 /* As for operator_length, but assumes PC is pointing at the first
10618 element of the operator, and gives meaningful results only for the
10619 Ada-specific operators, returning 0 for *OPLENP and *ARGSP otherwise. */
10622 ada_forward_operator_length (struct expression
*exp
, int pc
,
10623 int *oplenp
, int *argsp
)
10625 switch (exp
->elts
[pc
].opcode
)
10628 *oplenp
= *argsp
= 0;
10631 #define OP_DEFN(op, len, args, binop) \
10632 case op: *oplenp = len; *argsp = args; break;
10638 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10643 *argsp
= longest_to_int (exp
->elts
[pc
+ 1].longconst
) + 1;
10649 int len
= longest_to_int (exp
->elts
[pc
+ 1].longconst
);
10650 *oplenp
= 4 + BYTES_TO_EXP_ELEM (len
+ 1);
10658 ada_dump_subexp_body (struct expression
*exp
, struct ui_file
*stream
, int elt
)
10660 enum exp_opcode op
= exp
->elts
[elt
].opcode
;
10665 ada_forward_operator_length (exp
, elt
, &oplen
, &nargs
);
10669 /* Ada attributes ('Foo). */
10672 case OP_ATR_LENGTH
:
10676 case OP_ATR_MODULUS
:
10683 case UNOP_IN_RANGE
:
10685 /* XXX: gdb_sprint_host_address, type_sprint */
10686 fprintf_filtered (stream
, _("Type @"));
10687 gdb_print_host_address (exp
->elts
[pc
+ 1].type
, stream
);
10688 fprintf_filtered (stream
, " (");
10689 type_print (exp
->elts
[pc
+ 1].type
, NULL
, stream
, 0);
10690 fprintf_filtered (stream
, ")");
10692 case BINOP_IN_BOUNDS
:
10693 fprintf_filtered (stream
, " (%d)",
10694 longest_to_int (exp
->elts
[pc
+ 2].longconst
));
10696 case TERNOP_IN_RANGE
:
10701 case OP_DISCRETE_RANGE
:
10702 case OP_POSITIONAL
:
10709 char *name
= &exp
->elts
[elt
+ 2].string
;
10710 int len
= longest_to_int (exp
->elts
[elt
+ 1].longconst
);
10711 fprintf_filtered (stream
, "Text: `%.*s'", len
, name
);
10716 return dump_subexp_body_standard (exp
, stream
, elt
);
10720 for (i
= 0; i
< nargs
; i
+= 1)
10721 elt
= dump_subexp (exp
, stream
, elt
);
10726 /* The Ada extension of print_subexp (q.v.). */
10729 ada_print_subexp (struct expression
*exp
, int *pos
,
10730 struct ui_file
*stream
, enum precedence prec
)
10732 int oplen
, nargs
, i
;
10734 enum exp_opcode op
= exp
->elts
[pc
].opcode
;
10736 ada_forward_operator_length (exp
, pc
, &oplen
, &nargs
);
10743 print_subexp_standard (exp
, pos
, stream
, prec
);
10747 fputs_filtered (SYMBOL_NATURAL_NAME (exp
->elts
[pc
+ 2].symbol
), stream
);
10750 case BINOP_IN_BOUNDS
:
10751 /* XXX: sprint_subexp */
10752 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10753 fputs_filtered (" in ", stream
);
10754 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10755 fputs_filtered ("'range", stream
);
10756 if (exp
->elts
[pc
+ 1].longconst
> 1)
10757 fprintf_filtered (stream
, "(%ld)",
10758 (long) exp
->elts
[pc
+ 1].longconst
);
10761 case TERNOP_IN_RANGE
:
10762 if (prec
>= PREC_EQUAL
)
10763 fputs_filtered ("(", stream
);
10764 /* XXX: sprint_subexp */
10765 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10766 fputs_filtered (" in ", stream
);
10767 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10768 fputs_filtered (" .. ", stream
);
10769 print_subexp (exp
, pos
, stream
, PREC_EQUAL
);
10770 if (prec
>= PREC_EQUAL
)
10771 fputs_filtered (")", stream
);
10776 case OP_ATR_LENGTH
:
10780 case OP_ATR_MODULUS
:
10785 if (exp
->elts
[*pos
].opcode
== OP_TYPE
)
10787 if (TYPE_CODE (exp
->elts
[*pos
+ 1].type
) != TYPE_CODE_VOID
)
10788 LA_PRINT_TYPE (exp
->elts
[*pos
+ 1].type
, "", stream
, 0, 0);
10792 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10793 fprintf_filtered (stream
, "'%s", ada_attribute_name (op
));
10797 for (tem
= 1; tem
< nargs
; tem
+= 1)
10799 fputs_filtered ((tem
== 1) ? " (" : ", ", stream
);
10800 print_subexp (exp
, pos
, stream
, PREC_ABOVE_COMMA
);
10802 fputs_filtered (")", stream
);
10807 type_print (exp
->elts
[pc
+ 1].type
, "", stream
, 0);
10808 fputs_filtered ("'(", stream
);
10809 print_subexp (exp
, pos
, stream
, PREC_PREFIX
);
10810 fputs_filtered (")", stream
);
10813 case UNOP_IN_RANGE
:
10814 /* XXX: sprint_subexp */
10815 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10816 fputs_filtered (" in ", stream
);
10817 LA_PRINT_TYPE (exp
->elts
[pc
+ 1].type
, "", stream
, 1, 0);
10820 case OP_DISCRETE_RANGE
:
10821 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10822 fputs_filtered ("..", stream
);
10823 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10827 fputs_filtered ("others => ", stream
);
10828 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10832 for (i
= 0; i
< nargs
-1; i
+= 1)
10835 fputs_filtered ("|", stream
);
10836 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10838 fputs_filtered (" => ", stream
);
10839 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10842 case OP_POSITIONAL
:
10843 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10847 fputs_filtered ("(", stream
);
10848 for (i
= 0; i
< nargs
; i
+= 1)
10851 fputs_filtered (", ", stream
);
10852 print_subexp (exp
, pos
, stream
, PREC_SUFFIX
);
10854 fputs_filtered (")", stream
);
10859 /* Table mapping opcodes into strings for printing operators
10860 and precedences of the operators. */
10862 static const struct op_print ada_op_print_tab
[] = {
10863 {":=", BINOP_ASSIGN
, PREC_ASSIGN
, 1},
10864 {"or else", BINOP_LOGICAL_OR
, PREC_LOGICAL_OR
, 0},
10865 {"and then", BINOP_LOGICAL_AND
, PREC_LOGICAL_AND
, 0},
10866 {"or", BINOP_BITWISE_IOR
, PREC_BITWISE_IOR
, 0},
10867 {"xor", BINOP_BITWISE_XOR
, PREC_BITWISE_XOR
, 0},
10868 {"and", BINOP_BITWISE_AND
, PREC_BITWISE_AND
, 0},
10869 {"=", BINOP_EQUAL
, PREC_EQUAL
, 0},
10870 {"/=", BINOP_NOTEQUAL
, PREC_EQUAL
, 0},
10871 {"<=", BINOP_LEQ
, PREC_ORDER
, 0},
10872 {">=", BINOP_GEQ
, PREC_ORDER
, 0},
10873 {">", BINOP_GTR
, PREC_ORDER
, 0},
10874 {"<", BINOP_LESS
, PREC_ORDER
, 0},
10875 {">>", BINOP_RSH
, PREC_SHIFT
, 0},
10876 {"<<", BINOP_LSH
, PREC_SHIFT
, 0},
10877 {"+", BINOP_ADD
, PREC_ADD
, 0},
10878 {"-", BINOP_SUB
, PREC_ADD
, 0},
10879 {"&", BINOP_CONCAT
, PREC_ADD
, 0},
10880 {"*", BINOP_MUL
, PREC_MUL
, 0},
10881 {"/", BINOP_DIV
, PREC_MUL
, 0},
10882 {"rem", BINOP_REM
, PREC_MUL
, 0},
10883 {"mod", BINOP_MOD
, PREC_MUL
, 0},
10884 {"**", BINOP_EXP
, PREC_REPEAT
, 0},
10885 {"@", BINOP_REPEAT
, PREC_REPEAT
, 0},
10886 {"-", UNOP_NEG
, PREC_PREFIX
, 0},
10887 {"+", UNOP_PLUS
, PREC_PREFIX
, 0},
10888 {"not ", UNOP_LOGICAL_NOT
, PREC_PREFIX
, 0},
10889 {"not ", UNOP_COMPLEMENT
, PREC_PREFIX
, 0},
10890 {"abs ", UNOP_ABS
, PREC_PREFIX
, 0},
10891 {".all", UNOP_IND
, PREC_SUFFIX
, 1},
10892 {"'access", UNOP_ADDR
, PREC_SUFFIX
, 1},
10893 {"'size", OP_ATR_SIZE
, PREC_SUFFIX
, 1},
10897 enum ada_primitive_types
{
10898 ada_primitive_type_int
,
10899 ada_primitive_type_long
,
10900 ada_primitive_type_short
,
10901 ada_primitive_type_char
,
10902 ada_primitive_type_float
,
10903 ada_primitive_type_double
,
10904 ada_primitive_type_void
,
10905 ada_primitive_type_long_long
,
10906 ada_primitive_type_long_double
,
10907 ada_primitive_type_natural
,
10908 ada_primitive_type_positive
,
10909 ada_primitive_type_system_address
,
10910 nr_ada_primitive_types
10914 ada_language_arch_info (struct gdbarch
*gdbarch
,
10915 struct language_arch_info
*lai
)
10917 const struct builtin_type
*builtin
= builtin_type (gdbarch
);
10918 lai
->primitive_type_vector
10919 = GDBARCH_OBSTACK_CALLOC (gdbarch
, nr_ada_primitive_types
+ 1,
10921 lai
->primitive_type_vector
[ada_primitive_type_int
] =
10922 init_type (TYPE_CODE_INT
,
10923 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10924 0, "integer", (struct objfile
*) NULL
);
10925 lai
->primitive_type_vector
[ada_primitive_type_long
] =
10926 init_type (TYPE_CODE_INT
,
10927 gdbarch_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10928 0, "long_integer", (struct objfile
*) NULL
);
10929 lai
->primitive_type_vector
[ada_primitive_type_short
] =
10930 init_type (TYPE_CODE_INT
,
10931 gdbarch_short_bit (gdbarch
) / TARGET_CHAR_BIT
,
10932 0, "short_integer", (struct objfile
*) NULL
);
10933 lai
->string_char_type
=
10934 lai
->primitive_type_vector
[ada_primitive_type_char
] =
10935 init_type (TYPE_CODE_INT
, TARGET_CHAR_BIT
/ TARGET_CHAR_BIT
,
10936 0, "character", (struct objfile
*) NULL
);
10937 lai
->primitive_type_vector
[ada_primitive_type_float
] =
10938 init_type (TYPE_CODE_FLT
,
10939 gdbarch_float_bit (gdbarch
)/ TARGET_CHAR_BIT
,
10940 0, "float", (struct objfile
*) NULL
);
10941 lai
->primitive_type_vector
[ada_primitive_type_double
] =
10942 init_type (TYPE_CODE_FLT
,
10943 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10944 0, "long_float", (struct objfile
*) NULL
);
10945 lai
->primitive_type_vector
[ada_primitive_type_long_long
] =
10946 init_type (TYPE_CODE_INT
,
10947 gdbarch_long_long_bit (gdbarch
) / TARGET_CHAR_BIT
,
10948 0, "long_long_integer", (struct objfile
*) NULL
);
10949 lai
->primitive_type_vector
[ada_primitive_type_long_double
] =
10950 init_type (TYPE_CODE_FLT
,
10951 gdbarch_double_bit (gdbarch
) / TARGET_CHAR_BIT
,
10952 0, "long_long_float", (struct objfile
*) NULL
);
10953 lai
->primitive_type_vector
[ada_primitive_type_natural
] =
10954 init_type (TYPE_CODE_INT
,
10955 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10956 0, "natural", (struct objfile
*) NULL
);
10957 lai
->primitive_type_vector
[ada_primitive_type_positive
] =
10958 init_type (TYPE_CODE_INT
,
10959 gdbarch_int_bit (gdbarch
) / TARGET_CHAR_BIT
,
10960 0, "positive", (struct objfile
*) NULL
);
10961 lai
->primitive_type_vector
[ada_primitive_type_void
] = builtin
->builtin_void
;
10963 lai
->primitive_type_vector
[ada_primitive_type_system_address
] =
10964 lookup_pointer_type (init_type (TYPE_CODE_VOID
, 1, 0, "void",
10965 (struct objfile
*) NULL
));
10966 TYPE_NAME (lai
->primitive_type_vector
[ada_primitive_type_system_address
])
10967 = "system__address";
10969 lai
->bool_type_symbol
= NULL
;
10970 lai
->bool_type_default
= builtin
->builtin_bool
;
10973 /* Language vector */
10975 /* Not really used, but needed in the ada_language_defn. */
10978 emit_char (int c
, struct type
*type
, struct ui_file
*stream
, int quoter
)
10980 ada_emit_char (c
, type
, stream
, quoter
, 1);
10986 warnings_issued
= 0;
10987 return ada_parse ();
10990 static const struct exp_descriptor ada_exp_descriptor
= {
10992 ada_operator_length
,
10994 ada_dump_subexp_body
,
10995 ada_evaluate_subexp
10998 const struct language_defn ada_language_defn
= {
10999 "ada", /* Language name */
11003 case_sensitive_on
, /* Yes, Ada is case-insensitive, but
11004 that's not quite what this means. */
11006 macro_expansion_no
,
11007 &ada_exp_descriptor
,
11011 ada_printchar
, /* Print a character constant */
11012 ada_printstr
, /* Function to print string constant */
11013 emit_char
, /* Function to print single char (not used) */
11014 ada_print_type
, /* Print a type using appropriate syntax */
11015 default_print_typedef
, /* Print a typedef using appropriate syntax */
11016 ada_val_print
, /* Print a value using appropriate syntax */
11017 ada_value_print
, /* Print a top-level value */
11018 NULL
, /* Language specific skip_trampoline */
11019 NULL
, /* name_of_this */
11020 ada_lookup_symbol_nonlocal
, /* Looking up non-local symbols. */
11021 basic_lookup_transparent_type
, /* lookup_transparent_type */
11022 ada_la_decode
, /* Language specific symbol demangler */
11023 NULL
, /* Language specific class_name_from_physname */
11024 ada_op_print_tab
, /* expression operators for printing */
11025 0, /* c-style arrays */
11026 1, /* String lower bound */
11027 ada_get_gdb_completer_word_break_characters
,
11028 ada_make_symbol_completion_list
,
11029 ada_language_arch_info
,
11030 ada_print_array_index
,
11031 default_pass_by_reference
,
11036 /* Provide a prototype to silence -Wmissing-prototypes. */
11037 extern initialize_file_ftype _initialize_ada_language
;
11040 _initialize_ada_language (void)
11042 add_language (&ada_language_defn
);
11044 varsize_limit
= 65536;
11046 obstack_init (&symbol_list_obstack
);
11048 decoded_names_store
= htab_create_alloc
11049 (256, htab_hash_string
, (int (*)(const void *, const void *)) streq
,
11050 NULL
, xcalloc
, xfree
);
11052 observer_attach_executable_changed (ada_executable_changed_observer
);